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))
1492 if (DECL_THREAD_LOCAL_P (x))
1494 if (DECL_HAS_VALUE_EXPR_P (x))
1496 tree value = get_base_address (DECL_VALUE_EXPR (x));
1498 if (value && DECL_P (value) && DECL_THREAD_LOCAL_P (value))
1501 return !TREE_READONLY (x);
1503 if (/* FIXME: This condition should actually go below in the
1504 tm_log_add() call, however is_call_clobbered() depends on
1505 aliasing info which is not available during
1506 gimplification. Since requires_barrier() gets called
1507 during lower_sequence_tm/gimplification, leave the call
1508 to needs_to_live_in_memory until we eliminate
1509 lower_sequence_tm altogether. */
1510 needs_to_live_in_memory (x))
1513 /* For local memory that doesn't escape (aka thread private memory),
1514 we can either save the value at the beginning of the transaction and
1515 restore on restart, or call a tm function to dynamically save and
1516 restore on restart (ITM_L*). */
1518 tm_log_add (entry_block, orig, stmt);
1526 /* Mark the GIMPLE_ASSIGN statement as appropriate for being inside
1527 a transaction region. */
1530 examine_assign_tm (unsigned *state, gimple_stmt_iterator *gsi)
1532 gimple stmt = gsi_stmt (*gsi);
1534 if (requires_barrier (/*entry_block=*/NULL, gimple_assign_rhs1 (stmt), NULL))
1535 *state |= GTMA_HAVE_LOAD;
1536 if (requires_barrier (/*entry_block=*/NULL, gimple_assign_lhs (stmt), NULL))
1537 *state |= GTMA_HAVE_STORE;
1540 /* Mark a GIMPLE_CALL as appropriate for being inside a transaction. */
1543 examine_call_tm (unsigned *state, gimple_stmt_iterator *gsi)
1545 gimple stmt = gsi_stmt (*gsi);
1548 if (is_tm_pure_call (stmt))
1551 /* Check if this call is a transaction abort. */
1552 fn = gimple_call_fndecl (stmt);
1553 if (is_tm_abort (fn))
1554 *state |= GTMA_HAVE_ABORT;
1556 /* Note that something may happen. */
1557 *state |= GTMA_HAVE_LOAD | GTMA_HAVE_STORE;
1560 /* Lower a GIMPLE_TRANSACTION statement. */
1563 lower_transaction (gimple_stmt_iterator *gsi, struct walk_stmt_info *wi)
1565 gimple g, stmt = gsi_stmt (*gsi);
1566 unsigned int *outer_state = (unsigned int *) wi->info;
1567 unsigned int this_state = 0;
1568 struct walk_stmt_info this_wi;
1570 /* First, lower the body. The scanning that we do inside gives
1571 us some idea of what we're dealing with. */
1572 memset (&this_wi, 0, sizeof (this_wi));
1573 this_wi.info = (void *) &this_state;
1574 walk_gimple_seq (gimple_transaction_body (stmt),
1575 lower_sequence_tm, NULL, &this_wi);
1577 /* If there was absolutely nothing transaction related inside the
1578 transaction, we may elide it. Likewise if this is a nested
1579 transaction and does not contain an abort. */
1581 || (!(this_state & GTMA_HAVE_ABORT) && outer_state != NULL))
1584 *outer_state |= this_state;
1586 gsi_insert_seq_before (gsi, gimple_transaction_body (stmt),
1588 gimple_transaction_set_body (stmt, NULL);
1590 gsi_remove (gsi, true);
1591 wi->removed_stmt = true;
1595 /* Wrap the body of the transaction in a try-finally node so that
1596 the commit call is always properly called. */
1597 g = gimple_build_call (builtin_decl_explicit (BUILT_IN_TM_COMMIT), 0);
1598 if (flag_exceptions)
1601 gimple_seq n_seq, e_seq;
1603 n_seq = gimple_seq_alloc_with_stmt (g);
1604 e_seq = gimple_seq_alloc ();
1606 g = gimple_build_call (builtin_decl_explicit (BUILT_IN_EH_POINTER),
1607 1, integer_zero_node);
1608 ptr = create_tmp_var (ptr_type_node, NULL);
1609 gimple_call_set_lhs (g, ptr);
1610 gimple_seq_add_stmt (&e_seq, g);
1612 g = gimple_build_call (builtin_decl_explicit (BUILT_IN_TM_COMMIT_EH),
1614 gimple_seq_add_stmt (&e_seq, g);
1616 g = gimple_build_eh_else (n_seq, e_seq);
1619 g = gimple_build_try (gimple_transaction_body (stmt),
1620 gimple_seq_alloc_with_stmt (g), GIMPLE_TRY_FINALLY);
1621 gsi_insert_after (gsi, g, GSI_CONTINUE_LINKING);
1623 gimple_transaction_set_body (stmt, NULL);
1625 /* If the transaction calls abort or if this is an outer transaction,
1626 add an "over" label afterwards. */
1627 if ((this_state & (GTMA_HAVE_ABORT))
1628 || (gimple_transaction_subcode(stmt) & GTMA_IS_OUTER))
1630 tree label = create_artificial_label (UNKNOWN_LOCATION);
1631 gimple_transaction_set_label (stmt, label);
1632 gsi_insert_after (gsi, gimple_build_label (label), GSI_CONTINUE_LINKING);
1635 /* Record the set of operations found for use later. */
1636 this_state |= gimple_transaction_subcode (stmt) & GTMA_DECLARATION_MASK;
1637 gimple_transaction_set_subcode (stmt, this_state);
1640 /* Iterate through the statements in the sequence, lowering them all
1641 as appropriate for being in a transaction. */
1644 lower_sequence_tm (gimple_stmt_iterator *gsi, bool *handled_ops_p,
1645 struct walk_stmt_info *wi)
1647 unsigned int *state = (unsigned int *) wi->info;
1648 gimple stmt = gsi_stmt (*gsi);
1650 *handled_ops_p = true;
1651 switch (gimple_code (stmt))
1654 /* Only memory reads/writes need to be instrumented. */
1655 if (gimple_assign_single_p (stmt))
1656 examine_assign_tm (state, gsi);
1660 examine_call_tm (state, gsi);
1664 *state |= GTMA_MAY_ENTER_IRREVOCABLE;
1667 case GIMPLE_TRANSACTION:
1668 lower_transaction (gsi, wi);
1672 *handled_ops_p = !gimple_has_substatements (stmt);
1679 /* Iterate through the statements in the sequence, lowering them all
1680 as appropriate for being outside of a transaction. */
1683 lower_sequence_no_tm (gimple_stmt_iterator *gsi, bool *handled_ops_p,
1684 struct walk_stmt_info * wi)
1686 gimple stmt = gsi_stmt (*gsi);
1688 if (gimple_code (stmt) == GIMPLE_TRANSACTION)
1690 *handled_ops_p = true;
1691 lower_transaction (gsi, wi);
1694 *handled_ops_p = !gimple_has_substatements (stmt);
1699 /* Main entry point for flattening GIMPLE_TRANSACTION constructs. After
1700 this, GIMPLE_TRANSACTION nodes still exist, but the nested body has
1701 been moved out, and all the data required for constructing a proper
1702 CFG has been recorded. */
1705 execute_lower_tm (void)
1707 struct walk_stmt_info wi;
1709 /* Transactional clones aren't created until a later pass. */
1710 gcc_assert (!decl_is_tm_clone (current_function_decl));
1712 memset (&wi, 0, sizeof (wi));
1713 walk_gimple_seq (gimple_body (current_function_decl),
1714 lower_sequence_no_tm, NULL, &wi);
1719 struct gimple_opt_pass pass_lower_tm =
1723 "tmlower", /* name */
1725 execute_lower_tm, /* execute */
1728 0, /* static_pass_number */
1729 TV_TRANS_MEM, /* tv_id */
1730 PROP_gimple_lcf, /* properties_required */
1731 0, /* properties_provided */
1732 0, /* properties_destroyed */
1733 0, /* todo_flags_start */
1734 TODO_dump_func /* todo_flags_finish */
1738 /* Collect region information for each transaction. */
1742 /* Link to the next unnested transaction. */
1743 struct tm_region *next;
1745 /* Link to the next inner transaction. */
1746 struct tm_region *inner;
1748 /* Link to the next outer transaction. */
1749 struct tm_region *outer;
1751 /* The GIMPLE_TRANSACTION statement beginning this transaction. */
1752 gimple transaction_stmt;
1754 /* The entry block to this region. */
1755 basic_block entry_block;
1757 /* The set of all blocks that end the region; NULL if only EXIT_BLOCK.
1758 These blocks are still a part of the region (i.e., the border is
1759 inclusive). Note that this set is only complete for paths in the CFG
1760 starting at ENTRY_BLOCK, and that there is no exit block recorded for
1761 the edge to the "over" label. */
1764 /* The set of all blocks that have an TM_IRREVOCABLE call. */
1768 /* True if there are pending edge statements to be committed for the
1769 current function being scanned in the tmmark pass. */
1770 bool pending_edge_inserts_p;
1772 static struct tm_region *all_tm_regions;
1773 static bitmap_obstack tm_obstack;
1776 /* A subroutine of tm_region_init. Record the existance of the
1777 GIMPLE_TRANSACTION statement in a tree of tm_region elements. */
1779 static struct tm_region *
1780 tm_region_init_0 (struct tm_region *outer, basic_block bb, gimple stmt)
1782 struct tm_region *region;
1784 region = (struct tm_region *)
1785 obstack_alloc (&tm_obstack.obstack, sizeof (struct tm_region));
1789 region->next = outer->inner;
1790 outer->inner = region;
1794 region->next = all_tm_regions;
1795 all_tm_regions = region;
1797 region->inner = NULL;
1798 region->outer = outer;
1800 region->transaction_stmt = stmt;
1802 /* There are either one or two edges out of the block containing
1803 the GIMPLE_TRANSACTION, one to the actual region and one to the
1804 "over" label if the region contains an abort. The former will
1805 always be the one marked FALLTHRU. */
1806 region->entry_block = FALLTHRU_EDGE (bb)->dest;
1808 region->exit_blocks = BITMAP_ALLOC (&tm_obstack);
1809 region->irr_blocks = BITMAP_ALLOC (&tm_obstack);
1814 /* A subroutine of tm_region_init. Record all the exit and
1815 irrevocable blocks in BB into the region's exit_blocks and
1816 irr_blocks bitmaps. Returns the new region being scanned. */
1818 static struct tm_region *
1819 tm_region_init_1 (struct tm_region *region, basic_block bb)
1821 gimple_stmt_iterator gsi;
1825 || (!region->irr_blocks && !region->exit_blocks))
1828 /* Check to see if this is the end of a region by seeing if it
1829 contains a call to __builtin_tm_commit{,_eh}. Note that the
1830 outermost region for DECL_IS_TM_CLONE need not collect this. */
1831 for (gsi = gsi_last_bb (bb); !gsi_end_p (gsi); gsi_prev (&gsi))
1834 if (gimple_code (g) == GIMPLE_CALL)
1836 tree fn = gimple_call_fndecl (g);
1837 if (fn && DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL)
1839 if ((DECL_FUNCTION_CODE (fn) == BUILT_IN_TM_COMMIT
1840 || DECL_FUNCTION_CODE (fn) == BUILT_IN_TM_COMMIT_EH)
1841 && region->exit_blocks)
1843 bitmap_set_bit (region->exit_blocks, bb->index);
1844 region = region->outer;
1847 if (DECL_FUNCTION_CODE (fn) == BUILT_IN_TM_IRREVOCABLE)
1848 bitmap_set_bit (region->irr_blocks, bb->index);
1855 /* Collect all of the transaction regions within the current function
1856 and record them in ALL_TM_REGIONS. The REGION parameter may specify
1857 an "outermost" region for use by tm clones. */
1860 tm_region_init (struct tm_region *region)
1866 VEC(basic_block, heap) *queue = NULL;
1867 bitmap visited_blocks = BITMAP_ALLOC (NULL);
1868 struct tm_region *old_region;
1870 all_tm_regions = region;
1871 bb = single_succ (ENTRY_BLOCK_PTR);
1873 VEC_safe_push (basic_block, heap, queue, bb);
1874 gcc_assert (!bb->aux); /* FIXME: Remove me. */
1878 bb = VEC_pop (basic_block, queue);
1879 region = (struct tm_region *)bb->aux;
1882 /* Record exit and irrevocable blocks. */
1883 region = tm_region_init_1 (region, bb);
1885 /* Check for the last statement in the block beginning a new region. */
1887 old_region = region;
1888 if (g && gimple_code (g) == GIMPLE_TRANSACTION)
1889 region = tm_region_init_0 (region, bb, g);
1891 /* Process subsequent blocks. */
1892 FOR_EACH_EDGE (e, ei, bb->succs)
1893 if (!bitmap_bit_p (visited_blocks, e->dest->index))
1895 bitmap_set_bit (visited_blocks, e->dest->index);
1896 VEC_safe_push (basic_block, heap, queue, e->dest);
1897 gcc_assert (!e->dest->aux); /* FIXME: Remove me. */
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 e->dest->aux = old_region;
1905 e->dest->aux = region;
1908 while (!VEC_empty (basic_block, queue));
1909 VEC_free (basic_block, heap, queue);
1910 BITMAP_FREE (visited_blocks);
1913 /* The "gate" function for all transactional memory expansion and optimization
1914 passes. We collect region information for each top-level transaction, and
1915 if we don't find any, we skip all of the TM passes. Each region will have
1916 all of the exit blocks recorded, and the originating statement. */
1924 calculate_dominance_info (CDI_DOMINATORS);
1925 bitmap_obstack_initialize (&tm_obstack);
1927 /* If the function is a TM_CLONE, then the entire function is the region. */
1928 if (decl_is_tm_clone (current_function_decl))
1930 struct tm_region *region = (struct tm_region *)
1931 obstack_alloc (&tm_obstack.obstack, sizeof (struct tm_region));
1932 memset (region, 0, sizeof (*region));
1933 region->entry_block = single_succ (ENTRY_BLOCK_PTR);
1934 /* For a clone, the entire function is the region. But even if
1935 we don't need to record any exit blocks, we may need to
1936 record irrevocable blocks. */
1937 region->irr_blocks = BITMAP_ALLOC (&tm_obstack);
1939 tm_region_init (region);
1943 tm_region_init (NULL);
1945 /* If we didn't find any regions, cleanup and skip the whole tree
1946 of tm-related optimizations. */
1947 if (all_tm_regions == NULL)
1949 bitmap_obstack_release (&tm_obstack);
1957 struct gimple_opt_pass pass_tm_init =
1961 "*tminit", /* name */
1962 gate_tm_init, /* gate */
1966 0, /* static_pass_number */
1967 TV_TRANS_MEM, /* tv_id */
1968 PROP_ssa | PROP_cfg, /* properties_required */
1969 0, /* properties_provided */
1970 0, /* properties_destroyed */
1971 0, /* todo_flags_start */
1972 0, /* todo_flags_finish */
1976 /* Add FLAGS to the GIMPLE_TRANSACTION subcode for the transaction region
1977 represented by STATE. */
1980 transaction_subcode_ior (struct tm_region *region, unsigned flags)
1982 if (region && region->transaction_stmt)
1984 flags |= gimple_transaction_subcode (region->transaction_stmt);
1985 gimple_transaction_set_subcode (region->transaction_stmt, flags);
1989 /* Construct a memory load in a transactional context. Return the
1990 gimple statement performing the load, or NULL if there is no
1991 TM_LOAD builtin of the appropriate size to do the load.
1993 LOC is the location to use for the new statement(s). */
1996 build_tm_load (location_t loc, tree lhs, tree rhs, gimple_stmt_iterator *gsi)
1998 enum built_in_function code = END_BUILTINS;
1999 tree t, type = TREE_TYPE (rhs), decl;
2002 if (type == float_type_node)
2003 code = BUILT_IN_TM_LOAD_FLOAT;
2004 else if (type == double_type_node)
2005 code = BUILT_IN_TM_LOAD_DOUBLE;
2006 else if (type == long_double_type_node)
2007 code = BUILT_IN_TM_LOAD_LDOUBLE;
2008 else if (TYPE_SIZE_UNIT (type) != NULL
2009 && host_integerp (TYPE_SIZE_UNIT (type), 1))
2011 switch (tree_low_cst (TYPE_SIZE_UNIT (type), 1))
2014 code = BUILT_IN_TM_LOAD_1;
2017 code = BUILT_IN_TM_LOAD_2;
2020 code = BUILT_IN_TM_LOAD_4;
2023 code = BUILT_IN_TM_LOAD_8;
2028 if (code == END_BUILTINS)
2030 decl = targetm.vectorize.builtin_tm_load (type);
2035 decl = builtin_decl_explicit (code);
2037 t = gimplify_addr (gsi, rhs);
2038 gcall = gimple_build_call (decl, 1, t);
2039 gimple_set_location (gcall, loc);
2041 t = TREE_TYPE (TREE_TYPE (decl));
2042 if (useless_type_conversion_p (type, t))
2044 gimple_call_set_lhs (gcall, lhs);
2045 gsi_insert_before (gsi, gcall, GSI_SAME_STMT);
2052 temp = make_rename_temp (t, NULL);
2053 gimple_call_set_lhs (gcall, temp);
2054 gsi_insert_before (gsi, gcall, GSI_SAME_STMT);
2056 t = fold_build1 (VIEW_CONVERT_EXPR, type, temp);
2057 g = gimple_build_assign (lhs, t);
2058 gsi_insert_before (gsi, g, GSI_SAME_STMT);
2065 /* Similarly for storing TYPE in a transactional context. */
2068 build_tm_store (location_t loc, tree lhs, tree rhs, gimple_stmt_iterator *gsi)
2070 enum built_in_function code = END_BUILTINS;
2071 tree t, fn, type = TREE_TYPE (rhs), simple_type;
2074 if (type == float_type_node)
2075 code = BUILT_IN_TM_STORE_FLOAT;
2076 else if (type == double_type_node)
2077 code = BUILT_IN_TM_STORE_DOUBLE;
2078 else if (type == long_double_type_node)
2079 code = BUILT_IN_TM_STORE_LDOUBLE;
2080 else if (TYPE_SIZE_UNIT (type) != NULL
2081 && host_integerp (TYPE_SIZE_UNIT (type), 1))
2083 switch (tree_low_cst (TYPE_SIZE_UNIT (type), 1))
2086 code = BUILT_IN_TM_STORE_1;
2089 code = BUILT_IN_TM_STORE_2;
2092 code = BUILT_IN_TM_STORE_4;
2095 code = BUILT_IN_TM_STORE_8;
2100 if (code == END_BUILTINS)
2102 fn = targetm.vectorize.builtin_tm_store (type);
2107 fn = builtin_decl_explicit (code);
2109 simple_type = TREE_VALUE (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (fn))));
2111 if (TREE_CODE (rhs) == CONSTRUCTOR)
2113 /* Handle the easy initialization to zero. */
2114 if (CONSTRUCTOR_ELTS (rhs) == 0)
2115 rhs = build_int_cst (simple_type, 0);
2118 /* ...otherwise punt to the caller and probably use
2119 BUILT_IN_TM_MEMMOVE, because we can't wrap a
2120 VIEW_CONVERT_EXPR around a CONSTRUCTOR (below) and produce
2125 else if (!useless_type_conversion_p (simple_type, type))
2130 temp = make_rename_temp (simple_type, NULL);
2131 t = fold_build1 (VIEW_CONVERT_EXPR, simple_type, rhs);
2132 g = gimple_build_assign (temp, t);
2133 gimple_set_location (g, loc);
2134 gsi_insert_before (gsi, g, GSI_SAME_STMT);
2139 t = gimplify_addr (gsi, lhs);
2140 gcall = gimple_build_call (fn, 2, t, rhs);
2141 gimple_set_location (gcall, loc);
2142 gsi_insert_before (gsi, gcall, GSI_SAME_STMT);
2148 /* Expand an assignment statement into transactional builtins. */
2151 expand_assign_tm (struct tm_region *region, gimple_stmt_iterator *gsi)
2153 gimple stmt = gsi_stmt (*gsi);
2154 location_t loc = gimple_location (stmt);
2155 tree lhs = gimple_assign_lhs (stmt);
2156 tree rhs = gimple_assign_rhs1 (stmt);
2157 bool store_p = requires_barrier (region->entry_block, lhs, NULL);
2158 bool load_p = requires_barrier (region->entry_block, rhs, NULL);
2159 gimple gcall = NULL;
2161 if (!load_p && !store_p)
2163 /* Add thread private addresses to log if applicable. */
2164 requires_barrier (region->entry_block, lhs, stmt);
2169 gsi_remove (gsi, true);
2171 if (load_p && !store_p)
2173 transaction_subcode_ior (region, GTMA_HAVE_LOAD);
2174 gcall = build_tm_load (loc, lhs, rhs, gsi);
2176 else if (store_p && !load_p)
2178 transaction_subcode_ior (region, GTMA_HAVE_STORE);
2179 gcall = build_tm_store (loc, lhs, rhs, gsi);
2183 tree lhs_addr, rhs_addr, tmp;
2186 transaction_subcode_ior (region, GTMA_HAVE_LOAD);
2188 transaction_subcode_ior (region, GTMA_HAVE_STORE);
2190 /* ??? Figure out if there's any possible overlap between the LHS
2191 and the RHS and if not, use MEMCPY. */
2193 if (load_p && is_gimple_reg (lhs))
2195 tmp = create_tmp_var (TREE_TYPE (lhs), NULL);
2196 lhs_addr = build_fold_addr_expr (tmp);
2201 lhs_addr = gimplify_addr (gsi, lhs);
2203 rhs_addr = gimplify_addr (gsi, rhs);
2204 gcall = gimple_build_call (builtin_decl_explicit (BUILT_IN_TM_MEMMOVE),
2205 3, lhs_addr, rhs_addr,
2206 TYPE_SIZE_UNIT (TREE_TYPE (lhs)));
2207 gimple_set_location (gcall, loc);
2208 gsi_insert_before (gsi, gcall, GSI_SAME_STMT);
2212 gcall = gimple_build_assign (lhs, tmp);
2213 gsi_insert_before (gsi, gcall, GSI_SAME_STMT);
2217 /* Now that we have the load/store in its instrumented form, add
2218 thread private addresses to the log if applicable. */
2220 requires_barrier (region->entry_block, lhs, gcall);
2222 /* add_stmt_to_tm_region (region, gcall); */
2226 /* Expand a call statement as appropriate for a transaction. That is,
2227 either verify that the call does not affect the transaction, or
2228 redirect the call to a clone that handles transactions, or change
2229 the transaction state to IRREVOCABLE. Return true if the call is
2230 one of the builtins that end a transaction. */
2233 expand_call_tm (struct tm_region *region,
2234 gimple_stmt_iterator *gsi)
2236 gimple stmt = gsi_stmt (*gsi);
2237 tree lhs = gimple_call_lhs (stmt);
2239 struct cgraph_node *node;
2240 bool retval = false;
2242 fn_decl = gimple_call_fndecl (stmt);
2244 if (fn_decl == builtin_decl_explicit (BUILT_IN_TM_MEMCPY)
2245 || fn_decl == builtin_decl_explicit (BUILT_IN_TM_MEMMOVE))
2246 transaction_subcode_ior (region, GTMA_HAVE_STORE | GTMA_HAVE_LOAD);
2247 if (fn_decl == builtin_decl_explicit (BUILT_IN_TM_MEMSET))
2248 transaction_subcode_ior (region, GTMA_HAVE_STORE);
2250 if (is_tm_pure_call (stmt))
2254 retval = is_tm_ending_fndecl (fn_decl);
2257 /* Assume all non-const/pure calls write to memory, except
2258 transaction ending builtins. */
2259 transaction_subcode_ior (region, GTMA_HAVE_STORE);
2262 /* For indirect calls, we already generated a call into the runtime. */
2265 tree fn = gimple_call_fn (stmt);
2267 /* We are guaranteed never to go irrevocable on a safe or pure
2268 call, and the pure call was handled above. */
2269 if (is_tm_safe (fn))
2272 transaction_subcode_ior (region, GTMA_MAY_ENTER_IRREVOCABLE);
2277 node = cgraph_get_node (fn_decl);
2278 if (node->local.tm_may_enter_irr)
2279 transaction_subcode_ior (region, GTMA_MAY_ENTER_IRREVOCABLE);
2281 if (is_tm_abort (fn_decl))
2283 transaction_subcode_ior (region, GTMA_HAVE_ABORT);
2287 /* Instrument the store if needed.
2289 If the assignment happens inside the function call (return slot
2290 optimization), there is no instrumentation to be done, since
2291 the callee should have done the right thing. */
2292 if (lhs && requires_barrier (region->entry_block, lhs, stmt)
2293 && !gimple_call_return_slot_opt_p (stmt))
2295 tree tmp = make_rename_temp (TREE_TYPE (lhs), NULL);
2296 location_t loc = gimple_location (stmt);
2297 edge fallthru_edge = NULL;
2299 /* Remember if the call was going to throw. */
2300 if (stmt_can_throw_internal (stmt))
2304 basic_block bb = gimple_bb (stmt);
2306 FOR_EACH_EDGE (e, ei, bb->succs)
2307 if (e->flags & EDGE_FALLTHRU)
2314 gimple_call_set_lhs (stmt, tmp);
2316 stmt = gimple_build_assign (lhs, tmp);
2317 gimple_set_location (stmt, loc);
2319 /* We cannot throw in the middle of a BB. If the call was going
2320 to throw, place the instrumentation on the fallthru edge, so
2321 the call remains the last statement in the block. */
2324 gimple_seq fallthru_seq = gimple_seq_alloc_with_stmt (stmt);
2325 gimple_stmt_iterator fallthru_gsi = gsi_start (fallthru_seq);
2326 expand_assign_tm (region, &fallthru_gsi);
2327 gsi_insert_seq_on_edge (fallthru_edge, fallthru_seq);
2328 pending_edge_inserts_p = true;
2332 gsi_insert_after (gsi, stmt, GSI_CONTINUE_LINKING);
2333 expand_assign_tm (region, gsi);
2336 transaction_subcode_ior (region, GTMA_HAVE_STORE);
2343 /* Expand all statements in BB as appropriate for being inside
2347 expand_block_tm (struct tm_region *region, basic_block bb)
2349 gimple_stmt_iterator gsi;
2351 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); )
2353 gimple stmt = gsi_stmt (gsi);
2354 switch (gimple_code (stmt))
2357 /* Only memory reads/writes need to be instrumented. */
2358 if (gimple_assign_single_p (stmt)
2359 && !gimple_clobber_p (stmt))
2361 expand_assign_tm (region, &gsi);
2367 if (expand_call_tm (region, &gsi))
2377 if (!gsi_end_p (gsi))
2382 /* Return the list of basic-blocks in REGION.
2384 STOP_AT_IRREVOCABLE_P is true if caller is uninterested in blocks
2385 following a TM_IRREVOCABLE call. */
2387 static VEC (basic_block, heap) *
2388 get_tm_region_blocks (basic_block entry_block,
2391 bitmap all_region_blocks,
2392 bool stop_at_irrevocable_p)
2394 VEC(basic_block, heap) *bbs = NULL;
2398 bitmap visited_blocks = BITMAP_ALLOC (NULL);
2401 VEC_safe_push (basic_block, heap, bbs, entry_block);
2402 bitmap_set_bit (visited_blocks, entry_block->index);
2406 basic_block bb = VEC_index (basic_block, bbs, i++);
2409 bitmap_bit_p (exit_blocks, bb->index))
2412 if (stop_at_irrevocable_p
2414 && bitmap_bit_p (irr_blocks, bb->index))
2417 FOR_EACH_EDGE (e, ei, bb->succs)
2418 if (!bitmap_bit_p (visited_blocks, e->dest->index))
2420 bitmap_set_bit (visited_blocks, e->dest->index);
2421 VEC_safe_push (basic_block, heap, bbs, e->dest);
2424 while (i < VEC_length (basic_block, bbs));
2426 if (all_region_blocks)
2427 bitmap_ior_into (all_region_blocks, visited_blocks);
2429 BITMAP_FREE (visited_blocks);
2433 /* Entry point to the MARK phase of TM expansion. Here we replace
2434 transactional memory statements with calls to builtins, and function
2435 calls with their transactional clones (if available). But we don't
2436 yet lower GIMPLE_TRANSACTION or add the transaction restart back-edges. */
2439 execute_tm_mark (void)
2441 struct tm_region *region;
2443 VEC (basic_block, heap) *queue;
2446 queue = VEC_alloc (basic_block, heap, 10);
2447 pending_edge_inserts_p = false;
2449 for (region = all_tm_regions; region ; region = region->next)
2452 /* If we have a transaction... */
2453 if (region->exit_blocks)
2455 unsigned int subcode
2456 = gimple_transaction_subcode (region->transaction_stmt);
2458 /* Collect a new SUBCODE set, now that optimizations are done... */
2459 if (subcode & GTMA_DOES_GO_IRREVOCABLE)
2460 subcode &= (GTMA_DECLARATION_MASK | GTMA_DOES_GO_IRREVOCABLE
2461 | GTMA_MAY_ENTER_IRREVOCABLE);
2463 subcode &= GTMA_DECLARATION_MASK;
2464 gimple_transaction_set_subcode (region->transaction_stmt, subcode);
2467 queue = get_tm_region_blocks (region->entry_block,
2468 region->exit_blocks,
2471 /*stop_at_irr_p=*/true);
2472 for (i = 0; VEC_iterate (basic_block, queue, i, bb); ++i)
2473 expand_block_tm (region, bb);
2474 VEC_free (basic_block, heap, queue);
2479 if (pending_edge_inserts_p)
2480 gsi_commit_edge_inserts ();
2484 struct gimple_opt_pass pass_tm_mark =
2488 "tmmark", /* name */
2490 execute_tm_mark, /* execute */
2493 0, /* static_pass_number */
2494 TV_TRANS_MEM, /* tv_id */
2495 PROP_ssa | PROP_cfg, /* properties_required */
2496 0, /* properties_provided */
2497 0, /* properties_destroyed */
2498 0, /* todo_flags_start */
2501 | TODO_dump_func, /* todo_flags_finish */
2505 /* Create an abnormal call edge from BB to the first block of the region
2506 represented by STATE. Also record the edge in the TM_RESTART map. */
2509 make_tm_edge (gimple stmt, basic_block bb, struct tm_region *region)
2512 struct tm_restart_node *n, dummy;
2514 if (cfun->gimple_df->tm_restart == NULL)
2515 cfun->gimple_df->tm_restart = htab_create_ggc (31, struct_ptr_hash,
2516 struct_ptr_eq, ggc_free);
2519 dummy.label_or_list = gimple_block_label (region->entry_block);
2520 slot = htab_find_slot (cfun->gimple_df->tm_restart, &dummy, INSERT);
2521 n = (struct tm_restart_node *) *slot;
2524 n = ggc_alloc_tm_restart_node ();
2529 tree old = n->label_or_list;
2530 if (TREE_CODE (old) == LABEL_DECL)
2531 old = tree_cons (NULL, old, NULL);
2532 n->label_or_list = tree_cons (NULL, dummy.label_or_list, old);
2535 make_edge (bb, region->entry_block, EDGE_ABNORMAL | EDGE_ABNORMAL_CALL);
2539 /* Split block BB as necessary for every builtin function we added, and
2540 wire up the abnormal back edges implied by the transaction restart. */
2543 expand_block_edges (struct tm_region *region, basic_block bb)
2545 gimple_stmt_iterator gsi;
2547 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); )
2549 gimple stmt = gsi_stmt (gsi);
2551 /* ??? TM_COMMIT (and any other tm builtin function) in a nested
2552 transaction has an abnormal edge back to the outer-most transaction
2553 (there are no nested retries), while a TM_ABORT also has an abnormal
2554 backedge to the inner-most transaction. We haven't actually saved
2555 the inner-most transaction here. We should be able to get to it
2556 via the region_nr saved on STMT, and read the transaction_stmt from
2557 that, and find the first region block from there. */
2558 /* ??? Shouldn't we split for any non-pure, non-irrevocable function? */
2559 if (gimple_code (stmt) == GIMPLE_CALL
2560 && (gimple_call_flags (stmt) & ECF_TM_BUILTIN) != 0)
2562 if (gsi_one_before_end_p (gsi))
2563 make_tm_edge (stmt, bb, region);
2566 edge e = split_block (bb, stmt);
2567 make_tm_edge (stmt, bb, region);
2569 gsi = gsi_start_bb (bb);
2572 /* Delete any tail-call annotation that may have been added.
2573 The tail-call pass may have mis-identified the commit as being
2574 a candidate because we had not yet added this restart edge. */
2575 gimple_call_set_tail (stmt, false);
2582 /* Expand the GIMPLE_TRANSACTION statement into the STM library call. */
2585 expand_transaction (struct tm_region *region)
2587 tree status, tm_start;
2588 basic_block atomic_bb, slice_bb;
2589 gimple_stmt_iterator gsi;
2594 tm_start = builtin_decl_explicit (BUILT_IN_TM_START);
2595 status = make_rename_temp (TREE_TYPE (TREE_TYPE (tm_start)), "tm_state");
2597 /* ??? There are plenty of bits here we're not computing. */
2598 subcode = gimple_transaction_subcode (region->transaction_stmt);
2599 if (subcode & GTMA_DOES_GO_IRREVOCABLE)
2600 flags = PR_DOESGOIRREVOCABLE | PR_UNINSTRUMENTEDCODE;
2602 flags = PR_INSTRUMENTEDCODE;
2603 if ((subcode & GTMA_MAY_ENTER_IRREVOCABLE) == 0)
2604 flags |= PR_HASNOIRREVOCABLE;
2605 /* If the transaction does not have an abort in lexical scope and is not
2606 marked as an outer transaction, then it will never abort. */
2607 if ((subcode & GTMA_HAVE_ABORT) == 0
2608 && (subcode & GTMA_IS_OUTER) == 0)
2609 flags |= PR_HASNOABORT;
2610 if ((subcode & GTMA_HAVE_STORE) == 0)
2611 flags |= PR_READONLY;
2612 t2 = build_int_cst (TREE_TYPE (status), flags);
2613 g = gimple_build_call (tm_start, 1, t2);
2614 gimple_call_set_lhs (g, status);
2615 gimple_set_location (g, gimple_location (region->transaction_stmt));
2617 atomic_bb = gimple_bb (region->transaction_stmt);
2619 if (!VEC_empty (tree, tm_log_save_addresses))
2620 tm_log_emit_saves (region->entry_block, atomic_bb);
2622 gsi = gsi_last_bb (atomic_bb);
2623 gsi_insert_before (&gsi, g, GSI_SAME_STMT);
2624 gsi_remove (&gsi, true);
2626 if (!VEC_empty (tree, tm_log_save_addresses))
2627 region->entry_block =
2628 tm_log_emit_save_or_restores (region->entry_block,
2629 A_RESTORELIVEVARIABLES,
2631 tm_log_emit_restores,
2633 FALLTHRU_EDGE (atomic_bb),
2636 slice_bb = atomic_bb;
2638 /* If we have an ABORT statement, create a test following the start
2639 call to perform the abort. */
2640 if (gimple_transaction_label (region->transaction_stmt))
2643 basic_block test_bb;
2645 test_bb = create_empty_bb (slice_bb);
2646 if (VEC_empty (tree, tm_log_save_addresses))
2647 region->entry_block = test_bb;
2648 gsi = gsi_last_bb (test_bb);
2650 t1 = make_rename_temp (TREE_TYPE (status), NULL);
2651 t2 = build_int_cst (TREE_TYPE (status), A_ABORTTRANSACTION);
2652 g = gimple_build_assign_with_ops (BIT_AND_EXPR, t1, status, t2);
2653 gsi_insert_after (&gsi, g, GSI_CONTINUE_LINKING);
2655 t2 = build_int_cst (TREE_TYPE (status), 0);
2656 g = gimple_build_cond (NE_EXPR, t1, t2, NULL, NULL);
2657 gsi_insert_after (&gsi, g, GSI_CONTINUE_LINKING);
2659 e = FALLTHRU_EDGE (slice_bb);
2660 redirect_edge_pred (e, test_bb);
2661 e->flags = EDGE_FALSE_VALUE;
2662 e->probability = PROB_ALWAYS - PROB_VERY_UNLIKELY;
2664 e = BRANCH_EDGE (atomic_bb);
2665 redirect_edge_pred (e, test_bb);
2666 e->flags = EDGE_TRUE_VALUE;
2667 e->probability = PROB_VERY_UNLIKELY;
2669 e = make_edge (slice_bb, test_bb, EDGE_FALLTHRU);
2672 /* If we've no abort, but we do have PHIs at the beginning of the atomic
2673 region, that means we've a loop at the beginning of the atomic region
2674 that shares the first block. This can cause problems with the abnormal
2675 edges we're about to add for the transaction restart. Solve this by
2676 adding a new empty block to receive the abnormal edges. */
2677 else if (phi_nodes (region->entry_block))
2680 basic_block empty_bb;
2682 region->entry_block = empty_bb = create_empty_bb (atomic_bb);
2684 e = FALLTHRU_EDGE (atomic_bb);
2685 redirect_edge_pred (e, empty_bb);
2687 e = make_edge (atomic_bb, empty_bb, EDGE_FALLTHRU);
2690 /* The GIMPLE_TRANSACTION statement no longer exists. */
2691 region->transaction_stmt = NULL;
2694 static void expand_regions (struct tm_region *);
2696 /* Helper function for expand_regions. Expand REGION and recurse to
2697 the inner region. */
2700 expand_regions_1 (struct tm_region *region)
2702 if (region->exit_blocks)
2706 VEC (basic_block, heap) *queue;
2708 /* Collect the set of blocks in this region. Do this before
2709 splitting edges, so that we don't have to play with the
2710 dominator tree in the middle. */
2711 queue = get_tm_region_blocks (region->entry_block,
2712 region->exit_blocks,
2715 /*stop_at_irr_p=*/false);
2716 expand_transaction (region);
2717 for (i = 0; VEC_iterate (basic_block, queue, i, bb); ++i)
2718 expand_block_edges (region, bb);
2719 VEC_free (basic_block, heap, queue);
2722 expand_regions (region->inner);
2725 /* Expand regions starting at REGION. */
2728 expand_regions (struct tm_region *region)
2732 expand_regions_1 (region);
2733 region = region->next;
2737 /* Entry point to the final expansion of transactional nodes. */
2740 execute_tm_edges (void)
2742 expand_regions (all_tm_regions);
2745 /* We've got to release the dominance info now, to indicate that it
2746 must be rebuilt completely. Otherwise we'll crash trying to update
2747 the SSA web in the TODO section following this pass. */
2748 free_dominance_info (CDI_DOMINATORS);
2749 bitmap_obstack_release (&tm_obstack);
2750 all_tm_regions = NULL;
2755 struct gimple_opt_pass pass_tm_edges =
2759 "tmedge", /* name */
2761 execute_tm_edges, /* execute */
2764 0, /* static_pass_number */
2765 TV_TRANS_MEM, /* tv_id */
2766 PROP_ssa | PROP_cfg, /* properties_required */
2767 0, /* properties_provided */
2768 0, /* properties_destroyed */
2769 0, /* todo_flags_start */
2772 | TODO_dump_func, /* todo_flags_finish */
2776 /* A unique TM memory operation. */
2777 typedef struct tm_memop
2779 /* Unique ID that all memory operations to the same location have. */
2780 unsigned int value_id;
2781 /* Address of load/store. */
2785 /* Sets for solving data flow equations in the memory optimization pass. */
2786 struct tm_memopt_bitmaps
2788 /* Stores available to this BB upon entry. Basically, stores that
2789 dominate this BB. */
2790 bitmap store_avail_in;
2791 /* Stores available at the end of this BB. */
2792 bitmap store_avail_out;
2793 bitmap store_antic_in;
2794 bitmap store_antic_out;
2795 /* Reads available to this BB upon entry. Basically, reads that
2796 dominate this BB. */
2797 bitmap read_avail_in;
2798 /* Reads available at the end of this BB. */
2799 bitmap read_avail_out;
2800 /* Reads performed in this BB. */
2802 /* Writes performed in this BB. */
2805 /* Temporary storage for pass. */
2806 /* Is the current BB in the worklist? */
2807 bool avail_in_worklist_p;
2808 /* Have we visited this BB? */
2812 static bitmap_obstack tm_memopt_obstack;
2814 /* Unique counter for TM loads and stores. Loads and stores of the
2815 same address get the same ID. */
2816 static unsigned int tm_memopt_value_id;
2817 static htab_t tm_memopt_value_numbers;
2819 #define STORE_AVAIL_IN(BB) \
2820 ((struct tm_memopt_bitmaps *) ((BB)->aux))->store_avail_in
2821 #define STORE_AVAIL_OUT(BB) \
2822 ((struct tm_memopt_bitmaps *) ((BB)->aux))->store_avail_out
2823 #define STORE_ANTIC_IN(BB) \
2824 ((struct tm_memopt_bitmaps *) ((BB)->aux))->store_antic_in
2825 #define STORE_ANTIC_OUT(BB) \
2826 ((struct tm_memopt_bitmaps *) ((BB)->aux))->store_antic_out
2827 #define READ_AVAIL_IN(BB) \
2828 ((struct tm_memopt_bitmaps *) ((BB)->aux))->read_avail_in
2829 #define READ_AVAIL_OUT(BB) \
2830 ((struct tm_memopt_bitmaps *) ((BB)->aux))->read_avail_out
2831 #define READ_LOCAL(BB) \
2832 ((struct tm_memopt_bitmaps *) ((BB)->aux))->read_local
2833 #define STORE_LOCAL(BB) \
2834 ((struct tm_memopt_bitmaps *) ((BB)->aux))->store_local
2835 #define AVAIL_IN_WORKLIST_P(BB) \
2836 ((struct tm_memopt_bitmaps *) ((BB)->aux))->avail_in_worklist_p
2837 #define BB_VISITED_P(BB) \
2838 ((struct tm_memopt_bitmaps *) ((BB)->aux))->visited_p
2840 /* Htab support. Return a hash value for a `tm_memop'. */
2842 tm_memop_hash (const void *p)
2844 const struct tm_memop *mem = (const struct tm_memop *) p;
2845 tree addr = mem->addr;
2846 /* We drill down to the SSA_NAME/DECL for the hash, but equality is
2847 actually done with operand_equal_p (see tm_memop_eq). */
2848 if (TREE_CODE (addr) == ADDR_EXPR)
2849 addr = TREE_OPERAND (addr, 0);
2850 return iterative_hash_expr (addr, 0);
2853 /* Htab support. Return true if two tm_memop's are the same. */
2855 tm_memop_eq (const void *p1, const void *p2)
2857 const struct tm_memop *mem1 = (const struct tm_memop *) p1;
2858 const struct tm_memop *mem2 = (const struct tm_memop *) p2;
2860 return operand_equal_p (mem1->addr, mem2->addr, 0);
2863 /* Given a TM load/store in STMT, return the value number for the address
2867 tm_memopt_value_number (gimple stmt, enum insert_option op)
2869 struct tm_memop tmpmem, *mem;
2872 gcc_assert (is_tm_load (stmt) || is_tm_store (stmt));
2873 tmpmem.addr = gimple_call_arg (stmt, 0);
2874 slot = htab_find_slot (tm_memopt_value_numbers, &tmpmem, op);
2876 mem = (struct tm_memop *) *slot;
2877 else if (op == INSERT)
2879 mem = XNEW (struct tm_memop);
2881 mem->value_id = tm_memopt_value_id++;
2882 mem->addr = tmpmem.addr;
2886 return mem->value_id;
2889 /* Accumulate TM memory operations in BB into STORE_LOCAL and READ_LOCAL. */
2892 tm_memopt_accumulate_memops (basic_block bb)
2894 gimple_stmt_iterator gsi;
2896 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
2898 gimple stmt = gsi_stmt (gsi);
2902 if (is_tm_store (stmt))
2903 bits = STORE_LOCAL (bb);
2904 else if (is_tm_load (stmt))
2905 bits = READ_LOCAL (bb);
2909 loc = tm_memopt_value_number (stmt, INSERT);
2910 bitmap_set_bit (bits, loc);
2913 fprintf (dump_file, "TM memopt (%s): value num=%d, BB=%d, addr=",
2914 is_tm_load (stmt) ? "LOAD" : "STORE", loc,
2915 gimple_bb (stmt)->index);
2916 print_generic_expr (dump_file, gimple_call_arg (stmt, 0), 0);
2917 fprintf (dump_file, "\n");
2922 /* Prettily dump one of the memopt sets. BITS is the bitmap to dump. */
2925 dump_tm_memopt_set (const char *set_name, bitmap bits)
2929 const char *comma = "";
2931 fprintf (dump_file, "TM memopt: %s: [", set_name);
2932 EXECUTE_IF_SET_IN_BITMAP (bits, 0, i, bi)
2935 struct tm_memop *mem;
2937 /* Yeah, yeah, yeah. Whatever. This is just for debugging. */
2938 FOR_EACH_HTAB_ELEMENT (tm_memopt_value_numbers, mem, tm_memop_t, hi)
2939 if (mem->value_id == i)
2941 gcc_assert (mem->value_id == i);
2942 fprintf (dump_file, "%s", comma);
2944 print_generic_expr (dump_file, mem->addr, 0);
2946 fprintf (dump_file, "]\n");
2949 /* Prettily dump all of the memopt sets in BLOCKS. */
2952 dump_tm_memopt_sets (VEC (basic_block, heap) *blocks)
2957 for (i = 0; VEC_iterate (basic_block, blocks, i, bb); ++i)
2959 fprintf (dump_file, "------------BB %d---------\n", bb->index);
2960 dump_tm_memopt_set ("STORE_LOCAL", STORE_LOCAL (bb));
2961 dump_tm_memopt_set ("READ_LOCAL", READ_LOCAL (bb));
2962 dump_tm_memopt_set ("STORE_AVAIL_IN", STORE_AVAIL_IN (bb));
2963 dump_tm_memopt_set ("STORE_AVAIL_OUT", STORE_AVAIL_OUT (bb));
2964 dump_tm_memopt_set ("READ_AVAIL_IN", READ_AVAIL_IN (bb));
2965 dump_tm_memopt_set ("READ_AVAIL_OUT", READ_AVAIL_OUT (bb));
2969 /* Compute {STORE,READ}_AVAIL_IN for the basic block BB. */
2972 tm_memopt_compute_avin (basic_block bb)
2977 /* Seed with the AVOUT of any predecessor. */
2978 for (ix = 0; ix < EDGE_COUNT (bb->preds); ix++)
2980 e = EDGE_PRED (bb, ix);
2981 /* Make sure we have already visited this BB, and is thus
2984 If e->src->aux is NULL, this predecessor is actually on an
2985 enclosing transaction. We only care about the current
2986 transaction, so ignore it. */
2987 if (e->src->aux && BB_VISITED_P (e->src))
2989 bitmap_copy (STORE_AVAIL_IN (bb), STORE_AVAIL_OUT (e->src));
2990 bitmap_copy (READ_AVAIL_IN (bb), READ_AVAIL_OUT (e->src));
2995 for (; ix < EDGE_COUNT (bb->preds); ix++)
2997 e = EDGE_PRED (bb, ix);
2998 if (e->src->aux && BB_VISITED_P (e->src))
3000 bitmap_and_into (STORE_AVAIL_IN (bb), STORE_AVAIL_OUT (e->src));
3001 bitmap_and_into (READ_AVAIL_IN (bb), READ_AVAIL_OUT (e->src));
3005 BB_VISITED_P (bb) = true;
3008 /* Compute the STORE_ANTIC_IN for the basic block BB. */
3011 tm_memopt_compute_antin (basic_block bb)
3016 /* Seed with the ANTIC_OUT of any successor. */
3017 for (ix = 0; ix < EDGE_COUNT (bb->succs); ix++)
3019 e = EDGE_SUCC (bb, ix);
3020 /* Make sure we have already visited this BB, and is thus
3022 if (BB_VISITED_P (e->dest))
3024 bitmap_copy (STORE_ANTIC_IN (bb), STORE_ANTIC_OUT (e->dest));
3029 for (; ix < EDGE_COUNT (bb->succs); ix++)
3031 e = EDGE_SUCC (bb, ix);
3032 if (BB_VISITED_P (e->dest))
3033 bitmap_and_into (STORE_ANTIC_IN (bb), STORE_ANTIC_OUT (e->dest));
3036 BB_VISITED_P (bb) = true;
3039 /* Compute the AVAIL sets for every basic block in BLOCKS.
3041 We compute {STORE,READ}_AVAIL_{OUT,IN} as follows:
3043 AVAIL_OUT[bb] = union (AVAIL_IN[bb], LOCAL[bb])
3044 AVAIL_IN[bb] = intersect (AVAIL_OUT[predecessors])
3046 This is basically what we do in lcm's compute_available(), but here
3047 we calculate two sets of sets (one for STOREs and one for READs),
3048 and we work on a region instead of the entire CFG.
3050 REGION is the TM region.
3051 BLOCKS are the basic blocks in the region. */
3054 tm_memopt_compute_available (struct tm_region *region,
3055 VEC (basic_block, heap) *blocks)
3058 basic_block *worklist, *qin, *qout, *qend, bb;
3059 unsigned int qlen, i;
3063 /* Allocate a worklist array/queue. Entries are only added to the
3064 list if they were not already on the list. So the size is
3065 bounded by the number of basic blocks in the region. */
3066 qlen = VEC_length (basic_block, blocks) - 1;
3067 qin = qout = worklist =
3068 XNEWVEC (basic_block, qlen);
3070 /* Put every block in the region on the worklist. */
3071 for (i = 0; VEC_iterate (basic_block, blocks, i, bb); ++i)
3073 /* Seed AVAIL_OUT with the LOCAL set. */
3074 bitmap_ior_into (STORE_AVAIL_OUT (bb), STORE_LOCAL (bb));
3075 bitmap_ior_into (READ_AVAIL_OUT (bb), READ_LOCAL (bb));
3077 AVAIL_IN_WORKLIST_P (bb) = true;
3078 /* No need to insert the entry block, since it has an AVIN of
3079 null, and an AVOUT that has already been seeded in. */
3080 if (bb != region->entry_block)
3084 /* The entry block has been initialized with the local sets. */
3085 BB_VISITED_P (region->entry_block) = true;
3088 qend = &worklist[qlen];
3090 /* Iterate until the worklist is empty. */
3093 /* Take the first entry off the worklist. */
3100 /* This block can be added to the worklist again if necessary. */
3101 AVAIL_IN_WORKLIST_P (bb) = false;
3102 tm_memopt_compute_avin (bb);
3104 /* Note: We do not add the LOCAL sets here because we already
3105 seeded the AVAIL_OUT sets with them. */
3106 changed = bitmap_ior_into (STORE_AVAIL_OUT (bb), STORE_AVAIL_IN (bb));
3107 changed |= bitmap_ior_into (READ_AVAIL_OUT (bb), READ_AVAIL_IN (bb));
3109 && (region->exit_blocks == NULL
3110 || !bitmap_bit_p (region->exit_blocks, bb->index)))
3111 /* If the out state of this block changed, then we need to add
3112 its successors to the worklist if they are not already in. */
3113 FOR_EACH_EDGE (e, ei, bb->succs)
3114 if (!AVAIL_IN_WORKLIST_P (e->dest) && e->dest != EXIT_BLOCK_PTR)
3117 AVAIL_IN_WORKLIST_P (e->dest) = true;
3128 dump_tm_memopt_sets (blocks);
3131 /* Compute ANTIC sets for every basic block in BLOCKS.
3133 We compute STORE_ANTIC_OUT as follows:
3135 STORE_ANTIC_OUT[bb] = union(STORE_ANTIC_IN[bb], STORE_LOCAL[bb])
3136 STORE_ANTIC_IN[bb] = intersect(STORE_ANTIC_OUT[successors])
3138 REGION is the TM region.
3139 BLOCKS are the basic blocks in the region. */
3142 tm_memopt_compute_antic (struct tm_region *region,
3143 VEC (basic_block, heap) *blocks)
3146 basic_block *worklist, *qin, *qout, *qend, bb;
3151 /* Allocate a worklist array/queue. Entries are only added to the
3152 list if they were not already on the list. So the size is
3153 bounded by the number of basic blocks in the region. */
3154 qin = qout = worklist =
3155 XNEWVEC (basic_block, VEC_length (basic_block, blocks));
3157 for (qlen = 0, i = VEC_length (basic_block, blocks) - 1; i >= 0; --i)
3159 bb = VEC_index (basic_block, blocks, i);
3161 /* Seed ANTIC_OUT with the LOCAL set. */
3162 bitmap_ior_into (STORE_ANTIC_OUT (bb), STORE_LOCAL (bb));
3164 /* Put every block in the region on the worklist. */
3165 AVAIL_IN_WORKLIST_P (bb) = true;
3166 /* No need to insert exit blocks, since their ANTIC_IN is NULL,
3167 and their ANTIC_OUT has already been seeded in. */
3168 if (region->exit_blocks
3169 && !bitmap_bit_p (region->exit_blocks, bb->index))
3176 /* The exit blocks have been initialized with the local sets. */
3177 if (region->exit_blocks)
3181 EXECUTE_IF_SET_IN_BITMAP (region->exit_blocks, 0, i, bi)
3182 BB_VISITED_P (BASIC_BLOCK (i)) = true;
3186 qend = &worklist[qlen];
3188 /* Iterate until the worklist is empty. */
3191 /* Take the first entry off the worklist. */
3198 /* This block can be added to the worklist again if necessary. */
3199 AVAIL_IN_WORKLIST_P (bb) = false;
3200 tm_memopt_compute_antin (bb);
3202 /* Note: We do not add the LOCAL sets here because we already
3203 seeded the ANTIC_OUT sets with them. */
3204 if (bitmap_ior_into (STORE_ANTIC_OUT (bb), STORE_ANTIC_IN (bb))
3205 && bb != region->entry_block)
3206 /* If the out state of this block changed, then we need to add
3207 its predecessors to the worklist if they are not already in. */
3208 FOR_EACH_EDGE (e, ei, bb->preds)
3209 if (!AVAIL_IN_WORKLIST_P (e->src))
3212 AVAIL_IN_WORKLIST_P (e->src) = true;
3223 dump_tm_memopt_sets (blocks);
3226 /* Offsets of load variants from TM_LOAD. For example,
3227 BUILT_IN_TM_LOAD_RAR* is an offset of 1 from BUILT_IN_TM_LOAD*.
3228 See gtm-builtins.def. */
3229 #define TRANSFORM_RAR 1
3230 #define TRANSFORM_RAW 2
3231 #define TRANSFORM_RFW 3
3232 /* Offsets of store variants from TM_STORE. */
3233 #define TRANSFORM_WAR 1
3234 #define TRANSFORM_WAW 2
3236 /* Inform about a load/store optimization. */
3239 dump_tm_memopt_transform (gimple stmt)
3243 fprintf (dump_file, "TM memopt: transforming: ");
3244 print_gimple_stmt (dump_file, stmt, 0, 0);
3245 fprintf (dump_file, "\n");
3249 /* Perform a read/write optimization. Replaces the TM builtin in STMT
3250 by a builtin that is OFFSET entries down in the builtins table in
3251 gtm-builtins.def. */
3254 tm_memopt_transform_stmt (unsigned int offset,
3256 gimple_stmt_iterator *gsi)
3258 tree fn = gimple_call_fn (stmt);
3259 gcc_assert (TREE_CODE (fn) == ADDR_EXPR);
3260 TREE_OPERAND (fn, 0)
3261 = builtin_decl_explicit ((enum built_in_function)
3262 (DECL_FUNCTION_CODE (TREE_OPERAND (fn, 0))
3264 gimple_call_set_fn (stmt, fn);
3265 gsi_replace (gsi, stmt, true);
3266 dump_tm_memopt_transform (stmt);
3269 /* Perform the actual TM memory optimization transformations in the
3270 basic blocks in BLOCKS. */
3273 tm_memopt_transform_blocks (VEC (basic_block, heap) *blocks)
3277 gimple_stmt_iterator gsi;
3279 for (i = 0; VEC_iterate (basic_block, blocks, i, bb); ++i)
3281 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
3283 gimple stmt = gsi_stmt (gsi);
3284 bitmap read_avail = READ_AVAIL_IN (bb);
3285 bitmap store_avail = STORE_AVAIL_IN (bb);
3286 bitmap store_antic = STORE_ANTIC_OUT (bb);
3289 if (is_tm_simple_load (stmt))
3291 loc = tm_memopt_value_number (stmt, NO_INSERT);
3292 if (store_avail && bitmap_bit_p (store_avail, loc))
3293 tm_memopt_transform_stmt (TRANSFORM_RAW, stmt, &gsi);
3294 else if (store_antic && bitmap_bit_p (store_antic, loc))
3296 tm_memopt_transform_stmt (TRANSFORM_RFW, stmt, &gsi);
3297 bitmap_set_bit (store_avail, loc);
3299 else if (read_avail && bitmap_bit_p (read_avail, loc))
3300 tm_memopt_transform_stmt (TRANSFORM_RAR, stmt, &gsi);
3302 bitmap_set_bit (read_avail, loc);
3304 else if (is_tm_simple_store (stmt))
3306 loc = tm_memopt_value_number (stmt, NO_INSERT);
3307 if (store_avail && bitmap_bit_p (store_avail, loc))
3308 tm_memopt_transform_stmt (TRANSFORM_WAW, stmt, &gsi);
3311 if (read_avail && bitmap_bit_p (read_avail, loc))
3312 tm_memopt_transform_stmt (TRANSFORM_WAR, stmt, &gsi);
3313 bitmap_set_bit (store_avail, loc);
3320 /* Return a new set of bitmaps for a BB. */
3322 static struct tm_memopt_bitmaps *
3323 tm_memopt_init_sets (void)
3325 struct tm_memopt_bitmaps *b
3326 = XOBNEW (&tm_memopt_obstack.obstack, struct tm_memopt_bitmaps);
3327 b->store_avail_in = BITMAP_ALLOC (&tm_memopt_obstack);
3328 b->store_avail_out = BITMAP_ALLOC (&tm_memopt_obstack);
3329 b->store_antic_in = BITMAP_ALLOC (&tm_memopt_obstack);
3330 b->store_antic_out = BITMAP_ALLOC (&tm_memopt_obstack);
3331 b->store_avail_out = BITMAP_ALLOC (&tm_memopt_obstack);
3332 b->read_avail_in = BITMAP_ALLOC (&tm_memopt_obstack);
3333 b->read_avail_out = BITMAP_ALLOC (&tm_memopt_obstack);
3334 b->read_local = BITMAP_ALLOC (&tm_memopt_obstack);
3335 b->store_local = BITMAP_ALLOC (&tm_memopt_obstack);
3339 /* Free sets computed for each BB. */
3342 tm_memopt_free_sets (VEC (basic_block, heap) *blocks)
3347 for (i = 0; VEC_iterate (basic_block, blocks, i, bb); ++i)
3351 /* Clear the visited bit for every basic block in BLOCKS. */
3354 tm_memopt_clear_visited (VEC (basic_block, heap) *blocks)
3359 for (i = 0; VEC_iterate (basic_block, blocks, i, bb); ++i)
3360 BB_VISITED_P (bb) = false;
3363 /* Replace TM load/stores with hints for the runtime. We handle
3364 things like read-after-write, write-after-read, read-after-read,
3365 read-for-write, etc. */
3368 execute_tm_memopt (void)
3370 struct tm_region *region;
3371 VEC (basic_block, heap) *bbs;
3373 tm_memopt_value_id = 0;
3374 tm_memopt_value_numbers = htab_create (10, tm_memop_hash, tm_memop_eq, free);
3376 for (region = all_tm_regions; region; region = region->next)
3378 /* All the TM stores/loads in the current region. */
3382 bitmap_obstack_initialize (&tm_memopt_obstack);
3384 /* Save all BBs for the current region. */
3385 bbs = get_tm_region_blocks (region->entry_block,
3386 region->exit_blocks,
3391 /* Collect all the memory operations. */
3392 for (i = 0; VEC_iterate (basic_block, bbs, i, bb); ++i)
3394 bb->aux = tm_memopt_init_sets ();
3395 tm_memopt_accumulate_memops (bb);
3398 /* Solve data flow equations and transform each block accordingly. */
3399 tm_memopt_clear_visited (bbs);
3400 tm_memopt_compute_available (region, bbs);
3401 tm_memopt_clear_visited (bbs);
3402 tm_memopt_compute_antic (region, bbs);
3403 tm_memopt_transform_blocks (bbs);
3405 tm_memopt_free_sets (bbs);
3406 VEC_free (basic_block, heap, bbs);
3407 bitmap_obstack_release (&tm_memopt_obstack);
3408 htab_empty (tm_memopt_value_numbers);
3411 htab_delete (tm_memopt_value_numbers);
3416 gate_tm_memopt (void)
3418 return flag_tm && optimize > 0;
3421 struct gimple_opt_pass pass_tm_memopt =
3425 "tmmemopt", /* name */
3426 gate_tm_memopt, /* gate */
3427 execute_tm_memopt, /* execute */
3430 0, /* static_pass_number */
3431 TV_TRANS_MEM, /* tv_id */
3432 PROP_ssa | PROP_cfg, /* properties_required */
3433 0, /* properties_provided */
3434 0, /* properties_destroyed */
3435 0, /* todo_flags_start */
3436 TODO_dump_func, /* todo_flags_finish */
3441 /* Interprocedual analysis for the creation of transactional clones.
3442 The aim of this pass is to find which functions are referenced in
3443 a non-irrevocable transaction context, and for those over which
3444 we have control (or user directive), create a version of the
3445 function which uses only the transactional interface to reference
3446 protected memories. This analysis proceeds in several steps:
3448 (1) Collect the set of all possible transactional clones:
3450 (a) For all local public functions marked tm_callable, push
3451 it onto the tm_callee queue.
3453 (b) For all local functions, scan for calls in transaction blocks.
3454 Push the caller and callee onto the tm_caller and tm_callee
3455 queues. Count the number of callers for each callee.
3457 (c) For each local function on the callee list, assume we will
3458 create a transactional clone. Push *all* calls onto the
3459 callee queues; count the number of clone callers separately
3460 to the number of original callers.
3462 (2) Propagate irrevocable status up the dominator tree:
3464 (a) Any external function on the callee list that is not marked
3465 tm_callable is irrevocable. Push all callers of such onto
3468 (b) For each function on the worklist, mark each block that
3469 contains an irrevocable call. Use the AND operator to
3470 propagate that mark up the dominator tree.
3472 (c) If we reach the entry block for a possible transactional
3473 clone, then the transactional clone is irrevocable, and
3474 we should not create the clone after all. Push all
3475 callers onto the worklist.
3477 (d) Place tm_irrevocable calls at the beginning of the relevant
3478 blocks. Special case here is the entry block for the entire
3479 transaction region; there we mark it GTMA_DOES_GO_IRREVOCABLE for
3480 the library to begin the region in serial mode. Decrement
3481 the call count for all callees in the irrevocable region.
3483 (3) Create the transactional clones:
3485 Any tm_callee that still has a non-zero call count is cloned.
3488 /* This structure is stored in the AUX field of each cgraph_node. */
3489 struct tm_ipa_cg_data
3491 /* The clone of the function that got created. */
3492 struct cgraph_node *clone;
3494 /* The tm regions in the normal function. */
3495 struct tm_region *all_tm_regions;
3497 /* The blocks of the normal/clone functions that contain irrevocable
3498 calls, or blocks that are post-dominated by irrevocable calls. */
3499 bitmap irrevocable_blocks_normal;
3500 bitmap irrevocable_blocks_clone;
3502 /* The blocks of the normal function that are involved in transactions. */
3503 bitmap transaction_blocks_normal;
3505 /* The number of callers to the transactional clone of this function
3506 from normal and transactional clones respectively. */
3507 unsigned tm_callers_normal;
3508 unsigned tm_callers_clone;
3510 /* True if all calls to this function's transactional clone
3511 are irrevocable. Also automatically true if the function
3512 has no transactional clone. */
3513 bool is_irrevocable;
3515 /* Flags indicating the presence of this function in various queues. */
3516 bool in_callee_queue;
3519 /* Flags indicating the kind of scan desired while in the worklist. */
3520 bool want_irr_scan_normal;
3523 typedef struct cgraph_node *cgraph_node_p;
3525 DEF_VEC_P (cgraph_node_p);
3526 DEF_VEC_ALLOC_P (cgraph_node_p, heap);
3528 typedef VEC (cgraph_node_p, heap) *cgraph_node_queue;
3530 /* Return the ipa data associated with NODE, allocating zeroed memory
3531 if necessary. TRAVERSE_ALIASES is true if we must traverse aliases
3532 and set *NODE accordingly. */
3534 static struct tm_ipa_cg_data *
3535 get_cg_data (struct cgraph_node **node, bool traverse_aliases)
3537 struct tm_ipa_cg_data *d;
3539 if (traverse_aliases && (*node)->alias)
3540 *node = cgraph_get_node ((*node)->thunk.alias);
3542 d = (struct tm_ipa_cg_data *) (*node)->aux;
3546 d = (struct tm_ipa_cg_data *)
3547 obstack_alloc (&tm_obstack.obstack, sizeof (*d));
3548 (*node)->aux = (void *) d;
3549 memset (d, 0, sizeof (*d));
3555 /* Add NODE to the end of QUEUE, unless IN_QUEUE_P indicates that
3556 it is already present. */
3559 maybe_push_queue (struct cgraph_node *node,
3560 cgraph_node_queue *queue_p, bool *in_queue_p)
3565 VEC_safe_push (cgraph_node_p, heap, *queue_p, node);
3569 /* A subroutine of ipa_tm_scan_calls_transaction and ipa_tm_scan_calls_clone.
3570 Queue all callees within block BB. */
3573 ipa_tm_scan_calls_block (cgraph_node_queue *callees_p,
3574 basic_block bb, bool for_clone)
3576 gimple_stmt_iterator gsi;
3578 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
3580 gimple stmt = gsi_stmt (gsi);
3581 if (is_gimple_call (stmt) && !is_tm_pure_call (stmt))
3583 tree fndecl = gimple_call_fndecl (stmt);
3586 struct tm_ipa_cg_data *d;
3588 struct cgraph_node *node;
3590 if (is_tm_ending_fndecl (fndecl))
3592 if (find_tm_replacement_function (fndecl))
3595 node = cgraph_get_node (fndecl);
3596 gcc_assert (node != NULL);
3597 d = get_cg_data (&node, true);
3599 pcallers = (for_clone ? &d->tm_callers_clone
3600 : &d->tm_callers_normal);
3603 maybe_push_queue (node, callees_p, &d->in_callee_queue);
3609 /* Scan all calls in NODE that are within a transaction region,
3610 and push the resulting nodes into the callee queue. */
3613 ipa_tm_scan_calls_transaction (struct tm_ipa_cg_data *d,
3614 cgraph_node_queue *callees_p)
3616 struct tm_region *r;
3618 d->transaction_blocks_normal = BITMAP_ALLOC (&tm_obstack);
3619 d->all_tm_regions = all_tm_regions;
3621 for (r = all_tm_regions; r; r = r->next)
3623 VEC (basic_block, heap) *bbs;
3627 bbs = get_tm_region_blocks (r->entry_block, r->exit_blocks, NULL,
3628 d->transaction_blocks_normal, false);
3630 FOR_EACH_VEC_ELT (basic_block, bbs, i, bb)
3631 ipa_tm_scan_calls_block (callees_p, bb, false);
3633 VEC_free (basic_block, heap, bbs);
3637 /* Scan all calls in NODE as if this is the transactional clone,
3638 and push the destinations into the callee queue. */
3641 ipa_tm_scan_calls_clone (struct cgraph_node *node,
3642 cgraph_node_queue *callees_p)
3644 struct function *fn = DECL_STRUCT_FUNCTION (node->decl);
3647 FOR_EACH_BB_FN (bb, fn)
3648 ipa_tm_scan_calls_block (callees_p, bb, true);
3651 /* The function NODE has been detected to be irrevocable. Push all
3652 of its callers onto WORKLIST for the purpose of re-scanning them. */
3655 ipa_tm_note_irrevocable (struct cgraph_node *node,
3656 cgraph_node_queue *worklist_p)
3658 struct tm_ipa_cg_data *d = get_cg_data (&node, true);
3659 struct cgraph_edge *e;
3661 d->is_irrevocable = true;
3663 for (e = node->callers; e ; e = e->next_caller)
3666 struct cgraph_node *caller;
3668 /* Don't examine recursive calls. */
3669 if (e->caller == node)
3671 /* Even if we think we can go irrevocable, believe the user
3673 if (is_tm_safe_or_pure (e->caller->decl))
3677 d = get_cg_data (&caller, true);
3679 /* Check if the callee is in a transactional region. If so,
3680 schedule the function for normal re-scan as well. */
3681 bb = gimple_bb (e->call_stmt);
3682 gcc_assert (bb != NULL);
3683 if (d->transaction_blocks_normal
3684 && bitmap_bit_p (d->transaction_blocks_normal, bb->index))
3685 d->want_irr_scan_normal = true;
3687 maybe_push_queue (caller, worklist_p, &d->in_worklist);
3691 /* A subroutine of ipa_tm_scan_irr_blocks; return true iff any statement
3692 within the block is irrevocable. */
3695 ipa_tm_scan_irr_block (basic_block bb)
3697 gimple_stmt_iterator gsi;
3700 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
3702 gimple stmt = gsi_stmt (gsi);
3703 switch (gimple_code (stmt))
3706 if (is_tm_pure_call (stmt))
3709 fn = gimple_call_fn (stmt);
3711 /* Functions with the attribute are by definition irrevocable. */
3712 if (is_tm_irrevocable (fn))
3715 /* For direct function calls, go ahead and check for replacement
3716 functions, or transitive irrevocable functions. For indirect
3717 functions, we'll ask the runtime. */
3718 if (TREE_CODE (fn) == ADDR_EXPR)
3720 struct tm_ipa_cg_data *d;
3721 struct cgraph_node *node;
3723 fn = TREE_OPERAND (fn, 0);
3724 if (is_tm_ending_fndecl (fn))
3726 if (find_tm_replacement_function (fn))
3729 node = cgraph_get_node(fn);
3730 d = get_cg_data (&node, true);
3732 /* Return true if irrevocable, but above all, believe
3734 if (d->is_irrevocable
3735 && !is_tm_safe_or_pure (fn))
3741 /* ??? The Approved Method of indicating that an inline
3742 assembly statement is not relevant to the transaction
3743 is to wrap it in a __tm_waiver block. This is not
3744 yet implemented, so we can't check for it. */
3755 /* For each of the blocks seeded witin PQUEUE, walk the CFG looking
3756 for new irrevocable blocks, marking them in NEW_IRR. Don't bother
3757 scanning past OLD_IRR or EXIT_BLOCKS. */
3760 ipa_tm_scan_irr_blocks (VEC (basic_block, heap) **pqueue, bitmap new_irr,
3761 bitmap old_irr, bitmap exit_blocks)
3763 bool any_new_irr = false;
3766 bitmap visited_blocks = BITMAP_ALLOC (NULL);
3770 basic_block bb = VEC_pop (basic_block, *pqueue);
3772 /* Don't re-scan blocks we know already are irrevocable. */
3773 if (old_irr && bitmap_bit_p (old_irr, bb->index))
3776 if (ipa_tm_scan_irr_block (bb))
3778 bitmap_set_bit (new_irr, bb->index);
3781 else if (exit_blocks == NULL || !bitmap_bit_p (exit_blocks, bb->index))
3783 FOR_EACH_EDGE (e, ei, bb->succs)
3784 if (!bitmap_bit_p (visited_blocks, e->dest->index))
3786 bitmap_set_bit (visited_blocks, e->dest->index);
3787 VEC_safe_push (basic_block, heap, *pqueue, e->dest);
3791 while (!VEC_empty (basic_block, *pqueue));
3793 BITMAP_FREE (visited_blocks);
3798 /* Propagate the irrevocable property both up and down the dominator tree.
3799 BB is the current block being scanned; EXIT_BLOCKS are the edges of the
3800 TM regions; OLD_IRR are the results of a previous scan of the dominator
3801 tree which has been fully propagated; NEW_IRR is the set of new blocks
3802 which are gaining the irrevocable property during the current scan. */
3805 ipa_tm_propagate_irr (basic_block entry_block, bitmap new_irr,
3806 bitmap old_irr, bitmap exit_blocks)
3808 VEC (basic_block, heap) *bbs;
3809 bitmap all_region_blocks;
3811 /* If this block is in the old set, no need to rescan. */
3812 if (old_irr && bitmap_bit_p (old_irr, entry_block->index))
3815 all_region_blocks = BITMAP_ALLOC (&tm_obstack);
3816 bbs = get_tm_region_blocks (entry_block, exit_blocks, NULL,
3817 all_region_blocks, false);
3820 basic_block bb = VEC_pop (basic_block, bbs);
3821 bool this_irr = bitmap_bit_p (new_irr, bb->index);
3822 bool all_son_irr = false;
3826 /* Propagate up. If my children are, I am too, but we must have
3827 at least one child that is. */
3830 FOR_EACH_EDGE (e, ei, bb->succs)
3832 if (!bitmap_bit_p (new_irr, e->dest->index))
3834 all_son_irr = false;
3842 /* Add block to new_irr if it hasn't already been processed. */
3843 if (!old_irr || !bitmap_bit_p (old_irr, bb->index))
3845 bitmap_set_bit (new_irr, bb->index);
3851 /* Propagate down to everyone we immediately dominate. */
3855 for (son = first_dom_son (CDI_DOMINATORS, bb);
3857 son = next_dom_son (CDI_DOMINATORS, son))
3859 /* Make sure block is actually in a TM region, and it
3860 isn't already in old_irr. */
3861 if ((!old_irr || !bitmap_bit_p (old_irr, son->index))
3862 && bitmap_bit_p (all_region_blocks, son->index))
3863 bitmap_set_bit (new_irr, son->index);
3867 while (!VEC_empty (basic_block, bbs));
3869 BITMAP_FREE (all_region_blocks);
3870 VEC_free (basic_block, heap, bbs);
3874 ipa_tm_decrement_clone_counts (basic_block bb, bool for_clone)
3876 gimple_stmt_iterator gsi;
3878 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
3880 gimple stmt = gsi_stmt (gsi);
3881 if (is_gimple_call (stmt) && !is_tm_pure_call (stmt))
3883 tree fndecl = gimple_call_fndecl (stmt);
3886 struct tm_ipa_cg_data *d;
3888 struct cgraph_node *tnode;
3890 if (is_tm_ending_fndecl (fndecl))
3892 if (find_tm_replacement_function (fndecl))
3895 tnode = cgraph_get_node (fndecl);
3896 d = get_cg_data (&tnode, true);
3898 pcallers = (for_clone ? &d->tm_callers_clone
3899 : &d->tm_callers_normal);
3901 gcc_assert (*pcallers > 0);
3908 /* (Re-)Scan the transaction blocks in NODE for calls to irrevocable functions,
3909 as well as other irrevocable actions such as inline assembly. Mark all
3910 such blocks as irrevocable and decrement the number of calls to
3911 transactional clones. Return true if, for the transactional clone, the
3912 entire function is irrevocable. */
3915 ipa_tm_scan_irr_function (struct cgraph_node *node, bool for_clone)
3917 struct tm_ipa_cg_data *d;
3918 bitmap new_irr, old_irr;
3919 VEC (basic_block, heap) *queue;
3922 /* Builtin operators (operator new, and such). */
3923 if (DECL_STRUCT_FUNCTION (node->decl) == NULL
3924 || DECL_STRUCT_FUNCTION (node->decl)->cfg == NULL)
3927 current_function_decl = node->decl;
3928 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
3929 calculate_dominance_info (CDI_DOMINATORS);
3931 d = get_cg_data (&node, true);
3932 queue = VEC_alloc (basic_block, heap, 10);
3933 new_irr = BITMAP_ALLOC (&tm_obstack);
3935 /* Scan each tm region, propagating irrevocable status through the tree. */
3938 old_irr = d->irrevocable_blocks_clone;
3939 VEC_quick_push (basic_block, queue, single_succ (ENTRY_BLOCK_PTR));
3940 if (ipa_tm_scan_irr_blocks (&queue, new_irr, old_irr, NULL))
3942 ipa_tm_propagate_irr (single_succ (ENTRY_BLOCK_PTR), new_irr,
3944 ret = bitmap_bit_p (new_irr, single_succ (ENTRY_BLOCK_PTR)->index);
3949 struct tm_region *region;
3951 old_irr = d->irrevocable_blocks_normal;
3952 for (region = d->all_tm_regions; region; region = region->next)
3954 VEC_quick_push (basic_block, queue, region->entry_block);
3955 if (ipa_tm_scan_irr_blocks (&queue, new_irr, old_irr,
3956 region->exit_blocks))
3957 ipa_tm_propagate_irr (region->entry_block, new_irr, old_irr,
3958 region->exit_blocks);
3962 /* If we found any new irrevocable blocks, reduce the call count for
3963 transactional clones within the irrevocable blocks. Save the new
3964 set of irrevocable blocks for next time. */
3965 if (!bitmap_empty_p (new_irr))
3967 bitmap_iterator bmi;
3970 EXECUTE_IF_SET_IN_BITMAP (new_irr, 0, i, bmi)
3971 ipa_tm_decrement_clone_counts (BASIC_BLOCK (i), for_clone);
3975 bitmap_ior_into (old_irr, new_irr);
3976 BITMAP_FREE (new_irr);
3979 d->irrevocable_blocks_clone = new_irr;
3981 d->irrevocable_blocks_normal = new_irr;
3983 if (dump_file && new_irr)
3986 bitmap_iterator bmi;
3989 dname = lang_hooks.decl_printable_name (current_function_decl, 2);
3990 EXECUTE_IF_SET_IN_BITMAP (new_irr, 0, i, bmi)
3991 fprintf (dump_file, "%s: bb %d goes irrevocable\n", dname, i);
3995 BITMAP_FREE (new_irr);
3997 VEC_free (basic_block, heap, queue);
3999 current_function_decl = NULL;
4004 /* Return true if, for the transactional clone of NODE, any call
4005 may enter irrevocable mode. */
4008 ipa_tm_mayenterirr_function (struct cgraph_node *node)
4010 struct tm_ipa_cg_data *d;
4014 d = get_cg_data (&node, true);
4016 flags = flags_from_decl_or_type (decl);
4018 /* Handle some TM builtins. Ordinarily these aren't actually generated
4019 at this point, but handling these functions when written in by the
4020 user makes it easier to build unit tests. */
4021 if (flags & ECF_TM_BUILTIN)
4024 /* Filter out all functions that are marked. */
4025 if (flags & ECF_TM_PURE)
4027 if (is_tm_safe (decl))
4029 if (is_tm_irrevocable (decl))
4031 if (is_tm_callable (decl))
4033 if (find_tm_replacement_function (decl))
4036 /* If we aren't seeing the final version of the function we don't
4037 know what it will contain at runtime. */
4038 if (cgraph_function_body_availability (node) < AVAIL_AVAILABLE)
4041 /* If the function must go irrevocable, then of course true. */
4042 if (d->is_irrevocable)
4045 /* If there are any blocks marked irrevocable, then the function
4046 as a whole may enter irrevocable. */
4047 if (d->irrevocable_blocks_clone)
4050 /* We may have previously marked this function as tm_may_enter_irr;
4051 see pass_diagnose_tm_blocks. */
4052 if (node->local.tm_may_enter_irr)
4055 /* Recurse on the main body for aliases. In general, this will
4056 result in one of the bits above being set so that we will not
4057 have to recurse next time. */
4059 return ipa_tm_mayenterirr_function (cgraph_get_node (node->thunk.alias));
4061 /* What remains is unmarked local functions without items that force
4062 the function to go irrevocable. */
4066 /* Diagnose calls from transaction_safe functions to unmarked
4067 functions that are determined to not be safe. */
4070 ipa_tm_diagnose_tm_safe (struct cgraph_node *node)
4072 struct cgraph_edge *e;
4074 for (e = node->callees; e ; e = e->next_callee)
4075 if (!is_tm_callable (e->callee->decl)
4076 && e->callee->local.tm_may_enter_irr)
4077 error_at (gimple_location (e->call_stmt),
4078 "unsafe function call %qD within "
4079 "%<transaction_safe%> function", e->callee->decl);
4082 /* Diagnose call from atomic transactions to unmarked functions
4083 that are determined to not be safe. */
4086 ipa_tm_diagnose_transaction (struct cgraph_node *node,
4087 struct tm_region *all_tm_regions)
4089 struct tm_region *r;
4091 for (r = all_tm_regions; r ; r = r->next)
4092 if (gimple_transaction_subcode (r->transaction_stmt) & GTMA_IS_RELAXED)
4094 /* Atomic transactions can be nested inside relaxed. */
4096 ipa_tm_diagnose_transaction (node, r->inner);
4100 VEC (basic_block, heap) *bbs;
4101 gimple_stmt_iterator gsi;
4105 bbs = get_tm_region_blocks (r->entry_block, r->exit_blocks,
4106 r->irr_blocks, NULL, false);
4108 for (i = 0; VEC_iterate (basic_block, bbs, i, bb); ++i)
4109 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
4111 gimple stmt = gsi_stmt (gsi);
4114 if (gimple_code (stmt) == GIMPLE_ASM)
4116 error_at (gimple_location (stmt),
4117 "asm not allowed in atomic transaction");
4121 if (!is_gimple_call (stmt))
4123 fndecl = gimple_call_fndecl (stmt);
4125 /* Indirect function calls have been diagnosed already. */
4129 /* Stop at the end of the transaction. */
4130 if (is_tm_ending_fndecl (fndecl))
4132 if (bitmap_bit_p (r->exit_blocks, bb->index))
4137 /* Marked functions have been diagnosed already. */
4138 if (is_tm_pure_call (stmt))
4140 if (is_tm_callable (fndecl))
4143 if (cgraph_local_info (fndecl)->tm_may_enter_irr)
4144 error_at (gimple_location (stmt),
4145 "unsafe function call %qD within "
4146 "atomic transaction", fndecl);
4149 VEC_free (basic_block, heap, bbs);
4153 /* Return a transactional mangled name for the DECL_ASSEMBLER_NAME in
4154 OLD_DECL. The returned value is a freshly malloced pointer that
4155 should be freed by the caller. */
4158 tm_mangle (tree old_asm_id)
4160 const char *old_asm_name;
4163 struct demangle_component *dc;
4166 /* Determine if the symbol is already a valid C++ mangled name. Do this
4167 even for C, which might be interfacing with C++ code via appropriately
4168 ugly identifiers. */
4169 /* ??? We could probably do just as well checking for "_Z" and be done. */
4170 old_asm_name = IDENTIFIER_POINTER (old_asm_id);
4171 dc = cplus_demangle_v3_components (old_asm_name, DMGL_NO_OPTS, &alloc);
4178 sprintf (length, "%u", IDENTIFIER_LENGTH (old_asm_id));
4179 tm_name = concat ("_ZGTt", length, old_asm_name, NULL);
4183 old_asm_name += 2; /* Skip _Z */
4187 case DEMANGLE_COMPONENT_TRANSACTION_CLONE:
4188 case DEMANGLE_COMPONENT_NONTRANSACTION_CLONE:
4189 /* Don't play silly games, you! */
4192 case DEMANGLE_COMPONENT_HIDDEN_ALIAS:
4193 /* I'd really like to know if we can ever be passed one of
4194 these from the C++ front end. The Logical Thing would
4195 seem that hidden-alias should be outer-most, so that we
4196 get hidden-alias of a transaction-clone and not vice-versa. */
4204 tm_name = concat ("_ZGTt", old_asm_name, NULL);
4208 new_asm_id = get_identifier (tm_name);
4215 ipa_tm_mark_needed_node (struct cgraph_node *node)
4217 cgraph_mark_needed_node (node);
4218 /* ??? function_and_variable_visibility will reset
4219 the needed bit, without actually checking. */
4223 /* Callback data for ipa_tm_create_version_alias. */
4224 struct create_version_alias_info
4226 struct cgraph_node *old_node;
4230 /* A subroutine of ipa_tm_create_version, called via
4231 cgraph_for_node_and_aliases. Create new tm clones for each of
4232 the existing aliases. */
4234 ipa_tm_create_version_alias (struct cgraph_node *node, void *data)
4236 struct create_version_alias_info *info
4237 = (struct create_version_alias_info *)data;
4238 tree old_decl, new_decl, tm_name;
4239 struct cgraph_node *new_node;
4241 if (!node->same_body_alias)
4244 old_decl = node->decl;
4245 tm_name = tm_mangle (DECL_ASSEMBLER_NAME (old_decl));
4246 new_decl = build_decl (DECL_SOURCE_LOCATION (old_decl),
4247 TREE_CODE (old_decl), tm_name,
4248 TREE_TYPE (old_decl));
4250 SET_DECL_ASSEMBLER_NAME (new_decl, tm_name);
4251 SET_DECL_RTL (new_decl, NULL);
4253 /* Based loosely on C++'s make_alias_for(). */
4254 TREE_PUBLIC (new_decl) = TREE_PUBLIC (old_decl);
4255 DECL_CONTEXT (new_decl) = DECL_CONTEXT (old_decl);
4256 DECL_LANG_SPECIFIC (new_decl) = DECL_LANG_SPECIFIC (old_decl);
4257 TREE_READONLY (new_decl) = TREE_READONLY (old_decl);
4258 DECL_EXTERNAL (new_decl) = 0;
4259 DECL_ARTIFICIAL (new_decl) = 1;
4260 TREE_ADDRESSABLE (new_decl) = 1;
4261 TREE_USED (new_decl) = 1;
4262 TREE_SYMBOL_REFERENCED (tm_name) = 1;
4264 /* Perform the same remapping to the comdat group. */
4265 if (DECL_ONE_ONLY (new_decl))
4266 DECL_COMDAT_GROUP (new_decl) = tm_mangle (DECL_COMDAT_GROUP (old_decl));
4268 new_node = cgraph_same_body_alias (NULL, new_decl, info->new_decl);
4269 new_node->tm_clone = true;
4270 new_node->local.externally_visible = info->old_node->local.externally_visible;
4271 /* ?? Do not traverse aliases here. */
4272 get_cg_data (&node, false)->clone = new_node;
4274 record_tm_clone_pair (old_decl, new_decl);
4276 if (info->old_node->needed)
4277 ipa_tm_mark_needed_node (new_node);
4281 /* Create a copy of the function (possibly declaration only) of OLD_NODE,
4282 appropriate for the transactional clone. */
4285 ipa_tm_create_version (struct cgraph_node *old_node)
4287 tree new_decl, old_decl, tm_name;
4288 struct cgraph_node *new_node;
4290 old_decl = old_node->decl;
4291 new_decl = copy_node (old_decl);
4293 /* DECL_ASSEMBLER_NAME needs to be set before we call
4294 cgraph_copy_node_for_versioning below, because cgraph_node will
4295 fill the assembler_name_hash. */
4296 tm_name = tm_mangle (DECL_ASSEMBLER_NAME (old_decl));
4297 SET_DECL_ASSEMBLER_NAME (new_decl, tm_name);
4298 SET_DECL_RTL (new_decl, NULL);
4299 TREE_SYMBOL_REFERENCED (tm_name) = 1;
4301 /* Perform the same remapping to the comdat group. */
4302 if (DECL_ONE_ONLY (new_decl))
4303 DECL_COMDAT_GROUP (new_decl) = tm_mangle (DECL_COMDAT_GROUP (old_decl));
4305 new_node = cgraph_copy_node_for_versioning (old_node, new_decl, NULL, NULL);
4306 new_node->local.externally_visible = old_node->local.externally_visible;
4307 new_node->lowered = true;
4308 new_node->tm_clone = 1;
4309 get_cg_data (&old_node, true)->clone = new_node;
4311 if (cgraph_function_body_availability (old_node) >= AVAIL_OVERWRITABLE)
4313 /* Remap extern inline to static inline. */
4314 /* ??? Is it worth trying to use make_decl_one_only? */
4315 if (DECL_DECLARED_INLINE_P (new_decl) && DECL_EXTERNAL (new_decl))
4317 DECL_EXTERNAL (new_decl) = 0;
4318 TREE_PUBLIC (new_decl) = 0;
4319 DECL_WEAK (new_decl) = 0;
4322 tree_function_versioning (old_decl, new_decl, NULL, false, NULL, false,
4326 record_tm_clone_pair (old_decl, new_decl);
4328 cgraph_call_function_insertion_hooks (new_node);
4329 if (old_node->needed)
4330 ipa_tm_mark_needed_node (new_node);
4332 /* Do the same thing, but for any aliases of the original node. */
4334 struct create_version_alias_info data;
4335 data.old_node = old_node;
4336 data.new_decl = new_decl;
4337 cgraph_for_node_and_aliases (old_node, ipa_tm_create_version_alias,
4342 /* Construct a call to TM_IRREVOCABLE and insert it at the beginning of BB. */
4345 ipa_tm_insert_irr_call (struct cgraph_node *node, struct tm_region *region,
4348 gimple_stmt_iterator gsi;
4351 transaction_subcode_ior (region, GTMA_MAY_ENTER_IRREVOCABLE);
4353 g = gimple_build_call (builtin_decl_explicit (BUILT_IN_TM_IRREVOCABLE),
4354 1, build_int_cst (NULL_TREE, MODE_SERIALIRREVOCABLE));
4356 split_block_after_labels (bb);
4357 gsi = gsi_after_labels (bb);
4358 gsi_insert_before (&gsi, g, GSI_SAME_STMT);
4360 cgraph_create_edge (node,
4361 cgraph_get_create_node
4362 (builtin_decl_explicit (BUILT_IN_TM_IRREVOCABLE)),
4364 compute_call_stmt_bb_frequency (node->decl,
4368 /* Construct a call to TM_GETTMCLONE and insert it before GSI. */
4371 ipa_tm_insert_gettmclone_call (struct cgraph_node *node,
4372 struct tm_region *region,
4373 gimple_stmt_iterator *gsi, gimple stmt)
4375 tree gettm_fn, ret, old_fn, callfn;
4379 old_fn = gimple_call_fn (stmt);
4381 if (TREE_CODE (old_fn) == ADDR_EXPR)
4383 tree fndecl = TREE_OPERAND (old_fn, 0);
4384 tree clone = get_tm_clone_pair (fndecl);
4386 /* By transforming the call into a TM_GETTMCLONE, we are
4387 technically taking the address of the original function and
4388 its clone. Explain this so inlining will know this function
4390 cgraph_mark_address_taken_node (cgraph_get_node (fndecl));
4392 cgraph_mark_address_taken_node (cgraph_get_node (clone));
4395 safe = is_tm_safe (TREE_TYPE (old_fn));
4396 gettm_fn = builtin_decl_explicit (safe ? BUILT_IN_TM_GETTMCLONE_SAFE
4397 : BUILT_IN_TM_GETTMCLONE_IRR);
4398 ret = create_tmp_var (ptr_type_node, NULL);
4399 add_referenced_var (ret);
4402 transaction_subcode_ior (region, GTMA_MAY_ENTER_IRREVOCABLE);
4404 /* Discard OBJ_TYPE_REF, since we weren't able to fold it. */
4405 if (TREE_CODE (old_fn) == OBJ_TYPE_REF)
4406 old_fn = OBJ_TYPE_REF_EXPR (old_fn);
4408 g = gimple_build_call (gettm_fn, 1, old_fn);
4409 ret = make_ssa_name (ret, g);
4410 gimple_call_set_lhs (g, ret);
4412 gsi_insert_before (gsi, g, GSI_SAME_STMT);
4414 cgraph_create_edge (node, cgraph_get_create_node (gettm_fn), g, 0,
4415 compute_call_stmt_bb_frequency (node->decl,
4418 /* Cast return value from tm_gettmclone* into appropriate function
4420 callfn = create_tmp_var (TREE_TYPE (old_fn), NULL);
4421 add_referenced_var (callfn);
4422 g2 = gimple_build_assign (callfn,
4423 fold_build1 (NOP_EXPR, TREE_TYPE (callfn), ret));
4424 callfn = make_ssa_name (callfn, g2);
4425 gimple_assign_set_lhs (g2, callfn);
4426 gsi_insert_before (gsi, g2, GSI_SAME_STMT);
4428 /* ??? This is a hack to preserve the NOTHROW bit on the call,
4429 which we would have derived from the decl. Failure to save
4430 this bit means we might have to split the basic block. */
4431 if (gimple_call_nothrow_p (stmt))
4432 gimple_call_set_nothrow (stmt, true);
4434 gimple_call_set_fn (stmt, callfn);
4436 /* Discarding OBJ_TYPE_REF above may produce incompatible LHS and RHS
4437 for a call statement. Fix it. */
4439 tree lhs = gimple_call_lhs (stmt);
4440 tree rettype = TREE_TYPE (gimple_call_fntype (stmt));
4442 && !useless_type_conversion_p (TREE_TYPE (lhs), rettype))
4446 temp = make_rename_temp (rettype, 0);
4447 gimple_call_set_lhs (stmt, temp);
4449 g2 = gimple_build_assign (lhs,
4450 fold_build1 (VIEW_CONVERT_EXPR,
4451 TREE_TYPE (lhs), temp));
4452 gsi_insert_after (gsi, g2, GSI_SAME_STMT);
4461 /* Helper function for ipa_tm_transform_calls*. Given a call
4462 statement in GSI which resides inside transaction REGION, redirect
4463 the call to either its wrapper function, or its clone. */
4466 ipa_tm_transform_calls_redirect (struct cgraph_node *node,
4467 struct tm_region *region,
4468 gimple_stmt_iterator *gsi,
4469 bool *need_ssa_rename_p)
4471 gimple stmt = gsi_stmt (*gsi);
4472 struct cgraph_node *new_node;
4473 struct cgraph_edge *e = cgraph_edge (node, stmt);
4474 tree fndecl = gimple_call_fndecl (stmt);
4476 /* For indirect calls, pass the address through the runtime. */
4479 *need_ssa_rename_p |=
4480 ipa_tm_insert_gettmclone_call (node, region, gsi, stmt);
4484 /* Handle some TM builtins. Ordinarily these aren't actually generated
4485 at this point, but handling these functions when written in by the
4486 user makes it easier to build unit tests. */
4487 if (flags_from_decl_or_type (fndecl) & ECF_TM_BUILTIN)
4490 /* Fixup recursive calls inside clones. */
4491 /* ??? Why did cgraph_copy_node_for_versioning update the call edges
4492 for recursion but not update the call statements themselves? */
4493 if (e->caller == e->callee && decl_is_tm_clone (current_function_decl))
4495 gimple_call_set_fndecl (stmt, current_function_decl);
4499 /* If there is a replacement, use it. */
4500 fndecl = find_tm_replacement_function (fndecl);
4503 new_node = cgraph_get_create_node (fndecl);
4505 /* ??? Mark all transaction_wrap functions tm_may_enter_irr.
4507 We can't do this earlier in record_tm_replacement because
4508 cgraph_remove_unreachable_nodes is called before we inject
4509 references to the node. Further, we can't do this in some
4510 nice central place in ipa_tm_execute because we don't have
4511 the exact list of wrapper functions that would be used.
4512 Marking more wrappers than necessary results in the creation
4513 of unnecessary cgraph_nodes, which can cause some of the
4514 other IPA passes to crash.
4516 We do need to mark these nodes so that we get the proper
4517 result in expand_call_tm. */
4518 /* ??? This seems broken. How is it that we're marking the
4519 CALLEE as may_enter_irr? Surely we should be marking the
4520 CALLER. Also note that find_tm_replacement_function also
4521 contains mappings into the TM runtime, e.g. memcpy. These
4522 we know won't go irrevocable. */
4523 new_node->local.tm_may_enter_irr = 1;
4527 struct tm_ipa_cg_data *d;
4528 struct cgraph_node *tnode = e->callee;
4530 d = get_cg_data (&tnode, true);
4531 new_node = d->clone;
4533 /* As we've already skipped pure calls and appropriate builtins,
4534 and we've already marked irrevocable blocks, if we can't come
4535 up with a static replacement, then ask the runtime. */
4536 if (new_node == NULL)
4538 *need_ssa_rename_p |=
4539 ipa_tm_insert_gettmclone_call (node, region, gsi, stmt);
4543 fndecl = new_node->decl;
4546 cgraph_redirect_edge_callee (e, new_node);
4547 gimple_call_set_fndecl (stmt, fndecl);
4550 /* Helper function for ipa_tm_transform_calls. For a given BB,
4551 install calls to tm_irrevocable when IRR_BLOCKS are reached,
4552 redirect other calls to the generated transactional clone. */
4555 ipa_tm_transform_calls_1 (struct cgraph_node *node, struct tm_region *region,
4556 basic_block bb, bitmap irr_blocks)
4558 gimple_stmt_iterator gsi;
4559 bool need_ssa_rename = false;
4561 if (irr_blocks && bitmap_bit_p (irr_blocks, bb->index))
4563 ipa_tm_insert_irr_call (node, region, bb);
4567 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
4569 gimple stmt = gsi_stmt (gsi);
4571 if (!is_gimple_call (stmt))
4573 if (is_tm_pure_call (stmt))
4576 /* Redirect edges to the appropriate replacement or clone. */
4577 ipa_tm_transform_calls_redirect (node, region, &gsi, &need_ssa_rename);
4580 return need_ssa_rename;
4583 /* Walk the CFG for REGION, beginning at BB. Install calls to
4584 tm_irrevocable when IRR_BLOCKS are reached, redirect other calls to
4585 the generated transactional clone. */
4588 ipa_tm_transform_calls (struct cgraph_node *node, struct tm_region *region,
4589 basic_block bb, bitmap irr_blocks)
4591 bool need_ssa_rename = false;
4594 VEC(basic_block, heap) *queue = NULL;
4595 bitmap visited_blocks = BITMAP_ALLOC (NULL);
4597 VEC_safe_push (basic_block, heap, queue, bb);
4600 bb = VEC_pop (basic_block, queue);
4603 ipa_tm_transform_calls_1 (node, region, bb, irr_blocks);
4605 if (irr_blocks && bitmap_bit_p (irr_blocks, bb->index))
4608 if (region && bitmap_bit_p (region->exit_blocks, bb->index))
4611 FOR_EACH_EDGE (e, ei, bb->succs)
4612 if (!bitmap_bit_p (visited_blocks, e->dest->index))
4614 bitmap_set_bit (visited_blocks, e->dest->index);
4615 VEC_safe_push (basic_block, heap, queue, e->dest);
4618 while (!VEC_empty (basic_block, queue));
4620 VEC_free (basic_block, heap, queue);
4621 BITMAP_FREE (visited_blocks);
4623 return need_ssa_rename;
4626 /* Transform the calls within the TM regions within NODE. */
4629 ipa_tm_transform_transaction (struct cgraph_node *node)
4631 struct tm_ipa_cg_data *d;
4632 struct tm_region *region;
4633 bool need_ssa_rename = false;
4635 d = get_cg_data (&node, true);
4637 current_function_decl = node->decl;
4638 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
4639 calculate_dominance_info (CDI_DOMINATORS);
4641 for (region = d->all_tm_regions; region; region = region->next)
4643 /* If we're sure to go irrevocable, don't transform anything. */
4644 if (d->irrevocable_blocks_normal
4645 && bitmap_bit_p (d->irrevocable_blocks_normal,
4646 region->entry_block->index))
4648 transaction_subcode_ior (region, GTMA_DOES_GO_IRREVOCABLE);
4649 transaction_subcode_ior (region, GTMA_MAY_ENTER_IRREVOCABLE);
4654 ipa_tm_transform_calls (node, region, region->entry_block,
4655 d->irrevocable_blocks_normal);
4658 if (need_ssa_rename)
4659 update_ssa (TODO_update_ssa_only_virtuals);
4662 current_function_decl = NULL;
4665 /* Transform the calls within the transactional clone of NODE. */
4668 ipa_tm_transform_clone (struct cgraph_node *node)
4670 struct tm_ipa_cg_data *d;
4671 bool need_ssa_rename;
4673 d = get_cg_data (&node, true);
4675 /* If this function makes no calls and has no irrevocable blocks,
4676 then there's nothing to do. */
4677 /* ??? Remove non-aborting top-level transactions. */
4678 if (!node->callees && !d->irrevocable_blocks_clone)
4681 current_function_decl = d->clone->decl;
4682 push_cfun (DECL_STRUCT_FUNCTION (current_function_decl));
4683 calculate_dominance_info (CDI_DOMINATORS);
4686 ipa_tm_transform_calls (d->clone, NULL, single_succ (ENTRY_BLOCK_PTR),
4687 d->irrevocable_blocks_clone);
4689 if (need_ssa_rename)
4690 update_ssa (TODO_update_ssa_only_virtuals);
4693 current_function_decl = NULL;
4696 /* Main entry point for the transactional memory IPA pass. */
4699 ipa_tm_execute (void)
4701 cgraph_node_queue tm_callees = NULL;
4702 /* List of functions that will go irrevocable. */
4703 cgraph_node_queue irr_worklist = NULL;
4705 struct cgraph_node *node;
4706 struct tm_ipa_cg_data *d;
4707 enum availability a;
4710 #ifdef ENABLE_CHECKING
4714 bitmap_obstack_initialize (&tm_obstack);
4716 /* For all local functions marked tm_callable, queue them. */
4717 for (node = cgraph_nodes; node; node = node->next)
4718 if (is_tm_callable (node->decl)
4719 && cgraph_function_body_availability (node) >= AVAIL_OVERWRITABLE)
4721 d = get_cg_data (&node, true);
4722 maybe_push_queue (node, &tm_callees, &d->in_callee_queue);
4725 /* For all local reachable functions... */
4726 for (node = cgraph_nodes; node; node = node->next)
4727 if (node->reachable && node->lowered
4728 && cgraph_function_body_availability (node) >= AVAIL_OVERWRITABLE)
4730 /* ... marked tm_pure, record that fact for the runtime by
4731 indicating that the pure function is its own tm_callable.
4732 No need to do this if the function's address can't be taken. */
4733 if (is_tm_pure (node->decl))
4735 if (!node->local.local)
4736 record_tm_clone_pair (node->decl, node->decl);
4740 current_function_decl = node->decl;
4741 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
4742 calculate_dominance_info (CDI_DOMINATORS);
4744 tm_region_init (NULL);
4747 d = get_cg_data (&node, true);
4749 /* Scan for calls that are in each transaction. */
4750 ipa_tm_scan_calls_transaction (d, &tm_callees);
4752 /* Put it in the worklist so we can scan the function
4753 later (ipa_tm_scan_irr_function) and mark the
4754 irrevocable blocks. */
4755 maybe_push_queue (node, &irr_worklist, &d->in_worklist);
4756 d->want_irr_scan_normal = true;
4760 current_function_decl = NULL;
4763 /* For every local function on the callee list, scan as if we will be
4764 creating a transactional clone, queueing all new functions we find
4766 for (i = 0; i < VEC_length (cgraph_node_p, tm_callees); ++i)
4768 node = VEC_index (cgraph_node_p, tm_callees, i);
4769 a = cgraph_function_body_availability (node);
4770 d = get_cg_data (&node, true);
4772 /* Put it in the worklist so we can scan the function later
4773 (ipa_tm_scan_irr_function) and mark the irrevocable
4775 maybe_push_queue (node, &irr_worklist, &d->in_worklist);
4777 /* Some callees cannot be arbitrarily cloned. These will always be
4778 irrevocable. Mark these now, so that we need not scan them. */
4779 if (is_tm_irrevocable (node->decl))
4780 ipa_tm_note_irrevocable (node, &irr_worklist);
4781 else if (a <= AVAIL_NOT_AVAILABLE
4782 && !is_tm_safe_or_pure (node->decl))
4783 ipa_tm_note_irrevocable (node, &irr_worklist);
4784 else if (a >= AVAIL_OVERWRITABLE)
4786 if (!tree_versionable_function_p (node->decl))
4787 ipa_tm_note_irrevocable (node, &irr_worklist);
4788 else if (!d->is_irrevocable)
4790 /* If this is an alias, make sure its base is queued as well.
4791 we need not scan the callees now, as the base will do. */
4794 node = cgraph_get_node (node->thunk.alias);
4795 d = get_cg_data (&node, true);
4796 maybe_push_queue (node, &tm_callees, &d->in_callee_queue);
4800 /* Add all nodes called by this function into
4801 tm_callees as well. */
4802 ipa_tm_scan_calls_clone (node, &tm_callees);
4807 /* Iterate scans until no more work to be done. Prefer not to use
4808 VEC_pop because the worklist tends to follow a breadth-first
4809 search of the callgraph, which should allow convergance with a
4810 minimum number of scans. But we also don't want the worklist
4811 array to grow without bound, so we shift the array up periodically. */
4812 for (i = 0; i < VEC_length (cgraph_node_p, irr_worklist); ++i)
4814 if (i > 256 && i == VEC_length (cgraph_node_p, irr_worklist) / 8)
4816 VEC_block_remove (cgraph_node_p, irr_worklist, 0, i);
4820 node = VEC_index (cgraph_node_p, irr_worklist, i);
4821 d = get_cg_data (&node, true);
4822 d->in_worklist = false;
4824 if (d->want_irr_scan_normal)
4826 d->want_irr_scan_normal = false;
4827 ipa_tm_scan_irr_function (node, false);
4829 if (d->in_callee_queue && ipa_tm_scan_irr_function (node, true))
4830 ipa_tm_note_irrevocable (node, &irr_worklist);
4833 /* For every function on the callee list, collect the tm_may_enter_irr
4835 VEC_truncate (cgraph_node_p, irr_worklist, 0);
4836 for (i = 0; i < VEC_length (cgraph_node_p, tm_callees); ++i)
4838 node = VEC_index (cgraph_node_p, tm_callees, i);
4839 if (ipa_tm_mayenterirr_function (node))
4841 d = get_cg_data (&node, true);
4842 gcc_assert (d->in_worklist == false);
4843 maybe_push_queue (node, &irr_worklist, &d->in_worklist);
4847 /* Propagate the tm_may_enter_irr bit to callers until stable. */
4848 for (i = 0; i < VEC_length (cgraph_node_p, irr_worklist); ++i)
4850 struct cgraph_node *caller;
4851 struct cgraph_edge *e;
4852 struct ipa_ref *ref;
4855 if (i > 256 && i == VEC_length (cgraph_node_p, irr_worklist) / 8)
4857 VEC_block_remove (cgraph_node_p, irr_worklist, 0, i);
4861 node = VEC_index (cgraph_node_p, irr_worklist, i);
4862 d = get_cg_data (&node, true);
4863 d->in_worklist = false;
4864 node->local.tm_may_enter_irr = true;
4866 /* Propagate back to normal callers. */
4867 for (e = node->callers; e ; e = e->next_caller)
4870 if (!is_tm_safe_or_pure (caller->decl)
4871 && !caller->local.tm_may_enter_irr)
4873 d = get_cg_data (&caller, true);
4874 maybe_push_queue (caller, &irr_worklist, &d->in_worklist);
4878 /* Propagate back to referring aliases as well. */
4879 for (j = 0; ipa_ref_list_refering_iterate (&node->ref_list, j, ref); j++)
4881 caller = ref->refering.cgraph_node;
4882 if (ref->use == IPA_REF_ALIAS
4883 && !caller->local.tm_may_enter_irr)
4885 /* ?? Do not traverse aliases here. */
4886 d = get_cg_data (&caller, false);
4887 maybe_push_queue (caller, &irr_worklist, &d->in_worklist);
4892 /* Now validate all tm_safe functions, and all atomic regions in
4894 for (node = cgraph_nodes; node; node = node->next)
4895 if (node->reachable && node->lowered
4896 && cgraph_function_body_availability (node) >= AVAIL_OVERWRITABLE)
4898 d = get_cg_data (&node, true);
4899 if (is_tm_safe (node->decl))
4900 ipa_tm_diagnose_tm_safe (node);
4901 else if (d->all_tm_regions)
4902 ipa_tm_diagnose_transaction (node, d->all_tm_regions);
4905 /* Create clones. Do those that are not irrevocable and have a
4906 positive call count. Do those publicly visible functions that
4907 the user directed us to clone. */
4908 for (i = 0; i < VEC_length (cgraph_node_p, tm_callees); ++i)
4912 node = VEC_index (cgraph_node_p, tm_callees, i);
4913 if (node->same_body_alias)
4916 a = cgraph_function_body_availability (node);
4917 d = get_cg_data (&node, true);
4919 if (a <= AVAIL_NOT_AVAILABLE)
4920 doit = is_tm_callable (node->decl);
4921 else if (a <= AVAIL_AVAILABLE && is_tm_callable (node->decl))
4923 else if (!d->is_irrevocable
4924 && d->tm_callers_normal + d->tm_callers_clone > 0)
4928 ipa_tm_create_version (node);
4931 /* Redirect calls to the new clones, and insert irrevocable marks. */
4932 for (i = 0; i < VEC_length (cgraph_node_p, tm_callees); ++i)
4934 node = VEC_index (cgraph_node_p, tm_callees, i);
4937 d = get_cg_data (&node, true);
4939 ipa_tm_transform_clone (node);
4942 for (node = cgraph_nodes; node; node = node->next)
4943 if (node->reachable && node->lowered
4944 && cgraph_function_body_availability (node) >= AVAIL_OVERWRITABLE)
4946 d = get_cg_data (&node, true);
4947 if (d->all_tm_regions)
4948 ipa_tm_transform_transaction (node);
4951 /* Free and clear all data structures. */
4952 VEC_free (cgraph_node_p, heap, tm_callees);
4953 VEC_free (cgraph_node_p, heap, irr_worklist);
4954 bitmap_obstack_release (&tm_obstack);
4956 for (node = cgraph_nodes; node; node = node->next)
4959 #ifdef ENABLE_CHECKING
4966 struct simple_ipa_opt_pass pass_ipa_tm =
4972 ipa_tm_execute, /* execute */
4975 0, /* static_pass_number */
4976 TV_TRANS_MEM, /* tv_id */
4977 PROP_ssa | PROP_cfg, /* properties_required */
4978 0, /* properties_provided */
4979 0, /* properties_destroyed */
4980 0, /* todo_flags_start */
4981 TODO_dump_func, /* todo_flags_finish */
4985 #include "gt-trans-mem.h"