This is the mail archive of the gcc-patches@gcc.gnu.org mailing list for the GCC project.
Index Nav: | [Date Index] [Subject Index] [Author Index] [Thread Index] | |
---|---|---|
Message Nav: | [Date Prev] [Date Next] | [Thread Prev] [Thread Next] |
Other format: | [Raw text] |
I am thinking about detecting common combinable cases like two successive casts and whatnot and let fold do its job.
My main goal is to reduce the number of statements as quickly as possible so that the time used to combine statements is offset by reduced time in other optimizers. Also, eliminating successive casts often expose copy statements of the form "SSA_NAME = SSA_NAME;", which I am sure other optimizers would love to pick up and take advantage of.
It'd increase number of vectorization candidate loops by eliminating casts. Until tree combiner is available, we are using a simple hack to eliminate casts, see eliminate_unncessary_casts() in autovect-branch.
- Devang
Index Nav: | [Date Index] [Subject Index] [Author Index] [Thread Index] | |
---|---|---|
Message Nav: | [Date Prev] [Date Next] | [Thread Prev] [Thread Next] |