aboutsummaryrefslogtreecommitdiffstats
path: root/gcc-4.4.3/gcc/tree-profile.c
blob: 75fc515b470a40a3bee87a175cde9a6e6c3e38e6 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
/* Calculate branch probabilities, and basic block execution counts.
   Copyright (C) 1990, 1991, 1992, 1993, 1994, 1996, 1997, 1998, 1999,
   2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
   Free Software Foundation, Inc.
   Contributed by James E. Wilson, UC Berkeley/Cygnus Support;
   based on some ideas from Dain Samples of UC Berkeley.
   Further mangling by Bob Manson, Cygnus Support.
   Converted to use trees by Dale Johannesen, Apple Computer.

This file is part of GCC.

GCC is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License as published by the Free
Software Foundation; either version 3, or (at your option) any later
version.

GCC is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
for more details.

You should have received a copy of the GNU General Public License
along with GCC; see the file COPYING3.  If not see
<http://www.gnu.org/licenses/>.  */

/* Generate basic block profile instrumentation and auxiliary files.
   Tree-based version.  See profile.c for overview.  */

#include "config.h"
#include "system.h"
#include "coretypes.h"
#include "tm.h"
#include "rtl.h"
#include "flags.h"
#include "target.h"
#include "output.h"
#include "regs.h"
#include "expr.h"
#include "function.h"
#include "toplev.h"
#include "coverage.h"
#include "tree.h"
#include "tree-flow.h"
#include "tree-dump.h"
#include "tree-pass.h"
#include "timevar.h"
#include "value-prof.h"
#include "ggc.h"
#include "cgraph.h"
#include "target.h"
#include "params.h"
#include "profile.h"

/* Number of statements inserted for each edge counter increment.  */
#define EDGE_COUNTER_STMT_COUNT 3

/* When -D__KERNEL__ is in the option list, we assume this is a
   compilation for Linux Kernel.  */
bool is_kernel_build;

static GTY(()) tree gcov_type_node;
static GTY(()) tree gcov_type_tmp_var;
static GTY(()) tree tree_interval_profiler_fn;
static GTY(()) tree tree_one_float_value_profiler_fn;
static GTY(()) tree tree_pow2_profiler_fn;
static GTY(()) tree tree_one_value_profiler_fn;
static GTY(()) tree tree_indirect_call_profiler_fn;
static GTY(()) tree tree_indirect_call_topn_profiler_fn;
static GTY(()) tree tree_direct_call_profiler_fn;
static GTY(()) tree tree_average_profiler_fn;
static GTY(()) tree tree_ior_profiler_fn;


static GTY(()) tree ic_void_ptr_var;
static GTY(()) tree ic_gcov_type_ptr_var;
static GTY(()) tree dc_void_ptr_var;
static GTY(()) tree dc_gcov_type_ptr_var;
static GTY(()) tree ptr_void;
static GTY(()) tree gcov_info_decl;

/* Do initialization work for the edge profiler.  */

/* Add code:
   // if flag_dyn_ipa
   extern gcov*	__gcov_indirect_call_topn_counters; // pointer to actual counter
   extern void*	__gcov_indirect_call_topn_callee; // actual callee address

   // else
   static gcov*	__gcov_indirect_call_counters; // pointer to actual counter
   static void*	__gcov_indirect_call_callee; // actual callee address
*/
static void
tree_init_ic_make_global_vars (void)
{
  tree  gcov_type_ptr;

  ptr_void = build_pointer_type (void_type_node);
  
  if (flag_dyn_ipa)
    {
      ic_void_ptr_var 
	= build_decl (VAR_DECL, 
		      get_identifier ("__gcov_indirect_call_topn_callee"), 
		      ptr_void);
      TREE_PUBLIC (ic_void_ptr_var) = 1;
      DECL_EXTERNAL (ic_void_ptr_var) = 1;
      if (targetm.have_tls && !is_kernel_build)
        {
          DECL_TLS_MODEL (ic_void_ptr_var) =
            decl_default_tls_model (ic_void_ptr_var);
        }

      gcov_type_ptr = build_pointer_type (get_gcov_type ());
      ic_gcov_type_ptr_var 
	= build_decl (VAR_DECL, 
		      get_identifier ("__gcov_indirect_call_topn_counters"), 
		      gcov_type_ptr);
      TREE_PUBLIC (ic_gcov_type_ptr_var) = 1;
      DECL_EXTERNAL (ic_gcov_type_ptr_var) = 1;
      if (targetm.have_tls && !is_kernel_build)
        {
          DECL_TLS_MODEL (ic_gcov_type_ptr_var) =
            decl_default_tls_model (ic_gcov_type_ptr_var);
        }
    }
  else
    {
      ic_void_ptr_var 
	= build_decl (VAR_DECL, 
		      get_identifier ("__gcov_indirect_call_callee"), 
		      ptr_void);
      TREE_STATIC (ic_void_ptr_var) = 1;
      TREE_PUBLIC (ic_void_ptr_var) = 0;
      DECL_INITIAL (ic_void_ptr_var) = NULL;
      if (targetm.have_tls && !is_kernel_build)
        {
          DECL_TLS_MODEL (ic_void_ptr_var) = 
            decl_default_tls_model (ic_void_ptr_var);
        }

      gcov_type_ptr = build_pointer_type (get_gcov_type ());
      ic_gcov_type_ptr_var 
	= build_decl (VAR_DECL, 
		      get_identifier ("__gcov_indirect_call_counters"), 
		      gcov_type_ptr);
      TREE_STATIC (ic_gcov_type_ptr_var) = 1;
      TREE_PUBLIC (ic_gcov_type_ptr_var) = 0;
      DECL_INITIAL (ic_gcov_type_ptr_var) = NULL;
      if (targetm.have_tls && !is_kernel_build)
        {
          DECL_TLS_MODEL (ic_gcov_type_ptr_var) = 
            decl_default_tls_model (ic_gcov_type_ptr_var);
        }
    }

  DECL_ARTIFICIAL (ic_void_ptr_var) = 1;
  DECL_ARTIFICIAL (ic_gcov_type_ptr_var) = 1;
  assemble_variable (ic_void_ptr_var, 0, 0, 0);
  assemble_variable (ic_gcov_type_ptr_var, 0, 0, 0);
}

/* A set of the first statement in each block of statements that need to
   be applied a sampling wrapper.  */
static htab_t instrumentation_to_be_sampled = NULL;

/* extern __thread gcov_unsigned_t __gcov_sample_counter  */
static tree gcov_sample_counter_decl = NULL_TREE;

/* extern gcov_unsigned_t __gcov_sampling_rate  */
static tree gcov_sampling_rate_decl = NULL_TREE;

/* forward declaration.  */
void tree_init_instrumentation_sampling (void);

/* Insert STMT_IF around given sequence of consecutive statements in the
   same basic block starting with STMT_START, ending with STMT_END.  */

static void
insert_if_then (gimple stmt_start, gimple stmt_end, gimple stmt_if)
{
  gimple_stmt_iterator gsi;
  basic_block bb_original, bb_before_if, bb_then, bb_after_if;
  edge e_if_taken, e_then_join, e_if_not_taken;

  gsi = gsi_for_stmt (stmt_start);
  gsi_insert_before_without_update (&gsi, stmt_if, GSI_SAME_STMT);
  bb_original = gsi_bb (gsi);
  e_if_taken = split_block (bb_original, stmt_if);
  e_if_taken->flags &= ~EDGE_FALLTHRU;
  e_if_taken->flags |= EDGE_TRUE_VALUE;
  e_then_join = split_block (e_if_taken->dest, stmt_end);
  bb_before_if = e_if_taken->src;
  bb_then = e_if_taken->dest;
  bb_after_if = e_then_join->dest;
  e_if_not_taken = make_edge (bb_before_if, bb_after_if, EDGE_FALSE_VALUE);
}

