C51编译器的优化问题

以下的翻译和原文

OPTIMIZE Compiler Directive
Abbreviation OT

Arguments A decimal number between 0 and 11 enclosed in parentheses optionally followed by SIZE or SPEED to specify code size or execution speed emphasis.

Default OPTIMIZE (8, SPEED)

µVision Options — C51 — Code Optimization.

Description The OPTIMIZE directive sets the optimization level and emphasis the Cx51 Compiler uses when generating object code.

Level Description
0 Constant Folding: The compiler performs calculations that reduce expressions to numeric constants, where possible. This includes calculations of run-time addresses.

Simple Access Optimizing: The compiler optimizes access of internal data and bit addresses in the 8051 system.

Jump Optimizing: The compiler always extends jumps to the final target. Jumps to jumps are eliminated.
1 Dead Code Elimination: Unused code fragments and artifacts are eliminated.

Jump Negation: Conditional jumps are closely examined to see if they can be streamlined or eliminated by the inversion of the test logic.
2 Data Overlaying: Data and bit segments suitable for static overlay are identified and internally marked. The BL51 Linker/Locator has the capability, through global data flow analysis, of selecting segments which can then be overlaid.
3 Peephole Optimizing: Redundant MOV instructions are removed. This includes unnecessary loading of objects from the memory as well as load operations with constants. Complex operations are replaced by simple operations when memory space or execution time can be saved.
4 Register Variables: Automatic variables and function arguments are located in registers when possible. Reservation of data memory for these variables is omitted.

Extended Access Optimizing: Variables from the IDATA, XDATA, PDATA and CODE areas are directly included in operations. Intermediate registers are frequently unnecessary.

Local Common Subexpression Elimination: The compiler detects multiple uses of the same expression or subexpression. The result of the first expression is saved and reused when possible. Superfluous expression calculations are eliminated from the code.

Case/Switch Optimizing: Code involving switch and case statements is optimized using jump tables or jump strings.

Simple Loop Optimizing: Program loops that fill a memory range with a constant are converted and optimized.
5 Global Common Subexpression Elimination: Identical subexpressions within a function are calculated only once when possible. The intermediate result is stored in a register and reused.
6 Loop Rotation: Program loops are rotated if the resulting program code is faster and more efficient. The loop expression of for and while loops is evaluated once at the top of the loop and then at the bottom of the loop. This optimization generates more code but speeds up execution.
7 Extended Index Access Optimizing: DPTR is used for register variables where appropriate. Pointer and array access are optimized for both execution speed and code size.
8 Common Tail Merging: When there are multiple calls to a single function, some of the setup code can be reused, thereby reducing program size.
9 Common Block Subroutines: Recurring instruction sequences are detected and converted into subroutines. The Cx51 Compiler rearranges code to obtain larger recurring sequences.
10 Rearrange Code (Linker Optimization): When detecting common block subroutines, code is rearranged to obtain larger recurring sequences.
11 Reuse of Common Exit Code (Linker Optimization): Identical exit sequences are reused. This may reduce the size of common block subroutines even further. This optimization level generates the most compact program code possible.

Note

Each higher optimization level contains all of the characteristics of the preceding lower optimization level. For example, OPTIMIZE level 9 includes all optimizations of levels 0 to 8.
You may change the optimizer level on a function-by-function basis as needed. For example:
#pragma OT(3)
void funct_1 (void)
{
...
}

#pragma OT(9)
void func_2 (void)
{
...
}

See Also OBJECTADVANCED

Example C51 SAMPLE.C OPTIMIZE (9)

C51 SAMPLE.C OPTIMIZE (0)

#pragma ot(6, SIZE)

#pragma ot(size)

翻译

附表:Keil C51中的优化级别及优化作用 级别         说明
0         常数合并：编译器预先计算结果，尽可能用常数代替表达式。包括运行地址计算。
优化简单访问：编译器优化访问8051系统的内部数据和位地址。
跳转优化：编译器总是扩展跳转到最终目标，多级跳转指令被删除。
1         死代码删除：没用的代码段被删除。
拒绝跳转：严密的检查条件跳转，以确定是否可以倒置测试逻辑来改进或删除。
2         数据覆盖：适合静态覆盖的数据和位段被确定，并内部标识。BL51连接/定位器可以通过全局数据流分析，选择可被覆盖的段。
3         窥孔优化：清除多余的MOV指令。这包括不必要的从存储区加载和常数加载操作。当存储空间或执行时间可节省时，用简单操作代替复杂操作。
4         寄存器变量：如有可能，自动变量和函数参数分配到寄存器上。为这些变量保留的存储区就省略了。
优化扩展访问：IDATA、XDATA、PDATA和CODE的变量直接包含在操作中。在多数时间没必要使用中间寄存器。
局部公共子表达式删除：如果用一个表达式重复进行相同的计算，则保存第一次计算结果，后面有可能就用这结果。多余的计算就被删除。
Case/Switch优化：包含SWITCH和CASE的代码优化为跳转表或跳转队列。
5         全局公共子表达式删除：一个函数内相同的子表达式有可能就只计算一次。中间结果保存在寄存器中，在一个新的计算中使用。
简单循环优化：用一个常数填充存储区的循环程序被修改和优化。
6         循环优化：如果结果程序代码更快和有效则程序对循环进行优化。
7         扩展索引访问优化：适当时对寄存器变量用DPTR。对指针和数组访问进行执行速度和代码大小优化。
8         公共尾部合并：当一个函数有多个调用，一些设置代码可以复用，因此减少程序大小。
9         公共块子程序：检测循环指令序列，并转换成子程序。Cx51甚至重排代码以得到更大的循环序列。

注意：

有些人习惯整体程序都选择同一个优化级,事实上每个C文件都可以有独立的优化级别的：

在工作区右键选择你的模块（.C）然后选取Options for File xxx就会出现如下界面:

OPTIMIZE还可以多一个参数,就是speed和size,
用法： #pragma OPTIMIZE(9,speed)或#pragma OPTIMIZE(5,size）
对应的就是9级优化,以速度为主,或5级优化,以空间最小为主。