GCC上归纳变量的优化.pdf

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Induction-variable Optimizations in GCC 程斌 2013.11 Outline  Background  Implementation of GCC  Learned points  Shortcomings  Improvements  Question Answer  References Background – Induction variable  Induction variable  Variables whose successive values form an arithmetic progression over some part of program, usually a loop. int a[100], i; int a[100], i; for (i = 0; i 100; i++) { for (i = 0; i 100; i++) { a[i] = 202 - 2 * i a[i] = 202 - 2 * i } } /*Induction variables:/*Induction variables: i, a[ii, a[i]], 2*i, 202, 2*i, 202--2*i2*i */*/ Background – Identify induction variables  Basic/Fundamental induction variable  Variables explicitly modified by a same constant amount during each iteration of a loop.  Derived/General induction variable  Variables modified in more complex ways intint a[100], i;a[100], i; for (i = 0; i 100; ifor (i = 0; i 100; i++) {++) { a[i] = 202 a[i] = 202 -- 2 * i2 * i }} /*Induction variables:/*Induction variables: ii, , a(i)a(i), , 2*i2*i, , 202202--2*i2*i */*/ Background – Induction-variable optimizations  Strength reduction intint a[100], i;a[100], i; for (i = 0; i 100; ifor (i = 0; i 100; i++) {++) { a[i]a[i] = = 202 202 -- 2 * i2 * i }} //a[i] //a[i]  a + 4 * ia + 4 * i //202 //202 –– 2 * i2 * i intint a[100a[100], i;], i; intint *iv1 = a, iv2 = 202;*iv1 = a, iv2 = 202; for for (i = 0; i 100; i++) {(i = 0; i

文档评论(0)

xingyuxiaxiang + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档