/* Transform:

   ORIGINAL CODE

   Into:

   __gcov_sample_counter++;
   if (__gcov_sample_counter >= __gcov_sampling_rate)
     {
       __gcov_sample_counter = 0;
       ORIGINAL CODE
     }

   The original code block starts with STMT_START, is made of STMT_COUNT
   consecutive statements in the same basic block.  */

static void
add_sampling_wrapper (gimple stmt_start, int stmt_count)
{
  int i;
  tree zero, one, tmp_var;
  gimple stmt_block_end;
  gimple stmt_inc_counter1, stmt_inc_counter2, stmt_inc_counter3;
  gimple stmt_reset_counter, stmt_if;
  gimple_stmt_iterator gsi;

  tmp_var = create_tmp_var (get_gcov_unsigned_t (), "PROF_sample_counter");

  /* Create all the new statements needed.  */
  stmt_inc_counter1 = gimple_build_assign (tmp_var, gcov_sample_counter_decl);
  one = build_int_cst (get_gcov_unsigned_t (), 1);
  stmt_inc_counter2 = gimple_build_assign_with_ops (
      PLUS_EXPR, tmp_var, tmp_var, one);
  stmt_inc_counter3 = gimple_build_assign (gcov_sample_counter_decl, tmp_var);
  zero = build_int_cst (get_gcov_unsigned_t (), 0);
  stmt_reset_counter = gimple_build_assign (gcov_sample_counter_decl, zero);
  stmt_if = gimple_build_cond (GE_EXPR, tmp_var, gcov_sampling_rate_decl,
                               NULL_TREE, NULL_TREE);

  /* Insert them for now in the original basic block.  */
  gsi = gsi_for_stmt (stmt_start);
  gsi_insert_before_without_update (&gsi, stmt_inc_counter1, GSI_SAME_STMT);
  gsi_insert_before_without_update (&gsi, stmt_inc_counter2, GSI_SAME_STMT);
  gsi_insert_before_without_update (&gsi, stmt_inc_counter3, GSI_SAME_STMT);
  gsi_insert_before_without_update (&gsi, stmt_reset_counter, GSI_SAME_STMT);

  /* Move to last statement.  */
  for (i = 0; i < stmt_count - 1; i++)
    gsi_next (&gsi);

  stmt_block_end = gsi_stmt (gsi);
  gcc_assert (stmt_block_end);

  /* Insert IF block.  */
  insert_if_then (stmt_reset_counter, stmt_block_end, stmt_if);
}

/* Return whether STMT is the beginning of an instrumentation block to be
   applied sampling.  */

static bool
is_instrumentation_to_be_sampled (gimple stmt)
{
  return (htab_find_slot_with_hash (instrumentation_to_be_sampled, stmt,
                                    htab_hash_pointer (stmt), NO_INSERT)
          != NULL);
}

/* Add sampling wrappers around edge counter code in current function.  */

void
add_sampling_to_edge_counters (void)
{
  gimple_stmt_iterator gsi;
  basic_block bb;

  FOR_EACH_BB_REVERSE (bb)
    for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
      {
        gimple stmt = gsi_stmt (gsi);
        if (is_instrumentation_to_be_sampled (stmt))
          {
            add_sampling_wrapper (stmt, EDGE_COUNTER_STMT_COUNT);
            break;
          }
      }

  /* Empty the set of statements performing the edge counter increment.  */
  if (instrumentation_to_be_sampled)
    htab_empty (instrumentation_to_be_sampled);
}

void
tree_init_instrumentation_sampling (void)
{
  if (!gcov_sampling_rate_decl)
    {
      /* Define __gcov_sampling_rate regardless of -fprofile-generate-sampling.
         Otherwise the extern reference to it from libgcov becomes unmatched.
      */
      gcov_sampling_rate_decl = build_decl (
          VAR_DECL,
          get_identifier ("__gcov_sampling_rate"),
          get_gcov_unsigned_t ());
      TREE_PUBLIC (gcov_sampling_rate_decl) = 1;
      DECL_ARTIFICIAL (gcov_sampling_rate_decl) = 1;
      DECL_ONE_ONLY (gcov_sampling_rate_decl) = 1;
      TREE_STATIC (gcov_sampling_rate_decl) = 1;
      DECL_INITIAL (gcov_sampling_rate_decl) = build_int_cst (
          get_gcov_unsigned_t (),
          PARAM_VALUE (PARAM_PROFILE_GENERATE_SAMPLING_RATE));
      assemble_variable (gcov_sampling_rate_decl, 0, 0, 0);
    }

  if (flag_profile_generate_sampling && !instrumentation_to_be_sampled)
    {
      instrumentation_to_be_sampled = htab_create (100, htab_hash_pointer,
                                                   htab_eq_pointer, NULL);
      gcov_sample_counter_decl = build_decl (
          VAR_DECL,
          get_identifier ("__gcov_sample_counter"),
          get_gcov_unsigned_t ());
      TREE_PUBLIC (gcov_sample_counter_decl) = 1;
      DECL_EXTERNAL (gcov_sample_counter_decl) = 1;
      DECL_ARTIFICIAL (gcov_sample_counter_decl) = 1;
      if (targetm.have_tls && !is_kernel_build)
        DECL_TLS_MODEL (gcov_sample_counter_decl) =
            decl_default_tls_model (gcov_sample_counter_decl);
      assemble_variable (gcov_sample_counter_decl, 0, 0, 0);
    }
}

