symtab.c (section_hash): New hash.
[gcc.git] / gcc / tree-emutls.c
1 /* Lower TLS operations to emulation functions.
2 Copyright (C) 2006-2014 Free Software Foundation, Inc.
3
4 This file is part of GCC.
5
6 GCC is free software; you can redistribute it and/or modify it
7 under the terms of the GNU General Public License as published by the
8 Free Software Foundation; either version 3, or (at your option) any
9 later version.
10
11 GCC is distributed in the hope that it will be useful, but WITHOUT
12 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
15
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/>. */
19
20 #include "config.h"
21 #include "system.h"
22 #include "coretypes.h"
23 #include "tree.h"
24 #include "stor-layout.h"
25 #include "varasm.h"
26 #include "basic-block.h"
27 #include "tree-ssa-alias.h"
28 #include "internal-fn.h"
29 #include "gimple-expr.h"
30 #include "is-a.h"
31 #include "gimple.h"
32 #include "gimple-iterator.h"
33 #include "gimple-walk.h"
34 #include "tree-pass.h"
35 #include "gimple-ssa.h"
36 #include "cgraph.h"
37 #include "tree-phinodes.h"
38 #include "ssa-iterators.h"
39 #include "stringpool.h"
40 #include "tree-ssanames.h"
41 #include "langhooks.h"
42 #include "target.h"
43 #include "targhooks.h"
44 #include "tree-iterator.h"
45
46
47 /* Whenever a target does not support thread-local storage (TLS) natively,
48 we can emulate it with some run-time support in libgcc. This will in
49 turn rely on "keyed storage" a-la pthread_key_create; essentially all
50 thread libraries provide such functionality.
51
52 In order to coordinate with the libgcc runtime, each TLS variable is
53 described by a "control variable". This control variable records the
54 required size, alignment, and initial value of the TLS variable for
55 instantiation at runtime. It also stores an integer token to be used
56 by the runtime to find the address of the variable within each thread.
57
58 On the compiler side, this means that we need to replace all instances
59 of "tls_var" in the code with "*__emutls_get_addr(&control_var)". We
60 also need to eliminate "tls_var" from the symbol table and introduce
61 "control_var".
62
63 We used to perform all of the transformations during conversion to rtl,
64 and the variable substitutions magically within assemble_variable.
65 However, this late fiddling of the symbol table conflicts with LTO and
66 whole-program compilation. Therefore we must now make all the changes
67 to the symbol table early in the GIMPLE optimization path, before we
68 write things out to LTO intermediate files. */
69
70 /* These two vectors, once fully populated, are kept in lock-step so that
71 the index of a TLS variable equals the index of its control variable in
72 the other vector. */
73 static varpool_node_set tls_vars;
74 static vec<varpool_node_ptr> control_vars;
75
76 /* For the current basic block, an SSA_NAME that has computed the address
77 of the TLS variable at the corresponding index. */
78 static vec<tree> access_vars;
79
80 /* The type of the control structure, shared with the emutls.c runtime. */
81 static tree emutls_object_type;
82
83 #if !defined (NO_DOT_IN_LABEL)
84 # define EMUTLS_SEPARATOR "."
85 #elif !defined (NO_DOLLAR_IN_LABEL)
86 # define EMUTLS_SEPARATOR "$"
87 #else
88 # define EMUTLS_SEPARATOR "_"
89 #endif
90
91 /* Create an IDENTIFIER_NODE by prefixing PREFIX to the
92 IDENTIFIER_NODE NAME's name. */
93
94 static tree
95 prefix_name (const char *prefix, tree name)
96 {
97 unsigned plen = strlen (prefix);
98 unsigned nlen = strlen (IDENTIFIER_POINTER (name));
99 char *toname = (char *) alloca (plen + nlen + 1);
100
101 memcpy (toname, prefix, plen);
102 memcpy (toname + plen, IDENTIFIER_POINTER (name), nlen + 1);
103
104 return get_identifier (toname);
105 }
106
107 /* Create an identifier for the struct __emutls_object, given an identifier
108 of the DECL_ASSEMBLY_NAME of the original object. */
109
110 static tree
111 get_emutls_object_name (tree name)
112 {
113 const char *prefix = (targetm.emutls.var_prefix
114 ? targetm.emutls.var_prefix
115 : "__emutls_v" EMUTLS_SEPARATOR);
116 return prefix_name (prefix, name);
117 }
118
119 /* Create the fields of the type for the control variables. Ordinarily
120 this must match struct __emutls_object defined in emutls.c. However
121 this is a target hook so that VxWorks can define its own layout. */
122
123 tree
124 default_emutls_var_fields (tree type, tree *name ATTRIBUTE_UNUSED)
125 {
126 tree word_type_node, field, next_field;
127
128 field = build_decl (UNKNOWN_LOCATION,
129 FIELD_DECL, get_identifier ("__templ"), ptr_type_node);
130 DECL_CONTEXT (field) = type;
131 next_field = field;
132
133 field = build_decl (UNKNOWN_LOCATION,
134 FIELD_DECL, get_identifier ("__offset"),
135 ptr_type_node);
136 DECL_CONTEXT (field) = type;
137 DECL_CHAIN (field) = next_field;
138 next_field = field;
139
140 word_type_node = lang_hooks.types.type_for_mode (word_mode, 1);
141 field = build_decl (UNKNOWN_LOCATION,
142 FIELD_DECL, get_identifier ("__align"),
143 word_type_node);
144 DECL_CONTEXT (field) = type;
145 DECL_CHAIN (field) = next_field;
146 next_field = field;
147
148 field = build_decl (UNKNOWN_LOCATION,
149 FIELD_DECL, get_identifier ("__size"), word_type_node);
150 DECL_CONTEXT (field) = type;
151 DECL_CHAIN (field) = next_field;
152
153 return field;
154 }
155
156 /* Initialize emulated tls object TO, which refers to TLS variable DECL and
157 is initialized by PROXY. As above, this is the default implementation of
158 a target hook overridden by VxWorks. */
159
160 tree
161 default_emutls_var_init (tree to, tree decl, tree proxy)
162 {
163 vec<constructor_elt, va_gc> *v;
164 vec_alloc (v, 4);
165 constructor_elt elt;
166 tree type = TREE_TYPE (to);
167 tree field = TYPE_FIELDS (type);
168
169 elt.index = field;
170 elt.value = fold_convert (TREE_TYPE (field), DECL_SIZE_UNIT (decl));
171 v->quick_push (elt);
172
173 field = DECL_CHAIN (field);
174 elt.index = field;
175 elt.value = build_int_cst (TREE_TYPE (field),
176 DECL_ALIGN_UNIT (decl));
177 v->quick_push (elt);
178
179 field = DECL_CHAIN (field);
180 elt.index = field;
181 elt.value = null_pointer_node;
182 v->quick_push (elt);
183
184 field = DECL_CHAIN (field);
185 elt.index = field;
186 elt.value = proxy;
187 v->quick_push (elt);
188
189 return build_constructor (type, v);
190 }
191
192 /* Create the structure for struct __emutls_object. This should match the
193 structure at the top of emutls.c, modulo the union there. */
194
195 static tree
196 get_emutls_object_type (void)
197 {
198 tree type, type_name, field;
199
200 type = emutls_object_type;
201 if (type)
202 return type;
203
204 emutls_object_type = type = lang_hooks.types.make_type (RECORD_TYPE);
205 type_name = NULL;
206 field = targetm.emutls.var_fields (type, &type_name);
207 if (!type_name)
208 type_name = get_identifier ("__emutls_object");
209 type_name = build_decl (UNKNOWN_LOCATION,
210 TYPE_DECL, type_name, type);
211 TYPE_NAME (type) = type_name;
212 TYPE_FIELDS (type) = field;
213 layout_type (type);
214
215 return type;
216 }
217
218 /* Create a read-only variable like DECL, with the same DECL_INITIAL.
219 This will be used for initializing the emulated tls data area. */
220
221 static tree
222 get_emutls_init_templ_addr (tree decl)
223 {
224 tree name, to;
225
226 if (targetm.emutls.register_common && !DECL_INITIAL (decl)
227 && !DECL_SECTION_NAME (decl))
228 return null_pointer_node;
229
230 name = DECL_ASSEMBLER_NAME (decl);
231 if (!targetm.emutls.tmpl_prefix || targetm.emutls.tmpl_prefix[0])
232 {
233 const char *prefix = (targetm.emutls.tmpl_prefix
234 ? targetm.emutls.tmpl_prefix
235 : "__emutls_t" EMUTLS_SEPARATOR);
236 name = prefix_name (prefix, name);
237 }
238
239 to = build_decl (DECL_SOURCE_LOCATION (decl),
240 VAR_DECL, name, TREE_TYPE (decl));
241 SET_DECL_ASSEMBLER_NAME (to, DECL_NAME (to));
242
243 DECL_ARTIFICIAL (to) = 1;
244 TREE_USED (to) = TREE_USED (decl);
245 TREE_READONLY (to) = 1;
246 DECL_IGNORED_P (to) = 1;
247 DECL_CONTEXT (to) = DECL_CONTEXT (decl);
248 DECL_PRESERVE_P (to) = DECL_PRESERVE_P (decl);
249
250 DECL_WEAK (to) = DECL_WEAK (decl);
251 if (DECL_ONE_ONLY (decl))
252 {
253 make_decl_one_only (to, DECL_ASSEMBLER_NAME (to));
254 TREE_STATIC (to) = TREE_STATIC (decl);
255 TREE_PUBLIC (to) = TREE_PUBLIC (decl);
256 DECL_VISIBILITY (to) = DECL_VISIBILITY (decl);
257 }
258 else
259 TREE_STATIC (to) = 1;
260
261 DECL_VISIBILITY_SPECIFIED (to) = DECL_VISIBILITY_SPECIFIED (decl);
262 DECL_INITIAL (to) = DECL_INITIAL (decl);
263 DECL_INITIAL (decl) = NULL;
264
265 if (targetm.emutls.tmpl_section)
266 {
267 set_decl_section_name (to, targetm.emutls.tmpl_section);
268 }
269 else
270 set_decl_section_name (to, DECL_SECTION_NAME (decl));
271
272 /* Create varpool node for the new variable and finalize it if it is
273 not external one. */
274 if (DECL_EXTERNAL (to))
275 varpool_node_for_decl (to);
276 else
277 varpool_add_new_variable (to);
278 return build_fold_addr_expr (to);
279 }
280
281 /* Create and return the control variable for the TLS variable DECL. */
282
283 static tree
284 new_emutls_decl (tree decl, tree alias_of)
285 {
286 tree name, to;
287
288 name = DECL_ASSEMBLER_NAME (decl);
289 to = build_decl (DECL_SOURCE_LOCATION (decl), VAR_DECL,
290 get_emutls_object_name (name),
291 get_emutls_object_type ());
292
293 SET_DECL_ASSEMBLER_NAME (to, DECL_NAME (to));
294
295 DECL_TLS_MODEL (to) = TLS_MODEL_EMULATED;
296 DECL_ARTIFICIAL (to) = 1;
297 DECL_IGNORED_P (to) = 1;
298 TREE_READONLY (to) = 0;
299 TREE_STATIC (to) = 1;
300
301 DECL_PRESERVE_P (to) = DECL_PRESERVE_P (decl);
302 DECL_CONTEXT (to) = DECL_CONTEXT (decl);
303 TREE_USED (to) = TREE_USED (decl);
304 TREE_PUBLIC (to) = TREE_PUBLIC (decl);
305 DECL_EXTERNAL (to) = DECL_EXTERNAL (decl);
306 DECL_COMMON (to) = DECL_COMMON (decl);
307 DECL_WEAK (to) = DECL_WEAK (decl);
308 DECL_VISIBILITY (to) = DECL_VISIBILITY (decl);
309 DECL_VISIBILITY_SPECIFIED (to) = DECL_VISIBILITY_SPECIFIED (decl);
310 DECL_DLLIMPORT_P (to) = DECL_DLLIMPORT_P (decl);
311
312 DECL_ATTRIBUTES (to) = targetm.merge_decl_attributes (decl, to);
313
314 if (DECL_ONE_ONLY (decl))
315 make_decl_one_only (to, DECL_ASSEMBLER_NAME (to));
316
317 /* If we're not allowed to change the proxy object's alignment,
318 pretend it has been set by the user. */
319 if (targetm.emutls.var_align_fixed)
320 DECL_USER_ALIGN (to) = 1;
321
322 /* If the target wants the control variables grouped, do so. */
323 if (!DECL_COMMON (to) && targetm.emutls.var_section)
324 {
325 set_decl_section_name (to, targetm.emutls.var_section);
326 }
327
328 /* If this variable is defined locally, then we need to initialize the
329 control structure with size and alignment information. Initialization
330 of COMMON block variables happens elsewhere via a constructor. */
331 if (!DECL_EXTERNAL (to)
332 && (!DECL_COMMON (to)
333 || (DECL_INITIAL (decl)
334 && DECL_INITIAL (decl) != error_mark_node)))
335 {
336 tree tmpl = get_emutls_init_templ_addr (decl);
337 DECL_INITIAL (to) = targetm.emutls.var_init (to, decl, tmpl);
338 record_references_in_initializer (to, false);
339 }
340
341 /* Create varpool node for the new variable and finalize it if it is
342 not external one. */
343 if (DECL_EXTERNAL (to))
344 varpool_node_for_decl (to);
345 else if (!alias_of)
346 varpool_add_new_variable (to);
347 else
348 varpool_create_variable_alias (to,
349 varpool_node_for_asm
350 (DECL_ASSEMBLER_NAME (DECL_VALUE_EXPR (alias_of)))->decl);
351 return to;
352 }
353
354 /* Look up the index of the TLS variable DECL. This index can then be
355 used in both the control_vars and access_vars arrays. */
356
357 static unsigned int
358 emutls_index (tree decl)
359 {
360 varpool_node_set_iterator i;
361
362 i = varpool_node_set_find (tls_vars, varpool_get_node (decl));
363 gcc_assert (i.index != ~0u);
364
365 return i.index;
366 }
367
368 /* Look up the control variable for the TLS variable DECL. */
369
370 static tree
371 emutls_decl (tree decl)
372 {
373 varpool_node *var;
374 unsigned int i;
375
376 i = emutls_index (decl);
377 var = control_vars[i];
378 return var->decl;
379 }
380
381 /* Generate a call statement to initialize CONTROL_DECL for TLS_DECL.
382 This only needs to happen for TLS COMMON variables; non-COMMON
383 variables can be initialized statically. Insert the generated
384 call statement at the end of PSTMTS. */
385
386 static void
387 emutls_common_1 (tree tls_decl, tree control_decl, tree *pstmts)
388 {
389 tree x;
390 tree word_type_node;
391
392 if (! DECL_COMMON (tls_decl)
393 || (DECL_INITIAL (tls_decl)
394 && DECL_INITIAL (tls_decl) != error_mark_node))
395 return;
396
397 word_type_node = lang_hooks.types.type_for_mode (word_mode, 1);
398
399 x = build_call_expr (builtin_decl_explicit (BUILT_IN_EMUTLS_REGISTER_COMMON),
400 4, build_fold_addr_expr (control_decl),
401 fold_convert (word_type_node,
402 DECL_SIZE_UNIT (tls_decl)),
403 build_int_cst (word_type_node,
404 DECL_ALIGN_UNIT (tls_decl)),
405 get_emutls_init_templ_addr (tls_decl));
406
407 append_to_statement_list (x, pstmts);
408 }
409
410 struct lower_emutls_data
411 {
412 struct cgraph_node *cfun_node;
413 struct cgraph_node *builtin_node;
414 tree builtin_decl;
415 basic_block bb;
416 int bb_freq;
417 location_t loc;
418 gimple_seq seq;
419 };
420
421 /* Given a TLS variable DECL, return an SSA_NAME holding its address.
422 Append any new computation statements required to D->SEQ. */
423
424 static tree
425 gen_emutls_addr (tree decl, struct lower_emutls_data *d)
426 {
427 unsigned int index;
428 tree addr;
429
430 /* Compute the address of the TLS variable with help from runtime. */
431 index = emutls_index (decl);
432 addr = access_vars[index];
433 if (addr == NULL)
434 {
435 varpool_node *cvar;
436 tree cdecl;
437 gimple x;
438
439 cvar = control_vars[index];
440 cdecl = cvar->decl;
441 TREE_ADDRESSABLE (cdecl) = 1;
442
443 addr = create_tmp_var (build_pointer_type (TREE_TYPE (decl)), NULL);
444 x = gimple_build_call (d->builtin_decl, 1, build_fold_addr_expr (cdecl));
445 gimple_set_location (x, d->loc);
446
447 addr = make_ssa_name (addr, x);
448 gimple_call_set_lhs (x, addr);
449
450 gimple_seq_add_stmt (&d->seq, x);
451
452 cgraph_create_edge (d->cfun_node, d->builtin_node, x,
453 d->bb->count, d->bb_freq);
454
455 /* We may be adding a new reference to a new variable to the function.
456 This means we have to play with the ipa-reference web. */
457 ipa_record_reference (d->cfun_node, cvar, IPA_REF_ADDR, x);
458
459 /* Record this ssa_name for possible use later in the basic block. */
460 access_vars[index] = addr;
461 }
462
463 return addr;
464 }
465
466 /* Callback for walk_gimple_op. D = WI->INFO is a struct lower_emutls_data.
467 Given an operand *PTR within D->STMT, if the operand references a TLS
468 variable, then lower the reference to a call to the runtime. Insert
469 any new statements required into D->SEQ; the caller is responsible for
470 placing those appropriately. */
471
472 static tree
473 lower_emutls_1 (tree *ptr, int *walk_subtrees, void *cb_data)
474 {
475 struct walk_stmt_info *wi = (struct walk_stmt_info *) cb_data;
476 struct lower_emutls_data *d = (struct lower_emutls_data *) wi->info;
477 tree t = *ptr;
478 bool is_addr = false;
479 tree addr;
480
481 *walk_subtrees = 0;
482
483 switch (TREE_CODE (t))
484 {
485 case ADDR_EXPR:
486 /* If this is not a straight-forward "&var", but rather something
487 like "&var.a", then we may need special handling. */
488 if (TREE_CODE (TREE_OPERAND (t, 0)) != VAR_DECL)
489 {
490 bool save_changed;
491
492 /* If we're allowed more than just is_gimple_val, continue. */
493 if (!wi->val_only)
494 {
495 *walk_subtrees = 1;
496 return NULL_TREE;
497 }
498
499 /* See if any substitution would be made. */
500 save_changed = wi->changed;
501 wi->changed = false;
502 wi->val_only = false;
503 walk_tree (&TREE_OPERAND (t, 0), lower_emutls_1, wi, NULL);
504 wi->val_only = true;
505
506 /* If so, then extract this entire sub-expression "&p->a" into a
507 new assignment statement, and substitute yet another SSA_NAME. */
508 if (wi->changed)
509 {
510 gimple x;
511
512 addr = create_tmp_var (TREE_TYPE (t), NULL);
513 x = gimple_build_assign (addr, t);
514 gimple_set_location (x, d->loc);
515
516 addr = make_ssa_name (addr, x);
517 gimple_assign_set_lhs (x, addr);
518
519 gimple_seq_add_stmt (&d->seq, x);
520
521 *ptr = addr;
522 }
523 else
524 wi->changed = save_changed;
525
526 return NULL_TREE;
527 }
528
529 t = TREE_OPERAND (t, 0);
530 is_addr = true;
531 /* FALLTHRU */
532
533 case VAR_DECL:
534 if (!DECL_THREAD_LOCAL_P (t))
535 return NULL_TREE;
536 break;
537
538 default:
539 /* We're not interested in other decls or types, only subexpressions. */
540 if (EXPR_P (t))
541 *walk_subtrees = 1;
542 /* FALLTHRU */
543
544 case SSA_NAME:
545 /* Special-case the return of SSA_NAME, since it's so common. */
546 return NULL_TREE;
547 }
548
549 addr = gen_emutls_addr (t, d);
550 if (is_addr)
551 {
552 /* Replace "&var" with "addr" in the statement. */
553 *ptr = addr;
554 }
555 else
556 {
557 /* Replace "var" with "*addr" in the statement. */
558 t = build2 (MEM_REF, TREE_TYPE (t), addr,
559 build_int_cst (TREE_TYPE (addr), 0));
560 *ptr = t;
561 }
562
563 wi->changed = true;
564 return NULL_TREE;
565 }
566
567 /* Lower all of the operands of STMT. */
568
569 static void
570 lower_emutls_stmt (gimple stmt, struct lower_emutls_data *d)
571 {
572 struct walk_stmt_info wi;
573
574 d->loc = gimple_location (stmt);
575
576 memset (&wi, 0, sizeof (wi));
577 wi.info = d;
578 wi.val_only = true;
579 walk_gimple_op (stmt, lower_emutls_1, &wi);
580
581 if (wi.changed)
582 update_stmt (stmt);
583 }
584
585 /* Lower the I'th operand of PHI. */
586
587 static void
588 lower_emutls_phi_arg (gimple phi, unsigned int i, struct lower_emutls_data *d)
589 {
590 struct walk_stmt_info wi;
591 struct phi_arg_d *pd = gimple_phi_arg (phi, i);
592
593 /* Early out for a very common case we don't care about. */
594 if (TREE_CODE (pd->def) == SSA_NAME)
595 return;
596
597 d->loc = pd->locus;
598
599 memset (&wi, 0, sizeof (wi));
600 wi.info = d;
601 wi.val_only = true;
602 walk_tree (&pd->def, lower_emutls_1, &wi, NULL);
603
604 /* For normal statements, we let update_stmt do its job. But for phi
605 nodes, we have to manipulate the immediate use list by hand. */
606 if (wi.changed)
607 {
608 gcc_assert (TREE_CODE (pd->def) == SSA_NAME);
609 link_imm_use_stmt (&pd->imm_use, pd->def, phi);
610 }
611 }
612
613 /* Clear the ACCESS_VARS array, in order to begin a new block. */
614
615 static inline void
616 clear_access_vars (void)
617 {
618 memset (access_vars.address (), 0,
619 access_vars.length () * sizeof (tree));
620 }
621
622 /* Lower the entire function NODE. */
623
624 static void
625 lower_emutls_function_body (struct cgraph_node *node)
626 {
627 struct lower_emutls_data d;
628 bool any_edge_inserts = false;
629
630 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
631
632 d.cfun_node = node;
633 d.builtin_decl = builtin_decl_explicit (BUILT_IN_EMUTLS_GET_ADDRESS);
634 /* This is where we introduce the declaration to the IL and so we have to
635 create a node for it. */
636 d.builtin_node = cgraph_get_create_node (d.builtin_decl);
637
638 FOR_EACH_BB_FN (d.bb, cfun)
639 {
640 gimple_stmt_iterator gsi;
641 unsigned int i, nedge;
642
643 /* Lower each of the PHI nodes of the block, as we may have
644 propagated &tlsvar into a PHI argument. These loops are
645 arranged so that we process each edge at once, and each
646 PHI argument for that edge. */
647 if (!gimple_seq_empty_p (phi_nodes (d.bb)))
648 {
649 /* The calls will be inserted on the edges, and the frequencies
650 will be computed during the commit process. */
651 d.bb_freq = 0;
652
653 nedge = EDGE_COUNT (d.bb->preds);
654 for (i = 0; i < nedge; ++i)
655 {
656 edge e = EDGE_PRED (d.bb, i);
657
658 /* We can re-use any SSA_NAME created on this edge. */
659 clear_access_vars ();
660 d.seq = NULL;
661
662 for (gsi = gsi_start_phis (d.bb);
663 !gsi_end_p (gsi);
664 gsi_next (&gsi))
665 lower_emutls_phi_arg (gsi_stmt (gsi), i, &d);
666
667 /* Insert all statements generated by all phi nodes for this
668 particular edge all at once. */
669 if (d.seq)
670 {
671 gsi_insert_seq_on_edge (e, d.seq);
672 any_edge_inserts = true;
673 }
674 }
675 }
676
677 d.bb_freq = compute_call_stmt_bb_frequency (current_function_decl, d.bb);
678
679 /* We can re-use any SSA_NAME created during this basic block. */
680 clear_access_vars ();
681
682 /* Lower each of the statements of the block. */
683 for (gsi = gsi_start_bb (d.bb); !gsi_end_p (gsi); gsi_next (&gsi))
684 {
685 d.seq = NULL;
686 lower_emutls_stmt (gsi_stmt (gsi), &d);
687
688 /* If any new statements were created, insert them immediately
689 before the first use. This prevents variable lifetimes from
690 becoming unnecessarily long. */
691 if (d.seq)
692 gsi_insert_seq_before (&gsi, d.seq, GSI_SAME_STMT);
693 }
694 }
695
696 if (any_edge_inserts)
697 gsi_commit_edge_inserts ();
698
699 pop_cfun ();
700 }
701
702 /* Create emutls variable for VAR, DATA is pointer to static
703 ctor body we can add constructors to.
704 Callback for varpool_for_variable_and_aliases. */
705
706 static bool
707 create_emultls_var (varpool_node *var, void *data)
708 {
709 tree cdecl;
710 varpool_node *cvar;
711
712 cdecl = new_emutls_decl (var->decl,
713 var->alias && var->analyzed
714 ? varpool_alias_target (var)->decl : NULL);
715
716 cvar = varpool_get_node (cdecl);
717 control_vars.quick_push (cvar);
718
719 if (!var->alias)
720 {
721 /* Make sure the COMMON block control variable gets initialized.
722 Note that there's no point in doing this for aliases; we only
723 need to do this once for the main variable. */
724 emutls_common_1 (var->decl, cdecl, (tree *)data);
725 }
726 if (var->alias && !var->analyzed)
727 cvar->alias = true;
728
729 /* Indicate that the value of the TLS variable may be found elsewhere,
730 preventing the variable from re-appearing in the GIMPLE. We cheat
731 and use the control variable here (rather than a full call_expr),
732 which is special-cased inside the DWARF2 output routines. */
733 SET_DECL_VALUE_EXPR (var->decl, cdecl);
734 DECL_HAS_VALUE_EXPR_P (var->decl) = 1;
735 return false;
736 }
737
738 /* Main entry point to the tls lowering pass. */
739
740 static unsigned int
741 ipa_lower_emutls (void)
742 {
743 varpool_node *var;
744 struct cgraph_node *func;
745 bool any_aliases = false;
746 tree ctor_body = NULL;
747 unsigned int i, n_tls;
748
749 tls_vars = varpool_node_set_new ();
750
751 /* Examine all global variables for TLS variables. */
752 FOR_EACH_VARIABLE (var)
753 if (DECL_THREAD_LOCAL_P (var->decl))
754 {
755 gcc_checking_assert (TREE_STATIC (var->decl)
756 || DECL_EXTERNAL (var->decl));
757 varpool_node_set_add (tls_vars, var);
758 if (var->alias && var->definition)
759 varpool_node_set_add (tls_vars, varpool_variable_node (var, NULL));
760 }
761
762 /* If we found no TLS variables, then there is no further work to do. */
763 if (!tls_vars->nodes.exists ())
764 {
765 tls_vars = NULL;
766 if (dump_file)
767 fprintf (dump_file, "No TLS variables found.\n");
768 return 0;
769 }
770
771 /* Allocate the on-the-side arrays that share indicies with the TLS vars. */
772 n_tls = tls_vars->nodes.length ();
773 control_vars.create (n_tls);
774 access_vars.create (n_tls);
775 access_vars.safe_grow_cleared (n_tls);
776
777 /* Create the control variables for each TLS variable. */
778 FOR_EACH_VEC_ELT (tls_vars->nodes, i, var)
779 {
780 var = tls_vars->nodes[i];
781
782 if (var->alias && !var->analyzed)
783 any_aliases = true;
784 else if (!var->alias)
785 varpool_for_node_and_aliases (var, create_emultls_var, &ctor_body, true);
786 }
787
788 /* If there were any aliases, then frob the alias_pairs vector. */
789 if (any_aliases)
790 {
791 alias_pair *p;
792 FOR_EACH_VEC_SAFE_ELT (alias_pairs, i, p)
793 if (DECL_THREAD_LOCAL_P (p->decl))
794 {
795 p->decl = emutls_decl (p->decl);
796 p->target = get_emutls_object_name (p->target);
797 }
798 }
799
800 /* Adjust all uses of TLS variables within the function bodies. */
801 FOR_EACH_DEFINED_FUNCTION (func)
802 if (func->lowered)
803 lower_emutls_function_body (func);
804
805 /* Generate the constructor for any COMMON control variables created. */
806 if (ctor_body)
807 cgraph_build_static_cdtor ('I', ctor_body, DEFAULT_INIT_PRIORITY);
808
809 control_vars.release ();
810 access_vars.release ();
811 free_varpool_node_set (tls_vars);
812
813 return 0;
814 }
815
816 namespace {
817
818 const pass_data pass_data_ipa_lower_emutls =
819 {
820 SIMPLE_IPA_PASS, /* type */
821 "emutls", /* name */
822 OPTGROUP_NONE, /* optinfo_flags */
823 true, /* has_execute */
824 TV_IPA_OPT, /* tv_id */
825 ( PROP_cfg | PROP_ssa ), /* properties_required */
826 0, /* properties_provided */
827 0, /* properties_destroyed */
828 0, /* todo_flags_start */
829 0, /* todo_flags_finish */
830 };
831
832 class pass_ipa_lower_emutls : public simple_ipa_opt_pass
833 {
834 public:
835 pass_ipa_lower_emutls (gcc::context *ctxt)
836 : simple_ipa_opt_pass (pass_data_ipa_lower_emutls, ctxt)
837 {}
838
839 /* opt_pass methods: */
840 virtual bool gate (function *)
841 {
842 /* If the target supports TLS natively, we need do nothing here. */
843 return !targetm.have_tls;
844 }
845
846 virtual unsigned int execute (function *) { return ipa_lower_emutls (); }
847
848 }; // class pass_ipa_lower_emutls
849
850 } // anon namespace
851
852 simple_ipa_opt_pass *
853 make_pass_ipa_lower_emutls (gcc::context *ctxt)
854 {
855 return new pass_ipa_lower_emutls (ctxt);
856 }