]>
Commit | Line | Data |
---|---|---|
c5c76735 | 1 | @c Copyright (C) 1988,89,92,93,94,96,98, 99 Free Software Foundation, Inc. |
c1f7febf RK |
2 | @c This is part of the GCC manual. |
3 | @c For copying conditions, see the file gcc.texi. | |
4 | ||
5 | @node C Extensions | |
6 | @chapter Extensions to the C Language Family | |
7 | @cindex extensions, C language | |
8 | @cindex C language extensions | |
9 | ||
10 | GNU C provides several language features not found in ANSI standard C. | |
11 | (The @samp{-pedantic} option directs GNU CC to print a warning message if | |
12 | any of these features is used.) To test for the availability of these | |
13 | features in conditional compilation, check for a predefined macro | |
14 | @code{__GNUC__}, which is always defined under GNU CC. | |
15 | ||
16 | These extensions are available in C and Objective C. Most of them are | |
17 | also available in C++. @xref{C++ Extensions,,Extensions to the | |
18 | C++ Language}, for extensions that apply @emph{only} to C++. | |
19 | ||
20 | @c The only difference between the two versions of this menu is that the | |
21 | @c version for clear INTERNALS has an extra node, "Constraints" (which | |
22 | @c appears in a separate chapter in the other version of the manual). | |
23 | @ifset INTERNALS | |
24 | @menu | |
25 | * Statement Exprs:: Putting statements and declarations inside expressions. | |
26 | * Local Labels:: Labels local to a statement-expression. | |
27 | * Labels as Values:: Getting pointers to labels, and computed gotos. | |
28 | * Nested Functions:: As in Algol and Pascal, lexical scoping of functions. | |
29 | * Constructing Calls:: Dispatching a call to another function. | |
30 | * Naming Types:: Giving a name to the type of some expression. | |
31 | * Typeof:: @code{typeof}: referring to the type of an expression. | |
32 | * Lvalues:: Using @samp{?:}, @samp{,} and casts in lvalues. | |
33 | * Conditionals:: Omitting the middle operand of a @samp{?:} expression. | |
34 | * Long Long:: Double-word integers---@code{long long int}. | |
35 | * Complex:: Data types for complex numbers. | |
6f4d7222 | 36 | * Hex Floats:: Hexadecimal floating-point constants. |
c1f7febf RK |
37 | * Zero Length:: Zero-length arrays. |
38 | * Variable Length:: Arrays whose length is computed at run time. | |
39 | * Macro Varargs:: Macros with variable number of arguments. | |
40 | * Subscripting:: Any array can be subscripted, even if not an lvalue. | |
41 | * Pointer Arith:: Arithmetic on @code{void}-pointers and function pointers. | |
42 | * Initializers:: Non-constant initializers. | |
43 | * Constructors:: Constructor expressions give structures, unions | |
44 | or arrays as values. | |
45 | * Labeled Elements:: Labeling elements of initializers. | |
46 | * Cast to Union:: Casting to union type from any member of the union. | |
47 | * Case Ranges:: `case 1 ... 9' and such. | |
48 | * Function Attributes:: Declaring that functions have no side effects, | |
49 | or that they can never return. | |
50 | * Function Prototypes:: Prototype declarations and old-style definitions. | |
51 | * C++ Comments:: C++ comments are recognized. | |
52 | * Dollar Signs:: Dollar sign is allowed in identifiers. | |
53 | * Character Escapes:: @samp{\e} stands for the character @key{ESC}. | |
54 | * Variable Attributes:: Specifying attributes of variables. | |
55 | * Type Attributes:: Specifying attributes of types. | |
56 | * Alignment:: Inquiring about the alignment of a type or variable. | |
57 | * Inline:: Defining inline functions (as fast as macros). | |
58 | * Extended Asm:: Assembler instructions with C expressions as operands. | |
59 | (With them you can define ``built-in'' functions.) | |
60 | * Asm Labels:: Specifying the assembler name to use for a C symbol. | |
61 | * Explicit Reg Vars:: Defining variables residing in specified registers. | |
62 | * Alternate Keywords:: @code{__const__}, @code{__asm__}, etc., for header files. | |
63 | * Incomplete Enums:: @code{enum foo;}, with details to follow. | |
64 | * Function Names:: Printable strings which are the name of the current | |
65 | function. | |
66 | * Return Address:: Getting the return or frame address of a function. | |
185ebd6c | 67 | * Other Builtins:: Other built-in functions. |
2de45c06 | 68 | * Deprecated Features:: Things might disappear from g++. |
c1f7febf RK |
69 | @end menu |
70 | @end ifset | |
71 | @ifclear INTERNALS | |
72 | @menu | |
73 | * Statement Exprs:: Putting statements and declarations inside expressions. | |
74 | * Local Labels:: Labels local to a statement-expression. | |
75 | * Labels as Values:: Getting pointers to labels, and computed gotos. | |
76 | * Nested Functions:: As in Algol and Pascal, lexical scoping of functions. | |
77 | * Constructing Calls:: Dispatching a call to another function. | |
78 | * Naming Types:: Giving a name to the type of some expression. | |
79 | * Typeof:: @code{typeof}: referring to the type of an expression. | |
80 | * Lvalues:: Using @samp{?:}, @samp{,} and casts in lvalues. | |
81 | * Conditionals:: Omitting the middle operand of a @samp{?:} expression. | |
82 | * Long Long:: Double-word integers---@code{long long int}. | |
83 | * Complex:: Data types for complex numbers. | |
6f4d7222 | 84 | * Hex Floats:: Hexadecimal floating-point constants. |
c1f7febf RK |
85 | * Zero Length:: Zero-length arrays. |
86 | * Variable Length:: Arrays whose length is computed at run time. | |
87 | * Macro Varargs:: Macros with variable number of arguments. | |
88 | * Subscripting:: Any array can be subscripted, even if not an lvalue. | |
89 | * Pointer Arith:: Arithmetic on @code{void}-pointers and function pointers. | |
90 | * Initializers:: Non-constant initializers. | |
91 | * Constructors:: Constructor expressions give structures, unions | |
92 | or arrays as values. | |
93 | * Labeled Elements:: Labeling elements of initializers. | |
94 | * Cast to Union:: Casting to union type from any member of the union. | |
95 | * Case Ranges:: `case 1 ... 9' and such. | |
96 | * Function Attributes:: Declaring that functions have no side effects, | |
97 | or that they can never return. | |
98 | * Function Prototypes:: Prototype declarations and old-style definitions. | |
99 | * C++ Comments:: C++ comments are recognized. | |
100 | * Dollar Signs:: Dollar sign is allowed in identifiers. | |
101 | * Character Escapes:: @samp{\e} stands for the character @key{ESC}. | |
102 | * Variable Attributes:: Specifying attributes of variables. | |
103 | * Type Attributes:: Specifying attributes of types. | |
104 | * Alignment:: Inquiring about the alignment of a type or variable. | |
105 | * Inline:: Defining inline functions (as fast as macros). | |
106 | * Extended Asm:: Assembler instructions with C expressions as operands. | |
107 | (With them you can define ``built-in'' functions.) | |
108 | * Constraints:: Constraints for asm operands | |
109 | * Asm Labels:: Specifying the assembler name to use for a C symbol. | |
110 | * Explicit Reg Vars:: Defining variables residing in specified registers. | |
111 | * Alternate Keywords:: @code{__const__}, @code{__asm__}, etc., for header files. | |
112 | * Incomplete Enums:: @code{enum foo;}, with details to follow. | |
113 | * Function Names:: Printable strings which are the name of the current | |
114 | function. | |
115 | * Return Address:: Getting the return or frame address of a function. | |
2de45c06 | 116 | * Deprecated Features:: Things might disappear from g++. |
c5c76735 | 117 | * Other Builtins:: Other built-in functions. |
c1f7febf RK |
118 | @end menu |
119 | @end ifclear | |
120 | ||
121 | @node Statement Exprs | |
122 | @section Statements and Declarations in Expressions | |
123 | @cindex statements inside expressions | |
124 | @cindex declarations inside expressions | |
125 | @cindex expressions containing statements | |
126 | @cindex macros, statements in expressions | |
127 | ||
128 | @c the above section title wrapped and causes an underfull hbox.. i | |
129 | @c changed it from "within" to "in". --mew 4feb93 | |
130 | ||
131 | A compound statement enclosed in parentheses may appear as an expression | |
132 | in GNU C. This allows you to use loops, switches, and local variables | |
133 | within an expression. | |
134 | ||
135 | Recall that a compound statement is a sequence of statements surrounded | |
136 | by braces; in this construct, parentheses go around the braces. For | |
137 | example: | |
138 | ||
139 | @example | |
140 | (@{ int y = foo (); int z; | |
141 | if (y > 0) z = y; | |
142 | else z = - y; | |
143 | z; @}) | |
144 | @end example | |
145 | ||
146 | @noindent | |
147 | is a valid (though slightly more complex than necessary) expression | |
148 | for the absolute value of @code{foo ()}. | |
149 | ||
150 | The last thing in the compound statement should be an expression | |
151 | followed by a semicolon; the value of this subexpression serves as the | |
152 | value of the entire construct. (If you use some other kind of statement | |
153 | last within the braces, the construct has type @code{void}, and thus | |
154 | effectively no value.) | |
155 | ||
156 | This feature is especially useful in making macro definitions ``safe'' (so | |
157 | that they evaluate each operand exactly once). For example, the | |
158 | ``maximum'' function is commonly defined as a macro in standard C as | |
159 | follows: | |
160 | ||
161 | @example | |
162 | #define max(a,b) ((a) > (b) ? (a) : (b)) | |
163 | @end example | |
164 | ||
165 | @noindent | |
166 | @cindex side effects, macro argument | |
167 | But this definition computes either @var{a} or @var{b} twice, with bad | |
168 | results if the operand has side effects. In GNU C, if you know the | |
169 | type of the operands (here let's assume @code{int}), you can define | |
170 | the macro safely as follows: | |
171 | ||
172 | @example | |
173 | #define maxint(a,b) \ | |
174 | (@{int _a = (a), _b = (b); _a > _b ? _a : _b; @}) | |
175 | @end example | |
176 | ||
177 | Embedded statements are not allowed in constant expressions, such as | |
178 | the value of an enumeration constant, the width of a bit field, or | |
179 | the initial value of a static variable. | |
180 | ||
181 | If you don't know the type of the operand, you can still do this, but you | |
182 | must use @code{typeof} (@pxref{Typeof}) or type naming (@pxref{Naming | |
183 | Types}). | |
184 | ||
185 | @node Local Labels | |
186 | @section Locally Declared Labels | |
187 | @cindex local labels | |
188 | @cindex macros, local labels | |
189 | ||
190 | Each statement expression is a scope in which @dfn{local labels} can be | |
191 | declared. A local label is simply an identifier; you can jump to it | |
192 | with an ordinary @code{goto} statement, but only from within the | |
193 | statement expression it belongs to. | |
194 | ||
195 | A local label declaration looks like this: | |
196 | ||
197 | @example | |
198 | __label__ @var{label}; | |
199 | @end example | |
200 | ||
201 | @noindent | |
202 | or | |
203 | ||
204 | @example | |
205 | __label__ @var{label1}, @var{label2}, @dots{}; | |
206 | @end example | |
207 | ||
208 | Local label declarations must come at the beginning of the statement | |
209 | expression, right after the @samp{(@{}, before any ordinary | |
210 | declarations. | |
211 | ||
212 | The label declaration defines the label @emph{name}, but does not define | |
213 | the label itself. You must do this in the usual way, with | |
214 | @code{@var{label}:}, within the statements of the statement expression. | |
215 | ||
216 | The local label feature is useful because statement expressions are | |
217 | often used in macros. If the macro contains nested loops, a @code{goto} | |
218 | can be useful for breaking out of them. However, an ordinary label | |
219 | whose scope is the whole function cannot be used: if the macro can be | |
220 | expanded several times in one function, the label will be multiply | |
221 | defined in that function. A local label avoids this problem. For | |
222 | example: | |
223 | ||
224 | @example | |
225 | #define SEARCH(array, target) \ | |
226 | (@{ \ | |
227 | __label__ found; \ | |
228 | typeof (target) _SEARCH_target = (target); \ | |
229 | typeof (*(array)) *_SEARCH_array = (array); \ | |
230 | int i, j; \ | |
231 | int value; \ | |
232 | for (i = 0; i < max; i++) \ | |
233 | for (j = 0; j < max; j++) \ | |
234 | if (_SEARCH_array[i][j] == _SEARCH_target) \ | |
235 | @{ value = i; goto found; @} \ | |
236 | value = -1; \ | |
237 | found: \ | |
238 | value; \ | |
239 | @}) | |
240 | @end example | |
241 | ||
242 | @node Labels as Values | |
243 | @section Labels as Values | |
244 | @cindex labels as values | |
245 | @cindex computed gotos | |
246 | @cindex goto with computed label | |
247 | @cindex address of a label | |
248 | ||
249 | You can get the address of a label defined in the current function | |
250 | (or a containing function) with the unary operator @samp{&&}. The | |
251 | value has type @code{void *}. This value is a constant and can be used | |
252 | wherever a constant of that type is valid. For example: | |
253 | ||
254 | @example | |
255 | void *ptr; | |
256 | @dots{} | |
257 | ptr = &&foo; | |
258 | @end example | |
259 | ||
260 | To use these values, you need to be able to jump to one. This is done | |
261 | with the computed goto statement@footnote{The analogous feature in | |
262 | Fortran is called an assigned goto, but that name seems inappropriate in | |
263 | C, where one can do more than simply store label addresses in label | |
264 | variables.}, @code{goto *@var{exp};}. For example, | |
265 | ||
266 | @example | |
267 | goto *ptr; | |
268 | @end example | |
269 | ||
270 | @noindent | |
271 | Any expression of type @code{void *} is allowed. | |
272 | ||
273 | One way of using these constants is in initializing a static array that | |
274 | will serve as a jump table: | |
275 | ||
276 | @example | |
277 | static void *array[] = @{ &&foo, &&bar, &&hack @}; | |
278 | @end example | |
279 | ||
280 | Then you can select a label with indexing, like this: | |
281 | ||
282 | @example | |
283 | goto *array[i]; | |
284 | @end example | |
285 | ||
286 | @noindent | |
287 | Note that this does not check whether the subscript is in bounds---array | |
288 | indexing in C never does that. | |
289 | ||
290 | Such an array of label values serves a purpose much like that of the | |
291 | @code{switch} statement. The @code{switch} statement is cleaner, so | |
292 | use that rather than an array unless the problem does not fit a | |
293 | @code{switch} statement very well. | |
294 | ||
295 | Another use of label values is in an interpreter for threaded code. | |
296 | The labels within the interpreter function can be stored in the | |
297 | threaded code for super-fast dispatching. | |
298 | ||
47620e09 RH |
299 | You may not use this mechanism to jump to code in a different function. |
300 | If you do that, totally unpredictable things will happen. The best way to | |
c1f7febf RK |
301 | avoid this is to store the label address only in automatic variables and |
302 | never pass it as an argument. | |
303 | ||
47620e09 RH |
304 | An alternate way to write the above example is |
305 | ||
306 | @example | |
307 | static const int array[] = @{ &&foo - &&foo, &&bar - &&foo, &&hack - &&foo @}; | |
308 | goto *(&&foo + array[i]); | |
309 | @end example | |
310 | ||
311 | @noindent | |
312 | This is more friendly to code living in shared libraries, as it reduces | |
313 | the number of dynamic relocations that are needed, and by consequence, | |
314 | allows the data to be read-only. | |
315 | ||
c1f7febf RK |
316 | @node Nested Functions |
317 | @section Nested Functions | |
318 | @cindex nested functions | |
319 | @cindex downward funargs | |
320 | @cindex thunks | |
321 | ||
322 | A @dfn{nested function} is a function defined inside another function. | |
323 | (Nested functions are not supported for GNU C++.) The nested function's | |
324 | name is local to the block where it is defined. For example, here we | |
325 | define a nested function named @code{square}, and call it twice: | |
326 | ||
327 | @example | |
328 | @group | |
329 | foo (double a, double b) | |
330 | @{ | |
331 | double square (double z) @{ return z * z; @} | |
332 | ||
333 | return square (a) + square (b); | |
334 | @} | |
335 | @end group | |
336 | @end example | |
337 | ||
338 | The nested function can access all the variables of the containing | |
339 | function that are visible at the point of its definition. This is | |
340 | called @dfn{lexical scoping}. For example, here we show a nested | |
341 | function which uses an inherited variable named @code{offset}: | |
342 | ||
343 | @example | |
344 | bar (int *array, int offset, int size) | |
345 | @{ | |
346 | int access (int *array, int index) | |
347 | @{ return array[index + offset]; @} | |
348 | int i; | |
349 | @dots{} | |
350 | for (i = 0; i < size; i++) | |
351 | @dots{} access (array, i) @dots{} | |
352 | @} | |
353 | @end example | |
354 | ||
355 | Nested function definitions are permitted within functions in the places | |
356 | where variable definitions are allowed; that is, in any block, before | |
357 | the first statement in the block. | |
358 | ||
359 | It is possible to call the nested function from outside the scope of its | |
360 | name by storing its address or passing the address to another function: | |
361 | ||
362 | @example | |
363 | hack (int *array, int size) | |
364 | @{ | |
365 | void store (int index, int value) | |
366 | @{ array[index] = value; @} | |
367 | ||
368 | intermediate (store, size); | |
369 | @} | |
370 | @end example | |
371 | ||
372 | Here, the function @code{intermediate} receives the address of | |
373 | @code{store} as an argument. If @code{intermediate} calls @code{store}, | |
374 | the arguments given to @code{store} are used to store into @code{array}. | |
375 | But this technique works only so long as the containing function | |
376 | (@code{hack}, in this example) does not exit. | |
377 | ||
378 | If you try to call the nested function through its address after the | |
379 | containing function has exited, all hell will break loose. If you try | |
380 | to call it after a containing scope level has exited, and if it refers | |
381 | to some of the variables that are no longer in scope, you may be lucky, | |
382 | but it's not wise to take the risk. If, however, the nested function | |
383 | does not refer to anything that has gone out of scope, you should be | |
384 | safe. | |
385 | ||
386 | GNU CC implements taking the address of a nested function using a | |
674032e2 JL |
387 | technique called @dfn{trampolines}. A paper describing them is |
388 | available as @samp{http://master.debian.org/~karlheg/Usenix88-lexic.pdf}. | |
c1f7febf RK |
389 | |
390 | A nested function can jump to a label inherited from a containing | |
391 | function, provided the label was explicitly declared in the containing | |
392 | function (@pxref{Local Labels}). Such a jump returns instantly to the | |
393 | containing function, exiting the nested function which did the | |
394 | @code{goto} and any intermediate functions as well. Here is an example: | |
395 | ||
396 | @example | |
397 | @group | |
398 | bar (int *array, int offset, int size) | |
399 | @{ | |
400 | __label__ failure; | |
401 | int access (int *array, int index) | |
402 | @{ | |
403 | if (index > size) | |
404 | goto failure; | |
405 | return array[index + offset]; | |
406 | @} | |
407 | int i; | |
408 | @dots{} | |
409 | for (i = 0; i < size; i++) | |
410 | @dots{} access (array, i) @dots{} | |
411 | @dots{} | |
412 | return 0; | |
413 | ||
414 | /* @r{Control comes here from @code{access} | |
415 | if it detects an error.} */ | |
416 | failure: | |
417 | return -1; | |
418 | @} | |
419 | @end group | |
420 | @end example | |
421 | ||
422 | A nested function always has internal linkage. Declaring one with | |
423 | @code{extern} is erroneous. If you need to declare the nested function | |
424 | before its definition, use @code{auto} (which is otherwise meaningless | |
425 | for function declarations). | |
426 | ||
427 | @example | |
428 | bar (int *array, int offset, int size) | |
429 | @{ | |
430 | __label__ failure; | |
431 | auto int access (int *, int); | |
432 | @dots{} | |
433 | int access (int *array, int index) | |
434 | @{ | |
435 | if (index > size) | |
436 | goto failure; | |
437 | return array[index + offset]; | |
438 | @} | |
439 | @dots{} | |
440 | @} | |
441 | @end example | |
442 | ||
443 | @node Constructing Calls | |
444 | @section Constructing Function Calls | |
445 | @cindex constructing calls | |
446 | @cindex forwarding calls | |
447 | ||
448 | Using the built-in functions described below, you can record | |
449 | the arguments a function received, and call another function | |
450 | with the same arguments, without knowing the number or types | |
451 | of the arguments. | |
452 | ||
453 | You can also record the return value of that function call, | |
454 | and later return that value, without knowing what data type | |
455 | the function tried to return (as long as your caller expects | |
456 | that data type). | |
457 | ||
458 | @table @code | |
459 | @findex __builtin_apply_args | |
460 | @item __builtin_apply_args () | |
461 | This built-in function returns a pointer of type @code{void *} to data | |
462 | describing how to perform a call with the same arguments as were passed | |
463 | to the current function. | |
464 | ||
465 | The function saves the arg pointer register, structure value address, | |
466 | and all registers that might be used to pass arguments to a function | |
467 | into a block of memory allocated on the stack. Then it returns the | |
468 | address of that block. | |
469 | ||
470 | @findex __builtin_apply | |
471 | @item __builtin_apply (@var{function}, @var{arguments}, @var{size}) | |
472 | This built-in function invokes @var{function} (type @code{void (*)()}) | |
473 | with a copy of the parameters described by @var{arguments} (type | |
474 | @code{void *}) and @var{size} (type @code{int}). | |
475 | ||
476 | The value of @var{arguments} should be the value returned by | |
477 | @code{__builtin_apply_args}. The argument @var{size} specifies the size | |
478 | of the stack argument data, in bytes. | |
479 | ||
480 | This function returns a pointer of type @code{void *} to data describing | |
481 | how to return whatever value was returned by @var{function}. The data | |
482 | is saved in a block of memory allocated on the stack. | |
483 | ||
484 | It is not always simple to compute the proper value for @var{size}. The | |
485 | value is used by @code{__builtin_apply} to compute the amount of data | |
486 | that should be pushed on the stack and copied from the incoming argument | |
487 | area. | |
488 | ||
489 | @findex __builtin_return | |
490 | @item __builtin_return (@var{result}) | |
491 | This built-in function returns the value described by @var{result} from | |
492 | the containing function. You should specify, for @var{result}, a value | |
493 | returned by @code{__builtin_apply}. | |
494 | @end table | |
495 | ||
496 | @node Naming Types | |
497 | @section Naming an Expression's Type | |
498 | @cindex naming types | |
499 | ||
500 | You can give a name to the type of an expression using a @code{typedef} | |
501 | declaration with an initializer. Here is how to define @var{name} as a | |
502 | type name for the type of @var{exp}: | |
503 | ||
504 | @example | |
505 | typedef @var{name} = @var{exp}; | |
506 | @end example | |
507 | ||
508 | This is useful in conjunction with the statements-within-expressions | |
509 | feature. Here is how the two together can be used to define a safe | |
510 | ``maximum'' macro that operates on any arithmetic type: | |
511 | ||
512 | @example | |
513 | #define max(a,b) \ | |
514 | (@{typedef _ta = (a), _tb = (b); \ | |
515 | _ta _a = (a); _tb _b = (b); \ | |
516 | _a > _b ? _a : _b; @}) | |
517 | @end example | |
518 | ||
519 | @cindex underscores in variables in macros | |
520 | @cindex @samp{_} in variables in macros | |
521 | @cindex local variables in macros | |
522 | @cindex variables, local, in macros | |
523 | @cindex macros, local variables in | |
524 | ||
525 | The reason for using names that start with underscores for the local | |
526 | variables is to avoid conflicts with variable names that occur within the | |
527 | expressions that are substituted for @code{a} and @code{b}. Eventually we | |
528 | hope to design a new form of declaration syntax that allows you to declare | |
529 | variables whose scopes start only after their initializers; this will be a | |
530 | more reliable way to prevent such conflicts. | |
531 | ||
532 | @node Typeof | |
533 | @section Referring to a Type with @code{typeof} | |
534 | @findex typeof | |
535 | @findex sizeof | |
536 | @cindex macros, types of arguments | |
537 | ||
538 | Another way to refer to the type of an expression is with @code{typeof}. | |
539 | The syntax of using of this keyword looks like @code{sizeof}, but the | |
540 | construct acts semantically like a type name defined with @code{typedef}. | |
541 | ||
542 | There are two ways of writing the argument to @code{typeof}: with an | |
543 | expression or with a type. Here is an example with an expression: | |
544 | ||
545 | @example | |
546 | typeof (x[0](1)) | |
547 | @end example | |
548 | ||
549 | @noindent | |
550 | This assumes that @code{x} is an array of functions; the type described | |
551 | is that of the values of the functions. | |
552 | ||
553 | Here is an example with a typename as the argument: | |
554 | ||
555 | @example | |
556 | typeof (int *) | |
557 | @end example | |
558 | ||
559 | @noindent | |
560 | Here the type described is that of pointers to @code{int}. | |
561 | ||
562 | If you are writing a header file that must work when included in ANSI C | |
563 | programs, write @code{__typeof__} instead of @code{typeof}. | |
564 | @xref{Alternate Keywords}. | |
565 | ||
566 | A @code{typeof}-construct can be used anywhere a typedef name could be | |
567 | used. For example, you can use it in a declaration, in a cast, or inside | |
568 | of @code{sizeof} or @code{typeof}. | |
569 | ||
570 | @itemize @bullet | |
571 | @item | |
572 | This declares @code{y} with the type of what @code{x} points to. | |
573 | ||
574 | @example | |
575 | typeof (*x) y; | |
576 | @end example | |
577 | ||
578 | @item | |
579 | This declares @code{y} as an array of such values. | |
580 | ||
581 | @example | |
582 | typeof (*x) y[4]; | |
583 | @end example | |
584 | ||
585 | @item | |
586 | This declares @code{y} as an array of pointers to characters: | |
587 | ||
588 | @example | |
589 | typeof (typeof (char *)[4]) y; | |
590 | @end example | |
591 | ||
592 | @noindent | |
593 | It is equivalent to the following traditional C declaration: | |
594 | ||
595 | @example | |
596 | char *y[4]; | |
597 | @end example | |
598 | ||
599 | To see the meaning of the declaration using @code{typeof}, and why it | |
600 | might be a useful way to write, let's rewrite it with these macros: | |
601 | ||
602 | @example | |
603 | #define pointer(T) typeof(T *) | |
604 | #define array(T, N) typeof(T [N]) | |
605 | @end example | |
606 | ||
607 | @noindent | |
608 | Now the declaration can be rewritten this way: | |
609 | ||
610 | @example | |
611 | array (pointer (char), 4) y; | |
612 | @end example | |
613 | ||
614 | @noindent | |
615 | Thus, @code{array (pointer (char), 4)} is the type of arrays of 4 | |
616 | pointers to @code{char}. | |
617 | @end itemize | |
618 | ||
619 | @node Lvalues | |
620 | @section Generalized Lvalues | |
621 | @cindex compound expressions as lvalues | |
622 | @cindex expressions, compound, as lvalues | |
623 | @cindex conditional expressions as lvalues | |
624 | @cindex expressions, conditional, as lvalues | |
625 | @cindex casts as lvalues | |
626 | @cindex generalized lvalues | |
627 | @cindex lvalues, generalized | |
628 | @cindex extensions, @code{?:} | |
629 | @cindex @code{?:} extensions | |
630 | Compound expressions, conditional expressions and casts are allowed as | |
631 | lvalues provided their operands are lvalues. This means that you can take | |
632 | their addresses or store values into them. | |
633 | ||
634 | Standard C++ allows compound expressions and conditional expressions as | |
635 | lvalues, and permits casts to reference type, so use of this extension | |
636 | is deprecated for C++ code. | |
637 | ||
638 | For example, a compound expression can be assigned, provided the last | |
639 | expression in the sequence is an lvalue. These two expressions are | |
640 | equivalent: | |
641 | ||
642 | @example | |
643 | (a, b) += 5 | |
644 | a, (b += 5) | |
645 | @end example | |
646 | ||
647 | Similarly, the address of the compound expression can be taken. These two | |
648 | expressions are equivalent: | |
649 | ||
650 | @example | |
651 | &(a, b) | |
652 | a, &b | |
653 | @end example | |
654 | ||
655 | A conditional expression is a valid lvalue if its type is not void and the | |
656 | true and false branches are both valid lvalues. For example, these two | |
657 | expressions are equivalent: | |
658 | ||
659 | @example | |
660 | (a ? b : c) = 5 | |
661 | (a ? b = 5 : (c = 5)) | |
662 | @end example | |
663 | ||
664 | A cast is a valid lvalue if its operand is an lvalue. A simple | |
665 | assignment whose left-hand side is a cast works by converting the | |
666 | right-hand side first to the specified type, then to the type of the | |
667 | inner left-hand side expression. After this is stored, the value is | |
668 | converted back to the specified type to become the value of the | |
669 | assignment. Thus, if @code{a} has type @code{char *}, the following two | |
670 | expressions are equivalent: | |
671 | ||
672 | @example | |
673 | (int)a = 5 | |
674 | (int)(a = (char *)(int)5) | |
675 | @end example | |
676 | ||
677 | An assignment-with-arithmetic operation such as @samp{+=} applied to a cast | |
678 | performs the arithmetic using the type resulting from the cast, and then | |
679 | continues as in the previous case. Therefore, these two expressions are | |
680 | equivalent: | |
681 | ||
682 | @example | |
683 | (int)a += 5 | |
684 | (int)(a = (char *)(int) ((int)a + 5)) | |
685 | @end example | |
686 | ||
687 | You cannot take the address of an lvalue cast, because the use of its | |
688 | address would not work out coherently. Suppose that @code{&(int)f} were | |
689 | permitted, where @code{f} has type @code{float}. Then the following | |
690 | statement would try to store an integer bit-pattern where a floating | |
691 | point number belongs: | |
692 | ||
693 | @example | |
694 | *&(int)f = 1; | |
695 | @end example | |
696 | ||
697 | This is quite different from what @code{(int)f = 1} would do---that | |
698 | would convert 1 to floating point and store it. Rather than cause this | |
699 | inconsistency, we think it is better to prohibit use of @samp{&} on a cast. | |
700 | ||
701 | If you really do want an @code{int *} pointer with the address of | |
702 | @code{f}, you can simply write @code{(int *)&f}. | |
703 | ||
704 | @node Conditionals | |
705 | @section Conditionals with Omitted Operands | |
706 | @cindex conditional expressions, extensions | |
707 | @cindex omitted middle-operands | |
708 | @cindex middle-operands, omitted | |
709 | @cindex extensions, @code{?:} | |
710 | @cindex @code{?:} extensions | |
711 | ||
712 | The middle operand in a conditional expression may be omitted. Then | |
713 | if the first operand is nonzero, its value is the value of the conditional | |
714 | expression. | |
715 | ||
716 | Therefore, the expression | |
717 | ||
718 | @example | |
719 | x ? : y | |
720 | @end example | |
721 | ||
722 | @noindent | |
723 | has the value of @code{x} if that is nonzero; otherwise, the value of | |
724 | @code{y}. | |
725 | ||
726 | This example is perfectly equivalent to | |
727 | ||
728 | @example | |
729 | x ? x : y | |
730 | @end example | |
731 | ||
732 | @cindex side effect in ?: | |
733 | @cindex ?: side effect | |
734 | @noindent | |
735 | In this simple case, the ability to omit the middle operand is not | |
736 | especially useful. When it becomes useful is when the first operand does, | |
737 | or may (if it is a macro argument), contain a side effect. Then repeating | |
738 | the operand in the middle would perform the side effect twice. Omitting | |
739 | the middle operand uses the value already computed without the undesirable | |
740 | effects of recomputing it. | |
741 | ||
742 | @node Long Long | |
743 | @section Double-Word Integers | |
744 | @cindex @code{long long} data types | |
745 | @cindex double-word arithmetic | |
746 | @cindex multiprecision arithmetic | |
747 | ||
748 | GNU C supports data types for integers that are twice as long as | |
749 | @code{int}. Simply write @code{long long int} for a signed integer, or | |
750 | @code{unsigned long long int} for an unsigned integer. To make an | |
751 | integer constant of type @code{long long int}, add the suffix @code{LL} | |
752 | to the integer. To make an integer constant of type @code{unsigned long | |
753 | long int}, add the suffix @code{ULL} to the integer. | |
754 | ||
755 | You can use these types in arithmetic like any other integer types. | |
756 | Addition, subtraction, and bitwise boolean operations on these types | |
757 | are open-coded on all types of machines. Multiplication is open-coded | |
758 | if the machine supports fullword-to-doubleword a widening multiply | |
759 | instruction. Division and shifts are open-coded only on machines that | |
760 | provide special support. The operations that are not open-coded use | |
761 | special library routines that come with GNU CC. | |
762 | ||
763 | There may be pitfalls when you use @code{long long} types for function | |
764 | arguments, unless you declare function prototypes. If a function | |
765 | expects type @code{int} for its argument, and you pass a value of type | |
766 | @code{long long int}, confusion will result because the caller and the | |
767 | subroutine will disagree about the number of bytes for the argument. | |
768 | Likewise, if the function expects @code{long long int} and you pass | |
769 | @code{int}. The best way to avoid such problems is to use prototypes. | |
770 | ||
771 | @node Complex | |
772 | @section Complex Numbers | |
773 | @cindex complex numbers | |
774 | ||
775 | GNU C supports complex data types. You can declare both complex integer | |
776 | types and complex floating types, using the keyword @code{__complex__}. | |
777 | ||
778 | For example, @samp{__complex__ double x;} declares @code{x} as a | |
779 | variable whose real part and imaginary part are both of type | |
780 | @code{double}. @samp{__complex__ short int y;} declares @code{y} to | |
781 | have real and imaginary parts of type @code{short int}; this is not | |
782 | likely to be useful, but it shows that the set of complex types is | |
783 | complete. | |
784 | ||
785 | To write a constant with a complex data type, use the suffix @samp{i} or | |
786 | @samp{j} (either one; they are equivalent). For example, @code{2.5fi} | |
787 | has type @code{__complex__ float} and @code{3i} has type | |
788 | @code{__complex__ int}. Such a constant always has a pure imaginary | |
789 | value, but you can form any complex value you like by adding one to a | |
790 | real constant. | |
791 | ||
792 | To extract the real part of a complex-valued expression @var{exp}, write | |
793 | @code{__real__ @var{exp}}. Likewise, use @code{__imag__} to | |
794 | extract the imaginary part. | |
795 | ||
796 | The operator @samp{~} performs complex conjugation when used on a value | |
797 | with a complex type. | |
798 | ||
799 | GNU CC can allocate complex automatic variables in a noncontiguous | |
800 | fashion; it's even possible for the real part to be in a register while | |
801 | the imaginary part is on the stack (or vice-versa). None of the | |
802 | supported debugging info formats has a way to represent noncontiguous | |
803 | allocation like this, so GNU CC describes a noncontiguous complex | |
804 | variable as if it were two separate variables of noncomplex type. | |
805 | If the variable's actual name is @code{foo}, the two fictitious | |
806 | variables are named @code{foo$real} and @code{foo$imag}. You can | |
807 | examine and set these two fictitious variables with your debugger. | |
808 | ||
809 | A future version of GDB will know how to recognize such pairs and treat | |
810 | them as a single variable with a complex type. | |
811 | ||
6f4d7222 | 812 | @node Hex Floats |
6b42b9ea UD |
813 | @section Hex Floats |
814 | @cindex hex floats | |
c5c76735 JL |
815 | |
816 | GNU CC recognizes floating-point numbers writen not only in the usual | |
6f4d7222 UD |
817 | decimal notation, such as @code{1.55e1}, but also numbers such as |
818 | @code{0x1.fp3} written in hexadecimal format. In that format the | |
819 | @code{0x} hex introducer and the @code{p} or @code{P} exponent field are | |
820 | mandatory. The exponent is a decimal number that indicates the power of | |
821 | 2 by which the significand part will be multiplied. Thus @code{0x1.f} is | |
822 | 1 15/16, @code{p3} multiplies it by 8, and the value of @code{0x1.fp3} | |
823 | is the same as @code{1.55e1}. | |
824 | ||
825 | Unlike for floating-point numbers in the decimal notation the exponent | |
826 | is always required in the hexadecimal notation. Otherwise the compiler | |
827 | would not be able to resolve the ambiguity of, e.g., @code{0x1.f}. This | |
828 | could mean @code{1.0f} or @code{1.9375} since @code{f} is also the | |
829 | extension for floating-point constants of type @code{float}. | |
830 | ||
c1f7febf RK |
831 | @node Zero Length |
832 | @section Arrays of Length Zero | |
833 | @cindex arrays of length zero | |
834 | @cindex zero-length arrays | |
835 | @cindex length-zero arrays | |
836 | ||
837 | Zero-length arrays are allowed in GNU C. They are very useful as the last | |
838 | element of a structure which is really a header for a variable-length | |
839 | object: | |
840 | ||
841 | @example | |
842 | struct line @{ | |
843 | int length; | |
844 | char contents[0]; | |
845 | @}; | |
846 | ||
847 | @{ | |
848 | struct line *thisline = (struct line *) | |
849 | malloc (sizeof (struct line) + this_length); | |
850 | thisline->length = this_length; | |
851 | @} | |
852 | @end example | |
853 | ||
854 | In standard C, you would have to give @code{contents} a length of 1, which | |
855 | means either you waste space or complicate the argument to @code{malloc}. | |
856 | ||
857 | @node Variable Length | |
858 | @section Arrays of Variable Length | |
859 | @cindex variable-length arrays | |
860 | @cindex arrays of variable length | |
861 | ||
862 | Variable-length automatic arrays are allowed in GNU C. These arrays are | |
863 | declared like any other automatic arrays, but with a length that is not | |
864 | a constant expression. The storage is allocated at the point of | |
865 | declaration and deallocated when the brace-level is exited. For | |
866 | example: | |
867 | ||
868 | @example | |
869 | FILE * | |
870 | concat_fopen (char *s1, char *s2, char *mode) | |
871 | @{ | |
872 | char str[strlen (s1) + strlen (s2) + 1]; | |
873 | strcpy (str, s1); | |
874 | strcat (str, s2); | |
875 | return fopen (str, mode); | |
876 | @} | |
877 | @end example | |
878 | ||
879 | @cindex scope of a variable length array | |
880 | @cindex variable-length array scope | |
881 | @cindex deallocating variable length arrays | |
882 | Jumping or breaking out of the scope of the array name deallocates the | |
883 | storage. Jumping into the scope is not allowed; you get an error | |
884 | message for it. | |
885 | ||
886 | @cindex @code{alloca} vs variable-length arrays | |
887 | You can use the function @code{alloca} to get an effect much like | |
888 | variable-length arrays. The function @code{alloca} is available in | |
889 | many other C implementations (but not in all). On the other hand, | |
890 | variable-length arrays are more elegant. | |
891 | ||
892 | There are other differences between these two methods. Space allocated | |
893 | with @code{alloca} exists until the containing @emph{function} returns. | |
894 | The space for a variable-length array is deallocated as soon as the array | |
895 | name's scope ends. (If you use both variable-length arrays and | |
896 | @code{alloca} in the same function, deallocation of a variable-length array | |
897 | will also deallocate anything more recently allocated with @code{alloca}.) | |
898 | ||
899 | You can also use variable-length arrays as arguments to functions: | |
900 | ||
901 | @example | |
902 | struct entry | |
903 | tester (int len, char data[len][len]) | |
904 | @{ | |
905 | @dots{} | |
906 | @} | |
907 | @end example | |
908 | ||
909 | The length of an array is computed once when the storage is allocated | |
910 | and is remembered for the scope of the array in case you access it with | |
911 | @code{sizeof}. | |
912 | ||
913 | If you want to pass the array first and the length afterward, you can | |
914 | use a forward declaration in the parameter list---another GNU extension. | |
915 | ||
916 | @example | |
917 | struct entry | |
918 | tester (int len; char data[len][len], int len) | |
919 | @{ | |
920 | @dots{} | |
921 | @} | |
922 | @end example | |
923 | ||
924 | @cindex parameter forward declaration | |
925 | The @samp{int len} before the semicolon is a @dfn{parameter forward | |
926 | declaration}, and it serves the purpose of making the name @code{len} | |
927 | known when the declaration of @code{data} is parsed. | |
928 | ||
929 | You can write any number of such parameter forward declarations in the | |
930 | parameter list. They can be separated by commas or semicolons, but the | |
931 | last one must end with a semicolon, which is followed by the ``real'' | |
932 | parameter declarations. Each forward declaration must match a ``real'' | |
933 | declaration in parameter name and data type. | |
934 | ||
935 | @node Macro Varargs | |
936 | @section Macros with Variable Numbers of Arguments | |
937 | @cindex variable number of arguments | |
938 | @cindex macro with variable arguments | |
939 | @cindex rest argument (in macro) | |
940 | ||
941 | In GNU C, a macro can accept a variable number of arguments, much as a | |
942 | function can. The syntax for defining the macro looks much like that | |
943 | used for a function. Here is an example: | |
944 | ||
945 | @example | |
946 | #define eprintf(format, args...) \ | |
947 | fprintf (stderr, format , ## args) | |
948 | @end example | |
949 | ||
950 | Here @code{args} is a @dfn{rest argument}: it takes in zero or more | |
951 | arguments, as many as the call contains. All of them plus the commas | |
952 | between them form the value of @code{args}, which is substituted into | |
953 | the macro body where @code{args} is used. Thus, we have this expansion: | |
954 | ||
955 | @example | |
956 | eprintf ("%s:%d: ", input_file_name, line_number) | |
957 | @expansion{} | |
958 | fprintf (stderr, "%s:%d: " , input_file_name, line_number) | |
959 | @end example | |
960 | ||
961 | @noindent | |
962 | Note that the comma after the string constant comes from the definition | |
963 | of @code{eprintf}, whereas the last comma comes from the value of | |
964 | @code{args}. | |
965 | ||
966 | The reason for using @samp{##} is to handle the case when @code{args} | |
967 | matches no arguments at all. In this case, @code{args} has an empty | |
968 | value. In this case, the second comma in the definition becomes an | |
969 | embarrassment: if it got through to the expansion of the macro, we would | |
970 | get something like this: | |
971 | ||
972 | @example | |
973 | fprintf (stderr, "success!\n" , ) | |
974 | @end example | |
975 | ||
976 | @noindent | |
977 | which is invalid C syntax. @samp{##} gets rid of the comma, so we get | |
978 | the following instead: | |
979 | ||
980 | @example | |
981 | fprintf (stderr, "success!\n") | |
982 | @end example | |
983 | ||
984 | This is a special feature of the GNU C preprocessor: @samp{##} before a | |
985 | rest argument that is empty discards the preceding sequence of | |
986 | non-whitespace characters from the macro definition. (If another macro | |
987 | argument precedes, none of it is discarded.) | |
988 | ||
989 | It might be better to discard the last preprocessor token instead of the | |
990 | last preceding sequence of non-whitespace characters; in fact, we may | |
991 | someday change this feature to do so. We advise you to write the macro | |
992 | definition so that the preceding sequence of non-whitespace characters | |
993 | is just a single token, so that the meaning will not change if we change | |
994 | the definition of this feature. | |
995 | ||
996 | @node Subscripting | |
997 | @section Non-Lvalue Arrays May Have Subscripts | |
998 | @cindex subscripting | |
999 | @cindex arrays, non-lvalue | |
1000 | ||
1001 | @cindex subscripting and function values | |
1002 | Subscripting is allowed on arrays that are not lvalues, even though the | |
1003 | unary @samp{&} operator is not. For example, this is valid in GNU C though | |
1004 | not valid in other C dialects: | |
1005 | ||
1006 | @example | |
1007 | @group | |
1008 | struct foo @{int a[4];@}; | |
1009 | ||
1010 | struct foo f(); | |
1011 | ||
1012 | bar (int index) | |
1013 | @{ | |
1014 | return f().a[index]; | |
1015 | @} | |
1016 | @end group | |
1017 | @end example | |
1018 | ||
1019 | @node Pointer Arith | |
1020 | @section Arithmetic on @code{void}- and Function-Pointers | |
1021 | @cindex void pointers, arithmetic | |
1022 | @cindex void, size of pointer to | |
1023 | @cindex function pointers, arithmetic | |
1024 | @cindex function, size of pointer to | |
1025 | ||
1026 | In GNU C, addition and subtraction operations are supported on pointers to | |
1027 | @code{void} and on pointers to functions. This is done by treating the | |
1028 | size of a @code{void} or of a function as 1. | |
1029 | ||
1030 | A consequence of this is that @code{sizeof} is also allowed on @code{void} | |
1031 | and on function types, and returns 1. | |
1032 | ||
1033 | The option @samp{-Wpointer-arith} requests a warning if these extensions | |
1034 | are used. | |
1035 | ||
1036 | @node Initializers | |
1037 | @section Non-Constant Initializers | |
1038 | @cindex initializers, non-constant | |
1039 | @cindex non-constant initializers | |
1040 | ||
1041 | As in standard C++, the elements of an aggregate initializer for an | |
1042 | automatic variable are not required to be constant expressions in GNU C. | |
1043 | Here is an example of an initializer with run-time varying elements: | |
1044 | ||
1045 | @example | |
1046 | foo (float f, float g) | |
1047 | @{ | |
1048 | float beat_freqs[2] = @{ f-g, f+g @}; | |
1049 | @dots{} | |
1050 | @} | |
1051 | @end example | |
1052 | ||
1053 | @node Constructors | |
1054 | @section Constructor Expressions | |
1055 | @cindex constructor expressions | |
1056 | @cindex initializations in expressions | |
1057 | @cindex structures, constructor expression | |
1058 | @cindex expressions, constructor | |
1059 | ||
1060 | GNU C supports constructor expressions. A constructor looks like | |
1061 | a cast containing an initializer. Its value is an object of the | |
1062 | type specified in the cast, containing the elements specified in | |
1063 | the initializer. | |
1064 | ||
1065 | Usually, the specified type is a structure. Assume that | |
1066 | @code{struct foo} and @code{structure} are declared as shown: | |
1067 | ||
1068 | @example | |
1069 | struct foo @{int a; char b[2];@} structure; | |
1070 | @end example | |
1071 | ||
1072 | @noindent | |
1073 | Here is an example of constructing a @code{struct foo} with a constructor: | |
1074 | ||
1075 | @example | |
1076 | structure = ((struct foo) @{x + y, 'a', 0@}); | |
1077 | @end example | |
1078 | ||
1079 | @noindent | |
1080 | This is equivalent to writing the following: | |
1081 | ||
1082 | @example | |
1083 | @{ | |
1084 | struct foo temp = @{x + y, 'a', 0@}; | |
1085 | structure = temp; | |
1086 | @} | |
1087 | @end example | |
1088 | ||
1089 | You can also construct an array. If all the elements of the constructor | |
1090 | are (made up of) simple constant expressions, suitable for use in | |
1091 | initializers, then the constructor is an lvalue and can be coerced to a | |
1092 | pointer to its first element, as shown here: | |
1093 | ||
1094 | @example | |
1095 | char **foo = (char *[]) @{ "x", "y", "z" @}; | |
1096 | @end example | |
1097 | ||
1098 | Array constructors whose elements are not simple constants are | |
1099 | not very useful, because the constructor is not an lvalue. There | |
1100 | are only two valid ways to use it: to subscript it, or initialize | |
1101 | an array variable with it. The former is probably slower than a | |
1102 | @code{switch} statement, while the latter does the same thing an | |
1103 | ordinary C initializer would do. Here is an example of | |
1104 | subscripting an array constructor: | |
1105 | ||
1106 | @example | |
1107 | output = ((int[]) @{ 2, x, 28 @}) [input]; | |
1108 | @end example | |
1109 | ||
1110 | Constructor expressions for scalar types and union types are is | |
1111 | also allowed, but then the constructor expression is equivalent | |
1112 | to a cast. | |
1113 | ||
1114 | @node Labeled Elements | |
1115 | @section Labeled Elements in Initializers | |
1116 | @cindex initializers with labeled elements | |
1117 | @cindex labeled elements in initializers | |
1118 | @cindex case labels in initializers | |
1119 | ||
1120 | Standard C requires the elements of an initializer to appear in a fixed | |
1121 | order, the same as the order of the elements in the array or structure | |
1122 | being initialized. | |
1123 | ||
1124 | In GNU C you can give the elements in any order, specifying the array | |
1125 | indices or structure field names they apply to. This extension is not | |
1126 | implemented in GNU C++. | |
1127 | ||
1128 | To specify an array index, write @samp{[@var{index}]} or | |
1129 | @samp{[@var{index}] =} before the element value. For example, | |
1130 | ||
1131 | @example | |
1132 | int a[6] = @{ [4] 29, [2] = 15 @}; | |
1133 | @end example | |
1134 | ||
1135 | @noindent | |
1136 | is equivalent to | |
1137 | ||
1138 | @example | |
1139 | int a[6] = @{ 0, 0, 15, 0, 29, 0 @}; | |
1140 | @end example | |
1141 | ||
1142 | @noindent | |
1143 | The index values must be constant expressions, even if the array being | |
1144 | initialized is automatic. | |
1145 | ||
1146 | To initialize a range of elements to the same value, write | |
1147 | @samp{[@var{first} ... @var{last}] = @var{value}}. For example, | |
1148 | ||
1149 | @example | |
1150 | int widths[] = @{ [0 ... 9] = 1, [10 ... 99] = 2, [100] = 3 @}; | |
1151 | @end example | |
1152 | ||
1153 | @noindent | |
1154 | Note that the length of the array is the highest value specified | |
1155 | plus one. | |
1156 | ||
1157 | In a structure initializer, specify the name of a field to initialize | |
1158 | with @samp{@var{fieldname}:} before the element value. For example, | |
1159 | given the following structure, | |
1160 | ||
1161 | @example | |
1162 | struct point @{ int x, y; @}; | |
1163 | @end example | |
1164 | ||
1165 | @noindent | |
1166 | the following initialization | |
1167 | ||
1168 | @example | |
1169 | struct point p = @{ y: yvalue, x: xvalue @}; | |
1170 | @end example | |
1171 | ||
1172 | @noindent | |
1173 | is equivalent to | |
1174 | ||
1175 | @example | |
1176 | struct point p = @{ xvalue, yvalue @}; | |
1177 | @end example | |
1178 | ||
1179 | Another syntax which has the same meaning is @samp{.@var{fieldname} =}., | |
1180 | as shown here: | |
1181 | ||
1182 | @example | |
1183 | struct point p = @{ .y = yvalue, .x = xvalue @}; | |
1184 | @end example | |
1185 | ||
1186 | You can also use an element label (with either the colon syntax or the | |
1187 | period-equal syntax) when initializing a union, to specify which element | |
1188 | of the union should be used. For example, | |
1189 | ||
1190 | @example | |
1191 | union foo @{ int i; double d; @}; | |
1192 | ||
1193 | union foo f = @{ d: 4 @}; | |
1194 | @end example | |
1195 | ||
1196 | @noindent | |
1197 | will convert 4 to a @code{double} to store it in the union using | |
1198 | the second element. By contrast, casting 4 to type @code{union foo} | |
1199 | would store it into the union as the integer @code{i}, since it is | |
1200 | an integer. (@xref{Cast to Union}.) | |
1201 | ||
1202 | You can combine this technique of naming elements with ordinary C | |
1203 | initialization of successive elements. Each initializer element that | |
1204 | does not have a label applies to the next consecutive element of the | |
1205 | array or structure. For example, | |
1206 | ||
1207 | @example | |
1208 | int a[6] = @{ [1] = v1, v2, [4] = v4 @}; | |
1209 | @end example | |
1210 | ||
1211 | @noindent | |
1212 | is equivalent to | |
1213 | ||
1214 | @example | |
1215 | int a[6] = @{ 0, v1, v2, 0, v4, 0 @}; | |
1216 | @end example | |
1217 | ||
1218 | Labeling the elements of an array initializer is especially useful | |
1219 | when the indices are characters or belong to an @code{enum} type. | |
1220 | For example: | |
1221 | ||
1222 | @example | |
1223 | int whitespace[256] | |
1224 | = @{ [' '] = 1, ['\t'] = 1, ['\h'] = 1, | |
1225 | ['\f'] = 1, ['\n'] = 1, ['\r'] = 1 @}; | |
1226 | @end example | |
1227 | ||
1228 | @node Case Ranges | |
1229 | @section Case Ranges | |
1230 | @cindex case ranges | |
1231 | @cindex ranges in case statements | |
1232 | ||
1233 | You can specify a range of consecutive values in a single @code{case} label, | |
1234 | like this: | |
1235 | ||
1236 | @example | |
1237 | case @var{low} ... @var{high}: | |
1238 | @end example | |
1239 | ||
1240 | @noindent | |
1241 | This has the same effect as the proper number of individual @code{case} | |
1242 | labels, one for each integer value from @var{low} to @var{high}, inclusive. | |
1243 | ||
1244 | This feature is especially useful for ranges of ASCII character codes: | |
1245 | ||
1246 | @example | |
1247 | case 'A' ... 'Z': | |
1248 | @end example | |
1249 | ||
1250 | @strong{Be careful:} Write spaces around the @code{...}, for otherwise | |
1251 | it may be parsed wrong when you use it with integer values. For example, | |
1252 | write this: | |
1253 | ||
1254 | @example | |
1255 | case 1 ... 5: | |
1256 | @end example | |
1257 | ||
1258 | @noindent | |
1259 | rather than this: | |
1260 | ||
1261 | @example | |
1262 | case 1...5: | |
1263 | @end example | |
1264 | ||
1265 | @node Cast to Union | |
1266 | @section Cast to a Union Type | |
1267 | @cindex cast to a union | |
1268 | @cindex union, casting to a | |
1269 | ||
1270 | A cast to union type is similar to other casts, except that the type | |
1271 | specified is a union type. You can specify the type either with | |
1272 | @code{union @var{tag}} or with a typedef name. A cast to union is actually | |
1273 | a constructor though, not a cast, and hence does not yield an lvalue like | |
1274 | normal casts. (@xref{Constructors}.) | |
1275 | ||
1276 | The types that may be cast to the union type are those of the members | |
1277 | of the union. Thus, given the following union and variables: | |
1278 | ||
1279 | @example | |
1280 | union foo @{ int i; double d; @}; | |
1281 | int x; | |
1282 | double y; | |
1283 | @end example | |
1284 | ||
1285 | @noindent | |
1286 | both @code{x} and @code{y} can be cast to type @code{union} foo. | |
1287 | ||
1288 | Using the cast as the right-hand side of an assignment to a variable of | |
1289 | union type is equivalent to storing in a member of the union: | |
1290 | ||
1291 | @example | |
1292 | union foo u; | |
1293 | @dots{} | |
1294 | u = (union foo) x @equiv{} u.i = x | |
1295 | u = (union foo) y @equiv{} u.d = y | |
1296 | @end example | |
1297 | ||
1298 | You can also use the union cast as a function argument: | |
1299 | ||
1300 | @example | |
1301 | void hack (union foo); | |
1302 | @dots{} | |
1303 | hack ((union foo) x); | |
1304 | @end example | |
1305 | ||
1306 | @node Function Attributes | |
1307 | @section Declaring Attributes of Functions | |
1308 | @cindex function attributes | |
1309 | @cindex declaring attributes of functions | |
1310 | @cindex functions that never return | |
1311 | @cindex functions that have no side effects | |
1312 | @cindex functions in arbitrary sections | |
1313 | @cindex @code{volatile} applied to function | |
1314 | @cindex @code{const} applied to function | |
bb72a084 | 1315 | @cindex functions with @code{printf}, @code{scanf} or @code{strftime} style arguments |
c1f7febf RK |
1316 | @cindex functions that are passed arguments in registers on the 386 |
1317 | @cindex functions that pop the argument stack on the 386 | |
1318 | @cindex functions that do not pop the argument stack on the 386 | |
1319 | ||
1320 | In GNU C, you declare certain things about functions called in your program | |
1321 | which help the compiler optimize function calls and check your code more | |
1322 | carefully. | |
1323 | ||
1324 | The keyword @code{__attribute__} allows you to specify special | |
1325 | attributes when making a declaration. This keyword is followed by an | |
07417085 KR |
1326 | attribute specification inside double parentheses. Nine attributes, |
1327 | @code{noreturn}, @code{const}, @code{format}, | |
1328 | @code{no_instrument_function}, @code{section}, | |
c1f7febf RK |
1329 | @code{constructor}, @code{destructor}, @code{unused} and @code{weak} are |
1330 | currently defined for functions. Other attributes, including | |
1331 | @code{section} are supported for variables declarations (@pxref{Variable | |
1332 | Attributes}) and for types (@pxref{Type Attributes}). | |
1333 | ||
1334 | You may also specify attributes with @samp{__} preceding and following | |
1335 | each keyword. This allows you to use them in header files without | |
1336 | being concerned about a possible macro of the same name. For example, | |
1337 | you may use @code{__noreturn__} instead of @code{noreturn}. | |
1338 | ||
1339 | @table @code | |
1340 | @cindex @code{noreturn} function attribute | |
1341 | @item noreturn | |
1342 | A few standard library functions, such as @code{abort} and @code{exit}, | |
1343 | cannot return. GNU CC knows this automatically. Some programs define | |
1344 | their own functions that never return. You can declare them | |
1345 | @code{noreturn} to tell the compiler this fact. For example, | |
1346 | ||
1347 | @smallexample | |
1348 | void fatal () __attribute__ ((noreturn)); | |
1349 | ||
1350 | void | |
1351 | fatal (@dots{}) | |
1352 | @{ | |
1353 | @dots{} /* @r{Print error message.} */ @dots{} | |
1354 | exit (1); | |
1355 | @} | |
1356 | @end smallexample | |
1357 | ||
1358 | The @code{noreturn} keyword tells the compiler to assume that | |
1359 | @code{fatal} cannot return. It can then optimize without regard to what | |
1360 | would happen if @code{fatal} ever did return. This makes slightly | |
1361 | better code. More importantly, it helps avoid spurious warnings of | |
1362 | uninitialized variables. | |
1363 | ||
1364 | Do not assume that registers saved by the calling function are | |
1365 | restored before calling the @code{noreturn} function. | |
1366 | ||
1367 | It does not make sense for a @code{noreturn} function to have a return | |
1368 | type other than @code{void}. | |
1369 | ||
1370 | The attribute @code{noreturn} is not implemented in GNU C versions | |
1371 | earlier than 2.5. An alternative way to declare that a function does | |
1372 | not return, which works in the current version and in some older | |
1373 | versions, is as follows: | |
1374 | ||
1375 | @smallexample | |
1376 | typedef void voidfn (); | |
1377 | ||
1378 | volatile voidfn fatal; | |
1379 | @end smallexample | |
1380 | ||
1381 | @cindex @code{const} function attribute | |
1382 | @item const | |
1383 | Many functions do not examine any values except their arguments, and | |
1384 | have no effects except the return value. Such a function can be subject | |
1385 | to common subexpression elimination and loop optimization just as an | |
1386 | arithmetic operator would be. These functions should be declared | |
1387 | with the attribute @code{const}. For example, | |
1388 | ||
1389 | @smallexample | |
1390 | int square (int) __attribute__ ((const)); | |
1391 | @end smallexample | |
1392 | ||
1393 | @noindent | |
1394 | says that the hypothetical function @code{square} is safe to call | |
1395 | fewer times than the program says. | |
1396 | ||
1397 | The attribute @code{const} is not implemented in GNU C versions earlier | |
1398 | than 2.5. An alternative way to declare that a function has no side | |
1399 | effects, which works in the current version and in some older versions, | |
1400 | is as follows: | |
1401 | ||
1402 | @smallexample | |
1403 | typedef int intfn (); | |
1404 | ||
1405 | extern const intfn square; | |
1406 | @end smallexample | |
1407 | ||
1408 | This approach does not work in GNU C++ from 2.6.0 on, since the language | |
1409 | specifies that the @samp{const} must be attached to the return value. | |
1410 | ||
1411 | @cindex pointer arguments | |
1412 | Note that a function that has pointer arguments and examines the data | |
1413 | pointed to must @emph{not} be declared @code{const}. Likewise, a | |
1414 | function that calls a non-@code{const} function usually must not be | |
1415 | @code{const}. It does not make sense for a @code{const} function to | |
1416 | return @code{void}. | |
1417 | ||
1418 | @item format (@var{archetype}, @var{string-index}, @var{first-to-check}) | |
1419 | @cindex @code{format} function attribute | |
bb72a084 PE |
1420 | The @code{format} attribute specifies that a function takes @code{printf}, |
1421 | @code{scanf}, or @code{strftime} style arguments which should be type-checked | |
1422 | against a format string. For example, the declaration: | |
c1f7febf RK |
1423 | |
1424 | @smallexample | |
1425 | extern int | |
1426 | my_printf (void *my_object, const char *my_format, ...) | |
1427 | __attribute__ ((format (printf, 2, 3))); | |
1428 | @end smallexample | |
1429 | ||
1430 | @noindent | |
1431 | causes the compiler to check the arguments in calls to @code{my_printf} | |
1432 | for consistency with the @code{printf} style format string argument | |
1433 | @code{my_format}. | |
1434 | ||
1435 | The parameter @var{archetype} determines how the format string is | |
bb72a084 PE |
1436 | interpreted, and should be either @code{printf}, @code{scanf}, or |
1437 | @code{strftime}. The | |
c1f7febf RK |
1438 | parameter @var{string-index} specifies which argument is the format |
1439 | string argument (starting from 1), while @var{first-to-check} is the | |
1440 | number of the first argument to check against the format string. For | |
1441 | functions where the arguments are not available to be checked (such as | |
1442 | @code{vprintf}), specify the third parameter as zero. In this case the | |
1443 | compiler only checks the format string for consistency. | |
1444 | ||
1445 | In the example above, the format string (@code{my_format}) is the second | |
1446 | argument of the function @code{my_print}, and the arguments to check | |
1447 | start with the third argument, so the correct parameters for the format | |
1448 | attribute are 2 and 3. | |
1449 | ||
1450 | The @code{format} attribute allows you to identify your own functions | |
1451 | which take format strings as arguments, so that GNU CC can check the | |
1452 | calls to these functions for errors. The compiler always checks formats | |
1453 | for the ANSI library functions @code{printf}, @code{fprintf}, | |
bb72a084 | 1454 | @code{sprintf}, @code{scanf}, @code{fscanf}, @code{sscanf}, @code{strftime}, |
c1f7febf RK |
1455 | @code{vprintf}, @code{vfprintf} and @code{vsprintf} whenever such |
1456 | warnings are requested (using @samp{-Wformat}), so there is no need to | |
1457 | modify the header file @file{stdio.h}. | |
1458 | ||
1459 | @item format_arg (@var{string-index}) | |
1460 | @cindex @code{format_arg} function attribute | |
1461 | The @code{format_arg} attribute specifies that a function takes | |
1462 | @code{printf} or @code{scanf} style arguments, modifies it (for example, | |
1463 | to translate it into another language), and passes it to a @code{printf} | |
1464 | or @code{scanf} style function. For example, the declaration: | |
1465 | ||
1466 | @smallexample | |
1467 | extern char * | |
1468 | my_dgettext (char *my_domain, const char *my_format) | |
1469 | __attribute__ ((format_arg (2))); | |
1470 | @end smallexample | |
1471 | ||
1472 | @noindent | |
1473 | causes the compiler to check the arguments in calls to | |
bb72a084 PE |
1474 | @code{my_dgettext} whose result is passed to a @code{printf}, |
1475 | @code{scanf}, or @code{strftime} type function for consistency with the | |
1476 | @code{printf} style format string argument @code{my_format}. | |
c1f7febf RK |
1477 | |
1478 | The parameter @var{string-index} specifies which argument is the format | |
1479 | string argument (starting from 1). | |
1480 | ||
1481 | The @code{format-arg} attribute allows you to identify your own | |
1482 | functions which modify format strings, so that GNU CC can check the | |
bb72a084 PE |
1483 | calls to @code{printf}, @code{scanf}, or @code{strftime} function whose |
1484 | operands are a call to one of your own function. The compiler always | |
1485 | treats @code{gettext}, @code{dgettext}, and @code{dcgettext} in this | |
1486 | manner. | |
c1f7febf | 1487 | |
07417085 KR |
1488 | @item no_instrument_function |
1489 | @cindex @code{no_instrument_function} function attribute | |
1490 | If @samp{-finstrument-functions} is given, profiling function calls will | |
1491 | be generated at entry and exit of most user-compiled functions. | |
1492 | Functions with this attribute will not be so instrumented. | |
1493 | ||
c1f7febf RK |
1494 | @item section ("section-name") |
1495 | @cindex @code{section} function attribute | |
1496 | Normally, the compiler places the code it generates in the @code{text} section. | |
1497 | Sometimes, however, you need additional sections, or you need certain | |
1498 | particular functions to appear in special sections. The @code{section} | |
1499 | attribute specifies that a function lives in a particular section. | |
1500 | For example, the declaration: | |
1501 | ||
1502 | @smallexample | |
1503 | extern void foobar (void) __attribute__ ((section ("bar"))); | |
1504 | @end smallexample | |
1505 | ||
1506 | @noindent | |
1507 | puts the function @code{foobar} in the @code{bar} section. | |
1508 | ||
1509 | Some file formats do not support arbitrary sections so the @code{section} | |
1510 | attribute is not available on all platforms. | |
1511 | If you need to map the entire contents of a module to a particular | |
1512 | section, consider using the facilities of the linker instead. | |
1513 | ||
1514 | @item constructor | |
1515 | @itemx destructor | |
1516 | @cindex @code{constructor} function attribute | |
1517 | @cindex @code{destructor} function attribute | |
1518 | The @code{constructor} attribute causes the function to be called | |
1519 | automatically before execution enters @code{main ()}. Similarly, the | |
1520 | @code{destructor} attribute causes the function to be called | |
1521 | automatically after @code{main ()} has completed or @code{exit ()} has | |
1522 | been called. Functions with these attributes are useful for | |
1523 | initializing data that will be used implicitly during the execution of | |
1524 | the program. | |
1525 | ||
1526 | These attributes are not currently implemented for Objective C. | |
1527 | ||
1528 | @item unused | |
1529 | This attribute, attached to a function, means that the function is meant | |
1530 | to be possibly unused. GNU CC will not produce a warning for this | |
1531 | function. GNU C++ does not currently support this attribute as | |
1532 | definitions without parameters are valid in C++. | |
1533 | ||
1534 | @item weak | |
1535 | @cindex @code{weak} attribute | |
1536 | The @code{weak} attribute causes the declaration to be emitted as a weak | |
1537 | symbol rather than a global. This is primarily useful in defining | |
1538 | library functions which can be overridden in user code, though it can | |
1539 | also be used with non-function declarations. Weak symbols are supported | |
1540 | for ELF targets, and also for a.out targets when using the GNU assembler | |
1541 | and linker. | |
1542 | ||
1543 | @item alias ("target") | |
1544 | @cindex @code{alias} attribute | |
1545 | The @code{alias} attribute causes the declaration to be emitted as an | |
1546 | alias for another symbol, which must be specified. For instance, | |
1547 | ||
1548 | @smallexample | |
1549 | void __f () @{ /* do something */; @} | |
1550 | void f () __attribute__ ((weak, alias ("__f"))); | |
1551 | @end smallexample | |
1552 | ||
1553 | declares @samp{f} to be a weak alias for @samp{__f}. In C++, the | |
1554 | mangled name for the target must be used. | |
1555 | ||
af3e86c2 RK |
1556 | Not all target machines support this attribute. |
1557 | ||
7d384cc0 KR |
1558 | @item no_check_memory_usage |
1559 | @cindex @code{no_check_memory_usage} function attribute | |
c5c76735 JL |
1560 | The @code{no_check_memory_usage} attribute causes GNU CC to omit checks |
1561 | of memory references when it generates code for that function. Normally | |
1562 | if you specify @samp{-fcheck-memory-usage} (see @pxref{Code Gen | |
1563 | Options}), GNU CC generates calls to support routines before most memory | |
1564 | accesses to permit support code to record usage and detect uses of | |
1565 | uninitialized or unallocated storage. Since GNU CC cannot handle | |
1566 | @code{asm} statements properly they are not allowed in such functions. | |
1567 | If you declare a function with this attribute, GNU CC will not generate | |
7d384cc0 | 1568 | memory checking code for that function, permitting the use of @code{asm} |
c5c76735 JL |
1569 | statements without having to compile that function with different |
1570 | options. This also allows you to write support routines of your own if | |
1571 | you wish, without getting infinite recursion if they get compiled with | |
1572 | @code{-fcheck-memory-usage}. | |
7d384cc0 | 1573 | |
c1f7febf RK |
1574 | @item regparm (@var{number}) |
1575 | @cindex functions that are passed arguments in registers on the 386 | |
1576 | On the Intel 386, the @code{regparm} attribute causes the compiler to | |
1577 | pass up to @var{number} integer arguments in registers @var{EAX}, | |
1578 | @var{EDX}, and @var{ECX} instead of on the stack. Functions that take a | |
1579 | variable number of arguments will continue to be passed all of their | |
1580 | arguments on the stack. | |
1581 | ||
1582 | @item stdcall | |
1583 | @cindex functions that pop the argument stack on the 386 | |
1584 | On the Intel 386, the @code{stdcall} attribute causes the compiler to | |
1585 | assume that the called function will pop off the stack space used to | |
1586 | pass arguments, unless it takes a variable number of arguments. | |
1587 | ||
1588 | The PowerPC compiler for Windows NT currently ignores the @code{stdcall} | |
1589 | attribute. | |
1590 | ||
1591 | @item cdecl | |
1592 | @cindex functions that do pop the argument stack on the 386 | |
1593 | On the Intel 386, the @code{cdecl} attribute causes the compiler to | |
1594 | assume that the calling function will pop off the stack space used to | |
1595 | pass arguments. This is | |
1596 | useful to override the effects of the @samp{-mrtd} switch. | |
1597 | ||
1598 | The PowerPC compiler for Windows NT currently ignores the @code{cdecl} | |
1599 | attribute. | |
1600 | ||
1601 | @item longcall | |
1602 | @cindex functions called via pointer on the RS/6000 and PowerPC | |
1603 | On the RS/6000 and PowerPC, the @code{longcall} attribute causes the | |
1604 | compiler to always call the function via a pointer, so that functions | |
1605 | which reside further than 64 megabytes (67,108,864 bytes) from the | |
1606 | current location can be called. | |
1607 | ||
1608 | @item dllimport | |
1609 | @cindex functions which are imported from a dll on PowerPC Windows NT | |
1610 | On the PowerPC running Windows NT, the @code{dllimport} attribute causes | |
1611 | the compiler to call the function via a global pointer to the function | |
1612 | pointer that is set up by the Windows NT dll library. The pointer name | |
1613 | is formed by combining @code{__imp_} and the function name. | |
1614 | ||
1615 | @item dllexport | |
1616 | @cindex functions which are exported from a dll on PowerPC Windows NT | |
1617 | On the PowerPC running Windows NT, the @code{dllexport} attribute causes | |
1618 | the compiler to provide a global pointer to the function pointer, so | |
1619 | that it can be called with the @code{dllimport} attribute. The pointer | |
1620 | name is formed by combining @code{__imp_} and the function name. | |
1621 | ||
1622 | @item exception (@var{except-func} [, @var{except-arg}]) | |
1623 | @cindex functions which specify exception handling on PowerPC Windows NT | |
1624 | On the PowerPC running Windows NT, the @code{exception} attribute causes | |
1625 | the compiler to modify the structured exception table entry it emits for | |
1626 | the declared function. The string or identifier @var{except-func} is | |
1627 | placed in the third entry of the structured exception table. It | |
1628 | represents a function, which is called by the exception handling | |
1629 | mechanism if an exception occurs. If it was specified, the string or | |
1630 | identifier @var{except-arg} is placed in the fourth entry of the | |
1631 | structured exception table. | |
1632 | ||
1633 | @item function_vector | |
1634 | @cindex calling functions through the function vector on the H8/300 processors | |
1635 | Use this option on the H8/300 and H8/300H to indicate that the specified | |
1636 | function should be called through the function vector. Calling a | |
1637 | function through the function vector will reduce code size, however; | |
1638 | the function vector has a limited size (maximum 128 entries on the H8/300 | |
1639 | and 64 entries on the H8/300H) and shares space with the interrupt vector. | |
1640 | ||
1641 | You must use GAS and GLD from GNU binutils version 2.7 or later for | |
1642 | this option to work correctly. | |
1643 | ||
1644 | @item interrupt_handler | |
1645 | @cindex interrupt handler functions on the H8/300 processors | |
1646 | Use this option on the H8/300 and H8/300H to indicate that the specified | |
1647 | function is an interrupt handler. The compiler will generate function | |
1648 | entry and exit sequences suitable for use in an interrupt handler when this | |
1649 | attribute is present. | |
1650 | ||
1651 | @item eightbit_data | |
1652 | @cindex eight bit data on the H8/300 and H8/300H | |
1653 | Use this option on the H8/300 and H8/300H to indicate that the specified | |
1654 | variable should be placed into the eight bit data section. | |
1655 | The compiler will generate more efficient code for certain operations | |
1656 | on data in the eight bit data area. Note the eight bit data area is limited to | |
1657 | 256 bytes of data. | |
1658 | ||
1659 | You must use GAS and GLD from GNU binutils version 2.7 or later for | |
1660 | this option to work correctly. | |
1661 | ||
1662 | @item tiny_data | |
1663 | @cindex tiny data section on the H8/300H | |
1664 | Use this option on the H8/300H to indicate that the specified | |
1665 | variable should be placed into the tiny data section. | |
1666 | The compiler will generate more efficient code for loads and stores | |
1667 | on data in the tiny data section. Note the tiny data area is limited to | |
1668 | slightly under 32kbytes of data. | |
845da534 DE |
1669 | |
1670 | @item interrupt | |
1671 | @cindex interrupt handlers on the M32R/D | |
1672 | Use this option on the M32R/D to indicate that the specified | |
1673 | function is an interrupt handler. The compiler will generate function | |
1674 | entry and exit sequences suitable for use in an interrupt handler when this | |
1675 | attribute is present. | |
1676 | ||
1677 | @item model (@var{model-name}) | |
1678 | @cindex function addressability on the M32R/D | |
1679 | Use this attribute on the M32R/D to set the addressability of an object, | |
1680 | and the code generated for a function. | |
1681 | The identifier @var{model-name} is one of @code{small}, @code{medium}, | |
1682 | or @code{large}, representing each of the code models. | |
1683 | ||
1684 | Small model objects live in the lower 16MB of memory (so that their | |
1685 | addresses can be loaded with the @code{ld24} instruction), and are | |
1686 | callable with the @code{bl} instruction. | |
1687 | ||
1688 | Medium model objects may live anywhere in the 32 bit address space (the | |
1689 | compiler will generate @code{seth/add3} instructions to load their addresses), | |
1690 | and are callable with the @code{bl} instruction. | |
1691 | ||
1692 | Large model objects may live anywhere in the 32 bit address space (the | |
1693 | compiler will generate @code{seth/add3} instructions to load their addresses), | |
1694 | and may not be reachable with the @code{bl} instruction (the compiler will | |
1695 | generate the much slower @code{seth/add3/jl} instruction sequence). | |
1696 | ||
c1f7febf RK |
1697 | @end table |
1698 | ||
1699 | You can specify multiple attributes in a declaration by separating them | |
1700 | by commas within the double parentheses or by immediately following an | |
1701 | attribute declaration with another attribute declaration. | |
1702 | ||
1703 | @cindex @code{#pragma}, reason for not using | |
1704 | @cindex pragma, reason for not using | |
1705 | Some people object to the @code{__attribute__} feature, suggesting that ANSI C's | |
1706 | @code{#pragma} should be used instead. There are two reasons for not | |
1707 | doing this. | |
1708 | ||
1709 | @enumerate | |
1710 | @item | |
1711 | It is impossible to generate @code{#pragma} commands from a macro. | |
1712 | ||
1713 | @item | |
1714 | There is no telling what the same @code{#pragma} might mean in another | |
1715 | compiler. | |
1716 | @end enumerate | |
1717 | ||
1718 | These two reasons apply to almost any application that might be proposed | |
1719 | for @code{#pragma}. It is basically a mistake to use @code{#pragma} for | |
1720 | @emph{anything}. | |
1721 | ||
1722 | @node Function Prototypes | |
1723 | @section Prototypes and Old-Style Function Definitions | |
1724 | @cindex function prototype declarations | |
1725 | @cindex old-style function definitions | |
1726 | @cindex promotion of formal parameters | |
1727 | ||
1728 | GNU C extends ANSI C to allow a function prototype to override a later | |
1729 | old-style non-prototype definition. Consider the following example: | |
1730 | ||
1731 | @example | |
1732 | /* @r{Use prototypes unless the compiler is old-fashioned.} */ | |
d863830b | 1733 | #ifdef __STDC__ |
c1f7febf RK |
1734 | #define P(x) x |
1735 | #else | |
1736 | #define P(x) () | |
1737 | #endif | |
1738 | ||
1739 | /* @r{Prototype function declaration.} */ | |
1740 | int isroot P((uid_t)); | |
1741 | ||
1742 | /* @r{Old-style function definition.} */ | |
1743 | int | |
1744 | isroot (x) /* ??? lossage here ??? */ | |
1745 | uid_t x; | |
1746 | @{ | |
1747 | return x == 0; | |
1748 | @} | |
1749 | @end example | |
1750 | ||
1751 | Suppose the type @code{uid_t} happens to be @code{short}. ANSI C does | |
1752 | not allow this example, because subword arguments in old-style | |
1753 | non-prototype definitions are promoted. Therefore in this example the | |
1754 | function definition's argument is really an @code{int}, which does not | |
1755 | match the prototype argument type of @code{short}. | |
1756 | ||
1757 | This restriction of ANSI C makes it hard to write code that is portable | |
1758 | to traditional C compilers, because the programmer does not know | |
1759 | whether the @code{uid_t} type is @code{short}, @code{int}, or | |
1760 | @code{long}. Therefore, in cases like these GNU C allows a prototype | |
1761 | to override a later old-style definition. More precisely, in GNU C, a | |
1762 | function prototype argument type overrides the argument type specified | |
1763 | by a later old-style definition if the former type is the same as the | |
1764 | latter type before promotion. Thus in GNU C the above example is | |
1765 | equivalent to the following: | |
1766 | ||
1767 | @example | |
1768 | int isroot (uid_t); | |
1769 | ||
1770 | int | |
1771 | isroot (uid_t x) | |
1772 | @{ | |
1773 | return x == 0; | |
1774 | @} | |
1775 | @end example | |
1776 | ||
1777 | GNU C++ does not support old-style function definitions, so this | |
1778 | extension is irrelevant. | |
1779 | ||
1780 | @node C++ Comments | |
1781 | @section C++ Style Comments | |
1782 | @cindex // | |
1783 | @cindex C++ comments | |
1784 | @cindex comments, C++ style | |
1785 | ||
1786 | In GNU C, you may use C++ style comments, which start with @samp{//} and | |
1787 | continue until the end of the line. Many other C implementations allow | |
1788 | such comments, and they are likely to be in a future C standard. | |
1789 | However, C++ style comments are not recognized if you specify | |
1790 | @w{@samp{-ansi}} or @w{@samp{-traditional}}, since they are incompatible | |
1791 | with traditional constructs like @code{dividend//*comment*/divisor}. | |
1792 | ||
1793 | @node Dollar Signs | |
1794 | @section Dollar Signs in Identifier Names | |
1795 | @cindex $ | |
1796 | @cindex dollar signs in identifier names | |
1797 | @cindex identifier names, dollar signs in | |
1798 | ||
79188db9 RK |
1799 | In GNU C, you may normally use dollar signs in identifier names. |
1800 | This is because many traditional C implementations allow such identifiers. | |
1801 | However, dollar signs in identifiers are not supported on a few target | |
1802 | machines, typically because the target assembler does not allow them. | |
c1f7febf RK |
1803 | |
1804 | @node Character Escapes | |
1805 | @section The Character @key{ESC} in Constants | |
1806 | ||
1807 | You can use the sequence @samp{\e} in a string or character constant to | |
1808 | stand for the ASCII character @key{ESC}. | |
1809 | ||
1810 | @node Alignment | |
1811 | @section Inquiring on Alignment of Types or Variables | |
1812 | @cindex alignment | |
1813 | @cindex type alignment | |
1814 | @cindex variable alignment | |
1815 | ||
1816 | The keyword @code{__alignof__} allows you to inquire about how an object | |
1817 | is aligned, or the minimum alignment usually required by a type. Its | |
1818 | syntax is just like @code{sizeof}. | |
1819 | ||
1820 | For example, if the target machine requires a @code{double} value to be | |
1821 | aligned on an 8-byte boundary, then @code{__alignof__ (double)} is 8. | |
1822 | This is true on many RISC machines. On more traditional machine | |
1823 | designs, @code{__alignof__ (double)} is 4 or even 2. | |
1824 | ||
1825 | Some machines never actually require alignment; they allow reference to any | |
1826 | data type even at an odd addresses. For these machines, @code{__alignof__} | |
1827 | reports the @emph{recommended} alignment of a type. | |
1828 | ||
1829 | When the operand of @code{__alignof__} is an lvalue rather than a type, the | |
1830 | value is the largest alignment that the lvalue is known to have. It may | |
1831 | have this alignment as a result of its data type, or because it is part of | |
1832 | a structure and inherits alignment from that structure. For example, after | |
1833 | this declaration: | |
1834 | ||
1835 | @example | |
1836 | struct foo @{ int x; char y; @} foo1; | |
1837 | @end example | |
1838 | ||
1839 | @noindent | |
1840 | the value of @code{__alignof__ (foo1.y)} is probably 2 or 4, the same as | |
1841 | @code{__alignof__ (int)}, even though the data type of @code{foo1.y} | |
1842 | does not itself demand any alignment.@refill | |
1843 | ||
1844 | A related feature which lets you specify the alignment of an object is | |
1845 | @code{__attribute__ ((aligned (@var{alignment})))}; see the following | |
1846 | section. | |
1847 | ||
1848 | @node Variable Attributes | |
1849 | @section Specifying Attributes of Variables | |
1850 | @cindex attribute of variables | |
1851 | @cindex variable attributes | |
1852 | ||
1853 | The keyword @code{__attribute__} allows you to specify special | |
1854 | attributes of variables or structure fields. This keyword is followed | |
1855 | by an attribute specification inside double parentheses. Eight | |
1856 | attributes are currently defined for variables: @code{aligned}, | |
1857 | @code{mode}, @code{nocommon}, @code{packed}, @code{section}, | |
1858 | @code{transparent_union}, @code{unused}, and @code{weak}. Other | |
1859 | attributes are available for functions (@pxref{Function Attributes}) and | |
1860 | for types (@pxref{Type Attributes}). | |
1861 | ||
1862 | You may also specify attributes with @samp{__} preceding and following | |
1863 | each keyword. This allows you to use them in header files without | |
1864 | being concerned about a possible macro of the same name. For example, | |
1865 | you may use @code{__aligned__} instead of @code{aligned}. | |
1866 | ||
1867 | @table @code | |
1868 | @cindex @code{aligned} attribute | |
1869 | @item aligned (@var{alignment}) | |
1870 | This attribute specifies a minimum alignment for the variable or | |
1871 | structure field, measured in bytes. For example, the declaration: | |
1872 | ||
1873 | @smallexample | |
1874 | int x __attribute__ ((aligned (16))) = 0; | |
1875 | @end smallexample | |
1876 | ||
1877 | @noindent | |
1878 | causes the compiler to allocate the global variable @code{x} on a | |
1879 | 16-byte boundary. On a 68040, this could be used in conjunction with | |
1880 | an @code{asm} expression to access the @code{move16} instruction which | |
1881 | requires 16-byte aligned operands. | |
1882 | ||
1883 | You can also specify the alignment of structure fields. For example, to | |
1884 | create a double-word aligned @code{int} pair, you could write: | |
1885 | ||
1886 | @smallexample | |
1887 | struct foo @{ int x[2] __attribute__ ((aligned (8))); @}; | |
1888 | @end smallexample | |
1889 | ||
1890 | @noindent | |
1891 | This is an alternative to creating a union with a @code{double} member | |
1892 | that forces the union to be double-word aligned. | |
1893 | ||
1894 | It is not possible to specify the alignment of functions; the alignment | |
1895 | of functions is determined by the machine's requirements and cannot be | |
1896 | changed. You cannot specify alignment for a typedef name because such a | |
1897 | name is just an alias, not a distinct type. | |
1898 | ||
1899 | As in the preceding examples, you can explicitly specify the alignment | |
1900 | (in bytes) that you wish the compiler to use for a given variable or | |
1901 | structure field. Alternatively, you can leave out the alignment factor | |
1902 | and just ask the compiler to align a variable or field to the maximum | |
1903 | useful alignment for the target machine you are compiling for. For | |
1904 | example, you could write: | |
1905 | ||
1906 | @smallexample | |
1907 | short array[3] __attribute__ ((aligned)); | |
1908 | @end smallexample | |
1909 | ||
1910 | Whenever you leave out the alignment factor in an @code{aligned} attribute | |
1911 | specification, the compiler automatically sets the alignment for the declared | |
1912 | variable or field to the largest alignment which is ever used for any data | |
1913 | type on the target machine you are compiling for. Doing this can often make | |
1914 | copy operations more efficient, because the compiler can use whatever | |
1915 | instructions copy the biggest chunks of memory when performing copies to | |
1916 | or from the variables or fields that you have aligned this way. | |
1917 | ||
1918 | The @code{aligned} attribute can only increase the alignment; but you | |
1919 | can decrease it by specifying @code{packed} as well. See below. | |
1920 | ||
1921 | Note that the effectiveness of @code{aligned} attributes may be limited | |
1922 | by inherent limitations in your linker. On many systems, the linker is | |
1923 | only able to arrange for variables to be aligned up to a certain maximum | |
1924 | alignment. (For some linkers, the maximum supported alignment may | |
1925 | be very very small.) If your linker is only able to align variables | |
1926 | up to a maximum of 8 byte alignment, then specifying @code{aligned(16)} | |
1927 | in an @code{__attribute__} will still only provide you with 8 byte | |
1928 | alignment. See your linker documentation for further information. | |
1929 | ||
1930 | @item mode (@var{mode}) | |
1931 | @cindex @code{mode} attribute | |
1932 | This attribute specifies the data type for the declaration---whichever | |
1933 | type corresponds to the mode @var{mode}. This in effect lets you | |
1934 | request an integer or floating point type according to its width. | |
1935 | ||
1936 | You may also specify a mode of @samp{byte} or @samp{__byte__} to | |
1937 | indicate the mode corresponding to a one-byte integer, @samp{word} or | |
1938 | @samp{__word__} for the mode of a one-word integer, and @samp{pointer} | |
1939 | or @samp{__pointer__} for the mode used to represent pointers. | |
1940 | ||
1941 | @item nocommon | |
1942 | @cindex @code{nocommon} attribute | |
1943 | This attribute specifies requests GNU CC not to place a variable | |
1944 | ``common'' but instead to allocate space for it directly. If you | |
1945 | specify the @samp{-fno-common} flag, GNU CC will do this for all | |
1946 | variables. | |
1947 | ||
1948 | Specifying the @code{nocommon} attribute for a variable provides an | |
1949 | initialization of zeros. A variable may only be initialized in one | |
1950 | source file. | |
1951 | ||
1952 | @item packed | |
1953 | @cindex @code{packed} attribute | |
1954 | The @code{packed} attribute specifies that a variable or structure field | |
1955 | should have the smallest possible alignment---one byte for a variable, | |
1956 | and one bit for a field, unless you specify a larger value with the | |
1957 | @code{aligned} attribute. | |
1958 | ||
1959 | Here is a structure in which the field @code{x} is packed, so that it | |
1960 | immediately follows @code{a}: | |
1961 | ||
1962 | @example | |
1963 | struct foo | |
1964 | @{ | |
1965 | char a; | |
1966 | int x[2] __attribute__ ((packed)); | |
1967 | @}; | |
1968 | @end example | |
1969 | ||
1970 | @item section ("section-name") | |
1971 | @cindex @code{section} variable attribute | |
1972 | Normally, the compiler places the objects it generates in sections like | |
1973 | @code{data} and @code{bss}. Sometimes, however, you need additional sections, | |
1974 | or you need certain particular variables to appear in special sections, | |
1975 | for example to map to special hardware. The @code{section} | |
1976 | attribute specifies that a variable (or function) lives in a particular | |
1977 | section. For example, this small program uses several specific section names: | |
1978 | ||
1979 | @smallexample | |
1980 | struct duart a __attribute__ ((section ("DUART_A"))) = @{ 0 @}; | |
1981 | struct duart b __attribute__ ((section ("DUART_B"))) = @{ 0 @}; | |
1982 | char stack[10000] __attribute__ ((section ("STACK"))) = @{ 0 @}; | |
1983 | int init_data __attribute__ ((section ("INITDATA"))) = 0; | |
1984 | ||
1985 | main() | |
1986 | @{ | |
1987 | /* Initialize stack pointer */ | |
1988 | init_sp (stack + sizeof (stack)); | |
1989 | ||
1990 | /* Initialize initialized data */ | |
1991 | memcpy (&init_data, &data, &edata - &data); | |
1992 | ||
1993 | /* Turn on the serial ports */ | |
1994 | init_duart (&a); | |
1995 | init_duart (&b); | |
1996 | @} | |
1997 | @end smallexample | |
1998 | ||
1999 | @noindent | |
2000 | Use the @code{section} attribute with an @emph{initialized} definition | |
2001 | of a @emph{global} variable, as shown in the example. GNU CC issues | |
2002 | a warning and otherwise ignores the @code{section} attribute in | |
2003 | uninitialized variable declarations. | |
2004 | ||
2005 | You may only use the @code{section} attribute with a fully initialized | |
2006 | global definition because of the way linkers work. The linker requires | |
2007 | each object be defined once, with the exception that uninitialized | |
2008 | variables tentatively go in the @code{common} (or @code{bss}) section | |
2009 | and can be multiply "defined". You can force a variable to be | |
2010 | initialized with the @samp{-fno-common} flag or the @code{nocommon} | |
2011 | attribute. | |
2012 | ||
2013 | Some file formats do not support arbitrary sections so the @code{section} | |
2014 | attribute is not available on all platforms. | |
2015 | If you need to map the entire contents of a module to a particular | |
2016 | section, consider using the facilities of the linker instead. | |
2017 | ||
593d3a34 MK |
2018 | @item shared |
2019 | @cindex @code{shared} variable attribute | |
2020 | On Windows NT, in addition to nputting variable definitions in a named | |
2021 | section, the section can also be shared among all running copies of an | |
2022 | executable or DLL. For example, this small program defines shared data | |
2023 | by putting it in a named section "shared" and marking the section | |
2024 | shareable: | |
2025 | ||
2026 | @smallexample | |
2027 | int foo __attribute__((section ("shared"), shared)) = 0; | |
2028 | ||
2029 | int | |
2030 | main() | |
2031 | @{ | |
2032 | /* Read and write foo. All running copies see the same value. */ | |
2033 | return 0; | |
2034 | @} | |
2035 | @end smallexample | |
2036 | ||
2037 | @noindent | |
2038 | You may only use the @code{shared} attribute along with @code{section} | |
2039 | attribute with a fully initialized global definition because of the way | |
2040 | linkers work. See @code{section} attribute for more information. | |
2041 | ||
2042 | The @code{shared} attribute is only available on Windows NT. | |
2043 | ||
c1f7febf RK |
2044 | @item transparent_union |
2045 | This attribute, attached to a function parameter which is a union, means | |
2046 | that the corresponding argument may have the type of any union member, | |
2047 | but the argument is passed as if its type were that of the first union | |
2048 | member. For more details see @xref{Type Attributes}. You can also use | |
2049 | this attribute on a @code{typedef} for a union data type; then it | |
2050 | applies to all function parameters with that type. | |
2051 | ||
2052 | @item unused | |
2053 | This attribute, attached to a variable, means that the variable is meant | |
2054 | to be possibly unused. GNU CC will not produce a warning for this | |
2055 | variable. | |
2056 | ||
2057 | @item weak | |
2058 | The @code{weak} attribute is described in @xref{Function Attributes}. | |
845da534 DE |
2059 | |
2060 | @item model (@var{model-name}) | |
2061 | @cindex variable addressability on the M32R/D | |
2062 | Use this attribute on the M32R/D to set the addressability of an object. | |
2063 | The identifier @var{model-name} is one of @code{small}, @code{medium}, | |
2064 | or @code{large}, representing each of the code models. | |
2065 | ||
2066 | Small model objects live in the lower 16MB of memory (so that their | |
2067 | addresses can be loaded with the @code{ld24} instruction). | |
2068 | ||
2069 | Medium and large model objects may live anywhere in the 32 bit address space | |
2070 | (the compiler will generate @code{seth/add3} instructions to load their | |
2071 | addresses). | |
2072 | ||
c1f7febf RK |
2073 | @end table |
2074 | ||
2075 | To specify multiple attributes, separate them by commas within the | |
2076 | double parentheses: for example, @samp{__attribute__ ((aligned (16), | |
2077 | packed))}. | |
2078 | ||
2079 | @node Type Attributes | |
2080 | @section Specifying Attributes of Types | |
2081 | @cindex attribute of types | |
2082 | @cindex type attributes | |
2083 | ||
2084 | The keyword @code{__attribute__} allows you to specify special | |
2085 | attributes of @code{struct} and @code{union} types when you define such | |
2086 | types. This keyword is followed by an attribute specification inside | |
2087 | double parentheses. Three attributes are currently defined for types: | |
2088 | @code{aligned}, @code{packed}, and @code{transparent_union}. Other | |
2089 | attributes are defined for functions (@pxref{Function Attributes}) and | |
2090 | for variables (@pxref{Variable Attributes}). | |
2091 | ||
2092 | You may also specify any one of these attributes with @samp{__} | |
2093 | preceding and following its keyword. This allows you to use these | |
2094 | attributes in header files without being concerned about a possible | |
2095 | macro of the same name. For example, you may use @code{__aligned__} | |
2096 | instead of @code{aligned}. | |
2097 | ||
2098 | You may specify the @code{aligned} and @code{transparent_union} | |
2099 | attributes either in a @code{typedef} declaration or just past the | |
2100 | closing curly brace of a complete enum, struct or union type | |
2101 | @emph{definition} and the @code{packed} attribute only past the closing | |
2102 | brace of a definition. | |
2103 | ||
4051959b JM |
2104 | You may also specify attributes between the enum, struct or union |
2105 | tag and the name of the type rather than after the closing brace. | |
2106 | ||
c1f7febf RK |
2107 | @table @code |
2108 | @cindex @code{aligned} attribute | |
2109 | @item aligned (@var{alignment}) | |
2110 | This attribute specifies a minimum alignment (in bytes) for variables | |
2111 | of the specified type. For example, the declarations: | |
2112 | ||
2113 | @smallexample | |
f69eecfb JL |
2114 | struct S @{ short f[3]; @} __attribute__ ((aligned (8))); |
2115 | typedef int more_aligned_int __attribute__ ((aligned (8))); | |
c1f7febf RK |
2116 | @end smallexample |
2117 | ||
2118 | @noindent | |
d863830b | 2119 | force the compiler to insure (as far as it can) that each variable whose |
c1f7febf RK |
2120 | type is @code{struct S} or @code{more_aligned_int} will be allocated and |
2121 | aligned @emph{at least} on a 8-byte boundary. On a Sparc, having all | |
2122 | variables of type @code{struct S} aligned to 8-byte boundaries allows | |
2123 | the compiler to use the @code{ldd} and @code{std} (doubleword load and | |
2124 | store) instructions when copying one variable of type @code{struct S} to | |
2125 | another, thus improving run-time efficiency. | |
2126 | ||
2127 | Note that the alignment of any given @code{struct} or @code{union} type | |
2128 | is required by the ANSI C standard to be at least a perfect multiple of | |
2129 | the lowest common multiple of the alignments of all of the members of | |
2130 | the @code{struct} or @code{union} in question. This means that you @emph{can} | |
2131 | effectively adjust the alignment of a @code{struct} or @code{union} | |
2132 | type by attaching an @code{aligned} attribute to any one of the members | |
2133 | of such a type, but the notation illustrated in the example above is a | |
2134 | more obvious, intuitive, and readable way to request the compiler to | |
2135 | adjust the alignment of an entire @code{struct} or @code{union} type. | |
2136 | ||
2137 | As in the preceding example, you can explicitly specify the alignment | |
2138 | (in bytes) that you wish the compiler to use for a given @code{struct} | |
2139 | or @code{union} type. Alternatively, you can leave out the alignment factor | |
2140 | and just ask the compiler to align a type to the maximum | |
2141 | useful alignment for the target machine you are compiling for. For | |
2142 | example, you could write: | |
2143 | ||
2144 | @smallexample | |
2145 | struct S @{ short f[3]; @} __attribute__ ((aligned)); | |
2146 | @end smallexample | |
2147 | ||
2148 | Whenever you leave out the alignment factor in an @code{aligned} | |
2149 | attribute specification, the compiler automatically sets the alignment | |
2150 | for the type to the largest alignment which is ever used for any data | |
2151 | type on the target machine you are compiling for. Doing this can often | |
2152 | make copy operations more efficient, because the compiler can use | |
2153 | whatever instructions copy the biggest chunks of memory when performing | |
2154 | copies to or from the variables which have types that you have aligned | |
2155 | this way. | |
2156 | ||
2157 | In the example above, if the size of each @code{short} is 2 bytes, then | |
2158 | the size of the entire @code{struct S} type is 6 bytes. The smallest | |
2159 | power of two which is greater than or equal to that is 8, so the | |
2160 | compiler sets the alignment for the entire @code{struct S} type to 8 | |
2161 | bytes. | |
2162 | ||
2163 | Note that although you can ask the compiler to select a time-efficient | |
2164 | alignment for a given type and then declare only individual stand-alone | |
2165 | objects of that type, the compiler's ability to select a time-efficient | |
2166 | alignment is primarily useful only when you plan to create arrays of | |
2167 | variables having the relevant (efficiently aligned) type. If you | |
2168 | declare or use arrays of variables of an efficiently-aligned type, then | |
2169 | it is likely that your program will also be doing pointer arithmetic (or | |
2170 | subscripting, which amounts to the same thing) on pointers to the | |
2171 | relevant type, and the code that the compiler generates for these | |
2172 | pointer arithmetic operations will often be more efficient for | |
2173 | efficiently-aligned types than for other types. | |
2174 | ||
2175 | The @code{aligned} attribute can only increase the alignment; but you | |
2176 | can decrease it by specifying @code{packed} as well. See below. | |
2177 | ||
2178 | Note that the effectiveness of @code{aligned} attributes may be limited | |
2179 | by inherent limitations in your linker. On many systems, the linker is | |
2180 | only able to arrange for variables to be aligned up to a certain maximum | |
2181 | alignment. (For some linkers, the maximum supported alignment may | |
2182 | be very very small.) If your linker is only able to align variables | |
2183 | up to a maximum of 8 byte alignment, then specifying @code{aligned(16)} | |
2184 | in an @code{__attribute__} will still only provide you with 8 byte | |
2185 | alignment. See your linker documentation for further information. | |
2186 | ||
2187 | @item packed | |
2188 | This attribute, attached to an @code{enum}, @code{struct}, or | |
2189 | @code{union} type definition, specified that the minimum required memory | |
2190 | be used to represent the type. | |
2191 | ||
2192 | Specifying this attribute for @code{struct} and @code{union} types is | |
2193 | equivalent to specifying the @code{packed} attribute on each of the | |
2194 | structure or union members. Specifying the @samp{-fshort-enums} | |
2195 | flag on the line is equivalent to specifying the @code{packed} | |
2196 | attribute on all @code{enum} definitions. | |
2197 | ||
2198 | You may only specify this attribute after a closing curly brace on an | |
1cd4bca9 BK |
2199 | @code{enum} definition, not in a @code{typedef} declaration, unless that |
2200 | declaration also contains the definition of the @code{enum}. | |
c1f7febf RK |
2201 | |
2202 | @item transparent_union | |
2203 | This attribute, attached to a @code{union} type definition, indicates | |
2204 | that any function parameter having that union type causes calls to that | |
2205 | function to be treated in a special way. | |
2206 | ||
2207 | First, the argument corresponding to a transparent union type can be of | |
2208 | any type in the union; no cast is required. Also, if the union contains | |
2209 | a pointer type, the corresponding argument can be a null pointer | |
2210 | constant or a void pointer expression; and if the union contains a void | |
2211 | pointer type, the corresponding argument can be any pointer expression. | |
2212 | If the union member type is a pointer, qualifiers like @code{const} on | |
2213 | the referenced type must be respected, just as with normal pointer | |
2214 | conversions. | |
2215 | ||
2216 | Second, the argument is passed to the function using the calling | |
2217 | conventions of first member of the transparent union, not the calling | |
2218 | conventions of the union itself. All members of the union must have the | |
2219 | same machine representation; this is necessary for this argument passing | |
2220 | to work properly. | |
2221 | ||
2222 | Transparent unions are designed for library functions that have multiple | |
2223 | interfaces for compatibility reasons. For example, suppose the | |
2224 | @code{wait} function must accept either a value of type @code{int *} to | |
2225 | comply with Posix, or a value of type @code{union wait *} to comply with | |
2226 | the 4.1BSD interface. If @code{wait}'s parameter were @code{void *}, | |
2227 | @code{wait} would accept both kinds of arguments, but it would also | |
2228 | accept any other pointer type and this would make argument type checking | |
2229 | less useful. Instead, @code{<sys/wait.h>} might define the interface | |
2230 | as follows: | |
2231 | ||
2232 | @smallexample | |
2233 | typedef union | |
2234 | @{ | |
2235 | int *__ip; | |
2236 | union wait *__up; | |
2237 | @} wait_status_ptr_t __attribute__ ((__transparent_union__)); | |
2238 | ||
2239 | pid_t wait (wait_status_ptr_t); | |
2240 | @end smallexample | |
2241 | ||
2242 | This interface allows either @code{int *} or @code{union wait *} | |
2243 | arguments to be passed, using the @code{int *} calling convention. | |
2244 | The program can call @code{wait} with arguments of either type: | |
2245 | ||
2246 | @example | |
2247 | int w1 () @{ int w; return wait (&w); @} | |
2248 | int w2 () @{ union wait w; return wait (&w); @} | |
2249 | @end example | |
2250 | ||
2251 | With this interface, @code{wait}'s implementation might look like this: | |
2252 | ||
2253 | @example | |
2254 | pid_t wait (wait_status_ptr_t p) | |
2255 | @{ | |
2256 | return waitpid (-1, p.__ip, 0); | |
2257 | @} | |
2258 | @end example | |
d863830b JL |
2259 | |
2260 | @item unused | |
2261 | When attached to a type (including a @code{union} or a @code{struct}), | |
2262 | this attribute means that variables of that type are meant to appear | |
2263 | possibly unused. GNU CC will not produce a warning for any variables of | |
2264 | that type, even if the variable appears to do nothing. This is often | |
2265 | the case with lock or thread classes, which are usually defined and then | |
2266 | not referenced, but contain constructors and destructors that have | |
956d6950 | 2267 | nontrivial bookkeeping functions. |
d863830b | 2268 | |
c1f7febf RK |
2269 | @end table |
2270 | ||
2271 | To specify multiple attributes, separate them by commas within the | |
2272 | double parentheses: for example, @samp{__attribute__ ((aligned (16), | |
2273 | packed))}. | |
2274 | ||
2275 | @node Inline | |
2276 | @section An Inline Function is As Fast As a Macro | |
2277 | @cindex inline functions | |
2278 | @cindex integrating function code | |
2279 | @cindex open coding | |
2280 | @cindex macros, inline alternative | |
2281 | ||
2282 | By declaring a function @code{inline}, you can direct GNU CC to | |
2283 | integrate that function's code into the code for its callers. This | |
2284 | makes execution faster by eliminating the function-call overhead; in | |
2285 | addition, if any of the actual argument values are constant, their known | |
2286 | values may permit simplifications at compile time so that not all of the | |
2287 | inline function's code needs to be included. The effect on code size is | |
2288 | less predictable; object code may be larger or smaller with function | |
2289 | inlining, depending on the particular case. Inlining of functions is an | |
2290 | optimization and it really ``works'' only in optimizing compilation. If | |
2291 | you don't use @samp{-O}, no function is really inline. | |
2292 | ||
2293 | To declare a function inline, use the @code{inline} keyword in its | |
2294 | declaration, like this: | |
2295 | ||
2296 | @example | |
2297 | inline int | |
2298 | inc (int *a) | |
2299 | @{ | |
2300 | (*a)++; | |
2301 | @} | |
2302 | @end example | |
2303 | ||
2304 | (If you are writing a header file to be included in ANSI C programs, write | |
2305 | @code{__inline__} instead of @code{inline}. @xref{Alternate Keywords}.) | |
c1f7febf | 2306 | You can also make all ``simple enough'' functions inline with the option |
247b14bd RH |
2307 | @samp{-finline-functions}. |
2308 | ||
2309 | Note that certain usages in a function definition can make it unsuitable | |
2310 | for inline substitution. Among these usages are: use of varargs, use of | |
2311 | alloca, use of variable sized data types (@pxref{Variable Length}), | |
2312 | use of computed goto (@pxref{Labels as Values}), use of nonlocal goto, | |
2313 | and nested functions (@pxref{Nested Functions}). Using @samp{-Winline} | |
2314 | will warn when a function marked @code{inline} could not be substituted, | |
2315 | and will give the reason for the failure. | |
c1f7febf RK |
2316 | |
2317 | Note that in C and Objective C, unlike C++, the @code{inline} keyword | |
2318 | does not affect the linkage of the function. | |
2319 | ||
2320 | @cindex automatic @code{inline} for C++ member fns | |
2321 | @cindex @code{inline} automatic for C++ member fns | |
2322 | @cindex member fns, automatically @code{inline} | |
2323 | @cindex C++ member fns, automatically @code{inline} | |
2324 | GNU CC automatically inlines member functions defined within the class | |
2325 | body of C++ programs even if they are not explicitly declared | |
2326 | @code{inline}. (You can override this with @samp{-fno-default-inline}; | |
2327 | @pxref{C++ Dialect Options,,Options Controlling C++ Dialect}.) | |
2328 | ||
2329 | @cindex inline functions, omission of | |
2330 | When a function is both inline and @code{static}, if all calls to the | |
2331 | function are integrated into the caller, and the function's address is | |
2332 | never used, then the function's own assembler code is never referenced. | |
2333 | In this case, GNU CC does not actually output assembler code for the | |
2334 | function, unless you specify the option @samp{-fkeep-inline-functions}. | |
2335 | Some calls cannot be integrated for various reasons (in particular, | |
2336 | calls that precede the function's definition cannot be integrated, and | |
2337 | neither can recursive calls within the definition). If there is a | |
2338 | nonintegrated call, then the function is compiled to assembler code as | |
2339 | usual. The function must also be compiled as usual if the program | |
2340 | refers to its address, because that can't be inlined. | |
2341 | ||
2342 | @cindex non-static inline function | |
2343 | When an inline function is not @code{static}, then the compiler must assume | |
2344 | that there may be calls from other source files; since a global symbol can | |
2345 | be defined only once in any program, the function must not be defined in | |
2346 | the other source files, so the calls therein cannot be integrated. | |
2347 | Therefore, a non-@code{static} inline function is always compiled on its | |
2348 | own in the usual fashion. | |
2349 | ||
2350 | If you specify both @code{inline} and @code{extern} in the function | |
2351 | definition, then the definition is used only for inlining. In no case | |
2352 | is the function compiled on its own, not even if you refer to its | |
2353 | address explicitly. Such an address becomes an external reference, as | |
2354 | if you had only declared the function, and had not defined it. | |
2355 | ||
2356 | This combination of @code{inline} and @code{extern} has almost the | |
2357 | effect of a macro. The way to use it is to put a function definition in | |
2358 | a header file with these keywords, and put another copy of the | |
2359 | definition (lacking @code{inline} and @code{extern}) in a library file. | |
2360 | The definition in the header file will cause most calls to the function | |
2361 | to be inlined. If any uses of the function remain, they will refer to | |
2362 | the single copy in the library. | |
2363 | ||
2364 | GNU C does not inline any functions when not optimizing. It is not | |
2365 | clear whether it is better to inline or not, in this case, but we found | |
2366 | that a correct implementation when not optimizing was difficult. So we | |
2367 | did the easy thing, and turned it off. | |
2368 | ||
2369 | @node Extended Asm | |
2370 | @section Assembler Instructions with C Expression Operands | |
2371 | @cindex extended @code{asm} | |
2372 | @cindex @code{asm} expressions | |
2373 | @cindex assembler instructions | |
2374 | @cindex registers | |
2375 | ||
c85f7c16 JL |
2376 | In an assembler instruction using @code{asm}, you can specify the |
2377 | operands of the instruction using C expressions. This means you need not | |
2378 | guess which registers or memory locations will contain the data you want | |
c1f7febf RK |
2379 | to use. |
2380 | ||
c85f7c16 JL |
2381 | You must specify an assembler instruction template much like what |
2382 | appears in a machine description, plus an operand constraint string for | |
2383 | each operand. | |
c1f7febf RK |
2384 | |
2385 | For example, here is how to use the 68881's @code{fsinx} instruction: | |
2386 | ||
2387 | @example | |
2388 | asm ("fsinx %1,%0" : "=f" (result) : "f" (angle)); | |
2389 | @end example | |
2390 | ||
2391 | @noindent | |
2392 | Here @code{angle} is the C expression for the input operand while | |
2393 | @code{result} is that of the output operand. Each has @samp{"f"} as its | |
c85f7c16 JL |
2394 | operand constraint, saying that a floating point register is required. |
2395 | The @samp{=} in @samp{=f} indicates that the operand is an output; all | |
2396 | output operands' constraints must use @samp{=}. The constraints use the | |
2397 | same language used in the machine description (@pxref{Constraints}). | |
2398 | ||
2399 | Each operand is described by an operand-constraint string followed by | |
2400 | the C expression in parentheses. A colon separates the assembler | |
2401 | template from the first output operand and another separates the last | |
2402 | output operand from the first input, if any. Commas separate the | |
2403 | operands within each group. The total number of operands is limited to | |
2404 | ten or to the maximum number of operands in any instruction pattern in | |
2405 | the machine description, whichever is greater. | |
2406 | ||
2407 | If there are no output operands but there are input operands, you must | |
2408 | place two consecutive colons surrounding the place where the output | |
c1f7febf RK |
2409 | operands would go. |
2410 | ||
2411 | Output operand expressions must be lvalues; the compiler can check this. | |
c85f7c16 JL |
2412 | The input operands need not be lvalues. The compiler cannot check |
2413 | whether the operands have data types that are reasonable for the | |
2414 | instruction being executed. It does not parse the assembler instruction | |
2415 | template and does not know what it means or even whether it is valid | |
2416 | assembler input. The extended @code{asm} feature is most often used for | |
2417 | machine instructions the compiler itself does not know exist. If | |
2418 | the output expression cannot be directly addressed (for example, it is a | |
2419 | bit field), your constraint must allow a register. In that case, GNU CC | |
2420 | will use the register as the output of the @code{asm}, and then store | |
2421 | that register into the output. | |
2422 | ||
2423 | The ordinary output operands must be write-only; GNU CC will assume that | |
2424 | the values in these operands before the instruction are dead and need | |
2425 | not be generated. Extended asm supports input-output or read-write | |
2426 | operands. Use the constraint character @samp{+} to indicate such an | |
2427 | operand and list it with the output operands. | |
2428 | ||
2429 | When the constraints for the read-write operand (or the operand in which | |
2430 | only some of the bits are to be changed) allows a register, you may, as | |
2431 | an alternative, logically split its function into two separate operands, | |
2432 | one input operand and one write-only output operand. The connection | |
2433 | between them is expressed by constraints which say they need to be in | |
2434 | the same location when the instruction executes. You can use the same C | |
2435 | expression for both operands, or different expressions. For example, | |
2436 | here we write the (fictitious) @samp{combine} instruction with | |
2437 | @code{bar} as its read-only source operand and @code{foo} as its | |
2438 | read-write destination: | |
c1f7febf RK |
2439 | |
2440 | @example | |
2441 | asm ("combine %2,%0" : "=r" (foo) : "0" (foo), "g" (bar)); | |
2442 | @end example | |
2443 | ||
2444 | @noindent | |
c85f7c16 JL |
2445 | The constraint @samp{"0"} for operand 1 says that it must occupy the |
2446 | same location as operand 0. A digit in constraint is allowed only in an | |
2447 | input operand and it must refer to an output operand. | |
c1f7febf RK |
2448 | |
2449 | Only a digit in the constraint can guarantee that one operand will be in | |
c85f7c16 JL |
2450 | the same place as another. The mere fact that @code{foo} is the value |
2451 | of both operands is not enough to guarantee that they will be in the | |
2452 | same place in the generated assembler code. The following would not | |
2453 | work reliably: | |
c1f7febf RK |
2454 | |
2455 | @example | |
2456 | asm ("combine %2,%0" : "=r" (foo) : "r" (foo), "g" (bar)); | |
2457 | @end example | |
2458 | ||
2459 | Various optimizations or reloading could cause operands 0 and 1 to be in | |
2460 | different registers; GNU CC knows no reason not to do so. For example, the | |
2461 | compiler might find a copy of the value of @code{foo} in one register and | |
2462 | use it for operand 1, but generate the output operand 0 in a different | |
2463 | register (copying it afterward to @code{foo}'s own address). Of course, | |
2464 | since the register for operand 1 is not even mentioned in the assembler | |
2465 | code, the result will not work, but GNU CC can't tell that. | |
2466 | ||
c85f7c16 JL |
2467 | Some instructions clobber specific hard registers. To describe this, |
2468 | write a third colon after the input operands, followed by the names of | |
2469 | the clobbered hard registers (given as strings). Here is a realistic | |
2470 | example for the VAX: | |
c1f7febf RK |
2471 | |
2472 | @example | |
2473 | asm volatile ("movc3 %0,%1,%2" | |
2474 | : /* no outputs */ | |
2475 | : "g" (from), "g" (to), "g" (count) | |
2476 | : "r0", "r1", "r2", "r3", "r4", "r5"); | |
2477 | @end example | |
2478 | ||
c5c76735 JL |
2479 | You may not write a clobber description in a way that overlaps with an |
2480 | input or output operand. For example, you may not have an operand | |
2481 | describing a register class with one member if you mention that register | |
2482 | in the clobber list. There is no way for you to specify that an input | |
2483 | operand is modified without also specifying it as an output | |
2484 | operand. Note that if all the output operands you specify are for this | |
2485 | purpose (and hence unused), you will then also need to specify | |
2486 | @code{volatile} for the @code{asm} construct, as described below, to | |
2487 | prevent GNU CC from deleting the @code{asm} statement as unused. | |
8fe1938e | 2488 | |
c1f7febf | 2489 | If you refer to a particular hardware register from the assembler code, |
c85f7c16 JL |
2490 | you will probably have to list the register after the third colon to |
2491 | tell the compiler the register's value is modified. In some assemblers, | |
2492 | the register names begin with @samp{%}; to produce one @samp{%} in the | |
2493 | assembler code, you must write @samp{%%} in the input. | |
2494 | ||
2495 | If your assembler instruction can alter the condition code register, add | |
2496 | @samp{cc} to the list of clobbered registers. GNU CC on some machines | |
2497 | represents the condition codes as a specific hardware register; | |
2498 | @samp{cc} serves to name this register. On other machines, the | |
2499 | condition code is handled differently, and specifying @samp{cc} has no | |
2500 | effect. But it is valid no matter what the machine. | |
c1f7febf RK |
2501 | |
2502 | If your assembler instruction modifies memory in an unpredictable | |
c85f7c16 JL |
2503 | fashion, add @samp{memory} to the list of clobbered registers. This |
2504 | will cause GNU CC to not keep memory values cached in registers across | |
2505 | the assembler instruction. | |
c1f7febf | 2506 | |
c85f7c16 JL |
2507 | You can put multiple assembler instructions together in a single |
2508 | @code{asm} template, separated either with newlines (written as | |
2509 | @samp{\n}) or with semicolons if the assembler allows such semicolons. | |
2510 | The GNU assembler allows semicolons and most Unix assemblers seem to do | |
2511 | so. The input operands are guaranteed not to use any of the clobbered | |
2512 | registers, and neither will the output operands' addresses, so you can | |
2513 | read and write the clobbered registers as many times as you like. Here | |
2514 | is an example of multiple instructions in a template; it assumes the | |
2515 | subroutine @code{_foo} accepts arguments in registers 9 and 10: | |
c1f7febf RK |
2516 | |
2517 | @example | |
2518 | asm ("movl %0,r9;movl %1,r10;call _foo" | |
2519 | : /* no outputs */ | |
2520 | : "g" (from), "g" (to) | |
2521 | : "r9", "r10"); | |
2522 | @end example | |
2523 | ||
c85f7c16 JL |
2524 | Unless an output operand has the @samp{&} constraint modifier, GNU CC |
2525 | may allocate it in the same register as an unrelated input operand, on | |
2526 | the assumption the inputs are consumed before the outputs are produced. | |
c1f7febf RK |
2527 | This assumption may be false if the assembler code actually consists of |
2528 | more than one instruction. In such a case, use @samp{&} for each output | |
c85f7c16 | 2529 | operand that may not overlap an input. @xref{Modifiers}. |
c1f7febf | 2530 | |
c85f7c16 JL |
2531 | If you want to test the condition code produced by an assembler |
2532 | instruction, you must include a branch and a label in the @code{asm} | |
2533 | construct, as follows: | |
c1f7febf RK |
2534 | |
2535 | @example | |
2536 | asm ("clr %0;frob %1;beq 0f;mov #1,%0;0:" | |
2537 | : "g" (result) | |
2538 | : "g" (input)); | |
2539 | @end example | |
2540 | ||
2541 | @noindent | |
2542 | This assumes your assembler supports local labels, as the GNU assembler | |
2543 | and most Unix assemblers do. | |
2544 | ||
2545 | Speaking of labels, jumps from one @code{asm} to another are not | |
c85f7c16 JL |
2546 | supported. The compiler's optimizers do not know about these jumps, and |
2547 | therefore they cannot take account of them when deciding how to | |
c1f7febf RK |
2548 | optimize. |
2549 | ||
2550 | @cindex macros containing @code{asm} | |
2551 | Usually the most convenient way to use these @code{asm} instructions is to | |
2552 | encapsulate them in macros that look like functions. For example, | |
2553 | ||
2554 | @example | |
2555 | #define sin(x) \ | |
2556 | (@{ double __value, __arg = (x); \ | |
2557 | asm ("fsinx %1,%0": "=f" (__value): "f" (__arg)); \ | |
2558 | __value; @}) | |
2559 | @end example | |
2560 | ||
2561 | @noindent | |
2562 | Here the variable @code{__arg} is used to make sure that the instruction | |
2563 | operates on a proper @code{double} value, and to accept only those | |
2564 | arguments @code{x} which can convert automatically to a @code{double}. | |
2565 | ||
c85f7c16 JL |
2566 | Another way to make sure the instruction operates on the correct data |
2567 | type is to use a cast in the @code{asm}. This is different from using a | |
c1f7febf RK |
2568 | variable @code{__arg} in that it converts more different types. For |
2569 | example, if the desired type were @code{int}, casting the argument to | |
2570 | @code{int} would accept a pointer with no complaint, while assigning the | |
2571 | argument to an @code{int} variable named @code{__arg} would warn about | |
2572 | using a pointer unless the caller explicitly casts it. | |
2573 | ||
2574 | If an @code{asm} has output operands, GNU CC assumes for optimization | |
c85f7c16 JL |
2575 | purposes the instruction has no side effects except to change the output |
2576 | operands. This does not mean instructions with a side effect cannot be | |
2577 | used, but you must be careful, because the compiler may eliminate them | |
2578 | if the output operands aren't used, or move them out of loops, or | |
2579 | replace two with one if they constitute a common subexpression. Also, | |
2580 | if your instruction does have a side effect on a variable that otherwise | |
2581 | appears not to change, the old value of the variable may be reused later | |
2582 | if it happens to be found in a register. | |
c1f7febf RK |
2583 | |
2584 | You can prevent an @code{asm} instruction from being deleted, moved | |
2585 | significantly, or combined, by writing the keyword @code{volatile} after | |
2586 | the @code{asm}. For example: | |
2587 | ||
2588 | @example | |
c85f7c16 JL |
2589 | #define get_and_set_priority(new) \ |
2590 | (@{ int __old; \ | |
2591 | asm volatile ("get_and_set_priority %0, %1": "=g" (__old) : "g" (new)); \ | |
2592 | __old; @}) | |
24f98470 | 2593 | @end example |
c1f7febf RK |
2594 | |
2595 | @noindent | |
c85f7c16 JL |
2596 | If you write an @code{asm} instruction with no outputs, GNU CC will know |
2597 | the instruction has side-effects and will not delete the instruction or | |
2598 | move it outside of loops. If the side-effects of your instruction are | |
2599 | not purely external, but will affect variables in your program in ways | |
2600 | other than reading the inputs and clobbering the specified registers or | |
2601 | memory, you should write the @code{volatile} keyword to prevent future | |
2602 | versions of GNU CC from moving the instruction around within a core | |
2603 | region. | |
2604 | ||
2605 | An @code{asm} instruction without any operands or clobbers (and ``old | |
2606 | style'' @code{asm}) will not be deleted or moved significantly, | |
2607 | regardless, unless it is unreachable, the same wasy as if you had | |
2608 | written a @code{volatile} keyword. | |
c1f7febf RK |
2609 | |
2610 | Note that even a volatile @code{asm} instruction can be moved in ways | |
2611 | that appear insignificant to the compiler, such as across jump | |
2612 | instructions. You can't expect a sequence of volatile @code{asm} | |
2613 | instructions to remain perfectly consecutive. If you want consecutive | |
2614 | output, use a single @code{asm}. | |
2615 | ||
2616 | It is a natural idea to look for a way to give access to the condition | |
2617 | code left by the assembler instruction. However, when we attempted to | |
2618 | implement this, we found no way to make it work reliably. The problem | |
2619 | is that output operands might need reloading, which would result in | |
2620 | additional following ``store'' instructions. On most machines, these | |
2621 | instructions would alter the condition code before there was time to | |
2622 | test it. This problem doesn't arise for ordinary ``test'' and | |
2623 | ``compare'' instructions because they don't have any output operands. | |
2624 | ||
2625 | If you are writing a header file that should be includable in ANSI C | |
2626 | programs, write @code{__asm__} instead of @code{asm}. @xref{Alternate | |
2627 | Keywords}. | |
2628 | ||
fe0ce426 JH |
2629 | @subsection i386 floating point asm operands |
2630 | ||
2631 | There are several rules on the usage of stack-like regs in | |
2632 | asm_operands insns. These rules apply only to the operands that are | |
2633 | stack-like regs: | |
2634 | ||
2635 | @enumerate | |
2636 | @item | |
2637 | Given a set of input regs that die in an asm_operands, it is | |
2638 | necessary to know which are implicitly popped by the asm, and | |
2639 | which must be explicitly popped by gcc. | |
2640 | ||
2641 | An input reg that is implicitly popped by the asm must be | |
2642 | explicitly clobbered, unless it is constrained to match an | |
2643 | output operand. | |
2644 | ||
2645 | @item | |
2646 | For any input reg that is implicitly popped by an asm, it is | |
2647 | necessary to know how to adjust the stack to compensate for the pop. | |
2648 | If any non-popped input is closer to the top of the reg-stack than | |
2649 | the implicitly popped reg, it would not be possible to know what the | |
2650 | stack looked like --- it's not clear how the rest of the stack ``slides | |
2651 | up''. | |
2652 | ||
2653 | All implicitly popped input regs must be closer to the top of | |
2654 | the reg-stack than any input that is not implicitly popped. | |
2655 | ||
2656 | It is possible that if an input dies in an insn, reload might | |
2657 | use the input reg for an output reload. Consider this example: | |
2658 | ||
2659 | @example | |
2660 | asm ("foo" : "=t" (a) : "f" (b)); | |
2661 | @end example | |
2662 | ||
2663 | This asm says that input B is not popped by the asm, and that | |
2664 | the asm pushes a result onto the reg-stack, ie, the stack is one | |
2665 | deeper after the asm than it was before. But, it is possible that | |
2666 | reload will think that it can use the same reg for both the input and | |
2667 | the output, if input B dies in this insn. | |
2668 | ||
2669 | If any input operand uses the @code{f} constraint, all output reg | |
2670 | constraints must use the @code{&} earlyclobber. | |
2671 | ||
2672 | The asm above would be written as | |
2673 | ||
2674 | @example | |
2675 | asm ("foo" : "=&t" (a) : "f" (b)); | |
2676 | @end example | |
2677 | ||
2678 | @item | |
2679 | Some operands need to be in particular places on the stack. All | |
2680 | output operands fall in this category --- there is no other way to | |
2681 | know which regs the outputs appear in unless the user indicates | |
2682 | this in the constraints. | |
2683 | ||
2684 | Output operands must specifically indicate which reg an output | |
2685 | appears in after an asm. @code{=f} is not allowed: the operand | |
2686 | constraints must select a class with a single reg. | |
2687 | ||
2688 | @item | |
2689 | Output operands may not be ``inserted'' between existing stack regs. | |
2690 | Since no 387 opcode uses a read/write operand, all output operands | |
2691 | are dead before the asm_operands, and are pushed by the asm_operands. | |
2692 | It makes no sense to push anywhere but the top of the reg-stack. | |
2693 | ||
2694 | Output operands must start at the top of the reg-stack: output | |
2695 | operands may not ``skip'' a reg. | |
2696 | ||
2697 | @item | |
2698 | Some asm statements may need extra stack space for internal | |
2699 | calculations. This can be guaranteed by clobbering stack registers | |
2700 | unrelated to the inputs and outputs. | |
2701 | ||
2702 | @end enumerate | |
2703 | ||
2704 | Here are a couple of reasonable asms to want to write. This asm | |
2705 | takes one input, which is internally popped, and produces two outputs. | |
2706 | ||
2707 | @example | |
2708 | asm ("fsincos" : "=t" (cos), "=u" (sin) : "0" (inp)); | |
2709 | @end example | |
2710 | ||
2711 | This asm takes two inputs, which are popped by the @code{fyl2xp1} opcode, | |
2712 | and replaces them with one output. The user must code the @code{st(1)} | |
2713 | clobber for reg-stack.c to know that @code{fyl2xp1} pops both inputs. | |
2714 | ||
2715 | @example | |
2716 | asm ("fyl2xp1" : "=t" (result) : "0" (x), "u" (y) : "st(1)"); | |
2717 | @end example | |
2718 | ||
c1f7febf RK |
2719 | @ifclear INTERNALS |
2720 | @c Show the details on constraints if they do not appear elsewhere in | |
2721 | @c the manual | |
2722 | @include md.texi | |
2723 | @end ifclear | |
2724 | ||
2725 | @node Asm Labels | |
2726 | @section Controlling Names Used in Assembler Code | |
2727 | @cindex assembler names for identifiers | |
2728 | @cindex names used in assembler code | |
2729 | @cindex identifiers, names in assembler code | |
2730 | ||
2731 | You can specify the name to be used in the assembler code for a C | |
2732 | function or variable by writing the @code{asm} (or @code{__asm__}) | |
2733 | keyword after the declarator as follows: | |
2734 | ||
2735 | @example | |
2736 | int foo asm ("myfoo") = 2; | |
2737 | @end example | |
2738 | ||
2739 | @noindent | |
2740 | This specifies that the name to be used for the variable @code{foo} in | |
2741 | the assembler code should be @samp{myfoo} rather than the usual | |
2742 | @samp{_foo}. | |
2743 | ||
2744 | On systems where an underscore is normally prepended to the name of a C | |
2745 | function or variable, this feature allows you to define names for the | |
2746 | linker that do not start with an underscore. | |
2747 | ||
2748 | You cannot use @code{asm} in this way in a function @emph{definition}; but | |
2749 | you can get the same effect by writing a declaration for the function | |
2750 | before its definition and putting @code{asm} there, like this: | |
2751 | ||
2752 | @example | |
2753 | extern func () asm ("FUNC"); | |
2754 | ||
2755 | func (x, y) | |
2756 | int x, y; | |
2757 | @dots{} | |
2758 | @end example | |
2759 | ||
2760 | It is up to you to make sure that the assembler names you choose do not | |
2761 | conflict with any other assembler symbols. Also, you must not use a | |
2762 | register name; that would produce completely invalid assembler code. GNU | |
2763 | CC does not as yet have the ability to store static variables in registers. | |
2764 | Perhaps that will be added. | |
2765 | ||
2766 | @node Explicit Reg Vars | |
2767 | @section Variables in Specified Registers | |
2768 | @cindex explicit register variables | |
2769 | @cindex variables in specified registers | |
2770 | @cindex specified registers | |
2771 | @cindex registers, global allocation | |
2772 | ||
2773 | GNU C allows you to put a few global variables into specified hardware | |
2774 | registers. You can also specify the register in which an ordinary | |
2775 | register variable should be allocated. | |
2776 | ||
2777 | @itemize @bullet | |
2778 | @item | |
2779 | Global register variables reserve registers throughout the program. | |
2780 | This may be useful in programs such as programming language | |
2781 | interpreters which have a couple of global variables that are accessed | |
2782 | very often. | |
2783 | ||
2784 | @item | |
2785 | Local register variables in specific registers do not reserve the | |
2786 | registers. The compiler's data flow analysis is capable of determining | |
2787 | where the specified registers contain live values, and where they are | |
8d344fbc | 2788 | available for other uses. Stores into local register variables may be deleted |
0deaf590 JL |
2789 | when they appear to be dead according to dataflow analysis. References |
2790 | to local register variables may be deleted or moved or simplified. | |
c1f7febf RK |
2791 | |
2792 | These local variables are sometimes convenient for use with the extended | |
2793 | @code{asm} feature (@pxref{Extended Asm}), if you want to write one | |
2794 | output of the assembler instruction directly into a particular register. | |
2795 | (This will work provided the register you specify fits the constraints | |
2796 | specified for that operand in the @code{asm}.) | |
2797 | @end itemize | |
2798 | ||
2799 | @menu | |
2800 | * Global Reg Vars:: | |
2801 | * Local Reg Vars:: | |
2802 | @end menu | |
2803 | ||
2804 | @node Global Reg Vars | |
2805 | @subsection Defining Global Register Variables | |
2806 | @cindex global register variables | |
2807 | @cindex registers, global variables in | |
2808 | ||
2809 | You can define a global register variable in GNU C like this: | |
2810 | ||
2811 | @example | |
2812 | register int *foo asm ("a5"); | |
2813 | @end example | |
2814 | ||
2815 | @noindent | |
2816 | Here @code{a5} is the name of the register which should be used. Choose a | |
2817 | register which is normally saved and restored by function calls on your | |
2818 | machine, so that library routines will not clobber it. | |
2819 | ||
2820 | Naturally the register name is cpu-dependent, so you would need to | |
2821 | conditionalize your program according to cpu type. The register | |
2822 | @code{a5} would be a good choice on a 68000 for a variable of pointer | |
2823 | type. On machines with register windows, be sure to choose a ``global'' | |
2824 | register that is not affected magically by the function call mechanism. | |
2825 | ||
2826 | In addition, operating systems on one type of cpu may differ in how they | |
2827 | name the registers; then you would need additional conditionals. For | |
2828 | example, some 68000 operating systems call this register @code{%a5}. | |
2829 | ||
2830 | Eventually there may be a way of asking the compiler to choose a register | |
2831 | automatically, but first we need to figure out how it should choose and | |
2832 | how to enable you to guide the choice. No solution is evident. | |
2833 | ||
2834 | Defining a global register variable in a certain register reserves that | |
2835 | register entirely for this use, at least within the current compilation. | |
2836 | The register will not be allocated for any other purpose in the functions | |
2837 | in the current compilation. The register will not be saved and restored by | |
2838 | these functions. Stores into this register are never deleted even if they | |
2839 | would appear to be dead, but references may be deleted or moved or | |
2840 | simplified. | |
2841 | ||
2842 | It is not safe to access the global register variables from signal | |
2843 | handlers, or from more than one thread of control, because the system | |
2844 | library routines may temporarily use the register for other things (unless | |
2845 | you recompile them specially for the task at hand). | |
2846 | ||
2847 | @cindex @code{qsort}, and global register variables | |
2848 | It is not safe for one function that uses a global register variable to | |
2849 | call another such function @code{foo} by way of a third function | |
2850 | @code{lose} that was compiled without knowledge of this variable (i.e. in a | |
2851 | different source file in which the variable wasn't declared). This is | |
2852 | because @code{lose} might save the register and put some other value there. | |
2853 | For example, you can't expect a global register variable to be available in | |
2854 | the comparison-function that you pass to @code{qsort}, since @code{qsort} | |
2855 | might have put something else in that register. (If you are prepared to | |
2856 | recompile @code{qsort} with the same global register variable, you can | |
2857 | solve this problem.) | |
2858 | ||
2859 | If you want to recompile @code{qsort} or other source files which do not | |
2860 | actually use your global register variable, so that they will not use that | |
2861 | register for any other purpose, then it suffices to specify the compiler | |
2862 | option @samp{-ffixed-@var{reg}}. You need not actually add a global | |
2863 | register declaration to their source code. | |
2864 | ||
2865 | A function which can alter the value of a global register variable cannot | |
2866 | safely be called from a function compiled without this variable, because it | |
2867 | could clobber the value the caller expects to find there on return. | |
2868 | Therefore, the function which is the entry point into the part of the | |
2869 | program that uses the global register variable must explicitly save and | |
2870 | restore the value which belongs to its caller. | |
2871 | ||
2872 | @cindex register variable after @code{longjmp} | |
2873 | @cindex global register after @code{longjmp} | |
2874 | @cindex value after @code{longjmp} | |
2875 | @findex longjmp | |
2876 | @findex setjmp | |
2877 | On most machines, @code{longjmp} will restore to each global register | |
2878 | variable the value it had at the time of the @code{setjmp}. On some | |
2879 | machines, however, @code{longjmp} will not change the value of global | |
2880 | register variables. To be portable, the function that called @code{setjmp} | |
2881 | should make other arrangements to save the values of the global register | |
2882 | variables, and to restore them in a @code{longjmp}. This way, the same | |
2883 | thing will happen regardless of what @code{longjmp} does. | |
2884 | ||
2885 | All global register variable declarations must precede all function | |
2886 | definitions. If such a declaration could appear after function | |
2887 | definitions, the declaration would be too late to prevent the register from | |
2888 | being used for other purposes in the preceding functions. | |
2889 | ||
2890 | Global register variables may not have initial values, because an | |
2891 | executable file has no means to supply initial contents for a register. | |
2892 | ||
2893 | On the Sparc, there are reports that g3 @dots{} g7 are suitable | |
2894 | registers, but certain library functions, such as @code{getwd}, as well | |
2895 | as the subroutines for division and remainder, modify g3 and g4. g1 and | |
2896 | g2 are local temporaries. | |
2897 | ||
2898 | On the 68000, a2 @dots{} a5 should be suitable, as should d2 @dots{} d7. | |
2899 | Of course, it will not do to use more than a few of those. | |
2900 | ||
2901 | @node Local Reg Vars | |
2902 | @subsection Specifying Registers for Local Variables | |
2903 | @cindex local variables, specifying registers | |
2904 | @cindex specifying registers for local variables | |
2905 | @cindex registers for local variables | |
2906 | ||
2907 | You can define a local register variable with a specified register | |
2908 | like this: | |
2909 | ||
2910 | @example | |
2911 | register int *foo asm ("a5"); | |
2912 | @end example | |
2913 | ||
2914 | @noindent | |
2915 | Here @code{a5} is the name of the register which should be used. Note | |
2916 | that this is the same syntax used for defining global register | |
2917 | variables, but for a local variable it would appear within a function. | |
2918 | ||
2919 | Naturally the register name is cpu-dependent, but this is not a | |
2920 | problem, since specific registers are most often useful with explicit | |
2921 | assembler instructions (@pxref{Extended Asm}). Both of these things | |
2922 | generally require that you conditionalize your program according to | |
2923 | cpu type. | |
2924 | ||
2925 | In addition, operating systems on one type of cpu may differ in how they | |
2926 | name the registers; then you would need additional conditionals. For | |
2927 | example, some 68000 operating systems call this register @code{%a5}. | |
2928 | ||
c1f7febf RK |
2929 | Defining such a register variable does not reserve the register; it |
2930 | remains available for other uses in places where flow control determines | |
2931 | the variable's value is not live. However, these registers are made | |
e5e809f4 JL |
2932 | unavailable for use in the reload pass; excessive use of this feature |
2933 | leaves the compiler too few available registers to compile certain | |
2934 | functions. | |
2935 | ||
2936 | This option does not guarantee that GNU CC will generate code that has | |
2937 | this variable in the register you specify at all times. You may not | |
2938 | code an explicit reference to this register in an @code{asm} statement | |
2939 | and assume it will always refer to this variable. | |
c1f7febf | 2940 | |
8d344fbc | 2941 | Stores into local register variables may be deleted when they appear to be dead |
0deaf590 JL |
2942 | according to dataflow analysis. References to local register variables may |
2943 | be deleted or moved or simplified. | |
2944 | ||
c1f7febf RK |
2945 | @node Alternate Keywords |
2946 | @section Alternate Keywords | |
2947 | @cindex alternate keywords | |
2948 | @cindex keywords, alternate | |
2949 | ||
2950 | The option @samp{-traditional} disables certain keywords; @samp{-ansi} | |
2951 | disables certain others. This causes trouble when you want to use GNU C | |
2952 | extensions, or ANSI C features, in a general-purpose header file that | |
2953 | should be usable by all programs, including ANSI C programs and traditional | |
2954 | ones. The keywords @code{asm}, @code{typeof} and @code{inline} cannot be | |
2955 | used since they won't work in a program compiled with @samp{-ansi}, while | |
2956 | the keywords @code{const}, @code{volatile}, @code{signed}, @code{typeof} | |
2957 | and @code{inline} won't work in a program compiled with | |
2958 | @samp{-traditional}.@refill | |
2959 | ||
2960 | The way to solve these problems is to put @samp{__} at the beginning and | |
2961 | end of each problematical keyword. For example, use @code{__asm__} | |
2962 | instead of @code{asm}, @code{__const__} instead of @code{const}, and | |
2963 | @code{__inline__} instead of @code{inline}. | |
2964 | ||
2965 | Other C compilers won't accept these alternative keywords; if you want to | |
2966 | compile with another compiler, you can define the alternate keywords as | |
2967 | macros to replace them with the customary keywords. It looks like this: | |
2968 | ||
2969 | @example | |
2970 | #ifndef __GNUC__ | |
2971 | #define __asm__ asm | |
2972 | #endif | |
2973 | @end example | |
2974 | ||
6e6b0525 | 2975 | @findex __extension__ |
c1f7febf RK |
2976 | @samp{-pedantic} causes warnings for many GNU C extensions. You can |
2977 | prevent such warnings within one expression by writing | |
2978 | @code{__extension__} before the expression. @code{__extension__} has no | |
2979 | effect aside from this. | |
2980 | ||
2981 | @node Incomplete Enums | |
2982 | @section Incomplete @code{enum} Types | |
2983 | ||
2984 | You can define an @code{enum} tag without specifying its possible values. | |
2985 | This results in an incomplete type, much like what you get if you write | |
2986 | @code{struct foo} without describing the elements. A later declaration | |
2987 | which does specify the possible values completes the type. | |
2988 | ||
2989 | You can't allocate variables or storage using the type while it is | |
2990 | incomplete. However, you can work with pointers to that type. | |
2991 | ||
2992 | This extension may not be very useful, but it makes the handling of | |
2993 | @code{enum} more consistent with the way @code{struct} and @code{union} | |
2994 | are handled. | |
2995 | ||
2996 | This extension is not supported by GNU C++. | |
2997 | ||
2998 | @node Function Names | |
2999 | @section Function Names as Strings | |
3000 | ||
3001 | GNU CC predefines two string variables to be the name of the current function. | |
3002 | The variable @code{__FUNCTION__} is the name of the function as it appears | |
3003 | in the source. The variable @code{__PRETTY_FUNCTION__} is the name of | |
3004 | the function pretty printed in a language specific fashion. | |
3005 | ||
3006 | These names are always the same in a C function, but in a C++ function | |
3007 | they may be different. For example, this program: | |
3008 | ||
3009 | @smallexample | |
3010 | extern "C" @{ | |
3011 | extern int printf (char *, ...); | |
3012 | @} | |
3013 | ||
3014 | class a @{ | |
3015 | public: | |
3016 | sub (int i) | |
3017 | @{ | |
3018 | printf ("__FUNCTION__ = %s\n", __FUNCTION__); | |
3019 | printf ("__PRETTY_FUNCTION__ = %s\n", __PRETTY_FUNCTION__); | |
3020 | @} | |
3021 | @}; | |
3022 | ||
3023 | int | |
3024 | main (void) | |
3025 | @{ | |
3026 | a ax; | |
3027 | ax.sub (0); | |
3028 | return 0; | |
3029 | @} | |
3030 | @end smallexample | |
3031 | ||
3032 | @noindent | |
3033 | gives this output: | |
3034 | ||
3035 | @smallexample | |
3036 | __FUNCTION__ = sub | |
3037 | __PRETTY_FUNCTION__ = int a::sub (int) | |
3038 | @end smallexample | |
3039 | ||
3040 | These names are not macros: they are predefined string variables. | |
3041 | For example, @samp{#ifdef __FUNCTION__} does not have any special | |
3042 | meaning inside a function, since the preprocessor does not do anything | |
3043 | special with the identifier @code{__FUNCTION__}. | |
3044 | ||
3045 | @node Return Address | |
3046 | @section Getting the Return or Frame Address of a Function | |
3047 | ||
3048 | These functions may be used to get information about the callers of a | |
3049 | function. | |
3050 | ||
3051 | @table @code | |
185ebd6c | 3052 | @findex __builtin_return_address |
c1f7febf RK |
3053 | @item __builtin_return_address (@var{level}) |
3054 | This function returns the return address of the current function, or of | |
3055 | one of its callers. The @var{level} argument is number of frames to | |
3056 | scan up the call stack. A value of @code{0} yields the return address | |
3057 | of the current function, a value of @code{1} yields the return address | |
3058 | of the caller of the current function, and so forth. | |
3059 | ||
3060 | The @var{level} argument must be a constant integer. | |
3061 | ||
3062 | On some machines it may be impossible to determine the return address of | |
3063 | any function other than the current one; in such cases, or when the top | |
3064 | of the stack has been reached, this function will return @code{0}. | |
3065 | ||
3066 | This function should only be used with a non-zero argument for debugging | |
3067 | purposes. | |
3068 | ||
185ebd6c | 3069 | @findex __builtin_frame_address |
c1f7febf RK |
3070 | @item __builtin_frame_address (@var{level}) |
3071 | This function is similar to @code{__builtin_return_address}, but it | |
3072 | returns the address of the function frame rather than the return address | |
3073 | of the function. Calling @code{__builtin_frame_address} with a value of | |
3074 | @code{0} yields the frame address of the current function, a value of | |
3075 | @code{1} yields the frame address of the caller of the current function, | |
3076 | and so forth. | |
3077 | ||
3078 | The frame is the area on the stack which holds local variables and saved | |
3079 | registers. The frame address is normally the address of the first word | |
3080 | pushed on to the stack by the function. However, the exact definition | |
3081 | depends upon the processor and the calling convention. If the processor | |
3082 | has a dedicated frame pointer register, and the function has a frame, | |
3083 | then @code{__builtin_frame_address} will return the value of the frame | |
3084 | pointer register. | |
3085 | ||
3086 | The caveats that apply to @code{__builtin_return_address} apply to this | |
3087 | function as well. | |
3088 | @end table | |
3089 | ||
185ebd6c RH |
3090 | @node Other Builtins |
3091 | @section Other built-in functions provided by GNU CC | |
3092 | ||
3093 | GNU CC provides a large number of built-in functions other than the ones | |
3094 | mentioned above. Some of these are for internal use in the processing | |
3095 | of exceptions or variable-length argument lists and will not be | |
3096 | documented here because they may change from time to time; we do not | |
3097 | recommend general use of these functions. | |
3098 | ||
3099 | The remaining functions are provided for optimization purposes. | |
3100 | ||
3101 | GNU CC includes builtin versions of many of the functions in the | |
3102 | standard C library. These will always be treated as having the same | |
3103 | meaning as the C library function even if you specify the | |
3104 | @samp{-fno-builtin} (@pxref{C Dialect Options}) option. These functions | |
3105 | correspond to the C library functions @code{alloca}, @code{ffs}, | |
3106 | @code{abs}, @code{fabsf}, @code{fabs}, @code{fabsl}, @code{labs}, | |
3107 | @code{memcpy}, @code{memcmp}, @code{strcmp}, @code{strcpy}, | |
3108 | @code{strlen}, @code{sqrtf}, @code{sqrt}, @code{sqrtl}, @code{sinf}, | |
3109 | @code{sin}, @code{sinl}, @code{cosf}, @code{cos}, and @code{cosl}. | |
3110 | ||
3111 | @findex __builtin_constant_p | |
3112 | You can use the builtin function @code{__builtin_constant_p} to | |
3113 | determine if a value is known to be constant at compile-time and hence | |
3114 | that GNU CC can perform constant-folding on expressions involving that | |
3115 | value. The argument of the function is the value to test. The function | |
3116 | returns the integer 1 if the argument is known to be a compile-time | |
3117 | constant and 0 if it is not known to be a compile-time constant. A | |
3118 | return of 0 does not indicate that the value is @emph{not} a constant, | |
3119 | but merely that GNU CC cannot prove it is a constant with the specified | |
3120 | value of the @samp{-O} option. | |
3121 | ||
3122 | You would typically use this function in an embedded application where | |
3123 | memory was a critical resource. If you have some complex calculation, | |
3124 | you may want it to be folded if it involves constants, but need to call | |
3125 | a function if it does not. For example: | |
3126 | ||
4d390518 | 3127 | @smallexample |
185ebd6c RH |
3128 | #define Scale_Value(X) \ |
3129 | (__builtin_constant_p (X) ? ((X) * SCALE + OFFSET) : Scale (X)) | |
3130 | @end smallexample | |
3131 | ||
3132 | You may use this builtin function in either a macro or an inline | |
3133 | function. However, if you use it in an inlined function and pass an | |
3134 | argument of the function as the argument to the builtin, GNU CC will | |
3135 | never return 1 when you call the inline function with a string constant | |
3136 | or constructor expression (@pxref{Constructors}) and will not return 1 | |
3137 | when you pass a constant numeric value to the inline function unless you | |
3138 | specify the @samp{-O} option. | |
3139 | ||
2de45c06 ML |
3140 | @node Deprecated Features |
3141 | @section Deprecated Features | |
3142 | ||
3143 | In the past, the GNU C++ compiler was extended to experiment with new | |
3144 | features, at a time when the C++ language was still evolving. Now that | |
4a21803f | 3145 | the C++ standard is complete, some of those features are superseded by |
2de45c06 ML |
3146 | superior alternatives. Using the old features might cause a warning in |
3147 | some cases that the feature will be dropped in the future. In other | |
3148 | cases, the feature might be gone already. | |
3149 | ||
3150 | While the list below is not exhaustive, it documents some of the options | |
3151 | that are now deprecated: | |
3152 | ||
3153 | @table @code | |
3154 | @item -fthis-is-variable | |
3155 | In early versions of C++, assignment to this could be used to implement | |
3156 | application-defined memory allocation. Now, allocation functions | |
3157 | (@samp{operator new}) are the standard-conforming way to achieve the | |
3158 | same effect. | |
3159 | ||
3160 | @item -fexternal-templates | |
3161 | @itemx -falt-external-templates | |
3162 | These are two of the many ways for g++ to implement template | |
3163 | instantiation. @xref{Template Instantiation}. The C++ standard clearly | |
3164 | defines how template definitions have to be organized across | |
3165 | implementation units. g++ has an implicit instantiation mechanism that | |
3166 | should work just fine for standard-conforming code. | |
3167 | ||
3168 | @end table | |
3169 | ||
c1f7febf RK |
3170 | @node C++ Extensions |
3171 | @chapter Extensions to the C++ Language | |
3172 | @cindex extensions, C++ language | |
3173 | @cindex C++ language extensions | |
3174 | ||
3175 | The GNU compiler provides these extensions to the C++ language (and you | |
3176 | can also use most of the C language extensions in your C++ programs). If you | |
3177 | want to write code that checks whether these features are available, you can | |
3178 | test for the GNU compiler the same way as for C programs: check for a | |
3179 | predefined macro @code{__GNUC__}. You can also use @code{__GNUG__} to | |
3180 | test specifically for GNU C++ (@pxref{Standard Predefined,,Standard | |
3181 | Predefined Macros,cpp.info,The C Preprocessor}). | |
3182 | ||
3183 | @menu | |
3184 | * Naming Results:: Giving a name to C++ function return values. | |
3185 | * Min and Max:: C++ Minimum and maximum operators. | |
02cac427 | 3186 | * Volatiles:: What constitutes an access to a volatile object. |
c1f7febf RK |
3187 | * C++ Interface:: You can use a single C++ header file for both |
3188 | declarations and definitions. | |
3189 | * Template Instantiation:: Methods for ensuring that exactly one copy of | |
3190 | each needed template instantiation is emitted. | |
0ded1f18 JM |
3191 | * Bound member functions:: You can extract a function pointer to the |
3192 | method denoted by a @samp{->*} or @samp{.*} expression. | |
c1f7febf RK |
3193 | @end menu |
3194 | ||
3195 | @node Naming Results | |
3196 | @section Named Return Values in C++ | |
3197 | ||
3198 | @cindex @code{return}, in C++ function header | |
3199 | @cindex return value, named, in C++ | |
3200 | @cindex named return value in C++ | |
3201 | @cindex C++ named return value | |
3202 | GNU C++ extends the function-definition syntax to allow you to specify a | |
3203 | name for the result of a function outside the body of the definition, in | |
3204 | C++ programs: | |
3205 | ||
3206 | @example | |
3207 | @group | |
3208 | @var{type} | |
3209 | @var{functionname} (@var{args}) return @var{resultname}; | |
3210 | @{ | |
3211 | @dots{} | |
3212 | @var{body} | |
3213 | @dots{} | |
3214 | @} | |
3215 | @end group | |
3216 | @end example | |
3217 | ||
3218 | You can use this feature to avoid an extra constructor call when | |
3219 | a function result has a class type. For example, consider a function | |
3220 | @code{m}, declared as @w{@samp{X v = m ();}}, whose result is of class | |
3221 | @code{X}: | |
3222 | ||
3223 | @example | |
3224 | X | |
3225 | m () | |
3226 | @{ | |
3227 | X b; | |
3228 | b.a = 23; | |
3229 | return b; | |
3230 | @} | |
3231 | @end example | |
3232 | ||
3233 | @cindex implicit argument: return value | |
3234 | Although @code{m} appears to have no arguments, in fact it has one implicit | |
3235 | argument: the address of the return value. At invocation, the address | |
3236 | of enough space to hold @code{v} is sent in as the implicit argument. | |
3237 | Then @code{b} is constructed and its @code{a} field is set to the value | |
3238 | 23. Finally, a copy constructor (a constructor of the form @samp{X(X&)}) | |
3239 | is applied to @code{b}, with the (implicit) return value location as the | |
3240 | target, so that @code{v} is now bound to the return value. | |
3241 | ||
3242 | But this is wasteful. The local @code{b} is declared just to hold | |
3243 | something that will be copied right out. While a compiler that | |
3244 | combined an ``elision'' algorithm with interprocedural data flow | |
3245 | analysis could conceivably eliminate all of this, it is much more | |
3246 | practical to allow you to assist the compiler in generating | |
3247 | efficient code by manipulating the return value explicitly, | |
3248 | thus avoiding the local variable and copy constructor altogether. | |
3249 | ||
3250 | Using the extended GNU C++ function-definition syntax, you can avoid the | |
3251 | temporary allocation and copying by naming @code{r} as your return value | |
3252 | at the outset, and assigning to its @code{a} field directly: | |
3253 | ||
3254 | @example | |
3255 | X | |
3256 | m () return r; | |
3257 | @{ | |
3258 | r.a = 23; | |
3259 | @} | |
3260 | @end example | |
3261 | ||
3262 | @noindent | |
3263 | The declaration of @code{r} is a standard, proper declaration, whose effects | |
3264 | are executed @strong{before} any of the body of @code{m}. | |
3265 | ||
3266 | Functions of this type impose no additional restrictions; in particular, | |
3267 | you can execute @code{return} statements, or return implicitly by | |
3268 | reaching the end of the function body (``falling off the edge''). | |
3269 | Cases like | |
3270 | ||
3271 | @example | |
3272 | X | |
3273 | m () return r (23); | |
3274 | @{ | |
3275 | return; | |
3276 | @} | |
3277 | @end example | |
3278 | ||
3279 | @noindent | |
3280 | (or even @w{@samp{X m () return r (23); @{ @}}}) are unambiguous, since | |
3281 | the return value @code{r} has been initialized in either case. The | |
3282 | following code may be hard to read, but also works predictably: | |
3283 | ||
3284 | @example | |
3285 | X | |
3286 | m () return r; | |
3287 | @{ | |
3288 | X b; | |
3289 | return b; | |
3290 | @} | |
3291 | @end example | |
3292 | ||
3293 | The return value slot denoted by @code{r} is initialized at the outset, | |
3294 | but the statement @samp{return b;} overrides this value. The compiler | |
3295 | deals with this by destroying @code{r} (calling the destructor if there | |
3296 | is one, or doing nothing if there is not), and then reinitializing | |
3297 | @code{r} with @code{b}. | |
3298 | ||
3299 | This extension is provided primarily to help people who use overloaded | |
3300 | operators, where there is a great need to control not just the | |
3301 | arguments, but the return values of functions. For classes where the | |
3302 | copy constructor incurs a heavy performance penalty (especially in the | |
3303 | common case where there is a quick default constructor), this is a major | |
3304 | savings. The disadvantage of this extension is that you do not control | |
3305 | when the default constructor for the return value is called: it is | |
3306 | always called at the beginning. | |
3307 | ||
3308 | @node Min and Max | |
3309 | @section Minimum and Maximum Operators in C++ | |
3310 | ||
3311 | It is very convenient to have operators which return the ``minimum'' or the | |
3312 | ``maximum'' of two arguments. In GNU C++ (but not in GNU C), | |
3313 | ||
3314 | @table @code | |
3315 | @item @var{a} <? @var{b} | |
3316 | @findex <? | |
3317 | @cindex minimum operator | |
3318 | is the @dfn{minimum}, returning the smaller of the numeric values | |
3319 | @var{a} and @var{b}; | |
3320 | ||
3321 | @item @var{a} >? @var{b} | |
3322 | @findex >? | |
3323 | @cindex maximum operator | |
3324 | is the @dfn{maximum}, returning the larger of the numeric values @var{a} | |
3325 | and @var{b}. | |
3326 | @end table | |
3327 | ||
3328 | These operations are not primitive in ordinary C++, since you can | |
3329 | use a macro to return the minimum of two things in C++, as in the | |
3330 | following example. | |
3331 | ||
3332 | @example | |
3333 | #define MIN(X,Y) ((X) < (Y) ? : (X) : (Y)) | |
3334 | @end example | |
3335 | ||
3336 | @noindent | |
3337 | You might then use @w{@samp{int min = MIN (i, j);}} to set @var{min} to | |
3338 | the minimum value of variables @var{i} and @var{j}. | |
3339 | ||
3340 | However, side effects in @code{X} or @code{Y} may cause unintended | |
3341 | behavior. For example, @code{MIN (i++, j++)} will fail, incrementing | |
3342 | the smaller counter twice. A GNU C extension allows you to write safe | |
3343 | macros that avoid this kind of problem (@pxref{Naming Types,,Naming an | |
3344 | Expression's Type}). However, writing @code{MIN} and @code{MAX} as | |
3345 | macros also forces you to use function-call notation for a | |
3346 | fundamental arithmetic operation. Using GNU C++ extensions, you can | |
3347 | write @w{@samp{int min = i <? j;}} instead. | |
3348 | ||
3349 | Since @code{<?} and @code{>?} are built into the compiler, they properly | |
3350 | handle expressions with side-effects; @w{@samp{int min = i++ <? j++;}} | |
3351 | works correctly. | |
3352 | ||
02cac427 NS |
3353 | @node Volatiles |
3354 | @section When is a Volatile Object Accessed? | |
3355 | @cindex accessing volatiles | |
3356 | @cindex volatile read | |
3357 | @cindex volatile write | |
3358 | @cindex volatile access | |
3359 | ||
3360 | Both the C and C++ standard have the concept of volatile objects. These | |
3361 | are normally accessed by pointers and used for accessing hardware. The | |
3362 | standards encourage compilers to refrain from optimizations on | |
3363 | concerning accesses to volatile objects that it might perform on | |
3364 | non-volatile objects. The C standard leaves it implementation defined | |
3365 | as to what constitutes a volatile access. The C++ standard omits to | |
3366 | specify this, except to say that C++ should behave in a similar manner | |
3367 | to C with respect to volatiles, where possible. The minimum either | |
3368 | standard specifies is that at a sequence point all previous access to | |
3369 | volatile objects have stabilized and no subsequent accesses have | |
3370 | occurred. Thus an implementation is free to reorder and combine | |
3371 | volatile accesses which occur between sequence points, but cannot do so | |
3372 | for accesses across a sequence point. The use of volatiles does not | |
3373 | allow you to violate the restriction on updating objects multiple times | |
3374 | within a sequence point. | |
3375 | ||
3376 | In most expressions, it is intuitively obvious what is a read and what is | |
3377 | a write. For instance | |
3378 | ||
3379 | @example | |
3380 | volatile int *dst = <somevalue>; | |
3381 | volatile int *src = <someothervalue>; | |
3382 | *dst = *src; | |
3383 | @end example | |
3384 | ||
3385 | @noindent | |
3386 | will cause a read of the volatile object pointed to by @var{src} and stores the | |
3387 | value into the volatile object pointed to by @var{dst}. There is no | |
3388 | guarantee that these reads and writes are atomic, especially for objects | |
3389 | larger than @code{int}. | |
3390 | ||
3391 | Less obvious expressions are where something which looks like an access | |
3392 | is used in a void context. An example would be, | |
3393 | ||
3394 | @example | |
3395 | volatile int *src = <somevalue>; | |
3396 | *src; | |
3397 | @end example | |
3398 | ||
3399 | With C, such expressions are rvalues, and as rvalues cause a read of | |
3400 | the object, gcc interprets this as a read of the volatile being pointed | |
3401 | to. The C++ standard specifies that such expressions do not undergo | |
3402 | lvalue to rvalue conversion, and that the type of the dereferenced | |
3403 | object may be incomplete. The C++ standard does not specify explicitly | |
3404 | that it is this lvalue to rvalue conversion which is responsible for | |
3405 | causing an access. However, there is reason to believe that it is, | |
3406 | because otherwise certain simple expressions become undefined. However, | |
3407 | because it would surprise most programmers, g++ treats dereferencing a | |
3408 | pointer to volatile object of complete type in a void context as a read | |
3409 | of the object. When the object has incomplete type, g++ issues a | |
3410 | warning. | |
3411 | ||
3412 | @example | |
3413 | struct S; | |
3414 | struct T @{int m;@}; | |
3415 | volatile S *ptr1 = <somevalue>; | |
3416 | volatile T *ptr2 = <somevalue>; | |
3417 | *ptr1; | |
3418 | *ptr2; | |
3419 | @end example | |
3420 | ||
3421 | In this example, a warning is issued for @code{*ptr1}, and @code{*ptr2} | |
3422 | causes a read of the object pointed to. If you wish to force an error on | |
3423 | the first case, you must force a conversion to rvalue with, for instance | |
3424 | a static cast, @code{static_cast<S>(*ptr1)}. | |
3425 | ||
3426 | When using a reference to volatile, g++ does not treat equivalent | |
3427 | expressions as accesses to volatiles, but instead issues a warning that | |
3428 | no volatile is accessed. The rationale for this is that otherwise it | |
3429 | becomes difficult to determine where volatile access occur, and not | |
3430 | possible to ignore the return value from functions returning volatile | |
3431 | references. Again, if you wish to force a read, cast the reference to | |
3432 | an rvalue. | |
3433 | ||
c1f7febf RK |
3434 | @node C++ Interface |
3435 | @section Declarations and Definitions in One Header | |
3436 | ||
3437 | @cindex interface and implementation headers, C++ | |
3438 | @cindex C++ interface and implementation headers | |
3439 | C++ object definitions can be quite complex. In principle, your source | |
3440 | code will need two kinds of things for each object that you use across | |
3441 | more than one source file. First, you need an @dfn{interface} | |
3442 | specification, describing its structure with type declarations and | |
3443 | function prototypes. Second, you need the @dfn{implementation} itself. | |
3444 | It can be tedious to maintain a separate interface description in a | |
3445 | header file, in parallel to the actual implementation. It is also | |
3446 | dangerous, since separate interface and implementation definitions may | |
3447 | not remain parallel. | |
3448 | ||
3449 | @cindex pragmas, interface and implementation | |
3450 | With GNU C++, you can use a single header file for both purposes. | |
3451 | ||
3452 | @quotation | |
3453 | @emph{Warning:} The mechanism to specify this is in transition. For the | |
3454 | nonce, you must use one of two @code{#pragma} commands; in a future | |
3455 | release of GNU C++, an alternative mechanism will make these | |
3456 | @code{#pragma} commands unnecessary. | |
3457 | @end quotation | |
3458 | ||
3459 | The header file contains the full definitions, but is marked with | |
3460 | @samp{#pragma interface} in the source code. This allows the compiler | |
3461 | to use the header file only as an interface specification when ordinary | |
3462 | source files incorporate it with @code{#include}. In the single source | |
3463 | file where the full implementation belongs, you can use either a naming | |
3464 | convention or @samp{#pragma implementation} to indicate this alternate | |
3465 | use of the header file. | |
3466 | ||
3467 | @table @code | |
3468 | @item #pragma interface | |
3469 | @itemx #pragma interface "@var{subdir}/@var{objects}.h" | |
3470 | @kindex #pragma interface | |
3471 | Use this directive in @emph{header files} that define object classes, to save | |
3472 | space in most of the object files that use those classes. Normally, | |
3473 | local copies of certain information (backup copies of inline member | |
3474 | functions, debugging information, and the internal tables that implement | |
3475 | virtual functions) must be kept in each object file that includes class | |
3476 | definitions. You can use this pragma to avoid such duplication. When a | |
3477 | header file containing @samp{#pragma interface} is included in a | |
3478 | compilation, this auxiliary information will not be generated (unless | |
3479 | the main input source file itself uses @samp{#pragma implementation}). | |
3480 | Instead, the object files will contain references to be resolved at link | |
3481 | time. | |
3482 | ||
3483 | The second form of this directive is useful for the case where you have | |
3484 | multiple headers with the same name in different directories. If you | |
3485 | use this form, you must specify the same string to @samp{#pragma | |
3486 | implementation}. | |
3487 | ||
3488 | @item #pragma implementation | |
3489 | @itemx #pragma implementation "@var{objects}.h" | |
3490 | @kindex #pragma implementation | |
3491 | Use this pragma in a @emph{main input file}, when you want full output from | |
3492 | included header files to be generated (and made globally visible). The | |
3493 | included header file, in turn, should use @samp{#pragma interface}. | |
3494 | Backup copies of inline member functions, debugging information, and the | |
3495 | internal tables used to implement virtual functions are all generated in | |
3496 | implementation files. | |
3497 | ||
3498 | @cindex implied @code{#pragma implementation} | |
3499 | @cindex @code{#pragma implementation}, implied | |
3500 | @cindex naming convention, implementation headers | |
3501 | If you use @samp{#pragma implementation} with no argument, it applies to | |
3502 | an include file with the same basename@footnote{A file's @dfn{basename} | |
3503 | was the name stripped of all leading path information and of trailing | |
3504 | suffixes, such as @samp{.h} or @samp{.C} or @samp{.cc}.} as your source | |
3505 | file. For example, in @file{allclass.cc}, giving just | |
3506 | @samp{#pragma implementation} | |
3507 | by itself is equivalent to @samp{#pragma implementation "allclass.h"}. | |
3508 | ||
3509 | In versions of GNU C++ prior to 2.6.0 @file{allclass.h} was treated as | |
3510 | an implementation file whenever you would include it from | |
3511 | @file{allclass.cc} even if you never specified @samp{#pragma | |
3512 | implementation}. This was deemed to be more trouble than it was worth, | |
3513 | however, and disabled. | |
3514 | ||
3515 | If you use an explicit @samp{#pragma implementation}, it must appear in | |
3516 | your source file @emph{before} you include the affected header files. | |
3517 | ||
3518 | Use the string argument if you want a single implementation file to | |
3519 | include code from multiple header files. (You must also use | |
3520 | @samp{#include} to include the header file; @samp{#pragma | |
3521 | implementation} only specifies how to use the file---it doesn't actually | |
3522 | include it.) | |
3523 | ||
3524 | There is no way to split up the contents of a single header file into | |
3525 | multiple implementation files. | |
3526 | @end table | |
3527 | ||
3528 | @cindex inlining and C++ pragmas | |
3529 | @cindex C++ pragmas, effect on inlining | |
3530 | @cindex pragmas in C++, effect on inlining | |
3531 | @samp{#pragma implementation} and @samp{#pragma interface} also have an | |
3532 | effect on function inlining. | |
3533 | ||
3534 | If you define a class in a header file marked with @samp{#pragma | |
3535 | interface}, the effect on a function defined in that class is similar to | |
3536 | an explicit @code{extern} declaration---the compiler emits no code at | |
3537 | all to define an independent version of the function. Its definition | |
3538 | is used only for inlining with its callers. | |
3539 | ||
3540 | Conversely, when you include the same header file in a main source file | |
3541 | that declares it as @samp{#pragma implementation}, the compiler emits | |
3542 | code for the function itself; this defines a version of the function | |
3543 | that can be found via pointers (or by callers compiled without | |
3544 | inlining). If all calls to the function can be inlined, you can avoid | |
3545 | emitting the function by compiling with @samp{-fno-implement-inlines}. | |
3546 | If any calls were not inlined, you will get linker errors. | |
3547 | ||
3548 | @node Template Instantiation | |
3549 | @section Where's the Template? | |
3550 | ||
3551 | @cindex template instantiation | |
3552 | ||
3553 | C++ templates are the first language feature to require more | |
3554 | intelligence from the environment than one usually finds on a UNIX | |
3555 | system. Somehow the compiler and linker have to make sure that each | |
3556 | template instance occurs exactly once in the executable if it is needed, | |
3557 | and not at all otherwise. There are two basic approaches to this | |
3558 | problem, which I will refer to as the Borland model and the Cfront model. | |
3559 | ||
3560 | @table @asis | |
3561 | @item Borland model | |
3562 | Borland C++ solved the template instantiation problem by adding the code | |
469b759e JM |
3563 | equivalent of common blocks to their linker; the compiler emits template |
3564 | instances in each translation unit that uses them, and the linker | |
3565 | collapses them together. The advantage of this model is that the linker | |
3566 | only has to consider the object files themselves; there is no external | |
3567 | complexity to worry about. This disadvantage is that compilation time | |
3568 | is increased because the template code is being compiled repeatedly. | |
3569 | Code written for this model tends to include definitions of all | |
3570 | templates in the header file, since they must be seen to be | |
3571 | instantiated. | |
c1f7febf RK |
3572 | |
3573 | @item Cfront model | |
3574 | The AT&T C++ translator, Cfront, solved the template instantiation | |
3575 | problem by creating the notion of a template repository, an | |
469b759e JM |
3576 | automatically maintained place where template instances are stored. A |
3577 | more modern version of the repository works as follows: As individual | |
3578 | object files are built, the compiler places any template definitions and | |
3579 | instantiations encountered in the repository. At link time, the link | |
3580 | wrapper adds in the objects in the repository and compiles any needed | |
3581 | instances that were not previously emitted. The advantages of this | |
3582 | model are more optimal compilation speed and the ability to use the | |
3583 | system linker; to implement the Borland model a compiler vendor also | |
c1f7febf | 3584 | needs to replace the linker. The disadvantages are vastly increased |
469b759e JM |
3585 | complexity, and thus potential for error; for some code this can be |
3586 | just as transparent, but in practice it can been very difficult to build | |
c1f7febf | 3587 | multiple programs in one directory and one program in multiple |
469b759e JM |
3588 | directories. Code written for this model tends to separate definitions |
3589 | of non-inline member templates into a separate file, which should be | |
3590 | compiled separately. | |
c1f7febf RK |
3591 | @end table |
3592 | ||
469b759e | 3593 | When used with GNU ld version 2.8 or later on an ELF system such as |
a4b3b54a JM |
3594 | Linux/GNU or Solaris 2, or on Microsoft Windows, g++ supports the |
3595 | Borland model. On other systems, g++ implements neither automatic | |
3596 | model. | |
469b759e JM |
3597 | |
3598 | A future version of g++ will support a hybrid model whereby the compiler | |
3599 | will emit any instantiations for which the template definition is | |
3600 | included in the compile, and store template definitions and | |
3601 | instantiation context information into the object file for the rest. | |
3602 | The link wrapper will extract that information as necessary and invoke | |
3603 | the compiler to produce the remaining instantiations. The linker will | |
3604 | then combine duplicate instantiations. | |
3605 | ||
3606 | In the mean time, you have the following options for dealing with | |
3607 | template instantiations: | |
c1f7febf RK |
3608 | |
3609 | @enumerate | |
d863830b JL |
3610 | @item |
3611 | Compile your template-using code with @samp{-frepo}. The compiler will | |
3612 | generate files with the extension @samp{.rpo} listing all of the | |
3613 | template instantiations used in the corresponding object files which | |
3614 | could be instantiated there; the link wrapper, @samp{collect2}, will | |
3615 | then update the @samp{.rpo} files to tell the compiler where to place | |
3616 | those instantiations and rebuild any affected object files. The | |
3617 | link-time overhead is negligible after the first pass, as the compiler | |
3618 | will continue to place the instantiations in the same files. | |
3619 | ||
3620 | This is your best option for application code written for the Borland | |
3621 | model, as it will just work. Code written for the Cfront model will | |
3622 | need to be modified so that the template definitions are available at | |
3623 | one or more points of instantiation; usually this is as simple as adding | |
3624 | @code{#include <tmethods.cc>} to the end of each template header. | |
3625 | ||
3626 | For library code, if you want the library to provide all of the template | |
3627 | instantiations it needs, just try to link all of its object files | |
3628 | together; the link will fail, but cause the instantiations to be | |
3629 | generated as a side effect. Be warned, however, that this may cause | |
3630 | conflicts if multiple libraries try to provide the same instantiations. | |
3631 | For greater control, use explicit instantiation as described in the next | |
3632 | option. | |
3633 | ||
c1f7febf RK |
3634 | @item |
3635 | Compile your code with @samp{-fno-implicit-templates} to disable the | |
3636 | implicit generation of template instances, and explicitly instantiate | |
3637 | all the ones you use. This approach requires more knowledge of exactly | |
3638 | which instances you need than do the others, but it's less | |
3639 | mysterious and allows greater control. You can scatter the explicit | |
3640 | instantiations throughout your program, perhaps putting them in the | |
3641 | translation units where the instances are used or the translation units | |
3642 | that define the templates themselves; you can put all of the explicit | |
3643 | instantiations you need into one big file; or you can create small files | |
3644 | like | |
3645 | ||
3646 | @example | |
3647 | #include "Foo.h" | |
3648 | #include "Foo.cc" | |
3649 | ||
3650 | template class Foo<int>; | |
3651 | template ostream& operator << | |
3652 | (ostream&, const Foo<int>&); | |
3653 | @end example | |
3654 | ||
3655 | for each of the instances you need, and create a template instantiation | |
3656 | library from those. | |
3657 | ||
3658 | If you are using Cfront-model code, you can probably get away with not | |
3659 | using @samp{-fno-implicit-templates} when compiling files that don't | |
3660 | @samp{#include} the member template definitions. | |
3661 | ||
3662 | If you use one big file to do the instantiations, you may want to | |
3663 | compile it without @samp{-fno-implicit-templates} so you get all of the | |
3664 | instances required by your explicit instantiations (but not by any | |
3665 | other files) without having to specify them as well. | |
3666 | ||
3667 | g++ has extended the template instantiation syntax outlined in the | |
03d0f4af MM |
3668 | Working Paper to allow forward declaration of explicit instantiations |
3669 | and instantiation of the compiler support data for a template class | |
3670 | (i.e. the vtable) without instantiating any of its members: | |
c1f7febf RK |
3671 | |
3672 | @example | |
3673 | extern template int max (int, int); | |
c1f7febf RK |
3674 | inline template class Foo<int>; |
3675 | @end example | |
3676 | ||
3677 | @item | |
3678 | Do nothing. Pretend g++ does implement automatic instantiation | |
3679 | management. Code written for the Borland model will work fine, but | |
3680 | each translation unit will contain instances of each of the templates it | |
3681 | uses. In a large program, this can lead to an unacceptable amount of code | |
3682 | duplication. | |
3683 | ||
3684 | @item | |
3685 | Add @samp{#pragma interface} to all files containing template | |
3686 | definitions. For each of these files, add @samp{#pragma implementation | |
3687 | "@var{filename}"} to the top of some @samp{.C} file which | |
3688 | @samp{#include}s it. Then compile everything with | |
3689 | @samp{-fexternal-templates}. The templates will then only be expanded | |
3690 | in the translation unit which implements them (i.e. has a @samp{#pragma | |
3691 | implementation} line for the file where they live); all other files will | |
3692 | use external references. If you're lucky, everything should work | |
3693 | properly. If you get undefined symbol errors, you need to make sure | |
3694 | that each template instance which is used in the program is used in the | |
3695 | file which implements that template. If you don't have any use for a | |
3696 | particular instance in that file, you can just instantiate it | |
3697 | explicitly, using the syntax from the latest C++ working paper: | |
3698 | ||
3699 | @example | |
3700 | template class A<int>; | |
3701 | template ostream& operator << (ostream&, const A<int>&); | |
3702 | @end example | |
3703 | ||
3704 | This strategy will work with code written for either model. If you are | |
3705 | using code written for the Cfront model, the file containing a class | |
3706 | template and the file containing its member templates should be | |
3707 | implemented in the same translation unit. | |
3708 | ||
3709 | A slight variation on this approach is to instead use the flag | |
3710 | @samp{-falt-external-templates}; this flag causes template | |
3711 | instances to be emitted in the translation unit that implements the | |
3712 | header where they are first instantiated, rather than the one which | |
3713 | implements the file where the templates are defined. This header must | |
3714 | be the same in all translation units, or things are likely to break. | |
3715 | ||
3716 | @xref{C++ Interface,,Declarations and Definitions in One Header}, for | |
3717 | more discussion of these pragmas. | |
3718 | @end enumerate | |
3719 | ||
0ded1f18 JM |
3720 | @node Bound member functions |
3721 | @section Extracting the function pointer from a bound pointer to member function | |
3722 | ||
3723 | @cindex pmf | |
3724 | @cindex pointer to member function | |
3725 | @cindex bound pointer to member function | |
3726 | ||
3727 | In C++, pointer to member functions (PMFs) are implemented using a wide | |
3728 | pointer of sorts to handle all the possible call mechanisms; the PMF | |
3729 | needs to store information about how to adjust the @samp{this} pointer, | |
3730 | and if the function pointed to is virtual, where to find the vtable, and | |
3731 | where in the vtable to look for the member function. If you are using | |
3732 | PMFs in an inner loop, you should really reconsider that decision. If | |
3733 | that is not an option, you can extract the pointer to the function that | |
3734 | would be called for a given object/PMF pair and call it directly inside | |
3735 | the inner loop, to save a bit of time. | |
3736 | ||
3737 | Note that you will still be paying the penalty for the call through a | |
3738 | function pointer; on most modern architectures, such a call defeats the | |
3739 | branch prediction features of the CPU. This is also true of normal | |
3740 | virtual function calls. | |
3741 | ||
3742 | The syntax for this extension is | |
3743 | ||
3744 | @example | |
3745 | extern A a; | |
3746 | extern int (A::*fp)(); | |
3747 | typedef int (*fptr)(A *); | |
3748 | ||
3749 | fptr p = (fptr)(a.*fp); | |
3750 | @end example | |
3751 | ||
0fb6bbf5 ML |
3752 | For PMF constants (i.e. expressions of the form @samp{&Klasse::Member}), |
3753 | no object is needed to obtain the address of the function. They can be | |
3754 | converted to function pointers directly: | |
3755 | ||
3756 | @example | |
3757 | fptr p1 = (fptr)(&A::foo); | |
3758 | @end example | |
3759 | ||
0ded1f18 JM |
3760 | You must specify @samp{-Wno-pmf-conversions} to use this extension. |
3761 |