static void
tree_init_edge_profiler (void)
{
  tree interval_profiler_fn_type;
  tree pow2_profiler_fn_type;
  tree one_value_profiler_fn_type;
  tree one_float_value_profiler_fn_type;
  tree gcov_type_ptr;
  tree ic_profiler_fn_type;
  tree ic_topn_profiler_fn_type;
  tree dc_profiler_fn_type;
  tree average_profiler_fn_type;

  if (!gcov_type_node)
    {
      char name_buf[32];
      gcov_type_node = get_gcov_type ();
      gcov_type_ptr = build_pointer_type (gcov_type_node);

      ASM_GENERATE_INTERNAL_LABEL (name_buf, "LPBX", 0);
      gcov_info_decl = build_decl (VAR_DECL, get_identifier (name_buf),
                                   get_gcov_unsigned_t ());
      DECL_EXTERNAL (gcov_info_decl) = 1;

      /* void (*) (gcov_type *, gcov_type, int, unsigned)  */
      interval_profiler_fn_type
	      = build_function_type_list (void_type_node,
					  gcov_type_ptr, gcov_type_node,
					  integer_type_node,
					  unsigned_type_node, NULL_TREE);
      tree_interval_profiler_fn
	      = build_fn_decl ("__gcov_interval_profiler",
				     interval_profiler_fn_type);

      /* void (*) (gcov_type *, gcov_type)  */
      pow2_profiler_fn_type
	      = build_function_type_list (void_type_node,
					  gcov_type_ptr, gcov_type_node,
					  NULL_TREE);
      tree_pow2_profiler_fn = build_fn_decl ("__gcov_pow2_profiler",
						   pow2_profiler_fn_type);

      /* void (*) (gcov_type *, gcov_type)  */
      one_value_profiler_fn_type
	      = build_function_type_list (void_type_node,
					  gcov_type_ptr, gcov_type_node,
					  NULL_TREE);
      tree_one_value_profiler_fn
	      = build_fn_decl ("__gcov_one_value_profiler",
				     one_value_profiler_fn_type);

      /* void (*) (gcov_type *, gcov_float_t)  */
      one_float_value_profiler_fn_type
	      = build_function_type_list (void_type_node,
					  gcov_type_ptr, gcov_type_node,
					  NULL_TREE);
      tree_one_float_value_profiler_fn
	      = build_fn_decl ("__gcov_one_float_value_profiler",
				     one_float_value_profiler_fn_type);

      tree_init_ic_make_global_vars ();

      /* void (*) (gcov_type *, gcov_type, void *, void *)  */
      ic_profiler_fn_type
	       = build_function_type_list (void_type_node,
					  gcov_type_ptr, gcov_type_node,
					  ptr_void,
					  ptr_void, NULL_TREE);
      tree_indirect_call_profiler_fn
	      = build_fn_decl ("__gcov_indirect_call_profiler",
				     ic_profiler_fn_type);

      /* void (*) (void *, void *, gcov_unsigned_t)  */
      ic_topn_profiler_fn_type
	= build_function_type_list (void_type_node, ptr_void, ptr_void,
				    get_gcov_unsigned_t (), NULL_TREE);
      tree_indirect_call_topn_profiler_fn
	      = build_fn_decl ("__gcov_indirect_call_topn_profiler",
                               ic_topn_profiler_fn_type);

      /* void (*) (void *, void *, gcov_unsigned_t)  */
      dc_profiler_fn_type
	= build_function_type_list (void_type_node, ptr_void, ptr_void,
				    get_gcov_unsigned_t (), NULL_TREE);
      tree_direct_call_profiler_fn
	= build_fn_decl ("__gcov_direct_call_profiler",
			 dc_profiler_fn_type);

      /* void (*) (gcov_type *, gcov_type)  */
      average_profiler_fn_type
	      = build_function_type_list (void_type_node,
					  gcov_type_ptr, gcov_type_node, NULL_TREE);
      tree_average_profiler_fn
	      = build_fn_decl ("__gcov_average_profiler",
				     average_profiler_fn_type);
      tree_ior_profiler_fn
	      = build_fn_decl ("__gcov_ior_profiler",
				     average_profiler_fn_type);
    }
}

/* New call was added, make goto call edges if neccesary.  */

static void
add_abnormal_goto_call_edges (gimple_stmt_iterator gsi)
{
  gimple stmt = gsi_stmt (gsi);

  if (!stmt_can_make_abnormal_goto (stmt))
    return;
  if (!gsi_end_p (gsi))
    split_block (gimple_bb (stmt), stmt);
  make_abnormal_goto_edges (gimple_bb (stmt), true);
}

/* Output instructions as GIMPLE trees to increment the edge 
   execution count, and insert them on E.  We rely on 
   gsi_insert_on_edge to preserve the order.  */

static void
tree_gen_edge_profiler (int edgeno, edge e)
{
  void** slot;
  tree ref, one;
  gimple stmt1, stmt2, stmt3;

  /* We share one temporary variable declaration per function.  This
     gets re-set in tree_profiling.  */
  if (gcov_type_tmp_var == NULL_TREE)
    gcov_type_tmp_var = create_tmp_var (gcov_type_node, "PROF_edge_counter");
  ref = tree_coverage_counter_ref (GCOV_COUNTER_ARCS, edgeno);
  one = build_int_cst (gcov_type_node, 1);
  stmt1 = gimple_build_assign (gcov_type_tmp_var, ref);
  stmt2 = gimple_build_assign_with_ops (PLUS_EXPR, gcov_type_tmp_var,
					gcov_type_tmp_var, one);
  stmt3 = gimple_build_assign (unshare_expr (ref), gcov_type_tmp_var);

  if (flag_profile_generate_sampling)
    {
      slot = htab_find_slot_with_hash (instrumentation_to_be_sampled, stmt1,
                                       htab_hash_pointer (stmt1), INSERT);
      gcc_assert (!*slot);
      *slot = stmt1;
    }

  gsi_insert_on_edge (e, stmt1);
  gsi_insert_on_edge (e, stmt2);
  gsi_insert_on_edge (e, stmt3);
}

/* Emits code to get VALUE to instrument at GSI, and returns the
   variable containing the value.  */

static tree
prepare_instrumented_value (gimple_stmt_iterator *gsi, histogram_value value)
{
  tree val = value->hvalue.value;
  return force_gimple_operand_gsi (gsi, fold_convert (gcov_type_node, val),
				   true, NULL_TREE, true, GSI_SAME_STMT);
}

/* Output instructions as GIMPLE trees to increment the interval histogram 
   counter.  VALUE is the expression whose value is profiled.  TAG is the 
   tag of the section for counters, BASE is offset of the counter position.  */

static void
tree_gen_interval_profiler (histogram_value value, unsigned tag, unsigned base)
{
  gimple stmt = value->hvalue.stmt;
  gimple_stmt_iterator gsi = gsi_for_stmt (stmt);
  tree ref = tree_coverage_counter_ref (tag, base), ref_ptr;
  gimple call;
  tree val;
  tree start = build_int_cst_type (integer_type_node,
				   value->hdata.intvl.int_start);
  tree steps = build_int_cst_type (unsigned_type_node,
				   value->hdata.intvl.steps);
  
  ref_ptr = force_gimple_operand_gsi (&gsi,
				      build_addr (ref, current_function_decl),
				      true, NULL_TREE, true, GSI_SAME_STMT);
  val = prepare_instrumented_value (&gsi, value);
  call = gimple_build_call (tree_interval_profiler_fn, 4,
			    ref_ptr, val, start, steps);
  gsi_insert_before (&gsi, call, GSI_NEW_STMT);
  add_abnormal_goto_call_edges (gsi);
}

/* Output instructions as GIMPLE trees to increment the power of two histogram 
   counter.  VALUE is the expression whose value is profiled.  TAG is the tag 
   of the section for counters, BASE is offset of the counter position.  */

static void
tree_gen_pow2_profiler (histogram_value value, unsigned tag, unsigned base)
{
  gimple stmt = value->hvalue.stmt;
  gimple_stmt_iterator gsi = gsi_for_stmt (stmt);
  tree ref_ptr = tree_coverage_counter_addr (tag, base);
  gimple call;
  tree val;
  
  ref_ptr = force_gimple_operand_gsi (&gsi, ref_ptr,
				      true, NULL_TREE, true, GSI_SAME_STMT);
  val = prepare_instrumented_value (&gsi, value);
  call = gimple_build_call (tree_pow2_profiler_fn, 2, ref_ptr, val);
  gsi_insert_before (&gsi, call, GSI_NEW_STMT);
  add_abnormal_goto_call_edges (gsi);
}

/* Output instructions as GIMPLE trees for code to find the most common value.
   VALUE is the expression whose value is profiled.  TAG is the tag of the
   section for counters, BASE is offset of the counter position.  */

