2002-02-01 18:16:02 +00:00
|
|
|
@c Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
|
2003-08-22 02:56:07 +00:00
|
|
|
@c 1999, 2000, 2001, 2002 Free Software Foundation, Inc.
|
2002-02-01 18:16:02 +00:00
|
|
|
@c This is part of the GCC manual.
|
|
|
|
|
@c For copying conditions, see the file gcc.texi.
|
|
|
|
|
|
|
|
|
|
@node Portability
|
|
|
|
|
@chapter GCC and Portability
|
|
|
|
|
@cindex portability
|
|
|
|
|
@cindex GCC and portability
|
|
|
|
|
|
2003-08-22 02:56:07 +00:00
|
|
|
GCC itself aims to be portable to any machine where @code{int} is at least
|
|
|
|
|
a 32-bit type. It aims to target machines with a flat (non-segmented) byte
|
|
|
|
|
addressed data address space (the code address space can be separate).
|
|
|
|
|
Target ABIs may have 8, 16, 32 or 64-bit @code{int} type. @code{char}
|
|
|
|
|
can be wider than 8 bits.
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
GCC gets most of the information about the target machine from a machine
|
|
|
|
|
description which gives an algebraic formula for each of the machine's
|
|
|
|
|
instructions. This is a very clean way to describe the target. But when
|
|
|
|
|
the compiler needs information that is difficult to express in this
|
|
|
|
|
fashion, I have not hesitated to define an ad-hoc parameter to the machine
|
|
|
|
|
description. The purpose of portability is to reduce the total work needed
|
|
|
|
|
on the compiler; it was not of interest for its own sake.
|
|
|
|
|
|
|
|
|
|
@cindex endianness
|
|
|
|
|
@cindex autoincrement addressing, availability
|
|
|
|
|
@findex abort
|
|
|
|
|
GCC does not contain machine dependent code, but it does contain code
|
|
|
|
|
that depends on machine parameters such as endianness (whether the most
|
|
|
|
|
significant byte has the highest or lowest address of the bytes in a word)
|
|
|
|
|
and the availability of autoincrement addressing. In the RTL-generation
|
|
|
|
|
pass, it is often necessary to have multiple strategies for generating code
|
|
|
|
|
for a particular kind of syntax tree, strategies that are usable for different
|
|
|
|
|
combinations of parameters. Often I have not tried to address all possible
|
|
|
|
|
cases, but only the common ones or only the ones that I have encountered.
|
|
|
|
|
As a result, a new target may require additional strategies. You will know
|
|
|
|
|
if this happens because the compiler will call @code{abort}. Fortunately,
|
|
|
|
|
the new strategies can be added in a machine-independent fashion, and will
|
|
|
|
|
affect only the target machines that need them.
|
