Code Factoring in GCC

Code Factoring in GCC
复制标题

GCC 中的代码分解

DOI：
--
复制
发表时间：
2004
期刊：
影响因子：
--
通讯作者：
Árpád Beszédes
Árpád Beszédes
中科院分区：
--
文献类型：
--
作者：
Gábor Lóki;Ákos Kiss;J. Jász;Árpád Beszédes

文献摘要

被引文献

相似文献

尽管编译器通常专注于优化性能，但生成的代码的大小最近才受到一般桌面系统的关注。 GCC尽可能地包含一些非常有用的算法来优化代码大小，但是在本文中，尚未实现代码的方法 - 一种非常有力的方法来减少代码大小。到目前为止，已经实施了两个代码分解算法，使用CSIBE作为基准。
Though compilers usually focus on optimizing for performance, the size of the generated code has only received attention recently. On general desktop systems the code size is not the biggest concern, but on devices with a limited storage capacity compilers should strive for as small a code as possible. GCC already contains some very useful algorithms for optimizing code size, but code factoring – a very powerful approach to reducing code size – has not been implemented yet in GCC. In this paper we will provide an overview of the possibilities of using code factoring in GCC. Two code factoring algorithms have been implemented so far. These algorithms, using CSiBE as a benchmark, produced a maximum of 27% in code size reduction and an average of 3%.