static void
tree_gen_one_value_profiler (histogram_value value, unsigned tag, unsigned base)
{
  gimple stmt = value->hvalue.stmt;
  gimple_stmt_iterator gsi = gsi_for_stmt (stmt);
  tree ref_ptr = tree_coverage_counter_addr (tag, base);
  gimple call;
  tree val;

  ref_ptr = force_gimple_operand_gsi (&gsi, ref_ptr,
				      true, NULL_TREE, true, GSI_SAME_STMT);
  val = prepare_instrumented_value (&gsi, value);
  call = gimple_build_call (tree_one_value_profiler_fn, 2, ref_ptr, val);
  gsi_insert_before (&gsi, call, GSI_NEW_STMT);
  add_abnormal_goto_call_edges (gsi);
}

/* Output instructions as GIMPLE trees for code to find the most common value.
   VALUE is the expression whose value is profiled.  TAG is the tag of the
   section for counters, BASE is offset of the counter position.  */

static void
tree_gen_one_float_value_profiler (histogram_value value, unsigned tag,
                                   unsigned base)
{
  gimple stmt = value->hvalue.stmt;
  gimple_stmt_iterator gsi = gsi_for_stmt (stmt);
  tree ref_ptr = tree_coverage_counter_addr (tag, base);
  gimple call;
  tree val;

  ref_ptr = force_gimple_operand_gsi (&gsi, ref_ptr,
                                      true, NULL_TREE, true, GSI_SAME_STMT);

  val =  force_gimple_operand_gsi (&gsi, fold_convert (get_gcov_float_t (),
                                                       value->hvalue.value),
                                   true, NULL_TREE, true, GSI_SAME_STMT);

  call = gimple_build_call (tree_one_float_value_profiler_fn, 2, ref_ptr,
                            val);
  gsi_insert_before (&gsi, call, GSI_NEW_STMT);
  add_abnormal_goto_call_edges (gsi);
}


/* Output instructions as GIMPLE trees for code to find the most
   common called function in indirect call.  
   VALUE is the call expression whose indirect callee is profiled.
   TAG is the tag of the section for counters, BASE is offset of the
   counter position.  */

static void
tree_gen_ic_profiler (histogram_value value, unsigned tag, unsigned base)
{
  tree tmp1;
  gimple stmt1, stmt2, stmt3;
  gimple stmt;
  gimple_stmt_iterator gsi;
  tree ref_ptr;

  /* TODO add option -- only disble for topn icall profiling.  */
  if (DECL_STATIC_CONSTRUCTOR (current_function_decl) 
      || DECL_STATIC_CONSTRUCTOR (current_function_decl))
    return;
 
  stmt = value->hvalue.stmt;
  gsi = gsi_for_stmt (stmt);
  ref_ptr = tree_coverage_counter_addr (tag, base);
  ref_ptr = force_gimple_operand_gsi (&gsi, ref_ptr,
				      true, NULL_TREE, true, GSI_SAME_STMT);

  /* Insert code:
    
    __gcov_indirect_call_counters = get_relevant_counter_ptr (); 
    __gcov_indirect_call_callee = (void *) indirect call argument;
   */

  tmp1 = create_tmp_var (ptr_void, "PROF");
  stmt1 = gimple_build_assign (ic_gcov_type_ptr_var, ref_ptr);
  stmt2 = gimple_build_assign (tmp1, unshare_expr (value->hvalue.value));
  stmt3 = gimple_build_assign (ic_void_ptr_var, tmp1);

  gsi_insert_before (&gsi, stmt1, GSI_SAME_STMT);
  gsi_insert_before (&gsi, stmt2, GSI_SAME_STMT);
  gsi_insert_before (&gsi, stmt3, GSI_SAME_STMT);
}


/* Output instructions as GIMPLE trees for code to find the most
   common called function in indirect call. Insert instructions at the
   beginning of every possible called function.
  */

static void
tree_gen_ic_func_profiler (void)
{
  struct cgraph_node * c_node = cgraph_node (current_function_decl);
  gimple_stmt_iterator gsi;
  edge e;
  basic_block bb;
  edge_iterator ei;
  gimple stmt1, stmt2;
  tree tree_uid, cur_func;

  if (!c_node->needed)
    return;
  
  tree_init_edge_profiler ();
  
  FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs)
    {
      tree void0;

      bb = split_edge (e);
      gsi = gsi_start_bb (bb);

      cur_func = force_gimple_operand_gsi (&gsi,
					   build_addr (current_function_decl, 
						       current_function_decl),
					   true, NULL_TREE,
					   true, GSI_SAME_STMT);
      tree_uid = build_int_cst (gcov_type_node, c_node->pid);
      stmt1 = gimple_build_call (tree_indirect_call_profiler_fn, 4,
				 ic_gcov_type_ptr_var,
				 tree_uid,
				 cur_func,
				 ic_void_ptr_var);
      gsi_insert_after (&gsi, stmt1, GSI_NEW_STMT);
      gcc_assert (EDGE_COUNT (bb->succs) == 1);
      bb = split_edge (EDGE_I (bb->succs, 0));
      add_abnormal_goto_call_edges (gsi);

      gsi = gsi_start_bb (bb);
      /* Set __gcov_indirect_call_callee to 0,
         so that calls from other modules won't get misattributed
	 to the last caller of the current callee.  */
      void0 = build_int_cst (build_pointer_type (void_type_node), 0);
      stmt2 = gimple_build_assign (ic_void_ptr_var, void0);
      gsi_insert_after (&gsi, stmt2, GSI_NEW_STMT);
    }
}

/* Output instructions as GIMPLE trees for code to find the most
   common called function in indirect call. Insert instructions at the
   beginning of every possible called function.
  */

static void
tree_gen_ic_func_topn_profiler (void)
{
  struct cgraph_node * c_node = cgraph_node (current_function_decl);
  gimple_stmt_iterator gsi;
  edge e;
  basic_block bb;
  edge_iterator ei;
  gimple stmt1;
  tree cur_func, gcov_info, cur_func_id;

  if (DECL_STATIC_CONSTRUCTOR (current_function_decl) 
      || DECL_STATIC_CONSTRUCTOR (current_function_decl)
      || DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (current_function_decl))
    return;

  /* We want to make sure template functions are instrumented even though
     it is not 'needed' in this module. It is possible that the function
     is needed (e.g, as icall target) in another module. Note that for
     functions in comdat groups, there is no guarantee which copy will be
     picked up by the linker.  */

  if (!c_node->needed && !DECL_COMDAT (c_node->decl))
    return;

  if (!c_node->needed)
    cgraph_mark_needed_node (c_node);

  tree_init_edge_profiler ();

  FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs)
    {
      bb = split_edge (e);
      gsi = gsi_start_bb (bb);
      cur_func = force_gimple_operand_gsi (&gsi,
					   build_addr (current_function_decl,
						       current_function_decl),
					   true, NULL_TREE,
					   true, GSI_SAME_STMT);
      gcov_info = build_fold_addr_expr (gcov_info_decl);
      cur_func_id = build_int_cst (get_gcov_unsigned_t (),
                                   FUNC_DECL_FUNC_ID (cfun));
      stmt1 = gimple_build_call (tree_indirect_call_topn_profiler_fn, 
                                 3, cur_func, gcov_info, cur_func_id);
      gsi_insert_after (&gsi, stmt1, GSI_NEW_STMT);
      gcc_assert (EDGE_COUNT (bb->succs) == 1);
      add_abnormal_goto_call_edges (gsi);
    }
}


