Skip to content
Projects
Groups
Snippets
Help
This project
Loading...
Sign in / Register
Toggle navigation
R
riscv-gcc-1
Overview
Overview
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
lvzhengyang
riscv-gcc-1
Commits
5f57dccb
Commit
5f57dccb
authored
Jun 01, 2011
by
David Li
Committed by
Xinliang David Li
Jun 01, 2011
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Pass name cleanups
From-SVN: r174537
parent
ea6cf778
Show whitespace changes
Inline
Side-by-side
Showing
25 changed files
with
91 additions
and
62 deletions
+91
-62
gcc/ChangeLog
+8
-0
gcc/dce.c
+2
-2
gcc/except.c
+1
-1
gcc/ipa.c
+1
-1
gcc/predict.c
+1
-1
gcc/testsuite/ChangeLog
+21
-0
gcc/testsuite/g++.dg/tree-prof/indir-call-prof.C
+3
-3
gcc/testsuite/gcc.dg/profile-dir-1.c
+3
-3
gcc/testsuite/gcc.dg/profile-dir-2.c
+3
-3
gcc/testsuite/gcc.dg/profile-dir-3.c
+3
-3
gcc/testsuite/gcc.dg/tree-prof/ic-misattribution-1.c
+3
-3
gcc/testsuite/gcc.dg/tree-prof/ic-misattribution-1a.c
+1
-1
gcc/testsuite/gcc.dg/tree-prof/indir-call-prof.c
+3
-3
gcc/testsuite/gcc.dg/tree-prof/stringop-1.c
+3
-3
gcc/testsuite/gcc.dg/tree-prof/stringop-2.c
+3
-3
gcc/testsuite/gcc.dg/tree-prof/update-loopch.c
+3
-3
gcc/testsuite/gcc.dg/tree-prof/val-prof-1.c
+3
-3
gcc/testsuite/gcc.dg/tree-prof/val-prof-2.c
+3
-3
gcc/testsuite/gcc.dg/tree-prof/val-prof-3.c
+3
-3
gcc/testsuite/gcc.dg/tree-prof/val-prof-4.c
+3
-3
gcc/testsuite/gcc.dg/tree-prof/val-prof-5.c
+3
-3
gcc/testsuite/gcc.dg/tree-prof/val-prof-7.c
+3
-3
gcc/testsuite/gcc.dg/tree-ssa/dump-1.c
+2
-2
gcc/testsuite/gcc.dg/tree-ssa/loop-25.c
+8
-8
gcc/tree-profile.c
+1
-1
No files found.
gcc/ChangeLog
View file @
5f57dccb
2011-06-01 David Li <davidxl@google.com>
2011-06-01 David Li <davidxl@google.com>
* predict.c : Change pass name
* ipa.c: Ditto.
* dce.c: Ditto.
* tree-profile.c: Ditto.
* except.c: Ditto.
2011-06-01 David Li <davidxl@google.com>
* tree-pretty-print.c (dump_function_header): New function.
* tree-pretty-print.c (dump_function_header): New function.
* final.c (rest_of_clean_state): Use header dumper.
* final.c (rest_of_clean_state): Use header dumper.
* tree-cfg.c (gimple_dump_cfg): Use header dumper.
* tree-cfg.c (gimple_dump_cfg): Use header dumper.
...
...
gcc/dce.c
View file @
5f57dccb
...
@@ -734,7 +734,7 @@ struct rtl_opt_pass pass_ud_rtl_dce =
...
@@ -734,7 +734,7 @@ struct rtl_opt_pass pass_ud_rtl_dce =
{
{
{
{
RTL_PASS
,
RTL_PASS
,
"ud
dce"
,
/* name */
"ud
_
dce"
,
/* name */
gate_ud_dce
,
/* gate */
gate_ud_dce
,
/* gate */
rest_of_handle_ud_dce
,
/* execute */
rest_of_handle_ud_dce
,
/* execute */
NULL
,
/* sub */
NULL
,
/* sub */
...
@@ -1086,7 +1086,7 @@ struct rtl_opt_pass pass_fast_rtl_dce =
...
@@ -1086,7 +1086,7 @@ struct rtl_opt_pass pass_fast_rtl_dce =
{
{
{
{
RTL_PASS
,
RTL_PASS
,
"rtl
dce"
,
/* name */
"rtl
_
dce"
,
/* name */
gate_fast_dce
,
/* gate */
gate_fast_dce
,
/* gate */
rest_of_handle_fast_dce
,
/* execute */
rest_of_handle_fast_dce
,
/* execute */
NULL
,
/* sub */
NULL
,
/* sub */
...
...
gcc/except.c
View file @
5f57dccb
...
@@ -1457,7 +1457,7 @@ struct rtl_opt_pass pass_rtl_eh =
...
@@ -1457,7 +1457,7 @@ struct rtl_opt_pass pass_rtl_eh =
{
{
{
{
RTL_PASS
,
RTL_PASS
,
"rtl
eh"
,
/* name */
"rtl
_
eh"
,
/* name */
gate_handle_eh
,
/* gate */
gate_handle_eh
,
/* gate */
rest_of_handle_eh
,
/* execute */
rest_of_handle_eh
,
/* execute */
NULL
,
/* sub */
NULL
,
/* sub */
...
...
gcc/ipa.c
View file @
5f57dccb
...
@@ -1145,7 +1145,7 @@ struct ipa_opt_pass_d pass_ipa_profile =
...
@@ -1145,7 +1145,7 @@ struct ipa_opt_pass_d pass_ipa_profile =
{
{
{
{
IPA_PASS
,
IPA_PASS
,
"
ipa-profil
e"
,
/* name */
"
profile_estimat
e"
,
/* name */
gate_ipa_profile
,
/* gate */
gate_ipa_profile
,
/* gate */
ipa_profile
,
/* execute */
ipa_profile
,
/* execute */
NULL
,
/* sub */
NULL
,
/* sub */
...
...
gcc/predict.c
View file @
5f57dccb
...
@@ -2306,7 +2306,7 @@ struct gimple_opt_pass pass_profile =
...
@@ -2306,7 +2306,7 @@ struct gimple_opt_pass pass_profile =
{
{
{
{
GIMPLE_PASS
,
GIMPLE_PASS
,
"profile
"
,
/* name */
"profile
_estimate"
,
/* name */
gate_estimate_probability
,
/* gate */
gate_estimate_probability
,
/* gate */
tree_estimate_probability_driver
,
/* execute */
tree_estimate_probability_driver
,
/* execute */
NULL
,
/* sub */
NULL
,
/* sub */
...
...
gcc/testsuite/ChangeLog
View file @
5f57dccb
2011-06-01 David Li <davidxl@google.com>
* testsuite/gcc.dg/profile-dir-1.c: Change pass name.
* testsuite/gcc.dg/profile-dir-2.c: Ditto.
* testsuite/gcc.dg/tree-ssa/dump-1.c: Ditto.
* testsuite/gcc.dg/tree-ssa/loop-25.c: Ditto.
* testsuite/gcc.dg/tree-prof/stringop-1.c: Ditto.
* testsuite/gcc.dg/tree-prof/update-loopch.c: Ditto.
* testsuite/gcc.dg/tree-prof/stringop-2.c: Ditto.
* testsuite/gcc.dg/tree-prof/ic-misattribution-1.c: Ditto.
* testsuite/gcc.dg/tree-prof/ic-misattribution-1a.c: Ditto.
* testsuite/gcc.dg/tree-prof/indir-call-prof.c: Ditto.
* testsuite/gcc.dg/tree-prof/val-prof-1.c: Ditto.
* testsuite/gcc.dg/tree-prof/val-prof-2.c: Ditto.
* testsuite/gcc.dg/tree-prof/val-prof-3.c: Ditto.
* testsuite/gcc.dg/tree-prof/val-prof-4.c: Ditto.
* testsuite/gcc.dg/tree-prof/val-prof-5.c: Ditto.
* testsuite/gcc.dg/tree-prof/val-prof-7.c: Ditto.
* testsuite/gcc.dg/profile-dir-3.c: Ditto.
* testsuite/g++.dg/tree-prof/indir-call-prof.C: Ditto.
2011-06-01 Nicola Pero <nicola.pero@meta-innovation.com>
2011-06-01 Nicola Pero <nicola.pero@meta-innovation.com>
* objc.dg/attributes/method-nonnull-1.m: New test.
* objc.dg/attributes/method-nonnull-1.m: New test.
...
...
gcc/testsuite/g++.dg/tree-prof/indir-call-prof.C
View file @
5f57dccb
/* { dg-options "-O2 -fdump-tree-optimized -fdump-ipa-
tree_profile_ipa
" } */
/* { dg-options "-O2 -fdump-tree-optimized -fdump-ipa-
profile
" } */
struct
A
{
struct
A
{
A
()
{}
A
()
{}
...
@@ -33,7 +33,7 @@ main (void)
...
@@ -33,7 +33,7 @@ main (void)
return
0
;
return
0
;
}
}
/* { dg-final-use { scan-ipa-dump "Indirect call -> direct call.* AA transformation on insn" "
tree_profile_ipa
" } } */
/* { dg-final-use { scan-ipa-dump "Indirect call -> direct call.* AA transformation on insn" "
profile
" } } */
/* { dg-final-use { scan-tree-dump-not "Invalid sum" "optimized" } } */
/* { dg-final-use { scan-tree-dump-not "Invalid sum" "optimized" } } */
/* { dg-final-use { cleanup-tree-dump "optimized" } } */
/* { dg-final-use { cleanup-tree-dump "optimized" } } */
/* { dg-final-use { cleanup-ipa-dump "
tree_profile_ipa
" } } */
/* { dg-final-use { cleanup-ipa-dump "
profile
" } } */
gcc/testsuite/gcc.dg/profile-dir-1.c
View file @
5f57dccb
/* { dg-do compile } */
/* { dg-do compile } */
/* { dg-options "-O -fprofile-generate=. -fdump-ipa-
tree_profile_ipa
" } */
/* { dg-options "-O -fprofile-generate=. -fdump-ipa-
profile
" } */
/* { dg-final { scan-ipa-dump " ./profile-dir-1.gcda" "
tree_profile_ipa
" } } */
/* { dg-final { scan-ipa-dump " ./profile-dir-1.gcda" "
profile
" } } */
int
int
main
(
void
)
main
(
void
)
...
@@ -8,4 +8,4 @@ main(void)
...
@@ -8,4 +8,4 @@ main(void)
return
0
;
return
0
;
}
}
/* { dg-final { cleanup-ipa-dump "
tree_profile_ipa
" } } */
/* { dg-final { cleanup-ipa-dump "
profile
" } } */
gcc/testsuite/gcc.dg/profile-dir-2.c
View file @
5f57dccb
/* { dg-do compile } */
/* { dg-do compile } */
/* { dg-options "-O -fprofile-generate -fdump-ipa-
tree_profile_ipa
" } */
/* { dg-options "-O -fprofile-generate -fdump-ipa-
profile
" } */
/* { dg-final { scan-ipa-dump "/profile-dir-2.gcda" "
tree_profile_ipa
" } } */
/* { dg-final { scan-ipa-dump "/profile-dir-2.gcda" "
profile
" } } */
int
int
main
(
void
)
main
(
void
)
...
@@ -8,4 +8,4 @@ main(void)
...
@@ -8,4 +8,4 @@ main(void)
return
0
;
return
0
;
}
}
/* { dg-final { cleanup-ipa-dump "
tree_profile_ipa
" } } */
/* { dg-final { cleanup-ipa-dump "
profile
" } } */
gcc/testsuite/gcc.dg/profile-dir-3.c
View file @
5f57dccb
/* { dg-do compile } */
/* { dg-do compile } */
/* { dg-options "-O -fprofile-generate -fprofile-dir=. -fdump-ipa-
tree_profile_ipa
" } */
/* { dg-options "-O -fprofile-generate -fprofile-dir=. -fdump-ipa-
profile
" } */
/* { dg-final { scan-ipa-dump " ./profile-dir-3.gcda" "
tree_profile_ipa
" } } */
/* { dg-final { scan-ipa-dump " ./profile-dir-3.gcda" "
profile
" } } */
int
int
main
(
void
)
main
(
void
)
...
@@ -8,4 +8,4 @@ main(void)
...
@@ -8,4 +8,4 @@ main(void)
return
0
;
return
0
;
}
}
/* { dg-final { cleanup-ipa-dump "
tree_profile_ipa
" } } */
/* { dg-final { cleanup-ipa-dump "
profile
" } } */
gcc/testsuite/gcc.dg/tree-prof/ic-misattribution-1.c
View file @
5f57dccb
/* { dg-options "-O2 -fdump-ipa-
tree_profile_ipa
" } */
/* { dg-options "-O2 -fdump-ipa-
profile
" } */
/* { dg-additional-sources "ic-misattribution-1a.c" } */
/* { dg-additional-sources "ic-misattribution-1a.c" } */
extern
void
other_caller
(
void
);
extern
void
other_caller
(
void
);
...
@@ -15,5 +15,5 @@ caller(void (*func) (void))
...
@@ -15,5 +15,5 @@ caller(void (*func) (void))
func
();
func
();
}
}
/* { dg-final-use { scan-ipa-dump "hist->count 1 hist->all 1" "
tree_profile_ipa
" } } */
/* { dg-final-use { scan-ipa-dump "hist->count 1 hist->all 1" "
profile
" } } */
/* { dg-final-use { cleanup-ipa-dump "
tree_profile_ipa
" } } */
/* { dg-final-use { cleanup-ipa-dump "
profile
" } } */
gcc/testsuite/gcc.dg/tree-prof/ic-misattribution-1a.c
View file @
5f57dccb
...
@@ -19,4 +19,4 @@ main ()
...
@@ -19,4 +19,4 @@ main ()
return
0
;
return
0
;
}
}
/* { dg-final-use { cleanup-ipa-dump "
tree_profile_ipa
" } } */
/* { dg-final-use { cleanup-ipa-dump "
profile
" } } */
gcc/testsuite/gcc.dg/tree-prof/indir-call-prof.c
View file @
5f57dccb
/* { dg-options "-O2 -fdump-tree-optimized -fdump-ipa-
tree_profile_ipa
" } */
/* { dg-options "-O2 -fdump-tree-optimized -fdump-ipa-
profile
" } */
static
int
a1
(
void
)
static
int
a1
(
void
)
{
{
...
@@ -37,7 +37,7 @@ main (void)
...
@@ -37,7 +37,7 @@ main (void)
return
0
;
return
0
;
}
}
/* { dg-final-use { scan-ipa-dump "Indirect call -> direct call.* a1 transformation on insn" "
tree_profile_ipa
"} } */
/* { dg-final-use { scan-ipa-dump "Indirect call -> direct call.* a1 transformation on insn" "
profile
"} } */
/* { dg-final-use { scan-tree-dump-not "Invalid sum" "optimized"} } */
/* { dg-final-use { scan-tree-dump-not "Invalid sum" "optimized"} } */
/* { dg-final-use { cleanup-tree-dump "optimized" } } */
/* { dg-final-use { cleanup-tree-dump "optimized" } } */
/* { dg-final-use { cleanup-ipa-dump "
tree_profile_ipa
" } } */
/* { dg-final-use { cleanup-ipa-dump "
profile
" } } */
gcc/testsuite/gcc.dg/tree-prof/stringop-1.c
View file @
5f57dccb
/* { dg-options "-O2 -fdump-tree-optimized -fdump-ipa-
tree_profile_ipa
" } */
/* { dg-options "-O2 -fdump-tree-optimized -fdump-ipa-
profile
" } */
int
a
[
1000
];
int
a
[
1000
];
int
b
[
1000
];
int
b
[
1000
];
int
size
=
1
;
int
size
=
1
;
...
@@ -13,10 +13,10 @@ main()
...
@@ -13,10 +13,10 @@ main()
}
}
return
0
;
return
0
;
}
}
/* { dg-final-use { scan-ipa-dump "Single value 4 stringop" "
tree_profile_ipa
"} } */
/* { dg-final-use { scan-ipa-dump "Single value 4 stringop" "
profile
"} } */
/* Really this ought to simplify into assignment, but we are not there yet. */
/* Really this ought to simplify into assignment, but we are not there yet. */
/* a[0] = b[0] is what we fold the resulting memcpy into. */
/* a[0] = b[0] is what we fold the resulting memcpy into. */
/* { dg-final-use { scan-tree-dump " = MEM.*&b" "optimized"} } */
/* { dg-final-use { scan-tree-dump " = MEM.*&b" "optimized"} } */
/* { dg-final-use { scan-tree-dump "MEM.*&a\\\] = " "optimized"} } */
/* { dg-final-use { scan-tree-dump "MEM.*&a\\\] = " "optimized"} } */
/* { dg-final-use { cleanup-tree-dump "optimized" } } */
/* { dg-final-use { cleanup-tree-dump "optimized" } } */
/* { dg-final-use { cleanup-ipa-dump "
tree_profile_ipa
" } } */
/* { dg-final-use { cleanup-ipa-dump "
profile
" } } */
gcc/testsuite/gcc.dg/tree-prof/stringop-2.c
View file @
5f57dccb
/* { dg-options "-O2 -fdump-tree-optimized -fdump-ipa-
tree_profile_ipa
" } */
/* { dg-options "-O2 -fdump-tree-optimized -fdump-ipa-
profile
" } */
int
a
[
1000
];
int
a
[
1000
];
int
b
[
1000
];
int
b
[
1000
];
int
size
=
1
;
int
size
=
1
;
...
@@ -13,8 +13,8 @@ main()
...
@@ -13,8 +13,8 @@ main()
}
}
return
0
;
return
0
;
}
}
/* { dg-final-use { scan-ipa-dump "Single value 4 stringop" "
tree_profile_ipa
"} } */
/* { dg-final-use { scan-ipa-dump "Single value 4 stringop" "
profile
"} } */
/* The versioned memset of size 4 should be optimized to an assignment. */
/* The versioned memset of size 4 should be optimized to an assignment. */
/* { dg-final-use { scan-tree-dump "a\\\[0\\\] = 168430090" "optimized"} } */
/* { dg-final-use { scan-tree-dump "a\\\[0\\\] = 168430090" "optimized"} } */
/* { dg-final-use { cleanup-tree-dump "optimized" } } */
/* { dg-final-use { cleanup-tree-dump "optimized" } } */
/* { dg-final-use { cleanup-ipa-dump "
tree_profile_ipa
" } } */
/* { dg-final-use { cleanup-ipa-dump "
profile
" } } */
gcc/testsuite/gcc.dg/tree-prof/update-loopch.c
View file @
5f57dccb
/* { dg-options "-O2 -fdump-ipa-
tree_profile_ipa
-blocks -fdump-tree-optimized-blocks" } */
/* { dg-options "-O2 -fdump-ipa-
profile
-blocks -fdump-tree-optimized-blocks" } */
int
max
=
33333
;
int
max
=
33333
;
int
a
[
8
];
int
a
[
8
];
int
int
...
@@ -14,8 +14,8 @@ main ()
...
@@ -14,8 +14,8 @@ main ()
/* Loop header copying will peel away the initial conditional, so the loop body
/* Loop header copying will peel away the initial conditional, so the loop body
is once reached directly from entry point of function, rest via loopback
is once reached directly from entry point of function, rest via loopback
edge. */
edge. */
/* { dg-final-use { scan-ipa-dump "count:33333" "
tree_profile_ipa
"} } */
/* { dg-final-use { scan-ipa-dump "count:33333" "
profile
"} } */
/* { dg-final-use { scan-tree-dump "count:33332" "optimized"} } */
/* { dg-final-use { scan-tree-dump "count:33332" "optimized"} } */
/* { dg-final-use { scan-tree-dump-not "Invalid sum" "optimized"} } */
/* { dg-final-use { scan-tree-dump-not "Invalid sum" "optimized"} } */
/* { dg-final-use { cleanup-ipa-dump "
tree_profile_ipa
" } } */
/* { dg-final-use { cleanup-ipa-dump "
profile
" } } */
/* { dg-final-use { cleanup-tree-dump "optimized" } } */
/* { dg-final-use { cleanup-tree-dump "optimized" } } */
gcc/testsuite/gcc.dg/tree-prof/val-prof-1.c
View file @
5f57dccb
/* { dg-options "-O2 -fdump-tree-optimized -fdump-ipa-
tree_profile_ipa
" } */
/* { dg-options "-O2 -fdump-tree-optimized -fdump-ipa-
profile
" } */
int
a
[
1000
];
int
a
[
1000
];
int
b
=
256
;
int
b
=
256
;
int
c
=
257
;
int
c
=
257
;
...
@@ -15,8 +15,8 @@ main ()
...
@@ -15,8 +15,8 @@ main ()
}
}
return
0
;
return
0
;
}
}
/* { dg-final-use { scan-ipa-dump "Div.mod by constant n_\[0-9\]*=257 transformation on insn" "
tree_profile_ipa
"} } */
/* { dg-final-use { scan-ipa-dump "Div.mod by constant n_\[0-9\]*=257 transformation on insn" "
profile
"} } */
/* { dg-final-use { scan-tree-dump "if \\(n_\[0-9\]* != 257\\)" "optimized"} } */
/* { dg-final-use { scan-tree-dump "if \\(n_\[0-9\]* != 257\\)" "optimized"} } */
/* { dg-final-use { scan-tree-dump-not "Invalid sum" "optimized"} } */
/* { dg-final-use { scan-tree-dump-not "Invalid sum" "optimized"} } */
/* { dg-final-use { cleanup-tree-dump "optimized" } } */
/* { dg-final-use { cleanup-tree-dump "optimized" } } */
/* { dg-final-use { cleanup-ipa-dump "
tree_profile_ipa
" } } */
/* { dg-final-use { cleanup-ipa-dump "
profile
" } } */
gcc/testsuite/gcc.dg/tree-prof/val-prof-2.c
View file @
5f57dccb
/* { dg-options "-O2 -fdump-tree-optimized -fdump-ipa-
tree_profile_ipa
" } */
/* { dg-options "-O2 -fdump-tree-optimized -fdump-ipa-
profile
" } */
unsigned
int
a
[
1000
];
unsigned
int
a
[
1000
];
unsigned
int
b
=
256
;
unsigned
int
b
=
256
;
unsigned
int
c
=
1024
;
unsigned
int
c
=
1024
;
...
@@ -23,10 +23,10 @@ main ()
...
@@ -23,10 +23,10 @@ main ()
}
}
return
0
;
return
0
;
}
}
/* { dg-final-use { scan-ipa-dump "Mod power of 2 transformation on insn" "
tree_profile_ipa
" } } */
/* { dg-final-use { scan-ipa-dump "Mod power of 2 transformation on insn" "
profile
" } } */
/* This is part of code checking that n is power of 2, so we are sure that the transformation
/* This is part of code checking that n is power of 2, so we are sure that the transformation
didn't get optimized out. */
didn't get optimized out. */
/* { dg-final-use { scan-tree-dump "n_\[0-9\]* \\+ (4294967295|0x0*ffffffff)" "optimized"} } */
/* { dg-final-use { scan-tree-dump "n_\[0-9\]* \\+ (4294967295|0x0*ffffffff)" "optimized"} } */
/* { dg-final-use { scan-tree-dump-not "Invalid sum" "optimized"} } */
/* { dg-final-use { scan-tree-dump-not "Invalid sum" "optimized"} } */
/* { dg-final-use { cleanup-tree-dump "optimized" } } */
/* { dg-final-use { cleanup-tree-dump "optimized" } } */
/* { dg-final-use { cleanup-ipa-dump "
tree_profile_ipa
" } } */
/* { dg-final-use { cleanup-ipa-dump "
profile
" } } */
gcc/testsuite/gcc.dg/tree-prof/val-prof-3.c
View file @
5f57dccb
/* { dg-options "-O2 -fdump-tree-optimized -fdump-ipa-
tree_profile_ipa
" } */
/* { dg-options "-O2 -fdump-tree-optimized -fdump-ipa-
profile
" } */
unsigned
int
a
[
1000
];
unsigned
int
a
[
1000
];
unsigned
int
b
=
257
;
unsigned
int
b
=
257
;
unsigned
int
c
=
1023
;
unsigned
int
c
=
1023
;
...
@@ -23,10 +23,10 @@ main ()
...
@@ -23,10 +23,10 @@ main ()
}
}
return
0
;
return
0
;
}
}
/* { dg-final-use { scan-ipa-dump "Mod subtract transformation on insn" "
tree_profile_ipa
" } } */
/* { dg-final-use { scan-ipa-dump "Mod subtract transformation on insn" "
profile
" } } */
/* This is part of code checking that n is greater than the divisor so we are sure that it
/* This is part of code checking that n is greater than the divisor so we are sure that it
didn't get optimized out. */
didn't get optimized out. */
/* { dg-final-use { scan-tree-dump "if \\(n_\[0-9\]* \\>" "optimized"} } */
/* { dg-final-use { scan-tree-dump "if \\(n_\[0-9\]* \\>" "optimized"} } */
/* { dg-final-use { scan-tree-dump-not "Invalid sum" "optimized"} } */
/* { dg-final-use { scan-tree-dump-not "Invalid sum" "optimized"} } */
/* { dg-final-use { cleanup-tree-dump "optimized" } } */
/* { dg-final-use { cleanup-tree-dump "optimized" } } */
/* { dg-final-use { cleanup-ipa-dump "
tree_profile_ipa
" } } */
/* { dg-final-use { cleanup-ipa-dump "
profile
" } } */
gcc/testsuite/gcc.dg/tree-prof/val-prof-4.c
View file @
5f57dccb
/* { dg-options "-O2 -fdump-tree-optimized -fdump-ipa-
tree_profile_ipa
" } */
/* { dg-options "-O2 -fdump-tree-optimized -fdump-ipa-
profile
" } */
unsigned
int
a
[
1000
];
unsigned
int
a
[
1000
];
unsigned
int
b
=
999
;
unsigned
int
b
=
999
;
unsigned
int
c
=
1002
;
unsigned
int
c
=
1002
;
...
@@ -23,10 +23,10 @@ main ()
...
@@ -23,10 +23,10 @@ main ()
}
}
return
0
;
return
0
;
}
}
/* { dg-final-use { scan-ipa-dump "Mod subtract transformation on insn" "
tree_profile_ipa
" } } */
/* { dg-final-use { scan-ipa-dump "Mod subtract transformation on insn" "
profile
" } } */
/* This is part of code checking that n is greater than the divisor so we are sure that it
/* This is part of code checking that n is greater than the divisor so we are sure that it
didn't get optimized out. */
didn't get optimized out. */
/* { dg-final-use { scan-tree-dump "if \\(n_\[0-9\]* \\>" "optimized"} } */
/* { dg-final-use { scan-tree-dump "if \\(n_\[0-9\]* \\>" "optimized"} } */
/* { dg-final-use { scan-tree-dump-not "Invalid sum" "optimized"} } */
/* { dg-final-use { scan-tree-dump-not "Invalid sum" "optimized"} } */
/* { dg-final-use { cleanup-tree-dump "optimized" } } */
/* { dg-final-use { cleanup-tree-dump "optimized" } } */
/* { dg-final-use { cleanup-ipa-dump "
tree_profile_ipa
" } } */
/* { dg-final-use { cleanup-ipa-dump "
profile
" } } */
gcc/testsuite/gcc.dg/tree-prof/val-prof-5.c
View file @
5f57dccb
/* { dg-options "-O2 -fdump-tree-optimized -fdump-ipa-
tree_profile_ipa
" } */
/* { dg-options "-O2 -fdump-tree-optimized -fdump-ipa-
profile
" } */
int
a
[
1000
];
int
a
[
1000
];
int
b
=
997
;
int
b
=
997
;
main
()
main
()
...
@@ -11,7 +11,7 @@ main()
...
@@ -11,7 +11,7 @@ main()
a
[
i
]
/=
b
;
a
[
i
]
/=
b
;
return
0
;
return
0
;
}
}
/* { dg-final-use { scan-ipa-dump "Div.mod by constant b.*=997 transformation on insn" "
tree_profile_ipa
" } } */
/* { dg-final-use { scan-ipa-dump "Div.mod by constant b.*=997 transformation on insn" "
profile
" } } */
/* { dg-final-use { scan-tree-dump-not "Invalid sum" "optimized"} } */
/* { dg-final-use { scan-tree-dump-not "Invalid sum" "optimized"} } */
/* { dg-final-use { cleanup-tree-dump "optimized" } } */
/* { dg-final-use { cleanup-tree-dump "optimized" } } */
/* { dg-final-use { cleanup-ipa-dump "
tree_profile_ipa
" } } */
/* { dg-final-use { cleanup-ipa-dump "
profile
" } } */
gcc/testsuite/gcc.dg/tree-prof/val-prof-7.c
View file @
5f57dccb
/* { dg-options "-O2 -fdump-ipa-
tree_profile_ipa
-mtune=core2" } */
/* { dg-options "-O2 -fdump-ipa-
profile
-mtune=core2" } */
/* { dg-skip-if "" { ! { i?86-*-* x86_64-*-* } } { "*" } { "" } } */
/* { dg-skip-if "" { ! { i?86-*-* x86_64-*-* } } { "*" } { "" } } */
#include <strings.h>
#include <strings.h>
...
@@ -22,5 +22,5 @@ int main() {
...
@@ -22,5 +22,5 @@ int main() {
return
0
;
return
0
;
}
}
/* { dg-final-use { scan-ipa-dump "Single value 8 stringop transformation on bzero" "
tree_profile_ipa
" } } */
/* { dg-final-use { scan-ipa-dump "Single value 8 stringop transformation on bzero" "
profile
" } } */
/* { dg-final-use { cleanup-ipa-dump "
tree_profile_ipa
" } } */
/* { dg-final-use { cleanup-ipa-dump "
profile
" } } */
gcc/testsuite/gcc.dg/tree-ssa/dump-1.c
View file @
5f57dccb
/* { dg-do compile } */
/* { dg-do compile } */
/* { dg-options "-O1 -fdump-tree-profile-details" } */
/* { dg-options "-O1 -fdump-tree-profile
_estimate
-details" } */
int
f
(
void
)
int
f
(
void
)
{
{
return
0
;
return
0
;
}
}
/* { dg-final { cleanup-tree-dump "profile" } } */
/* { dg-final { cleanup-tree-dump "profile
_estimate
" } } */
gcc/testsuite/gcc.dg/tree-ssa/loop-25.c
View file @
5f57dccb
/* { dg-do compile } */
/* { dg-do compile } */
/* { dg-options "-O1 -fdump-tree-profile" } */
/* { dg-options "-O1 -fdump-tree-profile
_estimate
" } */
int
foo
(
void
);
int
foo
(
void
);
void
bla
(
void
);
void
bla
(
void
);
...
@@ -118,12 +118,12 @@ void test5 (void)
...
@@ -118,12 +118,12 @@ void test5 (void)
}
}
}
}
/* { dg-final { scan-tree-dump-times "Disambiguating loop" 5 "profile" } } */
/* { dg-final { scan-tree-dump-times "Disambiguating loop" 5 "profile
_estimate
" } } */
/* For the following xfail marks, see PR35629. */
/* For the following xfail marks, see PR35629. */
/* { dg-final { scan-tree-dump-times "Found latch edge" 5 "profile" { xfail *-*-* } } } */
/* { dg-final { scan-tree-dump-times "Found latch edge" 5 "profile
_estimate
" { xfail *-*-* } } } */
/* { dg-final { scan-tree-dump-times "Merged latch edges" 2 "profile" { xfail *-*-* } } } */
/* { dg-final { scan-tree-dump-times "Merged latch edges" 2 "profile
_estimate
" { xfail *-*-* } } } */
/* { dg-final { scan-tree-dump-times "4 loops found" 2 "profile" { xfail *-*-* } } } */
/* { dg-final { scan-tree-dump-times "4 loops found" 2 "profile
_estimate
" { xfail *-*-* } } } */
/* { dg-final { scan-tree-dump-times "3 loops found" 2 "profile" { xfail *-*-* } } } */
/* { dg-final { scan-tree-dump-times "3 loops found" 2 "profile
_estimate
" { xfail *-*-* } } } */
/* { dg-final { scan-tree-dump-times "2 loops found" 1 "profile" { xfail *-*-* } } } */
/* { dg-final { scan-tree-dump-times "2 loops found" 1 "profile
_estimate
" { xfail *-*-* } } } */
/* { dg-final { cleanup-tree-dump "profile" } } */
/* { dg-final { cleanup-tree-dump "profile
_estimate
" } } */
gcc/tree-profile.c
View file @
5f57dccb
...
@@ -579,7 +579,7 @@ struct simple_ipa_opt_pass pass_ipa_tree_profile =
...
@@ -579,7 +579,7 @@ struct simple_ipa_opt_pass pass_ipa_tree_profile =
{
{
{
{
SIMPLE_IPA_PASS
,
SIMPLE_IPA_PASS
,
"
tree_profile_ipa"
,
/* name */
"
profile"
,
/* name */
gate_tree_profile_ipa
,
/* gate */
gate_tree_profile_ipa
,
/* gate */
tree_profiling
,
/* execute */
tree_profiling
,
/* execute */
NULL
,
/* sub */
NULL
,
/* sub */
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment