ST20–SWC
2.2 ANSI C compilation system
2.2.1 Compiler operation
The compiler operates from a host command line interface. The preprocessor is integrated into the
compiler for fast execution. The compile time diagnostics provided by the compiler are comprehen-
sive and include type checking in expressions and type checking of function arguments.
2.2.2 ANSI conformance
The ST20 ANSI C Toolset supports the full standard language as defined in X3.159-1989. The
compiler passes all the tests in the validation suites from Plum Hall and Perennial.
2.2.3 Local optimized code generation
The compiler implements a wide range of local code optimization techniques.
Constant folding. The compiler evaluates all integer and real constant expressions at compile
time.
Workspace allocation. Frequently used variables are placed at small offsets in workspace, thus
reducing the size of the instructions needed to access them, and hence increasing the speed
of execution.
Dead-code elimination. Code that cannot be reached during the execution of the program is
removed.
Peephole optimization. Code sequences are selected that are the fastest for the operation.
Constant caching. Some constants have their load time reduced by placing them in a constant
table.
Unnecessary jumps are eliminated.
Switch statements can generate a number of different code sequences to cover the dense
ranges within the total range.
Special idioms that are better on ST20s are chosen for some code sequences.
2.2.4 Globally optimized code generation
The ANSI C globally optimizing compiler extends the types of optimizations it performs to global
techniques. These have typically given a 15–25 percent improvement in speed over the local opti-
mizations as measured by a suite of internal benchmarks.
Common sub-expression elimination removes the evaluation of an expression where it is
known that the value has already been computed; the value is stored in temporary local work-
space. This improves the speed of a program and reduces code size.
Loop-invariant code motion can move the position where an expression is evaluated from within
a loop to outside it. If the expressioncontains no variablesthat are changedduring theexecution
of a loop, then the expression can be evaluated just once before the loop is entered. By keeping
the result in a temporary, the speed of execution of the whole loop is increased.
Tail-call optimization reduces the number of calls and returns executed by a program. If the last
thing a function does is to invoke another function and immediately return the value there from,
then the compiler attempts to re-use the same workspace area by just jumping to (rather than
calling) thelower level function. The called function then returns directly to where the upper level
function was called from. In the case where the call is a recursive call to the same function, then
the workspace is exactly the right size, and a saving is also made because the stack adjustment
instructions are no longer needed either. This optimization saves speed and total stack space.
5/21
5秒后页面跳转
STM32H743技术深度剖析与应用案例探索
LM321中文资料解析：引脚功能介绍、技术特点、技术特性分析
74HC14芯片资料介绍：性能特性分析、引脚介绍
LM1875芯片手册：功放参数分析、引脚说明、电路设计要点
微信公众号
抖音公众号
浙公网安备 33010502006866号 浙ICP备10014259号-119
营业执照ICP证
数据手册
如果您发现信息不准确，