/* Output instructions as GIMPLE trees for code to find the number of
   calls at each direct call site.
   BASE is offset of the counter position, CALL_STMT is the direct call
   whose call-count is profiled.  */

static void
tree_gen_dc_profiler (unsigned base, gimple call_stmt)
{
  gimple stmt1, stmt2, stmt3;
  gimple_stmt_iterator gsi = gsi_for_stmt (call_stmt);
  tree tmp1, tmp2, tmp3, callee = gimple_call_fn (call_stmt);

  /* Insert code:
     __gcov_direct_call_counters = get_relevant_counter_ptr ();
     __gcov_callee = (void *) callee;
   */
  tmp1 = tree_coverage_counter_addr (GCOV_COUNTER_DIRECT_CALL, base);
  tmp1 = force_gimple_operand_gsi (&gsi, tmp1, true, NULL_TREE,
				   true, GSI_SAME_STMT);
  stmt1 = gimple_build_assign (dc_gcov_type_ptr_var, tmp1);
  tmp2 = create_tmp_var (ptr_void, "PROF_dc");
  add_referenced_var (tmp2);
  stmt2 = gimple_build_assign (tmp2, unshare_expr (callee));
  tmp3 = make_ssa_name (tmp2, stmt2);
  gimple_assign_set_lhs (stmt2, tmp3);
  stmt3 = gimple_build_assign (dc_void_ptr_var, tmp3);
  gsi_insert_before (&gsi, stmt1, GSI_SAME_STMT);
  gsi_insert_before (&gsi, stmt2, GSI_SAME_STMT);
  gsi_insert_before (&gsi, stmt3, GSI_SAME_STMT);
}


/* Output instructions as GIMPLE trees for code to find the number of
   calls at each direct call site. Insert instructions at the beginning of
   every possible called function.  */

static void
tree_gen_dc_func_profiler (void)
{
  struct cgraph_node * c_node = cgraph_node (current_function_decl);
  gimple_stmt_iterator gsi;
  edge e;
  basic_block bb;
  edge_iterator ei;
  gimple stmt1;
  tree cur_func, gcov_info, cur_func_id;

  if (DECL_STATIC_CONSTRUCTOR (current_function_decl) 
      || DECL_STATIC_CONSTRUCTOR (current_function_decl)
      || DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (current_function_decl))
    return;

  if (!c_node->needed && !c_node->reachable)
    return;

  tree_init_edge_profiler ();

  FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs)
    {
      bb = split_edge (e);
      gsi = gsi_start_bb (bb);
      cur_func = force_gimple_operand_gsi (&gsi,
					   build_addr (current_function_decl,
						       current_function_decl),
					   true, NULL_TREE,
					   true, GSI_SAME_STMT);
      gcov_info = build_fold_addr_expr (gcov_info_decl);
      cur_func_id = build_int_cst (get_gcov_unsigned_t (),
                                   FUNC_DECL_FUNC_ID (cfun));
      stmt1 = gimple_build_call (tree_direct_call_profiler_fn, 3, cur_func,
				 gcov_info, cur_func_id);
      gsi_insert_after (&gsi, stmt1, GSI_NEW_STMT);
      gcc_assert (EDGE_COUNT (bb->succs) == 1);
      add_abnormal_goto_call_edges (gsi);
    }
}

/* Output instructions as GIMPLE trees for code to find the most common value 
   of a difference between two evaluations of an expression.
   VALUE is the expression whose value is profiled.  TAG is the tag of the
   section for counters, BASE is offset of the counter position.  */

static void
tree_gen_const_delta_profiler (histogram_value value ATTRIBUTE_UNUSED,
			       unsigned tag ATTRIBUTE_UNUSED,
			       unsigned base ATTRIBUTE_UNUSED)
{
  /* FIXME implement this.  */
#ifdef ENABLE_CHECKING
  internal_error ("unimplemented functionality");
#endif
  gcc_unreachable ();
}

/* Output instructions as GIMPLE trees to increment the average histogram 
   counter.  VALUE is the expression whose value is profiled.  TAG is the 
   tag of the section for counters, BASE is offset of the counter position.  */

static void
tree_gen_average_profiler (histogram_value value, unsigned tag, unsigned base)
{
  gimple stmt = value->hvalue.stmt;
  gimple_stmt_iterator gsi = gsi_for_stmt (stmt);
  tree ref_ptr = tree_coverage_counter_addr (tag, base);
  gimple call;
  tree val;
  
  ref_ptr = force_gimple_operand_gsi (&gsi, ref_ptr,
				      true, NULL_TREE,
				      true, GSI_SAME_STMT);
  val = prepare_instrumented_value (&gsi, value);
  call = gimple_build_call (tree_average_profiler_fn, 2, ref_ptr, val);
  gsi_insert_before (&gsi, call, GSI_NEW_STMT);
  add_abnormal_goto_call_edges (gsi);
}

/* Output instructions as GIMPLE trees to increment the ior histogram 
   counter.  VALUE is the expression whose value is profiled.  TAG is the 
   tag of the section for counters, BASE is offset of the counter position.  */

static void
tree_gen_ior_profiler (histogram_value value, unsigned tag, unsigned base)
{
  gimple stmt = value->hvalue.stmt;
  gimple_stmt_iterator gsi = gsi_for_stmt (stmt);
  tree ref_ptr = tree_coverage_counter_addr (tag, base);
  gimple call;
  tree val;
  
  ref_ptr = force_gimple_operand_gsi (&gsi, ref_ptr,
				      true, NULL_TREE, true, GSI_SAME_STMT);
  val = prepare_instrumented_value (&gsi, value);
  call = gimple_build_call (tree_ior_profiler_fn, 2, ref_ptr, val);
  gsi_insert_before (&gsi, call, GSI_NEW_STMT);
  add_abnormal_goto_call_edges (gsi);
}

/* String operation substitution record.  For each operation, e.g., memcpy,
   we keep up to four declarations, e.g., libopt__memcpy__{0,1,2,3}.
   They correspond to memcpy versions in which memory access is nontemporal
   in neither, first, second or both arguments (dst, src) respectively.  */

struct stringop_subst
{
  const char* original_name;  /* E.g., "memcpy".  */
  int num_args;               /* Number of args, 3 for memcpy.  */
  int num_ptr_args;           /* Number of pointer args, 2 for memcpy.  */
  tree instr_fun;             /* E.g., declaration of instrument_memcpy.  */
  tree nt_ops[4];             /* E.g., libopt__memcpy__{0,1,2,3}.  */
};
typedef struct stringop_subst* stringop_subst_t;

/* Substitution database.  XXX: switch to hash table.  */

static struct stringop_subst stringop_decl[] =
{
  {"memcpy",      3, 2, NULL, {NULL, NULL, NULL, NULL}},
  {"memset",      3, 1, NULL, {NULL, NULL, NULL, NULL}},
  {"memmove",     3, 2, NULL, {NULL, NULL, NULL, NULL}},
  {"memcmp",      3, 2, NULL, {NULL, NULL, NULL, NULL}},
  {"bcmp",        3, 2, NULL, {NULL, NULL, NULL, NULL}},
  {"strlen",      1, 1, NULL, {NULL, NULL, NULL, NULL}},
  {"strcpy",      2, 2, NULL, {NULL, NULL, NULL, NULL}},
  {"strncpy",     3, 2, NULL, {NULL, NULL, NULL, NULL}},
  {"strcat",      2, 2, NULL, {NULL, NULL, NULL, NULL}},
  {"strncat",     3, 2, NULL, {NULL, NULL, NULL, NULL}},
  {"strdup",      1, 1, NULL, {NULL, NULL, NULL, NULL}},
  {"strndup",     2, 1, NULL, {NULL, NULL, NULL, NULL}},
  {"strcmp",      2, 2, NULL, {NULL, NULL, NULL, NULL}},
  {"strncmp",     3, 2, NULL, {NULL, NULL, NULL, NULL}},
  {"strcasecmp",  2, 2, NULL, {NULL, NULL, NULL, NULL}},
  {"strncasecmp", 3, 2, NULL, {NULL, NULL, NULL, NULL}},
  {NULL,          0, 0, NULL, {NULL, NULL, NULL, NULL}}
};

