Tiny C Compiler

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
Tiny C Compiler
Developer(s) Fabrice Bellard
Stable release
0.9.27 / December 17, 2017; 7 months ago (2017-12-17)
Repository repo.or.cz/w/tinycc.git
Written in C and Assembly
Operating system Linux, Unix, Windows
Type C compiler
License GNU Lesser General Public License
Website bellard.org/tcc/

The Tiny C Compiler (a.k.a. TCC, tCc, or TinyCC) is an x86, X86-64 and ARM processor C compiler created by Fabrice Bellard. It is designed to work for slow computers with little disk space (e.g. on rescue disks). Windows operating system support was added in version 0.9.23 (17 Jun 2005). TCC is distributed under the GNU Lesser General Public License (LGPL).

TCC claims to implement all of ANSI C (C89/C90),[1] much of the C99 ISO standard,[2] and many GNU C extensions including inline assembly.

Features[edit]

TCC has a number of features that differentiate it from other current C compilers:

  • Its small file size (about 100 KB for the x86 TCC executable) and memory footprint allow it to be used directly from a single 1.44 M floppy disk, such as a rescue disk.
  • TCC is intended to produce native x86, x86-64 and ARM code very quickly; according to Bellard, it compiles, assembles and links about nine times faster than GCC does.[3]
  • TCC has a number of compiler-specific language features intended to improve its practicality, such as an optional memory and bound checker, for improved code stability.
  • TCC allows programs to be run automatically at compile time using a command-line switch. This allows programs to be run as a shell script under Unix-like systems that support the shebang interpreter directive syntax.

Compiled program performance[edit]

Although the TCC compiler itself is exceptionally fast, there is an inherent trade off between this size of the compiler and the performance of the code that TCC produces.

TCC does perform a few optimizations, such as constant propagation for all operations, multiplications and divisions are optimized to shifts when appropriate, and comparison operators are specially optimized (by maintaining a special cache for the processor flags). It also does some simple register allocation, which prevents many extraneous save/load pairs inside a single statement.

But in general, TCC's implementation emphasizes smallness instead of optimally-performing results. TCC generates code in a single pass, and does not perform most of the optimizations performed by other compilers such as GCC. TCC compiles every statement on its own, and at the end of each statement register values are written back to the stack and must be re-read even if the next line uses the values in registers (creating extraneous save/load pairs between statements). TCC uses only some of the available registers (e.g., on x86 it never uses ebx, esi, or edi because they need to be preserved across function calls).[4]

Here are two benchmark examples:

  • Rough benchmarks of a recursive Fibonacci algorithm on a 1.8 GHz Intel Centrino laptop with 512 MB RAM yields a noticeable difference in results between Microsoft Visual C++ compiler 13.10.3052 and TCC. To calculate the 49th Fibonacci number, it took a MS Visual C++ program approximately 18% longer than the TCC compiled program.[citation needed]
  • With a tcc modified to compile GCC, running cc1 (the GCC C compiler) on itself required 518 seconds when compiled using GCC 3.4.2, 558 seconds using GCC 2.95.3, 545 using Microsoft C compiler, and 1145 seconds using tcc. The level of optimization in each compiler was -O1 or similar.[5]

Uses[edit]

Well-known uses of tcc include:

  • TCCBOOT,[6] a hack where TCC loads and boots a Linux kernel from source in about 10 seconds. That is to say, it is a "boot loader" that reads Linux kernel source code from disk, writes executable instructions to memory, and begins running it. This did require changes to the Linux build process.
  • TCC was used to demonstrate a defense against the trust attack.[7]
  • TCC has been used to compile GCC, though various patches were required to make this work.[8]
  • Cinpy[9] is a Python library that allows you to implement functions with C in Python modules. The functions are compiled with TCC at runtime. The results are made callable in Python through the ctypes library.
  • Comes installed on JavaScript Linux[10] (also by Bellard).
  • Has been used as a reference for the compiled version of the super micro-max chess program source.[11]

History[edit]

TCC has its origins in the Obfuscated Tiny C Compiler (OTCC), a program Bellard wrote to win the International Obfuscated C Code Contest (IOCCC) in 2001. After that time, Bellard expanded and deobfuscated the program to produce tcc.[12]

At some time prior to 4 February 2012 Fabrice Bellard updated the project's official web page to report that he was no longer working on TCC.[13]

Since Bellard's departure from the project, various people and groups have distributed patches or maintained forks of TCC to build upon or fix issues with TCC. This includes Dave Dodge's collection of unofficial tcc patches,[14] Debian and kfreebsd downstream patches,[15] and grischka's gcc patches.[5] Grischka also set up a public GIT repository for the project[16] that contains a mob branch[17] where numerous contributions, including a shared build, cross-compilers, and SELinux compatibility were added. Grischka's GIT repository later became the official TCC repository (linked to by Fabrice Bellard's Savannah project page[18]).

Current status[edit]

As of December 2017 both the official TCC mailing list[19] and the official GIT repository (as linked to by Fabrice Bellard's Savannah project page[18]) show active discussion and development by many developers and interested users. In December 2017, grischka announced on the mailing list that TCC version 0.9.27 was released [20].

See also[edit]

References[edit]

External links[edit]