/* Get the corresponding element in STRINGOP_DECL for NAME.  */

static stringop_subst_t
get_stringop_subst (const char* name)
{
  stringop_subst_t it;
  for (it = stringop_decl; it->original_name; it++)
    if (strcmp (name, it->original_name) == 0)
      return it;
  return 0;
}

/* Return the matching substitution if call site STMT is worth replacing.  */

static stringop_subst_t
reusedist_is_interesting_call (gimple stmt)
{
  tree fndecl, name;

  if (gimple_code (stmt) != GIMPLE_CALL)
    return 0;

  fndecl = gimple_call_fndecl (stmt);

  if (fndecl == NULL_TREE)
    return 0;

  name = DECL_NAME (fndecl);

  if (name == NULL_TREE)
    return 0;

  return get_stringop_subst (IDENTIFIER_POINTER (name));
}

/* Make up an instrumentation function name for string operation OP.  */

static void
reusedist_instr_func_name (const char* op, char result[], int size)
{
  int written;

  written = snprintf (result, size, "reusedist_instr_%s", op);

  gcc_assert (written < size);
}

/* Create a declaration for an instr. function if not already done.
   Use TEMPLATE_STMT to figure out argument types.  */

static tree
reusedist_get_instr_decl (gimple template_stmt, stringop_subst_t subst)
{
  if (!subst->instr_fun)
    {
      tree args;
      char name[64];

      if (!ptr_void)
        ptr_void = build_pointer_type (void_type_node);

      reusedist_instr_func_name (subst->original_name, name, 64);

      switch (subst->num_args)
        {
          case 1:
            args = build_function_type_list (
                void_type_node, ptr_void,
                TREE_TYPE (gimple_call_arg (template_stmt, 0)),
                NULL_TREE);
            break;
          case 2:
            args = build_function_type_list (
                void_type_node, ptr_void,
                TREE_TYPE (gimple_call_arg (template_stmt, 0)),
                TREE_TYPE (gimple_call_arg (template_stmt, 1)),
                NULL_TREE);
            break;
          case 3:
            args = build_function_type_list (
                void_type_node, ptr_void,
                TREE_TYPE (gimple_call_arg (template_stmt, 0)),
                TREE_TYPE (gimple_call_arg (template_stmt, 1)),
                TREE_TYPE (gimple_call_arg (template_stmt, 2)),
                NULL_TREE);
            break;
          default:
            gcc_assert (false);
        }
      subst->instr_fun = build_fn_decl (name, args);
    }

  return subst->instr_fun;
}

/* Return call to instrumentation function for string op call site STMT.
   Given a call to memcpy (dst, src, len), it will return a call to
   reusedist_instrument_memcpy (counters, dst, src, len).  */

static gimple
reusedist_make_instr_call (gimple stmt, stringop_subst_t subst, tree counters)
{
  tree profiler_fn;

  if (!subst)
    return 0;

  profiler_fn = reusedist_get_instr_decl (stmt, subst);

 switch (subst->num_args)
   {
     case 1:
       return gimple_build_call (profiler_fn, 1 + subst->num_args, counters,
                                 gimple_call_arg (stmt, 0));
     case 2:
       return gimple_build_call (profiler_fn, 1 + subst->num_args, counters,
                                 gimple_call_arg (stmt, 0),
                                 gimple_call_arg (stmt, 1));
     case 3:
       return gimple_build_call (profiler_fn, 1 + subst->num_args, counters,
                                 gimple_call_arg (stmt, 0),
                                 gimple_call_arg (stmt, 1),
                                 gimple_call_arg (stmt, 2));
     default:
       gcc_assert (false);
   }
}

/* Reuse distance information for a single memory block at a single site.
   For some operations, such as memcpy, there will be two such descriptors,
   one of the source and one for the destination.
   We're keeping the average reuse distance
   (e.g., distance from a MEMCPY call until the memory written is first used).
   We're also keeping the average operation size (e.g., memcpy size).
   These averages are measured over all dynamic invocations of the same
   static site.  We're also storing the dynamic operation count.

   We're also keeping a measure named dist_x_size, which is the sum of
   products (distance * size) across all dynamic instances.  This is meant
   to account for some information loss through aggregation.  For instance,
   consider two scenarios.
   A: 50% of operations have large reuse distance but are very short.
      50% of operations have short reuse distance but are very long.
   B: 50% of operations have large reuse distance and are large.
      50% of operations have short reuse distance and are short.
   Without the dist_x_size measure, these scenarios can't be told apart
   from the other three measures.  With the dist_x_size measure, scenario B
   will look like a better candidate.  */

struct reusedist_t {
  gcov_type mean_dist;    /* Average reuse distance.  */
  gcov_type mean_size;    /* Average size of memory referenced.  */
  gcov_type count;        /* Operation count.  */
  gcov_type dist_x_size;  /* Sum of (distance * size >> 12) across all ops.  */
};

typedef struct reusedist_t reusedist_t;

/* Number of gcov counters for one reuse distance measurement.  */

const int RD_NUM_COUNTERS = sizeof(reusedist_t) / sizeof(gcov_type);

/* Initialize RD from gcov COUNTERS.  */

static void
reusedist_from_counters (const gcov_type* counters,
                         reusedist_t* rd)
{
  memcpy (rd, counters, RD_NUM_COUNTERS * sizeof (gcov_type));
}

/* Instrument current function to collect reuse distance for string ops.
   The heavy lifting is done by an external library.  The interface
   to this library is functions like this:

   void reusedist_instr_memcpy(gcov_type *counters,
                               void *dst, void *src, size_t len);

   This function will measure the reuse distance for the given operations
   DST with offset LEN, and store values in COUNTERS for one or two pointer
   arguments.  E.g., for memcpy 2 * RD_NUM_COUNTERS counters will be set,
   first RD_NUM_COUNTERS for DST and last RD_NUM_COUNTERS for SRC.
   For strlen, only RD_NUM_COUNTERS counters will be allocated thus the
   runtime is expected to set only RD_NUM_COUNTERS counters.
   The counters will record:
   - mean reuse distance
   - mean operation size
   - call count
   - sum(reuse distance * operation size) across all calls
     To avoid overflow, each product is first scaled down by a factor of 2^12.

   All reuse distance measurements for dynamic executions of the same static
   string operation will be aggregated into a single set of counters.
   The reuse distance library uses the passed COUNTERS pointer as index
   in its internal tables.  */

static void
tree_gen_reusedist (void)
{
  basic_block bb;
  gimple_stmt_iterator gsi;

  if (DECL_STATIC_CONSTRUCTOR (current_function_decl))
    return;

  tree_init_edge_profiler ();

  FOR_EACH_BB (bb)
    for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
      {
        gimple stmt = gsi_stmt (gsi);
        stringop_subst_t subst = reusedist_is_interesting_call (stmt);

        if (subst
            && coverage_counter_alloc (
                GCOV_COUNTER_REUSE_DIST,
                subst->num_ptr_args * RD_NUM_COUNTERS))
          {
            location_t locus;
            tree counters = tree_coverage_counter_addr (
                GCOV_COUNTER_REUSE_DIST, 0);

            counters = force_gimple_operand_gsi (
                &gsi, counters, true, NULL_TREE, true, GSI_SAME_STMT);

            gsi_insert_after (
                &gsi,
                reusedist_make_instr_call (stmt, subst, counters),
                GSI_NEW_STMT);

            locus = (stmt != NULL)
                ? gimple_location (stmt)
                : DECL_SOURCE_LOCATION (current_function_decl);
            inform (locus,
                    "inserted reuse distance instrumentation for %qs, using "
                    "%d gcov counters", subst->original_name,
                    subst->num_ptr_args * RD_NUM_COUNTERS);
          }
      }
}

/* Make up a nontemporal substitution name, e.g., "libopt__memcpy__3".  */

static void
nt_op_name (const char* name, int suffix, char result[], int size)
{
  int written;

  written = snprintf (result, size, "libopt__%s__%d", name, suffix);

  gcc_assert (written < size);
}

/* Get size threshold for reusedist substitution decisions.  */

static gcov_type
reusedist_get_size_threshold (const char* name)
{
  if (!strcmp (name, "memcpy"))
    return (gcov_type)PARAM_VALUE (PARAM_REUSEDIST_MEMCPY_SIZE_THRESH);

  if (!strcmp (name, "memset"))
    return (gcov_type)PARAM_VALUE (PARAM_REUSEDIST_MEMSET_SIZE_THRESH);

  /* Use memcpy threshold as default for unspecified operations.  */
  return (gcov_type)PARAM_VALUE (PARAM_REUSEDIST_MEMCPY_SIZE_THRESH);
}

/* Get distance threshold for reusedist substitution decisions.  */

static gcov_type
reusedist_get_distance_large_threshold (void)
{
  return (gcov_type)PARAM_VALUE (PARAM_REUSEDIST_MEAN_DIST_LARGE_THRESH);
}

/* Get distance threshold for reusedist substitution decisions.  */

static gcov_type
reusedist_get_distance_small_threshold (void)
{
  return (gcov_type)PARAM_VALUE (PARAM_REUSEDIST_MEAN_DIST_SMALL_THRESH);
}

/* Get call count threshold for reusedist substitution decisions.  */

static gcov_type
reusedist_get_count_threshold (void)
{
  return (gcov_type)PARAM_VALUE (PARAM_REUSEDIST_CALL_COUNT_THRESH);
}

/* Return whether switching to nontemporal string operation is worth it.
   NAME is the function name, such as "memcpy".
   COUNTERS is a pointer to gcov counters for this operation site.
   Return 1 if worth it, -1 if not worth it and 0 if not sure.  */

static int
reusedist_nt_is_worth_it (const char* name, const gcov_type* counters)
{
  reusedist_t rd;

  reusedist_from_counters (counters, &rd);

  /* XXX: Need to add check for dist_x_size.  */

  if (rd.mean_size < reusedist_get_size_threshold (name)
      || rd.count < reusedist_get_count_threshold ())
    /* If the size of the operation is small, don't substitute.  */
    return 0;

  if (rd.mean_dist >= reusedist_get_distance_large_threshold ())
    /* Enforce non-temporal.  */
    return 1;
  else if (rd.mean_dist <= reusedist_get_distance_small_threshold ())
    /* Enforce temporal.  */
    return -1;
  else
    /* Not conclusive.  */
    return 0;
}

/* Create a declaration for a nontemporal version if not already done.
   INDEX is the index of the version in list [first, second, both].  */

static tree
reusedist_get_nt_decl (tree template_decl, stringop_subst_t subst, int index)
{
  if (!subst->nt_ops[index])
    {
      char nt_name[256];
      nt_op_name (subst->original_name, index, nt_name, 256);
      subst->nt_ops[index] = build_fn_decl (nt_name,
                                            TREE_TYPE (template_decl));
    }

  return subst->nt_ops[index];
}

/* Issue notes with reuse distance values in COUNTERS for given ARG.  */

static void
maybe_issue_profile_use_note (location_t locus, gcov_type* counters, int arg)
{
  reusedist_t rd;

  reusedist_from_counters (counters, &rd);

  if (rd.count)
    inform (locus, "reuse distance counters for arg %d: %lld %lld %lld %lld",
            arg, (long long int)rd.mean_dist, (long long int)rd.mean_size,
            (long long int)rd.count, (long long int)rd.dist_x_size);
}

/* Substitute with nontemporal version when profitable.  */

static void
reusedist_maybe_replace_with_nt_version (gimple stmt,
                                         gcov_type* counters,
                                         stringop_subst_t subst)
{
  int first, second, suffix;
  tree subst_decl;
  const char* name = subst->original_name;
  location_t locus;

  locus = (stmt != NULL)
      ? gimple_location (stmt)
      : DECL_SOURCE_LOCATION (current_function_decl);

  gcc_assert (1 == subst->num_ptr_args || 2 == subst->num_ptr_args);

  maybe_issue_profile_use_note (locus, counters, 1);
  first = reusedist_nt_is_worth_it (name, counters);

  if (2 == subst->num_ptr_args)
    {
      maybe_issue_profile_use_note (locus, counters + RD_NUM_COUNTERS, 2);
      second = reusedist_nt_is_worth_it (name, counters + RD_NUM_COUNTERS);
    }
  else
      second = 0;

  if (first > 0)
    /* Nontemporal in first arg.  */
    {
      /* The operation on the first arg should be nontemporal.  */
      if (second > 0)
        suffix = 3;
      else
        suffix = 1;
    }
  else if (first < 0)
    /* Temporal in first arg.  */
    {
      if (second > 0)
        suffix = 2;
      else if (second < 0)
        suffix = 0;
      else
        suffix = -1;
    }
  else
    /* Don't know about the first arg.  */
    {
      if (second > 0)
        suffix = 2;
      else
        suffix = -1;
    }

  if (suffix == -1)
    return;

  subst_decl = reusedist_get_nt_decl (gimple_call_fndecl (stmt), subst,
                                      suffix);
  gimple_call_set_fndecl (stmt, subst_decl);
  inform (locus, "replaced %qs with non-temporal %qs",
          subst->original_name,
          IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (subst_decl)));
}

/* Replace string operations with equivalent nontemporal, when profitable.  */

static void
optimize_reusedist (void)
{
  basic_block bb;
  gimple_stmt_iterator gsi;
  unsigned n_counters;
  unsigned counter_index = 0;
  gcov_type *counters = get_coverage_counts_no_warn (
      DECL_STRUCT_FUNCTION (current_function_decl),
      GCOV_COUNTER_REUSE_DIST, &n_counters);

  if (!n_counters || DECL_STATIC_CONSTRUCTOR (current_function_decl))
    return;

  gcc_assert (!(n_counters % RD_NUM_COUNTERS));

  FOR_EACH_BB (bb)
    for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
      {
        gimple stmt = gsi_stmt (gsi);
        stringop_subst_t subst = reusedist_is_interesting_call (stmt);

        if (subst)
          {
            if (counter_index < n_counters)
              reusedist_maybe_replace_with_nt_version (
                  stmt, &counters[counter_index], subst);
            counter_index += subst->num_ptr_args * RD_NUM_COUNTERS;
          }
      }

  if (counter_index != n_counters)
    {
      warning (0, "coverage mismatch for reuse distance counters "
               "in function %qs", IDENTIFIER_POINTER
               (DECL_ASSEMBLER_NAME (current_function_decl)));
      inform (input_location, "number of counters is %u instead of %u",
              n_counters, counter_index);
    }
}

/* Return 1 if tree-based profiling is in effect, else 0.
   If it is, set up hooks for tree-based profiling.
   Gate for pass_tree_profile.  */

static bool
do_tree_profiling (void)
{
  if (profile_arc_flag || flag_test_coverage || flag_branch_probabilities
      || flag_profile_reusedist || flag_optimize_locality)
    {
      tree_register_profile_hooks ();
      gimple_register_value_prof_hooks ();
      return true;
    }
  return false;
}

static unsigned int
tree_profiling (void)
{
  /* Don't profile functions produced at destruction time, particularly
     the gcov datastructure initializer.  Don't profile if it has been
     already instrumented either (when OpenMP expansion creates
     child function from already instrumented body).  */
  if (cgraph_state == CGRAPH_STATE_FINISHED
      || cfun->after_tree_profile)
    return 0;

  /* After value profile transformation, artificial edges (that keep
     function body from being deleted) won't be needed.  */

  cgraph_need_artificial_indirect_call_edges = 0;

  /* Re-set global shared temporary variable for edge-counters.  */
  gcov_type_tmp_var = NULL_TREE;

  branch_prob ();

  if (! flag_branch_probabilities 
      && flag_profile_values
      && !flag_dyn_ipa)
    tree_gen_ic_func_profiler ();

  if (flag_branch_probabilities
      && flag_profile_values
      && flag_value_profile_transformations)
    value_profile_transformations ();

  /* The above could hose dominator info.  Currently there is
     none coming in, this is a safety valve.  It should be
     easy to adjust it, if and when there is some.  */
  free_dominance_info (CDI_DOMINATORS);
  free_dominance_info (CDI_POST_DOMINATORS);
  cfun->after_tree_profile = 1;
  return 0;
}

/* Return true if tree-based direct-call profiling is in effect, else false.  */

static bool
do_direct_call_profiling (void)
{
  return !flag_branch_probabilities
    && (profile_arc_flag || flag_test_coverage)
    && flag_dyn_ipa;
}

/* Instrument current function to collect direct call profile information.  */

static unsigned int
direct_call_profiling (void)
{
  basic_block bb;
  gimple_stmt_iterator gsi;

  /* Add code:
     extern gcov* __gcov_direct_call_counters; // pointer to actual counter
     extern void* __gcov_direct_call_callee;   // actual callee address
  */
  if (!dc_gcov_type_ptr_var)
    {
      dc_gcov_type_ptr_var
	= build_decl (VAR_DECL,
		      get_identifier ("__gcov_direct_call_counters"),
		      build_pointer_type (gcov_type_node));
      DECL_ARTIFICIAL (dc_gcov_type_ptr_var) = 1;
      DECL_EXTERNAL (dc_gcov_type_ptr_var) = 1;
      if (targetm.have_tls && !is_kernel_build)
        {
          DECL_TLS_MODEL (dc_gcov_type_ptr_var) =
	    decl_default_tls_model (dc_gcov_type_ptr_var);
        }
      dc_void_ptr_var =
	build_decl (VAR_DECL, get_identifier ("__gcov_direct_call_callee"),
		    ptr_void);
      DECL_ARTIFICIAL (dc_void_ptr_var) = 1;
      DECL_EXTERNAL (dc_void_ptr_var) = 1;
      if (targetm.have_tls && !is_kernel_build)
        {
          DECL_TLS_MODEL (dc_void_ptr_var) =
	    decl_default_tls_model (dc_void_ptr_var);
        }
    }

  add_referenced_var (gcov_info_decl);
  add_referenced_var (dc_gcov_type_ptr_var);
  add_referenced_var (dc_void_ptr_var);

  if (!DECL_STATIC_CONSTRUCTOR (current_function_decl))
    {
      FOR_EACH_BB (bb)
	for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
	  {
	    gimple stmt = gsi_stmt (gsi);
	    /* Check if this is a direct call, and not a builtin call.  */
	    if (gimple_code (stmt) != GIMPLE_CALL
		|| gimple_call_fndecl (stmt) == NULL_TREE
		|| DECL_BUILT_IN (gimple_call_fndecl (stmt))
		|| DECL_IS_BUILTIN (gimple_call_fndecl (stmt)))
	      continue;

	    if (!coverage_counter_alloc (GCOV_COUNTER_DIRECT_CALL, 2))
	      continue;
	    tree_gen_dc_profiler (0, stmt);
	  }
      coverage_dc_end_function ();
    }

  if (coverage_function_present (FUNC_DECL_FUNC_ID (cfun)))
    {
      tree_gen_dc_func_profiler ();
      if (! flag_branch_probabilities 
          && flag_profile_values)
        tree_gen_ic_func_topn_profiler ();
    }

  return 0;
}

struct gimple_opt_pass pass_tree_profile = 
{
 {
  GIMPLE_PASS,
  "tree_profile",			/* name */
  do_tree_profiling,			/* gate */
  tree_profiling,			/* execute */
  NULL,					/* sub */
  NULL,					/* next */
  0,					/* static_pass_number */
  TV_BRANCH_PROB,			/* tv_id */
  PROP_gimple_leh | PROP_cfg,		/* properties_required */
  PROP_gimple_leh | PROP_cfg,		/* properties_provided */
  0,					/* properties_destroyed */
  0,					/* todo_flags_start */
  TODO_verify_stmts | TODO_dump_func	/* todo_flags_finish */
 }
};

struct gimple_opt_pass pass_direct_call_profile = 
{
 {
  GIMPLE_PASS,
  "dc_profile",				/* name */
  do_direct_call_profiling,		/* gate */
  direct_call_profiling,		/* execute */
  NULL,					/* sub */
  NULL,					/* next */
  0,					/* static_pass_number */
  TV_BRANCH_PROB,			/* tv_id */
  PROP_ssa | PROP_cfg,			/* properties_required */
  0,					/* properties_provided */
  0,					/* properties_destroyed */
  0,					/* todo_flags_start */
  TODO_update_ssa | TODO_dump_func	/* todo_flags_finish */
 }
};

struct profile_hooks tree_profile_hooks =
{
  tree_init_edge_profiler,       /* init_edge_profiler */
  tree_gen_edge_profiler,	 /* gen_edge_profiler */
  tree_gen_interval_profiler,    /* gen_interval_profiler */
  tree_gen_pow2_profiler,        /* gen_pow2_profiler */
  tree_gen_one_value_profiler,   /* gen_one_value_profiler */
  tree_gen_one_float_value_profiler,   /* gen_one_float_value_profiler */
  tree_gen_const_delta_profiler, /* gen_const_delta_profiler */
  tree_gen_ic_profiler,		 /* gen_ic_profiler */
  tree_gen_dc_profiler,	         /* gen_dc_profiler */
  tree_gen_average_profiler,     /* gen_average_profiler */
  tree_gen_ior_profiler,         /* gen_ior_profiler */
  tree_gen_reusedist,
  optimize_reusedist
};

#include "gt-tree-profile.h"