選択できるのは25トピックまでです。 トピックは、先頭が英数字で、英数字とダッシュ('-')を使用した35文字以内のものにしてください。

56863 行
2.6MB

  1. This is gccint.info, produced by makeinfo version 6.5 from gccint.texi.
  2. Copyright (C) 1988-2020 Free Software Foundation, Inc.
  3. Permission is granted to copy, distribute and/or modify this document
  4. under the terms of the GNU Free Documentation License, Version 1.3 or
  5. any later version published by the Free Software Foundation; with the
  6. Invariant Sections being "Funding Free Software", the Front-Cover Texts
  7. being (a) (see below), and with the Back-Cover Texts being (b) (see
  8. below). A copy of the license is included in the section entitled "GNU
  9. Free Documentation License".
  10. (a) The FSF's Front-Cover Text is:
  11. A GNU Manual
  12. (b) The FSF's Back-Cover Text is:
  13. You have freedom to copy and modify this GNU Manual, like GNU software.
  14. Copies published by the Free Software Foundation raise funds for GNU
  15. development.
  16. INFO-DIR-SECTION Software development
  17. START-INFO-DIR-ENTRY
  18. * gccint: (gccint). Internals of the GNU Compiler Collection.
  19. END-INFO-DIR-ENTRY
  20. This file documents the internals of the GNU compilers.
  21. Copyright (C) 1988-2020 Free Software Foundation, Inc.
  22. Permission is granted to copy, distribute and/or modify this document
  23. under the terms of the GNU Free Documentation License, Version 1.3 or
  24. any later version published by the Free Software Foundation; with the
  25. Invariant Sections being "Funding Free Software", the Front-Cover Texts
  26. being (a) (see below), and with the Back-Cover Texts being (b) (see
  27. below). A copy of the license is included in the section entitled "GNU
  28. Free Documentation License".
  29. (a) The FSF's Front-Cover Text is:
  30. A GNU Manual
  31. (b) The FSF's Back-Cover Text is:
  32. You have freedom to copy and modify this GNU Manual, like GNU software.
  33. Copies published by the Free Software Foundation raise funds for GNU
  34. development.
  35. 
  36. File: gccint.info, Node: Top, Next: Contributing
  37. Introduction
  38. ************
  39. This manual documents the internals of the GNU compilers, including how
  40. to port them to new targets and some information about how to write
  41. front ends for new languages. It corresponds to the compilers (GNU Arm
  42. Embedded Toolchain 10-2020-q4-major) version 10.2.1. The use of the GNU
  43. compilers is documented in a separate manual. *Note Introduction:
  44. (gcc)Top.
  45. This manual is mainly a reference manual rather than a tutorial. It
  46. discusses how to contribute to GCC (*note Contributing::), the
  47. characteristics of the machines supported by GCC as hosts and targets
  48. (*note Portability::), how GCC relates to the ABIs on such systems
  49. (*note Interface::), and the characteristics of the languages for which
  50. GCC front ends are written (*note Languages::). It then describes the
  51. GCC source tree structure and build system, some of the interfaces to
  52. GCC front ends, and how support for a target system is implemented in
  53. GCC.
  54. Additional tutorial information is linked to from
  55. <http://gcc.gnu.org/readings.html>.
  56. * Menu:
  57. * Contributing:: How to contribute to testing and developing GCC.
  58. * Portability:: Goals of GCC's portability features.
  59. * Interface:: Function-call interface of GCC output.
  60. * Libgcc:: Low-level runtime library used by GCC.
  61. * Languages:: Languages for which GCC front ends are written.
  62. * Source Tree:: GCC source tree structure and build system.
  63. * Testsuites:: GCC testsuites.
  64. * Options:: Option specification files.
  65. * Passes:: Order of passes, what they do, and what each file is for.
  66. * poly_int:: Representation of runtime sizes and offsets.
  67. * GENERIC:: Language-independent representation generated by Front Ends
  68. * GIMPLE:: Tuple representation used by Tree SSA optimizers
  69. * Tree SSA:: Analysis and optimization of GIMPLE
  70. * RTL:: Machine-dependent low-level intermediate representation.
  71. * Control Flow:: Maintaining and manipulating the control flow graph.
  72. * Loop Analysis and Representation:: Analysis and representation of loops
  73. * Machine Desc:: How to write machine description instruction patterns.
  74. * Target Macros:: How to write the machine description C macros and functions.
  75. * Host Config:: Writing the 'xm-MACHINE.h' file.
  76. * Fragments:: Writing the 't-TARGET' and 'x-HOST' files.
  77. * Collect2:: How 'collect2' works; how it finds 'ld'.
  78. * Header Dirs:: Understanding the standard header file directories.
  79. * Type Information:: GCC's memory management; generating type information.
  80. * Plugins:: Extending the compiler with plugins.
  81. * LTO:: Using Link-Time Optimization.
  82. * Match and Simplify:: How to write expression simplification patterns for GIMPLE and GENERIC
  83. * Static Analyzer:: Working with the static analyzer.
  84. * User Experience Guidelines:: Guidelines for implementing diagnostics and options.
  85. * Funding:: How to help assure funding for free software.
  86. * GNU Project:: The GNU Project and GNU/Linux.
  87. * Copying:: GNU General Public License says
  88. how you can copy and share GCC.
  89. * GNU Free Documentation License:: How you can copy and share this manual.
  90. * Contributors:: People who have contributed to GCC.
  91. * Option Index:: Index to command line options.
  92. * Concept Index:: Index of concepts and symbol names.
  93. 
  94. File: gccint.info, Node: Contributing, Next: Portability, Up: Top
  95. 1 Contributing to GCC Development
  96. *********************************
  97. If you would like to help pretest GCC releases to assure they work well,
  98. current development sources are available via Git (see
  99. <http://gcc.gnu.org/git.html>). Source and binary snapshots are also
  100. available for FTP; see <http://gcc.gnu.org/snapshots.html>.
  101. If you would like to work on improvements to GCC, please read the
  102. advice at these URLs:
  103. <http://gcc.gnu.org/contribute.html>
  104. <http://gcc.gnu.org/contributewhy.html>
  105. for information on how to make useful contributions and avoid
  106. duplication of effort. Suggested projects are listed at
  107. <http://gcc.gnu.org/projects/>.
  108. 
  109. File: gccint.info, Node: Portability, Next: Interface, Prev: Contributing, Up: Top
  110. 2 GCC and Portability
  111. *********************
  112. GCC itself aims to be portable to any machine where 'int' is at least a
  113. 32-bit type. It aims to target machines with a flat (non-segmented)
  114. byte addressed data address space (the code address space can be
  115. separate). Target ABIs may have 8, 16, 32 or 64-bit 'int' type. 'char'
  116. can be wider than 8 bits.
  117. GCC gets most of the information about the target machine from a
  118. machine description which gives an algebraic formula for each of the
  119. machine's instructions. This is a very clean way to describe the
  120. target. But when the compiler needs information that is difficult to
  121. express in this fashion, ad-hoc parameters have been defined for machine
  122. descriptions. The purpose of portability is to reduce the total work
  123. needed on the compiler; it was not of interest for its own sake.
  124. GCC does not contain machine dependent code, but it does contain code
  125. that depends on machine parameters such as endianness (whether the most
  126. significant byte has the highest or lowest address of the bytes in a
  127. word) and the availability of autoincrement addressing. In the
  128. RTL-generation pass, it is often necessary to have multiple strategies
  129. for generating code for a particular kind of syntax tree, strategies
  130. that are usable for different combinations of parameters. Often, not
  131. all possible cases have been addressed, but only the common ones or only
  132. the ones that have been encountered. As a result, a new target may
  133. require additional strategies. You will know if this happens because
  134. the compiler will call 'abort'. Fortunately, the new strategies can be
  135. added in a machine-independent fashion, and will affect only the target
  136. machines that need them.
  137. 
  138. File: gccint.info, Node: Interface, Next: Libgcc, Prev: Portability, Up: Top
  139. 3 Interfacing to GCC Output
  140. ***************************
  141. GCC is normally configured to use the same function calling convention
  142. normally in use on the target system. This is done with the
  143. machine-description macros described (*note Target Macros::).
  144. However, returning of structure and union values is done differently on
  145. some target machines. As a result, functions compiled with PCC
  146. returning such types cannot be called from code compiled with GCC, and
  147. vice versa. This does not cause trouble often because few Unix library
  148. routines return structures or unions.
  149. GCC code returns structures and unions that are 1, 2, 4 or 8 bytes long
  150. in the same registers used for 'int' or 'double' return values. (GCC
  151. typically allocates variables of such types in registers also.)
  152. Structures and unions of other sizes are returned by storing them into
  153. an address passed by the caller (usually in a register). The target
  154. hook 'TARGET_STRUCT_VALUE_RTX' tells GCC where to pass this address.
  155. By contrast, PCC on most target machines returns structures and unions
  156. of any size by copying the data into an area of static storage, and then
  157. returning the address of that storage as if it were a pointer value.
  158. The caller must copy the data from that memory area to the place where
  159. the value is wanted. This is slower than the method used by GCC, and
  160. fails to be reentrant.
  161. On some target machines, such as RISC machines and the 80386, the
  162. standard system convention is to pass to the subroutine the address of
  163. where to return the value. On these machines, GCC has been configured
  164. to be compatible with the standard compiler, when this method is used.
  165. It may not be compatible for structures of 1, 2, 4 or 8 bytes.
  166. GCC uses the system's standard convention for passing arguments. On
  167. some machines, the first few arguments are passed in registers; in
  168. others, all are passed on the stack. It would be possible to use
  169. registers for argument passing on any machine, and this would probably
  170. result in a significant speedup. But the result would be complete
  171. incompatibility with code that follows the standard convention. So this
  172. change is practical only if you are switching to GCC as the sole C
  173. compiler for the system. We may implement register argument passing on
  174. certain machines once we have a complete GNU system so that we can
  175. compile the libraries with GCC.
  176. On some machines (particularly the SPARC), certain types of arguments
  177. are passed "by invisible reference". This means that the value is
  178. stored in memory, and the address of the memory location is passed to
  179. the subroutine.
  180. If you use 'longjmp', beware of automatic variables. ISO C says that
  181. automatic variables that are not declared 'volatile' have undefined
  182. values after a 'longjmp'. And this is all GCC promises to do, because
  183. it is very difficult to restore register variables correctly, and one of
  184. GCC's features is that it can put variables in registers without your
  185. asking it to.
  186. 
  187. File: gccint.info, Node: Libgcc, Next: Languages, Prev: Interface, Up: Top
  188. 4 The GCC low-level runtime library
  189. ***********************************
  190. GCC provides a low-level runtime library, 'libgcc.a' or 'libgcc_s.so.1'
  191. on some platforms. GCC generates calls to routines in this library
  192. automatically, whenever it needs to perform some operation that is too
  193. complicated to emit inline code for.
  194. Most of the routines in 'libgcc' handle arithmetic operations that the
  195. target processor cannot perform directly. This includes integer
  196. multiply and divide on some machines, and all floating-point and
  197. fixed-point operations on other machines. 'libgcc' also includes
  198. routines for exception handling, and a handful of miscellaneous
  199. operations.
  200. Some of these routines can be defined in mostly machine-independent C.
  201. Others must be hand-written in assembly language for each processor that
  202. needs them.
  203. GCC will also generate calls to C library routines, such as 'memcpy'
  204. and 'memset', in some cases. The set of routines that GCC may possibly
  205. use is documented in *note (gcc)Other Builtins::.
  206. These routines take arguments and return values of a specific machine
  207. mode, not a specific C type. *Note Machine Modes::, for an explanation
  208. of this concept. For illustrative purposes, in this chapter the
  209. floating point type 'float' is assumed to correspond to 'SFmode';
  210. 'double' to 'DFmode'; and 'long double' to both 'TFmode' and 'XFmode'.
  211. Similarly, the integer types 'int' and 'unsigned int' correspond to
  212. 'SImode'; 'long' and 'unsigned long' to 'DImode'; and 'long long' and
  213. 'unsigned long long' to 'TImode'.
  214. * Menu:
  215. * Integer library routines::
  216. * Soft float library routines::
  217. * Decimal float library routines::
  218. * Fixed-point fractional library routines::
  219. * Exception handling routines::
  220. * Miscellaneous routines::
  221. 
  222. File: gccint.info, Node: Integer library routines, Next: Soft float library routines, Up: Libgcc
  223. 4.1 Routines for integer arithmetic
  224. ===================================
  225. The integer arithmetic routines are used on platforms that don't provide
  226. hardware support for arithmetic operations on some modes.
  227. 4.1.1 Arithmetic functions
  228. --------------------------
  229. -- Runtime Function: int __ashlsi3 (int A, int B)
  230. -- Runtime Function: long __ashldi3 (long A, int B)
  231. -- Runtime Function: long long __ashlti3 (long long A, int B)
  232. These functions return the result of shifting A left by B bits.
  233. -- Runtime Function: int __ashrsi3 (int A, int B)
  234. -- Runtime Function: long __ashrdi3 (long A, int B)
  235. -- Runtime Function: long long __ashrti3 (long long A, int B)
  236. These functions return the result of arithmetically shifting A
  237. right by B bits.
  238. -- Runtime Function: int __divsi3 (int A, int B)
  239. -- Runtime Function: long __divdi3 (long A, long B)
  240. -- Runtime Function: long long __divti3 (long long A, long long B)
  241. These functions return the quotient of the signed division of A and
  242. B.
  243. -- Runtime Function: int __lshrsi3 (int A, int B)
  244. -- Runtime Function: long __lshrdi3 (long A, int B)
  245. -- Runtime Function: long long __lshrti3 (long long A, int B)
  246. These functions return the result of logically shifting A right by
  247. B bits.
  248. -- Runtime Function: int __modsi3 (int A, int B)
  249. -- Runtime Function: long __moddi3 (long A, long B)
  250. -- Runtime Function: long long __modti3 (long long A, long long B)
  251. These functions return the remainder of the signed division of A
  252. and B.
  253. -- Runtime Function: int __mulsi3 (int A, int B)
  254. -- Runtime Function: long __muldi3 (long A, long B)
  255. -- Runtime Function: long long __multi3 (long long A, long long B)
  256. These functions return the product of A and B.
  257. -- Runtime Function: long __negdi2 (long A)
  258. -- Runtime Function: long long __negti2 (long long A)
  259. These functions return the negation of A.
  260. -- Runtime Function: unsigned int __udivsi3 (unsigned int A, unsigned
  261. int B)
  262. -- Runtime Function: unsigned long __udivdi3 (unsigned long A, unsigned
  263. long B)
  264. -- Runtime Function: unsigned long long __udivti3 (unsigned long long
  265. A, unsigned long long B)
  266. These functions return the quotient of the unsigned division of A
  267. and B.
  268. -- Runtime Function: unsigned long __udivmoddi4 (unsigned long A,
  269. unsigned long B, unsigned long *C)
  270. -- Runtime Function: unsigned long long __udivmodti4 (unsigned long
  271. long A, unsigned long long B, unsigned long long *C)
  272. These functions calculate both the quotient and remainder of the
  273. unsigned division of A and B. The return value is the quotient,
  274. and the remainder is placed in variable pointed to by C.
  275. -- Runtime Function: unsigned int __umodsi3 (unsigned int A, unsigned
  276. int B)
  277. -- Runtime Function: unsigned long __umoddi3 (unsigned long A, unsigned
  278. long B)
  279. -- Runtime Function: unsigned long long __umodti3 (unsigned long long
  280. A, unsigned long long B)
  281. These functions return the remainder of the unsigned division of A
  282. and B.
  283. 4.1.2 Comparison functions
  284. --------------------------
  285. The following functions implement integral comparisons. These functions
  286. implement a low-level compare, upon which the higher level comparison
  287. operators (such as less than and greater than or equal to) can be
  288. constructed. The returned values lie in the range zero to two, to allow
  289. the high-level operators to be implemented by testing the returned
  290. result using either signed or unsigned comparison.
  291. -- Runtime Function: int __cmpdi2 (long A, long B)
  292. -- Runtime Function: int __cmpti2 (long long A, long long B)
  293. These functions perform a signed comparison of A and B. If A is
  294. less than B, they return 0; if A is greater than B, they return 2;
  295. and if A and B are equal they return 1.
  296. -- Runtime Function: int __ucmpdi2 (unsigned long A, unsigned long B)
  297. -- Runtime Function: int __ucmpti2 (unsigned long long A, unsigned long
  298. long B)
  299. These functions perform an unsigned comparison of A and B. If A is
  300. less than B, they return 0; if A is greater than B, they return 2;
  301. and if A and B are equal they return 1.
  302. 4.1.3 Trapping arithmetic functions
  303. -----------------------------------
  304. The following functions implement trapping arithmetic. These functions
  305. call the libc function 'abort' upon signed arithmetic overflow.
  306. -- Runtime Function: int __absvsi2 (int A)
  307. -- Runtime Function: long __absvdi2 (long A)
  308. These functions return the absolute value of A.
  309. -- Runtime Function: int __addvsi3 (int A, int B)
  310. -- Runtime Function: long __addvdi3 (long A, long B)
  311. These functions return the sum of A and B; that is 'A + B'.
  312. -- Runtime Function: int __mulvsi3 (int A, int B)
  313. -- Runtime Function: long __mulvdi3 (long A, long B)
  314. The functions return the product of A and B; that is 'A * B'.
  315. -- Runtime Function: int __negvsi2 (int A)
  316. -- Runtime Function: long __negvdi2 (long A)
  317. These functions return the negation of A; that is '-A'.
  318. -- Runtime Function: int __subvsi3 (int A, int B)
  319. -- Runtime Function: long __subvdi3 (long A, long B)
  320. These functions return the difference between B and A; that is 'A -
  321. B'.
  322. 4.1.4 Bit operations
  323. --------------------
  324. -- Runtime Function: int __clzsi2 (unsigned int A)
  325. -- Runtime Function: int __clzdi2 (unsigned long A)
  326. -- Runtime Function: int __clzti2 (unsigned long long A)
  327. These functions return the number of leading 0-bits in A, starting
  328. at the most significant bit position. If A is zero, the result is
  329. undefined.
  330. -- Runtime Function: int __ctzsi2 (unsigned int A)
  331. -- Runtime Function: int __ctzdi2 (unsigned long A)
  332. -- Runtime Function: int __ctzti2 (unsigned long long A)
  333. These functions return the number of trailing 0-bits in A, starting
  334. at the least significant bit position. If A is zero, the result is
  335. undefined.
  336. -- Runtime Function: int __ffsdi2 (unsigned long A)
  337. -- Runtime Function: int __ffsti2 (unsigned long long A)
  338. These functions return the index of the least significant 1-bit in
  339. A, or the value zero if A is zero. The least significant bit is
  340. index one.
  341. -- Runtime Function: int __paritysi2 (unsigned int A)
  342. -- Runtime Function: int __paritydi2 (unsigned long A)
  343. -- Runtime Function: int __parityti2 (unsigned long long A)
  344. These functions return the value zero if the number of bits set in
  345. A is even, and the value one otherwise.
  346. -- Runtime Function: int __popcountsi2 (unsigned int A)
  347. -- Runtime Function: int __popcountdi2 (unsigned long A)
  348. -- Runtime Function: int __popcountti2 (unsigned long long A)
  349. These functions return the number of bits set in A.
  350. -- Runtime Function: int32_t __bswapsi2 (int32_t A)
  351. -- Runtime Function: int64_t __bswapdi2 (int64_t A)
  352. These functions return the A byteswapped.
  353. 
  354. File: gccint.info, Node: Soft float library routines, Next: Decimal float library routines, Prev: Integer library routines, Up: Libgcc
  355. 4.2 Routines for floating point emulation
  356. =========================================
  357. The software floating point library is used on machines which do not
  358. have hardware support for floating point. It is also used whenever
  359. '-msoft-float' is used to disable generation of floating point
  360. instructions. (Not all targets support this switch.)
  361. For compatibility with other compilers, the floating point emulation
  362. routines can be renamed with the 'DECLARE_LIBRARY_RENAMES' macro (*note
  363. Library Calls::). In this section, the default names are used.
  364. Presently the library does not support 'XFmode', which is used for
  365. 'long double' on some architectures.
  366. 4.2.1 Arithmetic functions
  367. --------------------------
  368. -- Runtime Function: float __addsf3 (float A, float B)
  369. -- Runtime Function: double __adddf3 (double A, double B)
  370. -- Runtime Function: long double __addtf3 (long double A, long double
  371. B)
  372. -- Runtime Function: long double __addxf3 (long double A, long double
  373. B)
  374. These functions return the sum of A and B.
  375. -- Runtime Function: float __subsf3 (float A, float B)
  376. -- Runtime Function: double __subdf3 (double A, double B)
  377. -- Runtime Function: long double __subtf3 (long double A, long double
  378. B)
  379. -- Runtime Function: long double __subxf3 (long double A, long double
  380. B)
  381. These functions return the difference between B and A; that is,
  382. A - B.
  383. -- Runtime Function: float __mulsf3 (float A, float B)
  384. -- Runtime Function: double __muldf3 (double A, double B)
  385. -- Runtime Function: long double __multf3 (long double A, long double
  386. B)
  387. -- Runtime Function: long double __mulxf3 (long double A, long double
  388. B)
  389. These functions return the product of A and B.
  390. -- Runtime Function: float __divsf3 (float A, float B)
  391. -- Runtime Function: double __divdf3 (double A, double B)
  392. -- Runtime Function: long double __divtf3 (long double A, long double
  393. B)
  394. -- Runtime Function: long double __divxf3 (long double A, long double
  395. B)
  396. These functions return the quotient of A and B; that is, A / B.
  397. -- Runtime Function: float __negsf2 (float A)
  398. -- Runtime Function: double __negdf2 (double A)
  399. -- Runtime Function: long double __negtf2 (long double A)
  400. -- Runtime Function: long double __negxf2 (long double A)
  401. These functions return the negation of A. They simply flip the
  402. sign bit, so they can produce negative zero and negative NaN.
  403. 4.2.2 Conversion functions
  404. --------------------------
  405. -- Runtime Function: double __extendsfdf2 (float A)
  406. -- Runtime Function: long double __extendsftf2 (float A)
  407. -- Runtime Function: long double __extendsfxf2 (float A)
  408. -- Runtime Function: long double __extenddftf2 (double A)
  409. -- Runtime Function: long double __extenddfxf2 (double A)
  410. These functions extend A to the wider mode of their return type.
  411. -- Runtime Function: double __truncxfdf2 (long double A)
  412. -- Runtime Function: double __trunctfdf2 (long double A)
  413. -- Runtime Function: float __truncxfsf2 (long double A)
  414. -- Runtime Function: float __trunctfsf2 (long double A)
  415. -- Runtime Function: float __truncdfsf2 (double A)
  416. These functions truncate A to the narrower mode of their return
  417. type, rounding toward zero.
  418. -- Runtime Function: int __fixsfsi (float A)
  419. -- Runtime Function: int __fixdfsi (double A)
  420. -- Runtime Function: int __fixtfsi (long double A)
  421. -- Runtime Function: int __fixxfsi (long double A)
  422. These functions convert A to a signed integer, rounding toward
  423. zero.
  424. -- Runtime Function: long __fixsfdi (float A)
  425. -- Runtime Function: long __fixdfdi (double A)
  426. -- Runtime Function: long __fixtfdi (long double A)
  427. -- Runtime Function: long __fixxfdi (long double A)
  428. These functions convert A to a signed long, rounding toward zero.
  429. -- Runtime Function: long long __fixsfti (float A)
  430. -- Runtime Function: long long __fixdfti (double A)
  431. -- Runtime Function: long long __fixtfti (long double A)
  432. -- Runtime Function: long long __fixxfti (long double A)
  433. These functions convert A to a signed long long, rounding toward
  434. zero.
  435. -- Runtime Function: unsigned int __fixunssfsi (float A)
  436. -- Runtime Function: unsigned int __fixunsdfsi (double A)
  437. -- Runtime Function: unsigned int __fixunstfsi (long double A)
  438. -- Runtime Function: unsigned int __fixunsxfsi (long double A)
  439. These functions convert A to an unsigned integer, rounding toward
  440. zero. Negative values all become zero.
  441. -- Runtime Function: unsigned long __fixunssfdi (float A)
  442. -- Runtime Function: unsigned long __fixunsdfdi (double A)
  443. -- Runtime Function: unsigned long __fixunstfdi (long double A)
  444. -- Runtime Function: unsigned long __fixunsxfdi (long double A)
  445. These functions convert A to an unsigned long, rounding toward
  446. zero. Negative values all become zero.
  447. -- Runtime Function: unsigned long long __fixunssfti (float A)
  448. -- Runtime Function: unsigned long long __fixunsdfti (double A)
  449. -- Runtime Function: unsigned long long __fixunstfti (long double A)
  450. -- Runtime Function: unsigned long long __fixunsxfti (long double A)
  451. These functions convert A to an unsigned long long, rounding toward
  452. zero. Negative values all become zero.
  453. -- Runtime Function: float __floatsisf (int I)
  454. -- Runtime Function: double __floatsidf (int I)
  455. -- Runtime Function: long double __floatsitf (int I)
  456. -- Runtime Function: long double __floatsixf (int I)
  457. These functions convert I, a signed integer, to floating point.
  458. -- Runtime Function: float __floatdisf (long I)
  459. -- Runtime Function: double __floatdidf (long I)
  460. -- Runtime Function: long double __floatditf (long I)
  461. -- Runtime Function: long double __floatdixf (long I)
  462. These functions convert I, a signed long, to floating point.
  463. -- Runtime Function: float __floattisf (long long I)
  464. -- Runtime Function: double __floattidf (long long I)
  465. -- Runtime Function: long double __floattitf (long long I)
  466. -- Runtime Function: long double __floattixf (long long I)
  467. These functions convert I, a signed long long, to floating point.
  468. -- Runtime Function: float __floatunsisf (unsigned int I)
  469. -- Runtime Function: double __floatunsidf (unsigned int I)
  470. -- Runtime Function: long double __floatunsitf (unsigned int I)
  471. -- Runtime Function: long double __floatunsixf (unsigned int I)
  472. These functions convert I, an unsigned integer, to floating point.
  473. -- Runtime Function: float __floatundisf (unsigned long I)
  474. -- Runtime Function: double __floatundidf (unsigned long I)
  475. -- Runtime Function: long double __floatunditf (unsigned long I)
  476. -- Runtime Function: long double __floatundixf (unsigned long I)
  477. These functions convert I, an unsigned long, to floating point.
  478. -- Runtime Function: float __floatuntisf (unsigned long long I)
  479. -- Runtime Function: double __floatuntidf (unsigned long long I)
  480. -- Runtime Function: long double __floatuntitf (unsigned long long I)
  481. -- Runtime Function: long double __floatuntixf (unsigned long long I)
  482. These functions convert I, an unsigned long long, to floating
  483. point.
  484. 4.2.3 Comparison functions
  485. --------------------------
  486. There are two sets of basic comparison functions.
  487. -- Runtime Function: int __cmpsf2 (float A, float B)
  488. -- Runtime Function: int __cmpdf2 (double A, double B)
  489. -- Runtime Function: int __cmptf2 (long double A, long double B)
  490. These functions calculate a <=> b. That is, if A is less than B,
  491. they return -1; if A is greater than B, they return 1; and if A and
  492. B are equal they return 0. If either argument is NaN they return
  493. 1, but you should not rely on this; if NaN is a possibility, use
  494. one of the higher-level comparison functions.
  495. -- Runtime Function: int __unordsf2 (float A, float B)
  496. -- Runtime Function: int __unorddf2 (double A, double B)
  497. -- Runtime Function: int __unordtf2 (long double A, long double B)
  498. These functions return a nonzero value if either argument is NaN,
  499. otherwise 0.
  500. There is also a complete group of higher level functions which
  501. correspond directly to comparison operators. They implement the ISO C
  502. semantics for floating-point comparisons, taking NaN into account. Pay
  503. careful attention to the return values defined for each set. Under the
  504. hood, all of these routines are implemented as
  505. if (__unordXf2 (a, b))
  506. return E;
  507. return __cmpXf2 (a, b);
  508. where E is a constant chosen to give the proper behavior for NaN. Thus,
  509. the meaning of the return value is different for each set. Do not rely
  510. on this implementation; only the semantics documented below are
  511. guaranteed.
  512. -- Runtime Function: int __eqsf2 (float A, float B)
  513. -- Runtime Function: int __eqdf2 (double A, double B)
  514. -- Runtime Function: int __eqtf2 (long double A, long double B)
  515. These functions return zero if neither argument is NaN, and A and B
  516. are equal.
  517. -- Runtime Function: int __nesf2 (float A, float B)
  518. -- Runtime Function: int __nedf2 (double A, double B)
  519. -- Runtime Function: int __netf2 (long double A, long double B)
  520. These functions return a nonzero value if either argument is NaN,
  521. or if A and B are unequal.
  522. -- Runtime Function: int __gesf2 (float A, float B)
  523. -- Runtime Function: int __gedf2 (double A, double B)
  524. -- Runtime Function: int __getf2 (long double A, long double B)
  525. These functions return a value greater than or equal to zero if
  526. neither argument is NaN, and A is greater than or equal to B.
  527. -- Runtime Function: int __ltsf2 (float A, float B)
  528. -- Runtime Function: int __ltdf2 (double A, double B)
  529. -- Runtime Function: int __lttf2 (long double A, long double B)
  530. These functions return a value less than zero if neither argument
  531. is NaN, and A is strictly less than B.
  532. -- Runtime Function: int __lesf2 (float A, float B)
  533. -- Runtime Function: int __ledf2 (double A, double B)
  534. -- Runtime Function: int __letf2 (long double A, long double B)
  535. These functions return a value less than or equal to zero if
  536. neither argument is NaN, and A is less than or equal to B.
  537. -- Runtime Function: int __gtsf2 (float A, float B)
  538. -- Runtime Function: int __gtdf2 (double A, double B)
  539. -- Runtime Function: int __gttf2 (long double A, long double B)
  540. These functions return a value greater than zero if neither
  541. argument is NaN, and A is strictly greater than B.
  542. 4.2.4 Other floating-point functions
  543. ------------------------------------
  544. -- Runtime Function: float __powisf2 (float A, int B)
  545. -- Runtime Function: double __powidf2 (double A, int B)
  546. -- Runtime Function: long double __powitf2 (long double A, int B)
  547. -- Runtime Function: long double __powixf2 (long double A, int B)
  548. These functions convert raise A to the power B.
  549. -- Runtime Function: complex float __mulsc3 (float A, float B, float C,
  550. float D)
  551. -- Runtime Function: complex double __muldc3 (double A, double B,
  552. double C, double D)
  553. -- Runtime Function: complex long double __multc3 (long double A, long
  554. double B, long double C, long double D)
  555. -- Runtime Function: complex long double __mulxc3 (long double A, long
  556. double B, long double C, long double D)
  557. These functions return the product of A + iB and C + iD, following
  558. the rules of C99 Annex G.
  559. -- Runtime Function: complex float __divsc3 (float A, float B, float C,
  560. float D)
  561. -- Runtime Function: complex double __divdc3 (double A, double B,
  562. double C, double D)
  563. -- Runtime Function: complex long double __divtc3 (long double A, long
  564. double B, long double C, long double D)
  565. -- Runtime Function: complex long double __divxc3 (long double A, long
  566. double B, long double C, long double D)
  567. These functions return the quotient of A + iB and C + iD (i.e., (A
  568. + iB) / (C + iD)), following the rules of C99 Annex G.
  569. 
  570. File: gccint.info, Node: Decimal float library routines, Next: Fixed-point fractional library routines, Prev: Soft float library routines, Up: Libgcc
  571. 4.3 Routines for decimal floating point emulation
  572. =================================================
  573. The software decimal floating point library implements IEEE 754-2008
  574. decimal floating point arithmetic and is only activated on selected
  575. targets.
  576. The software decimal floating point library supports either DPD
  577. (Densely Packed Decimal) or BID (Binary Integer Decimal) encoding as
  578. selected at configure time.
  579. 4.3.1 Arithmetic functions
  580. --------------------------
  581. -- Runtime Function: _Decimal32 __dpd_addsd3 (_Decimal32 A, _Decimal32
  582. B)
  583. -- Runtime Function: _Decimal32 __bid_addsd3 (_Decimal32 A, _Decimal32
  584. B)
  585. -- Runtime Function: _Decimal64 __dpd_adddd3 (_Decimal64 A, _Decimal64
  586. B)
  587. -- Runtime Function: _Decimal64 __bid_adddd3 (_Decimal64 A, _Decimal64
  588. B)
  589. -- Runtime Function: _Decimal128 __dpd_addtd3 (_Decimal128 A,
  590. _Decimal128 B)
  591. -- Runtime Function: _Decimal128 __bid_addtd3 (_Decimal128 A,
  592. _Decimal128 B)
  593. These functions return the sum of A and B.
  594. -- Runtime Function: _Decimal32 __dpd_subsd3 (_Decimal32 A, _Decimal32
  595. B)
  596. -- Runtime Function: _Decimal32 __bid_subsd3 (_Decimal32 A, _Decimal32
  597. B)
  598. -- Runtime Function: _Decimal64 __dpd_subdd3 (_Decimal64 A, _Decimal64
  599. B)
  600. -- Runtime Function: _Decimal64 __bid_subdd3 (_Decimal64 A, _Decimal64
  601. B)
  602. -- Runtime Function: _Decimal128 __dpd_subtd3 (_Decimal128 A,
  603. _Decimal128 B)
  604. -- Runtime Function: _Decimal128 __bid_subtd3 (_Decimal128 A,
  605. _Decimal128 B)
  606. These functions return the difference between B and A; that is,
  607. A - B.
  608. -- Runtime Function: _Decimal32 __dpd_mulsd3 (_Decimal32 A, _Decimal32
  609. B)
  610. -- Runtime Function: _Decimal32 __bid_mulsd3 (_Decimal32 A, _Decimal32
  611. B)
  612. -- Runtime Function: _Decimal64 __dpd_muldd3 (_Decimal64 A, _Decimal64
  613. B)
  614. -- Runtime Function: _Decimal64 __bid_muldd3 (_Decimal64 A, _Decimal64
  615. B)
  616. -- Runtime Function: _Decimal128 __dpd_multd3 (_Decimal128 A,
  617. _Decimal128 B)
  618. -- Runtime Function: _Decimal128 __bid_multd3 (_Decimal128 A,
  619. _Decimal128 B)
  620. These functions return the product of A and B.
  621. -- Runtime Function: _Decimal32 __dpd_divsd3 (_Decimal32 A, _Decimal32
  622. B)
  623. -- Runtime Function: _Decimal32 __bid_divsd3 (_Decimal32 A, _Decimal32
  624. B)
  625. -- Runtime Function: _Decimal64 __dpd_divdd3 (_Decimal64 A, _Decimal64
  626. B)
  627. -- Runtime Function: _Decimal64 __bid_divdd3 (_Decimal64 A, _Decimal64
  628. B)
  629. -- Runtime Function: _Decimal128 __dpd_divtd3 (_Decimal128 A,
  630. _Decimal128 B)
  631. -- Runtime Function: _Decimal128 __bid_divtd3 (_Decimal128 A,
  632. _Decimal128 B)
  633. These functions return the quotient of A and B; that is, A / B.
  634. -- Runtime Function: _Decimal32 __dpd_negsd2 (_Decimal32 A)
  635. -- Runtime Function: _Decimal32 __bid_negsd2 (_Decimal32 A)
  636. -- Runtime Function: _Decimal64 __dpd_negdd2 (_Decimal64 A)
  637. -- Runtime Function: _Decimal64 __bid_negdd2 (_Decimal64 A)
  638. -- Runtime Function: _Decimal128 __dpd_negtd2 (_Decimal128 A)
  639. -- Runtime Function: _Decimal128 __bid_negtd2 (_Decimal128 A)
  640. These functions return the negation of A. They simply flip the
  641. sign bit, so they can produce negative zero and negative NaN.
  642. 4.3.2 Conversion functions
  643. --------------------------
  644. -- Runtime Function: _Decimal64 __dpd_extendsddd2 (_Decimal32 A)
  645. -- Runtime Function: _Decimal64 __bid_extendsddd2 (_Decimal32 A)
  646. -- Runtime Function: _Decimal128 __dpd_extendsdtd2 (_Decimal32 A)
  647. -- Runtime Function: _Decimal128 __bid_extendsdtd2 (_Decimal32 A)
  648. -- Runtime Function: _Decimal128 __dpd_extendddtd2 (_Decimal64 A)
  649. -- Runtime Function: _Decimal128 __bid_extendddtd2 (_Decimal64 A)
  650. -- Runtime Function: _Decimal32 __dpd_truncddsd2 (_Decimal64 A)
  651. -- Runtime Function: _Decimal32 __bid_truncddsd2 (_Decimal64 A)
  652. -- Runtime Function: _Decimal32 __dpd_trunctdsd2 (_Decimal128 A)
  653. -- Runtime Function: _Decimal32 __bid_trunctdsd2 (_Decimal128 A)
  654. -- Runtime Function: _Decimal64 __dpd_trunctddd2 (_Decimal128 A)
  655. -- Runtime Function: _Decimal64 __bid_trunctddd2 (_Decimal128 A)
  656. These functions convert the value A from one decimal floating type
  657. to another.
  658. -- Runtime Function: _Decimal64 __dpd_extendsfdd (float A)
  659. -- Runtime Function: _Decimal64 __bid_extendsfdd (float A)
  660. -- Runtime Function: _Decimal128 __dpd_extendsftd (float A)
  661. -- Runtime Function: _Decimal128 __bid_extendsftd (float A)
  662. -- Runtime Function: _Decimal128 __dpd_extenddftd (double A)
  663. -- Runtime Function: _Decimal128 __bid_extenddftd (double A)
  664. -- Runtime Function: _Decimal128 __dpd_extendxftd (long double A)
  665. -- Runtime Function: _Decimal128 __bid_extendxftd (long double A)
  666. -- Runtime Function: _Decimal32 __dpd_truncdfsd (double A)
  667. -- Runtime Function: _Decimal32 __bid_truncdfsd (double A)
  668. -- Runtime Function: _Decimal32 __dpd_truncxfsd (long double A)
  669. -- Runtime Function: _Decimal32 __bid_truncxfsd (long double A)
  670. -- Runtime Function: _Decimal32 __dpd_trunctfsd (long double A)
  671. -- Runtime Function: _Decimal32 __bid_trunctfsd (long double A)
  672. -- Runtime Function: _Decimal64 __dpd_truncxfdd (long double A)
  673. -- Runtime Function: _Decimal64 __bid_truncxfdd (long double A)
  674. -- Runtime Function: _Decimal64 __dpd_trunctfdd (long double A)
  675. -- Runtime Function: _Decimal64 __bid_trunctfdd (long double A)
  676. These functions convert the value of A from a binary floating type
  677. to a decimal floating type of a different size.
  678. -- Runtime Function: float __dpd_truncddsf (_Decimal64 A)
  679. -- Runtime Function: float __bid_truncddsf (_Decimal64 A)
  680. -- Runtime Function: float __dpd_trunctdsf (_Decimal128 A)
  681. -- Runtime Function: float __bid_trunctdsf (_Decimal128 A)
  682. -- Runtime Function: double __dpd_extendsddf (_Decimal32 A)
  683. -- Runtime Function: double __bid_extendsddf (_Decimal32 A)
  684. -- Runtime Function: double __dpd_trunctddf (_Decimal128 A)
  685. -- Runtime Function: double __bid_trunctddf (_Decimal128 A)
  686. -- Runtime Function: long double __dpd_extendsdxf (_Decimal32 A)
  687. -- Runtime Function: long double __bid_extendsdxf (_Decimal32 A)
  688. -- Runtime Function: long double __dpd_extendddxf (_Decimal64 A)
  689. -- Runtime Function: long double __bid_extendddxf (_Decimal64 A)
  690. -- Runtime Function: long double __dpd_trunctdxf (_Decimal128 A)
  691. -- Runtime Function: long double __bid_trunctdxf (_Decimal128 A)
  692. -- Runtime Function: long double __dpd_extendsdtf (_Decimal32 A)
  693. -- Runtime Function: long double __bid_extendsdtf (_Decimal32 A)
  694. -- Runtime Function: long double __dpd_extendddtf (_Decimal64 A)
  695. -- Runtime Function: long double __bid_extendddtf (_Decimal64 A)
  696. These functions convert the value of A from a decimal floating type
  697. to a binary floating type of a different size.
  698. -- Runtime Function: _Decimal32 __dpd_extendsfsd (float A)
  699. -- Runtime Function: _Decimal32 __bid_extendsfsd (float A)
  700. -- Runtime Function: _Decimal64 __dpd_extenddfdd (double A)
  701. -- Runtime Function: _Decimal64 __bid_extenddfdd (double A)
  702. -- Runtime Function: _Decimal128 __dpd_extendtftd (long double A)
  703. -- Runtime Function: _Decimal128 __bid_extendtftd (long double A)
  704. -- Runtime Function: float __dpd_truncsdsf (_Decimal32 A)
  705. -- Runtime Function: float __bid_truncsdsf (_Decimal32 A)
  706. -- Runtime Function: double __dpd_truncdddf (_Decimal64 A)
  707. -- Runtime Function: double __bid_truncdddf (_Decimal64 A)
  708. -- Runtime Function: long double __dpd_trunctdtf (_Decimal128 A)
  709. -- Runtime Function: long double __bid_trunctdtf (_Decimal128 A)
  710. These functions convert the value of A between decimal and binary
  711. floating types of the same size.
  712. -- Runtime Function: int __dpd_fixsdsi (_Decimal32 A)
  713. -- Runtime Function: int __bid_fixsdsi (_Decimal32 A)
  714. -- Runtime Function: int __dpd_fixddsi (_Decimal64 A)
  715. -- Runtime Function: int __bid_fixddsi (_Decimal64 A)
  716. -- Runtime Function: int __dpd_fixtdsi (_Decimal128 A)
  717. -- Runtime Function: int __bid_fixtdsi (_Decimal128 A)
  718. These functions convert A to a signed integer.
  719. -- Runtime Function: long __dpd_fixsddi (_Decimal32 A)
  720. -- Runtime Function: long __bid_fixsddi (_Decimal32 A)
  721. -- Runtime Function: long __dpd_fixdddi (_Decimal64 A)
  722. -- Runtime Function: long __bid_fixdddi (_Decimal64 A)
  723. -- Runtime Function: long __dpd_fixtddi (_Decimal128 A)
  724. -- Runtime Function: long __bid_fixtddi (_Decimal128 A)
  725. These functions convert A to a signed long.
  726. -- Runtime Function: unsigned int __dpd_fixunssdsi (_Decimal32 A)
  727. -- Runtime Function: unsigned int __bid_fixunssdsi (_Decimal32 A)
  728. -- Runtime Function: unsigned int __dpd_fixunsddsi (_Decimal64 A)
  729. -- Runtime Function: unsigned int __bid_fixunsddsi (_Decimal64 A)
  730. -- Runtime Function: unsigned int __dpd_fixunstdsi (_Decimal128 A)
  731. -- Runtime Function: unsigned int __bid_fixunstdsi (_Decimal128 A)
  732. These functions convert A to an unsigned integer. Negative values
  733. all become zero.
  734. -- Runtime Function: unsigned long __dpd_fixunssddi (_Decimal32 A)
  735. -- Runtime Function: unsigned long __bid_fixunssddi (_Decimal32 A)
  736. -- Runtime Function: unsigned long __dpd_fixunsdddi (_Decimal64 A)
  737. -- Runtime Function: unsigned long __bid_fixunsdddi (_Decimal64 A)
  738. -- Runtime Function: unsigned long __dpd_fixunstddi (_Decimal128 A)
  739. -- Runtime Function: unsigned long __bid_fixunstddi (_Decimal128 A)
  740. These functions convert A to an unsigned long. Negative values all
  741. become zero.
  742. -- Runtime Function: _Decimal32 __dpd_floatsisd (int I)
  743. -- Runtime Function: _Decimal32 __bid_floatsisd (int I)
  744. -- Runtime Function: _Decimal64 __dpd_floatsidd (int I)
  745. -- Runtime Function: _Decimal64 __bid_floatsidd (int I)
  746. -- Runtime Function: _Decimal128 __dpd_floatsitd (int I)
  747. -- Runtime Function: _Decimal128 __bid_floatsitd (int I)
  748. These functions convert I, a signed integer, to decimal floating
  749. point.
  750. -- Runtime Function: _Decimal32 __dpd_floatdisd (long I)
  751. -- Runtime Function: _Decimal32 __bid_floatdisd (long I)
  752. -- Runtime Function: _Decimal64 __dpd_floatdidd (long I)
  753. -- Runtime Function: _Decimal64 __bid_floatdidd (long I)
  754. -- Runtime Function: _Decimal128 __dpd_floatditd (long I)
  755. -- Runtime Function: _Decimal128 __bid_floatditd (long I)
  756. These functions convert I, a signed long, to decimal floating
  757. point.
  758. -- Runtime Function: _Decimal32 __dpd_floatunssisd (unsigned int I)
  759. -- Runtime Function: _Decimal32 __bid_floatunssisd (unsigned int I)
  760. -- Runtime Function: _Decimal64 __dpd_floatunssidd (unsigned int I)
  761. -- Runtime Function: _Decimal64 __bid_floatunssidd (unsigned int I)
  762. -- Runtime Function: _Decimal128 __dpd_floatunssitd (unsigned int I)
  763. -- Runtime Function: _Decimal128 __bid_floatunssitd (unsigned int I)
  764. These functions convert I, an unsigned integer, to decimal floating
  765. point.
  766. -- Runtime Function: _Decimal32 __dpd_floatunsdisd (unsigned long I)
  767. -- Runtime Function: _Decimal32 __bid_floatunsdisd (unsigned long I)
  768. -- Runtime Function: _Decimal64 __dpd_floatunsdidd (unsigned long I)
  769. -- Runtime Function: _Decimal64 __bid_floatunsdidd (unsigned long I)
  770. -- Runtime Function: _Decimal128 __dpd_floatunsditd (unsigned long I)
  771. -- Runtime Function: _Decimal128 __bid_floatunsditd (unsigned long I)
  772. These functions convert I, an unsigned long, to decimal floating
  773. point.
  774. 4.3.3 Comparison functions
  775. --------------------------
  776. -- Runtime Function: int __dpd_unordsd2 (_Decimal32 A, _Decimal32 B)
  777. -- Runtime Function: int __bid_unordsd2 (_Decimal32 A, _Decimal32 B)
  778. -- Runtime Function: int __dpd_unorddd2 (_Decimal64 A, _Decimal64 B)
  779. -- Runtime Function: int __bid_unorddd2 (_Decimal64 A, _Decimal64 B)
  780. -- Runtime Function: int __dpd_unordtd2 (_Decimal128 A, _Decimal128 B)
  781. -- Runtime Function: int __bid_unordtd2 (_Decimal128 A, _Decimal128 B)
  782. These functions return a nonzero value if either argument is NaN,
  783. otherwise 0.
  784. There is also a complete group of higher level functions which
  785. correspond directly to comparison operators. They implement the ISO C
  786. semantics for floating-point comparisons, taking NaN into account. Pay
  787. careful attention to the return values defined for each set. Under the
  788. hood, all of these routines are implemented as
  789. if (__bid_unordXd2 (a, b))
  790. return E;
  791. return __bid_cmpXd2 (a, b);
  792. where E is a constant chosen to give the proper behavior for NaN. Thus,
  793. the meaning of the return value is different for each set. Do not rely
  794. on this implementation; only the semantics documented below are
  795. guaranteed.
  796. -- Runtime Function: int __dpd_eqsd2 (_Decimal32 A, _Decimal32 B)
  797. -- Runtime Function: int __bid_eqsd2 (_Decimal32 A, _Decimal32 B)
  798. -- Runtime Function: int __dpd_eqdd2 (_Decimal64 A, _Decimal64 B)
  799. -- Runtime Function: int __bid_eqdd2 (_Decimal64 A, _Decimal64 B)
  800. -- Runtime Function: int __dpd_eqtd2 (_Decimal128 A, _Decimal128 B)
  801. -- Runtime Function: int __bid_eqtd2 (_Decimal128 A, _Decimal128 B)
  802. These functions return zero if neither argument is NaN, and A and B
  803. are equal.
  804. -- Runtime Function: int __dpd_nesd2 (_Decimal32 A, _Decimal32 B)
  805. -- Runtime Function: int __bid_nesd2 (_Decimal32 A, _Decimal32 B)
  806. -- Runtime Function: int __dpd_nedd2 (_Decimal64 A, _Decimal64 B)
  807. -- Runtime Function: int __bid_nedd2 (_Decimal64 A, _Decimal64 B)
  808. -- Runtime Function: int __dpd_netd2 (_Decimal128 A, _Decimal128 B)
  809. -- Runtime Function: int __bid_netd2 (_Decimal128 A, _Decimal128 B)
  810. These functions return a nonzero value if either argument is NaN,
  811. or if A and B are unequal.
  812. -- Runtime Function: int __dpd_gesd2 (_Decimal32 A, _Decimal32 B)
  813. -- Runtime Function: int __bid_gesd2 (_Decimal32 A, _Decimal32 B)
  814. -- Runtime Function: int __dpd_gedd2 (_Decimal64 A, _Decimal64 B)
  815. -- Runtime Function: int __bid_gedd2 (_Decimal64 A, _Decimal64 B)
  816. -- Runtime Function: int __dpd_getd2 (_Decimal128 A, _Decimal128 B)
  817. -- Runtime Function: int __bid_getd2 (_Decimal128 A, _Decimal128 B)
  818. These functions return a value greater than or equal to zero if
  819. neither argument is NaN, and A is greater than or equal to B.
  820. -- Runtime Function: int __dpd_ltsd2 (_Decimal32 A, _Decimal32 B)
  821. -- Runtime Function: int __bid_ltsd2 (_Decimal32 A, _Decimal32 B)
  822. -- Runtime Function: int __dpd_ltdd2 (_Decimal64 A, _Decimal64 B)
  823. -- Runtime Function: int __bid_ltdd2 (_Decimal64 A, _Decimal64 B)
  824. -- Runtime Function: int __dpd_lttd2 (_Decimal128 A, _Decimal128 B)
  825. -- Runtime Function: int __bid_lttd2 (_Decimal128 A, _Decimal128 B)
  826. These functions return a value less than zero if neither argument
  827. is NaN, and A is strictly less than B.
  828. -- Runtime Function: int __dpd_lesd2 (_Decimal32 A, _Decimal32 B)
  829. -- Runtime Function: int __bid_lesd2 (_Decimal32 A, _Decimal32 B)
  830. -- Runtime Function: int __dpd_ledd2 (_Decimal64 A, _Decimal64 B)
  831. -- Runtime Function: int __bid_ledd2 (_Decimal64 A, _Decimal64 B)
  832. -- Runtime Function: int __dpd_letd2 (_Decimal128 A, _Decimal128 B)
  833. -- Runtime Function: int __bid_letd2 (_Decimal128 A, _Decimal128 B)
  834. These functions return a value less than or equal to zero if
  835. neither argument is NaN, and A is less than or equal to B.
  836. -- Runtime Function: int __dpd_gtsd2 (_Decimal32 A, _Decimal32 B)
  837. -- Runtime Function: int __bid_gtsd2 (_Decimal32 A, _Decimal32 B)
  838. -- Runtime Function: int __dpd_gtdd2 (_Decimal64 A, _Decimal64 B)
  839. -- Runtime Function: int __bid_gtdd2 (_Decimal64 A, _Decimal64 B)
  840. -- Runtime Function: int __dpd_gttd2 (_Decimal128 A, _Decimal128 B)
  841. -- Runtime Function: int __bid_gttd2 (_Decimal128 A, _Decimal128 B)
  842. These functions return a value greater than zero if neither
  843. argument is NaN, and A is strictly greater than B.
  844. 
  845. File: gccint.info, Node: Fixed-point fractional library routines, Next: Exception handling routines, Prev: Decimal float library routines, Up: Libgcc
  846. 4.4 Routines for fixed-point fractional emulation
  847. =================================================
  848. The software fixed-point library implements fixed-point fractional
  849. arithmetic, and is only activated on selected targets.
  850. For ease of comprehension 'fract' is an alias for the '_Fract' type,
  851. 'accum' an alias for '_Accum', and 'sat' an alias for '_Sat'.
  852. For illustrative purposes, in this section the fixed-point fractional
  853. type 'short fract' is assumed to correspond to machine mode 'QQmode';
  854. 'unsigned short fract' to 'UQQmode'; 'fract' to 'HQmode';
  855. 'unsigned fract' to 'UHQmode'; 'long fract' to 'SQmode';
  856. 'unsigned long fract' to 'USQmode'; 'long long fract' to 'DQmode'; and
  857. 'unsigned long long fract' to 'UDQmode'. Similarly the fixed-point
  858. accumulator type 'short accum' corresponds to 'HAmode';
  859. 'unsigned short accum' to 'UHAmode'; 'accum' to 'SAmode';
  860. 'unsigned accum' to 'USAmode'; 'long accum' to 'DAmode';
  861. 'unsigned long accum' to 'UDAmode'; 'long long accum' to 'TAmode'; and
  862. 'unsigned long long accum' to 'UTAmode'.
  863. 4.4.1 Arithmetic functions
  864. --------------------------
  865. -- Runtime Function: short fract __addqq3 (short fract A, short fract
  866. B)
  867. -- Runtime Function: fract __addhq3 (fract A, fract B)
  868. -- Runtime Function: long fract __addsq3 (long fract A, long fract B)
  869. -- Runtime Function: long long fract __adddq3 (long long fract A, long
  870. long fract B)
  871. -- Runtime Function: unsigned short fract __adduqq3 (unsigned short
  872. fract A, unsigned short fract B)
  873. -- Runtime Function: unsigned fract __adduhq3 (unsigned fract A,
  874. unsigned fract B)
  875. -- Runtime Function: unsigned long fract __addusq3 (unsigned long fract
  876. A, unsigned long fract B)
  877. -- Runtime Function: unsigned long long fract __addudq3 (unsigned long
  878. long fract A, unsigned long long fract B)
  879. -- Runtime Function: short accum __addha3 (short accum A, short accum
  880. B)
  881. -- Runtime Function: accum __addsa3 (accum A, accum B)
  882. -- Runtime Function: long accum __addda3 (long accum A, long accum B)
  883. -- Runtime Function: long long accum __addta3 (long long accum A, long
  884. long accum B)
  885. -- Runtime Function: unsigned short accum __adduha3 (unsigned short
  886. accum A, unsigned short accum B)
  887. -- Runtime Function: unsigned accum __addusa3 (unsigned accum A,
  888. unsigned accum B)
  889. -- Runtime Function: unsigned long accum __adduda3 (unsigned long accum
  890. A, unsigned long accum B)
  891. -- Runtime Function: unsigned long long accum __adduta3 (unsigned long
  892. long accum A, unsigned long long accum B)
  893. These functions return the sum of A and B.
  894. -- Runtime Function: short fract __ssaddqq3 (short fract A, short fract
  895. B)
  896. -- Runtime Function: fract __ssaddhq3 (fract A, fract B)
  897. -- Runtime Function: long fract __ssaddsq3 (long fract A, long fract B)
  898. -- Runtime Function: long long fract __ssadddq3 (long long fract A,
  899. long long fract B)
  900. -- Runtime Function: short accum __ssaddha3 (short accum A, short accum
  901. B)
  902. -- Runtime Function: accum __ssaddsa3 (accum A, accum B)
  903. -- Runtime Function: long accum __ssaddda3 (long accum A, long accum B)
  904. -- Runtime Function: long long accum __ssaddta3 (long long accum A,
  905. long long accum B)
  906. These functions return the sum of A and B with signed saturation.
  907. -- Runtime Function: unsigned short fract __usadduqq3 (unsigned short
  908. fract A, unsigned short fract B)
  909. -- Runtime Function: unsigned fract __usadduhq3 (unsigned fract A,
  910. unsigned fract B)
  911. -- Runtime Function: unsigned long fract __usaddusq3 (unsigned long
  912. fract A, unsigned long fract B)
  913. -- Runtime Function: unsigned long long fract __usaddudq3 (unsigned
  914. long long fract A, unsigned long long fract B)
  915. -- Runtime Function: unsigned short accum __usadduha3 (unsigned short
  916. accum A, unsigned short accum B)
  917. -- Runtime Function: unsigned accum __usaddusa3 (unsigned accum A,
  918. unsigned accum B)
  919. -- Runtime Function: unsigned long accum __usadduda3 (unsigned long
  920. accum A, unsigned long accum B)
  921. -- Runtime Function: unsigned long long accum __usadduta3 (unsigned
  922. long long accum A, unsigned long long accum B)
  923. These functions return the sum of A and B with unsigned saturation.
  924. -- Runtime Function: short fract __subqq3 (short fract A, short fract
  925. B)
  926. -- Runtime Function: fract __subhq3 (fract A, fract B)
  927. -- Runtime Function: long fract __subsq3 (long fract A, long fract B)
  928. -- Runtime Function: long long fract __subdq3 (long long fract A, long
  929. long fract B)
  930. -- Runtime Function: unsigned short fract __subuqq3 (unsigned short
  931. fract A, unsigned short fract B)
  932. -- Runtime Function: unsigned fract __subuhq3 (unsigned fract A,
  933. unsigned fract B)
  934. -- Runtime Function: unsigned long fract __subusq3 (unsigned long fract
  935. A, unsigned long fract B)
  936. -- Runtime Function: unsigned long long fract __subudq3 (unsigned long
  937. long fract A, unsigned long long fract B)
  938. -- Runtime Function: short accum __subha3 (short accum A, short accum
  939. B)
  940. -- Runtime Function: accum __subsa3 (accum A, accum B)
  941. -- Runtime Function: long accum __subda3 (long accum A, long accum B)
  942. -- Runtime Function: long long accum __subta3 (long long accum A, long
  943. long accum B)
  944. -- Runtime Function: unsigned short accum __subuha3 (unsigned short
  945. accum A, unsigned short accum B)
  946. -- Runtime Function: unsigned accum __subusa3 (unsigned accum A,
  947. unsigned accum B)
  948. -- Runtime Function: unsigned long accum __subuda3 (unsigned long accum
  949. A, unsigned long accum B)
  950. -- Runtime Function: unsigned long long accum __subuta3 (unsigned long
  951. long accum A, unsigned long long accum B)
  952. These functions return the difference of A and B; that is, 'A - B'.
  953. -- Runtime Function: short fract __sssubqq3 (short fract A, short fract
  954. B)
  955. -- Runtime Function: fract __sssubhq3 (fract A, fract B)
  956. -- Runtime Function: long fract __sssubsq3 (long fract A, long fract B)
  957. -- Runtime Function: long long fract __sssubdq3 (long long fract A,
  958. long long fract B)
  959. -- Runtime Function: short accum __sssubha3 (short accum A, short accum
  960. B)
  961. -- Runtime Function: accum __sssubsa3 (accum A, accum B)
  962. -- Runtime Function: long accum __sssubda3 (long accum A, long accum B)
  963. -- Runtime Function: long long accum __sssubta3 (long long accum A,
  964. long long accum B)
  965. These functions return the difference of A and B with signed
  966. saturation; that is, 'A - B'.
  967. -- Runtime Function: unsigned short fract __ussubuqq3 (unsigned short
  968. fract A, unsigned short fract B)
  969. -- Runtime Function: unsigned fract __ussubuhq3 (unsigned fract A,
  970. unsigned fract B)
  971. -- Runtime Function: unsigned long fract __ussubusq3 (unsigned long
  972. fract A, unsigned long fract B)
  973. -- Runtime Function: unsigned long long fract __ussubudq3 (unsigned
  974. long long fract A, unsigned long long fract B)
  975. -- Runtime Function: unsigned short accum __ussubuha3 (unsigned short
  976. accum A, unsigned short accum B)
  977. -- Runtime Function: unsigned accum __ussubusa3 (unsigned accum A,
  978. unsigned accum B)
  979. -- Runtime Function: unsigned long accum __ussubuda3 (unsigned long
  980. accum A, unsigned long accum B)
  981. -- Runtime Function: unsigned long long accum __ussubuta3 (unsigned
  982. long long accum A, unsigned long long accum B)
  983. These functions return the difference of A and B with unsigned
  984. saturation; that is, 'A - B'.
  985. -- Runtime Function: short fract __mulqq3 (short fract A, short fract
  986. B)
  987. -- Runtime Function: fract __mulhq3 (fract A, fract B)
  988. -- Runtime Function: long fract __mulsq3 (long fract A, long fract B)
  989. -- Runtime Function: long long fract __muldq3 (long long fract A, long
  990. long fract B)
  991. -- Runtime Function: unsigned short fract __muluqq3 (unsigned short
  992. fract A, unsigned short fract B)
  993. -- Runtime Function: unsigned fract __muluhq3 (unsigned fract A,
  994. unsigned fract B)
  995. -- Runtime Function: unsigned long fract __mulusq3 (unsigned long fract
  996. A, unsigned long fract B)
  997. -- Runtime Function: unsigned long long fract __muludq3 (unsigned long
  998. long fract A, unsigned long long fract B)
  999. -- Runtime Function: short accum __mulha3 (short accum A, short accum
  1000. B)
  1001. -- Runtime Function: accum __mulsa3 (accum A, accum B)
  1002. -- Runtime Function: long accum __mulda3 (long accum A, long accum B)
  1003. -- Runtime Function: long long accum __multa3 (long long accum A, long
  1004. long accum B)
  1005. -- Runtime Function: unsigned short accum __muluha3 (unsigned short
  1006. accum A, unsigned short accum B)
  1007. -- Runtime Function: unsigned accum __mulusa3 (unsigned accum A,
  1008. unsigned accum B)
  1009. -- Runtime Function: unsigned long accum __muluda3 (unsigned long accum
  1010. A, unsigned long accum B)
  1011. -- Runtime Function: unsigned long long accum __muluta3 (unsigned long
  1012. long accum A, unsigned long long accum B)
  1013. These functions return the product of A and B.
  1014. -- Runtime Function: short fract __ssmulqq3 (short fract A, short fract
  1015. B)
  1016. -- Runtime Function: fract __ssmulhq3 (fract A, fract B)
  1017. -- Runtime Function: long fract __ssmulsq3 (long fract A, long fract B)
  1018. -- Runtime Function: long long fract __ssmuldq3 (long long fract A,
  1019. long long fract B)
  1020. -- Runtime Function: short accum __ssmulha3 (short accum A, short accum
  1021. B)
  1022. -- Runtime Function: accum __ssmulsa3 (accum A, accum B)
  1023. -- Runtime Function: long accum __ssmulda3 (long accum A, long accum B)
  1024. -- Runtime Function: long long accum __ssmulta3 (long long accum A,
  1025. long long accum B)
  1026. These functions return the product of A and B with signed
  1027. saturation.
  1028. -- Runtime Function: unsigned short fract __usmuluqq3 (unsigned short
  1029. fract A, unsigned short fract B)
  1030. -- Runtime Function: unsigned fract __usmuluhq3 (unsigned fract A,
  1031. unsigned fract B)
  1032. -- Runtime Function: unsigned long fract __usmulusq3 (unsigned long
  1033. fract A, unsigned long fract B)
  1034. -- Runtime Function: unsigned long long fract __usmuludq3 (unsigned
  1035. long long fract A, unsigned long long fract B)
  1036. -- Runtime Function: unsigned short accum __usmuluha3 (unsigned short
  1037. accum A, unsigned short accum B)
  1038. -- Runtime Function: unsigned accum __usmulusa3 (unsigned accum A,
  1039. unsigned accum B)
  1040. -- Runtime Function: unsigned long accum __usmuluda3 (unsigned long
  1041. accum A, unsigned long accum B)
  1042. -- Runtime Function: unsigned long long accum __usmuluta3 (unsigned
  1043. long long accum A, unsigned long long accum B)
  1044. These functions return the product of A and B with unsigned
  1045. saturation.
  1046. -- Runtime Function: short fract __divqq3 (short fract A, short fract
  1047. B)
  1048. -- Runtime Function: fract __divhq3 (fract A, fract B)
  1049. -- Runtime Function: long fract __divsq3 (long fract A, long fract B)
  1050. -- Runtime Function: long long fract __divdq3 (long long fract A, long
  1051. long fract B)
  1052. -- Runtime Function: short accum __divha3 (short accum A, short accum
  1053. B)
  1054. -- Runtime Function: accum __divsa3 (accum A, accum B)
  1055. -- Runtime Function: long accum __divda3 (long accum A, long accum B)
  1056. -- Runtime Function: long long accum __divta3 (long long accum A, long
  1057. long accum B)
  1058. These functions return the quotient of the signed division of A and
  1059. B.
  1060. -- Runtime Function: unsigned short fract __udivuqq3 (unsigned short
  1061. fract A, unsigned short fract B)
  1062. -- Runtime Function: unsigned fract __udivuhq3 (unsigned fract A,
  1063. unsigned fract B)
  1064. -- Runtime Function: unsigned long fract __udivusq3 (unsigned long
  1065. fract A, unsigned long fract B)
  1066. -- Runtime Function: unsigned long long fract __udivudq3 (unsigned long
  1067. long fract A, unsigned long long fract B)
  1068. -- Runtime Function: unsigned short accum __udivuha3 (unsigned short
  1069. accum A, unsigned short accum B)
  1070. -- Runtime Function: unsigned accum __udivusa3 (unsigned accum A,
  1071. unsigned accum B)
  1072. -- Runtime Function: unsigned long accum __udivuda3 (unsigned long
  1073. accum A, unsigned long accum B)
  1074. -- Runtime Function: unsigned long long accum __udivuta3 (unsigned long
  1075. long accum A, unsigned long long accum B)
  1076. These functions return the quotient of the unsigned division of A
  1077. and B.
  1078. -- Runtime Function: short fract __ssdivqq3 (short fract A, short fract
  1079. B)
  1080. -- Runtime Function: fract __ssdivhq3 (fract A, fract B)
  1081. -- Runtime Function: long fract __ssdivsq3 (long fract A, long fract B)
  1082. -- Runtime Function: long long fract __ssdivdq3 (long long fract A,
  1083. long long fract B)
  1084. -- Runtime Function: short accum __ssdivha3 (short accum A, short accum
  1085. B)
  1086. -- Runtime Function: accum __ssdivsa3 (accum A, accum B)
  1087. -- Runtime Function: long accum __ssdivda3 (long accum A, long accum B)
  1088. -- Runtime Function: long long accum __ssdivta3 (long long accum A,
  1089. long long accum B)
  1090. These functions return the quotient of the signed division of A and
  1091. B with signed saturation.
  1092. -- Runtime Function: unsigned short fract __usdivuqq3 (unsigned short
  1093. fract A, unsigned short fract B)
  1094. -- Runtime Function: unsigned fract __usdivuhq3 (unsigned fract A,
  1095. unsigned fract B)
  1096. -- Runtime Function: unsigned long fract __usdivusq3 (unsigned long
  1097. fract A, unsigned long fract B)
  1098. -- Runtime Function: unsigned long long fract __usdivudq3 (unsigned
  1099. long long fract A, unsigned long long fract B)
  1100. -- Runtime Function: unsigned short accum __usdivuha3 (unsigned short
  1101. accum A, unsigned short accum B)
  1102. -- Runtime Function: unsigned accum __usdivusa3 (unsigned accum A,
  1103. unsigned accum B)
  1104. -- Runtime Function: unsigned long accum __usdivuda3 (unsigned long
  1105. accum A, unsigned long accum B)
  1106. -- Runtime Function: unsigned long long accum __usdivuta3 (unsigned
  1107. long long accum A, unsigned long long accum B)
  1108. These functions return the quotient of the unsigned division of A
  1109. and B with unsigned saturation.
  1110. -- Runtime Function: short fract __negqq2 (short fract A)
  1111. -- Runtime Function: fract __neghq2 (fract A)
  1112. -- Runtime Function: long fract __negsq2 (long fract A)
  1113. -- Runtime Function: long long fract __negdq2 (long long fract A)
  1114. -- Runtime Function: unsigned short fract __neguqq2 (unsigned short
  1115. fract A)
  1116. -- Runtime Function: unsigned fract __neguhq2 (unsigned fract A)
  1117. -- Runtime Function: unsigned long fract __negusq2 (unsigned long fract
  1118. A)
  1119. -- Runtime Function: unsigned long long fract __negudq2 (unsigned long
  1120. long fract A)
  1121. -- Runtime Function: short accum __negha2 (short accum A)
  1122. -- Runtime Function: accum __negsa2 (accum A)
  1123. -- Runtime Function: long accum __negda2 (long accum A)
  1124. -- Runtime Function: long long accum __negta2 (long long accum A)
  1125. -- Runtime Function: unsigned short accum __neguha2 (unsigned short
  1126. accum A)
  1127. -- Runtime Function: unsigned accum __negusa2 (unsigned accum A)
  1128. -- Runtime Function: unsigned long accum __neguda2 (unsigned long accum
  1129. A)
  1130. -- Runtime Function: unsigned long long accum __neguta2 (unsigned long
  1131. long accum A)
  1132. These functions return the negation of A.
  1133. -- Runtime Function: short fract __ssnegqq2 (short fract A)
  1134. -- Runtime Function: fract __ssneghq2 (fract A)
  1135. -- Runtime Function: long fract __ssnegsq2 (long fract A)
  1136. -- Runtime Function: long long fract __ssnegdq2 (long long fract A)
  1137. -- Runtime Function: short accum __ssnegha2 (short accum A)
  1138. -- Runtime Function: accum __ssnegsa2 (accum A)
  1139. -- Runtime Function: long accum __ssnegda2 (long accum A)
  1140. -- Runtime Function: long long accum __ssnegta2 (long long accum A)
  1141. These functions return the negation of A with signed saturation.
  1142. -- Runtime Function: unsigned short fract __usneguqq2 (unsigned short
  1143. fract A)
  1144. -- Runtime Function: unsigned fract __usneguhq2 (unsigned fract A)
  1145. -- Runtime Function: unsigned long fract __usnegusq2 (unsigned long
  1146. fract A)
  1147. -- Runtime Function: unsigned long long fract __usnegudq2 (unsigned
  1148. long long fract A)
  1149. -- Runtime Function: unsigned short accum __usneguha2 (unsigned short
  1150. accum A)
  1151. -- Runtime Function: unsigned accum __usnegusa2 (unsigned accum A)
  1152. -- Runtime Function: unsigned long accum __usneguda2 (unsigned long
  1153. accum A)
  1154. -- Runtime Function: unsigned long long accum __usneguta2 (unsigned
  1155. long long accum A)
  1156. These functions return the negation of A with unsigned saturation.
  1157. -- Runtime Function: short fract __ashlqq3 (short fract A, int B)
  1158. -- Runtime Function: fract __ashlhq3 (fract A, int B)
  1159. -- Runtime Function: long fract __ashlsq3 (long fract A, int B)
  1160. -- Runtime Function: long long fract __ashldq3 (long long fract A, int
  1161. B)
  1162. -- Runtime Function: unsigned short fract __ashluqq3 (unsigned short
  1163. fract A, int B)
  1164. -- Runtime Function: unsigned fract __ashluhq3 (unsigned fract A, int
  1165. B)
  1166. -- Runtime Function: unsigned long fract __ashlusq3 (unsigned long
  1167. fract A, int B)
  1168. -- Runtime Function: unsigned long long fract __ashludq3 (unsigned long
  1169. long fract A, int B)
  1170. -- Runtime Function: short accum __ashlha3 (short accum A, int B)
  1171. -- Runtime Function: accum __ashlsa3 (accum A, int B)
  1172. -- Runtime Function: long accum __ashlda3 (long accum A, int B)
  1173. -- Runtime Function: long long accum __ashlta3 (long long accum A, int
  1174. B)
  1175. -- Runtime Function: unsigned short accum __ashluha3 (unsigned short
  1176. accum A, int B)
  1177. -- Runtime Function: unsigned accum __ashlusa3 (unsigned accum A, int
  1178. B)
  1179. -- Runtime Function: unsigned long accum __ashluda3 (unsigned long
  1180. accum A, int B)
  1181. -- Runtime Function: unsigned long long accum __ashluta3 (unsigned long
  1182. long accum A, int B)
  1183. These functions return the result of shifting A left by B bits.
  1184. -- Runtime Function: short fract __ashrqq3 (short fract A, int B)
  1185. -- Runtime Function: fract __ashrhq3 (fract A, int B)
  1186. -- Runtime Function: long fract __ashrsq3 (long fract A, int B)
  1187. -- Runtime Function: long long fract __ashrdq3 (long long fract A, int
  1188. B)
  1189. -- Runtime Function: short accum __ashrha3 (short accum A, int B)
  1190. -- Runtime Function: accum __ashrsa3 (accum A, int B)
  1191. -- Runtime Function: long accum __ashrda3 (long accum A, int B)
  1192. -- Runtime Function: long long accum __ashrta3 (long long accum A, int
  1193. B)
  1194. These functions return the result of arithmetically shifting A
  1195. right by B bits.
  1196. -- Runtime Function: unsigned short fract __lshruqq3 (unsigned short
  1197. fract A, int B)
  1198. -- Runtime Function: unsigned fract __lshruhq3 (unsigned fract A, int
  1199. B)
  1200. -- Runtime Function: unsigned long fract __lshrusq3 (unsigned long
  1201. fract A, int B)
  1202. -- Runtime Function: unsigned long long fract __lshrudq3 (unsigned long
  1203. long fract A, int B)
  1204. -- Runtime Function: unsigned short accum __lshruha3 (unsigned short
  1205. accum A, int B)
  1206. -- Runtime Function: unsigned accum __lshrusa3 (unsigned accum A, int
  1207. B)
  1208. -- Runtime Function: unsigned long accum __lshruda3 (unsigned long
  1209. accum A, int B)
  1210. -- Runtime Function: unsigned long long accum __lshruta3 (unsigned long
  1211. long accum A, int B)
  1212. These functions return the result of logically shifting A right by
  1213. B bits.
  1214. -- Runtime Function: fract __ssashlhq3 (fract A, int B)
  1215. -- Runtime Function: long fract __ssashlsq3 (long fract A, int B)
  1216. -- Runtime Function: long long fract __ssashldq3 (long long fract A,
  1217. int B)
  1218. -- Runtime Function: short accum __ssashlha3 (short accum A, int B)
  1219. -- Runtime Function: accum __ssashlsa3 (accum A, int B)
  1220. -- Runtime Function: long accum __ssashlda3 (long accum A, int B)
  1221. -- Runtime Function: long long accum __ssashlta3 (long long accum A,
  1222. int B)
  1223. These functions return the result of shifting A left by B bits with
  1224. signed saturation.
  1225. -- Runtime Function: unsigned short fract __usashluqq3 (unsigned short
  1226. fract A, int B)
  1227. -- Runtime Function: unsigned fract __usashluhq3 (unsigned fract A, int
  1228. B)
  1229. -- Runtime Function: unsigned long fract __usashlusq3 (unsigned long
  1230. fract A, int B)
  1231. -- Runtime Function: unsigned long long fract __usashludq3 (unsigned
  1232. long long fract A, int B)
  1233. -- Runtime Function: unsigned short accum __usashluha3 (unsigned short
  1234. accum A, int B)
  1235. -- Runtime Function: unsigned accum __usashlusa3 (unsigned accum A, int
  1236. B)
  1237. -- Runtime Function: unsigned long accum __usashluda3 (unsigned long
  1238. accum A, int B)
  1239. -- Runtime Function: unsigned long long accum __usashluta3 (unsigned
  1240. long long accum A, int B)
  1241. These functions return the result of shifting A left by B bits with
  1242. unsigned saturation.
  1243. 4.4.2 Comparison functions
  1244. --------------------------
  1245. The following functions implement fixed-point comparisons. These
  1246. functions implement a low-level compare, upon which the higher level
  1247. comparison operators (such as less than and greater than or equal to)
  1248. can be constructed. The returned values lie in the range zero to two,
  1249. to allow the high-level operators to be implemented by testing the
  1250. returned result using either signed or unsigned comparison.
  1251. -- Runtime Function: int __cmpqq2 (short fract A, short fract B)
  1252. -- Runtime Function: int __cmphq2 (fract A, fract B)
  1253. -- Runtime Function: int __cmpsq2 (long fract A, long fract B)
  1254. -- Runtime Function: int __cmpdq2 (long long fract A, long long fract
  1255. B)
  1256. -- Runtime Function: int __cmpuqq2 (unsigned short fract A, unsigned
  1257. short fract B)
  1258. -- Runtime Function: int __cmpuhq2 (unsigned fract A, unsigned fract B)
  1259. -- Runtime Function: int __cmpusq2 (unsigned long fract A, unsigned
  1260. long fract B)
  1261. -- Runtime Function: int __cmpudq2 (unsigned long long fract A,
  1262. unsigned long long fract B)
  1263. -- Runtime Function: int __cmpha2 (short accum A, short accum B)
  1264. -- Runtime Function: int __cmpsa2 (accum A, accum B)
  1265. -- Runtime Function: int __cmpda2 (long accum A, long accum B)
  1266. -- Runtime Function: int __cmpta2 (long long accum A, long long accum
  1267. B)
  1268. -- Runtime Function: int __cmpuha2 (unsigned short accum A, unsigned
  1269. short accum B)
  1270. -- Runtime Function: int __cmpusa2 (unsigned accum A, unsigned accum B)
  1271. -- Runtime Function: int __cmpuda2 (unsigned long accum A, unsigned
  1272. long accum B)
  1273. -- Runtime Function: int __cmputa2 (unsigned long long accum A,
  1274. unsigned long long accum B)
  1275. These functions perform a signed or unsigned comparison of A and B
  1276. (depending on the selected machine mode). If A is less than B,
  1277. they return 0; if A is greater than B, they return 2; and if A and
  1278. B are equal they return 1.
  1279. 4.4.3 Conversion functions
  1280. --------------------------
  1281. -- Runtime Function: fract __fractqqhq2 (short fract A)
  1282. -- Runtime Function: long fract __fractqqsq2 (short fract A)
  1283. -- Runtime Function: long long fract __fractqqdq2 (short fract A)
  1284. -- Runtime Function: short accum __fractqqha (short fract A)
  1285. -- Runtime Function: accum __fractqqsa (short fract A)
  1286. -- Runtime Function: long accum __fractqqda (short fract A)
  1287. -- Runtime Function: long long accum __fractqqta (short fract A)
  1288. -- Runtime Function: unsigned short fract __fractqquqq (short fract A)
  1289. -- Runtime Function: unsigned fract __fractqquhq (short fract A)
  1290. -- Runtime Function: unsigned long fract __fractqqusq (short fract A)
  1291. -- Runtime Function: unsigned long long fract __fractqqudq (short fract
  1292. A)
  1293. -- Runtime Function: unsigned short accum __fractqquha (short fract A)
  1294. -- Runtime Function: unsigned accum __fractqqusa (short fract A)
  1295. -- Runtime Function: unsigned long accum __fractqquda (short fract A)
  1296. -- Runtime Function: unsigned long long accum __fractqquta (short fract
  1297. A)
  1298. -- Runtime Function: signed char __fractqqqi (short fract A)
  1299. -- Runtime Function: short __fractqqhi (short fract A)
  1300. -- Runtime Function: int __fractqqsi (short fract A)
  1301. -- Runtime Function: long __fractqqdi (short fract A)
  1302. -- Runtime Function: long long __fractqqti (short fract A)
  1303. -- Runtime Function: float __fractqqsf (short fract A)
  1304. -- Runtime Function: double __fractqqdf (short fract A)
  1305. -- Runtime Function: short fract __fracthqqq2 (fract A)
  1306. -- Runtime Function: long fract __fracthqsq2 (fract A)
  1307. -- Runtime Function: long long fract __fracthqdq2 (fract A)
  1308. -- Runtime Function: short accum __fracthqha (fract A)
  1309. -- Runtime Function: accum __fracthqsa (fract A)
  1310. -- Runtime Function: long accum __fracthqda (fract A)
  1311. -- Runtime Function: long long accum __fracthqta (fract A)
  1312. -- Runtime Function: unsigned short fract __fracthquqq (fract A)
  1313. -- Runtime Function: unsigned fract __fracthquhq (fract A)
  1314. -- Runtime Function: unsigned long fract __fracthqusq (fract A)
  1315. -- Runtime Function: unsigned long long fract __fracthqudq (fract A)
  1316. -- Runtime Function: unsigned short accum __fracthquha (fract A)
  1317. -- Runtime Function: unsigned accum __fracthqusa (fract A)
  1318. -- Runtime Function: unsigned long accum __fracthquda (fract A)
  1319. -- Runtime Function: unsigned long long accum __fracthquta (fract A)
  1320. -- Runtime Function: signed char __fracthqqi (fract A)
  1321. -- Runtime Function: short __fracthqhi (fract A)
  1322. -- Runtime Function: int __fracthqsi (fract A)
  1323. -- Runtime Function: long __fracthqdi (fract A)
  1324. -- Runtime Function: long long __fracthqti (fract A)
  1325. -- Runtime Function: float __fracthqsf (fract A)
  1326. -- Runtime Function: double __fracthqdf (fract A)
  1327. -- Runtime Function: short fract __fractsqqq2 (long fract A)
  1328. -- Runtime Function: fract __fractsqhq2 (long fract A)
  1329. -- Runtime Function: long long fract __fractsqdq2 (long fract A)
  1330. -- Runtime Function: short accum __fractsqha (long fract A)
  1331. -- Runtime Function: accum __fractsqsa (long fract A)
  1332. -- Runtime Function: long accum __fractsqda (long fract A)
  1333. -- Runtime Function: long long accum __fractsqta (long fract A)
  1334. -- Runtime Function: unsigned short fract __fractsquqq (long fract A)
  1335. -- Runtime Function: unsigned fract __fractsquhq (long fract A)
  1336. -- Runtime Function: unsigned long fract __fractsqusq (long fract A)
  1337. -- Runtime Function: unsigned long long fract __fractsqudq (long fract
  1338. A)
  1339. -- Runtime Function: unsigned short accum __fractsquha (long fract A)
  1340. -- Runtime Function: unsigned accum __fractsqusa (long fract A)
  1341. -- Runtime Function: unsigned long accum __fractsquda (long fract A)
  1342. -- Runtime Function: unsigned long long accum __fractsquta (long fract
  1343. A)
  1344. -- Runtime Function: signed char __fractsqqi (long fract A)
  1345. -- Runtime Function: short __fractsqhi (long fract A)
  1346. -- Runtime Function: int __fractsqsi (long fract A)
  1347. -- Runtime Function: long __fractsqdi (long fract A)
  1348. -- Runtime Function: long long __fractsqti (long fract A)
  1349. -- Runtime Function: float __fractsqsf (long fract A)
  1350. -- Runtime Function: double __fractsqdf (long fract A)
  1351. -- Runtime Function: short fract __fractdqqq2 (long long fract A)
  1352. -- Runtime Function: fract __fractdqhq2 (long long fract A)
  1353. -- Runtime Function: long fract __fractdqsq2 (long long fract A)
  1354. -- Runtime Function: short accum __fractdqha (long long fract A)
  1355. -- Runtime Function: accum __fractdqsa (long long fract A)
  1356. -- Runtime Function: long accum __fractdqda (long long fract A)
  1357. -- Runtime Function: long long accum __fractdqta (long long fract A)
  1358. -- Runtime Function: unsigned short fract __fractdquqq (long long fract
  1359. A)
  1360. -- Runtime Function: unsigned fract __fractdquhq (long long fract A)
  1361. -- Runtime Function: unsigned long fract __fractdqusq (long long fract
  1362. A)
  1363. -- Runtime Function: unsigned long long fract __fractdqudq (long long
  1364. fract A)
  1365. -- Runtime Function: unsigned short accum __fractdquha (long long fract
  1366. A)
  1367. -- Runtime Function: unsigned accum __fractdqusa (long long fract A)
  1368. -- Runtime Function: unsigned long accum __fractdquda (long long fract
  1369. A)
  1370. -- Runtime Function: unsigned long long accum __fractdquta (long long
  1371. fract A)
  1372. -- Runtime Function: signed char __fractdqqi (long long fract A)
  1373. -- Runtime Function: short __fractdqhi (long long fract A)
  1374. -- Runtime Function: int __fractdqsi (long long fract A)
  1375. -- Runtime Function: long __fractdqdi (long long fract A)
  1376. -- Runtime Function: long long __fractdqti (long long fract A)
  1377. -- Runtime Function: float __fractdqsf (long long fract A)
  1378. -- Runtime Function: double __fractdqdf (long long fract A)
  1379. -- Runtime Function: short fract __fracthaqq (short accum A)
  1380. -- Runtime Function: fract __fracthahq (short accum A)
  1381. -- Runtime Function: long fract __fracthasq (short accum A)
  1382. -- Runtime Function: long long fract __fracthadq (short accum A)
  1383. -- Runtime Function: accum __fracthasa2 (short accum A)
  1384. -- Runtime Function: long accum __fracthada2 (short accum A)
  1385. -- Runtime Function: long long accum __fracthata2 (short accum A)
  1386. -- Runtime Function: unsigned short fract __fracthauqq (short accum A)
  1387. -- Runtime Function: unsigned fract __fracthauhq (short accum A)
  1388. -- Runtime Function: unsigned long fract __fracthausq (short accum A)
  1389. -- Runtime Function: unsigned long long fract __fracthaudq (short accum
  1390. A)
  1391. -- Runtime Function: unsigned short accum __fracthauha (short accum A)
  1392. -- Runtime Function: unsigned accum __fracthausa (short accum A)
  1393. -- Runtime Function: unsigned long accum __fracthauda (short accum A)
  1394. -- Runtime Function: unsigned long long accum __fracthauta (short accum
  1395. A)
  1396. -- Runtime Function: signed char __fracthaqi (short accum A)
  1397. -- Runtime Function: short __fracthahi (short accum A)
  1398. -- Runtime Function: int __fracthasi (short accum A)
  1399. -- Runtime Function: long __fracthadi (short accum A)
  1400. -- Runtime Function: long long __fracthati (short accum A)
  1401. -- Runtime Function: float __fracthasf (short accum A)
  1402. -- Runtime Function: double __fracthadf (short accum A)
  1403. -- Runtime Function: short fract __fractsaqq (accum A)
  1404. -- Runtime Function: fract __fractsahq (accum A)
  1405. -- Runtime Function: long fract __fractsasq (accum A)
  1406. -- Runtime Function: long long fract __fractsadq (accum A)
  1407. -- Runtime Function: short accum __fractsaha2 (accum A)
  1408. -- Runtime Function: long accum __fractsada2 (accum A)
  1409. -- Runtime Function: long long accum __fractsata2 (accum A)
  1410. -- Runtime Function: unsigned short fract __fractsauqq (accum A)
  1411. -- Runtime Function: unsigned fract __fractsauhq (accum A)
  1412. -- Runtime Function: unsigned long fract __fractsausq (accum A)
  1413. -- Runtime Function: unsigned long long fract __fractsaudq (accum A)
  1414. -- Runtime Function: unsigned short accum __fractsauha (accum A)
  1415. -- Runtime Function: unsigned accum __fractsausa (accum A)
  1416. -- Runtime Function: unsigned long accum __fractsauda (accum A)
  1417. -- Runtime Function: unsigned long long accum __fractsauta (accum A)
  1418. -- Runtime Function: signed char __fractsaqi (accum A)
  1419. -- Runtime Function: short __fractsahi (accum A)
  1420. -- Runtime Function: int __fractsasi (accum A)
  1421. -- Runtime Function: long __fractsadi (accum A)
  1422. -- Runtime Function: long long __fractsati (accum A)
  1423. -- Runtime Function: float __fractsasf (accum A)
  1424. -- Runtime Function: double __fractsadf (accum A)
  1425. -- Runtime Function: short fract __fractdaqq (long accum A)
  1426. -- Runtime Function: fract __fractdahq (long accum A)
  1427. -- Runtime Function: long fract __fractdasq (long accum A)
  1428. -- Runtime Function: long long fract __fractdadq (long accum A)
  1429. -- Runtime Function: short accum __fractdaha2 (long accum A)
  1430. -- Runtime Function: accum __fractdasa2 (long accum A)
  1431. -- Runtime Function: long long accum __fractdata2 (long accum A)
  1432. -- Runtime Function: unsigned short fract __fractdauqq (long accum A)
  1433. -- Runtime Function: unsigned fract __fractdauhq (long accum A)
  1434. -- Runtime Function: unsigned long fract __fractdausq (long accum A)
  1435. -- Runtime Function: unsigned long long fract __fractdaudq (long accum
  1436. A)
  1437. -- Runtime Function: unsigned short accum __fractdauha (long accum A)
  1438. -- Runtime Function: unsigned accum __fractdausa (long accum A)
  1439. -- Runtime Function: unsigned long accum __fractdauda (long accum A)
  1440. -- Runtime Function: unsigned long long accum __fractdauta (long accum
  1441. A)
  1442. -- Runtime Function: signed char __fractdaqi (long accum A)
  1443. -- Runtime Function: short __fractdahi (long accum A)
  1444. -- Runtime Function: int __fractdasi (long accum A)
  1445. -- Runtime Function: long __fractdadi (long accum A)
  1446. -- Runtime Function: long long __fractdati (long accum A)
  1447. -- Runtime Function: float __fractdasf (long accum A)
  1448. -- Runtime Function: double __fractdadf (long accum A)
  1449. -- Runtime Function: short fract __fracttaqq (long long accum A)
  1450. -- Runtime Function: fract __fracttahq (long long accum A)
  1451. -- Runtime Function: long fract __fracttasq (long long accum A)
  1452. -- Runtime Function: long long fract __fracttadq (long long accum A)
  1453. -- Runtime Function: short accum __fracttaha2 (long long accum A)
  1454. -- Runtime Function: accum __fracttasa2 (long long accum A)
  1455. -- Runtime Function: long accum __fracttada2 (long long accum A)
  1456. -- Runtime Function: unsigned short fract __fracttauqq (long long accum
  1457. A)
  1458. -- Runtime Function: unsigned fract __fracttauhq (long long accum A)
  1459. -- Runtime Function: unsigned long fract __fracttausq (long long accum
  1460. A)
  1461. -- Runtime Function: unsigned long long fract __fracttaudq (long long
  1462. accum A)
  1463. -- Runtime Function: unsigned short accum __fracttauha (long long accum
  1464. A)
  1465. -- Runtime Function: unsigned accum __fracttausa (long long accum A)
  1466. -- Runtime Function: unsigned long accum __fracttauda (long long accum
  1467. A)
  1468. -- Runtime Function: unsigned long long accum __fracttauta (long long
  1469. accum A)
  1470. -- Runtime Function: signed char __fracttaqi (long long accum A)
  1471. -- Runtime Function: short __fracttahi (long long accum A)
  1472. -- Runtime Function: int __fracttasi (long long accum A)
  1473. -- Runtime Function: long __fracttadi (long long accum A)
  1474. -- Runtime Function: long long __fracttati (long long accum A)
  1475. -- Runtime Function: float __fracttasf (long long accum A)
  1476. -- Runtime Function: double __fracttadf (long long accum A)
  1477. -- Runtime Function: short fract __fractuqqqq (unsigned short fract A)
  1478. -- Runtime Function: fract __fractuqqhq (unsigned short fract A)
  1479. -- Runtime Function: long fract __fractuqqsq (unsigned short fract A)
  1480. -- Runtime Function: long long fract __fractuqqdq (unsigned short fract
  1481. A)
  1482. -- Runtime Function: short accum __fractuqqha (unsigned short fract A)
  1483. -- Runtime Function: accum __fractuqqsa (unsigned short fract A)
  1484. -- Runtime Function: long accum __fractuqqda (unsigned short fract A)
  1485. -- Runtime Function: long long accum __fractuqqta (unsigned short fract
  1486. A)
  1487. -- Runtime Function: unsigned fract __fractuqquhq2 (unsigned short
  1488. fract A)
  1489. -- Runtime Function: unsigned long fract __fractuqqusq2 (unsigned short
  1490. fract A)
  1491. -- Runtime Function: unsigned long long fract __fractuqqudq2 (unsigned
  1492. short fract A)
  1493. -- Runtime Function: unsigned short accum __fractuqquha (unsigned short
  1494. fract A)
  1495. -- Runtime Function: unsigned accum __fractuqqusa (unsigned short fract
  1496. A)
  1497. -- Runtime Function: unsigned long accum __fractuqquda (unsigned short
  1498. fract A)
  1499. -- Runtime Function: unsigned long long accum __fractuqquta (unsigned
  1500. short fract A)
  1501. -- Runtime Function: signed char __fractuqqqi (unsigned short fract A)
  1502. -- Runtime Function: short __fractuqqhi (unsigned short fract A)
  1503. -- Runtime Function: int __fractuqqsi (unsigned short fract A)
  1504. -- Runtime Function: long __fractuqqdi (unsigned short fract A)
  1505. -- Runtime Function: long long __fractuqqti (unsigned short fract A)
  1506. -- Runtime Function: float __fractuqqsf (unsigned short fract A)
  1507. -- Runtime Function: double __fractuqqdf (unsigned short fract A)
  1508. -- Runtime Function: short fract __fractuhqqq (unsigned fract A)
  1509. -- Runtime Function: fract __fractuhqhq (unsigned fract A)
  1510. -- Runtime Function: long fract __fractuhqsq (unsigned fract A)
  1511. -- Runtime Function: long long fract __fractuhqdq (unsigned fract A)
  1512. -- Runtime Function: short accum __fractuhqha (unsigned fract A)
  1513. -- Runtime Function: accum __fractuhqsa (unsigned fract A)
  1514. -- Runtime Function: long accum __fractuhqda (unsigned fract A)
  1515. -- Runtime Function: long long accum __fractuhqta (unsigned fract A)
  1516. -- Runtime Function: unsigned short fract __fractuhquqq2 (unsigned
  1517. fract A)
  1518. -- Runtime Function: unsigned long fract __fractuhqusq2 (unsigned fract
  1519. A)
  1520. -- Runtime Function: unsigned long long fract __fractuhqudq2 (unsigned
  1521. fract A)
  1522. -- Runtime Function: unsigned short accum __fractuhquha (unsigned fract
  1523. A)
  1524. -- Runtime Function: unsigned accum __fractuhqusa (unsigned fract A)
  1525. -- Runtime Function: unsigned long accum __fractuhquda (unsigned fract
  1526. A)
  1527. -- Runtime Function: unsigned long long accum __fractuhquta (unsigned
  1528. fract A)
  1529. -- Runtime Function: signed char __fractuhqqi (unsigned fract A)
  1530. -- Runtime Function: short __fractuhqhi (unsigned fract A)
  1531. -- Runtime Function: int __fractuhqsi (unsigned fract A)
  1532. -- Runtime Function: long __fractuhqdi (unsigned fract A)
  1533. -- Runtime Function: long long __fractuhqti (unsigned fract A)
  1534. -- Runtime Function: float __fractuhqsf (unsigned fract A)
  1535. -- Runtime Function: double __fractuhqdf (unsigned fract A)
  1536. -- Runtime Function: short fract __fractusqqq (unsigned long fract A)
  1537. -- Runtime Function: fract __fractusqhq (unsigned long fract A)
  1538. -- Runtime Function: long fract __fractusqsq (unsigned long fract A)
  1539. -- Runtime Function: long long fract __fractusqdq (unsigned long fract
  1540. A)
  1541. -- Runtime Function: short accum __fractusqha (unsigned long fract A)
  1542. -- Runtime Function: accum __fractusqsa (unsigned long fract A)
  1543. -- Runtime Function: long accum __fractusqda (unsigned long fract A)
  1544. -- Runtime Function: long long accum __fractusqta (unsigned long fract
  1545. A)
  1546. -- Runtime Function: unsigned short fract __fractusquqq2 (unsigned long
  1547. fract A)
  1548. -- Runtime Function: unsigned fract __fractusquhq2 (unsigned long fract
  1549. A)
  1550. -- Runtime Function: unsigned long long fract __fractusqudq2 (unsigned
  1551. long fract A)
  1552. -- Runtime Function: unsigned short accum __fractusquha (unsigned long
  1553. fract A)
  1554. -- Runtime Function: unsigned accum __fractusqusa (unsigned long fract
  1555. A)
  1556. -- Runtime Function: unsigned long accum __fractusquda (unsigned long
  1557. fract A)
  1558. -- Runtime Function: unsigned long long accum __fractusquta (unsigned
  1559. long fract A)
  1560. -- Runtime Function: signed char __fractusqqi (unsigned long fract A)
  1561. -- Runtime Function: short __fractusqhi (unsigned long fract A)
  1562. -- Runtime Function: int __fractusqsi (unsigned long fract A)
  1563. -- Runtime Function: long __fractusqdi (unsigned long fract A)
  1564. -- Runtime Function: long long __fractusqti (unsigned long fract A)
  1565. -- Runtime Function: float __fractusqsf (unsigned long fract A)
  1566. -- Runtime Function: double __fractusqdf (unsigned long fract A)
  1567. -- Runtime Function: short fract __fractudqqq (unsigned long long fract
  1568. A)
  1569. -- Runtime Function: fract __fractudqhq (unsigned long long fract A)
  1570. -- Runtime Function: long fract __fractudqsq (unsigned long long fract
  1571. A)
  1572. -- Runtime Function: long long fract __fractudqdq (unsigned long long
  1573. fract A)
  1574. -- Runtime Function: short accum __fractudqha (unsigned long long fract
  1575. A)
  1576. -- Runtime Function: accum __fractudqsa (unsigned long long fract A)
  1577. -- Runtime Function: long accum __fractudqda (unsigned long long fract
  1578. A)
  1579. -- Runtime Function: long long accum __fractudqta (unsigned long long
  1580. fract A)
  1581. -- Runtime Function: unsigned short fract __fractudquqq2 (unsigned long
  1582. long fract A)
  1583. -- Runtime Function: unsigned fract __fractudquhq2 (unsigned long long
  1584. fract A)
  1585. -- Runtime Function: unsigned long fract __fractudqusq2 (unsigned long
  1586. long fract A)
  1587. -- Runtime Function: unsigned short accum __fractudquha (unsigned long
  1588. long fract A)
  1589. -- Runtime Function: unsigned accum __fractudqusa (unsigned long long
  1590. fract A)
  1591. -- Runtime Function: unsigned long accum __fractudquda (unsigned long
  1592. long fract A)
  1593. -- Runtime Function: unsigned long long accum __fractudquta (unsigned
  1594. long long fract A)
  1595. -- Runtime Function: signed char __fractudqqi (unsigned long long fract
  1596. A)
  1597. -- Runtime Function: short __fractudqhi (unsigned long long fract A)
  1598. -- Runtime Function: int __fractudqsi (unsigned long long fract A)
  1599. -- Runtime Function: long __fractudqdi (unsigned long long fract A)
  1600. -- Runtime Function: long long __fractudqti (unsigned long long fract
  1601. A)
  1602. -- Runtime Function: float __fractudqsf (unsigned long long fract A)
  1603. -- Runtime Function: double __fractudqdf (unsigned long long fract A)
  1604. -- Runtime Function: short fract __fractuhaqq (unsigned short accum A)
  1605. -- Runtime Function: fract __fractuhahq (unsigned short accum A)
  1606. -- Runtime Function: long fract __fractuhasq (unsigned short accum A)
  1607. -- Runtime Function: long long fract __fractuhadq (unsigned short accum
  1608. A)
  1609. -- Runtime Function: short accum __fractuhaha (unsigned short accum A)
  1610. -- Runtime Function: accum __fractuhasa (unsigned short accum A)
  1611. -- Runtime Function: long accum __fractuhada (unsigned short accum A)
  1612. -- Runtime Function: long long accum __fractuhata (unsigned short accum
  1613. A)
  1614. -- Runtime Function: unsigned short fract __fractuhauqq (unsigned short
  1615. accum A)
  1616. -- Runtime Function: unsigned fract __fractuhauhq (unsigned short accum
  1617. A)
  1618. -- Runtime Function: unsigned long fract __fractuhausq (unsigned short
  1619. accum A)
  1620. -- Runtime Function: unsigned long long fract __fractuhaudq (unsigned
  1621. short accum A)
  1622. -- Runtime Function: unsigned accum __fractuhausa2 (unsigned short
  1623. accum A)
  1624. -- Runtime Function: unsigned long accum __fractuhauda2 (unsigned short
  1625. accum A)
  1626. -- Runtime Function: unsigned long long accum __fractuhauta2 (unsigned
  1627. short accum A)
  1628. -- Runtime Function: signed char __fractuhaqi (unsigned short accum A)
  1629. -- Runtime Function: short __fractuhahi (unsigned short accum A)
  1630. -- Runtime Function: int __fractuhasi (unsigned short accum A)
  1631. -- Runtime Function: long __fractuhadi (unsigned short accum A)
  1632. -- Runtime Function: long long __fractuhati (unsigned short accum A)
  1633. -- Runtime Function: float __fractuhasf (unsigned short accum A)
  1634. -- Runtime Function: double __fractuhadf (unsigned short accum A)
  1635. -- Runtime Function: short fract __fractusaqq (unsigned accum A)
  1636. -- Runtime Function: fract __fractusahq (unsigned accum A)
  1637. -- Runtime Function: long fract __fractusasq (unsigned accum A)
  1638. -- Runtime Function: long long fract __fractusadq (unsigned accum A)
  1639. -- Runtime Function: short accum __fractusaha (unsigned accum A)
  1640. -- Runtime Function: accum __fractusasa (unsigned accum A)
  1641. -- Runtime Function: long accum __fractusada (unsigned accum A)
  1642. -- Runtime Function: long long accum __fractusata (unsigned accum A)
  1643. -- Runtime Function: unsigned short fract __fractusauqq (unsigned accum
  1644. A)
  1645. -- Runtime Function: unsigned fract __fractusauhq (unsigned accum A)
  1646. -- Runtime Function: unsigned long fract __fractusausq (unsigned accum
  1647. A)
  1648. -- Runtime Function: unsigned long long fract __fractusaudq (unsigned
  1649. accum A)
  1650. -- Runtime Function: unsigned short accum __fractusauha2 (unsigned
  1651. accum A)
  1652. -- Runtime Function: unsigned long accum __fractusauda2 (unsigned accum
  1653. A)
  1654. -- Runtime Function: unsigned long long accum __fractusauta2 (unsigned
  1655. accum A)
  1656. -- Runtime Function: signed char __fractusaqi (unsigned accum A)
  1657. -- Runtime Function: short __fractusahi (unsigned accum A)
  1658. -- Runtime Function: int __fractusasi (unsigned accum A)
  1659. -- Runtime Function: long __fractusadi (unsigned accum A)
  1660. -- Runtime Function: long long __fractusati (unsigned accum A)
  1661. -- Runtime Function: float __fractusasf (unsigned accum A)
  1662. -- Runtime Function: double __fractusadf (unsigned accum A)
  1663. -- Runtime Function: short fract __fractudaqq (unsigned long accum A)
  1664. -- Runtime Function: fract __fractudahq (unsigned long accum A)
  1665. -- Runtime Function: long fract __fractudasq (unsigned long accum A)
  1666. -- Runtime Function: long long fract __fractudadq (unsigned long accum
  1667. A)
  1668. -- Runtime Function: short accum __fractudaha (unsigned long accum A)
  1669. -- Runtime Function: accum __fractudasa (unsigned long accum A)
  1670. -- Runtime Function: long accum __fractudada (unsigned long accum A)
  1671. -- Runtime Function: long long accum __fractudata (unsigned long accum
  1672. A)
  1673. -- Runtime Function: unsigned short fract __fractudauqq (unsigned long
  1674. accum A)
  1675. -- Runtime Function: unsigned fract __fractudauhq (unsigned long accum
  1676. A)
  1677. -- Runtime Function: unsigned long fract __fractudausq (unsigned long
  1678. accum A)
  1679. -- Runtime Function: unsigned long long fract __fractudaudq (unsigned
  1680. long accum A)
  1681. -- Runtime Function: unsigned short accum __fractudauha2 (unsigned long
  1682. accum A)
  1683. -- Runtime Function: unsigned accum __fractudausa2 (unsigned long accum
  1684. A)
  1685. -- Runtime Function: unsigned long long accum __fractudauta2 (unsigned
  1686. long accum A)
  1687. -- Runtime Function: signed char __fractudaqi (unsigned long accum A)
  1688. -- Runtime Function: short __fractudahi (unsigned long accum A)
  1689. -- Runtime Function: int __fractudasi (unsigned long accum A)
  1690. -- Runtime Function: long __fractudadi (unsigned long accum A)
  1691. -- Runtime Function: long long __fractudati (unsigned long accum A)
  1692. -- Runtime Function: float __fractudasf (unsigned long accum A)
  1693. -- Runtime Function: double __fractudadf (unsigned long accum A)
  1694. -- Runtime Function: short fract __fractutaqq (unsigned long long accum
  1695. A)
  1696. -- Runtime Function: fract __fractutahq (unsigned long long accum A)
  1697. -- Runtime Function: long fract __fractutasq (unsigned long long accum
  1698. A)
  1699. -- Runtime Function: long long fract __fractutadq (unsigned long long
  1700. accum A)
  1701. -- Runtime Function: short accum __fractutaha (unsigned long long accum
  1702. A)
  1703. -- Runtime Function: accum __fractutasa (unsigned long long accum A)
  1704. -- Runtime Function: long accum __fractutada (unsigned long long accum
  1705. A)
  1706. -- Runtime Function: long long accum __fractutata (unsigned long long
  1707. accum A)
  1708. -- Runtime Function: unsigned short fract __fractutauqq (unsigned long
  1709. long accum A)
  1710. -- Runtime Function: unsigned fract __fractutauhq (unsigned long long
  1711. accum A)
  1712. -- Runtime Function: unsigned long fract __fractutausq (unsigned long
  1713. long accum A)
  1714. -- Runtime Function: unsigned long long fract __fractutaudq (unsigned
  1715. long long accum A)
  1716. -- Runtime Function: unsigned short accum __fractutauha2 (unsigned long
  1717. long accum A)
  1718. -- Runtime Function: unsigned accum __fractutausa2 (unsigned long long
  1719. accum A)
  1720. -- Runtime Function: unsigned long accum __fractutauda2 (unsigned long
  1721. long accum A)
  1722. -- Runtime Function: signed char __fractutaqi (unsigned long long accum
  1723. A)
  1724. -- Runtime Function: short __fractutahi (unsigned long long accum A)
  1725. -- Runtime Function: int __fractutasi (unsigned long long accum A)
  1726. -- Runtime Function: long __fractutadi (unsigned long long accum A)
  1727. -- Runtime Function: long long __fractutati (unsigned long long accum
  1728. A)
  1729. -- Runtime Function: float __fractutasf (unsigned long long accum A)
  1730. -- Runtime Function: double __fractutadf (unsigned long long accum A)
  1731. -- Runtime Function: short fract __fractqiqq (signed char A)
  1732. -- Runtime Function: fract __fractqihq (signed char A)
  1733. -- Runtime Function: long fract __fractqisq (signed char A)
  1734. -- Runtime Function: long long fract __fractqidq (signed char A)
  1735. -- Runtime Function: short accum __fractqiha (signed char A)
  1736. -- Runtime Function: accum __fractqisa (signed char A)
  1737. -- Runtime Function: long accum __fractqida (signed char A)
  1738. -- Runtime Function: long long accum __fractqita (signed char A)
  1739. -- Runtime Function: unsigned short fract __fractqiuqq (signed char A)
  1740. -- Runtime Function: unsigned fract __fractqiuhq (signed char A)
  1741. -- Runtime Function: unsigned long fract __fractqiusq (signed char A)
  1742. -- Runtime Function: unsigned long long fract __fractqiudq (signed char
  1743. A)
  1744. -- Runtime Function: unsigned short accum __fractqiuha (signed char A)
  1745. -- Runtime Function: unsigned accum __fractqiusa (signed char A)
  1746. -- Runtime Function: unsigned long accum __fractqiuda (signed char A)
  1747. -- Runtime Function: unsigned long long accum __fractqiuta (signed char
  1748. A)
  1749. -- Runtime Function: short fract __fracthiqq (short A)
  1750. -- Runtime Function: fract __fracthihq (short A)
  1751. -- Runtime Function: long fract __fracthisq (short A)
  1752. -- Runtime Function: long long fract __fracthidq (short A)
  1753. -- Runtime Function: short accum __fracthiha (short A)
  1754. -- Runtime Function: accum __fracthisa (short A)
  1755. -- Runtime Function: long accum __fracthida (short A)
  1756. -- Runtime Function: long long accum __fracthita (short A)
  1757. -- Runtime Function: unsigned short fract __fracthiuqq (short A)
  1758. -- Runtime Function: unsigned fract __fracthiuhq (short A)
  1759. -- Runtime Function: unsigned long fract __fracthiusq (short A)
  1760. -- Runtime Function: unsigned long long fract __fracthiudq (short A)
  1761. -- Runtime Function: unsigned short accum __fracthiuha (short A)
  1762. -- Runtime Function: unsigned accum __fracthiusa (short A)
  1763. -- Runtime Function: unsigned long accum __fracthiuda (short A)
  1764. -- Runtime Function: unsigned long long accum __fracthiuta (short A)
  1765. -- Runtime Function: short fract __fractsiqq (int A)
  1766. -- Runtime Function: fract __fractsihq (int A)
  1767. -- Runtime Function: long fract __fractsisq (int A)
  1768. -- Runtime Function: long long fract __fractsidq (int A)
  1769. -- Runtime Function: short accum __fractsiha (int A)
  1770. -- Runtime Function: accum __fractsisa (int A)
  1771. -- Runtime Function: long accum __fractsida (int A)
  1772. -- Runtime Function: long long accum __fractsita (int A)
  1773. -- Runtime Function: unsigned short fract __fractsiuqq (int A)
  1774. -- Runtime Function: unsigned fract __fractsiuhq (int A)
  1775. -- Runtime Function: unsigned long fract __fractsiusq (int A)
  1776. -- Runtime Function: unsigned long long fract __fractsiudq (int A)
  1777. -- Runtime Function: unsigned short accum __fractsiuha (int A)
  1778. -- Runtime Function: unsigned accum __fractsiusa (int A)
  1779. -- Runtime Function: unsigned long accum __fractsiuda (int A)
  1780. -- Runtime Function: unsigned long long accum __fractsiuta (int A)
  1781. -- Runtime Function: short fract __fractdiqq (long A)
  1782. -- Runtime Function: fract __fractdihq (long A)
  1783. -- Runtime Function: long fract __fractdisq (long A)
  1784. -- Runtime Function: long long fract __fractdidq (long A)
  1785. -- Runtime Function: short accum __fractdiha (long A)
  1786. -- Runtime Function: accum __fractdisa (long A)
  1787. -- Runtime Function: long accum __fractdida (long A)
  1788. -- Runtime Function: long long accum __fractdita (long A)
  1789. -- Runtime Function: unsigned short fract __fractdiuqq (long A)
  1790. -- Runtime Function: unsigned fract __fractdiuhq (long A)
  1791. -- Runtime Function: unsigned long fract __fractdiusq (long A)
  1792. -- Runtime Function: unsigned long long fract __fractdiudq (long A)
  1793. -- Runtime Function: unsigned short accum __fractdiuha (long A)
  1794. -- Runtime Function: unsigned accum __fractdiusa (long A)
  1795. -- Runtime Function: unsigned long accum __fractdiuda (long A)
  1796. -- Runtime Function: unsigned long long accum __fractdiuta (long A)
  1797. -- Runtime Function: short fract __fracttiqq (long long A)
  1798. -- Runtime Function: fract __fracttihq (long long A)
  1799. -- Runtime Function: long fract __fracttisq (long long A)
  1800. -- Runtime Function: long long fract __fracttidq (long long A)
  1801. -- Runtime Function: short accum __fracttiha (long long A)
  1802. -- Runtime Function: accum __fracttisa (long long A)
  1803. -- Runtime Function: long accum __fracttida (long long A)
  1804. -- Runtime Function: long long accum __fracttita (long long A)
  1805. -- Runtime Function: unsigned short fract __fracttiuqq (long long A)
  1806. -- Runtime Function: unsigned fract __fracttiuhq (long long A)
  1807. -- Runtime Function: unsigned long fract __fracttiusq (long long A)
  1808. -- Runtime Function: unsigned long long fract __fracttiudq (long long
  1809. A)
  1810. -- Runtime Function: unsigned short accum __fracttiuha (long long A)
  1811. -- Runtime Function: unsigned accum __fracttiusa (long long A)
  1812. -- Runtime Function: unsigned long accum __fracttiuda (long long A)
  1813. -- Runtime Function: unsigned long long accum __fracttiuta (long long
  1814. A)
  1815. -- Runtime Function: short fract __fractsfqq (float A)
  1816. -- Runtime Function: fract __fractsfhq (float A)
  1817. -- Runtime Function: long fract __fractsfsq (float A)
  1818. -- Runtime Function: long long fract __fractsfdq (float A)
  1819. -- Runtime Function: short accum __fractsfha (float A)
  1820. -- Runtime Function: accum __fractsfsa (float A)
  1821. -- Runtime Function: long accum __fractsfda (float A)
  1822. -- Runtime Function: long long accum __fractsfta (float A)
  1823. -- Runtime Function: unsigned short fract __fractsfuqq (float A)
  1824. -- Runtime Function: unsigned fract __fractsfuhq (float A)
  1825. -- Runtime Function: unsigned long fract __fractsfusq (float A)
  1826. -- Runtime Function: unsigned long long fract __fractsfudq (float A)
  1827. -- Runtime Function: unsigned short accum __fractsfuha (float A)
  1828. -- Runtime Function: unsigned accum __fractsfusa (float A)
  1829. -- Runtime Function: unsigned long accum __fractsfuda (float A)
  1830. -- Runtime Function: unsigned long long accum __fractsfuta (float A)
  1831. -- Runtime Function: short fract __fractdfqq (double A)
  1832. -- Runtime Function: fract __fractdfhq (double A)
  1833. -- Runtime Function: long fract __fractdfsq (double A)
  1834. -- Runtime Function: long long fract __fractdfdq (double A)
  1835. -- Runtime Function: short accum __fractdfha (double A)
  1836. -- Runtime Function: accum __fractdfsa (double A)
  1837. -- Runtime Function: long accum __fractdfda (double A)
  1838. -- Runtime Function: long long accum __fractdfta (double A)
  1839. -- Runtime Function: unsigned short fract __fractdfuqq (double A)
  1840. -- Runtime Function: unsigned fract __fractdfuhq (double A)
  1841. -- Runtime Function: unsigned long fract __fractdfusq (double A)
  1842. -- Runtime Function: unsigned long long fract __fractdfudq (double A)
  1843. -- Runtime Function: unsigned short accum __fractdfuha (double A)
  1844. -- Runtime Function: unsigned accum __fractdfusa (double A)
  1845. -- Runtime Function: unsigned long accum __fractdfuda (double A)
  1846. -- Runtime Function: unsigned long long accum __fractdfuta (double A)
  1847. These functions convert from fractional and signed non-fractionals
  1848. to fractionals and signed non-fractionals, without saturation.
  1849. -- Runtime Function: fract __satfractqqhq2 (short fract A)
  1850. -- Runtime Function: long fract __satfractqqsq2 (short fract A)
  1851. -- Runtime Function: long long fract __satfractqqdq2 (short fract A)
  1852. -- Runtime Function: short accum __satfractqqha (short fract A)
  1853. -- Runtime Function: accum __satfractqqsa (short fract A)
  1854. -- Runtime Function: long accum __satfractqqda (short fract A)
  1855. -- Runtime Function: long long accum __satfractqqta (short fract A)
  1856. -- Runtime Function: unsigned short fract __satfractqquqq (short fract
  1857. A)
  1858. -- Runtime Function: unsigned fract __satfractqquhq (short fract A)
  1859. -- Runtime Function: unsigned long fract __satfractqqusq (short fract
  1860. A)
  1861. -- Runtime Function: unsigned long long fract __satfractqqudq (short
  1862. fract A)
  1863. -- Runtime Function: unsigned short accum __satfractqquha (short fract
  1864. A)
  1865. -- Runtime Function: unsigned accum __satfractqqusa (short fract A)
  1866. -- Runtime Function: unsigned long accum __satfractqquda (short fract
  1867. A)
  1868. -- Runtime Function: unsigned long long accum __satfractqquta (short
  1869. fract A)
  1870. -- Runtime Function: short fract __satfracthqqq2 (fract A)
  1871. -- Runtime Function: long fract __satfracthqsq2 (fract A)
  1872. -- Runtime Function: long long fract __satfracthqdq2 (fract A)
  1873. -- Runtime Function: short accum __satfracthqha (fract A)
  1874. -- Runtime Function: accum __satfracthqsa (fract A)
  1875. -- Runtime Function: long accum __satfracthqda (fract A)
  1876. -- Runtime Function: long long accum __satfracthqta (fract A)
  1877. -- Runtime Function: unsigned short fract __satfracthquqq (fract A)
  1878. -- Runtime Function: unsigned fract __satfracthquhq (fract A)
  1879. -- Runtime Function: unsigned long fract __satfracthqusq (fract A)
  1880. -- Runtime Function: unsigned long long fract __satfracthqudq (fract A)
  1881. -- Runtime Function: unsigned short accum __satfracthquha (fract A)
  1882. -- Runtime Function: unsigned accum __satfracthqusa (fract A)
  1883. -- Runtime Function: unsigned long accum __satfracthquda (fract A)
  1884. -- Runtime Function: unsigned long long accum __satfracthquta (fract A)
  1885. -- Runtime Function: short fract __satfractsqqq2 (long fract A)
  1886. -- Runtime Function: fract __satfractsqhq2 (long fract A)
  1887. -- Runtime Function: long long fract __satfractsqdq2 (long fract A)
  1888. -- Runtime Function: short accum __satfractsqha (long fract A)
  1889. -- Runtime Function: accum __satfractsqsa (long fract A)
  1890. -- Runtime Function: long accum __satfractsqda (long fract A)
  1891. -- Runtime Function: long long accum __satfractsqta (long fract A)
  1892. -- Runtime Function: unsigned short fract __satfractsquqq (long fract
  1893. A)
  1894. -- Runtime Function: unsigned fract __satfractsquhq (long fract A)
  1895. -- Runtime Function: unsigned long fract __satfractsqusq (long fract A)
  1896. -- Runtime Function: unsigned long long fract __satfractsqudq (long
  1897. fract A)
  1898. -- Runtime Function: unsigned short accum __satfractsquha (long fract
  1899. A)
  1900. -- Runtime Function: unsigned accum __satfractsqusa (long fract A)
  1901. -- Runtime Function: unsigned long accum __satfractsquda (long fract A)
  1902. -- Runtime Function: unsigned long long accum __satfractsquta (long
  1903. fract A)
  1904. -- Runtime Function: short fract __satfractdqqq2 (long long fract A)
  1905. -- Runtime Function: fract __satfractdqhq2 (long long fract A)
  1906. -- Runtime Function: long fract __satfractdqsq2 (long long fract A)
  1907. -- Runtime Function: short accum __satfractdqha (long long fract A)
  1908. -- Runtime Function: accum __satfractdqsa (long long fract A)
  1909. -- Runtime Function: long accum __satfractdqda (long long fract A)
  1910. -- Runtime Function: long long accum __satfractdqta (long long fract A)
  1911. -- Runtime Function: unsigned short fract __satfractdquqq (long long
  1912. fract A)
  1913. -- Runtime Function: unsigned fract __satfractdquhq (long long fract A)
  1914. -- Runtime Function: unsigned long fract __satfractdqusq (long long
  1915. fract A)
  1916. -- Runtime Function: unsigned long long fract __satfractdqudq (long
  1917. long fract A)
  1918. -- Runtime Function: unsigned short accum __satfractdquha (long long
  1919. fract A)
  1920. -- Runtime Function: unsigned accum __satfractdqusa (long long fract A)
  1921. -- Runtime Function: unsigned long accum __satfractdquda (long long
  1922. fract A)
  1923. -- Runtime Function: unsigned long long accum __satfractdquta (long
  1924. long fract A)
  1925. -- Runtime Function: short fract __satfracthaqq (short accum A)
  1926. -- Runtime Function: fract __satfracthahq (short accum A)
  1927. -- Runtime Function: long fract __satfracthasq (short accum A)
  1928. -- Runtime Function: long long fract __satfracthadq (short accum A)
  1929. -- Runtime Function: accum __satfracthasa2 (short accum A)
  1930. -- Runtime Function: long accum __satfracthada2 (short accum A)
  1931. -- Runtime Function: long long accum __satfracthata2 (short accum A)
  1932. -- Runtime Function: unsigned short fract __satfracthauqq (short accum
  1933. A)
  1934. -- Runtime Function: unsigned fract __satfracthauhq (short accum A)
  1935. -- Runtime Function: unsigned long fract __satfracthausq (short accum
  1936. A)
  1937. -- Runtime Function: unsigned long long fract __satfracthaudq (short
  1938. accum A)
  1939. -- Runtime Function: unsigned short accum __satfracthauha (short accum
  1940. A)
  1941. -- Runtime Function: unsigned accum __satfracthausa (short accum A)
  1942. -- Runtime Function: unsigned long accum __satfracthauda (short accum
  1943. A)
  1944. -- Runtime Function: unsigned long long accum __satfracthauta (short
  1945. accum A)
  1946. -- Runtime Function: short fract __satfractsaqq (accum A)
  1947. -- Runtime Function: fract __satfractsahq (accum A)
  1948. -- Runtime Function: long fract __satfractsasq (accum A)
  1949. -- Runtime Function: long long fract __satfractsadq (accum A)
  1950. -- Runtime Function: short accum __satfractsaha2 (accum A)
  1951. -- Runtime Function: long accum __satfractsada2 (accum A)
  1952. -- Runtime Function: long long accum __satfractsata2 (accum A)
  1953. -- Runtime Function: unsigned short fract __satfractsauqq (accum A)
  1954. -- Runtime Function: unsigned fract __satfractsauhq (accum A)
  1955. -- Runtime Function: unsigned long fract __satfractsausq (accum A)
  1956. -- Runtime Function: unsigned long long fract __satfractsaudq (accum A)
  1957. -- Runtime Function: unsigned short accum __satfractsauha (accum A)
  1958. -- Runtime Function: unsigned accum __satfractsausa (accum A)
  1959. -- Runtime Function: unsigned long accum __satfractsauda (accum A)
  1960. -- Runtime Function: unsigned long long accum __satfractsauta (accum A)
  1961. -- Runtime Function: short fract __satfractdaqq (long accum A)
  1962. -- Runtime Function: fract __satfractdahq (long accum A)
  1963. -- Runtime Function: long fract __satfractdasq (long accum A)
  1964. -- Runtime Function: long long fract __satfractdadq (long accum A)
  1965. -- Runtime Function: short accum __satfractdaha2 (long accum A)
  1966. -- Runtime Function: accum __satfractdasa2 (long accum A)
  1967. -- Runtime Function: long long accum __satfractdata2 (long accum A)
  1968. -- Runtime Function: unsigned short fract __satfractdauqq (long accum
  1969. A)
  1970. -- Runtime Function: unsigned fract __satfractdauhq (long accum A)
  1971. -- Runtime Function: unsigned long fract __satfractdausq (long accum A)
  1972. -- Runtime Function: unsigned long long fract __satfractdaudq (long
  1973. accum A)
  1974. -- Runtime Function: unsigned short accum __satfractdauha (long accum
  1975. A)
  1976. -- Runtime Function: unsigned accum __satfractdausa (long accum A)
  1977. -- Runtime Function: unsigned long accum __satfractdauda (long accum A)
  1978. -- Runtime Function: unsigned long long accum __satfractdauta (long
  1979. accum A)
  1980. -- Runtime Function: short fract __satfracttaqq (long long accum A)
  1981. -- Runtime Function: fract __satfracttahq (long long accum A)
  1982. -- Runtime Function: long fract __satfracttasq (long long accum A)
  1983. -- Runtime Function: long long fract __satfracttadq (long long accum A)
  1984. -- Runtime Function: short accum __satfracttaha2 (long long accum A)
  1985. -- Runtime Function: accum __satfracttasa2 (long long accum A)
  1986. -- Runtime Function: long accum __satfracttada2 (long long accum A)
  1987. -- Runtime Function: unsigned short fract __satfracttauqq (long long
  1988. accum A)
  1989. -- Runtime Function: unsigned fract __satfracttauhq (long long accum A)
  1990. -- Runtime Function: unsigned long fract __satfracttausq (long long
  1991. accum A)
  1992. -- Runtime Function: unsigned long long fract __satfracttaudq (long
  1993. long accum A)
  1994. -- Runtime Function: unsigned short accum __satfracttauha (long long
  1995. accum A)
  1996. -- Runtime Function: unsigned accum __satfracttausa (long long accum A)
  1997. -- Runtime Function: unsigned long accum __satfracttauda (long long
  1998. accum A)
  1999. -- Runtime Function: unsigned long long accum __satfracttauta (long
  2000. long accum A)
  2001. -- Runtime Function: short fract __satfractuqqqq (unsigned short fract
  2002. A)
  2003. -- Runtime Function: fract __satfractuqqhq (unsigned short fract A)
  2004. -- Runtime Function: long fract __satfractuqqsq (unsigned short fract
  2005. A)
  2006. -- Runtime Function: long long fract __satfractuqqdq (unsigned short
  2007. fract A)
  2008. -- Runtime Function: short accum __satfractuqqha (unsigned short fract
  2009. A)
  2010. -- Runtime Function: accum __satfractuqqsa (unsigned short fract A)
  2011. -- Runtime Function: long accum __satfractuqqda (unsigned short fract
  2012. A)
  2013. -- Runtime Function: long long accum __satfractuqqta (unsigned short
  2014. fract A)
  2015. -- Runtime Function: unsigned fract __satfractuqquhq2 (unsigned short
  2016. fract A)
  2017. -- Runtime Function: unsigned long fract __satfractuqqusq2 (unsigned
  2018. short fract A)
  2019. -- Runtime Function: unsigned long long fract __satfractuqqudq2
  2020. (unsigned short fract A)
  2021. -- Runtime Function: unsigned short accum __satfractuqquha (unsigned
  2022. short fract A)
  2023. -- Runtime Function: unsigned accum __satfractuqqusa (unsigned short
  2024. fract A)
  2025. -- Runtime Function: unsigned long accum __satfractuqquda (unsigned
  2026. short fract A)
  2027. -- Runtime Function: unsigned long long accum __satfractuqquta
  2028. (unsigned short fract A)
  2029. -- Runtime Function: short fract __satfractuhqqq (unsigned fract A)
  2030. -- Runtime Function: fract __satfractuhqhq (unsigned fract A)
  2031. -- Runtime Function: long fract __satfractuhqsq (unsigned fract A)
  2032. -- Runtime Function: long long fract __satfractuhqdq (unsigned fract A)
  2033. -- Runtime Function: short accum __satfractuhqha (unsigned fract A)
  2034. -- Runtime Function: accum __satfractuhqsa (unsigned fract A)
  2035. -- Runtime Function: long accum __satfractuhqda (unsigned fract A)
  2036. -- Runtime Function: long long accum __satfractuhqta (unsigned fract A)
  2037. -- Runtime Function: unsigned short fract __satfractuhquqq2 (unsigned
  2038. fract A)
  2039. -- Runtime Function: unsigned long fract __satfractuhqusq2 (unsigned
  2040. fract A)
  2041. -- Runtime Function: unsigned long long fract __satfractuhqudq2
  2042. (unsigned fract A)
  2043. -- Runtime Function: unsigned short accum __satfractuhquha (unsigned
  2044. fract A)
  2045. -- Runtime Function: unsigned accum __satfractuhqusa (unsigned fract A)
  2046. -- Runtime Function: unsigned long accum __satfractuhquda (unsigned
  2047. fract A)
  2048. -- Runtime Function: unsigned long long accum __satfractuhquta
  2049. (unsigned fract A)
  2050. -- Runtime Function: short fract __satfractusqqq (unsigned long fract
  2051. A)
  2052. -- Runtime Function: fract __satfractusqhq (unsigned long fract A)
  2053. -- Runtime Function: long fract __satfractusqsq (unsigned long fract A)
  2054. -- Runtime Function: long long fract __satfractusqdq (unsigned long
  2055. fract A)
  2056. -- Runtime Function: short accum __satfractusqha (unsigned long fract
  2057. A)
  2058. -- Runtime Function: accum __satfractusqsa (unsigned long fract A)
  2059. -- Runtime Function: long accum __satfractusqda (unsigned long fract A)
  2060. -- Runtime Function: long long accum __satfractusqta (unsigned long
  2061. fract A)
  2062. -- Runtime Function: unsigned short fract __satfractusquqq2 (unsigned
  2063. long fract A)
  2064. -- Runtime Function: unsigned fract __satfractusquhq2 (unsigned long
  2065. fract A)
  2066. -- Runtime Function: unsigned long long fract __satfractusqudq2
  2067. (unsigned long fract A)
  2068. -- Runtime Function: unsigned short accum __satfractusquha (unsigned
  2069. long fract A)
  2070. -- Runtime Function: unsigned accum __satfractusqusa (unsigned long
  2071. fract A)
  2072. -- Runtime Function: unsigned long accum __satfractusquda (unsigned
  2073. long fract A)
  2074. -- Runtime Function: unsigned long long accum __satfractusquta
  2075. (unsigned long fract A)
  2076. -- Runtime Function: short fract __satfractudqqq (unsigned long long
  2077. fract A)
  2078. -- Runtime Function: fract __satfractudqhq (unsigned long long fract A)
  2079. -- Runtime Function: long fract __satfractudqsq (unsigned long long
  2080. fract A)
  2081. -- Runtime Function: long long fract __satfractudqdq (unsigned long
  2082. long fract A)
  2083. -- Runtime Function: short accum __satfractudqha (unsigned long long
  2084. fract A)
  2085. -- Runtime Function: accum __satfractudqsa (unsigned long long fract A)
  2086. -- Runtime Function: long accum __satfractudqda (unsigned long long
  2087. fract A)
  2088. -- Runtime Function: long long accum __satfractudqta (unsigned long
  2089. long fract A)
  2090. -- Runtime Function: unsigned short fract __satfractudquqq2 (unsigned
  2091. long long fract A)
  2092. -- Runtime Function: unsigned fract __satfractudquhq2 (unsigned long
  2093. long fract A)
  2094. -- Runtime Function: unsigned long fract __satfractudqusq2 (unsigned
  2095. long long fract A)
  2096. -- Runtime Function: unsigned short accum __satfractudquha (unsigned
  2097. long long fract A)
  2098. -- Runtime Function: unsigned accum __satfractudqusa (unsigned long
  2099. long fract A)
  2100. -- Runtime Function: unsigned long accum __satfractudquda (unsigned
  2101. long long fract A)
  2102. -- Runtime Function: unsigned long long accum __satfractudquta
  2103. (unsigned long long fract A)
  2104. -- Runtime Function: short fract __satfractuhaqq (unsigned short accum
  2105. A)
  2106. -- Runtime Function: fract __satfractuhahq (unsigned short accum A)
  2107. -- Runtime Function: long fract __satfractuhasq (unsigned short accum
  2108. A)
  2109. -- Runtime Function: long long fract __satfractuhadq (unsigned short
  2110. accum A)
  2111. -- Runtime Function: short accum __satfractuhaha (unsigned short accum
  2112. A)
  2113. -- Runtime Function: accum __satfractuhasa (unsigned short accum A)
  2114. -- Runtime Function: long accum __satfractuhada (unsigned short accum
  2115. A)
  2116. -- Runtime Function: long long accum __satfractuhata (unsigned short
  2117. accum A)
  2118. -- Runtime Function: unsigned short fract __satfractuhauqq (unsigned
  2119. short accum A)
  2120. -- Runtime Function: unsigned fract __satfractuhauhq (unsigned short
  2121. accum A)
  2122. -- Runtime Function: unsigned long fract __satfractuhausq (unsigned
  2123. short accum A)
  2124. -- Runtime Function: unsigned long long fract __satfractuhaudq
  2125. (unsigned short accum A)
  2126. -- Runtime Function: unsigned accum __satfractuhausa2 (unsigned short
  2127. accum A)
  2128. -- Runtime Function: unsigned long accum __satfractuhauda2 (unsigned
  2129. short accum A)
  2130. -- Runtime Function: unsigned long long accum __satfractuhauta2
  2131. (unsigned short accum A)
  2132. -- Runtime Function: short fract __satfractusaqq (unsigned accum A)
  2133. -- Runtime Function: fract __satfractusahq (unsigned accum A)
  2134. -- Runtime Function: long fract __satfractusasq (unsigned accum A)
  2135. -- Runtime Function: long long fract __satfractusadq (unsigned accum A)
  2136. -- Runtime Function: short accum __satfractusaha (unsigned accum A)
  2137. -- Runtime Function: accum __satfractusasa (unsigned accum A)
  2138. -- Runtime Function: long accum __satfractusada (unsigned accum A)
  2139. -- Runtime Function: long long accum __satfractusata (unsigned accum A)
  2140. -- Runtime Function: unsigned short fract __satfractusauqq (unsigned
  2141. accum A)
  2142. -- Runtime Function: unsigned fract __satfractusauhq (unsigned accum A)
  2143. -- Runtime Function: unsigned long fract __satfractusausq (unsigned
  2144. accum A)
  2145. -- Runtime Function: unsigned long long fract __satfractusaudq
  2146. (unsigned accum A)
  2147. -- Runtime Function: unsigned short accum __satfractusauha2 (unsigned
  2148. accum A)
  2149. -- Runtime Function: unsigned long accum __satfractusauda2 (unsigned
  2150. accum A)
  2151. -- Runtime Function: unsigned long long accum __satfractusauta2
  2152. (unsigned accum A)
  2153. -- Runtime Function: short fract __satfractudaqq (unsigned long accum
  2154. A)
  2155. -- Runtime Function: fract __satfractudahq (unsigned long accum A)
  2156. -- Runtime Function: long fract __satfractudasq (unsigned long accum A)
  2157. -- Runtime Function: long long fract __satfractudadq (unsigned long
  2158. accum A)
  2159. -- Runtime Function: short accum __satfractudaha (unsigned long accum
  2160. A)
  2161. -- Runtime Function: accum __satfractudasa (unsigned long accum A)
  2162. -- Runtime Function: long accum __satfractudada (unsigned long accum A)
  2163. -- Runtime Function: long long accum __satfractudata (unsigned long
  2164. accum A)
  2165. -- Runtime Function: unsigned short fract __satfractudauqq (unsigned
  2166. long accum A)
  2167. -- Runtime Function: unsigned fract __satfractudauhq (unsigned long
  2168. accum A)
  2169. -- Runtime Function: unsigned long fract __satfractudausq (unsigned
  2170. long accum A)
  2171. -- Runtime Function: unsigned long long fract __satfractudaudq
  2172. (unsigned long accum A)
  2173. -- Runtime Function: unsigned short accum __satfractudauha2 (unsigned
  2174. long accum A)
  2175. -- Runtime Function: unsigned accum __satfractudausa2 (unsigned long
  2176. accum A)
  2177. -- Runtime Function: unsigned long long accum __satfractudauta2
  2178. (unsigned long accum A)
  2179. -- Runtime Function: short fract __satfractutaqq (unsigned long long
  2180. accum A)
  2181. -- Runtime Function: fract __satfractutahq (unsigned long long accum A)
  2182. -- Runtime Function: long fract __satfractutasq (unsigned long long
  2183. accum A)
  2184. -- Runtime Function: long long fract __satfractutadq (unsigned long
  2185. long accum A)
  2186. -- Runtime Function: short accum __satfractutaha (unsigned long long
  2187. accum A)
  2188. -- Runtime Function: accum __satfractutasa (unsigned long long accum A)
  2189. -- Runtime Function: long accum __satfractutada (unsigned long long
  2190. accum A)
  2191. -- Runtime Function: long long accum __satfractutata (unsigned long
  2192. long accum A)
  2193. -- Runtime Function: unsigned short fract __satfractutauqq (unsigned
  2194. long long accum A)
  2195. -- Runtime Function: unsigned fract __satfractutauhq (unsigned long
  2196. long accum A)
  2197. -- Runtime Function: unsigned long fract __satfractutausq (unsigned
  2198. long long accum A)
  2199. -- Runtime Function: unsigned long long fract __satfractutaudq
  2200. (unsigned long long accum A)
  2201. -- Runtime Function: unsigned short accum __satfractutauha2 (unsigned
  2202. long long accum A)
  2203. -- Runtime Function: unsigned accum __satfractutausa2 (unsigned long
  2204. long accum A)
  2205. -- Runtime Function: unsigned long accum __satfractutauda2 (unsigned
  2206. long long accum A)
  2207. -- Runtime Function: short fract __satfractqiqq (signed char A)
  2208. -- Runtime Function: fract __satfractqihq (signed char A)
  2209. -- Runtime Function: long fract __satfractqisq (signed char A)
  2210. -- Runtime Function: long long fract __satfractqidq (signed char A)
  2211. -- Runtime Function: short accum __satfractqiha (signed char A)
  2212. -- Runtime Function: accum __satfractqisa (signed char A)
  2213. -- Runtime Function: long accum __satfractqida (signed char A)
  2214. -- Runtime Function: long long accum __satfractqita (signed char A)
  2215. -- Runtime Function: unsigned short fract __satfractqiuqq (signed char
  2216. A)
  2217. -- Runtime Function: unsigned fract __satfractqiuhq (signed char A)
  2218. -- Runtime Function: unsigned long fract __satfractqiusq (signed char
  2219. A)
  2220. -- Runtime Function: unsigned long long fract __satfractqiudq (signed
  2221. char A)
  2222. -- Runtime Function: unsigned short accum __satfractqiuha (signed char
  2223. A)
  2224. -- Runtime Function: unsigned accum __satfractqiusa (signed char A)
  2225. -- Runtime Function: unsigned long accum __satfractqiuda (signed char
  2226. A)
  2227. -- Runtime Function: unsigned long long accum __satfractqiuta (signed
  2228. char A)
  2229. -- Runtime Function: short fract __satfracthiqq (short A)
  2230. -- Runtime Function: fract __satfracthihq (short A)
  2231. -- Runtime Function: long fract __satfracthisq (short A)
  2232. -- Runtime Function: long long fract __satfracthidq (short A)
  2233. -- Runtime Function: short accum __satfracthiha (short A)
  2234. -- Runtime Function: accum __satfracthisa (short A)
  2235. -- Runtime Function: long accum __satfracthida (short A)
  2236. -- Runtime Function: long long accum __satfracthita (short A)
  2237. -- Runtime Function: unsigned short fract __satfracthiuqq (short A)
  2238. -- Runtime Function: unsigned fract __satfracthiuhq (short A)
  2239. -- Runtime Function: unsigned long fract __satfracthiusq (short A)
  2240. -- Runtime Function: unsigned long long fract __satfracthiudq (short A)
  2241. -- Runtime Function: unsigned short accum __satfracthiuha (short A)
  2242. -- Runtime Function: unsigned accum __satfracthiusa (short A)
  2243. -- Runtime Function: unsigned long accum __satfracthiuda (short A)
  2244. -- Runtime Function: unsigned long long accum __satfracthiuta (short A)
  2245. -- Runtime Function: short fract __satfractsiqq (int A)
  2246. -- Runtime Function: fract __satfractsihq (int A)
  2247. -- Runtime Function: long fract __satfractsisq (int A)
  2248. -- Runtime Function: long long fract __satfractsidq (int A)
  2249. -- Runtime Function: short accum __satfractsiha (int A)
  2250. -- Runtime Function: accum __satfractsisa (int A)
  2251. -- Runtime Function: long accum __satfractsida (int A)
  2252. -- Runtime Function: long long accum __satfractsita (int A)
  2253. -- Runtime Function: unsigned short fract __satfractsiuqq (int A)
  2254. -- Runtime Function: unsigned fract __satfractsiuhq (int A)
  2255. -- Runtime Function: unsigned long fract __satfractsiusq (int A)
  2256. -- Runtime Function: unsigned long long fract __satfractsiudq (int A)
  2257. -- Runtime Function: unsigned short accum __satfractsiuha (int A)
  2258. -- Runtime Function: unsigned accum __satfractsiusa (int A)
  2259. -- Runtime Function: unsigned long accum __satfractsiuda (int A)
  2260. -- Runtime Function: unsigned long long accum __satfractsiuta (int A)
  2261. -- Runtime Function: short fract __satfractdiqq (long A)
  2262. -- Runtime Function: fract __satfractdihq (long A)
  2263. -- Runtime Function: long fract __satfractdisq (long A)
  2264. -- Runtime Function: long long fract __satfractdidq (long A)
  2265. -- Runtime Function: short accum __satfractdiha (long A)
  2266. -- Runtime Function: accum __satfractdisa (long A)
  2267. -- Runtime Function: long accum __satfractdida (long A)
  2268. -- Runtime Function: long long accum __satfractdita (long A)
  2269. -- Runtime Function: unsigned short fract __satfractdiuqq (long A)
  2270. -- Runtime Function: unsigned fract __satfractdiuhq (long A)
  2271. -- Runtime Function: unsigned long fract __satfractdiusq (long A)
  2272. -- Runtime Function: unsigned long long fract __satfractdiudq (long A)
  2273. -- Runtime Function: unsigned short accum __satfractdiuha (long A)
  2274. -- Runtime Function: unsigned accum __satfractdiusa (long A)
  2275. -- Runtime Function: unsigned long accum __satfractdiuda (long A)
  2276. -- Runtime Function: unsigned long long accum __satfractdiuta (long A)
  2277. -- Runtime Function: short fract __satfracttiqq (long long A)
  2278. -- Runtime Function: fract __satfracttihq (long long A)
  2279. -- Runtime Function: long fract __satfracttisq (long long A)
  2280. -- Runtime Function: long long fract __satfracttidq (long long A)
  2281. -- Runtime Function: short accum __satfracttiha (long long A)
  2282. -- Runtime Function: accum __satfracttisa (long long A)
  2283. -- Runtime Function: long accum __satfracttida (long long A)
  2284. -- Runtime Function: long long accum __satfracttita (long long A)
  2285. -- Runtime Function: unsigned short fract __satfracttiuqq (long long A)
  2286. -- Runtime Function: unsigned fract __satfracttiuhq (long long A)
  2287. -- Runtime Function: unsigned long fract __satfracttiusq (long long A)
  2288. -- Runtime Function: unsigned long long fract __satfracttiudq (long
  2289. long A)
  2290. -- Runtime Function: unsigned short accum __satfracttiuha (long long A)
  2291. -- Runtime Function: unsigned accum __satfracttiusa (long long A)
  2292. -- Runtime Function: unsigned long accum __satfracttiuda (long long A)
  2293. -- Runtime Function: unsigned long long accum __satfracttiuta (long
  2294. long A)
  2295. -- Runtime Function: short fract __satfractsfqq (float A)
  2296. -- Runtime Function: fract __satfractsfhq (float A)
  2297. -- Runtime Function: long fract __satfractsfsq (float A)
  2298. -- Runtime Function: long long fract __satfractsfdq (float A)
  2299. -- Runtime Function: short accum __satfractsfha (float A)
  2300. -- Runtime Function: accum __satfractsfsa (float A)
  2301. -- Runtime Function: long accum __satfractsfda (float A)
  2302. -- Runtime Function: long long accum __satfractsfta (float A)
  2303. -- Runtime Function: unsigned short fract __satfractsfuqq (float A)
  2304. -- Runtime Function: unsigned fract __satfractsfuhq (float A)
  2305. -- Runtime Function: unsigned long fract __satfractsfusq (float A)
  2306. -- Runtime Function: unsigned long long fract __satfractsfudq (float A)
  2307. -- Runtime Function: unsigned short accum __satfractsfuha (float A)
  2308. -- Runtime Function: unsigned accum __satfractsfusa (float A)
  2309. -- Runtime Function: unsigned long accum __satfractsfuda (float A)
  2310. -- Runtime Function: unsigned long long accum __satfractsfuta (float A)
  2311. -- Runtime Function: short fract __satfractdfqq (double A)
  2312. -- Runtime Function: fract __satfractdfhq (double A)
  2313. -- Runtime Function: long fract __satfractdfsq (double A)
  2314. -- Runtime Function: long long fract __satfractdfdq (double A)
  2315. -- Runtime Function: short accum __satfractdfha (double A)
  2316. -- Runtime Function: accum __satfractdfsa (double A)
  2317. -- Runtime Function: long accum __satfractdfda (double A)
  2318. -- Runtime Function: long long accum __satfractdfta (double A)
  2319. -- Runtime Function: unsigned short fract __satfractdfuqq (double A)
  2320. -- Runtime Function: unsigned fract __satfractdfuhq (double A)
  2321. -- Runtime Function: unsigned long fract __satfractdfusq (double A)
  2322. -- Runtime Function: unsigned long long fract __satfractdfudq (double
  2323. A)
  2324. -- Runtime Function: unsigned short accum __satfractdfuha (double A)
  2325. -- Runtime Function: unsigned accum __satfractdfusa (double A)
  2326. -- Runtime Function: unsigned long accum __satfractdfuda (double A)
  2327. -- Runtime Function: unsigned long long accum __satfractdfuta (double
  2328. A)
  2329. The functions convert from fractional and signed non-fractionals to
  2330. fractionals, with saturation.
  2331. -- Runtime Function: unsigned char __fractunsqqqi (short fract A)
  2332. -- Runtime Function: unsigned short __fractunsqqhi (short fract A)
  2333. -- Runtime Function: unsigned int __fractunsqqsi (short fract A)
  2334. -- Runtime Function: unsigned long __fractunsqqdi (short fract A)
  2335. -- Runtime Function: unsigned long long __fractunsqqti (short fract A)
  2336. -- Runtime Function: unsigned char __fractunshqqi (fract A)
  2337. -- Runtime Function: unsigned short __fractunshqhi (fract A)
  2338. -- Runtime Function: unsigned int __fractunshqsi (fract A)
  2339. -- Runtime Function: unsigned long __fractunshqdi (fract A)
  2340. -- Runtime Function: unsigned long long __fractunshqti (fract A)
  2341. -- Runtime Function: unsigned char __fractunssqqi (long fract A)
  2342. -- Runtime Function: unsigned short __fractunssqhi (long fract A)
  2343. -- Runtime Function: unsigned int __fractunssqsi (long fract A)
  2344. -- Runtime Function: unsigned long __fractunssqdi (long fract A)
  2345. -- Runtime Function: unsigned long long __fractunssqti (long fract A)
  2346. -- Runtime Function: unsigned char __fractunsdqqi (long long fract A)
  2347. -- Runtime Function: unsigned short __fractunsdqhi (long long fract A)
  2348. -- Runtime Function: unsigned int __fractunsdqsi (long long fract A)
  2349. -- Runtime Function: unsigned long __fractunsdqdi (long long fract A)
  2350. -- Runtime Function: unsigned long long __fractunsdqti (long long fract
  2351. A)
  2352. -- Runtime Function: unsigned char __fractunshaqi (short accum A)
  2353. -- Runtime Function: unsigned short __fractunshahi (short accum A)
  2354. -- Runtime Function: unsigned int __fractunshasi (short accum A)
  2355. -- Runtime Function: unsigned long __fractunshadi (short accum A)
  2356. -- Runtime Function: unsigned long long __fractunshati (short accum A)
  2357. -- Runtime Function: unsigned char __fractunssaqi (accum A)
  2358. -- Runtime Function: unsigned short __fractunssahi (accum A)
  2359. -- Runtime Function: unsigned int __fractunssasi (accum A)
  2360. -- Runtime Function: unsigned long __fractunssadi (accum A)
  2361. -- Runtime Function: unsigned long long __fractunssati (accum A)
  2362. -- Runtime Function: unsigned char __fractunsdaqi (long accum A)
  2363. -- Runtime Function: unsigned short __fractunsdahi (long accum A)
  2364. -- Runtime Function: unsigned int __fractunsdasi (long accum A)
  2365. -- Runtime Function: unsigned long __fractunsdadi (long accum A)
  2366. -- Runtime Function: unsigned long long __fractunsdati (long accum A)
  2367. -- Runtime Function: unsigned char __fractunstaqi (long long accum A)
  2368. -- Runtime Function: unsigned short __fractunstahi (long long accum A)
  2369. -- Runtime Function: unsigned int __fractunstasi (long long accum A)
  2370. -- Runtime Function: unsigned long __fractunstadi (long long accum A)
  2371. -- Runtime Function: unsigned long long __fractunstati (long long accum
  2372. A)
  2373. -- Runtime Function: unsigned char __fractunsuqqqi (unsigned short
  2374. fract A)
  2375. -- Runtime Function: unsigned short __fractunsuqqhi (unsigned short
  2376. fract A)
  2377. -- Runtime Function: unsigned int __fractunsuqqsi (unsigned short fract
  2378. A)
  2379. -- Runtime Function: unsigned long __fractunsuqqdi (unsigned short
  2380. fract A)
  2381. -- Runtime Function: unsigned long long __fractunsuqqti (unsigned short
  2382. fract A)
  2383. -- Runtime Function: unsigned char __fractunsuhqqi (unsigned fract A)
  2384. -- Runtime Function: unsigned short __fractunsuhqhi (unsigned fract A)
  2385. -- Runtime Function: unsigned int __fractunsuhqsi (unsigned fract A)
  2386. -- Runtime Function: unsigned long __fractunsuhqdi (unsigned fract A)
  2387. -- Runtime Function: unsigned long long __fractunsuhqti (unsigned fract
  2388. A)
  2389. -- Runtime Function: unsigned char __fractunsusqqi (unsigned long fract
  2390. A)
  2391. -- Runtime Function: unsigned short __fractunsusqhi (unsigned long
  2392. fract A)
  2393. -- Runtime Function: unsigned int __fractunsusqsi (unsigned long fract
  2394. A)
  2395. -- Runtime Function: unsigned long __fractunsusqdi (unsigned long fract
  2396. A)
  2397. -- Runtime Function: unsigned long long __fractunsusqti (unsigned long
  2398. fract A)
  2399. -- Runtime Function: unsigned char __fractunsudqqi (unsigned long long
  2400. fract A)
  2401. -- Runtime Function: unsigned short __fractunsudqhi (unsigned long long
  2402. fract A)
  2403. -- Runtime Function: unsigned int __fractunsudqsi (unsigned long long
  2404. fract A)
  2405. -- Runtime Function: unsigned long __fractunsudqdi (unsigned long long
  2406. fract A)
  2407. -- Runtime Function: unsigned long long __fractunsudqti (unsigned long
  2408. long fract A)
  2409. -- Runtime Function: unsigned char __fractunsuhaqi (unsigned short
  2410. accum A)
  2411. -- Runtime Function: unsigned short __fractunsuhahi (unsigned short
  2412. accum A)
  2413. -- Runtime Function: unsigned int __fractunsuhasi (unsigned short accum
  2414. A)
  2415. -- Runtime Function: unsigned long __fractunsuhadi (unsigned short
  2416. accum A)
  2417. -- Runtime Function: unsigned long long __fractunsuhati (unsigned short
  2418. accum A)
  2419. -- Runtime Function: unsigned char __fractunsusaqi (unsigned accum A)
  2420. -- Runtime Function: unsigned short __fractunsusahi (unsigned accum A)
  2421. -- Runtime Function: unsigned int __fractunsusasi (unsigned accum A)
  2422. -- Runtime Function: unsigned long __fractunsusadi (unsigned accum A)
  2423. -- Runtime Function: unsigned long long __fractunsusati (unsigned accum
  2424. A)
  2425. -- Runtime Function: unsigned char __fractunsudaqi (unsigned long accum
  2426. A)
  2427. -- Runtime Function: unsigned short __fractunsudahi (unsigned long
  2428. accum A)
  2429. -- Runtime Function: unsigned int __fractunsudasi (unsigned long accum
  2430. A)
  2431. -- Runtime Function: unsigned long __fractunsudadi (unsigned long accum
  2432. A)
  2433. -- Runtime Function: unsigned long long __fractunsudati (unsigned long
  2434. accum A)
  2435. -- Runtime Function: unsigned char __fractunsutaqi (unsigned long long
  2436. accum A)
  2437. -- Runtime Function: unsigned short __fractunsutahi (unsigned long long
  2438. accum A)
  2439. -- Runtime Function: unsigned int __fractunsutasi (unsigned long long
  2440. accum A)
  2441. -- Runtime Function: unsigned long __fractunsutadi (unsigned long long
  2442. accum A)
  2443. -- Runtime Function: unsigned long long __fractunsutati (unsigned long
  2444. long accum A)
  2445. -- Runtime Function: short fract __fractunsqiqq (unsigned char A)
  2446. -- Runtime Function: fract __fractunsqihq (unsigned char A)
  2447. -- Runtime Function: long fract __fractunsqisq (unsigned char A)
  2448. -- Runtime Function: long long fract __fractunsqidq (unsigned char A)
  2449. -- Runtime Function: short accum __fractunsqiha (unsigned char A)
  2450. -- Runtime Function: accum __fractunsqisa (unsigned char A)
  2451. -- Runtime Function: long accum __fractunsqida (unsigned char A)
  2452. -- Runtime Function: long long accum __fractunsqita (unsigned char A)
  2453. -- Runtime Function: unsigned short fract __fractunsqiuqq (unsigned
  2454. char A)
  2455. -- Runtime Function: unsigned fract __fractunsqiuhq (unsigned char A)
  2456. -- Runtime Function: unsigned long fract __fractunsqiusq (unsigned char
  2457. A)
  2458. -- Runtime Function: unsigned long long fract __fractunsqiudq (unsigned
  2459. char A)
  2460. -- Runtime Function: unsigned short accum __fractunsqiuha (unsigned
  2461. char A)
  2462. -- Runtime Function: unsigned accum __fractunsqiusa (unsigned char A)
  2463. -- Runtime Function: unsigned long accum __fractunsqiuda (unsigned char
  2464. A)
  2465. -- Runtime Function: unsigned long long accum __fractunsqiuta (unsigned
  2466. char A)
  2467. -- Runtime Function: short fract __fractunshiqq (unsigned short A)
  2468. -- Runtime Function: fract __fractunshihq (unsigned short A)
  2469. -- Runtime Function: long fract __fractunshisq (unsigned short A)
  2470. -- Runtime Function: long long fract __fractunshidq (unsigned short A)
  2471. -- Runtime Function: short accum __fractunshiha (unsigned short A)
  2472. -- Runtime Function: accum __fractunshisa (unsigned short A)
  2473. -- Runtime Function: long accum __fractunshida (unsigned short A)
  2474. -- Runtime Function: long long accum __fractunshita (unsigned short A)
  2475. -- Runtime Function: unsigned short fract __fractunshiuqq (unsigned
  2476. short A)
  2477. -- Runtime Function: unsigned fract __fractunshiuhq (unsigned short A)
  2478. -- Runtime Function: unsigned long fract __fractunshiusq (unsigned
  2479. short A)
  2480. -- Runtime Function: unsigned long long fract __fractunshiudq (unsigned
  2481. short A)
  2482. -- Runtime Function: unsigned short accum __fractunshiuha (unsigned
  2483. short A)
  2484. -- Runtime Function: unsigned accum __fractunshiusa (unsigned short A)
  2485. -- Runtime Function: unsigned long accum __fractunshiuda (unsigned
  2486. short A)
  2487. -- Runtime Function: unsigned long long accum __fractunshiuta (unsigned
  2488. short A)
  2489. -- Runtime Function: short fract __fractunssiqq (unsigned int A)
  2490. -- Runtime Function: fract __fractunssihq (unsigned int A)
  2491. -- Runtime Function: long fract __fractunssisq (unsigned int A)
  2492. -- Runtime Function: long long fract __fractunssidq (unsigned int A)
  2493. -- Runtime Function: short accum __fractunssiha (unsigned int A)
  2494. -- Runtime Function: accum __fractunssisa (unsigned int A)
  2495. -- Runtime Function: long accum __fractunssida (unsigned int A)
  2496. -- Runtime Function: long long accum __fractunssita (unsigned int A)
  2497. -- Runtime Function: unsigned short fract __fractunssiuqq (unsigned int
  2498. A)
  2499. -- Runtime Function: unsigned fract __fractunssiuhq (unsigned int A)
  2500. -- Runtime Function: unsigned long fract __fractunssiusq (unsigned int
  2501. A)
  2502. -- Runtime Function: unsigned long long fract __fractunssiudq (unsigned
  2503. int A)
  2504. -- Runtime Function: unsigned short accum __fractunssiuha (unsigned int
  2505. A)
  2506. -- Runtime Function: unsigned accum __fractunssiusa (unsigned int A)
  2507. -- Runtime Function: unsigned long accum __fractunssiuda (unsigned int
  2508. A)
  2509. -- Runtime Function: unsigned long long accum __fractunssiuta (unsigned
  2510. int A)
  2511. -- Runtime Function: short fract __fractunsdiqq (unsigned long A)
  2512. -- Runtime Function: fract __fractunsdihq (unsigned long A)
  2513. -- Runtime Function: long fract __fractunsdisq (unsigned long A)
  2514. -- Runtime Function: long long fract __fractunsdidq (unsigned long A)
  2515. -- Runtime Function: short accum __fractunsdiha (unsigned long A)
  2516. -- Runtime Function: accum __fractunsdisa (unsigned long A)
  2517. -- Runtime Function: long accum __fractunsdida (unsigned long A)
  2518. -- Runtime Function: long long accum __fractunsdita (unsigned long A)
  2519. -- Runtime Function: unsigned short fract __fractunsdiuqq (unsigned
  2520. long A)
  2521. -- Runtime Function: unsigned fract __fractunsdiuhq (unsigned long A)
  2522. -- Runtime Function: unsigned long fract __fractunsdiusq (unsigned long
  2523. A)
  2524. -- Runtime Function: unsigned long long fract __fractunsdiudq (unsigned
  2525. long A)
  2526. -- Runtime Function: unsigned short accum __fractunsdiuha (unsigned
  2527. long A)
  2528. -- Runtime Function: unsigned accum __fractunsdiusa (unsigned long A)
  2529. -- Runtime Function: unsigned long accum __fractunsdiuda (unsigned long
  2530. A)
  2531. -- Runtime Function: unsigned long long accum __fractunsdiuta (unsigned
  2532. long A)
  2533. -- Runtime Function: short fract __fractunstiqq (unsigned long long A)
  2534. -- Runtime Function: fract __fractunstihq (unsigned long long A)
  2535. -- Runtime Function: long fract __fractunstisq (unsigned long long A)
  2536. -- Runtime Function: long long fract __fractunstidq (unsigned long long
  2537. A)
  2538. -- Runtime Function: short accum __fractunstiha (unsigned long long A)
  2539. -- Runtime Function: accum __fractunstisa (unsigned long long A)
  2540. -- Runtime Function: long accum __fractunstida (unsigned long long A)
  2541. -- Runtime Function: long long accum __fractunstita (unsigned long long
  2542. A)
  2543. -- Runtime Function: unsigned short fract __fractunstiuqq (unsigned
  2544. long long A)
  2545. -- Runtime Function: unsigned fract __fractunstiuhq (unsigned long long
  2546. A)
  2547. -- Runtime Function: unsigned long fract __fractunstiusq (unsigned long
  2548. long A)
  2549. -- Runtime Function: unsigned long long fract __fractunstiudq (unsigned
  2550. long long A)
  2551. -- Runtime Function: unsigned short accum __fractunstiuha (unsigned
  2552. long long A)
  2553. -- Runtime Function: unsigned accum __fractunstiusa (unsigned long long
  2554. A)
  2555. -- Runtime Function: unsigned long accum __fractunstiuda (unsigned long
  2556. long A)
  2557. -- Runtime Function: unsigned long long accum __fractunstiuta (unsigned
  2558. long long A)
  2559. These functions convert from fractionals to unsigned
  2560. non-fractionals; and from unsigned non-fractionals to fractionals,
  2561. without saturation.
  2562. -- Runtime Function: short fract __satfractunsqiqq (unsigned char A)
  2563. -- Runtime Function: fract __satfractunsqihq (unsigned char A)
  2564. -- Runtime Function: long fract __satfractunsqisq (unsigned char A)
  2565. -- Runtime Function: long long fract __satfractunsqidq (unsigned char
  2566. A)
  2567. -- Runtime Function: short accum __satfractunsqiha (unsigned char A)
  2568. -- Runtime Function: accum __satfractunsqisa (unsigned char A)
  2569. -- Runtime Function: long accum __satfractunsqida (unsigned char A)
  2570. -- Runtime Function: long long accum __satfractunsqita (unsigned char
  2571. A)
  2572. -- Runtime Function: unsigned short fract __satfractunsqiuqq (unsigned
  2573. char A)
  2574. -- Runtime Function: unsigned fract __satfractunsqiuhq (unsigned char
  2575. A)
  2576. -- Runtime Function: unsigned long fract __satfractunsqiusq (unsigned
  2577. char A)
  2578. -- Runtime Function: unsigned long long fract __satfractunsqiudq
  2579. (unsigned char A)
  2580. -- Runtime Function: unsigned short accum __satfractunsqiuha (unsigned
  2581. char A)
  2582. -- Runtime Function: unsigned accum __satfractunsqiusa (unsigned char
  2583. A)
  2584. -- Runtime Function: unsigned long accum __satfractunsqiuda (unsigned
  2585. char A)
  2586. -- Runtime Function: unsigned long long accum __satfractunsqiuta
  2587. (unsigned char A)
  2588. -- Runtime Function: short fract __satfractunshiqq (unsigned short A)
  2589. -- Runtime Function: fract __satfractunshihq (unsigned short A)
  2590. -- Runtime Function: long fract __satfractunshisq (unsigned short A)
  2591. -- Runtime Function: long long fract __satfractunshidq (unsigned short
  2592. A)
  2593. -- Runtime Function: short accum __satfractunshiha (unsigned short A)
  2594. -- Runtime Function: accum __satfractunshisa (unsigned short A)
  2595. -- Runtime Function: long accum __satfractunshida (unsigned short A)
  2596. -- Runtime Function: long long accum __satfractunshita (unsigned short
  2597. A)
  2598. -- Runtime Function: unsigned short fract __satfractunshiuqq (unsigned
  2599. short A)
  2600. -- Runtime Function: unsigned fract __satfractunshiuhq (unsigned short
  2601. A)
  2602. -- Runtime Function: unsigned long fract __satfractunshiusq (unsigned
  2603. short A)
  2604. -- Runtime Function: unsigned long long fract __satfractunshiudq
  2605. (unsigned short A)
  2606. -- Runtime Function: unsigned short accum __satfractunshiuha (unsigned
  2607. short A)
  2608. -- Runtime Function: unsigned accum __satfractunshiusa (unsigned short
  2609. A)
  2610. -- Runtime Function: unsigned long accum __satfractunshiuda (unsigned
  2611. short A)
  2612. -- Runtime Function: unsigned long long accum __satfractunshiuta
  2613. (unsigned short A)
  2614. -- Runtime Function: short fract __satfractunssiqq (unsigned int A)
  2615. -- Runtime Function: fract __satfractunssihq (unsigned int A)
  2616. -- Runtime Function: long fract __satfractunssisq (unsigned int A)
  2617. -- Runtime Function: long long fract __satfractunssidq (unsigned int A)
  2618. -- Runtime Function: short accum __satfractunssiha (unsigned int A)
  2619. -- Runtime Function: accum __satfractunssisa (unsigned int A)
  2620. -- Runtime Function: long accum __satfractunssida (unsigned int A)
  2621. -- Runtime Function: long long accum __satfractunssita (unsigned int A)
  2622. -- Runtime Function: unsigned short fract __satfractunssiuqq (unsigned
  2623. int A)
  2624. -- Runtime Function: unsigned fract __satfractunssiuhq (unsigned int A)
  2625. -- Runtime Function: unsigned long fract __satfractunssiusq (unsigned
  2626. int A)
  2627. -- Runtime Function: unsigned long long fract __satfractunssiudq
  2628. (unsigned int A)
  2629. -- Runtime Function: unsigned short accum __satfractunssiuha (unsigned
  2630. int A)
  2631. -- Runtime Function: unsigned accum __satfractunssiusa (unsigned int A)
  2632. -- Runtime Function: unsigned long accum __satfractunssiuda (unsigned
  2633. int A)
  2634. -- Runtime Function: unsigned long long accum __satfractunssiuta
  2635. (unsigned int A)
  2636. -- Runtime Function: short fract __satfractunsdiqq (unsigned long A)
  2637. -- Runtime Function: fract __satfractunsdihq (unsigned long A)
  2638. -- Runtime Function: long fract __satfractunsdisq (unsigned long A)
  2639. -- Runtime Function: long long fract __satfractunsdidq (unsigned long
  2640. A)
  2641. -- Runtime Function: short accum __satfractunsdiha (unsigned long A)
  2642. -- Runtime Function: accum __satfractunsdisa (unsigned long A)
  2643. -- Runtime Function: long accum __satfractunsdida (unsigned long A)
  2644. -- Runtime Function: long long accum __satfractunsdita (unsigned long
  2645. A)
  2646. -- Runtime Function: unsigned short fract __satfractunsdiuqq (unsigned
  2647. long A)
  2648. -- Runtime Function: unsigned fract __satfractunsdiuhq (unsigned long
  2649. A)
  2650. -- Runtime Function: unsigned long fract __satfractunsdiusq (unsigned
  2651. long A)
  2652. -- Runtime Function: unsigned long long fract __satfractunsdiudq
  2653. (unsigned long A)
  2654. -- Runtime Function: unsigned short accum __satfractunsdiuha (unsigned
  2655. long A)
  2656. -- Runtime Function: unsigned accum __satfractunsdiusa (unsigned long
  2657. A)
  2658. -- Runtime Function: unsigned long accum __satfractunsdiuda (unsigned
  2659. long A)
  2660. -- Runtime Function: unsigned long long accum __satfractunsdiuta
  2661. (unsigned long A)
  2662. -- Runtime Function: short fract __satfractunstiqq (unsigned long long
  2663. A)
  2664. -- Runtime Function: fract __satfractunstihq (unsigned long long A)
  2665. -- Runtime Function: long fract __satfractunstisq (unsigned long long
  2666. A)
  2667. -- Runtime Function: long long fract __satfractunstidq (unsigned long
  2668. long A)
  2669. -- Runtime Function: short accum __satfractunstiha (unsigned long long
  2670. A)
  2671. -- Runtime Function: accum __satfractunstisa (unsigned long long A)
  2672. -- Runtime Function: long accum __satfractunstida (unsigned long long
  2673. A)
  2674. -- Runtime Function: long long accum __satfractunstita (unsigned long
  2675. long A)
  2676. -- Runtime Function: unsigned short fract __satfractunstiuqq (unsigned
  2677. long long A)
  2678. -- Runtime Function: unsigned fract __satfractunstiuhq (unsigned long
  2679. long A)
  2680. -- Runtime Function: unsigned long fract __satfractunstiusq (unsigned
  2681. long long A)
  2682. -- Runtime Function: unsigned long long fract __satfractunstiudq
  2683. (unsigned long long A)
  2684. -- Runtime Function: unsigned short accum __satfractunstiuha (unsigned
  2685. long long A)
  2686. -- Runtime Function: unsigned accum __satfractunstiusa (unsigned long
  2687. long A)
  2688. -- Runtime Function: unsigned long accum __satfractunstiuda (unsigned
  2689. long long A)
  2690. -- Runtime Function: unsigned long long accum __satfractunstiuta
  2691. (unsigned long long A)
  2692. These functions convert from unsigned non-fractionals to
  2693. fractionals, with saturation.
  2694. 
  2695. File: gccint.info, Node: Exception handling routines, Next: Miscellaneous routines, Prev: Fixed-point fractional library routines, Up: Libgcc
  2696. 4.5 Language-independent routines for exception handling
  2697. ========================================================
  2698. document me!
  2699. _Unwind_DeleteException
  2700. _Unwind_Find_FDE
  2701. _Unwind_ForcedUnwind
  2702. _Unwind_GetGR
  2703. _Unwind_GetIP
  2704. _Unwind_GetLanguageSpecificData
  2705. _Unwind_GetRegionStart
  2706. _Unwind_GetTextRelBase
  2707. _Unwind_GetDataRelBase
  2708. _Unwind_RaiseException
  2709. _Unwind_Resume
  2710. _Unwind_SetGR
  2711. _Unwind_SetIP
  2712. _Unwind_FindEnclosingFunction
  2713. _Unwind_SjLj_Register
  2714. _Unwind_SjLj_Unregister
  2715. _Unwind_SjLj_RaiseException
  2716. _Unwind_SjLj_ForcedUnwind
  2717. _Unwind_SjLj_Resume
  2718. __deregister_frame
  2719. __deregister_frame_info
  2720. __deregister_frame_info_bases
  2721. __register_frame
  2722. __register_frame_info
  2723. __register_frame_info_bases
  2724. __register_frame_info_table
  2725. __register_frame_info_table_bases
  2726. __register_frame_table
  2727. 
  2728. File: gccint.info, Node: Miscellaneous routines, Prev: Exception handling routines, Up: Libgcc
  2729. 4.6 Miscellaneous runtime library routines
  2730. ==========================================
  2731. 4.6.1 Cache control functions
  2732. -----------------------------
  2733. -- Runtime Function: void __clear_cache (char *BEG, char *END)
  2734. This function clears the instruction cache between BEG and END.
  2735. 4.6.2 Split stack functions and variables
  2736. -----------------------------------------
  2737. -- Runtime Function: void * __splitstack_find (void *SEGMENT_ARG, void
  2738. *SP, size_t LEN, void **NEXT_SEGMENT, void **NEXT_SP, void
  2739. **INITIAL_SP)
  2740. When using '-fsplit-stack', this call may be used to iterate over
  2741. the stack segments. It may be called like this:
  2742. void *next_segment = NULL;
  2743. void *next_sp = NULL;
  2744. void *initial_sp = NULL;
  2745. void *stack;
  2746. size_t stack_size;
  2747. while ((stack = __splitstack_find (next_segment, next_sp,
  2748. &stack_size, &next_segment,
  2749. &next_sp, &initial_sp))
  2750. != NULL)
  2751. {
  2752. /* Stack segment starts at stack and is
  2753. stack_size bytes long. */
  2754. }
  2755. There is no way to iterate over the stack segments of a different
  2756. thread. However, what is permitted is for one thread to call this
  2757. with the SEGMENT_ARG and SP arguments NULL, to pass NEXT_SEGMENT,
  2758. NEXT_SP, and INITIAL_SP to a different thread, and then to suspend
  2759. one way or another. A different thread may run the subsequent
  2760. '__splitstack_find' iterations. Of course, this will only work if
  2761. the first thread is suspended while the second thread is calling
  2762. '__splitstack_find'. If not, the second thread could be looking at
  2763. the stack while it is changing, and anything could happen.
  2764. -- Variable: __morestack_segments
  2765. -- Variable: __morestack_current_segment
  2766. -- Variable: __morestack_initial_sp
  2767. Internal variables used by the '-fsplit-stack' implementation.
  2768. 
  2769. File: gccint.info, Node: Languages, Next: Source Tree, Prev: Libgcc, Up: Top
  2770. 5 Language Front Ends in GCC
  2771. ****************************
  2772. The interface to front ends for languages in GCC, and in particular the
  2773. 'tree' structure (*note GENERIC::), was initially designed for C, and
  2774. many aspects of it are still somewhat biased towards C and C-like
  2775. languages. It is, however, reasonably well suited to other procedural
  2776. languages, and front ends for many such languages have been written for
  2777. GCC.
  2778. Writing a compiler as a front end for GCC, rather than compiling
  2779. directly to assembler or generating C code which is then compiled by
  2780. GCC, has several advantages:
  2781. * GCC front ends benefit from the support for many different target
  2782. machines already present in GCC.
  2783. * GCC front ends benefit from all the optimizations in GCC. Some of
  2784. these, such as alias analysis, may work better when GCC is
  2785. compiling directly from source code then when it is compiling from
  2786. generated C code.
  2787. * Better debugging information is generated when compiling directly
  2788. from source code than when going via intermediate generated C code.
  2789. Because of the advantages of writing a compiler as a GCC front end, GCC
  2790. front ends have also been created for languages very different from
  2791. those for which GCC was designed, such as the declarative
  2792. logic/functional language Mercury. For these reasons, it may also be
  2793. useful to implement compilers created for specialized purposes (for
  2794. example, as part of a research project) as GCC front ends.
  2795. 
  2796. File: gccint.info, Node: Source Tree, Next: Testsuites, Prev: Languages, Up: Top
  2797. 6 Source Tree Structure and Build System
  2798. ****************************************
  2799. This chapter describes the structure of the GCC source tree, and how GCC
  2800. is built. The user documentation for building and installing GCC is in
  2801. a separate manual (<http://gcc.gnu.org/install/>), with which it is
  2802. presumed that you are familiar.
  2803. * Menu:
  2804. * Configure Terms:: Configuration terminology and history.
  2805. * Top Level:: The top level source directory.
  2806. * gcc Directory:: The 'gcc' subdirectory.
  2807. 
  2808. File: gccint.info, Node: Configure Terms, Next: Top Level, Up: Source Tree
  2809. 6.1 Configure Terms and History
  2810. ===============================
  2811. The configure and build process has a long and colorful history, and can
  2812. be confusing to anyone who doesn't know why things are the way they are.
  2813. While there are other documents which describe the configuration process
  2814. in detail, here are a few things that everyone working on GCC should
  2815. know.
  2816. There are three system names that the build knows about: the machine
  2817. you are building on ("build"), the machine that you are building for
  2818. ("host"), and the machine that GCC will produce code for ("target").
  2819. When you configure GCC, you specify these with '--build=', '--host=',
  2820. and '--target='.
  2821. Specifying the host without specifying the build should be avoided, as
  2822. 'configure' may (and once did) assume that the host you specify is also
  2823. the build, which may not be true.
  2824. If build, host, and target are all the same, this is called a "native".
  2825. If build and host are the same but target is different, this is called a
  2826. "cross". If build, host, and target are all different this is called a
  2827. "canadian" (for obscure reasons dealing with Canada's political party
  2828. and the background of the person working on the build at that time). If
  2829. host and target are the same, but build is different, you are using a
  2830. cross-compiler to build a native for a different system. Some people
  2831. call this a "host-x-host", "crossed native", or "cross-built native".
  2832. If build and target are the same, but host is different, you are using a
  2833. cross compiler to build a cross compiler that produces code for the
  2834. machine you're building on. This is rare, so there is no common way of
  2835. describing it. There is a proposal to call this a "crossback".
  2836. If build and host are the same, the GCC you are building will also be
  2837. used to build the target libraries (like 'libstdc++'). If build and
  2838. host are different, you must have already built and installed a cross
  2839. compiler that will be used to build the target libraries (if you
  2840. configured with '--target=foo-bar', this compiler will be called
  2841. 'foo-bar-gcc').
  2842. In the case of target libraries, the machine you're building for is the
  2843. machine you specified with '--target'. So, build is the machine you're
  2844. building on (no change there), host is the machine you're building for
  2845. (the target libraries are built for the target, so host is the target
  2846. you specified), and target doesn't apply (because you're not building a
  2847. compiler, you're building libraries). The configure/make process will
  2848. adjust these variables as needed. It also sets '$with_cross_host' to
  2849. the original '--host' value in case you need it.
  2850. The 'libiberty' support library is built up to three times: once for
  2851. the host, once for the target (even if they are the same), and once for
  2852. the build if build and host are different. This allows it to be used by
  2853. all programs which are generated in the course of the build process.
  2854. 
  2855. File: gccint.info, Node: Top Level, Next: gcc Directory, Prev: Configure Terms, Up: Source Tree
  2856. 6.2 Top Level Source Directory
  2857. ==============================
  2858. The top level source directory in a GCC distribution contains several
  2859. files and directories that are shared with other software distributions
  2860. such as that of GNU Binutils. It also contains several subdirectories
  2861. that contain parts of GCC and its runtime libraries:
  2862. 'boehm-gc'
  2863. The Boehm conservative garbage collector, optionally used as part
  2864. of the ObjC runtime library when configured with
  2865. '--enable-objc-gc'.
  2866. 'config'
  2867. Autoconf macros and Makefile fragments used throughout the tree.
  2868. 'contrib'
  2869. Contributed scripts that may be found useful in conjunction with
  2870. GCC. One of these, 'contrib/texi2pod.pl', is used to generate man
  2871. pages from Texinfo manuals as part of the GCC build process.
  2872. 'fixincludes'
  2873. The support for fixing system headers to work with GCC. See
  2874. 'fixincludes/README' for more information. The headers fixed by
  2875. this mechanism are installed in 'LIBSUBDIR/include-fixed'. Along
  2876. with those headers, 'README-fixinc' is also installed, as
  2877. 'LIBSUBDIR/include-fixed/README'.
  2878. 'gcc'
  2879. The main sources of GCC itself (except for runtime libraries),
  2880. including optimizers, support for different target architectures,
  2881. language front ends, and testsuites. *Note The 'gcc' Subdirectory:
  2882. gcc Directory, for details.
  2883. 'gnattools'
  2884. Support tools for GNAT.
  2885. 'include'
  2886. Headers for the 'libiberty' library.
  2887. 'intl'
  2888. GNU 'libintl', from GNU 'gettext', for systems which do not include
  2889. it in 'libc'.
  2890. 'libada'
  2891. The Ada runtime library.
  2892. 'libatomic'
  2893. The runtime support library for atomic operations (e.g. for
  2894. '__sync' and '__atomic').
  2895. 'libcpp'
  2896. The C preprocessor library.
  2897. 'libdecnumber'
  2898. The Decimal Float support library.
  2899. 'libffi'
  2900. The 'libffi' library, used as part of the Go runtime library.
  2901. 'libgcc'
  2902. The GCC runtime library.
  2903. 'libgfortran'
  2904. The Fortran runtime library.
  2905. 'libgo'
  2906. The Go runtime library. The bulk of this library is mirrored from
  2907. the master Go repository (https://github.com/golang/go).
  2908. 'libgomp'
  2909. The GNU Offloading and Multi Processing Runtime Library.
  2910. 'libiberty'
  2911. The 'libiberty' library, used for portability and for some
  2912. generally useful data structures and algorithms. *Note
  2913. Introduction: (libiberty)Top, for more information about this
  2914. library.
  2915. 'libitm'
  2916. The runtime support library for transactional memory.
  2917. 'libobjc'
  2918. The Objective-C and Objective-C++ runtime library.
  2919. 'libquadmath'
  2920. The runtime support library for quad-precision math operations.
  2921. 'libphobos'
  2922. The D standard and runtime library. The bulk of this library is
  2923. mirrored from the master D repositories (https://github.com/dlang).
  2924. 'libssp'
  2925. The Stack protector runtime library.
  2926. 'libstdc++-v3'
  2927. The C++ runtime library.
  2928. 'lto-plugin'
  2929. Plugin used by the linker if link-time optimizations are enabled.
  2930. 'maintainer-scripts'
  2931. Scripts used by the 'gccadmin' account on 'gcc.gnu.org'.
  2932. 'zlib'
  2933. The 'zlib' compression library, used for compressing and
  2934. uncompressing GCC's intermediate language in LTO object files.
  2935. The build system in the top level directory, including how recursion
  2936. into subdirectories works and how building runtime libraries for
  2937. multilibs is handled, is documented in a separate manual, included with
  2938. GNU Binutils. *Note GNU configure and build system: (configure)Top, for
  2939. details.
  2940. 
  2941. File: gccint.info, Node: gcc Directory, Prev: Top Level, Up: Source Tree
  2942. 6.3 The 'gcc' Subdirectory
  2943. ==========================
  2944. The 'gcc' directory contains many files that are part of the C sources
  2945. of GCC, other files used as part of the configuration and build process,
  2946. and subdirectories including documentation and a testsuite. The files
  2947. that are sources of GCC are documented in a separate chapter. *Note
  2948. Passes and Files of the Compiler: Passes.
  2949. * Menu:
  2950. * Subdirectories:: Subdirectories of 'gcc'.
  2951. * Configuration:: The configuration process, and the files it uses.
  2952. * Build:: The build system in the 'gcc' directory.
  2953. * Makefile:: Targets in 'gcc/Makefile'.
  2954. * Library Files:: Library source files and headers under 'gcc/'.
  2955. * Headers:: Headers installed by GCC.
  2956. * Documentation:: Building documentation in GCC.
  2957. * Front End:: Anatomy of a language front end.
  2958. * Back End:: Anatomy of a target back end.
  2959. 
  2960. File: gccint.info, Node: Subdirectories, Next: Configuration, Up: gcc Directory
  2961. 6.3.1 Subdirectories of 'gcc'
  2962. -----------------------------
  2963. The 'gcc' directory contains the following subdirectories:
  2964. 'LANGUAGE'
  2965. Subdirectories for various languages. Directories containing a
  2966. file 'config-lang.in' are language subdirectories. The contents of
  2967. the subdirectories 'c' (for C), 'cp' (for C++), 'objc' (for
  2968. Objective-C), 'objcp' (for Objective-C++), and 'lto' (for LTO) are
  2969. documented in this manual (*note Passes and Files of the Compiler:
  2970. Passes.); those for other languages are not. *Note Anatomy of a
  2971. Language Front End: Front End, for details of the files in these
  2972. directories.
  2973. 'common'
  2974. Source files shared between the compiler drivers (such as 'gcc')
  2975. and the compilers proper (such as 'cc1'). If an architecture
  2976. defines target hooks shared between those places, it also has a
  2977. subdirectory in 'common/config'. *Note Target Structure::.
  2978. 'config'
  2979. Configuration files for supported architectures and operating
  2980. systems. *Note Anatomy of a Target Back End: Back End, for details
  2981. of the files in this directory.
  2982. 'doc'
  2983. Texinfo documentation for GCC, together with automatically
  2984. generated man pages and support for converting the installation
  2985. manual to HTML. *Note Documentation::.
  2986. 'ginclude'
  2987. System headers installed by GCC, mainly those required by the C
  2988. standard of freestanding implementations. *Note Headers Installed
  2989. by GCC: Headers, for details of when these and other headers are
  2990. installed.
  2991. 'po'
  2992. Message catalogs with translations of messages produced by GCC into
  2993. various languages, 'LANGUAGE.po'. This directory also contains
  2994. 'gcc.pot', the template for these message catalogues, 'exgettext',
  2995. a wrapper around 'gettext' to extract the messages from the GCC
  2996. sources and create 'gcc.pot', which is run by 'make gcc.pot', and
  2997. 'EXCLUDES', a list of files from which messages should not be
  2998. extracted.
  2999. 'testsuite'
  3000. The GCC testsuites (except for those for runtime libraries). *Note
  3001. Testsuites::.
  3002. 
  3003. File: gccint.info, Node: Configuration, Next: Build, Prev: Subdirectories, Up: gcc Directory
  3004. 6.3.2 Configuration in the 'gcc' Directory
  3005. ------------------------------------------
  3006. The 'gcc' directory is configured with an Autoconf-generated script
  3007. 'configure'. The 'configure' script is generated from 'configure.ac'
  3008. and 'aclocal.m4'. From the files 'configure.ac' and 'acconfig.h',
  3009. Autoheader generates the file 'config.in'. The file 'cstamp-h.in' is
  3010. used as a timestamp.
  3011. * Menu:
  3012. * Config Fragments:: Scripts used by 'configure'.
  3013. * System Config:: The 'config.build', 'config.host', and
  3014. 'config.gcc' files.
  3015. * Configuration Files:: Files created by running 'configure'.
  3016. 
  3017. File: gccint.info, Node: Config Fragments, Next: System Config, Up: Configuration
  3018. 6.3.2.1 Scripts Used by 'configure'
  3019. ...................................
  3020. 'configure' uses some other scripts to help in its work:
  3021. * The standard GNU 'config.sub' and 'config.guess' files, kept in the
  3022. top level directory, are used.
  3023. * The file 'config.gcc' is used to handle configuration specific to
  3024. the particular target machine. The file 'config.build' is used to
  3025. handle configuration specific to the particular build machine. The
  3026. file 'config.host' is used to handle configuration specific to the
  3027. particular host machine. (In general, these should only be used
  3028. for features that cannot reasonably be tested in Autoconf feature
  3029. tests.) *Note The 'config.build'; 'config.host'; and 'config.gcc'
  3030. Files: System Config, for details of the contents of these files.
  3031. * Each language subdirectory has a file 'LANGUAGE/config-lang.in'
  3032. that is used for front-end-specific configuration. *Note The Front
  3033. End 'config-lang.in' File: Front End Config, for details of this
  3034. file.
  3035. * A helper script 'configure.frag' is used as part of creating the
  3036. output of 'configure'.
  3037. 
  3038. File: gccint.info, Node: System Config, Next: Configuration Files, Prev: Config Fragments, Up: Configuration
  3039. 6.3.2.2 The 'config.build'; 'config.host'; and 'config.gcc' Files
  3040. .................................................................
  3041. The 'config.build' file contains specific rules for particular systems
  3042. which GCC is built on. This should be used as rarely as possible, as
  3043. the behavior of the build system can always be detected by autoconf.
  3044. The 'config.host' file contains specific rules for particular systems
  3045. which GCC will run on. This is rarely needed.
  3046. The 'config.gcc' file contains specific rules for particular systems
  3047. which GCC will generate code for. This is usually needed.
  3048. Each file has a list of the shell variables it sets, with descriptions,
  3049. at the top of the file.
  3050. FIXME: document the contents of these files, and what variables should
  3051. be set to control build, host and target configuration.
  3052. 
  3053. File: gccint.info, Node: Configuration Files, Prev: System Config, Up: Configuration
  3054. 6.3.2.3 Files Created by 'configure'
  3055. ....................................
  3056. Here we spell out what files will be set up by 'configure' in the 'gcc'
  3057. directory. Some other files are created as temporary files in the
  3058. configuration process, and are not used in the subsequent build; these
  3059. are not documented.
  3060. * 'Makefile' is constructed from 'Makefile.in', together with the
  3061. host and target fragments (*note Makefile Fragments: Fragments.)
  3062. 't-TARGET' and 'x-HOST' from 'config', if any, and language
  3063. Makefile fragments 'LANGUAGE/Make-lang.in'.
  3064. * 'auto-host.h' contains information about the host machine
  3065. determined by 'configure'. If the host machine is different from
  3066. the build machine, then 'auto-build.h' is also created, containing
  3067. such information about the build machine.
  3068. * 'config.status' is a script that may be run to recreate the current
  3069. configuration.
  3070. * 'configargs.h' is a header containing details of the arguments
  3071. passed to 'configure' to configure GCC, and of the thread model
  3072. used.
  3073. * 'cstamp-h' is used as a timestamp.
  3074. * If a language 'config-lang.in' file (*note The Front End
  3075. 'config-lang.in' File: Front End Config.) sets 'outputs', then the
  3076. files listed in 'outputs' there are also generated.
  3077. The following configuration headers are created from the Makefile,
  3078. using 'mkconfig.sh', rather than directly by 'configure'. 'config.h',
  3079. 'bconfig.h' and 'tconfig.h' all contain the 'xm-MACHINE.h' header, if
  3080. any, appropriate to the host, build and target machines respectively,
  3081. the configuration headers for the target, and some definitions; for the
  3082. host and build machines, these include the autoconfigured headers
  3083. generated by 'configure'. The other configuration headers are
  3084. determined by 'config.gcc'. They also contain the typedefs for 'rtx',
  3085. 'rtvec' and 'tree'.
  3086. * 'config.h', for use in programs that run on the host machine.
  3087. * 'bconfig.h', for use in programs that run on the build machine.
  3088. * 'tconfig.h', for use in programs and libraries for the target
  3089. machine.
  3090. * 'tm_p.h', which includes the header 'MACHINE-protos.h' that
  3091. contains prototypes for functions in the target 'MACHINE.c' file.
  3092. The 'MACHINE-protos.h' header is included after the 'rtl.h' and/or
  3093. 'tree.h' would have been included. The 'tm_p.h' also includes the
  3094. header 'tm-preds.h' which is generated by 'genpreds' program during
  3095. the build to define the declarations and inline functions for the
  3096. predicate functions.
  3097. 
  3098. File: gccint.info, Node: Build, Next: Makefile, Prev: Configuration, Up: gcc Directory
  3099. 6.3.3 Build System in the 'gcc' Directory
  3100. -----------------------------------------
  3101. FIXME: describe the build system, including what is built in what
  3102. stages. Also list the various source files that are used in the build
  3103. process but aren't source files of GCC itself and so aren't documented
  3104. below (*note Passes::).
  3105. 
  3106. File: gccint.info, Node: Makefile, Next: Library Files, Prev: Build, Up: gcc Directory
  3107. 6.3.4 Makefile Targets
  3108. ----------------------
  3109. These targets are available from the 'gcc' directory:
  3110. 'all'
  3111. This is the default target. Depending on what your
  3112. build/host/target configuration is, it coordinates all the things
  3113. that need to be built.
  3114. 'doc'
  3115. Produce info-formatted documentation and man pages. Essentially it
  3116. calls 'make man' and 'make info'.
  3117. 'dvi'
  3118. Produce DVI-formatted documentation.
  3119. 'pdf'
  3120. Produce PDF-formatted documentation.
  3121. 'html'
  3122. Produce HTML-formatted documentation.
  3123. 'man'
  3124. Generate man pages.
  3125. 'info'
  3126. Generate info-formatted pages.
  3127. 'mostlyclean'
  3128. Delete the files made while building the compiler.
  3129. 'clean'
  3130. That, and all the other files built by 'make all'.
  3131. 'distclean'
  3132. That, and all the files created by 'configure'.
  3133. 'maintainer-clean'
  3134. Distclean plus any file that can be generated from other files.
  3135. Note that additional tools may be required beyond what is normally
  3136. needed to build GCC.
  3137. 'srcextra'
  3138. Generates files in the source directory that are not
  3139. version-controlled but should go into a release tarball.
  3140. 'srcinfo'
  3141. 'srcman'
  3142. Copies the info-formatted and manpage documentation into the source
  3143. directory usually for the purpose of generating a release tarball.
  3144. 'install'
  3145. Installs GCC.
  3146. 'uninstall'
  3147. Deletes installed files, though this is not supported.
  3148. 'check'
  3149. Run the testsuite. This creates a 'testsuite' subdirectory that
  3150. has various '.sum' and '.log' files containing the results of the
  3151. testing. You can run subsets with, for example, 'make check-gcc'.
  3152. You can specify specific tests by setting 'RUNTESTFLAGS' to be the
  3153. name of the '.exp' file, optionally followed by (for some tests) an
  3154. equals and a file wildcard, like:
  3155. make check-gcc RUNTESTFLAGS="execute.exp=19980413-*"
  3156. Note that running the testsuite may require additional tools be
  3157. installed, such as Tcl or DejaGnu.
  3158. The toplevel tree from which you start GCC compilation is not the GCC
  3159. directory, but rather a complex Makefile that coordinates the various
  3160. steps of the build, including bootstrapping the compiler and using the
  3161. new compiler to build target libraries.
  3162. When GCC is configured for a native configuration, the default action
  3163. for 'make' is to do a full three-stage bootstrap. This means that GCC
  3164. is built three times--once with the native compiler, once with the
  3165. native-built compiler it just built, and once with the compiler it built
  3166. the second time. In theory, the last two should produce the same
  3167. results, which 'make compare' can check. Each stage is configured
  3168. separately and compiled into a separate directory, to minimize problems
  3169. due to ABI incompatibilities between the native compiler and GCC.
  3170. If you do a change, rebuilding will also start from the first stage and
  3171. "bubble" up the change through the three stages. Each stage is taken
  3172. from its build directory (if it had been built previously), rebuilt, and
  3173. copied to its subdirectory. This will allow you to, for example,
  3174. continue a bootstrap after fixing a bug which causes the stage2 build to
  3175. crash. It does not provide as good coverage of the compiler as
  3176. bootstrapping from scratch, but it ensures that the new code is
  3177. syntactically correct (e.g., that you did not use GCC extensions by
  3178. mistake), and avoids spurious bootstrap comparison failures(1).
  3179. Other targets available from the top level include:
  3180. 'bootstrap-lean'
  3181. Like 'bootstrap', except that the various stages are removed once
  3182. they're no longer needed. This saves disk space.
  3183. 'bootstrap2'
  3184. 'bootstrap2-lean'
  3185. Performs only the first two stages of bootstrap. Unlike a
  3186. three-stage bootstrap, this does not perform a comparison to test
  3187. that the compiler is running properly. Note that the disk space
  3188. required by a "lean" bootstrap is approximately independent of the
  3189. number of stages.
  3190. 'stageN-bubble (N = 1...4, profile, feedback)'
  3191. Rebuild all the stages up to N, with the appropriate flags,
  3192. "bubbling" the changes as described above.
  3193. 'all-stageN (N = 1...4, profile, feedback)'
  3194. Assuming that stage N has already been built, rebuild it with the
  3195. appropriate flags. This is rarely needed.
  3196. 'cleanstrap'
  3197. Remove everything ('make clean') and rebuilds ('make bootstrap').
  3198. 'compare'
  3199. Compares the results of stages 2 and 3. This ensures that the
  3200. compiler is running properly, since it should produce the same
  3201. object files regardless of how it itself was compiled.
  3202. 'profiledbootstrap'
  3203. Builds a compiler with profiling feedback information. In this
  3204. case, the second and third stages are named 'profile' and
  3205. 'feedback', respectively. For more information, see the
  3206. installation instructions.
  3207. 'restrap'
  3208. Restart a bootstrap, so that everything that was not built with the
  3209. system compiler is rebuilt.
  3210. 'stageN-start (N = 1...4, profile, feedback)'
  3211. For each package that is bootstrapped, rename directories so that,
  3212. for example, 'gcc' points to the stageN GCC, compiled with the
  3213. stageN-1 GCC(2).
  3214. You will invoke this target if you need to test or debug the stageN
  3215. GCC. If you only need to execute GCC (but you need not run 'make'
  3216. either to rebuild it or to run test suites), you should be able to
  3217. work directly in the 'stageN-gcc' directory. This makes it easier
  3218. to debug multiple stages in parallel.
  3219. 'stage'
  3220. For each package that is bootstrapped, relocate its build directory
  3221. to indicate its stage. For example, if the 'gcc' directory points
  3222. to the stage2 GCC, after invoking this target it will be renamed to
  3223. 'stage2-gcc'.
  3224. If you wish to use non-default GCC flags when compiling the stage2 and
  3225. stage3 compilers, set 'BOOT_CFLAGS' on the command line when doing
  3226. 'make'.
  3227. Usually, the first stage only builds the languages that the compiler is
  3228. written in: typically, C and maybe Ada. If you are debugging a
  3229. miscompilation of a different stage2 front-end (for example, of the
  3230. Fortran front-end), you may want to have front-ends for other languages
  3231. in the first stage as well. To do so, set 'STAGE1_LANGUAGES' on the
  3232. command line when doing 'make'.
  3233. For example, in the aforementioned scenario of debugging a Fortran
  3234. front-end miscompilation caused by the stage1 compiler, you may need a
  3235. command like
  3236. make stage2-bubble STAGE1_LANGUAGES=c,fortran
  3237. Alternatively, you can use per-language targets to build and test
  3238. languages that are not enabled by default in stage1. For example, 'make
  3239. f951' will build a Fortran compiler even in the stage1 build directory.
  3240. ---------- Footnotes ----------
  3241. (1) Except if the compiler was buggy and miscompiled some of the
  3242. files that were not modified. In this case, it's best to use 'make
  3243. restrap'.
  3244. (2) Customarily, the system compiler is also termed the 'stage0' GCC.
  3245. 
  3246. File: gccint.info, Node: Library Files, Next: Headers, Prev: Makefile, Up: gcc Directory
  3247. 6.3.5 Library Source Files and Headers under the 'gcc' Directory
  3248. ----------------------------------------------------------------
  3249. FIXME: list here, with explanation, all the C source files and headers
  3250. under the 'gcc' directory that aren't built into the GCC executable but
  3251. rather are part of runtime libraries and object files, such as
  3252. 'crtstuff.c' and 'unwind-dw2.c'. *Note Headers Installed by GCC:
  3253. Headers, for more information about the 'ginclude' directory.
  3254. 
  3255. File: gccint.info, Node: Headers, Next: Documentation, Prev: Library Files, Up: gcc Directory
  3256. 6.3.6 Headers Installed by GCC
  3257. ------------------------------
  3258. In general, GCC expects the system C library to provide most of the
  3259. headers to be used with it. However, GCC will fix those headers if
  3260. necessary to make them work with GCC, and will install some headers
  3261. required of freestanding implementations. These headers are installed
  3262. in 'LIBSUBDIR/include'. Headers for non-C runtime libraries are also
  3263. installed by GCC; these are not documented here. (FIXME: document them
  3264. somewhere.)
  3265. Several of the headers GCC installs are in the 'ginclude' directory.
  3266. These headers, 'iso646.h', 'stdarg.h', 'stdbool.h', and 'stddef.h', are
  3267. installed in 'LIBSUBDIR/include', unless the target Makefile fragment
  3268. (*note Target Fragment::) overrides this by setting 'USER_H'.
  3269. In addition to these headers and those generated by fixing system
  3270. headers to work with GCC, some other headers may also be installed in
  3271. 'LIBSUBDIR/include'. 'config.gcc' may set 'extra_headers'; this
  3272. specifies additional headers under 'config' to be installed on some
  3273. systems.
  3274. GCC installs its own version of '<float.h>', from 'ginclude/float.h'.
  3275. This is done to cope with command-line options that change the
  3276. representation of floating point numbers.
  3277. GCC also installs its own version of '<limits.h>'; this is generated
  3278. from 'glimits.h', together with 'limitx.h' and 'limity.h' if the system
  3279. also has its own version of '<limits.h>'. (GCC provides its own header
  3280. because it is required of ISO C freestanding implementations, but needs
  3281. to include the system header from its own header as well because other
  3282. standards such as POSIX specify additional values to be defined in
  3283. '<limits.h>'.) The system's '<limits.h>' header is used via
  3284. 'LIBSUBDIR/include/syslimits.h', which is copied from 'gsyslimits.h' if
  3285. it does not need fixing to work with GCC; if it needs fixing,
  3286. 'syslimits.h' is the fixed copy.
  3287. GCC can also install '<tgmath.h>'. It will do this when 'config.gcc'
  3288. sets 'use_gcc_tgmath' to 'yes'.
  3289. 
  3290. File: gccint.info, Node: Documentation, Next: Front End, Prev: Headers, Up: gcc Directory
  3291. 6.3.7 Building Documentation
  3292. ----------------------------
  3293. The main GCC documentation is in the form of manuals in Texinfo format.
  3294. These are installed in Info format; DVI versions may be generated by
  3295. 'make dvi', PDF versions by 'make pdf', and HTML versions by 'make
  3296. html'. In addition, some man pages are generated from the Texinfo
  3297. manuals, there are some other text files with miscellaneous
  3298. documentation, and runtime libraries have their own documentation
  3299. outside the 'gcc' directory. FIXME: document the documentation for
  3300. runtime libraries somewhere.
  3301. * Menu:
  3302. * Texinfo Manuals:: GCC manuals in Texinfo format.
  3303. * Man Page Generation:: Generating man pages from Texinfo manuals.
  3304. * Miscellaneous Docs:: Miscellaneous text files with documentation.
  3305. 
  3306. File: gccint.info, Node: Texinfo Manuals, Next: Man Page Generation, Up: Documentation
  3307. 6.3.7.1 Texinfo Manuals
  3308. .......................
  3309. The manuals for GCC as a whole, and the C and C++ front ends, are in
  3310. files 'doc/*.texi'. Other front ends have their own manuals in files
  3311. 'LANGUAGE/*.texi'. Common files 'doc/include/*.texi' are provided which
  3312. may be included in multiple manuals; the following files are in
  3313. 'doc/include':
  3314. 'fdl.texi'
  3315. The GNU Free Documentation License.
  3316. 'funding.texi'
  3317. The section "Funding Free Software".
  3318. 'gcc-common.texi'
  3319. Common definitions for manuals.
  3320. 'gpl_v3.texi'
  3321. The GNU General Public License.
  3322. 'texinfo.tex'
  3323. A copy of 'texinfo.tex' known to work with the GCC manuals.
  3324. DVI-formatted manuals are generated by 'make dvi', which uses
  3325. 'texi2dvi' (via the Makefile macro '$(TEXI2DVI)'). PDF-formatted
  3326. manuals are generated by 'make pdf', which uses 'texi2pdf' (via the
  3327. Makefile macro '$(TEXI2PDF)'). HTML formatted manuals are generated by
  3328. 'make html'. Info manuals are generated by 'make info' (which is run as
  3329. part of a bootstrap); this generates the manuals in the source
  3330. directory, using 'makeinfo' via the Makefile macro '$(MAKEINFO)', and
  3331. they are included in release distributions.
  3332. Manuals are also provided on the GCC web site, in both HTML and
  3333. PostScript forms. This is done via the script
  3334. 'maintainer-scripts/update_web_docs_git'. Each manual to be provided
  3335. online must be listed in the definition of 'MANUALS' in that file; a
  3336. file 'NAME.texi' must only appear once in the source tree, and the
  3337. output manual must have the same name as the source file. (However,
  3338. other Texinfo files, included in manuals but not themselves the root
  3339. files of manuals, may have names that appear more than once in the
  3340. source tree.) The manual file 'NAME.texi' should only include other
  3341. files in its own directory or in 'doc/include'. HTML manuals will be
  3342. generated by 'makeinfo --html', PostScript manuals by 'texi2dvi' and
  3343. 'dvips', and PDF manuals by 'texi2pdf'. All Texinfo files that are
  3344. parts of manuals must be version-controlled, even if they are generated
  3345. files, for the generation of online manuals to work.
  3346. The installation manual, 'doc/install.texi', is also provided on the
  3347. GCC web site. The HTML version is generated by the script
  3348. 'doc/install.texi2html'.
  3349. 
  3350. File: gccint.info, Node: Man Page Generation, Next: Miscellaneous Docs, Prev: Texinfo Manuals, Up: Documentation
  3351. 6.3.7.2 Man Page Generation
  3352. ...........................
  3353. Because of user demand, in addition to full Texinfo manuals, man pages
  3354. are provided which contain extracts from those manuals. These man pages
  3355. are generated from the Texinfo manuals using 'contrib/texi2pod.pl' and
  3356. 'pod2man'. (The man page for 'g++', 'cp/g++.1', just contains a '.so'
  3357. reference to 'gcc.1', but all the other man pages are generated from
  3358. Texinfo manuals.)
  3359. Because many systems may not have the necessary tools installed to
  3360. generate the man pages, they are only generated if the 'configure'
  3361. script detects that recent enough tools are installed, and the Makefiles
  3362. allow generating man pages to fail without aborting the build. Man
  3363. pages are also included in release distributions. They are generated in
  3364. the source directory.
  3365. Magic comments in Texinfo files starting '@c man' control what parts of
  3366. a Texinfo file go into a man page. Only a subset of Texinfo is
  3367. supported by 'texi2pod.pl', and it may be necessary to add support for
  3368. more Texinfo features to this script when generating new man pages. To
  3369. improve the man page output, some special Texinfo macros are provided in
  3370. 'doc/include/gcc-common.texi' which 'texi2pod.pl' understands:
  3371. '@gcctabopt'
  3372. Use in the form '@table @gcctabopt' for tables of options, where
  3373. for printed output the effect of '@code' is better than that of
  3374. '@option' but for man page output a different effect is wanted.
  3375. '@gccoptlist'
  3376. Use for summary lists of options in manuals.
  3377. '@gol'
  3378. Use at the end of each line inside '@gccoptlist'. This is
  3379. necessary to avoid problems with differences in how the
  3380. '@gccoptlist' macro is handled by different Texinfo formatters.
  3381. FIXME: describe the 'texi2pod.pl' input language and magic comments in
  3382. more detail.
  3383. 
  3384. File: gccint.info, Node: Miscellaneous Docs, Prev: Man Page Generation, Up: Documentation
  3385. 6.3.7.3 Miscellaneous Documentation
  3386. ...................................
  3387. In addition to the formal documentation that is installed by GCC, there
  3388. are several other text files in the 'gcc' subdirectory with
  3389. miscellaneous documentation:
  3390. 'ABOUT-GCC-NLS'
  3391. Notes on GCC's Native Language Support. FIXME: this should be part
  3392. of this manual rather than a separate file.
  3393. 'ABOUT-NLS'
  3394. Notes on the Free Translation Project.
  3395. 'COPYING'
  3396. 'COPYING3'
  3397. The GNU General Public License, Versions 2 and 3.
  3398. 'COPYING.LIB'
  3399. 'COPYING3.LIB'
  3400. The GNU Lesser General Public License, Versions 2.1 and 3.
  3401. '*ChangeLog*'
  3402. '*/ChangeLog*'
  3403. Change log files for various parts of GCC.
  3404. 'LANGUAGES'
  3405. Details of a few changes to the GCC front-end interface. FIXME:
  3406. the information in this file should be part of general
  3407. documentation of the front-end interface in this manual.
  3408. 'ONEWS'
  3409. Information about new features in old versions of GCC. (For recent
  3410. versions, the information is on the GCC web site.)
  3411. 'README.Portability'
  3412. Information about portability issues when writing code in GCC.
  3413. FIXME: why isn't this part of this manual or of the GCC Coding
  3414. Conventions?
  3415. FIXME: document such files in subdirectories, at least 'config', 'c',
  3416. 'cp', 'objc', 'testsuite'.
  3417. 
  3418. File: gccint.info, Node: Front End, Next: Back End, Prev: Documentation, Up: gcc Directory
  3419. 6.3.8 Anatomy of a Language Front End
  3420. -------------------------------------
  3421. A front end for a language in GCC has the following parts:
  3422. * A directory 'LANGUAGE' under 'gcc' containing source files for that
  3423. front end. *Note The Front End 'LANGUAGE' Directory: Front End
  3424. Directory, for details.
  3425. * A mention of the language in the list of supported languages in
  3426. 'gcc/doc/install.texi'.
  3427. * A mention of the name under which the language's runtime library is
  3428. recognized by '--enable-shared=PACKAGE' in the documentation of
  3429. that option in 'gcc/doc/install.texi'.
  3430. * A mention of any special prerequisites for building the front end
  3431. in the documentation of prerequisites in 'gcc/doc/install.texi'.
  3432. * Details of contributors to that front end in
  3433. 'gcc/doc/contrib.texi'. If the details are in that front end's own
  3434. manual then there should be a link to that manual's list in
  3435. 'contrib.texi'.
  3436. * Information about support for that language in
  3437. 'gcc/doc/frontends.texi'.
  3438. * Information about standards for that language, and the front end's
  3439. support for them, in 'gcc/doc/standards.texi'. This may be a link
  3440. to such information in the front end's own manual.
  3441. * Details of source file suffixes for that language and '-x LANG'
  3442. options supported, in 'gcc/doc/invoke.texi'.
  3443. * Entries in 'default_compilers' in 'gcc.c' for source file suffixes
  3444. for that language.
  3445. * Preferably testsuites, which may be under 'gcc/testsuite' or
  3446. runtime library directories. FIXME: document somewhere how to
  3447. write testsuite harnesses.
  3448. * Probably a runtime library for the language, outside the 'gcc'
  3449. directory. FIXME: document this further.
  3450. * Details of the directories of any runtime libraries in
  3451. 'gcc/doc/sourcebuild.texi'.
  3452. * Check targets in 'Makefile.def' for the top-level 'Makefile' to
  3453. check just the compiler or the compiler and runtime library for the
  3454. language.
  3455. If the front end is added to the official GCC source repository, the
  3456. following are also necessary:
  3457. * At least one Bugzilla component for bugs in that front end and
  3458. runtime libraries. This category needs to be added to the Bugzilla
  3459. database.
  3460. * Normally, one or more maintainers of that front end listed in
  3461. 'MAINTAINERS'.
  3462. * Mentions on the GCC web site in 'index.html' and 'frontends.html',
  3463. with any relevant links on 'readings.html'. (Front ends that are
  3464. not an official part of GCC may also be listed on 'frontends.html',
  3465. with relevant links.)
  3466. * A news item on 'index.html', and possibly an announcement on the
  3467. <gcc-announce@gcc.gnu.org> mailing list.
  3468. * The front end's manuals should be mentioned in
  3469. 'maintainer-scripts/update_web_docs_git' (*note Texinfo Manuals::)
  3470. and the online manuals should be linked to from
  3471. 'onlinedocs/index.html'.
  3472. * Any old releases or CVS repositories of the front end, before its
  3473. inclusion in GCC, should be made available on the GCC web site at
  3474. <https://gcc.gnu.org/pub/gcc/old-releases/>.
  3475. * The release and snapshot script 'maintainer-scripts/gcc_release'
  3476. should be updated to generate appropriate tarballs for this front
  3477. end.
  3478. * If this front end includes its own version files that include the
  3479. current date, 'maintainer-scripts/update_version' should be updated
  3480. accordingly.
  3481. * Menu:
  3482. * Front End Directory:: The front end 'LANGUAGE' directory.
  3483. * Front End Config:: The front end 'config-lang.in' file.
  3484. * Front End Makefile:: The front end 'Make-lang.in' file.
  3485. 
  3486. File: gccint.info, Node: Front End Directory, Next: Front End Config, Up: Front End
  3487. 6.3.8.1 The Front End 'LANGUAGE' Directory
  3488. ..........................................
  3489. A front end 'LANGUAGE' directory contains the source files of that front
  3490. end (but not of any runtime libraries, which should be outside the 'gcc'
  3491. directory). This includes documentation, and possibly some subsidiary
  3492. programs built alongside the front end. Certain files are special and
  3493. other parts of the compiler depend on their names:
  3494. 'config-lang.in'
  3495. This file is required in all language subdirectories. *Note The
  3496. Front End 'config-lang.in' File: Front End Config, for details of
  3497. its contents
  3498. 'Make-lang.in'
  3499. This file is required in all language subdirectories. *Note The
  3500. Front End 'Make-lang.in' File: Front End Makefile, for details of
  3501. its contents.
  3502. 'lang.opt'
  3503. This file registers the set of switches that the front end accepts
  3504. on the command line, and their '--help' text. *Note Options::.
  3505. 'lang-specs.h'
  3506. This file provides entries for 'default_compilers' in 'gcc.c' which
  3507. override the default of giving an error that a compiler for that
  3508. language is not installed.
  3509. 'LANGUAGE-tree.def'
  3510. This file, which need not exist, defines any language-specific tree
  3511. codes.
  3512. 
  3513. File: gccint.info, Node: Front End Config, Next: Front End Makefile, Prev: Front End Directory, Up: Front End
  3514. 6.3.8.2 The Front End 'config-lang.in' File
  3515. ...........................................
  3516. Each language subdirectory contains a 'config-lang.in' file. This file
  3517. is a shell script that may define some variables describing the
  3518. language:
  3519. 'language'
  3520. This definition must be present, and gives the name of the language
  3521. for some purposes such as arguments to '--enable-languages'.
  3522. 'lang_requires'
  3523. If defined, this variable lists (space-separated) language front
  3524. ends other than C that this front end requires to be enabled (with
  3525. the names given being their 'language' settings). For example, the
  3526. Obj-C++ front end depends on the C++ and ObjC front ends, so sets
  3527. 'lang_requires="objc c++"'.
  3528. 'subdir_requires'
  3529. If defined, this variable lists (space-separated) front end
  3530. directories other than C that this front end requires to be
  3531. present. For example, the Objective-C++ front end uses source
  3532. files from the C++ and Objective-C front ends, so sets
  3533. 'subdir_requires="cp objc"'.
  3534. 'target_libs'
  3535. If defined, this variable lists (space-separated) targets in the
  3536. top level 'Makefile' to build the runtime libraries for this
  3537. language, such as 'target-libobjc'.
  3538. 'lang_dirs'
  3539. If defined, this variable lists (space-separated) top level
  3540. directories (parallel to 'gcc'), apart from the runtime libraries,
  3541. that should not be configured if this front end is not built.
  3542. 'build_by_default'
  3543. If defined to 'no', this language front end is not built unless
  3544. enabled in a '--enable-languages' argument. Otherwise, front ends
  3545. are built by default, subject to any special logic in
  3546. 'configure.ac' (as is present to disable the Ada front end if the
  3547. Ada compiler is not already installed).
  3548. 'boot_language'
  3549. If defined to 'yes', this front end is built in stage1 of the
  3550. bootstrap. This is only relevant to front ends written in their
  3551. own languages.
  3552. 'compilers'
  3553. If defined, a space-separated list of compiler executables that
  3554. will be run by the driver. The names here will each end with
  3555. '\$(exeext)'.
  3556. 'outputs'
  3557. If defined, a space-separated list of files that should be
  3558. generated by 'configure' substituting values in them. This
  3559. mechanism can be used to create a file 'LANGUAGE/Makefile' from
  3560. 'LANGUAGE/Makefile.in', but this is deprecated, building everything
  3561. from the single 'gcc/Makefile' is preferred.
  3562. 'gtfiles'
  3563. If defined, a space-separated list of files that should be scanned
  3564. by 'gengtype.c' to generate the garbage collection tables and
  3565. routines for this language. This excludes the files that are
  3566. common to all front ends. *Note Type Information::.
  3567. 
  3568. File: gccint.info, Node: Front End Makefile, Prev: Front End Config, Up: Front End
  3569. 6.3.8.3 The Front End 'Make-lang.in' File
  3570. .........................................
  3571. Each language subdirectory contains a 'Make-lang.in' file. It contains
  3572. targets 'LANG.HOOK' (where 'LANG' is the setting of 'language' in
  3573. 'config-lang.in') for the following values of 'HOOK', and any other
  3574. Makefile rules required to build those targets (which may if necessary
  3575. use other Makefiles specified in 'outputs' in 'config-lang.in', although
  3576. this is deprecated). It also adds any testsuite targets that can use
  3577. the standard rule in 'gcc/Makefile.in' to the variable 'lang_checks'.
  3578. 'all.cross'
  3579. 'start.encap'
  3580. 'rest.encap'
  3581. FIXME: exactly what goes in each of these targets?
  3582. 'tags'
  3583. Build an 'etags' 'TAGS' file in the language subdirectory in the
  3584. source tree.
  3585. 'info'
  3586. Build info documentation for the front end, in the build directory.
  3587. This target is only called by 'make bootstrap' if a suitable
  3588. version of 'makeinfo' is available, so does not need to check for
  3589. this, and should fail if an error occurs.
  3590. 'dvi'
  3591. Build DVI documentation for the front end, in the build directory.
  3592. This should be done using '$(TEXI2DVI)', with appropriate '-I'
  3593. arguments pointing to directories of included files.
  3594. 'pdf'
  3595. Build PDF documentation for the front end, in the build directory.
  3596. This should be done using '$(TEXI2PDF)', with appropriate '-I'
  3597. arguments pointing to directories of included files.
  3598. 'html'
  3599. Build HTML documentation for the front end, in the build directory.
  3600. 'man'
  3601. Build generated man pages for the front end from Texinfo manuals
  3602. (*note Man Page Generation::), in the build directory. This target
  3603. is only called if the necessary tools are available, but should
  3604. ignore errors so as not to stop the build if errors occur; man
  3605. pages are optional and the tools involved may be installed in a
  3606. broken way.
  3607. 'install-common'
  3608. Install everything that is part of the front end, apart from the
  3609. compiler executables listed in 'compilers' in 'config-lang.in'.
  3610. 'install-info'
  3611. Install info documentation for the front end, if it is present in
  3612. the source directory. This target should have dependencies on info
  3613. files that should be installed.
  3614. 'install-man'
  3615. Install man pages for the front end. This target should ignore
  3616. errors.
  3617. 'install-plugin'
  3618. Install headers needed for plugins.
  3619. 'srcextra'
  3620. Copies its dependencies into the source directory. This generally
  3621. should be used for generated files such as Bison output files which
  3622. are not version-controlled, but should be included in any release
  3623. tarballs. This target will be executed during a bootstrap if
  3624. '--enable-generated-files-in-srcdir' was specified as a 'configure'
  3625. option.
  3626. 'srcinfo'
  3627. 'srcman'
  3628. Copies its dependencies into the source directory. These targets
  3629. will be executed during a bootstrap if
  3630. '--enable-generated-files-in-srcdir' was specified as a 'configure'
  3631. option.
  3632. 'uninstall'
  3633. Uninstall files installed by installing the compiler. This is
  3634. currently documented not to be supported, so the hook need not do
  3635. anything.
  3636. 'mostlyclean'
  3637. 'clean'
  3638. 'distclean'
  3639. 'maintainer-clean'
  3640. The language parts of the standard GNU '*clean' targets. *Note
  3641. Standard Targets for Users: (standards)Standard Targets, for
  3642. details of the standard targets. For GCC, 'maintainer-clean'
  3643. should delete all generated files in the source directory that are
  3644. not version-controlled, but should not delete anything that is.
  3645. 'Make-lang.in' must also define a variable 'LANG_OBJS' to a list of
  3646. host object files that are used by that language.
  3647. 
  3648. File: gccint.info, Node: Back End, Prev: Front End, Up: gcc Directory
  3649. 6.3.9 Anatomy of a Target Back End
  3650. ----------------------------------
  3651. A back end for a target architecture in GCC has the following parts:
  3652. * A directory 'MACHINE' under 'gcc/config', containing a machine
  3653. description 'MACHINE.md' file (*note Machine Descriptions: Machine
  3654. Desc.), header files 'MACHINE.h' and 'MACHINE-protos.h' and a
  3655. source file 'MACHINE.c' (*note Target Description Macros and
  3656. Functions: Target Macros.), possibly a target Makefile fragment
  3657. 't-MACHINE' (*note The Target Makefile Fragment: Target Fragment.),
  3658. and maybe some other files. The names of these files may be
  3659. changed from the defaults given by explicit specifications in
  3660. 'config.gcc'.
  3661. * If necessary, a file 'MACHINE-modes.def' in the 'MACHINE'
  3662. directory, containing additional machine modes to represent
  3663. condition codes. *Note Condition Code::, for further details.
  3664. * An optional 'MACHINE.opt' file in the 'MACHINE' directory,
  3665. containing a list of target-specific options. You can also add
  3666. other option files using the 'extra_options' variable in
  3667. 'config.gcc'. *Note Options::.
  3668. * Entries in 'config.gcc' (*note The 'config.gcc' File: System
  3669. Config.) for the systems with this target architecture.
  3670. * Documentation in 'gcc/doc/invoke.texi' for any command-line options
  3671. supported by this target (*note Run-time Target Specification:
  3672. Run-time Target.). This means both entries in the summary table of
  3673. options and details of the individual options.
  3674. * Documentation in 'gcc/doc/extend.texi' for any target-specific
  3675. attributes supported (*note Defining target-specific uses of
  3676. '__attribute__': Target Attributes.), including where the same
  3677. attribute is already supported on some targets, which are
  3678. enumerated in the manual.
  3679. * Documentation in 'gcc/doc/extend.texi' for any target-specific
  3680. pragmas supported.
  3681. * Documentation in 'gcc/doc/extend.texi' of any target-specific
  3682. built-in functions supported.
  3683. * Documentation in 'gcc/doc/extend.texi' of any target-specific
  3684. format checking styles supported.
  3685. * Documentation in 'gcc/doc/md.texi' of any target-specific
  3686. constraint letters (*note Constraints for Particular Machines:
  3687. Machine Constraints.).
  3688. * A note in 'gcc/doc/contrib.texi' under the person or people who
  3689. contributed the target support.
  3690. * Entries in 'gcc/doc/install.texi' for all target triplets supported
  3691. with this target architecture, giving details of any special notes
  3692. about installation for this target, or saying that there are no
  3693. special notes if there are none.
  3694. * Possibly other support outside the 'gcc' directory for runtime
  3695. libraries. FIXME: reference docs for this. The 'libstdc++'
  3696. porting manual needs to be installed as info for this to work, or
  3697. to be a chapter of this manual.
  3698. The 'MACHINE.h' header is included very early in GCC's standard
  3699. sequence of header files, while 'MACHINE-protos.h' is included late in
  3700. the sequence. Thus 'MACHINE-protos.h' can include declarations
  3701. referencing types that are not defined when 'MACHINE.h' is included,
  3702. specifically including those from 'rtl.h' and 'tree.h'. Since both RTL
  3703. and tree types may not be available in every context where
  3704. 'MACHINE-protos.h' is included, in this file you should guard
  3705. declarations using these types inside appropriate '#ifdef RTX_CODE' or
  3706. '#ifdef TREE_CODE' conditional code segments.
  3707. If the backend uses shared data structures that require 'GTY' markers
  3708. for garbage collection (*note Type Information::), you must declare
  3709. those in 'MACHINE.h' rather than 'MACHINE-protos.h'. Any definitions
  3710. required for building libgcc must also go in 'MACHINE.h'.
  3711. GCC uses the macro 'IN_TARGET_CODE' to distinguish between
  3712. machine-specific '.c' and '.cc' files and machine-independent '.c' and
  3713. '.cc' files. Machine-specific files should use the directive:
  3714. #define IN_TARGET_CODE 1
  3715. before including 'config.h'.
  3716. If the back end is added to the official GCC source repository, the
  3717. following are also necessary:
  3718. * An entry for the target architecture in 'readings.html' on the GCC
  3719. web site, with any relevant links.
  3720. * Details of the properties of the back end and target architecture
  3721. in 'backends.html' on the GCC web site.
  3722. * A news item about the contribution of support for that target
  3723. architecture, in 'index.html' on the GCC web site.
  3724. * Normally, one or more maintainers of that target listed in
  3725. 'MAINTAINERS'. Some existing architectures may be unmaintained,
  3726. but it would be unusual to add support for a target that does not
  3727. have a maintainer when support is added.
  3728. * Target triplets covering all 'config.gcc' stanzas for the target,
  3729. in the list in 'contrib/config-list.mk'.
  3730. 
  3731. File: gccint.info, Node: Testsuites, Next: Options, Prev: Source Tree, Up: Top
  3732. 7 Testsuites
  3733. ************
  3734. GCC contains several testsuites to help maintain compiler quality. Most
  3735. of the runtime libraries and language front ends in GCC have testsuites.
  3736. Currently only the C language testsuites are documented here; FIXME:
  3737. document the others.
  3738. * Menu:
  3739. * Test Idioms:: Idioms used in testsuite code.
  3740. * Test Directives:: Directives used within DejaGnu tests.
  3741. * Ada Tests:: The Ada language testsuites.
  3742. * C Tests:: The C language testsuites.
  3743. * LTO Testing:: Support for testing link-time optimizations.
  3744. * gcov Testing:: Support for testing gcov.
  3745. * profopt Testing:: Support for testing profile-directed optimizations.
  3746. * compat Testing:: Support for testing binary compatibility.
  3747. * Torture Tests:: Support for torture testing using multiple options.
  3748. * GIMPLE Tests:: Support for testing GIMPLE passes.
  3749. * RTL Tests:: Support for testing RTL passes.
  3750. 
  3751. File: gccint.info, Node: Test Idioms, Next: Test Directives, Up: Testsuites
  3752. 7.1 Idioms Used in Testsuite Code
  3753. =================================
  3754. In general, C testcases have a trailing '-N.c', starting with '-1.c', in
  3755. case other testcases with similar names are added later. If the test is
  3756. a test of some well-defined feature, it should have a name referring to
  3757. that feature such as 'FEATURE-1.c'. If it does not test a well-defined
  3758. feature but just happens to exercise a bug somewhere in the compiler,
  3759. and a bug report has been filed for this bug in the GCC bug database,
  3760. 'prBUG-NUMBER-1.c' is the appropriate form of name. Otherwise (for
  3761. miscellaneous bugs not filed in the GCC bug database), and previously
  3762. more generally, test cases are named after the date on which they were
  3763. added. This allows people to tell at a glance whether a test failure is
  3764. because of a recently found bug that has not yet been fixed, or whether
  3765. it may be a regression, but does not give any other information about
  3766. the bug or where discussion of it may be found. Some other language
  3767. testsuites follow similar conventions.
  3768. In the 'gcc.dg' testsuite, it is often necessary to test that an error
  3769. is indeed a hard error and not just a warning--for example, where it is
  3770. a constraint violation in the C standard, which must become an error
  3771. with '-pedantic-errors'. The following idiom, where the first line
  3772. shown is line LINE of the file and the line that generates the error, is
  3773. used for this:
  3774. /* { dg-bogus "warning" "warning in place of error" } */
  3775. /* { dg-error "REGEXP" "MESSAGE" { target *-*-* } LINE } */
  3776. It may be necessary to check that an expression is an integer constant
  3777. expression and has a certain value. To check that 'E' has value 'V', an
  3778. idiom similar to the following is used:
  3779. char x[((E) == (V) ? 1 : -1)];
  3780. In 'gcc.dg' tests, '__typeof__' is sometimes used to make assertions
  3781. about the types of expressions. See, for example,
  3782. 'gcc.dg/c99-condexpr-1.c'. The more subtle uses depend on the exact
  3783. rules for the types of conditional expressions in the C standard; see,
  3784. for example, 'gcc.dg/c99-intconst-1.c'.
  3785. It is useful to be able to test that optimizations are being made
  3786. properly. This cannot be done in all cases, but it can be done where
  3787. the optimization will lead to code being optimized away (for example,
  3788. where flow analysis or alias analysis should show that certain code
  3789. cannot be called) or to functions not being called because they have
  3790. been expanded as built-in functions. Such tests go in
  3791. 'gcc.c-torture/execute'. Where code should be optimized away, a call to
  3792. a nonexistent function such as 'link_failure ()' may be inserted; a
  3793. definition
  3794. #ifndef __OPTIMIZE__
  3795. void
  3796. link_failure (void)
  3797. {
  3798. abort ();
  3799. }
  3800. #endif
  3801. will also be needed so that linking still succeeds when the test is run
  3802. without optimization. When all calls to a built-in function should have
  3803. been optimized and no calls to the non-built-in version of the function
  3804. should remain, that function may be defined as 'static' to call 'abort
  3805. ()' (although redeclaring a function as static may not work on all
  3806. targets).
  3807. All testcases must be portable. Target-specific testcases must have
  3808. appropriate code to avoid causing failures on unsupported systems;
  3809. unfortunately, the mechanisms for this differ by directory.
  3810. FIXME: discuss non-C testsuites here.
  3811. 
  3812. File: gccint.info, Node: Test Directives, Next: Ada Tests, Prev: Test Idioms, Up: Testsuites
  3813. 7.2 Directives used within DejaGnu tests
  3814. ========================================
  3815. * Menu:
  3816. * Directives:: Syntax and descriptions of test directives.
  3817. * Selectors:: Selecting targets to which a test applies.
  3818. * Effective-Target Keywords:: Keywords describing target attributes.
  3819. * Add Options:: Features for 'dg-add-options'
  3820. * Require Support:: Variants of 'dg-require-SUPPORT'
  3821. * Final Actions:: Commands for use in 'dg-final'
  3822. 
  3823. File: gccint.info, Node: Directives, Next: Selectors, Up: Test Directives
  3824. 7.2.1 Syntax and Descriptions of test directives
  3825. ------------------------------------------------
  3826. Test directives appear within comments in a test source file and begin
  3827. with 'dg-'. Some of these are defined within DejaGnu and others are
  3828. local to the GCC testsuite.
  3829. The order in which test directives appear in a test can be important:
  3830. directives local to GCC sometimes override information used by the
  3831. DejaGnu directives, which know nothing about the GCC directives, so the
  3832. DejaGnu directives must precede GCC directives.
  3833. Several test directives include selectors (*note Selectors::) which are
  3834. usually preceded by the keyword 'target' or 'xfail'.
  3835. 7.2.1.1 Specify how to build the test
  3836. .....................................
  3837. '{ dg-do DO-WHAT-KEYWORD [{ target/xfail SELECTOR }] }'
  3838. DO-WHAT-KEYWORD specifies how the test is compiled and whether it
  3839. is executed. It is one of:
  3840. 'preprocess'
  3841. Compile with '-E' to run only the preprocessor.
  3842. 'compile'
  3843. Compile with '-S' to produce an assembly code file.
  3844. 'assemble'
  3845. Compile with '-c' to produce a relocatable object file.
  3846. 'link'
  3847. Compile, assemble, and link to produce an executable file.
  3848. 'run'
  3849. Produce and run an executable file, which is expected to
  3850. return an exit code of 0.
  3851. The default is 'compile'. That can be overridden for a set of
  3852. tests by redefining 'dg-do-what-default' within the '.exp' file for
  3853. those tests.
  3854. If the directive includes the optional '{ target SELECTOR }' then
  3855. the test is skipped unless the target system matches the SELECTOR.
  3856. If DO-WHAT-KEYWORD is 'run' and the directive includes the optional
  3857. '{ xfail SELECTOR }' and the selector is met then the test is
  3858. expected to fail. The 'xfail' clause is ignored for other values
  3859. of DO-WHAT-KEYWORD; those tests can use directive 'dg-xfail-if'.
  3860. 7.2.1.2 Specify additional compiler options
  3861. ...........................................
  3862. '{ dg-options OPTIONS [{ target SELECTOR }] }'
  3863. This DejaGnu directive provides a list of compiler options, to be
  3864. used if the target system matches SELECTOR, that replace the
  3865. default options used for this set of tests.
  3866. '{ dg-add-options FEATURE ... }'
  3867. Add any compiler options that are needed to access certain
  3868. features. This directive does nothing on targets that enable the
  3869. features by default, or that don't provide them at all. It must
  3870. come after all 'dg-options' directives. For supported values of
  3871. FEATURE see *note Add Options::.
  3872. '{ dg-additional-options OPTIONS [{ target SELECTOR }] }'
  3873. This directive provides a list of compiler options, to be used if
  3874. the target system matches SELECTOR, that are added to the default
  3875. options used for this set of tests.
  3876. 7.2.1.3 Modify the test timeout value
  3877. .....................................
  3878. The normal timeout limit, in seconds, is found by searching the
  3879. following in order:
  3880. * the value defined by an earlier 'dg-timeout' directive in the test
  3881. * variable TOOL_TIMEOUT defined by the set of tests
  3882. * GCC,TIMEOUT set in the target board
  3883. * 300
  3884. '{ dg-timeout N [{target SELECTOR }] }'
  3885. Set the time limit for the compilation and for the execution of the
  3886. test to the specified number of seconds.
  3887. '{ dg-timeout-factor X [{ target SELECTOR }] }'
  3888. Multiply the normal time limit for compilation and execution of the
  3889. test by the specified floating-point factor.
  3890. 7.2.1.4 Skip a test for some targets
  3891. ....................................
  3892. '{ dg-skip-if COMMENT { SELECTOR } [{ INCLUDE-OPTS } [{ EXCLUDE-OPTS }]] }'
  3893. Arguments INCLUDE-OPTS and EXCLUDE-OPTS are lists in which each
  3894. element is a string of zero or more GCC options. Skip the test if
  3895. all of the following conditions are met:
  3896. * the test system is included in SELECTOR
  3897. * for at least one of the option strings in INCLUDE-OPTS, every
  3898. option from that string is in the set of options with which
  3899. the test would be compiled; use '"*"' for an INCLUDE-OPTS list
  3900. that matches any options; that is the default if INCLUDE-OPTS
  3901. is not specified
  3902. * for each of the option strings in EXCLUDE-OPTS, at least one
  3903. option from that string is not in the set of options with
  3904. which the test would be compiled; use '""' for an empty
  3905. EXCLUDE-OPTS list; that is the default if EXCLUDE-OPTS is not
  3906. specified
  3907. For example, to skip a test if option '-Os' is present:
  3908. /* { dg-skip-if "" { *-*-* } { "-Os" } { "" } } */
  3909. To skip a test if both options '-O2' and '-g' are present:
  3910. /* { dg-skip-if "" { *-*-* } { "-O2 -g" } { "" } } */
  3911. To skip a test if either '-O2' or '-O3' is present:
  3912. /* { dg-skip-if "" { *-*-* } { "-O2" "-O3" } { "" } } */
  3913. To skip a test unless option '-Os' is present:
  3914. /* { dg-skip-if "" { *-*-* } { "*" } { "-Os" } } */
  3915. To skip a test if either '-O2' or '-O3' is used with '-g' but not
  3916. if '-fpic' is also present:
  3917. /* { dg-skip-if "" { *-*-* } { "-O2 -g" "-O3 -g" } { "-fpic" } } */
  3918. '{ dg-require-effective-target KEYWORD [{ SELECTOR }] }'
  3919. Skip the test if the test target, including current multilib flags,
  3920. is not covered by the effective-target keyword. If the directive
  3921. includes the optional '{ SELECTOR }' then the effective-target test
  3922. is only performed if the target system matches the SELECTOR. This
  3923. directive must appear after any 'dg-do' directive in the test and
  3924. before any 'dg-additional-sources' directive. *Note
  3925. Effective-Target Keywords::.
  3926. '{ dg-require-SUPPORT args }'
  3927. Skip the test if the target does not provide the required support.
  3928. These directives must appear after any 'dg-do' directive in the
  3929. test and before any 'dg-additional-sources' directive. They
  3930. require at least one argument, which can be an empty string if the
  3931. specific procedure does not examine the argument. *Note Require
  3932. Support::, for a complete list of these directives.
  3933. 7.2.1.5 Expect a test to fail for some targets
  3934. ..............................................
  3935. '{ dg-xfail-if COMMENT { SELECTOR } [{ INCLUDE-OPTS } [{ EXCLUDE-OPTS }]] }'
  3936. Expect the test to fail if the conditions (which are the same as
  3937. for 'dg-skip-if') are met. This does not affect the execute step.
  3938. '{ dg-xfail-run-if COMMENT { SELECTOR } [{ INCLUDE-OPTS } [{ EXCLUDE-OPTS }]] }'
  3939. Expect the execute step of a test to fail if the conditions (which
  3940. are the same as for 'dg-skip-if') are met.
  3941. 7.2.1.6 Expect the test executable to fail
  3942. ..........................................
  3943. '{ dg-shouldfail COMMENT [{ SELECTOR } [{ INCLUDE-OPTS } [{ EXCLUDE-OPTS }]]] }'
  3944. Expect the test executable to return a nonzero exit status if the
  3945. conditions (which are the same as for 'dg-skip-if') are met.
  3946. 7.2.1.7 Verify compiler messages
  3947. ................................
  3948. Where LINE is an accepted argument for these commands, a value of '0'
  3949. can be used if there is no line associated with the message.
  3950. '{ dg-error REGEXP [COMMENT [{ target/xfail SELECTOR } [LINE] ]] }'
  3951. This DejaGnu directive appears on a source line that is expected to
  3952. get an error message, or else specifies the source line associated
  3953. with the message. If there is no message for that line or if the
  3954. text of that message is not matched by REGEXP then the check fails
  3955. and COMMENT is included in the 'FAIL' message. The check does not
  3956. look for the string 'error' unless it is part of REGEXP.
  3957. '{ dg-warning REGEXP [COMMENT [{ target/xfail SELECTOR } [LINE] ]] }'
  3958. This DejaGnu directive appears on a source line that is expected to
  3959. get a warning message, or else specifies the source line associated
  3960. with the message. If there is no message for that line or if the
  3961. text of that message is not matched by REGEXP then the check fails
  3962. and COMMENT is included in the 'FAIL' message. The check does not
  3963. look for the string 'warning' unless it is part of REGEXP.
  3964. '{ dg-message REGEXP [COMMENT [{ target/xfail SELECTOR } [LINE] ]] }'
  3965. The line is expected to get a message other than an error or
  3966. warning. If there is no message for that line or if the text of
  3967. that message is not matched by REGEXP then the check fails and
  3968. COMMENT is included in the 'FAIL' message.
  3969. '{ dg-bogus REGEXP [COMMENT [{ target/xfail SELECTOR } [LINE] ]] }'
  3970. This DejaGnu directive appears on a source line that should not get
  3971. a message matching REGEXP, or else specifies the source line
  3972. associated with the bogus message. It is usually used with 'xfail'
  3973. to indicate that the message is a known problem for a particular
  3974. set of targets.
  3975. '{ dg-line LINENUMVAR }'
  3976. This DejaGnu directive sets the variable LINENUMVAR to the line
  3977. number of the source line. The variable LINENUMVAR can then be
  3978. used in subsequent 'dg-error', 'dg-warning', 'dg-message' and
  3979. 'dg-bogus' directives. For example:
  3980. int a; /* { dg-line first_def_a } */
  3981. float a; /* { dg-error "conflicting types of" } */
  3982. /* { dg-message "previous declaration of" "" { target *-*-* } first_def_a } */
  3983. '{ dg-excess-errors COMMENT [{ target/xfail SELECTOR }] }'
  3984. This DejaGnu directive indicates that the test is expected to fail
  3985. due to compiler messages that are not handled by 'dg-error',
  3986. 'dg-warning' or 'dg-bogus'. For this directive 'xfail' has the
  3987. same effect as 'target'.
  3988. '{ dg-prune-output REGEXP }'
  3989. Prune messages matching REGEXP from the test output.
  3990. 7.2.1.8 Verify output of the test executable
  3991. ............................................
  3992. '{ dg-output REGEXP [{ target/xfail SELECTOR }] }'
  3993. This DejaGnu directive compares REGEXP to the combined output that
  3994. the test executable writes to 'stdout' and 'stderr'.
  3995. 7.2.1.9 Specify environment variables for a test
  3996. ................................................
  3997. '{ dg-set-compiler-env-var VAR_NAME "VAR_VALUE" }'
  3998. Specify that the environment variable VAR_NAME needs to be set to
  3999. VAR_VALUE before invoking the compiler on the test file.
  4000. '{ dg-set-target-env-var VAR_NAME "VAR_VALUE" }'
  4001. Specify that the environment variable VAR_NAME needs to be set to
  4002. VAR_VALUE before execution of the program created by the test.
  4003. 7.2.1.10 Specify additional files for a test
  4004. ............................................
  4005. '{ dg-additional-files "FILELIST" }'
  4006. Specify additional files, other than source files, that must be
  4007. copied to the system where the compiler runs.
  4008. '{ dg-additional-sources "FILELIST" }'
  4009. Specify additional source files to appear in the compile line
  4010. following the main test file.
  4011. 7.2.1.11 Add checks at the end of a test
  4012. ........................................
  4013. '{ dg-final { LOCAL-DIRECTIVE } }'
  4014. This DejaGnu directive is placed within a comment anywhere in the
  4015. source file and is processed after the test has been compiled and
  4016. run. Multiple 'dg-final' commands are processed in the order in
  4017. which they appear in the source file. *Note Final Actions::, for a
  4018. list of directives that can be used within 'dg-final'.
  4019. 
  4020. File: gccint.info, Node: Selectors, Next: Effective-Target Keywords, Prev: Directives, Up: Test Directives
  4021. 7.2.2 Selecting targets to which a test applies
  4022. -----------------------------------------------
  4023. Several test directives include SELECTORs to limit the targets for which
  4024. a test is run or to declare that a test is expected to fail on
  4025. particular targets.
  4026. A selector is:
  4027. * one or more target triplets, possibly including wildcard
  4028. characters; use '*-*-*' to match any target
  4029. * a single effective-target keyword (*note Effective-Target
  4030. Keywords::)
  4031. * a logical expression
  4032. Depending on the context, the selector specifies whether a test is
  4033. skipped and reported as unsupported or is expected to fail. A context
  4034. that allows either 'target' or 'xfail' also allows '{ target SELECTOR1
  4035. xfail SELECTOR2 }' to skip the test for targets that don't match
  4036. SELECTOR1 and the test to fail for targets that match SELECTOR2.
  4037. A selector expression appears within curly braces and uses a single
  4038. logical operator: one of '!', '&&', or '||'. An operand is another
  4039. selector expression, an effective-target keyword, a single target
  4040. triplet, or a list of target triplets within quotes or curly braces.
  4041. For example:
  4042. { target { ! "hppa*-*-* ia64*-*-*" } }
  4043. { target { powerpc*-*-* && lp64 } }
  4044. { xfail { lp64 || vect_no_align } }
  4045. 
  4046. File: gccint.info, Node: Effective-Target Keywords, Next: Add Options, Prev: Selectors, Up: Test Directives
  4047. 7.2.3 Keywords describing target attributes
  4048. -------------------------------------------
  4049. Effective-target keywords identify sets of targets that support
  4050. particular functionality. They are used to limit tests to be run only
  4051. for particular targets, or to specify that particular sets of targets
  4052. are expected to fail some tests.
  4053. Effective-target keywords are defined in 'lib/target-supports.exp' in
  4054. the GCC testsuite, with the exception of those that are documented as
  4055. being local to a particular test directory.
  4056. The 'effective target' takes into account all of the compiler options
  4057. with which the test will be compiled, including the multilib options.
  4058. By convention, keywords ending in '_nocache' can also include options
  4059. specified for the particular test in an earlier 'dg-options' or
  4060. 'dg-add-options' directive.
  4061. 7.2.3.1 Endianness
  4062. ..................
  4063. 'be'
  4064. Target uses big-endian memory order for multi-byte and multi-word
  4065. data.
  4066. 'le'
  4067. Target uses little-endian memory order for multi-byte and
  4068. multi-word data.
  4069. 7.2.3.2 Data type sizes
  4070. .......................
  4071. 'ilp32'
  4072. Target has 32-bit 'int', 'long', and pointers.
  4073. 'lp64'
  4074. Target has 32-bit 'int', 64-bit 'long' and pointers.
  4075. 'llp64'
  4076. Target has 32-bit 'int' and 'long', 64-bit 'long long' and
  4077. pointers.
  4078. 'double64'
  4079. Target has 64-bit 'double'.
  4080. 'double64plus'
  4081. Target has 'double' that is 64 bits or longer.
  4082. 'longdouble128'
  4083. Target has 128-bit 'long double'.
  4084. 'int32plus'
  4085. Target has 'int' that is at 32 bits or longer.
  4086. 'int16'
  4087. Target has 'int' that is 16 bits or shorter.
  4088. 'longlong64'
  4089. Target has 64-bit 'long long'.
  4090. 'long_neq_int'
  4091. Target has 'int' and 'long' with different sizes.
  4092. 'int_eq_float'
  4093. Target has 'int' and 'float' with the same size.
  4094. 'ptr_eq_long'
  4095. Target has pointers ('void *') and 'long' with the same size.
  4096. 'large_double'
  4097. Target supports 'double' that is longer than 'float'.
  4098. 'large_long_double'
  4099. Target supports 'long double' that is longer than 'double'.
  4100. 'ptr32plus'
  4101. Target has pointers that are 32 bits or longer.
  4102. 'size20plus'
  4103. Target has a 20-bit or larger address space, so at least supports
  4104. 16-bit array and structure sizes.
  4105. 'size32plus'
  4106. Target has a 32-bit or larger address space, so at least supports
  4107. 24-bit array and structure sizes.
  4108. '4byte_wchar_t'
  4109. Target has 'wchar_t' that is at least 4 bytes.
  4110. 'floatN'
  4111. Target has the '_FloatN' type.
  4112. 'floatNx'
  4113. Target has the '_FloatNx' type.
  4114. 'floatN_runtime'
  4115. Target has the '_FloatN' type, including runtime support for any
  4116. options added with 'dg-add-options'.
  4117. 'floatNx_runtime'
  4118. Target has the '_FloatNx' type, including runtime support for any
  4119. options added with 'dg-add-options'.
  4120. 'floatn_nx_runtime'
  4121. Target has runtime support for any options added with
  4122. 'dg-add-options' for any '_FloatN' or '_FloatNx' type.
  4123. 'inf'
  4124. Target supports floating point infinite ('inf') for type 'double'.
  4125. 7.2.3.3 Fortran-specific attributes
  4126. ...................................
  4127. 'fortran_integer_16'
  4128. Target supports Fortran 'integer' that is 16 bytes or longer.
  4129. 'fortran_real_10'
  4130. Target supports Fortran 'real' that is 10 bytes or longer.
  4131. 'fortran_real_16'
  4132. Target supports Fortran 'real' that is 16 bytes or longer.
  4133. 'fortran_large_int'
  4134. Target supports Fortran 'integer' kinds larger than 'integer(8)'.
  4135. 'fortran_large_real'
  4136. Target supports Fortran 'real' kinds larger than 'real(8)'.
  4137. 7.2.3.4 Vector-specific attributes
  4138. ..................................
  4139. 'vect_align_stack_vars'
  4140. The target's ABI allows stack variables to be aligned to the
  4141. preferred vector alignment.
  4142. 'vect_avg_qi'
  4143. Target supports both signed and unsigned averaging operations on
  4144. vectors of bytes.
  4145. 'vect_mulhrs_hi'
  4146. Target supports both signed and unsigned
  4147. multiply-high-with-round-and-scale operations on vectors of
  4148. half-words.
  4149. 'vect_sdiv_pow2_si'
  4150. Target supports signed division by constant power-of-2 operations
  4151. on vectors of 4-byte integers.
  4152. 'vect_condition'
  4153. Target supports vector conditional operations.
  4154. 'vect_cond_mixed'
  4155. Target supports vector conditional operations where comparison
  4156. operands have different type from the value operands.
  4157. 'vect_double'
  4158. Target supports hardware vectors of 'double'.
  4159. 'vect_double_cond_arith'
  4160. Target supports conditional addition, subtraction, multiplication,
  4161. division, minimum and maximum on vectors of 'double', via the
  4162. 'cond_' optabs.
  4163. 'vect_element_align_preferred'
  4164. The target's preferred vector alignment is the same as the element
  4165. alignment.
  4166. 'vect_float'
  4167. Target supports hardware vectors of 'float' when
  4168. '-funsafe-math-optimizations' is in effect.
  4169. 'vect_float_strict'
  4170. Target supports hardware vectors of 'float' when
  4171. '-funsafe-math-optimizations' is not in effect. This implies
  4172. 'vect_float'.
  4173. 'vect_int'
  4174. Target supports hardware vectors of 'int'.
  4175. 'vect_long'
  4176. Target supports hardware vectors of 'long'.
  4177. 'vect_long_long'
  4178. Target supports hardware vectors of 'long long'.
  4179. 'vect_check_ptrs'
  4180. Target supports the 'check_raw_ptrs' and 'check_war_ptrs' optabs on
  4181. vectors.
  4182. 'vect_fully_masked'
  4183. Target supports fully-masked (also known as fully-predicated)
  4184. loops, so that vector loops can handle partial as well as full
  4185. vectors.
  4186. 'vect_masked_store'
  4187. Target supports vector masked stores.
  4188. 'vect_scatter_store'
  4189. Target supports vector scatter stores.
  4190. 'vect_aligned_arrays'
  4191. Target aligns arrays to vector alignment boundary.
  4192. 'vect_hw_misalign'
  4193. Target supports a vector misalign access.
  4194. 'vect_no_align'
  4195. Target does not support a vector alignment mechanism.
  4196. 'vect_peeling_profitable'
  4197. Target might require to peel loops for alignment purposes.
  4198. 'vect_no_int_min_max'
  4199. Target does not support a vector min and max instruction on 'int'.
  4200. 'vect_no_int_add'
  4201. Target does not support a vector add instruction on 'int'.
  4202. 'vect_no_bitwise'
  4203. Target does not support vector bitwise instructions.
  4204. 'vect_bool_cmp'
  4205. Target supports comparison of 'bool' vectors for at least one
  4206. vector length.
  4207. 'vect_char_add'
  4208. Target supports addition of 'char' vectors for at least one vector
  4209. length.
  4210. 'vect_char_mult'
  4211. Target supports 'vector char' multiplication.
  4212. 'vect_short_mult'
  4213. Target supports 'vector short' multiplication.
  4214. 'vect_int_mult'
  4215. Target supports 'vector int' multiplication.
  4216. 'vect_long_mult'
  4217. Target supports 64 bit 'vector long' multiplication.
  4218. 'vect_extract_even_odd'
  4219. Target supports vector even/odd element extraction.
  4220. 'vect_extract_even_odd_wide'
  4221. Target supports vector even/odd element extraction of vectors with
  4222. elements 'SImode' or larger.
  4223. 'vect_interleave'
  4224. Target supports vector interleaving.
  4225. 'vect_strided'
  4226. Target supports vector interleaving and extract even/odd.
  4227. 'vect_strided_wide'
  4228. Target supports vector interleaving and extract even/odd for wide
  4229. element types.
  4230. 'vect_perm'
  4231. Target supports vector permutation.
  4232. 'vect_perm_byte'
  4233. Target supports permutation of vectors with 8-bit elements.
  4234. 'vect_perm_short'
  4235. Target supports permutation of vectors with 16-bit elements.
  4236. 'vect_perm3_byte'
  4237. Target supports permutation of vectors with 8-bit elements, and for
  4238. the default vector length it is possible to permute:
  4239. { a0, a1, a2, b0, b1, b2, ... }
  4240. to:
  4241. { a0, a0, a0, b0, b0, b0, ... }
  4242. { a1, a1, a1, b1, b1, b1, ... }
  4243. { a2, a2, a2, b2, b2, b2, ... }
  4244. using only two-vector permutes, regardless of how long the sequence
  4245. is.
  4246. 'vect_perm3_int'
  4247. Like 'vect_perm3_byte', but for 32-bit elements.
  4248. 'vect_perm3_short'
  4249. Like 'vect_perm3_byte', but for 16-bit elements.
  4250. 'vect_shift'
  4251. Target supports a hardware vector shift operation.
  4252. 'vect_unaligned_possible'
  4253. Target prefers vectors to have an alignment greater than element
  4254. alignment, but also allows unaligned vector accesses in some
  4255. circumstances.
  4256. 'vect_variable_length'
  4257. Target has variable-length vectors.
  4258. 'vect_widen_sum_hi_to_si'
  4259. Target supports a vector widening summation of 'short' operands
  4260. into 'int' results, or can promote (unpack) from 'short' to 'int'.
  4261. 'vect_widen_sum_qi_to_hi'
  4262. Target supports a vector widening summation of 'char' operands into
  4263. 'short' results, or can promote (unpack) from 'char' to 'short'.
  4264. 'vect_widen_sum_qi_to_si'
  4265. Target supports a vector widening summation of 'char' operands into
  4266. 'int' results.
  4267. 'vect_widen_mult_qi_to_hi'
  4268. Target supports a vector widening multiplication of 'char' operands
  4269. into 'short' results, or can promote (unpack) from 'char' to
  4270. 'short' and perform non-widening multiplication of 'short'.
  4271. 'vect_widen_mult_hi_to_si'
  4272. Target supports a vector widening multiplication of 'short'
  4273. operands into 'int' results, or can promote (unpack) from 'short'
  4274. to 'int' and perform non-widening multiplication of 'int'.
  4275. 'vect_widen_mult_si_to_di_pattern'
  4276. Target supports a vector widening multiplication of 'int' operands
  4277. into 'long' results.
  4278. 'vect_sdot_qi'
  4279. Target supports a vector dot-product of 'signed char'.
  4280. 'vect_udot_qi'
  4281. Target supports a vector dot-product of 'unsigned char'.
  4282. 'vect_sdot_hi'
  4283. Target supports a vector dot-product of 'signed short'.
  4284. 'vect_udot_hi'
  4285. Target supports a vector dot-product of 'unsigned short'.
  4286. 'vect_pack_trunc'
  4287. Target supports a vector demotion (packing) of 'short' to 'char'
  4288. and from 'int' to 'short' using modulo arithmetic.
  4289. 'vect_unpack'
  4290. Target supports a vector promotion (unpacking) of 'char' to 'short'
  4291. and from 'char' to 'int'.
  4292. 'vect_intfloat_cvt'
  4293. Target supports conversion from 'signed int' to 'float'.
  4294. 'vect_uintfloat_cvt'
  4295. Target supports conversion from 'unsigned int' to 'float'.
  4296. 'vect_floatint_cvt'
  4297. Target supports conversion from 'float' to 'signed int'.
  4298. 'vect_floatuint_cvt'
  4299. Target supports conversion from 'float' to 'unsigned int'.
  4300. 'vect_intdouble_cvt'
  4301. Target supports conversion from 'signed int' to 'double'.
  4302. 'vect_doubleint_cvt'
  4303. Target supports conversion from 'double' to 'signed int'.
  4304. 'vect_max_reduc'
  4305. Target supports max reduction for vectors.
  4306. 'vect_sizes_16B_8B'
  4307. Target supports 16- and 8-bytes vectors.
  4308. 'vect_sizes_32B_16B'
  4309. Target supports 32- and 16-bytes vectors.
  4310. 'vect_logical_reduc'
  4311. Target supports AND, IOR and XOR reduction on vectors.
  4312. 'vect_fold_extract_last'
  4313. Target supports the 'fold_extract_last' optab.
  4314. 7.2.3.5 Thread Local Storage attributes
  4315. .......................................
  4316. 'tls'
  4317. Target supports thread-local storage.
  4318. 'tls_native'
  4319. Target supports native (rather than emulated) thread-local storage.
  4320. 'tls_runtime'
  4321. Test system supports executing TLS executables.
  4322. 7.2.3.6 Decimal floating point attributes
  4323. .........................................
  4324. 'dfp'
  4325. Targets supports compiling decimal floating point extension to C.
  4326. 'dfp_nocache'
  4327. Including the options used to compile this particular test, the
  4328. target supports compiling decimal floating point extension to C.
  4329. 'dfprt'
  4330. Test system can execute decimal floating point tests.
  4331. 'dfprt_nocache'
  4332. Including the options used to compile this particular test, the
  4333. test system can execute decimal floating point tests.
  4334. 'hard_dfp'
  4335. Target generates decimal floating point instructions with current
  4336. options.
  4337. 7.2.3.7 ARM-specific attributes
  4338. ...............................
  4339. 'arm32'
  4340. ARM target generates 32-bit code.
  4341. 'arm_little_endian'
  4342. ARM target that generates little-endian code.
  4343. 'arm_eabi'
  4344. ARM target adheres to the ABI for the ARM Architecture.
  4345. 'arm_fp_ok'
  4346. ARM target defines '__ARM_FP' using '-mfloat-abi=softfp' or
  4347. equivalent options. Some multilibs may be incompatible with these
  4348. options.
  4349. 'arm_fp_dp_ok'
  4350. ARM target defines '__ARM_FP' with double-precision support using
  4351. '-mfloat-abi=softfp' or equivalent options. Some multilibs may be
  4352. incompatible with these options.
  4353. 'arm_hf_eabi'
  4354. ARM target adheres to the VFP and Advanced SIMD Register Arguments
  4355. variant of the ABI for the ARM Architecture (as selected with
  4356. '-mfloat-abi=hard').
  4357. 'arm_softfloat'
  4358. ARM target uses the soft-float ABI with no floating-point
  4359. instructions used whatsoever (as selected with '-mfloat-abi=soft').
  4360. 'arm_hard_vfp_ok'
  4361. ARM target supports '-mfpu=vfp -mfloat-abi=hard'. Some multilibs
  4362. may be incompatible with these options.
  4363. 'arm_iwmmxt_ok'
  4364. ARM target supports '-mcpu=iwmmxt'. Some multilibs may be
  4365. incompatible with this option.
  4366. 'arm_neon'
  4367. ARM target supports generating NEON instructions.
  4368. 'arm_tune_string_ops_prefer_neon'
  4369. Test CPU tune supports inlining string operations with NEON
  4370. instructions.
  4371. 'arm_neon_hw'
  4372. Test system supports executing NEON instructions.
  4373. 'arm_neonv2_hw'
  4374. Test system supports executing NEON v2 instructions.
  4375. 'arm_neon_ok'
  4376. ARM Target supports '-mfpu=neon -mfloat-abi=softfp' or compatible
  4377. options. Some multilibs may be incompatible with these options.
  4378. 'arm_neon_ok_no_float_abi'
  4379. ARM Target supports NEON with '-mfpu=neon', but without any
  4380. -mfloat-abi= option. Some multilibs may be incompatible with this
  4381. option.
  4382. 'arm_neonv2_ok'
  4383. ARM Target supports '-mfpu=neon-vfpv4 -mfloat-abi=softfp' or
  4384. compatible options. Some multilibs may be incompatible with these
  4385. options.
  4386. 'arm_fp16_ok'
  4387. Target supports options to generate VFP half-precision
  4388. floating-point instructions. Some multilibs may be incompatible
  4389. with these options. This test is valid for ARM only.
  4390. 'arm_fp16_hw'
  4391. Target supports executing VFP half-precision floating-point
  4392. instructions. This test is valid for ARM only.
  4393. 'arm_neon_fp16_ok'
  4394. ARM Target supports '-mfpu=neon-fp16 -mfloat-abi=softfp' or
  4395. compatible options, including '-mfp16-format=ieee' if necessary to
  4396. obtain the '__fp16' type. Some multilibs may be incompatible with
  4397. these options.
  4398. 'arm_neon_fp16_hw'
  4399. Test system supports executing Neon half-precision float
  4400. instructions. (Implies previous.)
  4401. 'arm_fp16_alternative_ok'
  4402. ARM target supports the ARM FP16 alternative format. Some
  4403. multilibs may be incompatible with the options needed.
  4404. 'arm_fp16_none_ok'
  4405. ARM target supports specifying none as the ARM FP16 format.
  4406. 'arm_thumb1_ok'
  4407. ARM target generates Thumb-1 code for '-mthumb'.
  4408. 'arm_thumb2_ok'
  4409. ARM target generates Thumb-2 code for '-mthumb'.
  4410. 'arm_nothumb'
  4411. ARM target that is not using Thumb.
  4412. 'arm_vfp_ok'
  4413. ARM target supports '-mfpu=vfp -mfloat-abi=softfp'. Some multilibs
  4414. may be incompatible with these options.
  4415. 'arm_vfp3_ok'
  4416. ARM target supports '-mfpu=vfp3 -mfloat-abi=softfp'. Some
  4417. multilibs may be incompatible with these options.
  4418. 'arm_arch_v8a_hard_ok'
  4419. The compiler is targeting 'arm*-*-*' and can compile and assemble
  4420. code using the options '-march=armv8-a -mfpu=neon-fp-armv8
  4421. -mfloat-abi=hard'. This is not enough to guarantee that linking
  4422. works.
  4423. 'arm_arch_v8a_hard_multilib'
  4424. The compiler is targeting 'arm*-*-*' and can build programs using
  4425. the options '-march=armv8-a -mfpu=neon-fp-armv8 -mfloat-abi=hard'.
  4426. The target can also run the resulting binaries.
  4427. 'arm_v8_vfp_ok'
  4428. ARM target supports '-mfpu=fp-armv8 -mfloat-abi=softfp'. Some
  4429. multilibs may be incompatible with these options.
  4430. 'arm_v8_neon_ok'
  4431. ARM target supports '-mfpu=neon-fp-armv8 -mfloat-abi=softfp'. Some
  4432. multilibs may be incompatible with these options.
  4433. 'arm_v8_1a_neon_ok'
  4434. ARM target supports options to generate ARMv8.1-A Adv.SIMD
  4435. instructions. Some multilibs may be incompatible with these
  4436. options.
  4437. 'arm_v8_1a_neon_hw'
  4438. ARM target supports executing ARMv8.1-A Adv.SIMD instructions.
  4439. Some multilibs may be incompatible with the options needed.
  4440. Implies arm_v8_1a_neon_ok.
  4441. 'arm_acq_rel'
  4442. ARM target supports acquire-release instructions.
  4443. 'arm_v8_2a_fp16_scalar_ok'
  4444. ARM target supports options to generate instructions for ARMv8.2-A
  4445. and scalar instructions from the FP16 extension. Some multilibs
  4446. may be incompatible with these options.
  4447. 'arm_v8_2a_fp16_scalar_hw'
  4448. ARM target supports executing instructions for ARMv8.2-A and scalar
  4449. instructions from the FP16 extension. Some multilibs may be
  4450. incompatible with these options. Implies arm_v8_2a_fp16_neon_ok.
  4451. 'arm_v8_2a_fp16_neon_ok'
  4452. ARM target supports options to generate instructions from ARMv8.2-A
  4453. with the FP16 extension. Some multilibs may be incompatible with
  4454. these options. Implies arm_v8_2a_fp16_scalar_ok.
  4455. 'arm_v8_2a_fp16_neon_hw'
  4456. ARM target supports executing instructions from ARMv8.2-A with the
  4457. FP16 extension. Some multilibs may be incompatible with these
  4458. options. Implies arm_v8_2a_fp16_neon_ok and
  4459. arm_v8_2a_fp16_scalar_hw.
  4460. 'arm_v8_2a_dotprod_neon_ok'
  4461. ARM target supports options to generate instructions from ARMv8.2-A
  4462. with the Dot Product extension. Some multilibs may be incompatible
  4463. with these options.
  4464. 'arm_v8_2a_dotprod_neon_hw'
  4465. ARM target supports executing instructions from ARMv8.2-A with the
  4466. Dot Product extension. Some multilibs may be incompatible with
  4467. these options. Implies arm_v8_2a_dotprod_neon_ok.
  4468. 'arm_fp16fml_neon_ok'
  4469. ARM target supports extensions to generate the 'VFMAL' and 'VFMLS'
  4470. half-precision floating-point instructions available from ARMv8.2-A
  4471. and onwards. Some multilibs may be incompatible with these
  4472. options.
  4473. 'arm_v8_2a_bf16_neon_ok'
  4474. ARM target supports options to generate instructions from ARMv8.2-A
  4475. with the BFloat16 extension (bf16). Some multilibs may be
  4476. incompatible with these options.
  4477. 'arm_v8_2a_i8mm_ok'
  4478. ARM target supports options to generate instructions from ARMv8.2-A
  4479. with the 8-Bit Integer Matrix Multiply extension (i8mm). Some
  4480. multilibs may be incompatible with these options.
  4481. 'arm_v8_1m_mve_ok'
  4482. ARM target supports options to generate instructions from ARMv8.1-M
  4483. with the M-Profile Vector Extension (MVE). Some multilibs may be
  4484. incompatible with these options.
  4485. 'arm_v8_1m_mve_fp_ok'
  4486. ARM target supports options to generate instructions from ARMv8.1-M
  4487. with the Half-precision floating-point instructions (HP),
  4488. Floating-point Extension (FP) along with M-Profile Vector Extension
  4489. (MVE). Some multilibs may be incompatible with these options.
  4490. 'arm_mve_hw'
  4491. Test system supports executing MVE instructions.
  4492. 'arm_v8m_main_cde'
  4493. ARM target supports options to generate instructions from ARMv8-M
  4494. with the Custom Datapath Extension (CDE). Some multilibs may be
  4495. incompatible with these options.
  4496. 'arm_v8m_main_cde_fp'
  4497. ARM target supports options to generate instructions from ARMv8-M
  4498. with the Custom Datapath Extension (CDE) and floating-point (VFP).
  4499. Some multilibs may be incompatible with these options.
  4500. 'arm_v8_1m_main_cde_mve'
  4501. ARM target supports options to generate instructions from ARMv8.1-M
  4502. with the Custom Datapath Extension (CDE) and M-Profile Vector
  4503. Extension (MVE). Some multilibs may be incompatible with these
  4504. options.
  4505. 'arm_prefer_ldrd_strd'
  4506. ARM target prefers 'LDRD' and 'STRD' instructions over 'LDM' and
  4507. 'STM' instructions.
  4508. 'arm_thumb1_movt_ok'
  4509. ARM target generates Thumb-1 code for '-mthumb' with 'MOVW' and
  4510. 'MOVT' instructions available.
  4511. 'arm_thumb1_cbz_ok'
  4512. ARM target generates Thumb-1 code for '-mthumb' with 'CBZ' and
  4513. 'CBNZ' instructions available.
  4514. 'arm_divmod_simode'
  4515. ARM target for which divmod transform is disabled, if it supports
  4516. hardware div instruction.
  4517. 'arm_cmse_ok'
  4518. ARM target supports ARMv8-M Security Extensions, enabled by the
  4519. '-mcmse' option.
  4520. 'arm_coproc1_ok'
  4521. ARM target supports the following coprocessor instructions: 'CDP',
  4522. 'LDC', 'STC', 'MCR' and 'MRC'.
  4523. 'arm_coproc2_ok'
  4524. ARM target supports all the coprocessor instructions also listed as
  4525. supported in *note arm_coproc1_ok:: in addition to the following:
  4526. 'CDP2', 'LDC2', 'LDC2l', 'STC2', 'STC2l', 'MCR2' and 'MRC2'.
  4527. 'arm_coproc3_ok'
  4528. ARM target supports all the coprocessor instructions also listed as
  4529. supported in *note arm_coproc2_ok:: in addition the following:
  4530. 'MCRR' and 'MRRC'.
  4531. 'arm_coproc4_ok'
  4532. ARM target supports all the coprocessor instructions also listed as
  4533. supported in *note arm_coproc3_ok:: in addition the following:
  4534. 'MCRR2' and 'MRRC2'.
  4535. 'arm_simd32_ok'
  4536. ARM Target supports options suitable for accessing the SIMD32
  4537. intrinsics from 'arm_acle.h'. Some multilibs may be incompatible
  4538. with these options.
  4539. 'arm_qbit_ok'
  4540. ARM Target supports options suitable for accessing the Q-bit
  4541. manipulation intrinsics from 'arm_acle.h'. Some multilibs may be
  4542. incompatible with these options.
  4543. 'arm_softfp_ok'
  4544. ARM target supports the '-mfloat-abi=softfp' option.
  4545. 'arm_hard_ok'
  4546. ARM target supports the '-mfloat-abi=hard' option.
  4547. 7.2.3.8 AArch64-specific attributes
  4548. ...................................
  4549. 'aarch64_asm_<ext>_ok'
  4550. AArch64 assembler supports the architecture extension 'ext' via the
  4551. '.arch_extension' pseudo-op.
  4552. 'aarch64_tiny'
  4553. AArch64 target which generates instruction sequences for tiny
  4554. memory model.
  4555. 'aarch64_small'
  4556. AArch64 target which generates instruction sequences for small
  4557. memory model.
  4558. 'aarch64_large'
  4559. AArch64 target which generates instruction sequences for large
  4560. memory model.
  4561. 'aarch64_little_endian'
  4562. AArch64 target which generates instruction sequences for little
  4563. endian.
  4564. 'aarch64_big_endian'
  4565. AArch64 target which generates instruction sequences for big
  4566. endian.
  4567. 'aarch64_small_fpic'
  4568. Binutils installed on test system supports relocation types
  4569. required by -fpic for AArch64 small memory model.
  4570. 'aarch64_sve_hw'
  4571. AArch64 target that is able to generate and execute SVE code
  4572. (regardless of whether it does so by default).
  4573. 'aarch64_sve128_hw'
  4574. 'aarch64_sve256_hw'
  4575. 'aarch64_sve512_hw'
  4576. 'aarch64_sve1024_hw'
  4577. 'aarch64_sve2048_hw'
  4578. Like 'aarch64_sve_hw', but also test for an exact hardware vector
  4579. length.
  4580. 'aarch64_fjcvtzs_hw'
  4581. AArch64 target that is able to generate and execute armv8.3-a
  4582. FJCVTZS instruction.
  4583. 7.2.3.9 MIPS-specific attributes
  4584. ................................
  4585. 'mips64'
  4586. MIPS target supports 64-bit instructions.
  4587. 'nomips16'
  4588. MIPS target does not produce MIPS16 code.
  4589. 'mips16_attribute'
  4590. MIPS target can generate MIPS16 code.
  4591. 'mips_loongson'
  4592. MIPS target is a Loongson-2E or -2F target using an ABI that
  4593. supports the Loongson vector modes.
  4594. 'mips_msa'
  4595. MIPS target supports '-mmsa', MIPS SIMD Architecture (MSA).
  4596. 'mips_newabi_large_long_double'
  4597. MIPS target supports 'long double' larger than 'double' when using
  4598. the new ABI.
  4599. 'mpaired_single'
  4600. MIPS target supports '-mpaired-single'.
  4601. 7.2.3.10 PowerPC-specific attributes
  4602. ....................................
  4603. 'dfp_hw'
  4604. PowerPC target supports executing hardware DFP instructions.
  4605. 'p8vector_hw'
  4606. PowerPC target supports executing VSX instructions (ISA 2.07).
  4607. 'powerpc64'
  4608. Test system supports executing 64-bit instructions.
  4609. 'powerpc_altivec'
  4610. PowerPC target supports AltiVec.
  4611. 'powerpc_altivec_ok'
  4612. PowerPC target supports '-maltivec'.
  4613. 'powerpc_eabi_ok'
  4614. PowerPC target supports '-meabi'.
  4615. 'powerpc_elfv2'
  4616. PowerPC target supports '-mabi=elfv2'.
  4617. 'powerpc_fprs'
  4618. PowerPC target supports floating-point registers.
  4619. 'powerpc_hard_double'
  4620. PowerPC target supports hardware double-precision floating-point.
  4621. 'powerpc_htm_ok'
  4622. PowerPC target supports '-mhtm'
  4623. 'powerpc_p8vector_ok'
  4624. PowerPC target supports '-mpower8-vector'
  4625. 'powerpc_popcntb_ok'
  4626. PowerPC target supports the 'popcntb' instruction, indicating that
  4627. this target supports '-mcpu=power5'.
  4628. 'powerpc_ppu_ok'
  4629. PowerPC target supports '-mcpu=cell'.
  4630. 'powerpc_spe'
  4631. PowerPC target supports PowerPC SPE.
  4632. 'powerpc_spe_nocache'
  4633. Including the options used to compile this particular test, the
  4634. PowerPC target supports PowerPC SPE.
  4635. 'powerpc_spu'
  4636. PowerPC target supports PowerPC SPU.
  4637. 'powerpc_vsx_ok'
  4638. PowerPC target supports '-mvsx'.
  4639. 'powerpc_405_nocache'
  4640. Including the options used to compile this particular test, the
  4641. PowerPC target supports PowerPC 405.
  4642. 'ppc_recip_hw'
  4643. PowerPC target supports executing reciprocal estimate instructions.
  4644. 'vmx_hw'
  4645. PowerPC target supports executing AltiVec instructions.
  4646. 'vsx_hw'
  4647. PowerPC target supports executing VSX instructions (ISA 2.06).
  4648. 7.2.3.11 Other hardware attributes
  4649. ..................................
  4650. 'autoincdec'
  4651. Target supports autoincrement/decrement addressing.
  4652. 'avx'
  4653. Target supports compiling 'avx' instructions.
  4654. 'avx_runtime'
  4655. Target supports the execution of 'avx' instructions.
  4656. 'avx2'
  4657. Target supports compiling 'avx2' instructions.
  4658. 'avx2_runtime'
  4659. Target supports the execution of 'avx2' instructions.
  4660. 'avx512f'
  4661. Target supports compiling 'avx512f' instructions.
  4662. 'avx512f_runtime'
  4663. Target supports the execution of 'avx512f' instructions.
  4664. 'avx512vp2intersect'
  4665. Target supports the execution of 'avx512vp2intersect' instructions.
  4666. 'cell_hw'
  4667. Test system can execute AltiVec and Cell PPU instructions.
  4668. 'coldfire_fpu'
  4669. Target uses a ColdFire FPU.
  4670. 'divmod'
  4671. Target supporting hardware divmod insn or divmod libcall.
  4672. 'divmod_simode'
  4673. Target supporting hardware divmod insn or divmod libcall for
  4674. SImode.
  4675. 'hard_float'
  4676. Target supports FPU instructions.
  4677. 'non_strict_align'
  4678. Target does not require strict alignment.
  4679. 'pie_copyreloc'
  4680. The x86-64 target linker supports PIE with copy reloc.
  4681. 'rdrand'
  4682. Target supports x86 'rdrand' instruction.
  4683. 'sqrt_insn'
  4684. Target has a square root instruction that the compiler can
  4685. generate.
  4686. 'sse'
  4687. Target supports compiling 'sse' instructions.
  4688. 'sse_runtime'
  4689. Target supports the execution of 'sse' instructions.
  4690. 'sse2'
  4691. Target supports compiling 'sse2' instructions.
  4692. 'sse2_runtime'
  4693. Target supports the execution of 'sse2' instructions.
  4694. 'sync_char_short'
  4695. Target supports atomic operations on 'char' and 'short'.
  4696. 'sync_int_long'
  4697. Target supports atomic operations on 'int' and 'long'.
  4698. 'ultrasparc_hw'
  4699. Test environment appears to run executables on a simulator that
  4700. accepts only 'EM_SPARC' executables and chokes on 'EM_SPARC32PLUS'
  4701. or 'EM_SPARCV9' executables.
  4702. 'vect_cmdline_needed'
  4703. Target requires a command line argument to enable a SIMD
  4704. instruction set.
  4705. 'xorsign'
  4706. Target supports the xorsign optab expansion.
  4707. 7.2.3.12 Environment attributes
  4708. ...............................
  4709. 'c'
  4710. The language for the compiler under test is C.
  4711. 'c++'
  4712. The language for the compiler under test is C++.
  4713. 'c99_runtime'
  4714. Target provides a full C99 runtime.
  4715. 'correct_iso_cpp_string_wchar_protos'
  4716. Target 'string.h' and 'wchar.h' headers provide C++ required
  4717. overloads for 'strchr' etc. functions.
  4718. 'd_runtime'
  4719. Target provides the D runtime.
  4720. 'd_runtime_has_std_library'
  4721. Target provides the D standard library (Phobos).
  4722. 'dummy_wcsftime'
  4723. Target uses a dummy 'wcsftime' function that always returns zero.
  4724. 'fd_truncate'
  4725. Target can truncate a file from a file descriptor, as used by
  4726. 'libgfortran/io/unix.c:fd_truncate'; i.e. 'ftruncate' or 'chsize'.
  4727. 'fenv'
  4728. Target provides 'fenv.h' include file.
  4729. 'fenv_exceptions'
  4730. Target supports 'fenv.h' with all the standard IEEE exceptions and
  4731. floating-point exceptions are raised by arithmetic operations.
  4732. 'fileio'
  4733. Target offers such file I/O library functions as 'fopen', 'fclose',
  4734. 'tmpnam', and 'remove'. This is a link-time requirement for the
  4735. presence of the functions in the library; even if they fail at
  4736. runtime, the requirement is still regarded as satisfied.
  4737. 'freestanding'
  4738. Target is 'freestanding' as defined in section 4 of the C99
  4739. standard. Effectively, it is a target which supports no extra
  4740. headers or libraries other than what is considered essential.
  4741. 'gettimeofday'
  4742. Target supports 'gettimeofday'.
  4743. 'init_priority'
  4744. Target supports constructors with initialization priority
  4745. arguments.
  4746. 'inttypes_types'
  4747. Target has the basic signed and unsigned types in 'inttypes.h'.
  4748. This is for tests that GCC's notions of these types agree with
  4749. those in the header, as some systems have only 'inttypes.h'.
  4750. 'lax_strtofp'
  4751. Target might have errors of a few ULP in string to floating-point
  4752. conversion functions and overflow is not always detected correctly
  4753. by those functions.
  4754. 'mempcpy'
  4755. Target provides 'mempcpy' function.
  4756. 'mmap'
  4757. Target supports 'mmap'.
  4758. 'newlib'
  4759. Target supports Newlib.
  4760. 'newlib_nano_io'
  4761. GCC was configured with '--enable-newlib-nano-formatted-io', which
  4762. reduces the code size of Newlib formatted I/O functions.
  4763. 'pow10'
  4764. Target provides 'pow10' function.
  4765. 'pthread'
  4766. Target can compile using 'pthread.h' with no errors or warnings.
  4767. 'pthread_h'
  4768. Target has 'pthread.h'.
  4769. 'run_expensive_tests'
  4770. Expensive testcases (usually those that consume excessive amounts
  4771. of CPU time) should be run on this target. This can be enabled by
  4772. setting the 'GCC_TEST_RUN_EXPENSIVE' environment variable to a
  4773. non-empty string.
  4774. 'simulator'
  4775. Test system runs executables on a simulator (i.e. slowly) rather
  4776. than hardware (i.e. fast).
  4777. 'signal'
  4778. Target has 'signal.h'.
  4779. 'stabs'
  4780. Target supports the stabs debugging format.
  4781. 'stdint_types'
  4782. Target has the basic signed and unsigned C types in 'stdint.h'.
  4783. This will be obsolete when GCC ensures a working 'stdint.h' for all
  4784. targets.
  4785. 'stpcpy'
  4786. Target provides 'stpcpy' function.
  4787. 'trampolines'
  4788. Target supports trampolines.
  4789. 'uclibc'
  4790. Target supports uClibc.
  4791. 'unwrapped'
  4792. Target does not use a status wrapper.
  4793. 'vxworks_kernel'
  4794. Target is a VxWorks kernel.
  4795. 'vxworks_rtp'
  4796. Target is a VxWorks RTP.
  4797. 'wchar'
  4798. Target supports wide characters.
  4799. 7.2.3.13 Other attributes
  4800. .........................
  4801. 'automatic_stack_alignment'
  4802. Target supports automatic stack alignment.
  4803. 'branch_cost'
  4804. Target supports '-branch-cost=N'.
  4805. 'cxa_atexit'
  4806. Target uses '__cxa_atexit'.
  4807. 'default_packed'
  4808. Target has packed layout of structure members by default.
  4809. 'exceptions'
  4810. Target supports exceptions.
  4811. 'exceptions_enabled'
  4812. Target supports exceptions and they are enabled in the current
  4813. testing configuration.
  4814. 'fgraphite'
  4815. Target supports Graphite optimizations.
  4816. 'fixed_point'
  4817. Target supports fixed-point extension to C.
  4818. 'fopenacc'
  4819. Target supports OpenACC via '-fopenacc'.
  4820. 'fopenmp'
  4821. Target supports OpenMP via '-fopenmp'.
  4822. 'fpic'
  4823. Target supports '-fpic' and '-fPIC'.
  4824. 'freorder'
  4825. Target supports '-freorder-blocks-and-partition'.
  4826. 'fstack_protector'
  4827. Target supports '-fstack-protector'.
  4828. 'gas'
  4829. Target uses GNU 'as'.
  4830. 'gc_sections'
  4831. Target supports '--gc-sections'.
  4832. 'gld'
  4833. Target uses GNU 'ld'.
  4834. 'keeps_null_pointer_checks'
  4835. Target keeps null pointer checks, either due to the use of
  4836. '-fno-delete-null-pointer-checks' or hardwired into the target.
  4837. 'llvm_binutils'
  4838. Target is using an LLVM assembler and/or linker, instead of GNU
  4839. Binutils.
  4840. 'lto'
  4841. Compiler has been configured to support link-time optimization
  4842. (LTO).
  4843. 'lto_incremental'
  4844. Compiler and linker support link-time optimization relocatable
  4845. linking with '-r' and '-flto' options.
  4846. 'naked_functions'
  4847. Target supports the 'naked' function attribute.
  4848. 'named_sections'
  4849. Target supports named sections.
  4850. 'natural_alignment_32'
  4851. Target uses natural alignment (aligned to type size) for types of
  4852. 32 bits or less.
  4853. 'target_natural_alignment_64'
  4854. Target uses natural alignment (aligned to type size) for types of
  4855. 64 bits or less.
  4856. 'noinit'
  4857. Target supports the 'noinit' variable attribute.
  4858. 'nonpic'
  4859. Target does not generate PIC by default.
  4860. 'offload_gcn'
  4861. Target has been configured for OpenACC/OpenMP offloading on AMD
  4862. GCN.
  4863. 'pie_enabled'
  4864. Target generates PIE by default.
  4865. 'pcc_bitfield_type_matters'
  4866. Target defines 'PCC_BITFIELD_TYPE_MATTERS'.
  4867. 'pe_aligned_commons'
  4868. Target supports '-mpe-aligned-commons'.
  4869. 'pie'
  4870. Target supports '-pie', '-fpie' and '-fPIE'.
  4871. 'rdynamic'
  4872. Target supports '-rdynamic'.
  4873. 'scalar_all_fma'
  4874. Target supports all four fused multiply-add optabs for both 'float'
  4875. and 'double'. These optabs are: 'fma_optab', 'fms_optab',
  4876. 'fnma_optab' and 'fnms_optab'.
  4877. 'section_anchors'
  4878. Target supports section anchors.
  4879. 'short_enums'
  4880. Target defaults to short enums.
  4881. 'stack_size'
  4882. Target has limited stack size. The stack size limit can be
  4883. obtained using the STACK_SIZE macro defined by *note
  4884. 'dg-add-options' feature 'stack_size': stack_size_ao.
  4885. 'static'
  4886. Target supports '-static'.
  4887. 'static_libgfortran'
  4888. Target supports statically linking 'libgfortran'.
  4889. 'string_merging'
  4890. Target supports merging string constants at link time.
  4891. 'ucn'
  4892. Target supports compiling and assembling UCN.
  4893. 'ucn_nocache'
  4894. Including the options used to compile this particular test, the
  4895. target supports compiling and assembling UCN.
  4896. 'unaligned_stack'
  4897. Target does not guarantee that its 'STACK_BOUNDARY' is greater than
  4898. or equal to the required vector alignment.
  4899. 'vector_alignment_reachable'
  4900. Vector alignment is reachable for types of 32 bits or less.
  4901. 'vector_alignment_reachable_for_64bit'
  4902. Vector alignment is reachable for types of 64 bits or less.
  4903. 'wchar_t_char16_t_compatible'
  4904. Target supports 'wchar_t' that is compatible with 'char16_t'.
  4905. 'wchar_t_char32_t_compatible'
  4906. Target supports 'wchar_t' that is compatible with 'char32_t'.
  4907. 'comdat_group'
  4908. Target uses comdat groups.
  4909. 'indirect_calls'
  4910. Target supports indirect calls, i.e. calls where the target is not
  4911. constant.
  4912. 7.2.3.14 Local to tests in 'gcc.target/i386'
  4913. ............................................
  4914. '3dnow'
  4915. Target supports compiling '3dnow' instructions.
  4916. 'aes'
  4917. Target supports compiling 'aes' instructions.
  4918. 'fma4'
  4919. Target supports compiling 'fma4' instructions.
  4920. 'mfentry'
  4921. Target supports the '-mfentry' option that alters the position of
  4922. profiling calls such that they precede the prologue.
  4923. 'ms_hook_prologue'
  4924. Target supports attribute 'ms_hook_prologue'.
  4925. 'pclmul'
  4926. Target supports compiling 'pclmul' instructions.
  4927. 'sse3'
  4928. Target supports compiling 'sse3' instructions.
  4929. 'sse4'
  4930. Target supports compiling 'sse4' instructions.
  4931. 'sse4a'
  4932. Target supports compiling 'sse4a' instructions.
  4933. 'ssse3'
  4934. Target supports compiling 'ssse3' instructions.
  4935. 'vaes'
  4936. Target supports compiling 'vaes' instructions.
  4937. 'vpclmul'
  4938. Target supports compiling 'vpclmul' instructions.
  4939. 'xop'
  4940. Target supports compiling 'xop' instructions.
  4941. 7.2.3.15 Local to tests in 'gcc.test-framework'
  4942. ...............................................
  4943. 'no'
  4944. Always returns 0.
  4945. 'yes'
  4946. Always returns 1.
  4947. 
  4948. File: gccint.info, Node: Add Options, Next: Require Support, Prev: Effective-Target Keywords, Up: Test Directives
  4949. 7.2.4 Features for 'dg-add-options'
  4950. -----------------------------------
  4951. The supported values of FEATURE for directive 'dg-add-options' are:
  4952. 'arm_fp'
  4953. '__ARM_FP' definition. Only ARM targets support this feature, and
  4954. only then in certain modes; see the *note arm_fp_ok effective
  4955. target keyword: arm_fp_ok.
  4956. 'arm_fp_dp'
  4957. '__ARM_FP' definition with double-precision support. Only ARM
  4958. targets support this feature, and only then in certain modes; see
  4959. the *note arm_fp_dp_ok effective target keyword: arm_fp_dp_ok.
  4960. 'arm_neon'
  4961. NEON support. Only ARM targets support this feature, and only then
  4962. in certain modes; see the *note arm_neon_ok effective target
  4963. keyword: arm_neon_ok.
  4964. 'arm_fp16'
  4965. VFP half-precision floating point support. This does not select
  4966. the FP16 format; for that, use *note arm_fp16_ieee: arm_fp16_ieee.
  4967. or *note arm_fp16_alternative: arm_fp16_alternative. instead. This
  4968. feature is only supported by ARM targets and then only in certain
  4969. modes; see the *note arm_fp16_ok effective target keyword:
  4970. arm_fp16_ok.
  4971. 'arm_fp16_ieee'
  4972. ARM IEEE 754-2008 format VFP half-precision floating point support.
  4973. This feature is only supported by ARM targets and then only in
  4974. certain modes; see the *note arm_fp16_ok effective target keyword:
  4975. arm_fp16_ok.
  4976. 'arm_fp16_alternative'
  4977. ARM Alternative format VFP half-precision floating point support.
  4978. This feature is only supported by ARM targets and then only in
  4979. certain modes; see the *note arm_fp16_ok effective target keyword:
  4980. arm_fp16_ok.
  4981. 'arm_neon_fp16'
  4982. NEON and half-precision floating point support. Only ARM targets
  4983. support this feature, and only then in certain modes; see the *note
  4984. arm_neon_fp16_ok effective target keyword: arm_neon_fp16_ok.
  4985. 'arm_vfp3'
  4986. arm vfp3 floating point support; see the *note arm_vfp3_ok
  4987. effective target keyword: arm_vfp3_ok.
  4988. 'arm_arch_v8a_hard'
  4989. Add options for ARMv8-A and the hard-float variant of the AAPCS, if
  4990. this is supported by the compiler; see the *note
  4991. arm_arch_v8a_hard_ok: arm_arch_v8a_hard_ok. effective target
  4992. keyword.
  4993. 'arm_v8_1a_neon'
  4994. Add options for ARMv8.1-A with Adv.SIMD support, if this is
  4995. supported by the target; see the *note arm_v8_1a_neon_ok:
  4996. arm_v8_1a_neon_ok. effective target keyword.
  4997. 'arm_v8_2a_fp16_scalar'
  4998. Add options for ARMv8.2-A with scalar FP16 support, if this is
  4999. supported by the target; see the *note arm_v8_2a_fp16_scalar_ok:
  5000. arm_v8_2a_fp16_scalar_ok. effective target keyword.
  5001. 'arm_v8_2a_fp16_neon'
  5002. Add options for ARMv8.2-A with Adv.SIMD FP16 support, if this is
  5003. supported by the target; see the *note arm_v8_2a_fp16_neon_ok:
  5004. arm_v8_2a_fp16_neon_ok. effective target keyword.
  5005. 'arm_v8_2a_dotprod_neon'
  5006. Add options for ARMv8.2-A with Adv.SIMD Dot Product support, if
  5007. this is supported by the target; see the *note
  5008. arm_v8_2a_dotprod_neon_ok:: effective target keyword.
  5009. 'arm_fp16fml_neon'
  5010. Add options to enable generation of the 'VFMAL' and 'VFMSL'
  5011. instructions, if this is supported by the target; see the *note
  5012. arm_fp16fml_neon_ok:: effective target keyword.
  5013. 'bind_pic_locally'
  5014. Add the target-specific flags needed to enable functions to bind
  5015. locally when using pic/PIC passes in the testsuite.
  5016. 'floatN'
  5017. Add the target-specific flags needed to use the '_FloatN' type.
  5018. 'floatNx'
  5019. Add the target-specific flags needed to use the '_FloatNx' type.
  5020. 'ieee'
  5021. Add the target-specific flags needed to enable full IEEE compliance
  5022. mode.
  5023. 'mips16_attribute'
  5024. 'mips16' function attributes. Only MIPS targets support this
  5025. feature, and only then in certain modes.
  5026. 'stack_size'
  5027. Add the flags needed to define macro STACK_SIZE and set it to the
  5028. stack size limit associated with the *note 'stack_size' effective
  5029. target: stack_size_et.
  5030. 'sqrt_insn'
  5031. Add the target-specific flags needed to enable hardware square root
  5032. instructions, if any.
  5033. 'tls'
  5034. Add the target-specific flags needed to use thread-local storage.
  5035. 
  5036. File: gccint.info, Node: Require Support, Next: Final Actions, Prev: Add Options, Up: Test Directives
  5037. 7.2.5 Variants of 'dg-require-SUPPORT'
  5038. --------------------------------------
  5039. A few of the 'dg-require' directives take arguments.
  5040. 'dg-require-iconv CODESET'
  5041. Skip the test if the target does not support iconv. CODESET is the
  5042. codeset to convert to.
  5043. 'dg-require-profiling PROFOPT'
  5044. Skip the test if the target does not support profiling with option
  5045. PROFOPT.
  5046. 'dg-require-stack-check CHECK'
  5047. Skip the test if the target does not support the '-fstack-check'
  5048. option. If CHECK is '""', support for '-fstack-check' is checked,
  5049. for '-fstack-check=("CHECK")' otherwise.
  5050. 'dg-require-stack-size SIZE'
  5051. Skip the test if the target does not support a stack size of SIZE.
  5052. 'dg-require-visibility VIS'
  5053. Skip the test if the target does not support the 'visibility'
  5054. attribute. If VIS is '""', support for 'visibility("hidden")' is
  5055. checked, for 'visibility("VIS")' otherwise.
  5056. The original 'dg-require' directives were defined before there was
  5057. support for effective-target keywords. The directives that do not take
  5058. arguments could be replaced with effective-target keywords.
  5059. 'dg-require-alias ""'
  5060. Skip the test if the target does not support the 'alias' attribute.
  5061. 'dg-require-ascii-locale ""'
  5062. Skip the test if the host does not support an ASCII locale.
  5063. 'dg-require-compat-dfp ""'
  5064. Skip this test unless both compilers in a 'compat' testsuite
  5065. support decimal floating point.
  5066. 'dg-require-cxa-atexit ""'
  5067. Skip the test if the target does not support '__cxa_atexit'. This
  5068. is equivalent to 'dg-require-effective-target cxa_atexit'.
  5069. 'dg-require-dll ""'
  5070. Skip the test if the target does not support DLL attributes.
  5071. 'dg-require-dot ""'
  5072. Skip the test if the host does not have 'dot'.
  5073. 'dg-require-fork ""'
  5074. Skip the test if the target does not support 'fork'.
  5075. 'dg-require-gc-sections ""'
  5076. Skip the test if the target's linker does not support the
  5077. '--gc-sections' flags. This is equivalent to
  5078. 'dg-require-effective-target gc-sections'.
  5079. 'dg-require-host-local ""'
  5080. Skip the test if the host is remote, rather than the same as the
  5081. build system. Some tests are incompatible with DejaGnu's handling
  5082. of remote hosts, which involves copying the source file to the host
  5083. and compiling it with a relative path and "'-o a.out'".
  5084. 'dg-require-mkfifo ""'
  5085. Skip the test if the target does not support 'mkfifo'.
  5086. 'dg-require-named-sections ""'
  5087. Skip the test is the target does not support named sections. This
  5088. is equivalent to 'dg-require-effective-target named_sections'.
  5089. 'dg-require-weak ""'
  5090. Skip the test if the target does not support weak symbols.
  5091. 'dg-require-weak-override ""'
  5092. Skip the test if the target does not support overriding weak
  5093. symbols.
  5094. 
  5095. File: gccint.info, Node: Final Actions, Prev: Require Support, Up: Test Directives
  5096. 7.2.6 Commands for use in 'dg-final'
  5097. ------------------------------------
  5098. The GCC testsuite defines the following directives to be used within
  5099. 'dg-final'.
  5100. 7.2.6.1 Scan a particular file
  5101. ..............................
  5102. 'scan-file FILENAME REGEXP [{ target/xfail SELECTOR }]'
  5103. Passes if REGEXP matches text in FILENAME.
  5104. 'scan-file-not FILENAME REGEXP [{ target/xfail SELECTOR }]'
  5105. Passes if REGEXP does not match text in FILENAME.
  5106. 'scan-module MODULE REGEXP [{ target/xfail SELECTOR }]'
  5107. Passes if REGEXP matches in Fortran module MODULE.
  5108. 'dg-check-dot FILENAME'
  5109. Passes if FILENAME is a valid '.dot' file (by running 'dot -Tpng'
  5110. on it, and verifying the exit code is 0).
  5111. 7.2.6.2 Scan the assembly output
  5112. ................................
  5113. 'scan-assembler REGEX [{ target/xfail SELECTOR }]'
  5114. Passes if REGEX matches text in the test's assembler output.
  5115. 'scan-assembler-not REGEX [{ target/xfail SELECTOR }]'
  5116. Passes if REGEX does not match text in the test's assembler output.
  5117. 'scan-assembler-times REGEX NUM [{ target/xfail SELECTOR }]'
  5118. Passes if REGEX is matched exactly NUM times in the test's
  5119. assembler output.
  5120. 'scan-assembler-dem REGEX [{ target/xfail SELECTOR }]'
  5121. Passes if REGEX matches text in the test's demangled assembler
  5122. output.
  5123. 'scan-assembler-dem-not REGEX [{ target/xfail SELECTOR }]'
  5124. Passes if REGEX does not match text in the test's demangled
  5125. assembler output.
  5126. 'scan-hidden SYMBOL [{ target/xfail SELECTOR }]'
  5127. Passes if SYMBOL is defined as a hidden symbol in the test's
  5128. assembly output.
  5129. 'scan-not-hidden SYMBOL [{ target/xfail SELECTOR }]'
  5130. Passes if SYMBOL is not defined as a hidden symbol in the test's
  5131. assembly output.
  5132. 'check-function-bodies PREFIX TERMINATOR [OPTIONS [{ target/xfail SELECTOR }]]'
  5133. Looks through the source file for comments that give the expected
  5134. assembly output for selected functions. Each line of expected
  5135. output starts with the prefix string PREFIX and the expected output
  5136. for a function as a whole is followed by a line that starts with
  5137. the string TERMINATOR. Specifying an empty terminator is
  5138. equivalent to specifying '"*/"'.
  5139. OPTIONS, if specified, is a list of regular expressions, each of
  5140. which matches a full command-line option. A non-empty list
  5141. prevents the test from running unless all of the given options are
  5142. present on the command line. This can help if a source file is
  5143. compiled both with and without optimization, since it is rarely
  5144. useful to check the full function body for unoptimized code.
  5145. The first line of the expected output for a function FN has the
  5146. form:
  5147. PREFIX FN: [{ target/xfail SELECTOR }]
  5148. Subsequent lines of the expected output also start with PREFIX. In
  5149. both cases, whitespace after PREFIX is not significant.
  5150. The test discards assembly directives such as '.cfi_startproc' and
  5151. local label definitions such as '.LFB0' from the compiler's
  5152. assembly output. It then matches the result against the expected
  5153. output for a function as a single regular expression. This means
  5154. that later lines can use backslashes to refer back to '(...)'
  5155. captures on earlier lines. For example:
  5156. /* { dg-final { check-function-bodies "**" "" "-DCHECK_ASM" } } */
  5157. ...
  5158. /*
  5159. ** add_w0_s8_m:
  5160. ** mov (z[0-9]+\.b), w0
  5161. ** add z0\.b, p0/m, z0\.b, \1
  5162. ** ret
  5163. */
  5164. svint8_t add_w0_s8_m (...) { ... }
  5165. ...
  5166. /*
  5167. ** add_b0_s8_m:
  5168. ** mov (z[0-9]+\.b), b0
  5169. ** add z1\.b, p0/m, z1\.b, \1
  5170. ** ret
  5171. */
  5172. svint8_t add_b0_s8_m (...) { ... }
  5173. checks whether the implementations of 'add_w0_s8_m' and
  5174. 'add_b0_s8_m' match the regular expressions given. The test only
  5175. runs when '-DCHECK_ASM' is passed on the command line.
  5176. It is possible to create non-capturing multi-line regular
  5177. expression groups of the form '(A|B|...)' by putting the '(', '|'
  5178. and ')' on separate lines (each still using PREFIX). For example:
  5179. /*
  5180. ** cmple_f16_tied:
  5181. ** (
  5182. ** fcmge p0\.h, p0/z, z1\.h, z0\.h
  5183. ** |
  5184. ** fcmle p0\.h, p0/z, z0\.h, z1\.h
  5185. ** )
  5186. ** ret
  5187. */
  5188. svbool_t cmple_f16_tied (...) { ... }
  5189. checks whether 'cmple_f16_tied' is implemented by the 'fcmge'
  5190. instruction followed by 'ret' or by the 'fcmle' instruction
  5191. followed by 'ret'. The test is still a single regular rexpression.
  5192. A line containing just:
  5193. PREFIX ...
  5194. stands for zero or more unmatched lines; the whitespace after
  5195. PREFIX is again not significant.
  5196. 7.2.6.3 Scan optimization dump files
  5197. ....................................
  5198. These commands are available for KIND of 'tree', 'ltrans-tree',
  5199. 'offload-tree', 'rtl', 'offload-rtl', 'ipa', and 'wpa-ipa'.
  5200. 'scan-KIND-dump REGEX SUFFIX [{ target/xfail SELECTOR }]'
  5201. Passes if REGEX matches text in the dump file with suffix SUFFIX.
  5202. 'scan-KIND-dump-not REGEX SUFFIX [{ target/xfail SELECTOR }]'
  5203. Passes if REGEX does not match text in the dump file with suffix
  5204. SUFFIX.
  5205. 'scan-KIND-dump-times REGEX NUM SUFFIX [{ target/xfail SELECTOR }]'
  5206. Passes if REGEX is found exactly NUM times in the dump file with
  5207. suffix SUFFIX.
  5208. 'scan-KIND-dump-dem REGEX SUFFIX [{ target/xfail SELECTOR }]'
  5209. Passes if REGEX matches demangled text in the dump file with suffix
  5210. SUFFIX.
  5211. 'scan-KIND-dump-dem-not REGEX SUFFIX [{ target/xfail SELECTOR }]'
  5212. Passes if REGEX does not match demangled text in the dump file with
  5213. suffix SUFFIX.
  5214. 7.2.6.4 Check for output files
  5215. ..............................
  5216. 'output-exists [{ target/xfail SELECTOR }]'
  5217. Passes if compiler output file exists.
  5218. 'output-exists-not [{ target/xfail SELECTOR }]'
  5219. Passes if compiler output file does not exist.
  5220. 'scan-symbol REGEXP [{ target/xfail SELECTOR }]'
  5221. Passes if the pattern is present in the final executable.
  5222. 'scan-symbol-not REGEXP [{ target/xfail SELECTOR }]'
  5223. Passes if the pattern is absent from the final executable.
  5224. 7.2.6.5 Checks for 'gcov' tests
  5225. ...............................
  5226. 'run-gcov SOURCEFILE'
  5227. Check line counts in 'gcov' tests.
  5228. 'run-gcov [branches] [calls] { OPTS SOURCEFILE }'
  5229. Check branch and/or call counts, in addition to line counts, in
  5230. 'gcov' tests.
  5231. 7.2.6.6 Clean up generated test files
  5232. .....................................
  5233. Usually the test-framework removes files that were generated during
  5234. testing. If a testcase, for example, uses any dumping mechanism to
  5235. inspect a passes dump file, the testsuite recognized the dump option
  5236. passed to the tool and schedules a final cleanup to remove these files.
  5237. There are, however, following additional cleanup directives that can be
  5238. used to annotate a testcase "manually".
  5239. 'cleanup-coverage-files'
  5240. Removes coverage data files generated for this test.
  5241. 'cleanup-modules "LIST-OF-EXTRA-MODULES"'
  5242. Removes Fortran module files generated for this test, excluding the
  5243. module names listed in keep-modules. Cleaning up module files is
  5244. usually done automatically by the testsuite by looking at the
  5245. source files and removing the modules after the test has been
  5246. executed.
  5247. module MoD1
  5248. end module MoD1
  5249. module Mod2
  5250. end module Mod2
  5251. module moD3
  5252. end module moD3
  5253. module mod4
  5254. end module mod4
  5255. ! { dg-final { cleanup-modules "mod1 mod2" } } ! redundant
  5256. ! { dg-final { keep-modules "mod3 mod4" } }
  5257. 'keep-modules "LIST-OF-MODULES-NOT-TO-DELETE"'
  5258. Whitespace separated list of module names that should not be
  5259. deleted by cleanup-modules. If the list of modules is empty, all
  5260. modules defined in this file are kept.
  5261. module maybe_unneeded
  5262. end module maybe_unneeded
  5263. module keep1
  5264. end module keep1
  5265. module keep2
  5266. end module keep2
  5267. ! { dg-final { keep-modules "keep1 keep2" } } ! just keep these two
  5268. ! { dg-final { keep-modules "" } } ! keep all
  5269. 'dg-keep-saved-temps "LIST-OF-SUFFIXES-NOT-TO-DELETE"'
  5270. Whitespace separated list of suffixes that should not be deleted
  5271. automatically in a testcase that uses '-save-temps'.
  5272. // { dg-options "-save-temps -fpch-preprocess -I." }
  5273. int main() { return 0; }
  5274. // { dg-keep-saved-temps ".s" } ! just keep assembler file
  5275. // { dg-keep-saved-temps ".s" ".i" } ! ... and .i
  5276. // { dg-keep-saved-temps ".ii" ".o" } ! or just .ii and .o
  5277. 'cleanup-profile-file'
  5278. Removes profiling files generated for this test.
  5279. 
  5280. File: gccint.info, Node: Ada Tests, Next: C Tests, Prev: Test Directives, Up: Testsuites
  5281. 7.3 Ada Language Testsuites
  5282. ===========================
  5283. The Ada testsuite includes executable tests from the ACATS testsuite,
  5284. publicly available at <http://www.ada-auth.org/acats.html>.
  5285. These tests are integrated in the GCC testsuite in the 'ada/acats'
  5286. directory, and enabled automatically when running 'make check', assuming
  5287. the Ada language has been enabled when configuring GCC.
  5288. You can also run the Ada testsuite independently, using 'make
  5289. check-ada', or run a subset of the tests by specifying which chapter to
  5290. run, e.g.:
  5291. $ make check-ada CHAPTERS="c3 c9"
  5292. The tests are organized by directory, each directory corresponding to a
  5293. chapter of the Ada Reference Manual. So for example, 'c9' corresponds
  5294. to chapter 9, which deals with tasking features of the language.
  5295. The tests are run using two 'sh' scripts: 'run_acats' and 'run_all.sh'.
  5296. To run the tests using a simulator or a cross target, see the small
  5297. customization section at the top of 'run_all.sh'.
  5298. These tests are run using the build tree: they can be run without doing
  5299. a 'make install'.
  5300. 
  5301. File: gccint.info, Node: C Tests, Next: LTO Testing, Prev: Ada Tests, Up: Testsuites
  5302. 7.4 C Language Testsuites
  5303. =========================
  5304. GCC contains the following C language testsuites, in the 'gcc/testsuite'
  5305. directory:
  5306. 'gcc.dg'
  5307. This contains tests of particular features of the C compiler, using
  5308. the more modern 'dg' harness. Correctness tests for various
  5309. compiler features should go here if possible.
  5310. Magic comments determine whether the file is preprocessed,
  5311. compiled, linked or run. In these tests, error and warning message
  5312. texts are compared against expected texts or regular expressions
  5313. given in comments. These tests are run with the options '-ansi
  5314. -pedantic' unless other options are given in the test. Except as
  5315. noted below they are not run with multiple optimization options.
  5316. 'gcc.dg/compat'
  5317. This subdirectory contains tests for binary compatibility using
  5318. 'lib/compat.exp', which in turn uses the language-independent
  5319. support (*note Support for testing binary compatibility: compat
  5320. Testing.).
  5321. 'gcc.dg/cpp'
  5322. This subdirectory contains tests of the preprocessor.
  5323. 'gcc.dg/debug'
  5324. This subdirectory contains tests for debug formats. Tests in this
  5325. subdirectory are run for each debug format that the compiler
  5326. supports.
  5327. 'gcc.dg/format'
  5328. This subdirectory contains tests of the '-Wformat' format checking.
  5329. Tests in this directory are run with and without '-DWIDE'.
  5330. 'gcc.dg/noncompile'
  5331. This subdirectory contains tests of code that should not compile
  5332. and does not need any special compilation options. They are run
  5333. with multiple optimization options, since sometimes invalid code
  5334. crashes the compiler with optimization.
  5335. 'gcc.dg/special'
  5336. FIXME: describe this.
  5337. 'gcc.c-torture'
  5338. This contains particular code fragments which have historically
  5339. broken easily. These tests are run with multiple optimization
  5340. options, so tests for features which only break at some
  5341. optimization levels belong here. This also contains tests to check
  5342. that certain optimizations occur. It might be worthwhile to
  5343. separate the correctness tests cleanly from the code quality tests,
  5344. but it hasn't been done yet.
  5345. 'gcc.c-torture/compat'
  5346. FIXME: describe this.
  5347. This directory should probably not be used for new tests.
  5348. 'gcc.c-torture/compile'
  5349. This testsuite contains test cases that should compile, but do not
  5350. need to link or run. These test cases are compiled with several
  5351. different combinations of optimization options. All warnings are
  5352. disabled for these test cases, so this directory is not suitable if
  5353. you wish to test for the presence or absence of compiler warnings.
  5354. While special options can be set, and tests disabled on specific
  5355. platforms, by the use of '.x' files, mostly these test cases should
  5356. not contain platform dependencies. FIXME: discuss how defines such
  5357. as 'STACK_SIZE' are used.
  5358. 'gcc.c-torture/execute'
  5359. This testsuite contains test cases that should compile, link and
  5360. run; otherwise the same comments as for 'gcc.c-torture/compile'
  5361. apply.
  5362. 'gcc.c-torture/execute/ieee'
  5363. This contains tests which are specific to IEEE floating point.
  5364. 'gcc.c-torture/unsorted'
  5365. FIXME: describe this.
  5366. This directory should probably not be used for new tests.
  5367. 'gcc.misc-tests'
  5368. This directory contains C tests that require special handling.
  5369. Some of these tests have individual expect files, and others share
  5370. special-purpose expect files:
  5371. 'bprob*.c'
  5372. Test '-fbranch-probabilities' using
  5373. 'gcc.misc-tests/bprob.exp', which in turn uses the generic,
  5374. language-independent framework (*note Support for testing
  5375. profile-directed optimizations: profopt Testing.).
  5376. 'gcov*.c'
  5377. Test 'gcov' output using 'gcov.exp', which in turn uses the
  5378. language-independent support (*note Support for testing gcov:
  5379. gcov Testing.).
  5380. 'i386-pf-*.c'
  5381. Test i386-specific support for data prefetch using
  5382. 'i386-prefetch.exp'.
  5383. 'gcc.test-framework'
  5384. 'dg-*.c'
  5385. Test the testsuite itself using
  5386. 'gcc.test-framework/test-framework.exp'.
  5387. FIXME: merge in 'testsuite/README.gcc' and discuss the format of test
  5388. cases and magic comments more.
  5389. 
  5390. File: gccint.info, Node: LTO Testing, Next: gcov Testing, Prev: C Tests, Up: Testsuites
  5391. 7.5 Support for testing link-time optimizations
  5392. ===============================================
  5393. Tests for link-time optimizations usually require multiple source files
  5394. that are compiled separately, perhaps with different sets of options.
  5395. There are several special-purpose test directives used for these tests.
  5396. '{ dg-lto-do DO-WHAT-KEYWORD }'
  5397. DO-WHAT-KEYWORD specifies how the test is compiled and whether it
  5398. is executed. It is one of:
  5399. 'assemble'
  5400. Compile with '-c' to produce a relocatable object file.
  5401. 'link'
  5402. Compile, assemble, and link to produce an executable file.
  5403. 'run'
  5404. Produce and run an executable file, which is expected to
  5405. return an exit code of 0.
  5406. The default is 'assemble'. That can be overridden for a set of
  5407. tests by redefining 'dg-do-what-default' within the '.exp' file for
  5408. those tests.
  5409. Unlike 'dg-do', 'dg-lto-do' does not support an optional 'target'
  5410. or 'xfail' list. Use 'dg-skip-if', 'dg-xfail-if', or
  5411. 'dg-xfail-run-if'.
  5412. '{ dg-lto-options { { OPTIONS } [{ OPTIONS }] } [{ target SELECTOR }]}'
  5413. This directive provides a list of one or more sets of compiler
  5414. options to override LTO_OPTIONS. Each test will be compiled and
  5415. run with each of these sets of options.
  5416. '{ dg-extra-ld-options OPTIONS [{ target SELECTOR }]}'
  5417. This directive adds OPTIONS to the linker options used.
  5418. '{ dg-suppress-ld-options OPTIONS [{ target SELECTOR }]}'
  5419. This directive removes OPTIONS from the set of linker options used.
  5420. 
  5421. File: gccint.info, Node: gcov Testing, Next: profopt Testing, Prev: LTO Testing, Up: Testsuites
  5422. 7.6 Support for testing 'gcov'
  5423. ==============================
  5424. Language-independent support for testing 'gcov', and for checking that
  5425. branch profiling produces expected values, is provided by the expect
  5426. file 'lib/gcov.exp'. 'gcov' tests also rely on procedures in
  5427. 'lib/gcc-dg.exp' to compile and run the test program. A typical 'gcov'
  5428. test contains the following DejaGnu commands within comments:
  5429. { dg-options "--coverage" }
  5430. { dg-do run { target native } }
  5431. { dg-final { run-gcov sourcefile } }
  5432. Checks of 'gcov' output can include line counts, branch percentages,
  5433. and call return percentages. All of these checks are requested via
  5434. commands that appear in comments in the test's source file. Commands to
  5435. check line counts are processed by default. Commands to check branch
  5436. percentages and call return percentages are processed if the 'run-gcov'
  5437. command has arguments 'branches' or 'calls', respectively. For example,
  5438. the following specifies checking both, as well as passing '-b' to
  5439. 'gcov':
  5440. { dg-final { run-gcov branches calls { -b sourcefile } } }
  5441. A line count command appears within a comment on the source line that
  5442. is expected to get the specified count and has the form 'count(CNT)'. A
  5443. test should only check line counts for lines that will get the same
  5444. count for any architecture.
  5445. Commands to check branch percentages ('branch') and call return
  5446. percentages ('returns') are very similar to each other. A beginning
  5447. command appears on or before the first of a range of lines that will
  5448. report the percentage, and the ending command follows that range of
  5449. lines. The beginning command can include a list of percentages, all of
  5450. which are expected to be found within the range. A range is terminated
  5451. by the next command of the same kind. A command 'branch(end)' or
  5452. 'returns(end)' marks the end of a range without starting a new one. For
  5453. example:
  5454. if (i > 10 && j > i && j < 20) /* branch(27 50 75) */
  5455. /* branch(end) */
  5456. foo (i, j);
  5457. For a call return percentage, the value specified is the percentage of
  5458. calls reported to return. For a branch percentage, the value is either
  5459. the expected percentage or 100 minus that value, since the direction of
  5460. a branch can differ depending on the target or the optimization level.
  5461. Not all branches and calls need to be checked. A test should not check
  5462. for branches that might be optimized away or replaced with predicated
  5463. instructions. Don't check for calls inserted by the compiler or ones
  5464. that might be inlined or optimized away.
  5465. A single test can check for combinations of line counts, branch
  5466. percentages, and call return percentages. The command to check a line
  5467. count must appear on the line that will report that count, but commands
  5468. to check branch percentages and call return percentages can bracket the
  5469. lines that report them.
  5470. 
  5471. File: gccint.info, Node: profopt Testing, Next: compat Testing, Prev: gcov Testing, Up: Testsuites
  5472. 7.7 Support for testing profile-directed optimizations
  5473. ======================================================
  5474. The file 'profopt.exp' provides language-independent support for
  5475. checking correct execution of a test built with profile-directed
  5476. optimization. This testing requires that a test program be built and
  5477. executed twice. The first time it is compiled to generate profile data,
  5478. and the second time it is compiled to use the data that was generated
  5479. during the first execution. The second execution is to verify that the
  5480. test produces the expected results.
  5481. To check that the optimization actually generated better code, a test
  5482. can be built and run a third time with normal optimizations to verify
  5483. that the performance is better with the profile-directed optimizations.
  5484. 'profopt.exp' has the beginnings of this kind of support.
  5485. 'profopt.exp' provides generic support for profile-directed
  5486. optimizations. Each set of tests that uses it provides information
  5487. about a specific optimization:
  5488. 'tool'
  5489. tool being tested, e.g., 'gcc'
  5490. 'profile_option'
  5491. options used to generate profile data
  5492. 'feedback_option'
  5493. options used to optimize using that profile data
  5494. 'prof_ext'
  5495. suffix of profile data files
  5496. 'PROFOPT_OPTIONS'
  5497. list of options with which to run each test, similar to the lists
  5498. for torture tests
  5499. '{ dg-final-generate { LOCAL-DIRECTIVE } }'
  5500. This directive is similar to 'dg-final', but the LOCAL-DIRECTIVE is
  5501. run after the generation of profile data.
  5502. '{ dg-final-use { LOCAL-DIRECTIVE } }'
  5503. The LOCAL-DIRECTIVE is run after the profile data have been used.
  5504. 
  5505. File: gccint.info, Node: compat Testing, Next: Torture Tests, Prev: profopt Testing, Up: Testsuites
  5506. 7.8 Support for testing binary compatibility
  5507. ============================================
  5508. The file 'compat.exp' provides language-independent support for binary
  5509. compatibility testing. It supports testing interoperability of two
  5510. compilers that follow the same ABI, or of multiple sets of compiler
  5511. options that should not affect binary compatibility. It is intended to
  5512. be used for testsuites that complement ABI testsuites.
  5513. A test supported by this framework has three parts, each in a separate
  5514. source file: a main program and two pieces that interact with each other
  5515. to split up the functionality being tested.
  5516. 'TESTNAME_main.SUFFIX'
  5517. Contains the main program, which calls a function in file
  5518. 'TESTNAME_x.SUFFIX'.
  5519. 'TESTNAME_x.SUFFIX'
  5520. Contains at least one call to a function in 'TESTNAME_y.SUFFIX'.
  5521. 'TESTNAME_y.SUFFIX'
  5522. Shares data with, or gets arguments from, 'TESTNAME_x.SUFFIX'.
  5523. Within each test, the main program and one functional piece are
  5524. compiled by the GCC under test. The other piece can be compiled by an
  5525. alternate compiler. If no alternate compiler is specified, then all
  5526. three source files are all compiled by the GCC under test. You can
  5527. specify pairs of sets of compiler options. The first element of such a
  5528. pair specifies options used with the GCC under test, and the second
  5529. element of the pair specifies options used with the alternate compiler.
  5530. Each test is compiled with each pair of options.
  5531. 'compat.exp' defines default pairs of compiler options. These can be
  5532. overridden by defining the environment variable 'COMPAT_OPTIONS' as:
  5533. COMPAT_OPTIONS="[list [list {TST1} {ALT1}]
  5534. ...[list {TSTN} {ALTN}]]"
  5535. where TSTI and ALTI are lists of options, with TSTI used by the
  5536. compiler under test and ALTI used by the alternate compiler. For
  5537. example, with '[list [list {-g -O0} {-O3}] [list {-fpic} {-fPIC -O2}]]',
  5538. the test is first built with '-g -O0' by the compiler under test and
  5539. with '-O3' by the alternate compiler. The test is built a second time
  5540. using '-fpic' by the compiler under test and '-fPIC -O2' by the
  5541. alternate compiler.
  5542. An alternate compiler is specified by defining an environment variable
  5543. to be the full pathname of an installed compiler; for C define
  5544. 'ALT_CC_UNDER_TEST', and for C++ define 'ALT_CXX_UNDER_TEST'. These
  5545. will be written to the 'site.exp' file used by DejaGnu. The default is
  5546. to build each test with the compiler under test using the first of each
  5547. pair of compiler options from 'COMPAT_OPTIONS'. When
  5548. 'ALT_CC_UNDER_TEST' or 'ALT_CXX_UNDER_TEST' is 'same', each test is
  5549. built using the compiler under test but with combinations of the options
  5550. from 'COMPAT_OPTIONS'.
  5551. To run only the C++ compatibility suite using the compiler under test
  5552. and another version of GCC using specific compiler options, do the
  5553. following from 'OBJDIR/gcc':
  5554. rm site.exp
  5555. make -k \
  5556. ALT_CXX_UNDER_TEST=${alt_prefix}/bin/g++ \
  5557. COMPAT_OPTIONS="LISTS AS SHOWN ABOVE" \
  5558. check-c++ \
  5559. RUNTESTFLAGS="compat.exp"
  5560. A test that fails when the source files are compiled with different
  5561. compilers, but passes when the files are compiled with the same
  5562. compiler, demonstrates incompatibility of the generated code or runtime
  5563. support. A test that fails for the alternate compiler but passes for
  5564. the compiler under test probably tests for a bug that was fixed in the
  5565. compiler under test but is present in the alternate compiler.
  5566. The binary compatibility tests support a small number of test framework
  5567. commands that appear within comments in a test file.
  5568. 'dg-require-*'
  5569. These commands can be used in 'TESTNAME_main.SUFFIX' to skip the
  5570. test if specific support is not available on the target.
  5571. 'dg-options'
  5572. The specified options are used for compiling this particular source
  5573. file, appended to the options from 'COMPAT_OPTIONS'. When this
  5574. command appears in 'TESTNAME_main.SUFFIX' the options are also used
  5575. to link the test program.
  5576. 'dg-xfail-if'
  5577. This command can be used in a secondary source file to specify that
  5578. compilation is expected to fail for particular options on
  5579. particular targets.
  5580. 
  5581. File: gccint.info, Node: Torture Tests, Next: GIMPLE Tests, Prev: compat Testing, Up: Testsuites
  5582. 7.9 Support for torture testing using multiple options
  5583. ======================================================
  5584. Throughout the compiler testsuite there are several directories whose
  5585. tests are run multiple times, each with a different set of options.
  5586. These are known as torture tests. 'lib/torture-options.exp' defines
  5587. procedures to set up these lists:
  5588. 'torture-init'
  5589. Initialize use of torture lists.
  5590. 'set-torture-options'
  5591. Set lists of torture options to use for tests with and without
  5592. loops. Optionally combine a set of torture options with a set of
  5593. other options, as is done with Objective-C runtime options.
  5594. 'torture-finish'
  5595. Finalize use of torture lists.
  5596. The '.exp' file for a set of tests that use torture options must
  5597. include calls to these three procedures if:
  5598. * It calls 'gcc-dg-runtest' and overrides DG_TORTURE_OPTIONS.
  5599. * It calls ${TOOL}'-torture' or ${TOOL}'-torture-execute', where TOOL
  5600. is 'c', 'fortran', or 'objc'.
  5601. * It calls 'dg-pch'.
  5602. It is not necessary for a '.exp' file that calls 'gcc-dg-runtest' to
  5603. call the torture procedures if the tests should use the list in
  5604. DG_TORTURE_OPTIONS defined in 'gcc-dg.exp'.
  5605. Most uses of torture options can override the default lists by defining
  5606. TORTURE_OPTIONS or add to the default list by defining
  5607. ADDITIONAL_TORTURE_OPTIONS. Define these in a '.dejagnurc' file or add
  5608. them to the 'site.exp' file; for example
  5609. set ADDITIONAL_TORTURE_OPTIONS [list \
  5610. { -O2 -ftree-loop-linear } \
  5611. { -O2 -fpeel-loops } ]
  5612. 
  5613. File: gccint.info, Node: GIMPLE Tests, Next: RTL Tests, Prev: Torture Tests, Up: Testsuites
  5614. 7.10 Support for testing GIMPLE passes
  5615. ======================================
  5616. As of gcc 7, C functions can be tagged with '__GIMPLE' to indicate that
  5617. the function body will be GIMPLE, rather than C. The compiler requires
  5618. the option '-fgimple' to enable this functionality. For example:
  5619. /* { dg-do compile } */
  5620. /* { dg-options "-O -fgimple" } */
  5621. void __GIMPLE (startwith ("dse2")) foo ()
  5622. {
  5623. int a;
  5624. bb_2:
  5625. if (a > 4)
  5626. goto bb_3;
  5627. else
  5628. goto bb_4;
  5629. bb_3:
  5630. a_2 = 10;
  5631. goto bb_5;
  5632. bb_4:
  5633. a_3 = 20;
  5634. bb_5:
  5635. a_1 = __PHI (bb_3: a_2, bb_4: a_3);
  5636. a_4 = a_1 + 4;
  5637. return;
  5638. }
  5639. The 'startwith' argument indicates at which pass to begin.
  5640. Use the dump modifier '-gimple' (e.g. '-fdump-tree-all-gimple') to make
  5641. tree dumps more closely follow the format accepted by the GIMPLE parser.
  5642. Example DejaGnu tests of GIMPLE can be seen in the source tree at
  5643. 'gcc/testsuite/gcc.dg/gimplefe-*.c'.
  5644. The '__GIMPLE' parser is integrated with the C tokenizer and
  5645. preprocessor, so it should be possible to use macros to build out test
  5646. coverage.
  5647. 
  5648. File: gccint.info, Node: RTL Tests, Prev: GIMPLE Tests, Up: Testsuites
  5649. 7.11 Support for testing RTL passes
  5650. ===================================
  5651. As of gcc 7, C functions can be tagged with '__RTL' to indicate that the
  5652. function body will be RTL, rather than C. For example:
  5653. double __RTL (startwith ("ira")) test (struct foo *f, const struct bar *b)
  5654. {
  5655. (function "test"
  5656. [...snip; various directives go in here...]
  5657. ) ;; function "test"
  5658. }
  5659. The 'startwith' argument indicates at which pass to begin.
  5660. The parser expects the RTL body to be in the format emitted by this
  5661. dumping function:
  5662. DEBUG_FUNCTION void
  5663. print_rtx_function (FILE *outfile, function *fn, bool compact);
  5664. when "compact" is true. So you can capture RTL in the correct format
  5665. from the debugger using:
  5666. (gdb) print_rtx_function (stderr, cfun, true);
  5667. and copy and paste the output into the body of the C function.
  5668. Example DejaGnu tests of RTL can be seen in the source tree under
  5669. 'gcc/testsuite/gcc.dg/rtl'.
  5670. The '__RTL' parser is not integrated with the C tokenizer or
  5671. preprocessor, and works simply by reading the relevant lines within the
  5672. braces. In particular, the RTL body must be on separate lines from the
  5673. enclosing braces, and the preprocessor is not usable within it.
  5674. 
  5675. File: gccint.info, Node: Options, Next: Passes, Prev: Testsuites, Up: Top
  5676. 8 Option specification files
  5677. ****************************
  5678. Most GCC command-line options are described by special option definition
  5679. files, the names of which conventionally end in '.opt'. This chapter
  5680. describes the format of these files.
  5681. * Menu:
  5682. * Option file format:: The general layout of the files
  5683. * Option properties:: Supported option properties
  5684. 
  5685. File: gccint.info, Node: Option file format, Next: Option properties, Up: Options
  5686. 8.1 Option file format
  5687. ======================
  5688. Option files are a simple list of records in which each field occupies
  5689. its own line and in which the records themselves are separated by blank
  5690. lines. Comments may appear on their own line anywhere within the file
  5691. and are preceded by semicolons. Whitespace is allowed before the
  5692. semicolon.
  5693. The files can contain the following types of record:
  5694. * A language definition record. These records have two fields: the
  5695. string 'Language' and the name of the language. Once a language
  5696. has been declared in this way, it can be used as an option
  5697. property. *Note Option properties::.
  5698. * A target specific save record to save additional information.
  5699. These records have two fields: the string 'TargetSave', and a
  5700. declaration type to go in the 'cl_target_option' structure.
  5701. * A variable record to define a variable used to store option
  5702. information. These records have two fields: the string 'Variable',
  5703. and a declaration of the type and name of the variable, optionally
  5704. with an initializer (but without any trailing ';'). These records
  5705. may be used for variables used for many options where declaring the
  5706. initializer in a single option definition record, or duplicating it
  5707. in many records, would be inappropriate, or for variables set in
  5708. option handlers rather than referenced by 'Var' properties.
  5709. * A variable record to define a variable used to store option
  5710. information. These records have two fields: the string
  5711. 'TargetVariable', and a declaration of the type and name of the
  5712. variable, optionally with an initializer (but without any trailing
  5713. ';'). 'TargetVariable' is a combination of 'Variable' and
  5714. 'TargetSave' records in that the variable is defined in the
  5715. 'gcc_options' structure, but these variables are also stored in the
  5716. 'cl_target_option' structure. The variables are saved in the
  5717. target save code and restored in the target restore code.
  5718. * A variable record to record any additional files that the
  5719. 'options.h' file should include. This is useful to provide
  5720. enumeration or structure definitions needed for target variables.
  5721. These records have two fields: the string 'HeaderInclude' and the
  5722. name of the include file.
  5723. * A variable record to record any additional files that the
  5724. 'options.c' or 'options-save.c' file should include. This is
  5725. useful to provide inline functions needed for target variables
  5726. and/or '#ifdef' sequences to properly set up the initialization.
  5727. These records have two fields: the string 'SourceInclude' and the
  5728. name of the include file.
  5729. * An enumeration record to define a set of strings that may be used
  5730. as arguments to an option or options. These records have three
  5731. fields: the string 'Enum', a space-separated list of properties and
  5732. help text used to describe the set of strings in '--help' output.
  5733. Properties use the same format as option properties; the following
  5734. are valid:
  5735. 'Name(NAME)'
  5736. This property is required; NAME must be a name (suitable for
  5737. use in C identifiers) used to identify the set of strings in
  5738. 'Enum' option properties.
  5739. 'Type(TYPE)'
  5740. This property is required; TYPE is the C type for variables
  5741. set by options using this enumeration together with 'Var'.
  5742. 'UnknownError(MESSAGE)'
  5743. The message MESSAGE will be used as an error message if the
  5744. argument is invalid; for enumerations without 'UnknownError',
  5745. a generic error message is used. MESSAGE should contain a
  5746. single '%qs' format, which will be used to format the invalid
  5747. argument.
  5748. * An enumeration value record to define one of the strings in a set
  5749. given in an 'Enum' record. These records have two fields: the
  5750. string 'EnumValue' and a space-separated list of properties.
  5751. Properties use the same format as option properties; the following
  5752. are valid:
  5753. 'Enum(NAME)'
  5754. This property is required; NAME says which 'Enum' record this
  5755. 'EnumValue' record corresponds to.
  5756. 'String(STRING)'
  5757. This property is required; STRING is the string option
  5758. argument being described by this record.
  5759. 'Value(VALUE)'
  5760. This property is required; it says what value (representable
  5761. as 'int') should be used for the given string.
  5762. 'Canonical'
  5763. This property is optional. If present, it says the present
  5764. string is the canonical one among all those with the given
  5765. value. Other strings yielding that value will be mapped to
  5766. this one so specs do not need to handle them.
  5767. 'DriverOnly'
  5768. This property is optional. If present, the present string
  5769. will only be accepted by the driver. This is used for cases
  5770. such as '-march=native' that are processed by the driver so
  5771. that 'gcc -v' shows how the options chosen depended on the
  5772. system on which the compiler was run.
  5773. * An option definition record. These records have the following
  5774. fields:
  5775. 1. the name of the option, with the leading "-" removed
  5776. 2. a space-separated list of option properties (*note Option
  5777. properties::)
  5778. 3. the help text to use for '--help' (omitted if the second field
  5779. contains the 'Undocumented' property).
  5780. By default, all options beginning with "f", "W" or "m" are
  5781. implicitly assumed to take a "no-" form. This form should not be
  5782. listed separately. If an option beginning with one of these
  5783. letters does not have a "no-" form, you can use the
  5784. 'RejectNegative' property to reject it.
  5785. The help text is automatically line-wrapped before being displayed.
  5786. Normally the name of the option is printed on the left-hand side of
  5787. the output and the help text is printed on the right. However, if
  5788. the help text contains a tab character, the text to the left of the
  5789. tab is used instead of the option's name and the text to the right
  5790. of the tab forms the help text. This allows you to elaborate on
  5791. what type of argument the option takes.
  5792. * A target mask record. These records have one field of the form
  5793. 'Mask(X)'. The options-processing script will automatically
  5794. allocate a bit in 'target_flags' (*note Run-time Target::) for each
  5795. mask name X and set the macro 'MASK_X' to the appropriate bitmask.
  5796. It will also declare a 'TARGET_X' macro that has the value 1 when
  5797. bit 'MASK_X' is set and 0 otherwise.
  5798. They are primarily intended to declare target masks that are not
  5799. associated with user options, either because these masks represent
  5800. internal switches or because the options are not available on all
  5801. configurations and yet the masks always need to be defined.
  5802. 
  5803. File: gccint.info, Node: Option properties, Prev: Option file format, Up: Options
  5804. 8.2 Option properties
  5805. =====================
  5806. The second field of an option record can specify any of the following
  5807. properties. When an option takes an argument, it is enclosed in
  5808. parentheses following the option property name. The parser that handles
  5809. option files is quite simplistic, and will be tricked by any nested
  5810. parentheses within the argument text itself; in this case, the entire
  5811. option argument can be wrapped in curly braces within the parentheses to
  5812. demarcate it, e.g.:
  5813. Condition({defined (USE_CYGWIN_LIBSTDCXX_WRAPPERS)})
  5814. 'Common'
  5815. The option is available for all languages and targets.
  5816. 'Target'
  5817. The option is available for all languages but is target-specific.
  5818. 'Driver'
  5819. The option is handled by the compiler driver using code not shared
  5820. with the compilers proper ('cc1' etc.).
  5821. 'LANGUAGE'
  5822. The option is available when compiling for the given language.
  5823. It is possible to specify several different languages for the same
  5824. option. Each LANGUAGE must have been declared by an earlier
  5825. 'Language' record. *Note Option file format::.
  5826. 'RejectDriver'
  5827. The option is only handled by the compilers proper ('cc1' etc.) and
  5828. should not be accepted by the driver.
  5829. 'RejectNegative'
  5830. The option does not have a "no-" form. All options beginning with
  5831. "f", "W" or "m" are assumed to have a "no-" form unless this
  5832. property is used.
  5833. 'Negative(OTHERNAME)'
  5834. The option will turn off another option OTHERNAME, which is the
  5835. option name with the leading "-" removed. This chain action will
  5836. propagate through the 'Negative' property of the option to be
  5837. turned off. The driver will prune options, removing those that are
  5838. turned off by some later option. This pruning is not done for
  5839. options with 'Joined' or 'JoinedOrMissing' properties, unless the
  5840. options have either 'RejectNegative' property or the 'Negative'
  5841. property mentions an option other than itself.
  5842. As a consequence, if you have a group of mutually-exclusive
  5843. options, their 'Negative' properties should form a circular chain.
  5844. For example, if options '-A', '-B' and '-C' are mutually exclusive,
  5845. their respective 'Negative' properties should be 'Negative(B)',
  5846. 'Negative(C)' and 'Negative(A)'.
  5847. 'Joined'
  5848. 'Separate'
  5849. The option takes a mandatory argument. 'Joined' indicates that the
  5850. option and argument can be included in the same 'argv' entry (as
  5851. with '-mflush-func=NAME', for example). 'Separate' indicates that
  5852. the option and argument can be separate 'argv' entries (as with
  5853. '-o'). An option is allowed to have both of these properties.
  5854. 'JoinedOrMissing'
  5855. The option takes an optional argument. If the argument is given,
  5856. it will be part of the same 'argv' entry as the option itself.
  5857. This property cannot be used alongside 'Joined' or 'Separate'.
  5858. 'MissingArgError(MESSAGE)'
  5859. For an option marked 'Joined' or 'Separate', the message MESSAGE
  5860. will be used as an error message if the mandatory argument is
  5861. missing; for options without 'MissingArgError', a generic error
  5862. message is used. MESSAGE should contain a single '%qs' format,
  5863. which will be used to format the name of the option passed.
  5864. 'Args(N)'
  5865. For an option marked 'Separate', indicate that it takes N
  5866. arguments. The default is 1.
  5867. 'UInteger'
  5868. The option's argument is a non-negative integer consisting of
  5869. either decimal or hexadecimal digits interpreted as 'int'.
  5870. Hexadecimal integers may optionally start with the '0x' or '0X'
  5871. prefix. The option parser validates and converts the argument
  5872. before passing it to the relevant option handler. 'UInteger'
  5873. should also be used with options like '-falign-loops' where both
  5874. '-falign-loops' and '-falign-loops'=N are supported to make sure
  5875. the saved options are given a full integer. Positive values of the
  5876. argument in excess of 'INT_MAX' wrap around zero.
  5877. 'Host_Wide_Int'
  5878. The option's argument is a non-negative integer consisting of
  5879. either decimal or hexadecimal digits interpreted as the widest
  5880. integer type on the host. As with an 'UInteger' argument,
  5881. hexadecimal integers may optionally start with the '0x' or '0X'
  5882. prefix. The option parser validates and converts the argument
  5883. before passing it to the relevant option handler. 'Host_Wide_Int'
  5884. should be used with options that need to accept very large values.
  5885. Positive values of the argument in excess of 'HOST_WIDE_INT_M1U'
  5886. are assigned 'HOST_WIDE_INT_M1U'.
  5887. 'IntegerRange(N, M)'
  5888. The options's arguments are integers of type 'int'. The option's
  5889. parser validates that the value of an option integer argument is
  5890. within the closed range [N, M].
  5891. 'ByteSize'
  5892. A property applicable only to 'UInteger' or 'Host_Wide_Int'
  5893. arguments. The option's integer argument is interpreted as if in
  5894. infinite precision using saturation arithmetic in the corresponding
  5895. type. The argument may be followed by a 'byte-size' suffix
  5896. designating a multiple of bytes such as 'kB' and 'KiB' for kilobyte
  5897. and kibibyte, respectively, 'MB' and 'MiB' for megabyte and
  5898. mebibyte, 'GB' and 'GiB' for gigabyte and gigibyte, and so on.
  5899. 'ByteSize' should be used for with options that take a very large
  5900. argument representing a size in bytes, such as '-Wlarger-than='.
  5901. 'ToLower'
  5902. The option's argument should be converted to lowercase as part of
  5903. putting it in canonical form, and before comparing with the strings
  5904. indicated by any 'Enum' property.
  5905. 'NoDriverArg'
  5906. For an option marked 'Separate', the option only takes an argument
  5907. in the compiler proper, not in the driver. This is for
  5908. compatibility with existing options that are used both directly and
  5909. via '-Wp,'; new options should not have this property.
  5910. 'Var(VAR)'
  5911. The state of this option should be stored in variable VAR (actually
  5912. a macro for 'global_options.x_VAR'). The way that the state is
  5913. stored depends on the type of option:
  5914. 'WarnRemoved'
  5915. The option is removed and every usage of such option will result in
  5916. a warning. We use it option backward compatibility.
  5917. 'Var(VAR, SET)'
  5918. The option controls an integer variable VAR and is active when VAR
  5919. equals SET. The option parser will set VAR to SET when the
  5920. positive form of the option is used and '!SET' when the "no-" form
  5921. is used.
  5922. VAR is declared in the same way as for the single-argument form
  5923. described above.
  5924. * If the option uses the 'Mask' or 'InverseMask' properties, VAR
  5925. is the integer variable that contains the mask.
  5926. * If the option is a normal on/off switch, VAR is an integer
  5927. variable that is nonzero when the option is enabled. The
  5928. options parser will set the variable to 1 when the positive
  5929. form of the option is used and 0 when the "no-" form is used.
  5930. * If the option takes an argument and has the 'UInteger'
  5931. property, VAR is an integer variable that stores the value of
  5932. the argument.
  5933. * If the option takes an argument and has the 'Enum' property,
  5934. VAR is a variable (type given in the 'Type' property of the
  5935. 'Enum' record whose 'Name' property has the same argument as
  5936. the 'Enum' property of this option) that stores the value of
  5937. the argument.
  5938. * If the option has the 'Defer' property, VAR is a pointer to a
  5939. 'VEC(cl_deferred_option,heap)' that stores the option for
  5940. later processing. (VAR is declared with type 'void *' and
  5941. needs to be cast to 'VEC(cl_deferred_option,heap)' before
  5942. use.)
  5943. * Otherwise, if the option takes an argument, VAR is a pointer
  5944. to the argument string. The pointer will be null if the
  5945. argument is optional and wasn't given.
  5946. The option-processing script will usually zero-initialize VAR. You
  5947. can modify this behavior using 'Init'.
  5948. 'Init(VALUE)'
  5949. The variable specified by the 'Var' property should be statically
  5950. initialized to VALUE. If more than one option using the same
  5951. variable specifies 'Init', all must specify the same initializer.
  5952. 'Mask(NAME)'
  5953. The option is associated with a bit in the 'target_flags' variable
  5954. (*note Run-time Target::) and is active when that bit is set. You
  5955. may also specify 'Var' to select a variable other than
  5956. 'target_flags'.
  5957. The options-processing script will automatically allocate a unique
  5958. bit for the option. If the option is attached to 'target_flags',
  5959. the script will set the macro 'MASK_NAME' to the appropriate
  5960. bitmask. It will also declare a 'TARGET_NAME' macro that has the
  5961. value 1 when the option is active and 0 otherwise. If you use
  5962. 'Var' to attach the option to a different variable, the bitmask
  5963. macro with be called 'OPTION_MASK_NAME'.
  5964. 'InverseMask(OTHERNAME)'
  5965. 'InverseMask(OTHERNAME, THISNAME)'
  5966. The option is the inverse of another option that has the
  5967. 'Mask(OTHERNAME)' property. If THISNAME is given, the
  5968. options-processing script will declare a 'TARGET_THISNAME' macro
  5969. that is 1 when the option is active and 0 otherwise.
  5970. 'Enum(NAME)'
  5971. The option's argument is a string from the set of strings
  5972. associated with the corresponding 'Enum' record. The string is
  5973. checked and converted to the integer specified in the corresponding
  5974. 'EnumValue' record before being passed to option handlers.
  5975. 'Defer'
  5976. The option should be stored in a vector, specified with 'Var', for
  5977. later processing.
  5978. 'Alias(OPT)'
  5979. 'Alias(OPT, ARG)'
  5980. 'Alias(OPT, POSARG, NEGARG)'
  5981. The option is an alias for '-OPT' (or the negative form of that
  5982. option, depending on 'NegativeAlias'). In the first form, any
  5983. argument passed to the alias is considered to be passed to '-OPT',
  5984. and '-OPT' is considered to be negated if the alias is used in
  5985. negated form. In the second form, the alias may not be negated or
  5986. have an argument, and POSARG is considered to be passed as an
  5987. argument to '-OPT'. In the third form, the alias may not have an
  5988. argument, if the alias is used in the positive form then POSARG is
  5989. considered to be passed to '-OPT', and if the alias is used in the
  5990. negative form then NEGARG is considered to be passed to '-OPT'.
  5991. Aliases should not specify 'Var' or 'Mask' or 'UInteger'. Aliases
  5992. should normally specify the same languages as the target of the
  5993. alias; the flags on the target will be used to determine any
  5994. diagnostic for use of an option for the wrong language, while those
  5995. on the alias will be used to identify what command-line text is the
  5996. option and what text is any argument to that option.
  5997. When an 'Alias' definition is used for an option, driver specs do
  5998. not need to handle it and no 'OPT_' enumeration value is defined
  5999. for it; only the canonical form of the option will be seen in those
  6000. places.
  6001. 'NegativeAlias'
  6002. For an option marked with 'Alias(OPT)', the option is considered to
  6003. be an alias for the positive form of '-OPT' if negated and for the
  6004. negative form of '-OPT' if not negated. 'NegativeAlias' may not be
  6005. used with the forms of 'Alias' taking more than one argument.
  6006. 'Ignore'
  6007. This option is ignored apart from printing any warning specified
  6008. using 'Warn'. The option will not be seen by specs and no 'OPT_'
  6009. enumeration value is defined for it.
  6010. 'SeparateAlias'
  6011. For an option marked with 'Joined', 'Separate' and 'Alias', the
  6012. option only acts as an alias when passed a separate argument; with
  6013. a joined argument it acts as a normal option, with an 'OPT_'
  6014. enumeration value. This is for compatibility with the Java '-d'
  6015. option and should not be used for new options.
  6016. 'Warn(MESSAGE)'
  6017. If this option is used, output the warning MESSAGE. MESSAGE is a
  6018. format string, either taking a single operand with a '%qs' format
  6019. which is the option name, or not taking any operands, which is
  6020. passed to the 'warning' function. If an alias is marked 'Warn',
  6021. the target of the alias must not also be marked 'Warn'.
  6022. 'Report'
  6023. The state of the option should be printed by '-fverbose-asm'.
  6024. 'Warning'
  6025. This is a warning option and should be shown as such in '--help'
  6026. output. This flag does not currently affect anything other than
  6027. '--help'.
  6028. 'Optimization'
  6029. This is an optimization option. It should be shown as such in
  6030. '--help' output, and any associated variable named using 'Var'
  6031. should be saved and restored when the optimization level is changed
  6032. with 'optimize' attributes.
  6033. 'PerFunction'
  6034. This is an option that can be overridden on a per-function basis.
  6035. 'Optimization' implies 'PerFunction', but options that do not
  6036. affect executable code generation may use this flag instead, so
  6037. that the option is not taken into account in ways that might affect
  6038. executable code generation.
  6039. 'Param'
  6040. This is an option that is a parameter.
  6041. 'Undocumented'
  6042. The option is deliberately missing documentation and should not be
  6043. included in the '--help' output.
  6044. 'Condition(COND)'
  6045. The option should only be accepted if preprocessor condition COND
  6046. is true. Note that any C declarations associated with the option
  6047. will be present even if COND is false; COND simply controls whether
  6048. the option is accepted and whether it is printed in the '--help'
  6049. output.
  6050. 'Save'
  6051. Build the 'cl_target_option' structure to hold a copy of the
  6052. option, add the functions 'cl_target_option_save' and
  6053. 'cl_target_option_restore' to save and restore the options.
  6054. 'SetByCombined'
  6055. The option may also be set by a combined option such as
  6056. '-ffast-math'. This causes the 'gcc_options' struct to have a
  6057. field 'frontend_set_NAME', where 'NAME' is the name of the field
  6058. holding the value of this option (without the leading 'x_'). This
  6059. gives the front end a way to indicate that the value has been set
  6060. explicitly and should not be changed by the combined option. For
  6061. example, some front ends use this to prevent '-ffast-math' and
  6062. '-fno-fast-math' from changing the value of '-fmath-errno' for
  6063. languages that do not use 'errno'.
  6064. 'EnabledBy(OPT)'
  6065. 'EnabledBy(OPT || OPT2)'
  6066. 'EnabledBy(OPT && OPT2)'
  6067. If not explicitly set, the option is set to the value of '-OPT';
  6068. multiple options can be given, separated by '||'. The third form
  6069. using '&&' specifies that the option is only set if both OPT and
  6070. OPT2 are set. The options OPT and OPT2 must have the 'Common'
  6071. property; otherwise, use 'LangEnabledBy'.
  6072. 'LangEnabledBy(LANGUAGE, OPT)'
  6073. 'LangEnabledBy(LANGUAGE, OPT, POSARG, NEGARG)'
  6074. When compiling for the given language, the option is set to the
  6075. value of '-OPT', if not explicitly set. OPT can be also a list of
  6076. '||' separated options. In the second form, if OPT is used in the
  6077. positive form then POSARG is considered to be passed to the option,
  6078. and if OPT is used in the negative form then NEGARG is considered
  6079. to be passed to the option. It is possible to specify several
  6080. different languages. Each LANGUAGE must have been declared by an
  6081. earlier 'Language' record. *Note Option file format::.
  6082. 'NoDWARFRecord'
  6083. The option is omitted from the producer string written by
  6084. '-grecord-gcc-switches'.
  6085. 'PchIgnore'
  6086. Even if this is a target option, this option will not be recorded /
  6087. compared to determine if a precompiled header file matches.
  6088. 'CPP(VAR)'
  6089. The state of this option should be kept in sync with the
  6090. preprocessor option VAR. If this property is set, then properties
  6091. 'Var' and 'Init' must be set as well.
  6092. 'CppReason(CPP_W_ENUM)'
  6093. This warning option corresponds to 'cpplib.h' warning reason code
  6094. CPP_W_ENUM. This should only be used for warning options of the
  6095. C-family front-ends.
  6096. 
  6097. File: gccint.info, Node: Passes, Next: poly_int, Prev: Options, Up: Top
  6098. 9 Passes and Files of the Compiler
  6099. **********************************
  6100. This chapter is dedicated to giving an overview of the optimization and
  6101. code generation passes of the compiler. In the process, it describes
  6102. some of the language front end interface, though this description is no
  6103. where near complete.
  6104. * Menu:
  6105. * Parsing pass:: The language front end turns text into bits.
  6106. * Gimplification pass:: The bits are turned into something we can optimize.
  6107. * Pass manager:: Sequencing the optimization passes.
  6108. * IPA passes:: Inter-procedural optimizations.
  6109. * Tree SSA passes:: Optimizations on a high-level representation.
  6110. * RTL passes:: Optimizations on a low-level representation.
  6111. * Optimization info:: Dumping optimization information from passes.
  6112. 
  6113. File: gccint.info, Node: Parsing pass, Next: Gimplification pass, Up: Passes
  6114. 9.1 Parsing pass
  6115. ================
  6116. The language front end is invoked only once, via
  6117. 'lang_hooks.parse_file', to parse the entire input. The language front
  6118. end may use any intermediate language representation deemed appropriate.
  6119. The C front end uses GENERIC trees (*note GENERIC::), plus a double
  6120. handful of language specific tree codes defined in 'c-common.def'. The
  6121. Fortran front end uses a completely different private representation.
  6122. At some point the front end must translate the representation used in
  6123. the front end to a representation understood by the language-independent
  6124. portions of the compiler. Current practice takes one of two forms. The
  6125. C front end manually invokes the gimplifier (*note GIMPLE::) on each
  6126. function, and uses the gimplifier callbacks to convert the
  6127. language-specific tree nodes directly to GIMPLE before passing the
  6128. function off to be compiled. The Fortran front end converts from a
  6129. private representation to GENERIC, which is later lowered to GIMPLE when
  6130. the function is compiled. Which route to choose probably depends on how
  6131. well GENERIC (plus extensions) can be made to match up with the source
  6132. language and necessary parsing data structures.
  6133. BUG: Gimplification must occur before nested function lowering, and
  6134. nested function lowering must be done by the front end before passing
  6135. the data off to cgraph.
  6136. TODO: Cgraph should control nested function lowering. It would only be
  6137. invoked when it is certain that the outer-most function is used.
  6138. TODO: Cgraph needs a gimplify_function callback. It should be invoked
  6139. when (1) it is certain that the function is used, (2) warning flags
  6140. specified by the user require some amount of compilation in order to
  6141. honor, (3) the language indicates that semantic analysis is not complete
  6142. until gimplification occurs. Hum... this sounds overly complicated.
  6143. Perhaps we should just have the front end gimplify always; in most cases
  6144. it's only one function call.
  6145. The front end needs to pass all function definitions and top level
  6146. declarations off to the middle-end so that they can be compiled and
  6147. emitted to the object file. For a simple procedural language, it is
  6148. usually most convenient to do this as each top level declaration or
  6149. definition is seen. There is also a distinction to be made between
  6150. generating functional code and generating complete debug information.
  6151. The only thing that is absolutely required for functional code is that
  6152. function and data _definitions_ be passed to the middle-end. For
  6153. complete debug information, function, data and type declarations should
  6154. all be passed as well.
  6155. In any case, the front end needs each complete top-level function or
  6156. data declaration, and each data definition should be passed to
  6157. 'rest_of_decl_compilation'. Each complete type definition should be
  6158. passed to 'rest_of_type_compilation'. Each function definition should
  6159. be passed to 'cgraph_finalize_function'.
  6160. TODO: I know rest_of_compilation currently has all sorts of RTL
  6161. generation semantics. I plan to move all code generation bits (both
  6162. Tree and RTL) to compile_function. Should we hide cgraph from the front
  6163. ends and move back to rest_of_compilation as the official interface?
  6164. Possibly we should rename all three interfaces such that the names match
  6165. in some meaningful way and that is more descriptive than "rest_of".
  6166. The middle-end will, at its option, emit the function and data
  6167. definitions immediately or queue them for later processing.
  6168. 
  6169. File: gccint.info, Node: Gimplification pass, Next: Pass manager, Prev: Parsing pass, Up: Passes
  6170. 9.2 Gimplification pass
  6171. =======================
  6172. "Gimplification" is a whimsical term for the process of converting the
  6173. intermediate representation of a function into the GIMPLE language
  6174. (*note GIMPLE::). The term stuck, and so words like "gimplification",
  6175. "gimplify", "gimplifier" and the like are sprinkled throughout this
  6176. section of code.
  6177. While a front end may certainly choose to generate GIMPLE directly if
  6178. it chooses, this can be a moderately complex process unless the
  6179. intermediate language used by the front end is already fairly simple.
  6180. Usually it is easier to generate GENERIC trees plus extensions and let
  6181. the language-independent gimplifier do most of the work.
  6182. The main entry point to this pass is 'gimplify_function_tree' located
  6183. in 'gimplify.c'. From here we process the entire function gimplifying
  6184. each statement in turn. The main workhorse for this pass is
  6185. 'gimplify_expr'. Approximately everything passes through here at least
  6186. once, and it is from here that we invoke the 'lang_hooks.gimplify_expr'
  6187. callback.
  6188. The callback should examine the expression in question and return
  6189. 'GS_UNHANDLED' if the expression is not a language specific construct
  6190. that requires attention. Otherwise it should alter the expression in
  6191. some way to such that forward progress is made toward producing valid
  6192. GIMPLE. If the callback is certain that the transformation is complete
  6193. and the expression is valid GIMPLE, it should return 'GS_ALL_DONE'.
  6194. Otherwise it should return 'GS_OK', which will cause the expression to
  6195. be processed again. If the callback encounters an error during the
  6196. transformation (because the front end is relying on the gimplification
  6197. process to finish semantic checks), it should return 'GS_ERROR'.
  6198. 
  6199. File: gccint.info, Node: Pass manager, Next: IPA passes, Prev: Gimplification pass, Up: Passes
  6200. 9.3 Pass manager
  6201. ================
  6202. The pass manager is located in 'passes.c', 'tree-optimize.c' and
  6203. 'tree-pass.h'. It processes passes as described in 'passes.def'. Its
  6204. job is to run all of the individual passes in the correct order, and
  6205. take care of standard bookkeeping that applies to every pass.
  6206. The theory of operation is that each pass defines a structure that
  6207. represents everything we need to know about that pass--when it should be
  6208. run, how it should be run, what intermediate language form or
  6209. on-the-side data structures it needs. We register the pass to be run in
  6210. some particular order, and the pass manager arranges for everything to
  6211. happen in the correct order.
  6212. The actuality doesn't completely live up to the theory at present.
  6213. Command-line switches and 'timevar_id_t' enumerations must still be
  6214. defined elsewhere. The pass manager validates constraints but does not
  6215. attempt to (re-)generate data structures or lower intermediate language
  6216. form based on the requirements of the next pass. Nevertheless, what is
  6217. present is useful, and a far sight better than nothing at all.
  6218. Each pass should have a unique name. Each pass may have its own dump
  6219. file (for GCC debugging purposes). Passes with a name starting with a
  6220. star do not dump anything. Sometimes passes are supposed to share a
  6221. dump file / option name. To still give these unique names, you can use
  6222. a prefix that is delimited by a space from the part that is used for the
  6223. dump file / option name. E.g. When the pass name is "ud dce", the name
  6224. used for dump file/options is "dce".
  6225. TODO: describe the global variables set up by the pass manager, and a
  6226. brief description of how a new pass should use it. I need to look at
  6227. what info RTL passes use first...
  6228. 
  6229. File: gccint.info, Node: IPA passes, Next: Tree SSA passes, Prev: Pass manager, Up: Passes
  6230. 9.4 Inter-procedural optimization passes
  6231. ========================================
  6232. The inter-procedural optimization (IPA) passes use call graph
  6233. information to perform transformations across function boundaries. IPA
  6234. is a critical part of link-time optimization (LTO) and whole-program
  6235. (WHOPR) optimization, and these passes are structured with the needs of
  6236. LTO and WHOPR in mind by dividing their operations into stages. For
  6237. detailed discussion of the LTO/WHOPR IPA pass stages and interfaces, see
  6238. *note IPA::.
  6239. The following briefly describes the inter-procedural optimization (IPA)
  6240. passes, which are split into small IPA passes, regular IPA passes, and
  6241. late IPA passes, according to the LTO/WHOPR processing model.
  6242. * Menu:
  6243. * Small IPA passes::
  6244. * Regular IPA passes::
  6245. * Late IPA passes::
  6246. 
  6247. File: gccint.info, Node: Small IPA passes, Next: Regular IPA passes, Up: IPA passes
  6248. 9.4.1 Small IPA passes
  6249. ----------------------
  6250. A small IPA pass is a pass derived from 'simple_ipa_opt_pass'. As
  6251. described in *note IPA::, it does everything at once and defines only
  6252. the _Execute_ stage. During this stage it accesses and modifies the
  6253. function bodies. No 'generate_summary', 'read_summary', or
  6254. 'write_summary' hooks are defined.
  6255. * IPA free lang data
  6256. This pass frees resources that are used by the front end but are
  6257. not needed once it is done. It is located in 'tree.c' and is
  6258. described by 'pass_ipa_free_lang_data'.
  6259. * IPA function and variable visibility
  6260. This is a local function pass handling visibilities of all symbols.
  6261. This happens before LTO streaming, so '-fwhole-program' should be
  6262. ignored at this level. It is located in 'ipa-visibility.c' and is
  6263. described by 'pass_ipa_function_and_variable_visibility'.
  6264. * IPA remove symbols
  6265. This pass performs reachability analysis and reclaims all
  6266. unreachable nodes. It is located in 'passes.c' and is described by
  6267. 'pass_ipa_remove_symbols'.
  6268. * IPA OpenACC
  6269. This is a pass group for OpenACC processing. It is located in
  6270. 'tree-ssa-loop.c' and is described by 'pass_ipa_oacc'.
  6271. * IPA points-to analysis
  6272. This is a tree-based points-to analysis pass. The idea behind this
  6273. analyzer is to generate set constraints from the program, then
  6274. solve the resulting constraints in order to generate the points-to
  6275. sets. It is located in 'tree-ssa-structalias.c' and is described
  6276. by 'pass_ipa_pta'.
  6277. * IPA OpenACC kernels
  6278. This is a pass group for processing OpenACC kernels regions. It is
  6279. a subpass of the IPA OpenACC pass group that runs on offloaded
  6280. functions containing OpenACC kernels loops. It is located in
  6281. 'tree-ssa-loop.c' and is described by 'pass_ipa_oacc_kernels'.
  6282. * Target clone
  6283. This is a pass for parsing functions with multiple target
  6284. attributes. It is located in 'multiple_target.c' and is described
  6285. by 'pass_target_clone'.
  6286. * IPA auto profile
  6287. This pass uses AutoFDO profiling data to annotate the control flow
  6288. graph. It is located in 'auto-profile.c' and is described by
  6289. 'pass_ipa_auto_profile'.
  6290. * IPA tree profile
  6291. This pass does profiling for all functions in the call graph. It
  6292. calculates branch probabilities and basic block execution counts.
  6293. It is located in 'tree-profile.c' and is described by
  6294. 'pass_ipa_tree_profile'.
  6295. * IPA free function summary
  6296. This pass is a small IPA pass when argument 'small_p' is true. It
  6297. releases inline function summaries and call summaries. It is
  6298. located in 'ipa-fnsummary.c' and is described by
  6299. 'pass_ipa_free_free_fn_summary'.
  6300. * IPA increase alignment
  6301. This pass increases the alignment of global arrays to improve
  6302. vectorization. It is located in 'tree-vectorizer.c' and is
  6303. described by 'pass_ipa_increase_alignment'.
  6304. * IPA transactional memory
  6305. This pass is for transactional memory support. It is located in
  6306. 'trans-mem.c' and is described by 'pass_ipa_tm'.
  6307. * IPA lower emulated TLS
  6308. This pass lowers thread-local storage (TLS) operations to emulation
  6309. functions provided by libgcc. It is located in 'tree-emutls.c' and
  6310. is described by 'pass_ipa_lower_emutls'.
  6311. 
  6312. File: gccint.info, Node: Regular IPA passes, Next: Late IPA passes, Prev: Small IPA passes, Up: IPA passes
  6313. 9.4.2 Regular IPA passes
  6314. ------------------------
  6315. A regular IPA pass is a pass derived from 'ipa_opt_pass_d' that is
  6316. executed in WHOPR compilation. Regular IPA passes may have summary
  6317. hooks implemented in any of the LGEN, WPA or LTRANS stages (*note
  6318. IPA::).
  6319. * IPA whole program visibility
  6320. This pass performs various optimizations involving symbol
  6321. visibility with '-fwhole-program', including symbol privatization,
  6322. discovering local functions, and dismantling comdat groups. It is
  6323. located in 'ipa-visibility.c' and is described by
  6324. 'pass_ipa_whole_program_visibility'.
  6325. * IPA profile
  6326. The IPA profile pass propagates profiling frequencies across the
  6327. call graph. It is located in 'ipa-profile.c' and is described by
  6328. 'pass_ipa_profile'.
  6329. * IPA identical code folding
  6330. This is the inter-procedural identical code folding pass. The goal
  6331. of this transformation is to discover functions and read-only
  6332. variables that have exactly the same semantics. It is located in
  6333. 'ipa-icf.c' and is described by 'pass_ipa_icf'.
  6334. * IPA devirtualization
  6335. This pass performs speculative devirtualization based on the type
  6336. inheritance graph. When a polymorphic call has only one likely
  6337. target in the unit, it is turned into a speculative call. It is
  6338. located in 'ipa-devirt.c' and is described by 'pass_ipa_devirt'.
  6339. * IPA constant propagation
  6340. The goal of this pass is to discover functions that are always
  6341. invoked with some arguments with the same known constant values and
  6342. to modify the functions accordingly. It can also do partial
  6343. specialization and type-based devirtualization. It is located in
  6344. 'ipa-cp.c' and is described by 'pass_ipa_cp'.
  6345. * IPA scalar replacement of aggregates
  6346. This pass can replace an aggregate parameter with a set of other
  6347. parameters representing part of the original, turning those passed
  6348. by reference into new ones which pass the value directly. It also
  6349. removes unused function return values and unused function
  6350. parameters. This pass is located in 'ipa-sra.c' and is described
  6351. by 'pass_ipa_sra'.
  6352. * IPA constructor/destructor merge
  6353. This pass merges multiple constructors and destructors for static
  6354. objects into single functions. It's only run at LTO time unless
  6355. the target doesn't support constructors and destructors natively.
  6356. The pass is located in 'ipa.c' and is described by
  6357. 'pass_ipa_cdtor_merge'.
  6358. * IPA HSA
  6359. This pass is part of the GCC support for HSA (Heterogeneous System
  6360. Architecture) accelerators. It is responsible for creation of HSA
  6361. clones and emitting HSAIL instructions for them. It is located in
  6362. 'ipa-hsa.c' and is described by 'pass_ipa_hsa'.
  6363. * IPA function summary
  6364. This pass provides function analysis for inter-procedural passes.
  6365. It collects estimates of function body size, execution time, and
  6366. frame size for each function. It also estimates information about
  6367. function calls: call statement size, time and how often the
  6368. parameters change for each call. It is located in
  6369. 'ipa-fnsummary.c' and is described by 'pass_ipa_fn_summary'.
  6370. * IPA inline
  6371. The IPA inline pass handles function inlining with whole-program
  6372. knowledge. Small functions that are candidates for inlining are
  6373. ordered in increasing badness, bounded by unit growth parameters.
  6374. Unreachable functions are removed from the call graph. Functions
  6375. called once and not exported from the unit are inlined. This pass
  6376. is located in 'ipa-inline.c' and is described by 'pass_ipa_inline'.
  6377. * IPA pure/const analysis
  6378. This pass marks functions as being either const ('TREE_READONLY')
  6379. or pure ('DECL_PURE_P'). The per-function information is produced
  6380. by 'pure_const_generate_summary', then the global information is
  6381. computed by performing a transitive closure over the call graph.
  6382. It is located in 'ipa-pure-const.c' and is described by
  6383. 'pass_ipa_pure_const'.
  6384. * IPA free function summary
  6385. This pass is a regular IPA pass when argument 'small_p' is false.
  6386. It releases inline function summaries and call summaries. It is
  6387. located in 'ipa-fnsummary.c' and is described by
  6388. 'pass_ipa_free_fn_summary'.
  6389. * IPA reference
  6390. This pass gathers information about how variables whose scope is
  6391. confined to the compilation unit are used. It is located in
  6392. 'ipa-reference.c' and is described by 'pass_ipa_reference'.
  6393. * IPA single use
  6394. This pass checks whether variables are used by a single function.
  6395. It is located in 'ipa.c' and is described by 'pass_ipa_single_use'.
  6396. * IPA comdats
  6397. This pass looks for static symbols that are used exclusively within
  6398. one comdat group, and moves them into that comdat group. It is
  6399. located in 'ipa-comdats.c' and is described by 'pass_ipa_comdats'.
  6400. 
  6401. File: gccint.info, Node: Late IPA passes, Prev: Regular IPA passes, Up: IPA passes
  6402. 9.4.3 Late IPA passes
  6403. ---------------------
  6404. Late IPA passes are simple IPA passes executed after the regular passes.
  6405. In WHOPR mode the passes are executed after partitioning and thus see
  6406. just parts of the compiled unit.
  6407. * Materialize all clones
  6408. Once all functions from compilation unit are in memory, produce all
  6409. clones and update all calls. It is located in 'ipa.c' and is
  6410. described by 'pass_materialize_all_clones'.
  6411. * IPA points-to analysis
  6412. Points-to analysis; this is the same as the points-to-analysis pass
  6413. run with the small IPA passes (*note Small IPA passes::).
  6414. * OpenMP simd clone
  6415. This is the OpenMP constructs' SIMD clone pass. It creates the
  6416. appropriate SIMD clones for functions tagged as elemental SIMD
  6417. functions. It is located in 'omp-simd-clone.c' and is described by
  6418. 'pass_omp_simd_clone'.
  6419. 
  6420. File: gccint.info, Node: Tree SSA passes, Next: RTL passes, Prev: IPA passes, Up: Passes
  6421. 9.5 Tree SSA passes
  6422. ===================
  6423. The following briefly describes the Tree optimization passes that are
  6424. run after gimplification and what source files they are located in.
  6425. * Remove useless statements
  6426. This pass is an extremely simple sweep across the gimple code in
  6427. which we identify obviously dead code and remove it. Here we do
  6428. things like simplify 'if' statements with constant conditions,
  6429. remove exception handling constructs surrounding code that
  6430. obviously cannot throw, remove lexical bindings that contain no
  6431. variables, and other assorted simplistic cleanups. The idea is to
  6432. get rid of the obvious stuff quickly rather than wait until later
  6433. when it's more work to get rid of it. This pass is located in
  6434. 'tree-cfg.c' and described by 'pass_remove_useless_stmts'.
  6435. * OpenMP lowering
  6436. If OpenMP generation ('-fopenmp') is enabled, this pass lowers
  6437. OpenMP constructs into GIMPLE.
  6438. Lowering of OpenMP constructs involves creating replacement
  6439. expressions for local variables that have been mapped using data
  6440. sharing clauses, exposing the control flow of most synchronization
  6441. directives and adding region markers to facilitate the creation of
  6442. the control flow graph. The pass is located in 'omp-low.c' and is
  6443. described by 'pass_lower_omp'.
  6444. * OpenMP expansion
  6445. If OpenMP generation ('-fopenmp') is enabled, this pass expands
  6446. parallel regions into their own functions to be invoked by the
  6447. thread library. The pass is located in 'omp-low.c' and is
  6448. described by 'pass_expand_omp'.
  6449. * Lower control flow
  6450. This pass flattens 'if' statements ('COND_EXPR') and moves lexical
  6451. bindings ('BIND_EXPR') out of line. After this pass, all 'if'
  6452. statements will have exactly two 'goto' statements in its 'then'
  6453. and 'else' arms. Lexical binding information for each statement
  6454. will be found in 'TREE_BLOCK' rather than being inferred from its
  6455. position under a 'BIND_EXPR'. This pass is found in 'gimple-low.c'
  6456. and is described by 'pass_lower_cf'.
  6457. * Lower exception handling control flow
  6458. This pass decomposes high-level exception handling constructs
  6459. ('TRY_FINALLY_EXPR' and 'TRY_CATCH_EXPR') into a form that
  6460. explicitly represents the control flow involved. After this pass,
  6461. 'lookup_stmt_eh_region' will return a non-negative number for any
  6462. statement that may have EH control flow semantics; examine
  6463. 'tree_can_throw_internal' or 'tree_can_throw_external' for exact
  6464. semantics. Exact control flow may be extracted from
  6465. 'foreach_reachable_handler'. The EH region nesting tree is defined
  6466. in 'except.h' and built in 'except.c'. The lowering pass itself is
  6467. in 'tree-eh.c' and is described by 'pass_lower_eh'.
  6468. * Build the control flow graph
  6469. This pass decomposes a function into basic blocks and creates all
  6470. of the edges that connect them. It is located in 'tree-cfg.c' and
  6471. is described by 'pass_build_cfg'.
  6472. * Find all referenced variables
  6473. This pass walks the entire function and collects an array of all
  6474. variables referenced in the function, 'referenced_vars'. The index
  6475. at which a variable is found in the array is used as a UID for the
  6476. variable within this function. This data is needed by the SSA
  6477. rewriting routines. The pass is located in 'tree-dfa.c' and is
  6478. described by 'pass_referenced_vars'.
  6479. * Enter static single assignment form
  6480. This pass rewrites the function such that it is in SSA form. After
  6481. this pass, all 'is_gimple_reg' variables will be referenced by
  6482. 'SSA_NAME', and all occurrences of other variables will be
  6483. annotated with 'VDEFS' and 'VUSES'; PHI nodes will have been
  6484. inserted as necessary for each basic block. This pass is located
  6485. in 'tree-ssa.c' and is described by 'pass_build_ssa'.
  6486. * Warn for uninitialized variables
  6487. This pass scans the function for uses of 'SSA_NAME's that are fed
  6488. by default definition. For non-parameter variables, such uses are
  6489. uninitialized. The pass is run twice, before and after
  6490. optimization (if turned on). In the first pass we only warn for
  6491. uses that are positively uninitialized; in the second pass we warn
  6492. for uses that are possibly uninitialized. The pass is located in
  6493. 'tree-ssa.c' and is defined by 'pass_early_warn_uninitialized' and
  6494. 'pass_late_warn_uninitialized'.
  6495. * Dead code elimination
  6496. This pass scans the function for statements without side effects
  6497. whose result is unused. It does not do memory life analysis, so
  6498. any value that is stored in memory is considered used. The pass is
  6499. run multiple times throughout the optimization process. It is
  6500. located in 'tree-ssa-dce.c' and is described by 'pass_dce'.
  6501. * Dominator optimizations
  6502. This pass performs trivial dominator-based copy and constant
  6503. propagation, expression simplification, and jump threading. It is
  6504. run multiple times throughout the optimization process. It is
  6505. located in 'tree-ssa-dom.c' and is described by 'pass_dominator'.
  6506. * Forward propagation of single-use variables
  6507. This pass attempts to remove redundant computation by substituting
  6508. variables that are used once into the expression that uses them and
  6509. seeing if the result can be simplified. It is located in
  6510. 'tree-ssa-forwprop.c' and is described by 'pass_forwprop'.
  6511. * Copy Renaming
  6512. This pass attempts to change the name of compiler temporaries
  6513. involved in copy operations such that SSA->normal can coalesce the
  6514. copy away. When compiler temporaries are copies of user variables,
  6515. it also renames the compiler temporary to the user variable
  6516. resulting in better use of user symbols. It is located in
  6517. 'tree-ssa-copyrename.c' and is described by 'pass_copyrename'.
  6518. * PHI node optimizations
  6519. This pass recognizes forms of PHI inputs that can be represented as
  6520. conditional expressions and rewrites them into straight line code.
  6521. It is located in 'tree-ssa-phiopt.c' and is described by
  6522. 'pass_phiopt'.
  6523. * May-alias optimization
  6524. This pass performs a flow sensitive SSA-based points-to analysis.
  6525. The resulting may-alias, must-alias, and escape analysis
  6526. information is used to promote variables from in-memory addressable
  6527. objects to non-aliased variables that can be renamed into SSA form.
  6528. We also update the 'VDEF'/'VUSE' memory tags for non-renameable
  6529. aggregates so that we get fewer false kills. The pass is located
  6530. in 'tree-ssa-alias.c' and is described by 'pass_may_alias'.
  6531. Interprocedural points-to information is located in
  6532. 'tree-ssa-structalias.c' and described by 'pass_ipa_pta'.
  6533. * Profiling
  6534. This pass instruments the function in order to collect runtime
  6535. block and value profiling data. Such data may be fed back into the
  6536. compiler on a subsequent run so as to allow optimization based on
  6537. expected execution frequencies. The pass is located in
  6538. 'tree-profile.c' and is described by 'pass_ipa_tree_profile'.
  6539. * Static profile estimation
  6540. This pass implements series of heuristics to guess propababilities
  6541. of branches. The resulting predictions are turned into edge
  6542. profile by propagating branches across the control flow graphs.
  6543. The pass is located in 'tree-profile.c' and is described by
  6544. 'pass_profile'.
  6545. * Lower complex arithmetic
  6546. This pass rewrites complex arithmetic operations into their
  6547. component scalar arithmetic operations. The pass is located in
  6548. 'tree-complex.c' and is described by 'pass_lower_complex'.
  6549. * Scalar replacement of aggregates
  6550. This pass rewrites suitable non-aliased local aggregate variables
  6551. into a set of scalar variables. The resulting scalar variables are
  6552. rewritten into SSA form, which allows subsequent optimization
  6553. passes to do a significantly better job with them. The pass is
  6554. located in 'tree-sra.c' and is described by 'pass_sra'.
  6555. * Dead store elimination
  6556. This pass eliminates stores to memory that are subsequently
  6557. overwritten by another store, without any intervening loads. The
  6558. pass is located in 'tree-ssa-dse.c' and is described by 'pass_dse'.
  6559. * Tail recursion elimination
  6560. This pass transforms tail recursion into a loop. It is located in
  6561. 'tree-tailcall.c' and is described by 'pass_tail_recursion'.
  6562. * Forward store motion
  6563. This pass sinks stores and assignments down the flowgraph closer to
  6564. their use point. The pass is located in 'tree-ssa-sink.c' and is
  6565. described by 'pass_sink_code'.
  6566. * Partial redundancy elimination
  6567. This pass eliminates partially redundant computations, as well as
  6568. performing load motion. The pass is located in 'tree-ssa-pre.c'
  6569. and is described by 'pass_pre'.
  6570. Just before partial redundancy elimination, if
  6571. '-funsafe-math-optimizations' is on, GCC tries to convert divisions
  6572. to multiplications by the reciprocal. The pass is located in
  6573. 'tree-ssa-math-opts.c' and is described by 'pass_cse_reciprocal'.
  6574. * Full redundancy elimination
  6575. This is a simpler form of PRE that only eliminates redundancies
  6576. that occur on all paths. It is located in 'tree-ssa-pre.c' and
  6577. described by 'pass_fre'.
  6578. * Loop optimization
  6579. The main driver of the pass is placed in 'tree-ssa-loop.c' and
  6580. described by 'pass_loop'.
  6581. The optimizations performed by this pass are:
  6582. Loop invariant motion. This pass moves only invariants that would
  6583. be hard to handle on RTL level (function calls, operations that
  6584. expand to nontrivial sequences of insns). With '-funswitch-loops'
  6585. it also moves operands of conditions that are invariant out of the
  6586. loop, so that we can use just trivial invariantness analysis in
  6587. loop unswitching. The pass also includes store motion. The pass
  6588. is implemented in 'tree-ssa-loop-im.c'.
  6589. Canonical induction variable creation. This pass creates a simple
  6590. counter for number of iterations of the loop and replaces the exit
  6591. condition of the loop using it, in case when a complicated analysis
  6592. is necessary to determine the number of iterations. Later
  6593. optimizations then may determine the number easily. The pass is
  6594. implemented in 'tree-ssa-loop-ivcanon.c'.
  6595. Induction variable optimizations. This pass performs standard
  6596. induction variable optimizations, including strength reduction,
  6597. induction variable merging and induction variable elimination. The
  6598. pass is implemented in 'tree-ssa-loop-ivopts.c'.
  6599. Loop unswitching. This pass moves the conditional jumps that are
  6600. invariant out of the loops. To achieve this, a duplicate of the
  6601. loop is created for each possible outcome of conditional jump(s).
  6602. The pass is implemented in 'tree-ssa-loop-unswitch.c'.
  6603. Loop splitting. If a loop contains a conditional statement that is
  6604. always true for one part of the iteration space and false for the
  6605. other this pass splits the loop into two, one dealing with one side
  6606. the other only with the other, thereby removing one inner-loop
  6607. conditional. The pass is implemented in 'tree-ssa-loop-split.c'.
  6608. The optimizations also use various utility functions contained in
  6609. 'tree-ssa-loop-manip.c', 'cfgloop.c', 'cfgloopanal.c' and
  6610. 'cfgloopmanip.c'.
  6611. Vectorization. This pass transforms loops to operate on vector
  6612. types instead of scalar types. Data parallelism across loop
  6613. iterations is exploited to group data elements from consecutive
  6614. iterations into a vector and operate on them in parallel.
  6615. Depending on available target support the loop is conceptually
  6616. unrolled by a factor 'VF' (vectorization factor), which is the
  6617. number of elements operated upon in parallel in each iteration, and
  6618. the 'VF' copies of each scalar operation are fused to form a vector
  6619. operation. Additional loop transformations such as peeling and
  6620. versioning may take place to align the number of iterations, and to
  6621. align the memory accesses in the loop. The pass is implemented in
  6622. 'tree-vectorizer.c' (the main driver), 'tree-vect-loop.c' and
  6623. 'tree-vect-loop-manip.c' (loop specific parts and general loop
  6624. utilities), 'tree-vect-slp' (loop-aware SLP functionality),
  6625. 'tree-vect-stmts.c' and 'tree-vect-data-refs.c'. Analysis of data
  6626. references is in 'tree-data-ref.c'.
  6627. SLP Vectorization. This pass performs vectorization of
  6628. straight-line code. The pass is implemented in 'tree-vectorizer.c'
  6629. (the main driver), 'tree-vect-slp.c', 'tree-vect-stmts.c' and
  6630. 'tree-vect-data-refs.c'.
  6631. Autoparallelization. This pass splits the loop iteration space to
  6632. run into several threads. The pass is implemented in
  6633. 'tree-parloops.c'.
  6634. Graphite is a loop transformation framework based on the polyhedral
  6635. model. Graphite stands for Gimple Represented as Polyhedra. The
  6636. internals of this infrastructure are documented in
  6637. <http://gcc.gnu.org/wiki/Graphite>. The passes working on this
  6638. representation are implemented in the various 'graphite-*' files.
  6639. * Tree level if-conversion for vectorizer
  6640. This pass applies if-conversion to simple loops to help vectorizer.
  6641. We identify if convertible loops, if-convert statements and merge
  6642. basic blocks in one big block. The idea is to present loop in such
  6643. form so that vectorizer can have one to one mapping between
  6644. statements and available vector operations. This pass is located
  6645. in 'tree-if-conv.c' and is described by 'pass_if_conversion'.
  6646. * Conditional constant propagation
  6647. This pass relaxes a lattice of values in order to identify those
  6648. that must be constant even in the presence of conditional branches.
  6649. The pass is located in 'tree-ssa-ccp.c' and is described by
  6650. 'pass_ccp'.
  6651. A related pass that works on memory loads and stores, and not just
  6652. register values, is located in 'tree-ssa-ccp.c' and described by
  6653. 'pass_store_ccp'.
  6654. * Conditional copy propagation
  6655. This is similar to constant propagation but the lattice of values
  6656. is the "copy-of" relation. It eliminates redundant copies from the
  6657. code. The pass is located in 'tree-ssa-copy.c' and described by
  6658. 'pass_copy_prop'.
  6659. A related pass that works on memory copies, and not just register
  6660. copies, is located in 'tree-ssa-copy.c' and described by
  6661. 'pass_store_copy_prop'.
  6662. * Value range propagation
  6663. This transformation is similar to constant propagation but instead
  6664. of propagating single constant values, it propagates known value
  6665. ranges. The implementation is based on Patterson's range
  6666. propagation algorithm (Accurate Static Branch Prediction by Value
  6667. Range Propagation, J. R. C. Patterson, PLDI '95). In contrast to
  6668. Patterson's algorithm, this implementation does not propagate
  6669. branch probabilities nor it uses more than a single range per SSA
  6670. name. This means that the current implementation cannot be used
  6671. for branch prediction (though adapting it would not be difficult).
  6672. The pass is located in 'tree-vrp.c' and is described by 'pass_vrp'.
  6673. * Folding built-in functions
  6674. This pass simplifies built-in functions, as applicable, with
  6675. constant arguments or with inferable string lengths. It is located
  6676. in 'tree-ssa-ccp.c' and is described by 'pass_fold_builtins'.
  6677. * Split critical edges
  6678. This pass identifies critical edges and inserts empty basic blocks
  6679. such that the edge is no longer critical. The pass is located in
  6680. 'tree-cfg.c' and is described by 'pass_split_crit_edges'.
  6681. * Control dependence dead code elimination
  6682. This pass is a stronger form of dead code elimination that can
  6683. eliminate unnecessary control flow statements. It is located in
  6684. 'tree-ssa-dce.c' and is described by 'pass_cd_dce'.
  6685. * Tail call elimination
  6686. This pass identifies function calls that may be rewritten into
  6687. jumps. No code transformation is actually applied here, but the
  6688. data and control flow problem is solved. The code transformation
  6689. requires target support, and so is delayed until RTL. In the
  6690. meantime 'CALL_EXPR_TAILCALL' is set indicating the possibility.
  6691. The pass is located in 'tree-tailcall.c' and is described by
  6692. 'pass_tail_calls'. The RTL transformation is handled by
  6693. 'fixup_tail_calls' in 'calls.c'.
  6694. * Warn for function return without value
  6695. For non-void functions, this pass locates return statements that do
  6696. not specify a value and issues a warning. Such a statement may
  6697. have been injected by falling off the end of the function. This
  6698. pass is run last so that we have as much time as possible to prove
  6699. that the statement is not reachable. It is located in 'tree-cfg.c'
  6700. and is described by 'pass_warn_function_return'.
  6701. * Leave static single assignment form
  6702. This pass rewrites the function such that it is in normal form. At
  6703. the same time, we eliminate as many single-use temporaries as
  6704. possible, so the intermediate language is no longer GIMPLE, but
  6705. GENERIC. The pass is located in 'tree-outof-ssa.c' and is
  6706. described by 'pass_del_ssa'.
  6707. * Merge PHI nodes that feed into one another
  6708. This is part of the CFG cleanup passes. It attempts to join PHI
  6709. nodes from a forwarder CFG block into another block with PHI nodes.
  6710. The pass is located in 'tree-cfgcleanup.c' and is described by
  6711. 'pass_merge_phi'.
  6712. * Return value optimization
  6713. If a function always returns the same local variable, and that
  6714. local variable is an aggregate type, then the variable is replaced
  6715. with the return value for the function (i.e., the function's
  6716. DECL_RESULT). This is equivalent to the C++ named return value
  6717. optimization applied to GIMPLE. The pass is located in
  6718. 'tree-nrv.c' and is described by 'pass_nrv'.
  6719. * Return slot optimization
  6720. If a function returns a memory object and is called as 'var =
  6721. foo()', this pass tries to change the call so that the address of
  6722. 'var' is sent to the caller to avoid an extra memory copy. This
  6723. pass is located in 'tree-nrv.c' and is described by
  6724. 'pass_return_slot'.
  6725. * Optimize calls to '__builtin_object_size'
  6726. This is a propagation pass similar to CCP that tries to remove
  6727. calls to '__builtin_object_size' when the size of the object can be
  6728. computed at compile-time. This pass is located in
  6729. 'tree-object-size.c' and is described by 'pass_object_sizes'.
  6730. * Loop invariant motion
  6731. This pass removes expensive loop-invariant computations out of
  6732. loops. The pass is located in 'tree-ssa-loop.c' and described by
  6733. 'pass_lim'.
  6734. * Loop nest optimizations
  6735. This is a family of loop transformations that works on loop nests.
  6736. It includes loop interchange, scaling, skewing and reversal and
  6737. they are all geared to the optimization of data locality in array
  6738. traversals and the removal of dependencies that hamper
  6739. optimizations such as loop parallelization and vectorization. The
  6740. pass is located in 'tree-loop-linear.c' and described by
  6741. 'pass_linear_transform'.
  6742. * Removal of empty loops
  6743. This pass removes loops with no code in them. The pass is located
  6744. in 'tree-ssa-loop-ivcanon.c' and described by 'pass_empty_loop'.
  6745. * Unrolling of small loops
  6746. This pass completely unrolls loops with few iterations. The pass
  6747. is located in 'tree-ssa-loop-ivcanon.c' and described by
  6748. 'pass_complete_unroll'.
  6749. * Predictive commoning
  6750. This pass makes the code reuse the computations from the previous
  6751. iterations of the loops, especially loads and stores to memory. It
  6752. does so by storing the values of these computations to a bank of
  6753. temporary variables that are rotated at the end of loop. To avoid
  6754. the need for this rotation, the loop is then unrolled and the
  6755. copies of the loop body are rewritten to use the appropriate
  6756. version of the temporary variable. This pass is located in
  6757. 'tree-predcom.c' and described by 'pass_predcom'.
  6758. * Array prefetching
  6759. This pass issues prefetch instructions for array references inside
  6760. loops. The pass is located in 'tree-ssa-loop-prefetch.c' and
  6761. described by 'pass_loop_prefetch'.
  6762. * Reassociation
  6763. This pass rewrites arithmetic expressions to enable optimizations
  6764. that operate on them, like redundancy elimination and
  6765. vectorization. The pass is located in 'tree-ssa-reassoc.c' and
  6766. described by 'pass_reassoc'.
  6767. * Optimization of 'stdarg' functions
  6768. This pass tries to avoid the saving of register arguments into the
  6769. stack on entry to 'stdarg' functions. If the function doesn't use
  6770. any 'va_start' macros, no registers need to be saved. If
  6771. 'va_start' macros are used, the 'va_list' variables don't escape
  6772. the function, it is only necessary to save registers that will be
  6773. used in 'va_arg' macros. For instance, if 'va_arg' is only used
  6774. with integral types in the function, floating point registers don't
  6775. need to be saved. This pass is located in 'tree-stdarg.c' and
  6776. described by 'pass_stdarg'.
  6777. 
  6778. File: gccint.info, Node: RTL passes, Next: Optimization info, Prev: Tree SSA passes, Up: Passes
  6779. 9.6 RTL passes
  6780. ==============
  6781. The following briefly describes the RTL generation and optimization
  6782. passes that are run after the Tree optimization passes.
  6783. * RTL generation
  6784. The source files for RTL generation include 'stmt.c', 'calls.c',
  6785. 'expr.c', 'explow.c', 'expmed.c', 'function.c', 'optabs.c' and
  6786. 'emit-rtl.c'. Also, the file 'insn-emit.c', generated from the
  6787. machine description by the program 'genemit', is used in this pass.
  6788. The header file 'expr.h' is used for communication within this
  6789. pass.
  6790. The header files 'insn-flags.h' and 'insn-codes.h', generated from
  6791. the machine description by the programs 'genflags' and 'gencodes',
  6792. tell this pass which standard names are available for use and which
  6793. patterns correspond to them.
  6794. * Generation of exception landing pads
  6795. This pass generates the glue that handles communication between the
  6796. exception handling library routines and the exception handlers
  6797. within the function. Entry points in the function that are invoked
  6798. by the exception handling library are called "landing pads". The
  6799. code for this pass is located in 'except.c'.
  6800. * Control flow graph cleanup
  6801. This pass removes unreachable code, simplifies jumps to next, jumps
  6802. to jump, jumps across jumps, etc. The pass is run multiple times.
  6803. For historical reasons, it is occasionally referred to as the "jump
  6804. optimization pass". The bulk of the code for this pass is in
  6805. 'cfgcleanup.c', and there are support routines in 'cfgrtl.c' and
  6806. 'jump.c'.
  6807. * Forward propagation of single-def values
  6808. This pass attempts to remove redundant computation by substituting
  6809. variables that come from a single definition, and seeing if the
  6810. result can be simplified. It performs copy propagation and
  6811. addressing mode selection. The pass is run twice, with values
  6812. being propagated into loops only on the second run. The code is
  6813. located in 'fwprop.c'.
  6814. * Common subexpression elimination
  6815. This pass removes redundant computation within basic blocks, and
  6816. optimizes addressing modes based on cost. The pass is run twice.
  6817. The code for this pass is located in 'cse.c'.
  6818. * Global common subexpression elimination
  6819. This pass performs two different types of GCSE depending on whether
  6820. you are optimizing for size or not (LCM based GCSE tends to
  6821. increase code size for a gain in speed, while Morel-Renvoise based
  6822. GCSE does not). When optimizing for size, GCSE is done using
  6823. Morel-Renvoise Partial Redundancy Elimination, with the exception
  6824. that it does not try to move invariants out of loops--that is left
  6825. to the loop optimization pass. If MR PRE GCSE is done, code
  6826. hoisting (aka unification) is also done, as well as load motion.
  6827. If you are optimizing for speed, LCM (lazy code motion) based GCSE
  6828. is done. LCM is based on the work of Knoop, Ruthing, and Steffen.
  6829. LCM based GCSE also does loop invariant code motion. We also
  6830. perform load and store motion when optimizing for speed.
  6831. Regardless of which type of GCSE is used, the GCSE pass also
  6832. performs global constant and copy propagation. The source file for
  6833. this pass is 'gcse.c', and the LCM routines are in 'lcm.c'.
  6834. * Loop optimization
  6835. This pass performs several loop related optimizations. The source
  6836. files 'cfgloopanal.c' and 'cfgloopmanip.c' contain generic loop
  6837. analysis and manipulation code. Initialization and finalization of
  6838. loop structures is handled by 'loop-init.c'. A loop invariant
  6839. motion pass is implemented in 'loop-invariant.c'. Basic block
  6840. level optimizations--unrolling, and peeling loops-- are implemented
  6841. in 'loop-unroll.c'. Replacing of the exit condition of loops by
  6842. special machine-dependent instructions is handled by
  6843. 'loop-doloop.c'.
  6844. * Jump bypassing
  6845. This pass is an aggressive form of GCSE that transforms the control
  6846. flow graph of a function by propagating constants into conditional
  6847. branch instructions. The source file for this pass is 'gcse.c'.
  6848. * If conversion
  6849. This pass attempts to replace conditional branches and surrounding
  6850. assignments with arithmetic, boolean value producing comparison
  6851. instructions, and conditional move instructions. In the very last
  6852. invocation after reload/LRA, it will generate predicated
  6853. instructions when supported by the target. The code is located in
  6854. 'ifcvt.c'.
  6855. * Web construction
  6856. This pass splits independent uses of each pseudo-register. This
  6857. can improve effect of the other transformation, such as CSE or
  6858. register allocation. The code for this pass is located in 'web.c'.
  6859. * Instruction combination
  6860. This pass attempts to combine groups of two or three instructions
  6861. that are related by data flow into single instructions. It
  6862. combines the RTL expressions for the instructions by substitution,
  6863. simplifies the result using algebra, and then attempts to match the
  6864. result against the machine description. The code is located in
  6865. 'combine.c'.
  6866. * Mode switching optimization
  6867. This pass looks for instructions that require the processor to be
  6868. in a specific "mode" and minimizes the number of mode changes
  6869. required to satisfy all users. What these modes are, and what they
  6870. apply to are completely target-specific. The code for this pass is
  6871. located in 'mode-switching.c'.
  6872. * Modulo scheduling
  6873. This pass looks at innermost loops and reorders their instructions
  6874. by overlapping different iterations. Modulo scheduling is
  6875. performed immediately before instruction scheduling. The code for
  6876. this pass is located in 'modulo-sched.c'.
  6877. * Instruction scheduling
  6878. This pass looks for instructions whose output will not be available
  6879. by the time that it is used in subsequent instructions. Memory
  6880. loads and floating point instructions often have this behavior on
  6881. RISC machines. It re-orders instructions within a basic block to
  6882. try to separate the definition and use of items that otherwise
  6883. would cause pipeline stalls. This pass is performed twice, before
  6884. and after register allocation. The code for this pass is located
  6885. in 'haifa-sched.c', 'sched-deps.c', 'sched-ebb.c', 'sched-rgn.c'
  6886. and 'sched-vis.c'.
  6887. * Register allocation
  6888. These passes make sure that all occurrences of pseudo registers are
  6889. eliminated, either by allocating them to a hard register, replacing
  6890. them by an equivalent expression (e.g. a constant) or by placing
  6891. them on the stack. This is done in several subpasses:
  6892. * The integrated register allocator (IRA). It is called
  6893. integrated because coalescing, register live range splitting,
  6894. and hard register preferencing are done on-the-fly during
  6895. coloring. It also has better integration with the reload/LRA
  6896. pass. Pseudo-registers spilled by the allocator or the
  6897. reload/LRA have still a chance to get hard-registers if the
  6898. reload/LRA evicts some pseudo-registers from hard-registers.
  6899. The allocator helps to choose better pseudos for spilling
  6900. based on their live ranges and to coalesce stack slots
  6901. allocated for the spilled pseudo-registers. IRA is a regional
  6902. register allocator which is transformed into Chaitin-Briggs
  6903. allocator if there is one region. By default, IRA chooses
  6904. regions using register pressure but the user can force it to
  6905. use one region or regions corresponding to all loops.
  6906. Source files of the allocator are 'ira.c', 'ira-build.c',
  6907. 'ira-costs.c', 'ira-conflicts.c', 'ira-color.c', 'ira-emit.c',
  6908. 'ira-lives', plus header files 'ira.h' and 'ira-int.h' used
  6909. for the communication between the allocator and the rest of
  6910. the compiler and between the IRA files.
  6911. * Reloading. This pass renumbers pseudo registers with the
  6912. hardware registers numbers they were allocated. Pseudo
  6913. registers that did not get hard registers are replaced with
  6914. stack slots. Then it finds instructions that are invalid
  6915. because a value has failed to end up in a register, or has
  6916. ended up in a register of the wrong kind. It fixes up these
  6917. instructions by reloading the problematical values temporarily
  6918. into registers. Additional instructions are generated to do
  6919. the copying.
  6920. The reload pass also optionally eliminates the frame pointer
  6921. and inserts instructions to save and restore call-clobbered
  6922. registers around calls.
  6923. Source files are 'reload.c' and 'reload1.c', plus the header
  6924. 'reload.h' used for communication between them.
  6925. * This pass is a modern replacement of the reload pass. Source
  6926. files are 'lra.c', 'lra-assign.c', 'lra-coalesce.c',
  6927. 'lra-constraints.c', 'lra-eliminations.c', 'lra-lives.c',
  6928. 'lra-remat.c', 'lra-spills.c', the header 'lra-int.h' used for
  6929. communication between them, and the header 'lra.h' used for
  6930. communication between LRA and the rest of compiler.
  6931. Unlike the reload pass, intermediate LRA decisions are
  6932. reflected in RTL as much as possible. This reduces the number
  6933. of target-dependent macros and hooks, leaving instruction
  6934. constraints as the primary source of control.
  6935. LRA is run on targets for which TARGET_LRA_P returns true.
  6936. * Basic block reordering
  6937. This pass implements profile guided code positioning. If profile
  6938. information is not available, various types of static analysis are
  6939. performed to make the predictions normally coming from the profile
  6940. feedback (IE execution frequency, branch probability, etc). It is
  6941. implemented in the file 'bb-reorder.c', and the various prediction
  6942. routines are in 'predict.c'.
  6943. * Variable tracking
  6944. This pass computes where the variables are stored at each position
  6945. in code and generates notes describing the variable locations to
  6946. RTL code. The location lists are then generated according to these
  6947. notes to debug information if the debugging information format
  6948. supports location lists. The code is located in 'var-tracking.c'.
  6949. * Delayed branch scheduling
  6950. This optional pass attempts to find instructions that can go into
  6951. the delay slots of other instructions, usually jumps and calls.
  6952. The code for this pass is located in 'reorg.c'.
  6953. * Branch shortening
  6954. On many RISC machines, branch instructions have a limited range.
  6955. Thus, longer sequences of instructions must be used for long
  6956. branches. In this pass, the compiler figures out what how far each
  6957. instruction will be from each other instruction, and therefore
  6958. whether the usual instructions, or the longer sequences, must be
  6959. used for each branch. The code for this pass is located in
  6960. 'final.c'.
  6961. * Register-to-stack conversion
  6962. Conversion from usage of some hard registers to usage of a register
  6963. stack may be done at this point. Currently, this is supported only
  6964. for the floating-point registers of the Intel 80387 coprocessor.
  6965. The code for this pass is located in 'reg-stack.c'.
  6966. * Final
  6967. This pass outputs the assembler code for the function. The source
  6968. files are 'final.c' plus 'insn-output.c'; the latter is generated
  6969. automatically from the machine description by the tool 'genoutput'.
  6970. The header file 'conditions.h' is used for communication between
  6971. these files.
  6972. * Debugging information output
  6973. This is run after final because it must output the stack slot
  6974. offsets for pseudo registers that did not get hard registers.
  6975. Source files are 'dbxout.c' for DBX symbol table format,
  6976. 'dwarfout.c' for DWARF symbol table format, files 'dwarf2out.c' and
  6977. 'dwarf2asm.c' for DWARF2 symbol table format, and 'vmsdbgout.c' for
  6978. VMS debug symbol table format.
  6979. 
  6980. File: gccint.info, Node: Optimization info, Prev: RTL passes, Up: Passes
  6981. 9.7 Optimization info
  6982. =====================
  6983. This section is describes dump infrastructure which is common to both
  6984. pass dumps as well as optimization dumps. The goal for this
  6985. infrastructure is to provide both gcc developers and users detailed
  6986. information about various compiler transformations and optimizations.
  6987. * Menu:
  6988. * Dump setup:: Setup of optimization dumps.
  6989. * Optimization groups:: Groups made up of optimization passes.
  6990. * Dump files and streams:: Dump output file names and streams.
  6991. * Dump output verbosity:: How much information to dump.
  6992. * Dump types:: Various types of dump functions.
  6993. * Dump examples:: Sample usage.
  6994. 
  6995. File: gccint.info, Node: Dump setup, Next: Optimization groups, Up: Optimization info
  6996. 9.7.1 Dump setup
  6997. ----------------
  6998. A dump_manager class is defined in 'dumpfile.h'. Various passes
  6999. register dumping pass-specific information via 'dump_register' in
  7000. 'passes.c'. During the registration, an optimization pass can select
  7001. its optimization group (*note Optimization groups::). After that
  7002. optimization information corresponding to the entire group (presumably
  7003. from multiple passes) can be output via command-line switches. Note
  7004. that if a pass does not fit into any of the pre-defined groups, it can
  7005. select 'OPTGROUP_NONE'.
  7006. Note that in general, a pass need not know its dump output file name,
  7007. whether certain flags are enabled, etc. However, for legacy reasons,
  7008. passes could also call 'dump_begin' which returns a stream in case the
  7009. particular pass has optimization dumps enabled. A pass could call
  7010. 'dump_end' when the dump has ended. These methods should go away once
  7011. all the passes are converted to use the new dump infrastructure.
  7012. The recommended way to setup the dump output is via 'dump_start' and
  7013. 'dump_end'.
  7014. 
  7015. File: gccint.info, Node: Optimization groups, Next: Dump files and streams, Prev: Dump setup, Up: Optimization info
  7016. 9.7.2 Optimization groups
  7017. -------------------------
  7018. The optimization passes are grouped into several categories. Currently
  7019. defined categories in 'dumpfile.h' are
  7020. 'OPTGROUP_IPA'
  7021. IPA optimization passes. Enabled by '-ipa'
  7022. 'OPTGROUP_LOOP'
  7023. Loop optimization passes. Enabled by '-loop'.
  7024. 'OPTGROUP_INLINE'
  7025. Inlining passes. Enabled by '-inline'.
  7026. 'OPTGROUP_OMP'
  7027. OMP (Offloading and Multi Processing) passes. Enabled by '-omp'.
  7028. 'OPTGROUP_VEC'
  7029. Vectorization passes. Enabled by '-vec'.
  7030. 'OPTGROUP_OTHER'
  7031. All other optimization passes which do not fall into one of the
  7032. above.
  7033. 'OPTGROUP_ALL'
  7034. All optimization passes. Enabled by '-optall'.
  7035. By using groups a user could selectively enable optimization
  7036. information only for a group of passes. By default, the optimization
  7037. information for all the passes is dumped.
  7038. 
  7039. File: gccint.info, Node: Dump files and streams, Next: Dump output verbosity, Prev: Optimization groups, Up: Optimization info
  7040. 9.7.3 Dump files and streams
  7041. ----------------------------
  7042. There are two separate output streams available for outputting
  7043. optimization information from passes. Note that both these streams
  7044. accept 'stderr' and 'stdout' as valid streams and thus it is possible to
  7045. dump output to standard output or error. This is specially handy for
  7046. outputting all available information in a single file by redirecting
  7047. 'stderr'.
  7048. 'pstream'
  7049. This stream is for pass-specific dump output. For example,
  7050. '-fdump-tree-vect=foo.v' dumps tree vectorization pass output into
  7051. the given file name 'foo.v'. If the file name is not provided, the
  7052. default file name is based on the source file and pass number.
  7053. Note that one could also use special file names 'stdout' and
  7054. 'stderr' for dumping to standard output and standard error
  7055. respectively.
  7056. 'alt_stream'
  7057. This steam is used for printing optimization specific output in
  7058. response to the '-fopt-info'. Again a file name can be given. If
  7059. the file name is not given, it defaults to 'stderr'.
  7060. 
  7061. File: gccint.info, Node: Dump output verbosity, Next: Dump types, Prev: Dump files and streams, Up: Optimization info
  7062. 9.7.4 Dump output verbosity
  7063. ---------------------------
  7064. The dump verbosity has the following options
  7065. 'optimized'
  7066. Print information when an optimization is successfully applied. It
  7067. is up to a pass to decide which information is relevant. For
  7068. example, the vectorizer passes print the source location of loops
  7069. which got successfully vectorized.
  7070. 'missed'
  7071. Print information about missed optimizations. Individual passes
  7072. control which information to include in the output. For example,
  7073. gcc -O2 -ftree-vectorize -fopt-info-vec-missed
  7074. will print information about missed optimization opportunities from
  7075. vectorization passes on stderr.
  7076. 'note'
  7077. Print verbose information about optimizations, such as certain
  7078. transformations, more detailed messages about decisions etc.
  7079. 'all'
  7080. Print detailed optimization information. This includes OPTIMIZED,
  7081. MISSED, and NOTE.
  7082. 
  7083. File: gccint.info, Node: Dump types, Next: Dump examples, Prev: Dump output verbosity, Up: Optimization info
  7084. 9.7.5 Dump types
  7085. ----------------
  7086. 'dump_printf'
  7087. This is a generic method for doing formatted output. It takes an
  7088. additional argument 'dump_kind' which signifies the type of dump.
  7089. This method outputs information only when the dumps are enabled for
  7090. this particular 'dump_kind'. Note that the caller doesn't need to
  7091. know if the particular dump is enabled or not, or even the file
  7092. name. The caller only needs to decide which dump output
  7093. information is relevant, and under what conditions. This
  7094. determines the associated flags.
  7095. Consider the following example from 'loop-unroll.c' where an
  7096. informative message about a loop (along with its location) is
  7097. printed when any of the following flags is enabled
  7098. - optimization messages
  7099. - RTL dumps
  7100. - detailed dumps
  7101. int report_flags = MSG_OPTIMIZED_LOCATIONS | TDF_RTL | TDF_DETAILS;
  7102. dump_printf_loc (report_flags, insn,
  7103. "loop turned into non-loop; it never loops.\n");
  7104. 'dump_basic_block'
  7105. Output basic block.
  7106. 'dump_generic_expr'
  7107. Output generic expression.
  7108. 'dump_gimple_stmt'
  7109. Output gimple statement.
  7110. Note that the above methods also have variants prefixed with
  7111. '_loc', such as 'dump_printf_loc', which are similar except they
  7112. also output the source location information. The '_loc' variants
  7113. take a 'const dump_location_t &'. This class can be constructed
  7114. from a 'gimple *' or from a 'rtx_insn *', and so callers can pass a
  7115. 'gimple *' or a 'rtx_insn *' as the '_loc' argument. The
  7116. 'dump_location_t' constructor will extract the source location from
  7117. the statement or instruction, along with the profile count, and the
  7118. location in GCC's own source code (or the plugin) from which the
  7119. dump call was emitted. Only the source location is currently used.
  7120. There is also a 'dump_user_location_t' class, capturing the source
  7121. location and profile count, but not the dump emission location, so
  7122. that locations in the user's code can be passed around. This can
  7123. also be constructed from a 'gimple *' and from a 'rtx_insn *', and
  7124. it too can be passed as the '_loc' argument.
  7125. 
  7126. File: gccint.info, Node: Dump examples, Prev: Dump types, Up: Optimization info
  7127. 9.7.6 Dump examples
  7128. -------------------
  7129. gcc -O3 -fopt-info-missed=missed.all
  7130. outputs missed optimization report from all the passes into
  7131. 'missed.all'.
  7132. As another example,
  7133. gcc -O3 -fopt-info-inline-optimized-missed=inline.txt
  7134. will output information about missed optimizations as well as optimized
  7135. locations from all the inlining passes into 'inline.txt'.
  7136. If the FILENAME is provided, then the dumps from all the applicable
  7137. optimizations are concatenated into the 'filename'. Otherwise the dump
  7138. is output onto 'stderr'. If OPTIONS is omitted, it defaults to
  7139. 'optimized-optall', which means dump all information about successful
  7140. optimizations from all the passes. In the following example, the
  7141. optimization information is output on to 'stderr'.
  7142. gcc -O3 -fopt-info
  7143. Note that '-fopt-info-vec-missed' behaves the same as
  7144. '-fopt-info-missed-vec'. The order of the optimization group names and
  7145. message types listed after '-fopt-info' does not matter.
  7146. As another example, consider
  7147. gcc -fopt-info-vec-missed=vec.miss -fopt-info-loop-optimized=loop.opt
  7148. Here the two output file names 'vec.miss' and 'loop.opt' are in
  7149. conflict since only one output file is allowed. In this case, only the
  7150. first option takes effect and the subsequent options are ignored. Thus
  7151. only the 'vec.miss' is produced which containts dumps from the
  7152. vectorizer about missed opportunities.
  7153. 
  7154. File: gccint.info, Node: poly_int, Next: GENERIC, Prev: Passes, Up: Top
  7155. 10 Sizes and offsets as runtime invariants
  7156. ******************************************
  7157. GCC allows the size of a hardware register to be a runtime invariant
  7158. rather than a compile-time constant. This in turn means that various
  7159. sizes and offsets must also be runtime invariants rather than
  7160. compile-time constants, such as:
  7161. * the size of a general 'machine_mode' (*note Machine Modes::);
  7162. * the size of a spill slot;
  7163. * the offset of something within a stack frame;
  7164. * the number of elements in a vector;
  7165. * the size and offset of a 'mem' rtx (*note Regs and Memory::); and
  7166. * the byte offset in a 'subreg' rtx (*note Regs and Memory::).
  7167. The motivating example is the Arm SVE ISA, whose vector registers can
  7168. be any multiple of 128 bits between 128 and 2048 inclusive. The
  7169. compiler normally produces code that works for all SVE register sizes,
  7170. with the actual size only being known at runtime.
  7171. GCC's main representation of such runtime invariants is the 'poly_int'
  7172. class. This chapter describes what 'poly_int' does, lists the available
  7173. operations, and gives some general usage guidelines.
  7174. * Menu:
  7175. * Overview of poly_int::
  7176. * Consequences of using poly_int::
  7177. * Comparisons involving poly_int::
  7178. * Arithmetic on poly_ints::
  7179. * Alignment of poly_ints::
  7180. * Computing bounds on poly_ints::
  7181. * Converting poly_ints::
  7182. * Miscellaneous poly_int routines::
  7183. * Guidelines for using poly_int::
  7184. 
  7185. File: gccint.info, Node: Overview of poly_int, Next: Consequences of using poly_int, Up: poly_int
  7186. 10.1 Overview of 'poly_int'
  7187. ===========================
  7188. We define indeterminates X1, ..., XN whose values are only known at
  7189. runtime and use polynomials of the form:
  7190. C0 + C1 * X1 + ... + CN * XN
  7191. to represent a size or offset whose value might depend on some of these
  7192. indeterminates. The coefficients C0, ..., CN are always known at
  7193. compile time, with the C0 term being the "constant" part that does not
  7194. depend on any runtime value.
  7195. GCC uses the 'poly_int' class to represent these coefficients. The
  7196. class has two template parameters: the first specifies the number of
  7197. coefficients (N + 1) and the second specifies the type of the
  7198. coefficients. For example, 'poly_int<2, unsigned short>' represents a
  7199. polynomial with two coefficients (and thus one indeterminate), with each
  7200. coefficient having type 'unsigned short'. When N is 0, the class
  7201. degenerates to a single compile-time constant C0.
  7202. The number of coefficients needed for compilation is a fixed property
  7203. of each target and is specified by the configuration macro
  7204. 'NUM_POLY_INT_COEFFS'. The default value is 1, since most targets do
  7205. not have such runtime invariants. Targets that need a different value
  7206. should '#define' the macro in their 'CPU-modes.def' file. *Note Back
  7207. End::.
  7208. 'poly_int' makes the simplifying requirement that each indeterminate
  7209. must be a nonnegative integer. An indeterminate value of 0 should
  7210. usually represent the minimum possible runtime value, with C0 specifying
  7211. the value in that case.
  7212. For example, when targetting the Arm SVE ISA, the single indeterminate
  7213. represents the number of 128-bit blocks in a vector _beyond the minimum
  7214. length of 128 bits_. Thus the number of 64-bit doublewords in a vector
  7215. is 2 + 2 * X1. If an aggregate has a single SVE vector and 16
  7216. additional bytes, its total size is 32 + 16 * X1 bytes.
  7217. The header file 'poly-int-types.h' provides typedefs for the most
  7218. common forms of 'poly_int', all having 'NUM_POLY_INT_COEFFS'
  7219. coefficients:
  7220. 'poly_uint16'
  7221. a 'poly_int' with 'unsigned short' coefficients.
  7222. 'poly_int64'
  7223. a 'poly_int' with 'HOST_WIDE_INT' coefficients.
  7224. 'poly_uint64'
  7225. a 'poly_int' with 'unsigned HOST_WIDE_INT' coefficients.
  7226. 'poly_offset_int'
  7227. a 'poly_int' with 'offset_int' coefficients.
  7228. 'poly_wide_int'
  7229. a 'poly_int' with 'wide_int' coefficients.
  7230. 'poly_widest_int'
  7231. a 'poly_int' with 'widest_int' coefficients.
  7232. Since the main purpose of 'poly_int' is to represent sizes and offsets,
  7233. the last two typedefs are only rarely used.
  7234. 
  7235. File: gccint.info, Node: Consequences of using poly_int, Next: Comparisons involving poly_int, Prev: Overview of poly_int, Up: poly_int
  7236. 10.2 Consequences of using 'poly_int'
  7237. =====================================
  7238. The two main consequences of using polynomial sizes and offsets are
  7239. that:
  7240. * there is no total ordering between the values at compile time, and
  7241. * some operations might yield results that cannot be expressed as a
  7242. 'poly_int'.
  7243. For example, if X is a runtime invariant, we cannot tell at compile
  7244. time whether:
  7245. 3 + 4X <= 1 + 5X
  7246. since the condition is false when X <= 1 and true when X >= 2.
  7247. Similarly, 'poly_int' cannot represent the result of:
  7248. (3 + 4X) * (1 + 5X)
  7249. since it cannot (and in practice does not need to) store powers greater
  7250. than one. It also cannot represent the result of:
  7251. (3 + 4X) / (1 + 5X)
  7252. The following sections describe how we deal with these restrictions.
  7253. As described earlier, a 'poly_int<1, T>' has no indeterminates and so
  7254. degenerates to a compile-time constant of type T. It would be possible
  7255. in that case to do all normal arithmetic on the T, and to compare the T
  7256. using the normal C++ operators. We deliberately prevent
  7257. target-independent code from doing this, since the compiler needs to
  7258. support other 'poly_int<N, T>' as well, regardless of the current
  7259. target's 'NUM_POLY_INT_COEFFS'.
  7260. However, it would be very artificial to force target-specific code to
  7261. follow these restrictions if the target has no runtime indeterminates.
  7262. There is therefore an implicit conversion from 'poly_int<1, T>' to T
  7263. when compiling target-specific translation units.
  7264. 
  7265. File: gccint.info, Node: Comparisons involving poly_int, Next: Arithmetic on poly_ints, Prev: Consequences of using poly_int, Up: poly_int
  7266. 10.3 Comparisons involving 'poly_int'
  7267. =====================================
  7268. In general we need to compare sizes and offsets in two situations: those
  7269. in which the values need to be ordered, and those in which the values
  7270. can be unordered. More loosely, the distinction is often between values
  7271. that have a definite link (usually because they refer to the same
  7272. underlying register or memory location) and values that have no definite
  7273. link. An example of the former is the relationship between the inner
  7274. and outer sizes of a subreg, where we must know at compile time whether
  7275. the subreg is paradoxical, partial, or complete. An example of the
  7276. latter is alias analysis: we might want to check whether two arbitrary
  7277. memory references overlap.
  7278. Referring back to the examples in the previous section, it makes sense
  7279. to ask whether a memory reference of size '3 + 4X' overlaps one of size
  7280. '1 + 5X', but it does not make sense to have a subreg in which the outer
  7281. mode has '3 + 4X' bytes and the inner mode has '1 + 5X' bytes (or vice
  7282. versa). Such subregs are always invalid and should trigger an internal
  7283. compiler error if formed.
  7284. The underlying operators are the same in both cases, but the
  7285. distinction affects how they are used.
  7286. * Menu:
  7287. * Comparison functions for poly_int::
  7288. * Properties of the poly_int comparisons::
  7289. * Comparing potentially-unordered poly_ints::
  7290. * Comparing ordered poly_ints::
  7291. * Checking for a poly_int marker value::
  7292. * Range checks on poly_ints::
  7293. * Sorting poly_ints::
  7294. 
  7295. File: gccint.info, Node: Comparison functions for poly_int, Next: Properties of the poly_int comparisons, Up: Comparisons involving poly_int
  7296. 10.3.1 Comparison functions for 'poly_int'
  7297. ------------------------------------------
  7298. 'poly_int' provides the following routines for checking whether a
  7299. particular condition "may be" (might be) true:
  7300. maybe_lt maybe_le maybe_eq maybe_ge maybe_gt
  7301. maybe_ne
  7302. The functions have their natural meaning:
  7303. 'maybe_lt(A, B)'
  7304. Return true if A might be less than B.
  7305. 'maybe_le(A, B)'
  7306. Return true if A might be less than or equal to B.
  7307. 'maybe_eq(A, B)'
  7308. Return true if A might be equal to B.
  7309. 'maybe_ne(A, B)'
  7310. Return true if A might not be equal to B.
  7311. 'maybe_ge(A, B)'
  7312. Return true if A might be greater than or equal to B.
  7313. 'maybe_gt(A, B)'
  7314. Return true if A might be greater than B.
  7315. For readability, 'poly_int' also provides "known" inverses of these
  7316. functions:
  7317. known_lt (A, B) == !maybe_ge (A, B)
  7318. known_le (A, B) == !maybe_gt (A, B)
  7319. known_eq (A, B) == !maybe_ne (A, B)
  7320. known_ge (A, B) == !maybe_lt (A, B)
  7321. known_gt (A, B) == !maybe_le (A, B)
  7322. known_ne (A, B) == !maybe_eq (A, B)
  7323. 
  7324. File: gccint.info, Node: Properties of the poly_int comparisons, Next: Comparing potentially-unordered poly_ints, Prev: Comparison functions for poly_int, Up: Comparisons involving poly_int
  7325. 10.3.2 Properties of the 'poly_int' comparisons
  7326. -----------------------------------------------
  7327. All "maybe" relations except 'maybe_ne' are transitive, so for example:
  7328. maybe_lt (A, B) && maybe_lt (B, C) implies maybe_lt (A, C)
  7329. for all A, B and C. 'maybe_lt', 'maybe_gt' and 'maybe_ne' are
  7330. irreflexive, so for example:
  7331. !maybe_lt (A, A)
  7332. is true for all A. 'maybe_le', 'maybe_eq' and 'maybe_ge' are
  7333. reflexive, so for example:
  7334. maybe_le (A, A)
  7335. is true for all A. 'maybe_eq' and 'maybe_ne' are symmetric, so:
  7336. maybe_eq (A, B) == maybe_eq (B, A)
  7337. maybe_ne (A, B) == maybe_ne (B, A)
  7338. for all A and B. In addition:
  7339. maybe_le (A, B) == maybe_lt (A, B) || maybe_eq (A, B)
  7340. maybe_ge (A, B) == maybe_gt (A, B) || maybe_eq (A, B)
  7341. maybe_lt (A, B) == maybe_gt (B, A)
  7342. maybe_le (A, B) == maybe_ge (B, A)
  7343. However:
  7344. maybe_le (A, B) && maybe_le (B, A) does not imply !maybe_ne (A, B) [== known_eq (A, B)]
  7345. maybe_ge (A, B) && maybe_ge (B, A) does not imply !maybe_ne (A, B) [== known_eq (A, B)]
  7346. One example is again 'A == 3 + 4X' and 'B == 1 + 5X', where 'maybe_le
  7347. (A, B)', 'maybe_ge (A, B)' and 'maybe_ne (A, B)' all hold. 'maybe_le'
  7348. and 'maybe_ge' are therefore not antisymetric and do not form a partial
  7349. order.
  7350. From the above, it follows that:
  7351. * All "known" relations except 'known_ne' are transitive.
  7352. * 'known_lt', 'known_ne' and 'known_gt' are irreflexive.
  7353. * 'known_le', 'known_eq' and 'known_ge' are reflexive.
  7354. Also:
  7355. known_lt (A, B) == known_gt (B, A)
  7356. known_le (A, B) == known_ge (B, A)
  7357. known_lt (A, B) implies !known_lt (B, A) [asymmetry]
  7358. known_gt (A, B) implies !known_gt (B, A)
  7359. known_le (A, B) && known_le (B, A) == known_eq (A, B) [== !maybe_ne (A, B)]
  7360. known_ge (A, B) && known_ge (B, A) == known_eq (A, B) [== !maybe_ne (A, B)]
  7361. 'known_le' and 'known_ge' are therefore antisymmetric and are partial
  7362. orders. However:
  7363. known_le (A, B) does not imply known_lt (A, B) || known_eq (A, B)
  7364. known_ge (A, B) does not imply known_gt (A, B) || known_eq (A, B)
  7365. For example, 'known_le (4, 4 + 4X)' holds because the runtime
  7366. indeterminate X is a nonnegative integer, but neither 'known_lt (4, 4 +
  7367. 4X)' nor 'known_eq (4, 4 + 4X)' hold.
  7368. 
  7369. File: gccint.info, Node: Comparing potentially-unordered poly_ints, Next: Comparing ordered poly_ints, Prev: Properties of the poly_int comparisons, Up: Comparisons involving poly_int
  7370. 10.3.3 Comparing potentially-unordered 'poly_int's
  7371. --------------------------------------------------
  7372. In cases where there is no definite link between two 'poly_int's, we can
  7373. usually make a conservatively-correct assumption. For example, the
  7374. conservative assumption for alias analysis is that two references
  7375. _might_ alias.
  7376. One way of checking whether [BEGIN1, END1) might overlap [BEGIN2, END2)
  7377. using the 'poly_int' comparisons is:
  7378. maybe_gt (END1, BEGIN2) && maybe_gt (END2, BEGIN1)
  7379. and another (equivalent) way is:
  7380. !(known_le (END1, BEGIN2) || known_le (END2, BEGIN1))
  7381. However, in this particular example, it is better to use the range
  7382. helper functions instead. *Note Range checks on poly_ints::.
  7383. 
  7384. File: gccint.info, Node: Comparing ordered poly_ints, Next: Checking for a poly_int marker value, Prev: Comparing potentially-unordered poly_ints, Up: Comparisons involving poly_int
  7385. 10.3.4 Comparing ordered 'poly_int's
  7386. ------------------------------------
  7387. In cases where there is a definite link between two 'poly_int's, such as
  7388. the outer and inner sizes of subregs, we usually require the sizes to be
  7389. ordered by the 'known_le' partial order. 'poly_int' provides the
  7390. following utility functions for ordered values:
  7391. 'ordered_p (A, B)'
  7392. Return true if A and B are ordered by the 'known_le' partial order.
  7393. 'ordered_min (A, B)'
  7394. Assert that A and B are ordered by 'known_le' and return the
  7395. minimum of the two. When using this function, please add a comment
  7396. explaining why the values are known to be ordered.
  7397. 'ordered_max (A, B)'
  7398. Assert that A and B are ordered by 'known_le' and return the
  7399. maximum of the two. When using this function, please add a comment
  7400. explaining why the values are known to be ordered.
  7401. For example, if a subreg has an outer mode of size OUTER and an inner
  7402. mode of size INNER:
  7403. * the subreg is complete if known_eq (INNER, OUTER)
  7404. * otherwise, the subreg is paradoxical if known_le (INNER, OUTER)
  7405. * otherwise, the subreg is partial if known_le (OUTER, INNER)
  7406. * otherwise, the subreg is ill-formed
  7407. Thus the subreg is only valid if 'ordered_p (OUTER, INNER)' is true.
  7408. If this condition is already known to be true then:
  7409. * the subreg is complete if known_eq (INNER, OUTER)
  7410. * the subreg is paradoxical if maybe_lt (INNER, OUTER)
  7411. * the subreg is partial if maybe_lt (OUTER, INNER)
  7412. with the three conditions being mutually exclusive.
  7413. Code that checks whether a subreg is valid would therefore generally
  7414. check whether 'ordered_p' holds (in addition to whatever other checks
  7415. are required for subreg validity). Code that is dealing with existing
  7416. subregs can assert that 'ordered_p' holds and use either of the
  7417. classifications above.
  7418. 
  7419. File: gccint.info, Node: Checking for a poly_int marker value, Next: Range checks on poly_ints, Prev: Comparing ordered poly_ints, Up: Comparisons involving poly_int
  7420. 10.3.5 Checking for a 'poly_int' marker value
  7421. ---------------------------------------------
  7422. It is sometimes useful to have a special "marker value" that is not
  7423. meant to be taken literally. For example, some code uses a size of -1
  7424. to represent an unknown size, rather than having to carry around a
  7425. separate boolean to say whether the size is known.
  7426. The best way of checking whether something is a marker value is
  7427. 'known_eq'. Conversely the best way of checking whether something is
  7428. _not_ a marker value is 'maybe_ne'.
  7429. Thus in the size example just mentioned, 'known_eq (size, -1)' would
  7430. check for an unknown size and 'maybe_ne (size, -1)' would check for a
  7431. known size.
  7432. 
  7433. File: gccint.info, Node: Range checks on poly_ints, Next: Sorting poly_ints, Prev: Checking for a poly_int marker value, Up: Comparisons involving poly_int
  7434. 10.3.6 Range checks on 'poly_int's
  7435. ----------------------------------
  7436. As well as the core comparisons (*note Comparison functions for
  7437. poly_int::), 'poly_int' provides utilities for various kinds of range
  7438. check. In each case the range is represented by a start position and a
  7439. size rather than a start position and an end position; this is because
  7440. the former is used much more often than the latter in GCC. Also, the
  7441. sizes can be -1 (or all ones for unsigned sizes) to indicate a range
  7442. with a known start position but an unknown size. All other sizes must
  7443. be nonnegative. A range of size 0 does not contain anything or overlap
  7444. anything.
  7445. 'known_size_p (SIZE)'
  7446. Return true if SIZE represents a known range size, false if it is
  7447. -1 or all ones (for signed and unsigned types respectively).
  7448. 'ranges_maybe_overlap_p (POS1, SIZE1, POS2, SIZE2)'
  7449. Return true if the range described by POS1 and SIZE1 _might_
  7450. overlap the range described by POS2 and SIZE2 (in other words,
  7451. return true if we cannot prove that the ranges are disjoint).
  7452. 'ranges_known_overlap_p (POS1, SIZE1, POS2, SIZE2)'
  7453. Return true if the range described by POS1 and SIZE1 is known to
  7454. overlap the range described by POS2 and SIZE2.
  7455. 'known_subrange_p (POS1, SIZE1, POS2, SIZE2)'
  7456. Return true if the range described by POS1 and SIZE1 is known to be
  7457. contained in the range described by POS2 and SIZE2.
  7458. 'maybe_in_range_p (VALUE, POS, SIZE)'
  7459. Return true if VALUE _might_ be in the range described by POS and
  7460. SIZE (in other words, return true if we cannot prove that VALUE is
  7461. outside that range).
  7462. 'known_in_range_p (VALUE, POS, SIZE)'
  7463. Return true if VALUE is known to be in the range described by POS
  7464. and SIZE.
  7465. 'endpoint_representable_p (POS, SIZE)'
  7466. Return true if the range described by POS and SIZE is open-ended or
  7467. if the endpoint (POS + SIZE) is representable in the same type as
  7468. POS and SIZE. The function returns false if adding SIZE to POS
  7469. makes conceptual sense but could overflow.
  7470. There is also a 'poly_int' version of the 'IN_RANGE_P' macro:
  7471. 'coeffs_in_range_p (X, LOWER, UPPER)'
  7472. Return true if every coefficient of X is in the inclusive range
  7473. [LOWER, UPPER]. This function can be useful when testing whether
  7474. an operation would cause the values of coefficients to overflow.
  7475. Note that the function does not indicate whether X itself is in the
  7476. given range. X can be either a constant or a 'poly_int'.
  7477. 
  7478. File: gccint.info, Node: Sorting poly_ints, Prev: Range checks on poly_ints, Up: Comparisons involving poly_int
  7479. 10.3.7 Sorting 'poly_int's
  7480. --------------------------
  7481. 'poly_int' provides the following routine for sorting:
  7482. 'compare_sizes_for_sort (A, B)'
  7483. Compare A and B in reverse lexicographical order (that is, compare
  7484. the highest-indexed coefficients first). This can be useful when
  7485. sorting data structures, since it has the effect of separating
  7486. constant and non-constant values. If all values are nonnegative,
  7487. the constant values come first.
  7488. Note that the values do not necessarily end up in numerical order.
  7489. For example, '1 + 1X' would come after '100' in the sort order, but
  7490. may well be less than '100' at run time.
  7491. 
  7492. File: gccint.info, Node: Arithmetic on poly_ints, Next: Alignment of poly_ints, Prev: Comparisons involving poly_int, Up: poly_int
  7493. 10.4 Arithmetic on 'poly_int's
  7494. ==============================
  7495. Addition, subtraction, negation and bit inversion all work normally for
  7496. 'poly_int's. Multiplication by a constant multiplier and left shifting
  7497. by a constant shift amount also work normally. General multiplication
  7498. of two 'poly_int's is not supported and is not useful in practice.
  7499. Other operations are only conditionally supported: the operation might
  7500. succeed or might fail, depending on the inputs.
  7501. This section describes both types of operation.
  7502. * Menu:
  7503. * Using poly_int with C++ arithmetic operators::
  7504. * wi arithmetic on poly_ints::
  7505. * Division of poly_ints::
  7506. * Other poly_int arithmetic::
  7507. 
  7508. File: gccint.info, Node: Using poly_int with C++ arithmetic operators, Next: wi arithmetic on poly_ints, Up: Arithmetic on poly_ints
  7509. 10.4.1 Using 'poly_int' with C++ arithmetic operators
  7510. -----------------------------------------------------
  7511. The following C++ expressions are supported, where P1 and P2 are
  7512. 'poly_int's and where C1 and C2 are scalars:
  7513. -P1
  7514. ~P1
  7515. P1 + P2
  7516. P1 + C2
  7517. C1 + P2
  7518. P1 - P2
  7519. P1 - C2
  7520. C1 - P2
  7521. C1 * P2
  7522. P1 * C2
  7523. P1 << C2
  7524. P1 += P2
  7525. P1 += C2
  7526. P1 -= P2
  7527. P1 -= C2
  7528. P1 *= C2
  7529. P1 <<= C2
  7530. These arithmetic operations handle integer ranks in a similar way to
  7531. C++. The main difference is that every coefficient narrower than
  7532. 'HOST_WIDE_INT' promotes to 'HOST_WIDE_INT', whereas in C++ everything
  7533. narrower than 'int' promotes to 'int'. For example:
  7534. poly_uint16 + int -> poly_int64
  7535. unsigned int + poly_uint16 -> poly_int64
  7536. poly_int64 + int -> poly_int64
  7537. poly_int32 + poly_uint64 -> poly_uint64
  7538. uint64 + poly_int64 -> poly_uint64
  7539. poly_offset_int + int32 -> poly_offset_int
  7540. offset_int + poly_uint16 -> poly_offset_int
  7541. In the first two examples, both coefficients are narrower than
  7542. 'HOST_WIDE_INT', so the result has coefficients of type 'HOST_WIDE_INT'.
  7543. In the other examples, the coefficient with the highest rank "wins".
  7544. If one of the operands is 'wide_int' or 'poly_wide_int', the rules are
  7545. the same as for 'wide_int' arithmetic.
  7546. 
  7547. File: gccint.info, Node: wi arithmetic on poly_ints, Next: Division of poly_ints, Prev: Using poly_int with C++ arithmetic operators, Up: Arithmetic on poly_ints
  7548. 10.4.2 'wi' arithmetic on 'poly_int's
  7549. -------------------------------------
  7550. As well as the C++ operators, 'poly_int' supports the following 'wi'
  7551. routines:
  7552. wi::neg (P1, &OVERFLOW)
  7553. wi::add (P1, P2)
  7554. wi::add (P1, C2)
  7555. wi::add (C1, P1)
  7556. wi::add (P1, P2, SIGN, &OVERFLOW)
  7557. wi::sub (P1, P2)
  7558. wi::sub (P1, C2)
  7559. wi::sub (C1, P1)
  7560. wi::sub (P1, P2, SIGN, &OVERFLOW)
  7561. wi::mul (P1, C2)
  7562. wi::mul (C1, P1)
  7563. wi::mul (P1, C2, SIGN, &OVERFLOW)
  7564. wi::lshift (P1, C2)
  7565. These routines just check whether overflow occurs on any individual
  7566. coefficient; it is not possible to know at compile time whether the
  7567. final runtime value would overflow.
  7568. 
  7569. File: gccint.info, Node: Division of poly_ints, Next: Other poly_int arithmetic, Prev: wi arithmetic on poly_ints, Up: Arithmetic on poly_ints
  7570. 10.4.3 Division of 'poly_int's
  7571. ------------------------------
  7572. Division of 'poly_int's is possible for certain inputs. The functions
  7573. for division return true if the operation is possible and in most cases
  7574. return the results by pointer. The routines are:
  7575. 'multiple_p (A, B)'
  7576. 'multiple_p (A, B, &QUOTIENT)'
  7577. Return true if A is an exact multiple of B, storing the result in
  7578. QUOTIENT if so. There are overloads for various combinations of
  7579. polynomial and constant A, B and QUOTIENT.
  7580. 'constant_multiple_p (A, B)'
  7581. 'constant_multiple_p (A, B, &QUOTIENT)'
  7582. Like 'multiple_p', but also test whether the multiple is a
  7583. compile-time constant.
  7584. 'can_div_trunc_p (A, B, &QUOTIENT)'
  7585. 'can_div_trunc_p (A, B, &QUOTIENT, &REMAINDER)'
  7586. Return true if we can calculate 'trunc (A / B)' at compile time,
  7587. storing the result in QUOTIENT and REMAINDER if so.
  7588. 'can_div_away_from_zero_p (A, B, &QUOTIENT)'
  7589. Return true if we can calculate 'A / B' at compile time, rounding
  7590. away from zero. Store the result in QUOTIENT if so.
  7591. Note that this is true if and only if 'can_div_trunc_p' is true.
  7592. The only difference is in the rounding of the result.
  7593. There is also an asserting form of division:
  7594. 'exact_div (A, B)'
  7595. Assert that A is a multiple of B and return 'A / B'. The result is
  7596. a 'poly_int' if A is a 'poly_int'.
  7597. 
  7598. File: gccint.info, Node: Other poly_int arithmetic, Prev: Division of poly_ints, Up: Arithmetic on poly_ints
  7599. 10.4.4 Other 'poly_int' arithmetic
  7600. ----------------------------------
  7601. There are tentative routines for other operations besides division:
  7602. 'can_ior_p (A, B, &RESULT)'
  7603. Return true if we can calculate 'A | B' at compile time, storing
  7604. the result in RESULT if so.
  7605. Also, ANDs with a value '(1 << Y) - 1' or its inverse can be treated as
  7606. alignment operations. *Note Alignment of poly_ints::.
  7607. In addition, the following miscellaneous routines are available:
  7608. 'coeff_gcd (A)'
  7609. Return the greatest common divisor of all nonzero coefficients in
  7610. A, or zero if A is known to be zero.
  7611. 'common_multiple (A, B)'
  7612. Return a value that is a multiple of both A and B, where one value
  7613. is a 'poly_int' and the other is a scalar. The result will be the
  7614. least common multiple for some indeterminate values but not
  7615. necessarily for all.
  7616. 'force_common_multiple (A, B)'
  7617. Return a value that is a multiple of both 'poly_int' A and
  7618. 'poly_int' B, asserting that such a value exists. The result will
  7619. be the least common multiple for some indeterminate values but not
  7620. necessarily for all.
  7621. When using this routine, please add a comment explaining why the
  7622. assertion is known to hold.
  7623. Please add any other operations that you find to be useful.
  7624. 
  7625. File: gccint.info, Node: Alignment of poly_ints, Next: Computing bounds on poly_ints, Prev: Arithmetic on poly_ints, Up: poly_int
  7626. 10.5 Alignment of 'poly_int's
  7627. =============================
  7628. 'poly_int' provides various routines for aligning values and for
  7629. querying misalignments. In each case the alignment must be a power of
  7630. 2.
  7631. 'can_align_p (VALUE, ALIGN)'
  7632. Return true if we can align VALUE up or down to the nearest
  7633. multiple of ALIGN at compile time. The answer is the same for both
  7634. directions.
  7635. 'can_align_down (VALUE, ALIGN, &ALIGNED)'
  7636. Return true if 'can_align_p'; if so, set ALIGNED to the greatest
  7637. aligned value that is less than or equal to VALUE.
  7638. 'can_align_up (VALUE, ALIGN, &ALIGNED)'
  7639. Return true if 'can_align_p'; if so, set ALIGNED to the lowest
  7640. aligned value that is greater than or equal to VALUE.
  7641. 'known_equal_after_align_down (A, B, ALIGN)'
  7642. Return true if we can align A and B down to the nearest ALIGN
  7643. boundary at compile time and if the two results are equal.
  7644. 'known_equal_after_align_up (A, B, ALIGN)'
  7645. Return true if we can align A and B up to the nearest ALIGN
  7646. boundary at compile time and if the two results are equal.
  7647. 'aligned_lower_bound (VALUE, ALIGN)'
  7648. Return a result that is no greater than VALUE and that is aligned
  7649. to ALIGN. The result will the closest aligned value for some
  7650. indeterminate values but not necessarily for all.
  7651. For example, suppose we are allocating an object of SIZE bytes in a
  7652. downward-growing stack whose current limit is given by LIMIT. If
  7653. the object requires ALIGN bytes of alignment, the new stack limit
  7654. is given by:
  7655. aligned_lower_bound (LIMIT - SIZE, ALIGN)
  7656. 'aligned_upper_bound (VALUE, ALIGN)'
  7657. Likewise return a result that is no less than VALUE and that is
  7658. aligned to ALIGN. This is the routine that would be used for
  7659. upward-growing stacks in the scenario just described.
  7660. 'known_misalignment (VALUE, ALIGN, &MISALIGN)'
  7661. Return true if we can calculate the misalignment of VALUE with
  7662. respect to ALIGN at compile time, storing the result in MISALIGN if
  7663. so.
  7664. 'known_alignment (VALUE)'
  7665. Return the minimum alignment that VALUE is known to have (in other
  7666. words, the largest alignment that can be guaranteed whatever the
  7667. values of the indeterminates turn out to be). Return 0 if VALUE is
  7668. known to be 0.
  7669. 'force_align_down (VALUE, ALIGN)'
  7670. Assert that VALUE can be aligned down to ALIGN at compile time and
  7671. return the result. When using this routine, please add a comment
  7672. explaining why the assertion is known to hold.
  7673. 'force_align_up (VALUE, ALIGN)'
  7674. Likewise, but aligning up.
  7675. 'force_align_down_and_div (VALUE, ALIGN)'
  7676. Divide the result of 'force_align_down' by ALIGN. Again, please
  7677. add a comment explaining why the assertion in 'force_align_down' is
  7678. known to hold.
  7679. 'force_align_up_and_div (VALUE, ALIGN)'
  7680. Likewise for 'force_align_up'.
  7681. 'force_get_misalignment (VALUE, ALIGN)'
  7682. Assert that we can calculate the misalignment of VALUE with respect
  7683. to ALIGN at compile time and return the misalignment. When using
  7684. this function, please add a comment explaining why the assertion is
  7685. known to hold.
  7686. 
  7687. File: gccint.info, Node: Computing bounds on poly_ints, Next: Converting poly_ints, Prev: Alignment of poly_ints, Up: poly_int
  7688. 10.6 Computing bounds on 'poly_int's
  7689. ====================================
  7690. 'poly_int' also provides routines for calculating lower and upper
  7691. bounds:
  7692. 'constant_lower_bound (A)'
  7693. Assert that A is nonnegative and return the smallest value it can
  7694. have.
  7695. 'constant_lower_bound_with_limit (A, B)'
  7696. Return the least value A can have, given that the context in which
  7697. A appears guarantees that the answer is no less than B. In other
  7698. words, the caller is asserting that A is greater than or equal to B
  7699. even if 'known_ge (A, B)' doesn't hold.
  7700. 'constant_upper_bound_with_limit (A, B)'
  7701. Return the greatest value A can have, given that the context in
  7702. which A appears guarantees that the answer is no greater than B.
  7703. In other words, the caller is asserting that A is less than or
  7704. equal to B even if 'known_le (A, B)' doesn't hold.
  7705. 'lower_bound (A, B)'
  7706. Return a value that is always less than or equal to both A and B.
  7707. It will be the greatest such value for some indeterminate values
  7708. but necessarily for all.
  7709. 'upper_bound (A, B)'
  7710. Return a value that is always greater than or equal to both A and
  7711. B. It will be the least such value for some indeterminate values
  7712. but necessarily for all.
  7713. 
  7714. File: gccint.info, Node: Converting poly_ints, Next: Miscellaneous poly_int routines, Prev: Computing bounds on poly_ints, Up: poly_int
  7715. 10.7 Converting 'poly_int's
  7716. ===========================
  7717. A 'poly_int<N, T>' can be constructed from up to N individual T
  7718. coefficients, with the remaining coefficients being implicitly zero. In
  7719. particular, this means that every 'poly_int<N, T>' can be constructed
  7720. from a single scalar T, or something compatible with T.
  7721. Also, a 'poly_int<N, T>' can be constructed from a 'poly_int<N, U>' if
  7722. T can be constructed from U.
  7723. The following functions provide other forms of conversion, or test
  7724. whether such a conversion would succeed.
  7725. 'VALUE.is_constant ()'
  7726. Return true if 'poly_int' VALUE is a compile-time constant.
  7727. 'VALUE.is_constant (&C1)'
  7728. Return true if 'poly_int' VALUE is a compile-time constant, storing
  7729. it in C1 if so. C1 must be able to hold all constant values of
  7730. VALUE without loss of precision.
  7731. 'VALUE.to_constant ()'
  7732. Assert that VALUE is a compile-time constant and return its value.
  7733. When using this function, please add a comment explaining why the
  7734. condition is known to hold (for example, because an earlier phase
  7735. of analysis rejected non-constants).
  7736. 'VALUE.to_shwi (&P2)'
  7737. Return true if 'poly_int<N, T>' VALUE can be represented without
  7738. loss of precision as a 'poly_int<N, 'HOST_WIDE_INT'>', storing it
  7739. in that form in P2 if so.
  7740. 'VALUE.to_uhwi (&P2)'
  7741. Return true if 'poly_int<N, T>' VALUE can be represented without
  7742. loss of precision as a 'poly_int<N, 'unsigned HOST_WIDE_INT'>',
  7743. storing it in that form in P2 if so.
  7744. 'VALUE.force_shwi ()'
  7745. Forcibly convert each coefficient of 'poly_int<N, T>' VALUE to
  7746. 'HOST_WIDE_INT', truncating any that are out of range. Return the
  7747. result as a 'poly_int<N, 'HOST_WIDE_INT'>'.
  7748. 'VALUE.force_uhwi ()'
  7749. Forcibly convert each coefficient of 'poly_int<N, T>' VALUE to
  7750. 'unsigned HOST_WIDE_INT', truncating any that are out of range.
  7751. Return the result as a 'poly_int<N, 'unsigned HOST_WIDE_INT'>'.
  7752. 'wi::shwi (VALUE, PRECISION)'
  7753. Return a 'poly_int' with the same value as VALUE, but with the
  7754. coefficients converted from 'HOST_WIDE_INT' to 'wide_int'.
  7755. PRECISION specifies the precision of the 'wide_int' cofficients; if
  7756. this is wider than a 'HOST_WIDE_INT', the coefficients of VALUE
  7757. will be sign-extended to fit.
  7758. 'wi::uhwi (VALUE, PRECISION)'
  7759. Like 'wi::shwi', except that VALUE has coefficients of type
  7760. 'unsigned HOST_WIDE_INT'. If PRECISION is wider than a
  7761. 'HOST_WIDE_INT', the coefficients of VALUE will be zero-extended to
  7762. fit.
  7763. 'wi::sext (VALUE, PRECISION)'
  7764. Return a 'poly_int' of the same type as VALUE, sign-extending every
  7765. coefficient from the low PRECISION bits. This in effect applies
  7766. 'wi::sext' to each coefficient individually.
  7767. 'wi::zext (VALUE, PRECISION)'
  7768. Like 'wi::sext', but for zero extension.
  7769. 'poly_wide_int::from (VALUE, PRECISION, SIGN)'
  7770. Convert VALUE to a 'poly_wide_int' in which each coefficient has
  7771. PRECISION bits. Extend the coefficients according to SIGN if the
  7772. coefficients have fewer bits.
  7773. 'poly_offset_int::from (VALUE, SIGN)'
  7774. Convert VALUE to a 'poly_offset_int', extending its coefficients
  7775. according to SIGN if they have fewer bits than 'offset_int'.
  7776. 'poly_widest_int::from (VALUE, SIGN)'
  7777. Convert VALUE to a 'poly_widest_int', extending its coefficients
  7778. according to SIGN if they have fewer bits than 'widest_int'.
  7779. 
  7780. File: gccint.info, Node: Miscellaneous poly_int routines, Next: Guidelines for using poly_int, Prev: Converting poly_ints, Up: poly_int
  7781. 10.8 Miscellaneous 'poly_int' routines
  7782. ======================================
  7783. 'print_dec (VALUE, FILE, SIGN)'
  7784. 'print_dec (VALUE, FILE)'
  7785. Print VALUE to FILE as a decimal value, interpreting the
  7786. coefficients according to SIGN. The final argument is optional if
  7787. VALUE has an inherent sign; for example, 'poly_int64' values print
  7788. as signed by default and 'poly_uint64' values print as unsigned by
  7789. default.
  7790. This is a simply a 'poly_int' version of a wide-int routine.
  7791. 
  7792. File: gccint.info, Node: Guidelines for using poly_int, Prev: Miscellaneous poly_int routines, Up: poly_int
  7793. 10.9 Guidelines for using 'poly_int'
  7794. ====================================
  7795. One of the main design goals of 'poly_int' was to make it easy to write
  7796. target-independent code that handles variable-sized registers even when
  7797. the current target has fixed-sized registers. There are two aspects to
  7798. this:
  7799. * The set of 'poly_int' operations should be complete enough that the
  7800. question in most cases becomes "Can we do this operation on these
  7801. particular 'poly_int' values? If not, bail out" rather than "Are
  7802. these 'poly_int' values constant? If so, do the operation,
  7803. otherwise bail out".
  7804. * If target-independent code compiles and runs correctly on a target
  7805. with one value of 'NUM_POLY_INT_COEFFS', and if the code does not
  7806. use asserting functions like 'to_constant', it is reasonable to
  7807. assume that the code also works on targets with other values of
  7808. 'NUM_POLY_INT_COEFFS'. There is no need to check this during
  7809. everyday development.
  7810. So the general principle is: if target-independent code is dealing with
  7811. a 'poly_int' value, it is better to operate on it as a 'poly_int' if at
  7812. all possible, choosing conservatively-correct behavior if a particular
  7813. operation fails. For example, the following code handles an index 'pos'
  7814. into a sequence of vectors that each have 'nunits' elements:
  7815. /* Calculate which vector contains the result, and which lane of
  7816. that vector we need. */
  7817. if (!can_div_trunc_p (pos, nunits, &vec_entry, &vec_index))
  7818. {
  7819. if (dump_enabled_p ())
  7820. dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location,
  7821. "Cannot determine which vector holds the"
  7822. " final result.\n");
  7823. return false;
  7824. }
  7825. However, there are some contexts in which operating on a 'poly_int' is
  7826. not possible or does not make sense. One example is when handling
  7827. static initializers, since no current target supports the concept of a
  7828. variable-length static initializer. In these situations, a reasonable
  7829. fallback is:
  7830. if (POLY_VALUE.is_constant (&CONST_VALUE))
  7831. {
  7832. ...
  7833. /* Operate on CONST_VALUE. */
  7834. ...
  7835. }
  7836. else
  7837. {
  7838. ...
  7839. /* Conservatively correct fallback. */
  7840. ...
  7841. }
  7842. 'poly_int' also provides some asserting functions like 'to_constant'.
  7843. Please only use these functions if there is a good theoretical reason to
  7844. believe that the assertion cannot fire. For example, if some work is
  7845. divided into an analysis phase and an implementation phase, the analysis
  7846. phase might reject inputs that are not 'is_constant', in which case the
  7847. implementation phase can reasonably use 'to_constant' on the remaining
  7848. inputs. The assertions should not be used to discover whether a
  7849. condition ever occurs "in the field"; in other words, they should not be
  7850. used to restrict code to constants at first, with the intention of only
  7851. implementing a 'poly_int' version if a user hits the assertion.
  7852. If a particular asserting function like 'to_constant' is needed more
  7853. than once for the same reason, it is probably worth adding a helper
  7854. function or macro for that situation, so that the justification only
  7855. needs to be given once. For example:
  7856. /* Return the size of an element in a vector of size SIZE, given that
  7857. the vector has NELTS elements. The return value is in the same units
  7858. as SIZE (either bits or bytes).
  7859. to_constant () is safe in this situation because vector elements are
  7860. always constant-sized scalars. */
  7861. #define vector_element_size(SIZE, NELTS) \
  7862. (exact_div (SIZE, NELTS).to_constant ())
  7863. Target-specific code in 'config/CPU' only needs to handle non-constant
  7864. 'poly_int's if 'NUM_POLY_INT_COEFFS' is greater than one. For other
  7865. targets, 'poly_int' degenerates to a compile-time constant and is often
  7866. interchangable with a normal scalar integer. There are two main
  7867. exceptions:
  7868. * Sometimes an explicit cast to an integer type might be needed, such
  7869. as to resolve ambiguities in a '?:' expression, or when passing
  7870. values through '...' to things like print functions.
  7871. * Target macros are included in target-independent code and so do not
  7872. have access to the implicit conversion to a scalar integer. If
  7873. this becomes a problem for a particular target macro, the possible
  7874. solutions, in order of preference, are:
  7875. * Convert the target macro to a target hook (for all targets).
  7876. * Put the target's implementation of the target macro in its
  7877. 'CPU.c' file and call it from the target macro in the 'CPU.h'
  7878. file.
  7879. * Add 'to_constant ()' calls where necessary. The previous
  7880. option is preferable because it will help with any future
  7881. conversion of the macro to a hook.
  7882. 
  7883. File: gccint.info, Node: GENERIC, Next: GIMPLE, Prev: poly_int, Up: Top
  7884. 11 GENERIC
  7885. **********
  7886. The purpose of GENERIC is simply to provide a language-independent way
  7887. of representing an entire function in trees. To this end, it was
  7888. necessary to add a few new tree codes to the back end, but almost
  7889. everything was already there. If you can express it with the codes in
  7890. 'gcc/tree.def', it's GENERIC.
  7891. Early on, there was a great deal of debate about how to think about
  7892. statements in a tree IL. In GENERIC, a statement is defined as any
  7893. expression whose value, if any, is ignored. A statement will always
  7894. have 'TREE_SIDE_EFFECTS' set (or it will be discarded), but a
  7895. non-statement expression may also have side effects. A 'CALL_EXPR', for
  7896. instance.
  7897. It would be possible for some local optimizations to work on the
  7898. GENERIC form of a function; indeed, the adapted tree inliner works fine
  7899. on GENERIC, but the current compiler performs inlining after lowering to
  7900. GIMPLE (a restricted form described in the next section). Indeed,
  7901. currently the frontends perform this lowering before handing off to
  7902. 'tree_rest_of_compilation', but this seems inelegant.
  7903. * Menu:
  7904. * Deficiencies:: Topics net yet covered in this document.
  7905. * Tree overview:: All about 'tree's.
  7906. * Types:: Fundamental and aggregate types.
  7907. * Declarations:: Type declarations and variables.
  7908. * Attributes:: Declaration and type attributes.
  7909. * Expressions: Expression trees. Operating on data.
  7910. * Statements:: Control flow and related trees.
  7911. * Functions:: Function bodies, linkage, and other aspects.
  7912. * Language-dependent trees:: Topics and trees specific to language front ends.
  7913. * C and C++ Trees:: Trees specific to C and C++.
  7914. 
  7915. File: gccint.info, Node: Deficiencies, Next: Tree overview, Up: GENERIC
  7916. 11.1 Deficiencies
  7917. =================
  7918. There are many places in which this document is incomplet and incorrekt.
  7919. It is, as of yet, only _preliminary_ documentation.
  7920. 
  7921. File: gccint.info, Node: Tree overview, Next: Types, Prev: Deficiencies, Up: GENERIC
  7922. 11.2 Overview
  7923. =============
  7924. The central data structure used by the internal representation is the
  7925. 'tree'. These nodes, while all of the C type 'tree', are of many
  7926. varieties. A 'tree' is a pointer type, but the object to which it
  7927. points may be of a variety of types. From this point forward, we will
  7928. refer to trees in ordinary type, rather than in 'this font', except when
  7929. talking about the actual C type 'tree'.
  7930. You can tell what kind of node a particular tree is by using the
  7931. 'TREE_CODE' macro. Many, many macros take trees as input and return
  7932. trees as output. However, most macros require a certain kind of tree
  7933. node as input. In other words, there is a type-system for trees, but it
  7934. is not reflected in the C type-system.
  7935. For safety, it is useful to configure GCC with '--enable-checking'.
  7936. Although this results in a significant performance penalty (since all
  7937. tree types are checked at run-time), and is therefore inappropriate in a
  7938. release version, it is extremely helpful during the development process.
  7939. Many macros behave as predicates. Many, although not all, of these
  7940. predicates end in '_P'. Do not rely on the result type of these macros
  7941. being of any particular type. You may, however, rely on the fact that
  7942. the type can be compared to '0', so that statements like
  7943. if (TEST_P (t) && !TEST_P (y))
  7944. x = 1;
  7945. and
  7946. int i = (TEST_P (t) != 0);
  7947. are legal. Macros that return 'int' values now may be changed to return
  7948. 'tree' values, or other pointers in the future. Even those that
  7949. continue to return 'int' may return multiple nonzero codes where
  7950. previously they returned only zero and one. Therefore, you should not
  7951. write code like
  7952. if (TEST_P (t) == 1)
  7953. as this code is not guaranteed to work correctly in the future.
  7954. You should not take the address of values returned by the macros or
  7955. functions described here. In particular, no guarantee is given that the
  7956. values are lvalues.
  7957. In general, the names of macros are all in uppercase, while the names
  7958. of functions are entirely in lowercase. There are rare exceptions to
  7959. this rule. You should assume that any macro or function whose name is
  7960. made up entirely of uppercase letters may evaluate its arguments more
  7961. than once. You may assume that a macro or function whose name is made
  7962. up entirely of lowercase letters will evaluate its arguments only once.
  7963. The 'error_mark_node' is a special tree. Its tree code is
  7964. 'ERROR_MARK', but since there is only ever one node with that code, the
  7965. usual practice is to compare the tree against 'error_mark_node'. (This
  7966. test is just a test for pointer equality.) If an error has occurred
  7967. during front-end processing the flag 'errorcount' will be set. If the
  7968. front end has encountered code it cannot handle, it will issue a message
  7969. to the user and set 'sorrycount'. When these flags are set, any macro
  7970. or function which normally returns a tree of a particular kind may
  7971. instead return the 'error_mark_node'. Thus, if you intend to do any
  7972. processing of erroneous code, you must be prepared to deal with the
  7973. 'error_mark_node'.
  7974. Occasionally, a particular tree slot (like an operand to an expression,
  7975. or a particular field in a declaration) will be referred to as "reserved
  7976. for the back end". These slots are used to store RTL when the tree is
  7977. converted to RTL for use by the GCC back end. However, if that process
  7978. is not taking place (e.g., if the front end is being hooked up to an
  7979. intelligent editor), then those slots may be used by the back end
  7980. presently in use.
  7981. If you encounter situations that do not match this documentation, such
  7982. as tree nodes of types not mentioned here, or macros documented to
  7983. return entities of a particular kind that instead return entities of
  7984. some different kind, you have found a bug, either in the front end or in
  7985. the documentation. Please report these bugs as you would any other bug.
  7986. * Menu:
  7987. * Macros and Functions::Macros and functions that can be used with all trees.
  7988. * Identifiers:: The names of things.
  7989. * Containers:: Lists and vectors.
  7990. 
  7991. File: gccint.info, Node: Macros and Functions, Next: Identifiers, Up: Tree overview
  7992. 11.2.1 Trees
  7993. ------------
  7994. All GENERIC trees have two fields in common. First, 'TREE_CHAIN' is a
  7995. pointer that can be used as a singly-linked list to other trees. The
  7996. other is 'TREE_TYPE'. Many trees store the type of an expression or
  7997. declaration in this field.
  7998. These are some other functions for handling trees:
  7999. 'tree_size'
  8000. Return the number of bytes a tree takes.
  8001. 'build0'
  8002. 'build1'
  8003. 'build2'
  8004. 'build3'
  8005. 'build4'
  8006. 'build5'
  8007. 'build6'
  8008. These functions build a tree and supply values to put in each
  8009. parameter. The basic signature is 'code, type, [operands]'.
  8010. 'code' is the 'TREE_CODE', and 'type' is a tree representing the
  8011. 'TREE_TYPE'. These are followed by the operands, each of which is
  8012. also a tree.
  8013. 
  8014. File: gccint.info, Node: Identifiers, Next: Containers, Prev: Macros and Functions, Up: Tree overview
  8015. 11.2.2 Identifiers
  8016. ------------------
  8017. An 'IDENTIFIER_NODE' represents a slightly more general concept than the
  8018. standard C or C++ concept of identifier. In particular, an
  8019. 'IDENTIFIER_NODE' may contain a '$', or other extraordinary characters.
  8020. There are never two distinct 'IDENTIFIER_NODE's representing the same
  8021. identifier. Therefore, you may use pointer equality to compare
  8022. 'IDENTIFIER_NODE's, rather than using a routine like 'strcmp'. Use
  8023. 'get_identifier' to obtain the unique 'IDENTIFIER_NODE' for a supplied
  8024. string.
  8025. You can use the following macros to access identifiers:
  8026. 'IDENTIFIER_POINTER'
  8027. The string represented by the identifier, represented as a 'char*'.
  8028. This string is always 'NUL'-terminated, and contains no embedded
  8029. 'NUL' characters.
  8030. 'IDENTIFIER_LENGTH'
  8031. The length of the string returned by 'IDENTIFIER_POINTER', not
  8032. including the trailing 'NUL'. This value of 'IDENTIFIER_LENGTH
  8033. (x)' is always the same as 'strlen (IDENTIFIER_POINTER (x))'.
  8034. 'IDENTIFIER_OPNAME_P'
  8035. This predicate holds if the identifier represents the name of an
  8036. overloaded operator. In this case, you should not depend on the
  8037. contents of either the 'IDENTIFIER_POINTER' or the
  8038. 'IDENTIFIER_LENGTH'.
  8039. 'IDENTIFIER_TYPENAME_P'
  8040. This predicate holds if the identifier represents the name of a
  8041. user-defined conversion operator. In this case, the 'TREE_TYPE' of
  8042. the 'IDENTIFIER_NODE' holds the type to which the conversion
  8043. operator converts.
  8044. 
  8045. File: gccint.info, Node: Containers, Prev: Identifiers, Up: Tree overview
  8046. 11.2.3 Containers
  8047. -----------------
  8048. Two common container data structures can be represented directly with
  8049. tree nodes. A 'TREE_LIST' is a singly linked list containing two trees
  8050. per node. These are the 'TREE_PURPOSE' and 'TREE_VALUE' of each node.
  8051. (Often, the 'TREE_PURPOSE' contains some kind of tag, or additional
  8052. information, while the 'TREE_VALUE' contains the majority of the
  8053. payload. In other cases, the 'TREE_PURPOSE' is simply 'NULL_TREE',
  8054. while in still others both the 'TREE_PURPOSE' and 'TREE_VALUE' are of
  8055. equal stature.) Given one 'TREE_LIST' node, the next node is found by
  8056. following the 'TREE_CHAIN'. If the 'TREE_CHAIN' is 'NULL_TREE', then
  8057. you have reached the end of the list.
  8058. A 'TREE_VEC' is a simple vector. The 'TREE_VEC_LENGTH' is an integer
  8059. (not a tree) giving the number of nodes in the vector. The nodes
  8060. themselves are accessed using the 'TREE_VEC_ELT' macro, which takes two
  8061. arguments. The first is the 'TREE_VEC' in question; the second is an
  8062. integer indicating which element in the vector is desired. The elements
  8063. are indexed from zero.
  8064. 
  8065. File: gccint.info, Node: Types, Next: Declarations, Prev: Tree overview, Up: GENERIC
  8066. 11.3 Types
  8067. ==========
  8068. All types have corresponding tree nodes. However, you should not assume
  8069. that there is exactly one tree node corresponding to each type. There
  8070. are often multiple nodes corresponding to the same type.
  8071. For the most part, different kinds of types have different tree codes.
  8072. (For example, pointer types use a 'POINTER_TYPE' code while arrays use
  8073. an 'ARRAY_TYPE' code.) However, pointers to member functions use the
  8074. 'RECORD_TYPE' code. Therefore, when writing a 'switch' statement that
  8075. depends on the code associated with a particular type, you should take
  8076. care to handle pointers to member functions under the 'RECORD_TYPE' case
  8077. label.
  8078. The following functions and macros deal with cv-qualification of types:
  8079. 'TYPE_MAIN_VARIANT'
  8080. This macro returns the unqualified version of a type. It may be
  8081. applied to an unqualified type, but it is not always the identity
  8082. function in that case.
  8083. A few other macros and functions are usable with all types:
  8084. 'TYPE_SIZE'
  8085. The number of bits required to represent the type, represented as
  8086. an 'INTEGER_CST'. For an incomplete type, 'TYPE_SIZE' will be
  8087. 'NULL_TREE'.
  8088. 'TYPE_ALIGN'
  8089. The alignment of the type, in bits, represented as an 'int'.
  8090. 'TYPE_NAME'
  8091. This macro returns a declaration (in the form of a 'TYPE_DECL') for
  8092. the type. (Note this macro does _not_ return an 'IDENTIFIER_NODE',
  8093. as you might expect, given its name!) You can look at the
  8094. 'DECL_NAME' of the 'TYPE_DECL' to obtain the actual name of the
  8095. type. The 'TYPE_NAME' will be 'NULL_TREE' for a type that is not a
  8096. built-in type, the result of a typedef, or a named class type.
  8097. 'TYPE_CANONICAL'
  8098. This macro returns the "canonical" type for the given type node.
  8099. Canonical types are used to improve performance in the C++ and
  8100. Objective-C++ front ends by allowing efficient comparison between
  8101. two type nodes in 'same_type_p': if the 'TYPE_CANONICAL' values of
  8102. the types are equal, the types are equivalent; otherwise, the types
  8103. are not equivalent. The notion of equivalence for canonical types
  8104. is the same as the notion of type equivalence in the language
  8105. itself. For instance,
  8106. When 'TYPE_CANONICAL' is 'NULL_TREE', there is no canonical type
  8107. for the given type node. In this case, comparison between this
  8108. type and any other type requires the compiler to perform a deep,
  8109. "structural" comparison to see if the two type nodes have the same
  8110. form and properties.
  8111. The canonical type for a node is always the most fundamental type
  8112. in the equivalence class of types. For instance, 'int' is its own
  8113. canonical type. A typedef 'I' of 'int' will have 'int' as its
  8114. canonical type. Similarly, 'I*' and a typedef 'IP' (defined to
  8115. 'I*') will has 'int*' as their canonical type. When building a new
  8116. type node, be sure to set 'TYPE_CANONICAL' to the appropriate
  8117. canonical type. If the new type is a compound type (built from
  8118. other types), and any of those other types require structural
  8119. equality, use 'SET_TYPE_STRUCTURAL_EQUALITY' to ensure that the new
  8120. type also requires structural equality. Finally, if for some
  8121. reason you cannot guarantee that 'TYPE_CANONICAL' will point to the
  8122. canonical type, use 'SET_TYPE_STRUCTURAL_EQUALITY' to make sure
  8123. that the new type-and any type constructed based on it-requires
  8124. structural equality. If you suspect that the canonical type system
  8125. is miscomparing types, pass '--param verify-canonical-types=1' to
  8126. the compiler or configure with '--enable-checking' to force the
  8127. compiler to verify its canonical-type comparisons against the
  8128. structural comparisons; the compiler will then print any warnings
  8129. if the canonical types miscompare.
  8130. 'TYPE_STRUCTURAL_EQUALITY_P'
  8131. This predicate holds when the node requires structural equality
  8132. checks, e.g., when 'TYPE_CANONICAL' is 'NULL_TREE'.
  8133. 'SET_TYPE_STRUCTURAL_EQUALITY'
  8134. This macro states that the type node it is given requires
  8135. structural equality checks, e.g., it sets 'TYPE_CANONICAL' to
  8136. 'NULL_TREE'.
  8137. 'same_type_p'
  8138. This predicate takes two types as input, and holds if they are the
  8139. same type. For example, if one type is a 'typedef' for the other,
  8140. or both are 'typedef's for the same type. This predicate also
  8141. holds if the two trees given as input are simply copies of one
  8142. another; i.e., there is no difference between them at the source
  8143. level, but, for whatever reason, a duplicate has been made in the
  8144. representation. You should never use '==' (pointer equality) to
  8145. compare types; always use 'same_type_p' instead.
  8146. Detailed below are the various kinds of types, and the macros that can
  8147. be used to access them. Although other kinds of types are used
  8148. elsewhere in G++, the types described here are the only ones that you
  8149. will encounter while examining the intermediate representation.
  8150. 'VOID_TYPE'
  8151. Used to represent the 'void' type.
  8152. 'INTEGER_TYPE'
  8153. Used to represent the various integral types, including 'char',
  8154. 'short', 'int', 'long', and 'long long'. This code is not used for
  8155. enumeration types, nor for the 'bool' type. The 'TYPE_PRECISION'
  8156. is the number of bits used in the representation, represented as an
  8157. 'unsigned int'. (Note that in the general case this is not the
  8158. same value as 'TYPE_SIZE'; suppose that there were a 24-bit integer
  8159. type, but that alignment requirements for the ABI required 32-bit
  8160. alignment. Then, 'TYPE_SIZE' would be an 'INTEGER_CST' for 32,
  8161. while 'TYPE_PRECISION' would be 24.) The integer type is unsigned
  8162. if 'TYPE_UNSIGNED' holds; otherwise, it is signed.
  8163. The 'TYPE_MIN_VALUE' is an 'INTEGER_CST' for the smallest integer
  8164. that may be represented by this type. Similarly, the
  8165. 'TYPE_MAX_VALUE' is an 'INTEGER_CST' for the largest integer that
  8166. may be represented by this type.
  8167. 'REAL_TYPE'
  8168. Used to represent the 'float', 'double', and 'long double' types.
  8169. The number of bits in the floating-point representation is given by
  8170. 'TYPE_PRECISION', as in the 'INTEGER_TYPE' case.
  8171. 'FIXED_POINT_TYPE'
  8172. Used to represent the 'short _Fract', '_Fract', 'long _Fract',
  8173. 'long long _Fract', 'short _Accum', '_Accum', 'long _Accum', and
  8174. 'long long _Accum' types. The number of bits in the fixed-point
  8175. representation is given by 'TYPE_PRECISION', as in the
  8176. 'INTEGER_TYPE' case. There may be padding bits, fractional bits
  8177. and integral bits. The number of fractional bits is given by
  8178. 'TYPE_FBIT', and the number of integral bits is given by
  8179. 'TYPE_IBIT'. The fixed-point type is unsigned if 'TYPE_UNSIGNED'
  8180. holds; otherwise, it is signed. The fixed-point type is saturating
  8181. if 'TYPE_SATURATING' holds; otherwise, it is not saturating.
  8182. 'COMPLEX_TYPE'
  8183. Used to represent GCC built-in '__complex__' data types. The
  8184. 'TREE_TYPE' is the type of the real and imaginary parts.
  8185. 'ENUMERAL_TYPE'
  8186. Used to represent an enumeration type. The 'TYPE_PRECISION' gives
  8187. (as an 'int'), the number of bits used to represent the type. If
  8188. there are no negative enumeration constants, 'TYPE_UNSIGNED' will
  8189. hold. The minimum and maximum enumeration constants may be
  8190. obtained with 'TYPE_MIN_VALUE' and 'TYPE_MAX_VALUE', respectively;
  8191. each of these macros returns an 'INTEGER_CST'.
  8192. The actual enumeration constants themselves may be obtained by
  8193. looking at the 'TYPE_VALUES'. This macro will return a
  8194. 'TREE_LIST', containing the constants. The 'TREE_PURPOSE' of each
  8195. node will be an 'IDENTIFIER_NODE' giving the name of the constant;
  8196. the 'TREE_VALUE' will be an 'INTEGER_CST' giving the value assigned
  8197. to that constant. These constants will appear in the order in
  8198. which they were declared. The 'TREE_TYPE' of each of these
  8199. constants will be the type of enumeration type itself.
  8200. 'BOOLEAN_TYPE'
  8201. Used to represent the 'bool' type.
  8202. 'POINTER_TYPE'
  8203. Used to represent pointer types, and pointer to data member types.
  8204. The 'TREE_TYPE' gives the type to which this type points.
  8205. 'REFERENCE_TYPE'
  8206. Used to represent reference types. The 'TREE_TYPE' gives the type
  8207. to which this type refers.
  8208. 'FUNCTION_TYPE'
  8209. Used to represent the type of non-member functions and of static
  8210. member functions. The 'TREE_TYPE' gives the return type of the
  8211. function. The 'TYPE_ARG_TYPES' are a 'TREE_LIST' of the argument
  8212. types. The 'TREE_VALUE' of each node in this list is the type of
  8213. the corresponding argument; the 'TREE_PURPOSE' is an expression for
  8214. the default argument value, if any. If the last node in the list
  8215. is 'void_list_node' (a 'TREE_LIST' node whose 'TREE_VALUE' is the
  8216. 'void_type_node'), then functions of this type do not take variable
  8217. arguments. Otherwise, they do take a variable number of arguments.
  8218. Note that in C (but not in C++) a function declared like 'void f()'
  8219. is an unprototyped function taking a variable number of arguments;
  8220. the 'TYPE_ARG_TYPES' of such a function will be 'NULL'.
  8221. 'METHOD_TYPE'
  8222. Used to represent the type of a non-static member function. Like a
  8223. 'FUNCTION_TYPE', the return type is given by the 'TREE_TYPE'. The
  8224. type of '*this', i.e., the class of which functions of this type
  8225. are a member, is given by the 'TYPE_METHOD_BASETYPE'. The
  8226. 'TYPE_ARG_TYPES' is the parameter list, as for a 'FUNCTION_TYPE',
  8227. and includes the 'this' argument.
  8228. 'ARRAY_TYPE'
  8229. Used to represent array types. The 'TREE_TYPE' gives the type of
  8230. the elements in the array. If the array-bound is present in the
  8231. type, the 'TYPE_DOMAIN' is an 'INTEGER_TYPE' whose 'TYPE_MIN_VALUE'
  8232. and 'TYPE_MAX_VALUE' will be the lower and upper bounds of the
  8233. array, respectively. The 'TYPE_MIN_VALUE' will always be an
  8234. 'INTEGER_CST' for zero, while the 'TYPE_MAX_VALUE' will be one less
  8235. than the number of elements in the array, i.e., the highest value
  8236. which may be used to index an element in the array.
  8237. 'RECORD_TYPE'
  8238. Used to represent 'struct' and 'class' types, as well as pointers
  8239. to member functions and similar constructs in other languages.
  8240. 'TYPE_FIELDS' contains the items contained in this type, each of
  8241. which can be a 'FIELD_DECL', 'VAR_DECL', 'CONST_DECL', or
  8242. 'TYPE_DECL'. You may not make any assumptions about the ordering
  8243. of the fields in the type or whether one or more of them overlap.
  8244. 'UNION_TYPE'
  8245. Used to represent 'union' types. Similar to 'RECORD_TYPE' except
  8246. that all 'FIELD_DECL' nodes in 'TYPE_FIELD' start at bit position
  8247. zero.
  8248. 'QUAL_UNION_TYPE'
  8249. Used to represent part of a variant record in Ada. Similar to
  8250. 'UNION_TYPE' except that each 'FIELD_DECL' has a 'DECL_QUALIFIER'
  8251. field, which contains a boolean expression that indicates whether
  8252. the field is present in the object. The type will only have one
  8253. field, so each field's 'DECL_QUALIFIER' is only evaluated if none
  8254. of the expressions in the previous fields in 'TYPE_FIELDS' are
  8255. nonzero. Normally these expressions will reference a field in the
  8256. outer object using a 'PLACEHOLDER_EXPR'.
  8257. 'LANG_TYPE'
  8258. This node is used to represent a language-specific type. The front
  8259. end must handle it.
  8260. 'OFFSET_TYPE'
  8261. This node is used to represent a pointer-to-data member. For a
  8262. data member 'X::m' the 'TYPE_OFFSET_BASETYPE' is 'X' and the
  8263. 'TREE_TYPE' is the type of 'm'.
  8264. There are variables whose values represent some of the basic types.
  8265. These include:
  8266. 'void_type_node'
  8267. A node for 'void'.
  8268. 'integer_type_node'
  8269. A node for 'int'.
  8270. 'unsigned_type_node.'
  8271. A node for 'unsigned int'.
  8272. 'char_type_node.'
  8273. A node for 'char'.
  8274. It may sometimes be useful to compare one of these variables with a type
  8275. in hand, using 'same_type_p'.
  8276. 
  8277. File: gccint.info, Node: Declarations, Next: Attributes, Prev: Types, Up: GENERIC
  8278. 11.4 Declarations
  8279. =================
  8280. This section covers the various kinds of declarations that appear in the
  8281. internal representation, except for declarations of functions
  8282. (represented by 'FUNCTION_DECL' nodes), which are described in *note
  8283. Functions::.
  8284. * Menu:
  8285. * Working with declarations:: Macros and functions that work on
  8286. declarations.
  8287. * Internal structure:: How declaration nodes are represented.
  8288. 
  8289. File: gccint.info, Node: Working with declarations, Next: Internal structure, Up: Declarations
  8290. 11.4.1 Working with declarations
  8291. --------------------------------
  8292. Some macros can be used with any kind of declaration. These include:
  8293. 'DECL_NAME'
  8294. This macro returns an 'IDENTIFIER_NODE' giving the name of the
  8295. entity.
  8296. 'TREE_TYPE'
  8297. This macro returns the type of the entity declared.
  8298. 'EXPR_FILENAME'
  8299. This macro returns the name of the file in which the entity was
  8300. declared, as a 'char*'. For an entity declared implicitly by the
  8301. compiler (like '__builtin_memcpy'), this will be the string
  8302. '"<internal>"'.
  8303. 'EXPR_LINENO'
  8304. This macro returns the line number at which the entity was
  8305. declared, as an 'int'.
  8306. 'DECL_ARTIFICIAL'
  8307. This predicate holds if the declaration was implicitly generated by
  8308. the compiler. For example, this predicate will hold of an
  8309. implicitly declared member function, or of the 'TYPE_DECL'
  8310. implicitly generated for a class type. Recall that in C++ code
  8311. like:
  8312. struct S {};
  8313. is roughly equivalent to C code like:
  8314. struct S {};
  8315. typedef struct S S;
  8316. The implicitly generated 'typedef' declaration is represented by a
  8317. 'TYPE_DECL' for which 'DECL_ARTIFICIAL' holds.
  8318. The various kinds of declarations include:
  8319. 'LABEL_DECL'
  8320. These nodes are used to represent labels in function bodies. For
  8321. more information, see *note Functions::. These nodes only appear
  8322. in block scopes.
  8323. 'CONST_DECL'
  8324. These nodes are used to represent enumeration constants. The value
  8325. of the constant is given by 'DECL_INITIAL' which will be an
  8326. 'INTEGER_CST' with the same type as the 'TREE_TYPE' of the
  8327. 'CONST_DECL', i.e., an 'ENUMERAL_TYPE'.
  8328. 'RESULT_DECL'
  8329. These nodes represent the value returned by a function. When a
  8330. value is assigned to a 'RESULT_DECL', that indicates that the value
  8331. should be returned, via bitwise copy, by the function. You can use
  8332. 'DECL_SIZE' and 'DECL_ALIGN' on a 'RESULT_DECL', just as with a
  8333. 'VAR_DECL'.
  8334. 'TYPE_DECL'
  8335. These nodes represent 'typedef' declarations. The 'TREE_TYPE' is
  8336. the type declared to have the name given by 'DECL_NAME'. In some
  8337. cases, there is no associated name.
  8338. 'VAR_DECL'
  8339. These nodes represent variables with namespace or block scope, as
  8340. well as static data members. The 'DECL_SIZE' and 'DECL_ALIGN' are
  8341. analogous to 'TYPE_SIZE' and 'TYPE_ALIGN'. For a declaration, you
  8342. should always use the 'DECL_SIZE' and 'DECL_ALIGN' rather than the
  8343. 'TYPE_SIZE' and 'TYPE_ALIGN' given by the 'TREE_TYPE', since
  8344. special attributes may have been applied to the variable to give it
  8345. a particular size and alignment. You may use the predicates
  8346. 'DECL_THIS_STATIC' or 'DECL_THIS_EXTERN' to test whether the
  8347. storage class specifiers 'static' or 'extern' were used to declare
  8348. a variable.
  8349. If this variable is initialized (but does not require a
  8350. constructor), the 'DECL_INITIAL' will be an expression for the
  8351. initializer. The initializer should be evaluated, and a bitwise
  8352. copy into the variable performed. If the 'DECL_INITIAL' is the
  8353. 'error_mark_node', there is an initializer, but it is given by an
  8354. explicit statement later in the code; no bitwise copy is required.
  8355. GCC provides an extension that allows either automatic variables,
  8356. or global variables, to be placed in particular registers. This
  8357. extension is being used for a particular 'VAR_DECL' if
  8358. 'DECL_REGISTER' holds for the 'VAR_DECL', and if
  8359. 'DECL_ASSEMBLER_NAME' is not equal to 'DECL_NAME'. In that case,
  8360. 'DECL_ASSEMBLER_NAME' is the name of the register into which the
  8361. variable will be placed.
  8362. 'PARM_DECL'
  8363. Used to represent a parameter to a function. Treat these nodes
  8364. similarly to 'VAR_DECL' nodes. These nodes only appear in the
  8365. 'DECL_ARGUMENTS' for a 'FUNCTION_DECL'.
  8366. The 'DECL_ARG_TYPE' for a 'PARM_DECL' is the type that will
  8367. actually be used when a value is passed to this function. It may
  8368. be a wider type than the 'TREE_TYPE' of the parameter; for example,
  8369. the ordinary type might be 'short' while the 'DECL_ARG_TYPE' is
  8370. 'int'.
  8371. 'DEBUG_EXPR_DECL'
  8372. Used to represent an anonymous debug-information temporary created
  8373. to hold an expression as it is optimized away, so that its value
  8374. can be referenced in debug bind statements.
  8375. 'FIELD_DECL'
  8376. These nodes represent non-static data members. The 'DECL_SIZE' and
  8377. 'DECL_ALIGN' behave as for 'VAR_DECL' nodes. The position of the
  8378. field within the parent record is specified by a combination of
  8379. three attributes. 'DECL_FIELD_OFFSET' is the position, counting in
  8380. bytes, of the 'DECL_OFFSET_ALIGN'-bit sized word containing the bit
  8381. of the field closest to the beginning of the structure.
  8382. 'DECL_FIELD_BIT_OFFSET' is the bit offset of the first bit of the
  8383. field within this word; this may be nonzero even for fields that
  8384. are not bit-fields, since 'DECL_OFFSET_ALIGN' may be greater than
  8385. the natural alignment of the field's type.
  8386. If 'DECL_C_BIT_FIELD' holds, this field is a bit-field. In a
  8387. bit-field, 'DECL_BIT_FIELD_TYPE' also contains the type that was
  8388. originally specified for it, while DECL_TYPE may be a modified type
  8389. with lesser precision, according to the size of the bit field.
  8390. 'NAMESPACE_DECL'
  8391. Namespaces provide a name hierarchy for other declarations. They
  8392. appear in the 'DECL_CONTEXT' of other '_DECL' nodes.
  8393. 
  8394. File: gccint.info, Node: Internal structure, Prev: Working with declarations, Up: Declarations
  8395. 11.4.2 Internal structure
  8396. -------------------------
  8397. 'DECL' nodes are represented internally as a hierarchy of structures.
  8398. * Menu:
  8399. * Current structure hierarchy:: The current DECL node structure
  8400. hierarchy.
  8401. * Adding new DECL node types:: How to add a new DECL node to a
  8402. frontend.
  8403. 
  8404. File: gccint.info, Node: Current structure hierarchy, Next: Adding new DECL node types, Up: Internal structure
  8405. 11.4.2.1 Current structure hierarchy
  8406. ....................................
  8407. 'struct tree_decl_minimal'
  8408. This is the minimal structure to inherit from in order for common
  8409. 'DECL' macros to work. The fields it contains are a unique ID,
  8410. source location, context, and name.
  8411. 'struct tree_decl_common'
  8412. This structure inherits from 'struct tree_decl_minimal'. It
  8413. contains fields that most 'DECL' nodes need, such as a field to
  8414. store alignment, machine mode, size, and attributes.
  8415. 'struct tree_field_decl'
  8416. This structure inherits from 'struct tree_decl_common'. It is used
  8417. to represent 'FIELD_DECL'.
  8418. 'struct tree_label_decl'
  8419. This structure inherits from 'struct tree_decl_common'. It is used
  8420. to represent 'LABEL_DECL'.
  8421. 'struct tree_translation_unit_decl'
  8422. This structure inherits from 'struct tree_decl_common'. It is used
  8423. to represent 'TRANSLATION_UNIT_DECL'.
  8424. 'struct tree_decl_with_rtl'
  8425. This structure inherits from 'struct tree_decl_common'. It
  8426. contains a field to store the low-level RTL associated with a
  8427. 'DECL' node.
  8428. 'struct tree_result_decl'
  8429. This structure inherits from 'struct tree_decl_with_rtl'. It is
  8430. used to represent 'RESULT_DECL'.
  8431. 'struct tree_const_decl'
  8432. This structure inherits from 'struct tree_decl_with_rtl'. It is
  8433. used to represent 'CONST_DECL'.
  8434. 'struct tree_parm_decl'
  8435. This structure inherits from 'struct tree_decl_with_rtl'. It is
  8436. used to represent 'PARM_DECL'.
  8437. 'struct tree_decl_with_vis'
  8438. This structure inherits from 'struct tree_decl_with_rtl'. It
  8439. contains fields necessary to store visibility information, as well
  8440. as a section name and assembler name.
  8441. 'struct tree_var_decl'
  8442. This structure inherits from 'struct tree_decl_with_vis'. It is
  8443. used to represent 'VAR_DECL'.
  8444. 'struct tree_function_decl'
  8445. This structure inherits from 'struct tree_decl_with_vis'. It is
  8446. used to represent 'FUNCTION_DECL'.
  8447. 
  8448. File: gccint.info, Node: Adding new DECL node types, Prev: Current structure hierarchy, Up: Internal structure
  8449. 11.4.2.2 Adding new DECL node types
  8450. ...................................
  8451. Adding a new 'DECL' tree consists of the following steps
  8452. Add a new tree code for the 'DECL' node
  8453. For language specific 'DECL' nodes, there is a '.def' file in each
  8454. frontend directory where the tree code should be added. For 'DECL'
  8455. nodes that are part of the middle-end, the code should be added to
  8456. 'tree.def'.
  8457. Create a new structure type for the 'DECL' node
  8458. These structures should inherit from one of the existing structures
  8459. in the language hierarchy by using that structure as the first
  8460. member.
  8461. struct tree_foo_decl
  8462. {
  8463. struct tree_decl_with_vis common;
  8464. }
  8465. Would create a structure name 'tree_foo_decl' that inherits from
  8466. 'struct tree_decl_with_vis'.
  8467. For language specific 'DECL' nodes, this new structure type should
  8468. go in the appropriate '.h' file. For 'DECL' nodes that are part of
  8469. the middle-end, the structure type should go in 'tree.h'.
  8470. Add a member to the tree structure enumerator for the node
  8471. For garbage collection and dynamic checking purposes, each 'DECL'
  8472. node structure type is required to have a unique enumerator value
  8473. specified with it. For language specific 'DECL' nodes, this new
  8474. enumerator value should go in the appropriate '.def' file. For
  8475. 'DECL' nodes that are part of the middle-end, the enumerator values
  8476. are specified in 'treestruct.def'.
  8477. Update 'union tree_node'
  8478. In order to make your new structure type usable, it must be added
  8479. to 'union tree_node'. For language specific 'DECL' nodes, a new
  8480. entry should be added to the appropriate '.h' file of the form
  8481. struct tree_foo_decl GTY ((tag ("TS_VAR_DECL"))) foo_decl;
  8482. For 'DECL' nodes that are part of the middle-end, the additional
  8483. member goes directly into 'union tree_node' in 'tree.h'.
  8484. Update dynamic checking info
  8485. In order to be able to check whether accessing a named portion of
  8486. 'union tree_node' is legal, and whether a certain 'DECL' node
  8487. contains one of the enumerated 'DECL' node structures in the
  8488. hierarchy, a simple lookup table is used. This lookup table needs
  8489. to be kept up to date with the tree structure hierarchy, or else
  8490. checking and containment macros will fail inappropriately.
  8491. For language specific 'DECL' nodes, their is an 'init_ts' function
  8492. in an appropriate '.c' file, which initializes the lookup table.
  8493. Code setting up the table for new 'DECL' nodes should be added
  8494. there. For each 'DECL' tree code and enumerator value representing
  8495. a member of the inheritance hierarchy, the table should contain 1
  8496. if that tree code inherits (directly or indirectly) from that
  8497. member. Thus, a 'FOO_DECL' node derived from 'struct
  8498. decl_with_rtl', and enumerator value 'TS_FOO_DECL', would be set up
  8499. as follows
  8500. tree_contains_struct[FOO_DECL][TS_FOO_DECL] = 1;
  8501. tree_contains_struct[FOO_DECL][TS_DECL_WRTL] = 1;
  8502. tree_contains_struct[FOO_DECL][TS_DECL_COMMON] = 1;
  8503. tree_contains_struct[FOO_DECL][TS_DECL_MINIMAL] = 1;
  8504. For 'DECL' nodes that are part of the middle-end, the setup code
  8505. goes into 'tree.c'.
  8506. Add macros to access any new fields and flags
  8507. Each added field or flag should have a macro that is used to access
  8508. it, that performs appropriate checking to ensure only the right
  8509. type of 'DECL' nodes access the field.
  8510. These macros generally take the following form
  8511. #define FOO_DECL_FIELDNAME(NODE) FOO_DECL_CHECK(NODE)->foo_decl.fieldname
  8512. However, if the structure is simply a base class for further
  8513. structures, something like the following should be used
  8514. #define BASE_STRUCT_CHECK(T) CONTAINS_STRUCT_CHECK(T, TS_BASE_STRUCT)
  8515. #define BASE_STRUCT_FIELDNAME(NODE) \
  8516. (BASE_STRUCT_CHECK(NODE)->base_struct.fieldname
  8517. Reading them from the generated 'all-tree.def' file (which in turn
  8518. includes all the 'tree.def' files), 'gencheck.c' is used during
  8519. GCC's build to generate the '*_CHECK' macros for all tree codes.
  8520. 
  8521. File: gccint.info, Node: Attributes, Next: Expression trees, Prev: Declarations, Up: GENERIC
  8522. 11.5 Attributes in trees
  8523. ========================
  8524. Attributes, as specified using the '__attribute__' keyword, are
  8525. represented internally as a 'TREE_LIST'. The 'TREE_PURPOSE' is the name
  8526. of the attribute, as an 'IDENTIFIER_NODE'. The 'TREE_VALUE' is a
  8527. 'TREE_LIST' of the arguments of the attribute, if any, or 'NULL_TREE' if
  8528. there are no arguments; the arguments are stored as the 'TREE_VALUE' of
  8529. successive entries in the list, and may be identifiers or expressions.
  8530. The 'TREE_CHAIN' of the attribute is the next attribute in a list of
  8531. attributes applying to the same declaration or type, or 'NULL_TREE' if
  8532. there are no further attributes in the list.
  8533. Attributes may be attached to declarations and to types; these
  8534. attributes may be accessed with the following macros. All attributes
  8535. are stored in this way, and many also cause other changes to the
  8536. declaration or type or to other internal compiler data structures.
  8537. -- Tree Macro: tree DECL_ATTRIBUTES (tree DECL)
  8538. This macro returns the attributes on the declaration DECL.
  8539. -- Tree Macro: tree TYPE_ATTRIBUTES (tree TYPE)
  8540. This macro returns the attributes on the type TYPE.
  8541. 
  8542. File: gccint.info, Node: Expression trees, Next: Statements, Prev: Attributes, Up: GENERIC
  8543. 11.6 Expressions
  8544. ================
  8545. The internal representation for expressions is for the most part quite
  8546. straightforward. However, there are a few facts that one must bear in
  8547. mind. In particular, the expression "tree" is actually a directed
  8548. acyclic graph. (For example there may be many references to the integer
  8549. constant zero throughout the source program; many of these will be
  8550. represented by the same expression node.) You should not rely on
  8551. certain kinds of node being shared, nor should you rely on certain kinds
  8552. of nodes being unshared.
  8553. The following macros can be used with all expression nodes:
  8554. 'TREE_TYPE'
  8555. Returns the type of the expression. This value may not be
  8556. precisely the same type that would be given the expression in the
  8557. original program.
  8558. In what follows, some nodes that one might expect to always have type
  8559. 'bool' are documented to have either integral or boolean type. At some
  8560. point in the future, the C front end may also make use of this same
  8561. intermediate representation, and at this point these nodes will
  8562. certainly have integral type. The previous sentence is not meant to
  8563. imply that the C++ front end does not or will not give these nodes
  8564. integral type.
  8565. Below, we list the various kinds of expression nodes. Except where
  8566. noted otherwise, the operands to an expression are accessed using the
  8567. 'TREE_OPERAND' macro. For example, to access the first operand to a
  8568. binary plus expression 'expr', use:
  8569. TREE_OPERAND (expr, 0)
  8570. As this example indicates, the operands are zero-indexed.
  8571. * Menu:
  8572. * Constants: Constant expressions.
  8573. * Storage References::
  8574. * Unary and Binary Expressions::
  8575. * Vectors::
  8576. 
  8577. File: gccint.info, Node: Constant expressions, Next: Storage References, Up: Expression trees
  8578. 11.6.1 Constant expressions
  8579. ---------------------------
  8580. The table below begins with constants, moves on to unary expressions,
  8581. then proceeds to binary expressions, and concludes with various other
  8582. kinds of expressions:
  8583. 'INTEGER_CST'
  8584. These nodes represent integer constants. Note that the type of
  8585. these constants is obtained with 'TREE_TYPE'; they are not always
  8586. of type 'int'. In particular, 'char' constants are represented
  8587. with 'INTEGER_CST' nodes. The value of the integer constant 'e' is
  8588. represented in an array of HOST_WIDE_INT. There are enough elements
  8589. in the array to represent the value without taking extra elements
  8590. for redundant 0s or -1. The number of elements used to represent
  8591. 'e' is available via 'TREE_INT_CST_NUNITS'. Element 'i' can be
  8592. extracted by using 'TREE_INT_CST_ELT (e, i)'. 'TREE_INT_CST_LOW'
  8593. is a shorthand for 'TREE_INT_CST_ELT (e, 0)'.
  8594. The functions 'tree_fits_shwi_p' and 'tree_fits_uhwi_p' can be used
  8595. to tell if the value is small enough to fit in a signed
  8596. HOST_WIDE_INT or an unsigned HOST_WIDE_INT respectively. The value
  8597. can then be extracted using 'tree_to_shwi' and 'tree_to_uhwi'.
  8598. 'REAL_CST'
  8599. FIXME: Talk about how to obtain representations of this constant,
  8600. do comparisons, and so forth.
  8601. 'FIXED_CST'
  8602. These nodes represent fixed-point constants. The type of these
  8603. constants is obtained with 'TREE_TYPE'. 'TREE_FIXED_CST_PTR'
  8604. points to a 'struct fixed_value'; 'TREE_FIXED_CST' returns the
  8605. structure itself. 'struct fixed_value' contains 'data' with the
  8606. size of two 'HOST_BITS_PER_WIDE_INT' and 'mode' as the associated
  8607. fixed-point machine mode for 'data'.
  8608. 'COMPLEX_CST'
  8609. These nodes are used to represent complex number constants, that is
  8610. a '__complex__' whose parts are constant nodes. The
  8611. 'TREE_REALPART' and 'TREE_IMAGPART' return the real and the
  8612. imaginary parts respectively.
  8613. 'VECTOR_CST'
  8614. These nodes are used to represent vector constants. Each vector
  8615. constant V is treated as a specific instance of an arbitrary-length
  8616. sequence that itself contains 'VECTOR_CST_NPATTERNS (V)'
  8617. interleaved patterns. Each pattern has the form:
  8618. { BASE0, BASE1, BASE1 + STEP, BASE1 + STEP * 2, ... }
  8619. The first three elements in each pattern are enough to determine
  8620. the values of the other elements. However, if all STEPs are zero,
  8621. only the first two elements are needed. If in addition each BASE1
  8622. is equal to the corresponding BASE0, only the first element in each
  8623. pattern is needed. The number of encoded elements per pattern is
  8624. given by 'VECTOR_CST_NELTS_PER_PATTERN (V)'.
  8625. For example, the constant:
  8626. { 0, 1, 2, 6, 3, 8, 4, 10, 5, 12, 6, 14, 7, 16, 8, 18 }
  8627. is interpreted as an interleaving of the sequences:
  8628. { 0, 2, 3, 4, 5, 6, 7, 8 }
  8629. { 1, 6, 8, 10, 12, 14, 16, 18 }
  8630. where the sequences are represented by the following patterns:
  8631. BASE0 == 0, BASE1 == 2, STEP == 1
  8632. BASE0 == 1, BASE1 == 6, STEP == 2
  8633. In this case:
  8634. VECTOR_CST_NPATTERNS (V) == 2
  8635. VECTOR_CST_NELTS_PER_PATTERN (V) == 3
  8636. The vector is therefore encoded using the first 6 elements ('{ 0,
  8637. 1, 2, 6, 3, 8 }'), with the remaining 10 elements being implicit
  8638. extensions of them.
  8639. Sometimes this scheme can create two possible encodings of the same
  8640. vector. For example { 0, 1 } could be seen as two patterns with
  8641. one element each or one pattern with two elements (BASE0 and
  8642. BASE1). The canonical encoding is always the one with the fewest
  8643. patterns or (if both encodings have the same number of petterns)
  8644. the one with the fewest encoded elements.
  8645. 'vector_cst_encoding_nelts (V)' gives the total number of encoded
  8646. elements in V, which is 6 in the example above.
  8647. 'VECTOR_CST_ENCODED_ELTS (V)' gives a pointer to the elements
  8648. encoded in V and 'VECTOR_CST_ENCODED_ELT (V, I)' accesses the value
  8649. of encoded element I.
  8650. 'VECTOR_CST_DUPLICATE_P (V)' is true if V simply contains repeated
  8651. instances of 'VECTOR_CST_NPATTERNS (V)' values. This is a
  8652. shorthand for testing 'VECTOR_CST_NELTS_PER_PATTERN (V) == 1'.
  8653. 'VECTOR_CST_STEPPED_P (V)' is true if at least one pattern in V has
  8654. a nonzero step. This is a shorthand for testing
  8655. 'VECTOR_CST_NELTS_PER_PATTERN (V) == 3'.
  8656. The utility function 'vector_cst_elt' gives the value of an
  8657. arbitrary index as a 'tree'. 'vector_cst_int_elt' gives the same
  8658. value as a 'wide_int'.
  8659. 'STRING_CST'
  8660. These nodes represent string-constants. The 'TREE_STRING_LENGTH'
  8661. returns the length of the string, as an 'int'. The
  8662. 'TREE_STRING_POINTER' is a 'char*' containing the string itself.
  8663. The string may not be 'NUL'-terminated, and it may contain embedded
  8664. 'NUL' characters. Therefore, the 'TREE_STRING_LENGTH' includes the
  8665. trailing 'NUL' if it is present.
  8666. For wide string constants, the 'TREE_STRING_LENGTH' is the number
  8667. of bytes in the string, and the 'TREE_STRING_POINTER' points to an
  8668. array of the bytes of the string, as represented on the target
  8669. system (that is, as integers in the target endianness). Wide and
  8670. non-wide string constants are distinguished only by the 'TREE_TYPE'
  8671. of the 'STRING_CST'.
  8672. FIXME: The formats of string constants are not well-defined when
  8673. the target system bytes are not the same width as host system
  8674. bytes.
  8675. 'POLY_INT_CST'
  8676. These nodes represent invariants that depend on some
  8677. target-specific runtime parameters. They consist of
  8678. 'NUM_POLY_INT_COEFFS' coefficients, with the first coefficient
  8679. being the constant term and the others being multipliers that are
  8680. applied to the runtime parameters.
  8681. 'POLY_INT_CST_ELT (X, I)' references coefficient number I of
  8682. 'POLY_INT_CST' node X. Each coefficient is an 'INTEGER_CST'.
  8683. 
  8684. File: gccint.info, Node: Storage References, Next: Unary and Binary Expressions, Prev: Constant expressions, Up: Expression trees
  8685. 11.6.2 References to storage
  8686. ----------------------------
  8687. 'ARRAY_REF'
  8688. These nodes represent array accesses. The first operand is the
  8689. array; the second is the index. To calculate the address of the
  8690. memory accessed, you must scale the index by the size of the type
  8691. of the array elements. The type of these expressions must be the
  8692. type of a component of the array. The third and fourth operands
  8693. are used after gimplification to represent the lower bound and
  8694. component size but should not be used directly; call
  8695. 'array_ref_low_bound' and 'array_ref_element_size' instead.
  8696. 'ARRAY_RANGE_REF'
  8697. These nodes represent access to a range (or "slice") of an array.
  8698. The operands are the same as that for 'ARRAY_REF' and have the same
  8699. meanings. The type of these expressions must be an array whose
  8700. component type is the same as that of the first operand. The range
  8701. of that array type determines the amount of data these expressions
  8702. access.
  8703. 'TARGET_MEM_REF'
  8704. These nodes represent memory accesses whose address directly map to
  8705. an addressing mode of the target architecture. The first argument
  8706. is 'TMR_SYMBOL' and must be a 'VAR_DECL' of an object with a fixed
  8707. address. The second argument is 'TMR_BASE' and the third one is
  8708. 'TMR_INDEX'. The fourth argument is 'TMR_STEP' and must be an
  8709. 'INTEGER_CST'. The fifth argument is 'TMR_OFFSET' and must be an
  8710. 'INTEGER_CST'. Any of the arguments may be NULL if the appropriate
  8711. component does not appear in the address. Address of the
  8712. 'TARGET_MEM_REF' is determined in the following way.
  8713. &TMR_SYMBOL + TMR_BASE + TMR_INDEX * TMR_STEP + TMR_OFFSET
  8714. The sixth argument is the reference to the original memory access,
  8715. which is preserved for the purposes of the RTL alias analysis. The
  8716. seventh argument is a tag representing the results of tree level
  8717. alias analysis.
  8718. 'ADDR_EXPR'
  8719. These nodes are used to represent the address of an object. (These
  8720. expressions will always have pointer or reference type.) The
  8721. operand may be another expression, or it may be a declaration.
  8722. As an extension, GCC allows users to take the address of a label.
  8723. In this case, the operand of the 'ADDR_EXPR' will be a
  8724. 'LABEL_DECL'. The type of such an expression is 'void*'.
  8725. If the object addressed is not an lvalue, a temporary is created,
  8726. and the address of the temporary is used.
  8727. 'INDIRECT_REF'
  8728. These nodes are used to represent the object pointed to by a
  8729. pointer. The operand is the pointer being dereferenced; it will
  8730. always have pointer or reference type.
  8731. 'MEM_REF'
  8732. These nodes are used to represent the object pointed to by a
  8733. pointer offset by a constant. The first operand is the pointer
  8734. being dereferenced; it will always have pointer or reference type.
  8735. The second operand is a pointer constant. Its type is specifying
  8736. the type to be used for type-based alias analysis.
  8737. 'COMPONENT_REF'
  8738. These nodes represent non-static data member accesses. The first
  8739. operand is the object (rather than a pointer to it); the second
  8740. operand is the 'FIELD_DECL' for the data member. The third operand
  8741. represents the byte offset of the field, but should not be used
  8742. directly; call 'component_ref_field_offset' instead.
  8743. 
  8744. File: gccint.info, Node: Unary and Binary Expressions, Next: Vectors, Prev: Storage References, Up: Expression trees
  8745. 11.6.3 Unary and Binary Expressions
  8746. -----------------------------------
  8747. 'NEGATE_EXPR'
  8748. These nodes represent unary negation of the single operand, for
  8749. both integer and floating-point types. The type of negation can be
  8750. determined by looking at the type of the expression.
  8751. The behavior of this operation on signed arithmetic overflow is
  8752. controlled by the 'flag_wrapv' and 'flag_trapv' variables.
  8753. 'ABS_EXPR'
  8754. These nodes represent the absolute value of the single operand, for
  8755. both integer and floating-point types. This is typically used to
  8756. implement the 'abs', 'labs' and 'llabs' builtins for integer types,
  8757. and the 'fabs', 'fabsf' and 'fabsl' builtins for floating point
  8758. types. The type of abs operation can be determined by looking at
  8759. the type of the expression.
  8760. This node is not used for complex types. To represent the modulus
  8761. or complex abs of a complex value, use the 'BUILT_IN_CABS',
  8762. 'BUILT_IN_CABSF' or 'BUILT_IN_CABSL' builtins, as used to implement
  8763. the C99 'cabs', 'cabsf' and 'cabsl' built-in functions.
  8764. 'ABSU_EXPR'
  8765. These nodes represent the absolute value of the single operand in
  8766. equivalent unsigned type such that 'ABSU_EXPR' of 'TYPE_MIN' is
  8767. well defined.
  8768. 'BIT_NOT_EXPR'
  8769. These nodes represent bitwise complement, and will always have
  8770. integral type. The only operand is the value to be complemented.
  8771. 'TRUTH_NOT_EXPR'
  8772. These nodes represent logical negation, and will always have
  8773. integral (or boolean) type. The operand is the value being
  8774. negated. The type of the operand and that of the result are always
  8775. of 'BOOLEAN_TYPE' or 'INTEGER_TYPE'.
  8776. 'PREDECREMENT_EXPR'
  8777. 'PREINCREMENT_EXPR'
  8778. 'POSTDECREMENT_EXPR'
  8779. 'POSTINCREMENT_EXPR'
  8780. These nodes represent increment and decrement expressions. The
  8781. value of the single operand is computed, and the operand
  8782. incremented or decremented. In the case of 'PREDECREMENT_EXPR' and
  8783. 'PREINCREMENT_EXPR', the value of the expression is the value
  8784. resulting after the increment or decrement; in the case of
  8785. 'POSTDECREMENT_EXPR' and 'POSTINCREMENT_EXPR' is the value before
  8786. the increment or decrement occurs. The type of the operand, like
  8787. that of the result, will be either integral, boolean, or
  8788. floating-point.
  8789. 'FIX_TRUNC_EXPR'
  8790. These nodes represent conversion of a floating-point value to an
  8791. integer. The single operand will have a floating-point type, while
  8792. the complete expression will have an integral (or boolean) type.
  8793. The operand is rounded towards zero.
  8794. 'FLOAT_EXPR'
  8795. These nodes represent conversion of an integral (or boolean) value
  8796. to a floating-point value. The single operand will have integral
  8797. type, while the complete expression will have a floating-point
  8798. type.
  8799. FIXME: How is the operand supposed to be rounded? Is this
  8800. dependent on '-mieee'?
  8801. 'COMPLEX_EXPR'
  8802. These nodes are used to represent complex numbers constructed from
  8803. two expressions of the same (integer or real) type. The first
  8804. operand is the real part and the second operand is the imaginary
  8805. part.
  8806. 'CONJ_EXPR'
  8807. These nodes represent the conjugate of their operand.
  8808. 'REALPART_EXPR'
  8809. 'IMAGPART_EXPR'
  8810. These nodes represent respectively the real and the imaginary parts
  8811. of complex numbers (their sole argument).
  8812. 'NON_LVALUE_EXPR'
  8813. These nodes indicate that their one and only operand is not an
  8814. lvalue. A back end can treat these identically to the single
  8815. operand.
  8816. 'NOP_EXPR'
  8817. These nodes are used to represent conversions that do not require
  8818. any code-generation. For example, conversion of a 'char*' to an
  8819. 'int*' does not require any code be generated; such a conversion is
  8820. represented by a 'NOP_EXPR'. The single operand is the expression
  8821. to be converted. The conversion from a pointer to a reference is
  8822. also represented with a 'NOP_EXPR'.
  8823. 'CONVERT_EXPR'
  8824. These nodes are similar to 'NOP_EXPR's, but are used in those
  8825. situations where code may need to be generated. For example, if an
  8826. 'int*' is converted to an 'int' code may need to be generated on
  8827. some platforms. These nodes are never used for C++-specific
  8828. conversions, like conversions between pointers to different classes
  8829. in an inheritance hierarchy. Any adjustments that need to be made
  8830. in such cases are always indicated explicitly. Similarly, a
  8831. user-defined conversion is never represented by a 'CONVERT_EXPR';
  8832. instead, the function calls are made explicit.
  8833. 'FIXED_CONVERT_EXPR'
  8834. These nodes are used to represent conversions that involve
  8835. fixed-point values. For example, from a fixed-point value to
  8836. another fixed-point value, from an integer to a fixed-point value,
  8837. from a fixed-point value to an integer, from a floating-point value
  8838. to a fixed-point value, or from a fixed-point value to a
  8839. floating-point value.
  8840. 'LSHIFT_EXPR'
  8841. 'RSHIFT_EXPR'
  8842. These nodes represent left and right shifts, respectively. The
  8843. first operand is the value to shift; it will always be of integral
  8844. type. The second operand is an expression for the number of bits
  8845. by which to shift. Right shift should be treated as arithmetic,
  8846. i.e., the high-order bits should be zero-filled when the expression
  8847. has unsigned type and filled with the sign bit when the expression
  8848. has signed type. Note that the result is undefined if the second
  8849. operand is larger than or equal to the first operand's type size.
  8850. Unlike most nodes, these can have a vector as first operand and a
  8851. scalar as second operand.
  8852. 'BIT_IOR_EXPR'
  8853. 'BIT_XOR_EXPR'
  8854. 'BIT_AND_EXPR'
  8855. These nodes represent bitwise inclusive or, bitwise exclusive or,
  8856. and bitwise and, respectively. Both operands will always have
  8857. integral type.
  8858. 'TRUTH_ANDIF_EXPR'
  8859. 'TRUTH_ORIF_EXPR'
  8860. These nodes represent logical "and" and logical "or", respectively.
  8861. These operators are not strict; i.e., the second operand is
  8862. evaluated only if the value of the expression is not determined by
  8863. evaluation of the first operand. The type of the operands and that
  8864. of the result are always of 'BOOLEAN_TYPE' or 'INTEGER_TYPE'.
  8865. 'TRUTH_AND_EXPR'
  8866. 'TRUTH_OR_EXPR'
  8867. 'TRUTH_XOR_EXPR'
  8868. These nodes represent logical and, logical or, and logical
  8869. exclusive or. They are strict; both arguments are always
  8870. evaluated. There are no corresponding operators in C or C++, but
  8871. the front end will sometimes generate these expressions anyhow, if
  8872. it can tell that strictness does not matter. The type of the
  8873. operands and that of the result are always of 'BOOLEAN_TYPE' or
  8874. 'INTEGER_TYPE'.
  8875. 'POINTER_PLUS_EXPR'
  8876. This node represents pointer arithmetic. The first operand is
  8877. always a pointer/reference type. The second operand is always an
  8878. unsigned integer type compatible with sizetype. This and
  8879. POINTER_DIFF_EXPR are the only binary arithmetic operators that can
  8880. operate on pointer types.
  8881. 'POINTER_DIFF_EXPR'
  8882. This node represents pointer subtraction. The two operands always
  8883. have pointer/reference type. It returns a signed integer of the
  8884. same precision as the pointers. The behavior is undefined if the
  8885. difference of the two pointers, seen as infinite precision
  8886. non-negative integers, does not fit in the result type. The result
  8887. does not depend on the pointer type, it is not divided by the size
  8888. of the pointed-to type.
  8889. 'PLUS_EXPR'
  8890. 'MINUS_EXPR'
  8891. 'MULT_EXPR'
  8892. These nodes represent various binary arithmetic operations.
  8893. Respectively, these operations are addition, subtraction (of the
  8894. second operand from the first) and multiplication. Their operands
  8895. may have either integral or floating type, but there will never be
  8896. case in which one operand is of floating type and the other is of
  8897. integral type.
  8898. The behavior of these operations on signed arithmetic overflow is
  8899. controlled by the 'flag_wrapv' and 'flag_trapv' variables.
  8900. 'MULT_HIGHPART_EXPR'
  8901. This node represents the "high-part" of a widening multiplication.
  8902. For an integral type with B bits of precision, the result is the
  8903. most significant B bits of the full 2B product.
  8904. 'RDIV_EXPR'
  8905. This node represents a floating point division operation.
  8906. 'TRUNC_DIV_EXPR'
  8907. 'FLOOR_DIV_EXPR'
  8908. 'CEIL_DIV_EXPR'
  8909. 'ROUND_DIV_EXPR'
  8910. These nodes represent integer division operations that return an
  8911. integer result. 'TRUNC_DIV_EXPR' rounds towards zero,
  8912. 'FLOOR_DIV_EXPR' rounds towards negative infinity, 'CEIL_DIV_EXPR'
  8913. rounds towards positive infinity and 'ROUND_DIV_EXPR' rounds to the
  8914. closest integer. Integer division in C and C++ is truncating, i.e.
  8915. 'TRUNC_DIV_EXPR'.
  8916. The behavior of these operations on signed arithmetic overflow,
  8917. when dividing the minimum signed integer by minus one, is
  8918. controlled by the 'flag_wrapv' and 'flag_trapv' variables.
  8919. 'TRUNC_MOD_EXPR'
  8920. 'FLOOR_MOD_EXPR'
  8921. 'CEIL_MOD_EXPR'
  8922. 'ROUND_MOD_EXPR'
  8923. These nodes represent the integer remainder or modulus operation.
  8924. The integer modulus of two operands 'a' and 'b' is defined as 'a -
  8925. (a/b)*b' where the division calculated using the corresponding
  8926. division operator. Hence for 'TRUNC_MOD_EXPR' this definition
  8927. assumes division using truncation towards zero, i.e.
  8928. 'TRUNC_DIV_EXPR'. Integer remainder in C and C++ uses truncating
  8929. division, i.e. 'TRUNC_MOD_EXPR'.
  8930. 'EXACT_DIV_EXPR'
  8931. The 'EXACT_DIV_EXPR' code is used to represent integer divisions
  8932. where the numerator is known to be an exact multiple of the
  8933. denominator. This allows the backend to choose between the faster
  8934. of 'TRUNC_DIV_EXPR', 'CEIL_DIV_EXPR' and 'FLOOR_DIV_EXPR' for the
  8935. current target.
  8936. 'LT_EXPR'
  8937. 'LE_EXPR'
  8938. 'GT_EXPR'
  8939. 'GE_EXPR'
  8940. 'LTGT_EXPR'
  8941. 'EQ_EXPR'
  8942. 'NE_EXPR'
  8943. These nodes represent the less than, less than or equal to, greater
  8944. than, greater than or equal to, less or greater than, equal, and
  8945. not equal comparison operators. The first and second operands will
  8946. either be both of integral type, both of floating type or both of
  8947. vector type, except for LTGT_EXPR where they will only be both of
  8948. floating type. The result type of these expressions will always be
  8949. of integral, boolean or signed integral vector type. These
  8950. operations return the result type's zero value for false, the
  8951. result type's one value for true, and a vector whose elements are
  8952. zero (false) or minus one (true) for vectors.
  8953. For floating point comparisons, if we honor IEEE NaNs and either
  8954. operand is NaN, then 'NE_EXPR' always returns true and the
  8955. remaining operators always return false. On some targets,
  8956. comparisons against an IEEE NaN, other than equality and
  8957. inequality, may generate a floating-point exception.
  8958. 'ORDERED_EXPR'
  8959. 'UNORDERED_EXPR'
  8960. These nodes represent non-trapping ordered and unordered comparison
  8961. operators. These operations take two floating point operands and
  8962. determine whether they are ordered or unordered relative to each
  8963. other. If either operand is an IEEE NaN, their comparison is
  8964. defined to be unordered, otherwise the comparison is defined to be
  8965. ordered. The result type of these expressions will always be of
  8966. integral or boolean type. These operations return the result
  8967. type's zero value for false, and the result type's one value for
  8968. true.
  8969. 'UNLT_EXPR'
  8970. 'UNLE_EXPR'
  8971. 'UNGT_EXPR'
  8972. 'UNGE_EXPR'
  8973. 'UNEQ_EXPR'
  8974. These nodes represent the unordered comparison operators. These
  8975. operations take two floating point operands and determine whether
  8976. the operands are unordered or are less than, less than or equal to,
  8977. greater than, greater than or equal to, or equal respectively. For
  8978. example, 'UNLT_EXPR' returns true if either operand is an IEEE NaN
  8979. or the first operand is less than the second. All these operations
  8980. are guaranteed not to generate a floating point exception. The
  8981. result type of these expressions will always be of integral or
  8982. boolean type. These operations return the result type's zero value
  8983. for false, and the result type's one value for true.
  8984. 'MODIFY_EXPR'
  8985. These nodes represent assignment. The left-hand side is the first
  8986. operand; the right-hand side is the second operand. The left-hand
  8987. side will be a 'VAR_DECL', 'INDIRECT_REF', 'COMPONENT_REF', or
  8988. other lvalue.
  8989. These nodes are used to represent not only assignment with '=' but
  8990. also compound assignments (like '+='), by reduction to '='
  8991. assignment. In other words, the representation for 'i += 3' looks
  8992. just like that for 'i = i + 3'.
  8993. 'INIT_EXPR'
  8994. These nodes are just like 'MODIFY_EXPR', but are used only when a
  8995. variable is initialized, rather than assigned to subsequently.
  8996. This means that we can assume that the target of the initialization
  8997. is not used in computing its own value; any reference to the lhs in
  8998. computing the rhs is undefined.
  8999. 'COMPOUND_EXPR'
  9000. These nodes represent comma-expressions. The first operand is an
  9001. expression whose value is computed and thrown away prior to the
  9002. evaluation of the second operand. The value of the entire
  9003. expression is the value of the second operand.
  9004. 'COND_EXPR'
  9005. These nodes represent '?:' expressions. The first operand is of
  9006. boolean or integral type. If it evaluates to a nonzero value, the
  9007. second operand should be evaluated, and returned as the value of
  9008. the expression. Otherwise, the third operand is evaluated, and
  9009. returned as the value of the expression.
  9010. The second operand must have the same type as the entire
  9011. expression, unless it unconditionally throws an exception or calls
  9012. a noreturn function, in which case it should have void type. The
  9013. same constraints apply to the third operand. This allows array
  9014. bounds checks to be represented conveniently as '(i >= 0 && i < 10)
  9015. ? i : abort()'.
  9016. As a GNU extension, the C language front-ends allow the second
  9017. operand of the '?:' operator may be omitted in the source. For
  9018. example, 'x ? : 3' is equivalent to 'x ? x : 3', assuming that 'x'
  9019. is an expression without side effects. In the tree representation,
  9020. however, the second operand is always present, possibly protected
  9021. by 'SAVE_EXPR' if the first argument does cause side effects.
  9022. 'CALL_EXPR'
  9023. These nodes are used to represent calls to functions, including
  9024. non-static member functions. 'CALL_EXPR's are implemented as
  9025. expression nodes with a variable number of operands. Rather than
  9026. using 'TREE_OPERAND' to extract them, it is preferable to use the
  9027. specialized accessor macros and functions that operate specifically
  9028. on 'CALL_EXPR' nodes.
  9029. 'CALL_EXPR_FN' returns a pointer to the function to call; it is
  9030. always an expression whose type is a 'POINTER_TYPE'.
  9031. The number of arguments to the call is returned by
  9032. 'call_expr_nargs', while the arguments themselves can be accessed
  9033. with the 'CALL_EXPR_ARG' macro. The arguments are zero-indexed and
  9034. numbered left-to-right. You can iterate over the arguments using
  9035. 'FOR_EACH_CALL_EXPR_ARG', as in:
  9036. tree call, arg;
  9037. call_expr_arg_iterator iter;
  9038. FOR_EACH_CALL_EXPR_ARG (arg, iter, call)
  9039. /* arg is bound to successive arguments of call. */
  9040. ...;
  9041. For non-static member functions, there will be an operand
  9042. corresponding to the 'this' pointer. There will always be
  9043. expressions corresponding to all of the arguments, even if the
  9044. function is declared with default arguments and some arguments are
  9045. not explicitly provided at the call sites.
  9046. 'CALL_EXPR's also have a 'CALL_EXPR_STATIC_CHAIN' operand that is
  9047. used to implement nested functions. This operand is otherwise
  9048. null.
  9049. 'CLEANUP_POINT_EXPR'
  9050. These nodes represent full-expressions. The single operand is an
  9051. expression to evaluate. Any destructor calls engendered by the
  9052. creation of temporaries during the evaluation of that expression
  9053. should be performed immediately after the expression is evaluated.
  9054. 'CONSTRUCTOR'
  9055. These nodes represent the brace-enclosed initializers for a
  9056. structure or an array. They contain a sequence of component values
  9057. made out of a vector of constructor_elt, which is a ('INDEX',
  9058. 'VALUE') pair.
  9059. If the 'TREE_TYPE' of the 'CONSTRUCTOR' is a 'RECORD_TYPE',
  9060. 'UNION_TYPE' or 'QUAL_UNION_TYPE' then the 'INDEX' of each node in
  9061. the sequence will be a 'FIELD_DECL' and the 'VALUE' will be the
  9062. expression used to initialize that field.
  9063. If the 'TREE_TYPE' of the 'CONSTRUCTOR' is an 'ARRAY_TYPE', then
  9064. the 'INDEX' of each node in the sequence will be an 'INTEGER_CST'
  9065. or a 'RANGE_EXPR' of two 'INTEGER_CST's. A single 'INTEGER_CST'
  9066. indicates which element of the array is being assigned to. A
  9067. 'RANGE_EXPR' indicates an inclusive range of elements to
  9068. initialize. In both cases the 'VALUE' is the corresponding
  9069. initializer. It is re-evaluated for each element of a
  9070. 'RANGE_EXPR'. If the 'INDEX' is 'NULL_TREE', then the initializer
  9071. is for the next available array element.
  9072. In the front end, you should not depend on the fields appearing in
  9073. any particular order. However, in the middle end, fields must
  9074. appear in declaration order. You should not assume that all fields
  9075. will be represented. Unrepresented fields will be cleared
  9076. (zeroed), unless the CONSTRUCTOR_NO_CLEARING flag is set, in which
  9077. case their value becomes undefined.
  9078. 'COMPOUND_LITERAL_EXPR'
  9079. These nodes represent ISO C99 compound literals. The
  9080. 'COMPOUND_LITERAL_EXPR_DECL_EXPR' is a 'DECL_EXPR' containing an
  9081. anonymous 'VAR_DECL' for the unnamed object represented by the
  9082. compound literal; the 'DECL_INITIAL' of that 'VAR_DECL' is a
  9083. 'CONSTRUCTOR' representing the brace-enclosed list of initializers
  9084. in the compound literal. That anonymous 'VAR_DECL' can also be
  9085. accessed directly by the 'COMPOUND_LITERAL_EXPR_DECL' macro.
  9086. 'SAVE_EXPR'
  9087. A 'SAVE_EXPR' represents an expression (possibly involving side
  9088. effects) that is used more than once. The side effects should
  9089. occur only the first time the expression is evaluated. Subsequent
  9090. uses should just reuse the computed value. The first operand to
  9091. the 'SAVE_EXPR' is the expression to evaluate. The side effects
  9092. should be executed where the 'SAVE_EXPR' is first encountered in a
  9093. depth-first preorder traversal of the expression tree.
  9094. 'TARGET_EXPR'
  9095. A 'TARGET_EXPR' represents a temporary object. The first operand
  9096. is a 'VAR_DECL' for the temporary variable. The second operand is
  9097. the initializer for the temporary. The initializer is evaluated
  9098. and, if non-void, copied (bitwise) into the temporary. If the
  9099. initializer is void, that means that it will perform the
  9100. initialization itself.
  9101. Often, a 'TARGET_EXPR' occurs on the right-hand side of an
  9102. assignment, or as the second operand to a comma-expression which is
  9103. itself the right-hand side of an assignment, etc. In this case, we
  9104. say that the 'TARGET_EXPR' is "normal"; otherwise, we say it is
  9105. "orphaned". For a normal 'TARGET_EXPR' the temporary variable
  9106. should be treated as an alias for the left-hand side of the
  9107. assignment, rather than as a new temporary variable.
  9108. The third operand to the 'TARGET_EXPR', if present, is a
  9109. cleanup-expression (i.e., destructor call) for the temporary. If
  9110. this expression is orphaned, then this expression must be executed
  9111. when the statement containing this expression is complete. These
  9112. cleanups must always be executed in the order opposite to that in
  9113. which they were encountered. Note that if a temporary is created
  9114. on one branch of a conditional operator (i.e., in the second or
  9115. third operand to a 'COND_EXPR'), the cleanup must be run only if
  9116. that branch is actually executed.
  9117. 'VA_ARG_EXPR'
  9118. This node is used to implement support for the C/C++ variable
  9119. argument-list mechanism. It represents expressions like 'va_arg
  9120. (ap, type)'. Its 'TREE_TYPE' yields the tree representation for
  9121. 'type' and its sole argument yields the representation for 'ap'.
  9122. 'ANNOTATE_EXPR'
  9123. This node is used to attach markers to an expression. The first
  9124. operand is the annotated expression, the second is an 'INTEGER_CST'
  9125. with a value from 'enum annot_expr_kind', the third is an
  9126. 'INTEGER_CST'.
  9127. 
  9128. File: gccint.info, Node: Vectors, Prev: Unary and Binary Expressions, Up: Expression trees
  9129. 11.6.4 Vectors
  9130. --------------
  9131. 'VEC_DUPLICATE_EXPR'
  9132. This node has a single operand and represents a vector in which
  9133. every element is equal to that operand.
  9134. 'VEC_SERIES_EXPR'
  9135. This node represents a vector formed from a scalar base and step,
  9136. given as the first and second operands respectively. Element I of
  9137. the result is equal to 'BASE + I*STEP'.
  9138. This node is restricted to integral types, in order to avoid
  9139. specifying the rounding behavior for floating-point types.
  9140. 'VEC_LSHIFT_EXPR'
  9141. 'VEC_RSHIFT_EXPR'
  9142. These nodes represent whole vector left and right shifts,
  9143. respectively. The first operand is the vector to shift; it will
  9144. always be of vector type. The second operand is an expression for
  9145. the number of bits by which to shift. Note that the result is
  9146. undefined if the second operand is larger than or equal to the
  9147. first operand's type size.
  9148. 'VEC_WIDEN_MULT_HI_EXPR'
  9149. 'VEC_WIDEN_MULT_LO_EXPR'
  9150. These nodes represent widening vector multiplication of the high
  9151. and low parts of the two input vectors, respectively. Their
  9152. operands are vectors that contain the same number of elements ('N')
  9153. of the same integral type. The result is a vector that contains
  9154. half as many elements, of an integral type whose size is twice as
  9155. wide. In the case of 'VEC_WIDEN_MULT_HI_EXPR' the high 'N/2'
  9156. elements of the two vector are multiplied to produce the vector of
  9157. 'N/2' products. In the case of 'VEC_WIDEN_MULT_LO_EXPR' the low
  9158. 'N/2' elements of the two vector are multiplied to produce the
  9159. vector of 'N/2' products.
  9160. 'VEC_UNPACK_HI_EXPR'
  9161. 'VEC_UNPACK_LO_EXPR'
  9162. These nodes represent unpacking of the high and low parts of the
  9163. input vector, respectively. The single operand is a vector that
  9164. contains 'N' elements of the same integral or floating point type.
  9165. The result is a vector that contains half as many elements, of an
  9166. integral or floating point type whose size is twice as wide. In
  9167. the case of 'VEC_UNPACK_HI_EXPR' the high 'N/2' elements of the
  9168. vector are extracted and widened (promoted). In the case of
  9169. 'VEC_UNPACK_LO_EXPR' the low 'N/2' elements of the vector are
  9170. extracted and widened (promoted).
  9171. 'VEC_UNPACK_FLOAT_HI_EXPR'
  9172. 'VEC_UNPACK_FLOAT_LO_EXPR'
  9173. These nodes represent unpacking of the high and low parts of the
  9174. input vector, where the values are converted from fixed point to
  9175. floating point. The single operand is a vector that contains 'N'
  9176. elements of the same integral type. The result is a vector that
  9177. contains half as many elements of a floating point type whose size
  9178. is twice as wide. In the case of 'VEC_UNPACK_FLOAT_HI_EXPR' the
  9179. high 'N/2' elements of the vector are extracted, converted and
  9180. widened. In the case of 'VEC_UNPACK_FLOAT_LO_EXPR' the low 'N/2'
  9181. elements of the vector are extracted, converted and widened.
  9182. 'VEC_UNPACK_FIX_TRUNC_HI_EXPR'
  9183. 'VEC_UNPACK_FIX_TRUNC_LO_EXPR'
  9184. These nodes represent unpacking of the high and low parts of the
  9185. input vector, where the values are truncated from floating point to
  9186. fixed point. The single operand is a vector that contains 'N'
  9187. elements of the same floating point type. The result is a vector
  9188. that contains half as many elements of an integral type whose size
  9189. is twice as wide. In the case of 'VEC_UNPACK_FIX_TRUNC_HI_EXPR'
  9190. the high 'N/2' elements of the vector are extracted and converted
  9191. with truncation. In the case of 'VEC_UNPACK_FIX_TRUNC_LO_EXPR' the
  9192. low 'N/2' elements of the vector are extracted and converted with
  9193. truncation.
  9194. 'VEC_PACK_TRUNC_EXPR'
  9195. This node represents packing of truncated elements of the two input
  9196. vectors into the output vector. Input operands are vectors that
  9197. contain the same number of elements of the same integral or
  9198. floating point type. The result is a vector that contains twice as
  9199. many elements of an integral or floating point type whose size is
  9200. half as wide. The elements of the two vectors are demoted and
  9201. merged (concatenated) to form the output vector.
  9202. 'VEC_PACK_SAT_EXPR'
  9203. This node represents packing of elements of the two input vectors
  9204. into the output vector using saturation. Input operands are
  9205. vectors that contain the same number of elements of the same
  9206. integral type. The result is a vector that contains twice as many
  9207. elements of an integral type whose size is half as wide. The
  9208. elements of the two vectors are demoted and merged (concatenated)
  9209. to form the output vector.
  9210. 'VEC_PACK_FIX_TRUNC_EXPR'
  9211. This node represents packing of elements of the two input vectors
  9212. into the output vector, where the values are converted from
  9213. floating point to fixed point. Input operands are vectors that
  9214. contain the same number of elements of a floating point type. The
  9215. result is a vector that contains twice as many elements of an
  9216. integral type whose size is half as wide. The elements of the two
  9217. vectors are merged (concatenated) to form the output vector.
  9218. 'VEC_PACK_FLOAT_EXPR'
  9219. This node represents packing of elements of the two input vectors
  9220. into the output vector, where the values are converted from fixed
  9221. point to floating point. Input operands are vectors that contain
  9222. the same number of elements of an integral type. The result is a
  9223. vector that contains twice as many elements of floating point type
  9224. whose size is half as wide. The elements of the two vectors are
  9225. merged (concatenated) to form the output vector.
  9226. 'VEC_COND_EXPR'
  9227. These nodes represent '?:' expressions. The three operands must be
  9228. vectors of the same size and number of elements. The second and
  9229. third operands must have the same type as the entire expression.
  9230. The first operand is of signed integral vector type. If an element
  9231. of the first operand evaluates to a zero value, the corresponding
  9232. element of the result is taken from the third operand. If it
  9233. evaluates to a minus one value, it is taken from the second
  9234. operand. It should never evaluate to any other value currently,
  9235. but optimizations should not rely on that property. In contrast
  9236. with a 'COND_EXPR', all operands are always evaluated.
  9237. 'SAD_EXPR'
  9238. This node represents the Sum of Absolute Differences operation.
  9239. The three operands must be vectors of integral types. The first
  9240. and second operand must have the same type. The size of the vector
  9241. element of the third operand must be at lease twice of the size of
  9242. the vector element of the first and second one. The SAD is
  9243. calculated between the first and second operands, added to the
  9244. third operand, and returned.
  9245. 
  9246. File: gccint.info, Node: Statements, Next: Functions, Prev: Expression trees, Up: GENERIC
  9247. 11.7 Statements
  9248. ===============
  9249. Most statements in GIMPLE are assignment statements, represented by
  9250. 'GIMPLE_ASSIGN'. No other C expressions can appear at statement level;
  9251. a reference to a volatile object is converted into a 'GIMPLE_ASSIGN'.
  9252. There are also several varieties of complex statements.
  9253. * Menu:
  9254. * Basic Statements::
  9255. * Blocks::
  9256. * Statement Sequences::
  9257. * Empty Statements::
  9258. * Jumps::
  9259. * Cleanups::
  9260. * OpenMP::
  9261. * OpenACC::
  9262. 
  9263. File: gccint.info, Node: Basic Statements, Next: Blocks, Up: Statements
  9264. 11.7.1 Basic Statements
  9265. -----------------------
  9266. 'ASM_EXPR'
  9267. Used to represent an inline assembly statement. For an inline
  9268. assembly statement like:
  9269. asm ("mov x, y");
  9270. The 'ASM_STRING' macro will return a 'STRING_CST' node for '"mov x,
  9271. y"'. If the original statement made use of the extended-assembly
  9272. syntax, then 'ASM_OUTPUTS', 'ASM_INPUTS', and 'ASM_CLOBBERS' will
  9273. be the outputs, inputs, and clobbers for the statement, represented
  9274. as 'STRING_CST' nodes. The extended-assembly syntax looks like:
  9275. asm ("fsinx %1,%0" : "=f" (result) : "f" (angle));
  9276. The first string is the 'ASM_STRING', containing the instruction
  9277. template. The next two strings are the output and inputs,
  9278. respectively; this statement has no clobbers. As this example
  9279. indicates, "plain" assembly statements are merely a special case of
  9280. extended assembly statements; they have no cv-qualifiers, outputs,
  9281. inputs, or clobbers. All of the strings will be 'NUL'-terminated,
  9282. and will contain no embedded 'NUL'-characters.
  9283. If the assembly statement is declared 'volatile', or if the
  9284. statement was not an extended assembly statement, and is therefore
  9285. implicitly volatile, then the predicate 'ASM_VOLATILE_P' will hold
  9286. of the 'ASM_EXPR'.
  9287. 'DECL_EXPR'
  9288. Used to represent a local declaration. The 'DECL_EXPR_DECL' macro
  9289. can be used to obtain the entity declared. This declaration may be
  9290. a 'LABEL_DECL', indicating that the label declared is a local
  9291. label. (As an extension, GCC allows the declaration of labels with
  9292. scope.) In C, this declaration may be a 'FUNCTION_DECL',
  9293. indicating the use of the GCC nested function extension. For more
  9294. information, *note Functions::.
  9295. 'LABEL_EXPR'
  9296. Used to represent a label. The 'LABEL_DECL' declared by this
  9297. statement can be obtained with the 'LABEL_EXPR_LABEL' macro. The
  9298. 'IDENTIFIER_NODE' giving the name of the label can be obtained from
  9299. the 'LABEL_DECL' with 'DECL_NAME'.
  9300. 'GOTO_EXPR'
  9301. Used to represent a 'goto' statement. The 'GOTO_DESTINATION' will
  9302. usually be a 'LABEL_DECL'. However, if the "computed goto"
  9303. extension has been used, the 'GOTO_DESTINATION' will be an
  9304. arbitrary expression indicating the destination. This expression
  9305. will always have pointer type.
  9306. 'RETURN_EXPR'
  9307. Used to represent a 'return' statement. Operand 0 represents the
  9308. value to return. It should either be the 'RESULT_DECL' for the
  9309. containing function, or a 'MODIFY_EXPR' or 'INIT_EXPR' setting the
  9310. function's 'RESULT_DECL'. It will be 'NULL_TREE' if the statement
  9311. was just
  9312. return;
  9313. 'LOOP_EXPR'
  9314. These nodes represent "infinite" loops. The 'LOOP_EXPR_BODY'
  9315. represents the body of the loop. It should be executed forever,
  9316. unless an 'EXIT_EXPR' is encountered.
  9317. 'EXIT_EXPR'
  9318. These nodes represent conditional exits from the nearest enclosing
  9319. 'LOOP_EXPR'. The single operand is the condition; if it is
  9320. nonzero, then the loop should be exited. An 'EXIT_EXPR' will only
  9321. appear within a 'LOOP_EXPR'.
  9322. 'SWITCH_STMT'
  9323. Used to represent a 'switch' statement. The 'SWITCH_STMT_COND' is
  9324. the expression on which the switch is occurring. See the
  9325. documentation for an 'IF_STMT' for more information on the
  9326. representation used for the condition. The 'SWITCH_STMT_BODY' is
  9327. the body of the switch statement. The 'SWITCH_STMT_TYPE' is the
  9328. original type of switch expression as given in the source, before
  9329. any compiler conversions.
  9330. 'CASE_LABEL_EXPR'
  9331. Use to represent a 'case' label, range of 'case' labels, or a
  9332. 'default' label. If 'CASE_LOW' is 'NULL_TREE', then this is a
  9333. 'default' label. Otherwise, if 'CASE_HIGH' is 'NULL_TREE', then
  9334. this is an ordinary 'case' label. In this case, 'CASE_LOW' is an
  9335. expression giving the value of the label. Both 'CASE_LOW' and
  9336. 'CASE_HIGH' are 'INTEGER_CST' nodes. These values will have the
  9337. same type as the condition expression in the switch statement.
  9338. Otherwise, if both 'CASE_LOW' and 'CASE_HIGH' are defined, the
  9339. statement is a range of case labels. Such statements originate
  9340. with the extension that allows users to write things of the form:
  9341. case 2 ... 5:
  9342. The first value will be 'CASE_LOW', while the second will be
  9343. 'CASE_HIGH'.
  9344. 'DEBUG_BEGIN_STMT'
  9345. Marks the beginning of a source statement, for purposes of debug
  9346. information generation.
  9347. 
  9348. File: gccint.info, Node: Blocks, Next: Statement Sequences, Prev: Basic Statements, Up: Statements
  9349. 11.7.2 Blocks
  9350. -------------
  9351. Block scopes and the variables they declare in GENERIC are expressed
  9352. using the 'BIND_EXPR' code, which in previous versions of GCC was
  9353. primarily used for the C statement-expression extension.
  9354. Variables in a block are collected into 'BIND_EXPR_VARS' in declaration
  9355. order through their 'TREE_CHAIN' field. Any runtime initialization is
  9356. moved out of 'DECL_INITIAL' and into a statement in the controlled
  9357. block. When gimplifying from C or C++, this initialization replaces the
  9358. 'DECL_STMT'. These variables will never require cleanups. The scope of
  9359. these variables is just the body
  9360. Variable-length arrays (VLAs) complicate this process, as their size
  9361. often refers to variables initialized earlier in the block and their
  9362. initialization involves an explicit stack allocation. To handle this,
  9363. we add an indirection and replace them with a pointer to stack space
  9364. allocated by means of 'alloca'. In most cases, we also arrange for this
  9365. space to be reclaimed when the enclosing 'BIND_EXPR' is exited, the
  9366. exception to this being when there is an explicit call to 'alloca' in
  9367. the source code, in which case the stack is left depressed on exit of
  9368. the 'BIND_EXPR'.
  9369. A C++ program will usually contain more 'BIND_EXPR's than there are
  9370. syntactic blocks in the source code, since several C++ constructs have
  9371. implicit scopes associated with them. On the other hand, although the
  9372. C++ front end uses pseudo-scopes to handle cleanups for objects with
  9373. destructors, these don't translate into the GIMPLE form; multiple
  9374. declarations at the same level use the same 'BIND_EXPR'.
  9375. 
  9376. File: gccint.info, Node: Statement Sequences, Next: Empty Statements, Prev: Blocks, Up: Statements
  9377. 11.7.3 Statement Sequences
  9378. --------------------------
  9379. Multiple statements at the same nesting level are collected into a
  9380. 'STATEMENT_LIST'. Statement lists are modified and traversed using the
  9381. interface in 'tree-iterator.h'.
  9382. 
  9383. File: gccint.info, Node: Empty Statements, Next: Jumps, Prev: Statement Sequences, Up: Statements
  9384. 11.7.4 Empty Statements
  9385. -----------------------
  9386. Whenever possible, statements with no effect are discarded. But if they
  9387. are nested within another construct which cannot be discarded for some
  9388. reason, they are instead replaced with an empty statement, generated by
  9389. 'build_empty_stmt'. Initially, all empty statements were shared, after
  9390. the pattern of the Java front end, but this caused a lot of trouble in
  9391. practice.
  9392. An empty statement is represented as '(void)0'.
  9393. 
  9394. File: gccint.info, Node: Jumps, Next: Cleanups, Prev: Empty Statements, Up: Statements
  9395. 11.7.5 Jumps
  9396. ------------
  9397. Other jumps are expressed by either 'GOTO_EXPR' or 'RETURN_EXPR'.
  9398. The operand of a 'GOTO_EXPR' must be either a label or a variable
  9399. containing the address to jump to.
  9400. The operand of a 'RETURN_EXPR' is either 'NULL_TREE', 'RESULT_DECL', or
  9401. a 'MODIFY_EXPR' which sets the return value. It would be nice to move
  9402. the 'MODIFY_EXPR' into a separate statement, but the special return
  9403. semantics in 'expand_return' make that difficult. It may still happen
  9404. in the future, perhaps by moving most of that logic into
  9405. 'expand_assignment'.
  9406. 
  9407. File: gccint.info, Node: Cleanups, Next: OpenMP, Prev: Jumps, Up: Statements
  9408. 11.7.6 Cleanups
  9409. ---------------
  9410. Destructors for local C++ objects and similar dynamic cleanups are
  9411. represented in GIMPLE by a 'TRY_FINALLY_EXPR'. 'TRY_FINALLY_EXPR' has
  9412. two operands, both of which are a sequence of statements to execute.
  9413. The first sequence is executed. When it completes the second sequence
  9414. is executed.
  9415. The first sequence may complete in the following ways:
  9416. 1. Execute the last statement in the sequence and fall off the end.
  9417. 2. Execute a goto statement ('GOTO_EXPR') to an ordinary label outside
  9418. the sequence.
  9419. 3. Execute a return statement ('RETURN_EXPR').
  9420. 4. Throw an exception. This is currently not explicitly represented
  9421. in GIMPLE.
  9422. The second sequence is not executed if the first sequence completes by
  9423. calling 'setjmp' or 'exit' or any other function that does not return.
  9424. The second sequence is also not executed if the first sequence completes
  9425. via a non-local goto or a computed goto (in general the compiler does
  9426. not know whether such a goto statement exits the first sequence or not,
  9427. so we assume that it doesn't).
  9428. After the second sequence is executed, if it completes normally by
  9429. falling off the end, execution continues wherever the first sequence
  9430. would have continued, by falling off the end, or doing a goto, etc.
  9431. If the second sequence is an 'EH_ELSE_EXPR' selector, then the sequence
  9432. in its first operand is used when the first sequence completes normally,
  9433. and that in its second operand is used for exceptional cleanups, i.e.,
  9434. when an exception propagates out of the first sequence.
  9435. 'TRY_FINALLY_EXPR' complicates the flow graph, since the cleanup needs
  9436. to appear on every edge out of the controlled block; this reduces the
  9437. freedom to move code across these edges. Therefore, the EH lowering
  9438. pass which runs before most of the optimization passes eliminates these
  9439. expressions by explicitly adding the cleanup to each edge. Rethrowing
  9440. the exception is represented using 'RESX_EXPR'.
  9441. 
  9442. File: gccint.info, Node: OpenMP, Next: OpenACC, Prev: Cleanups, Up: Statements
  9443. 11.7.7 OpenMP
  9444. -------------
  9445. All the statements starting with 'OMP_' represent directives and clauses
  9446. used by the OpenMP API <https://www.openmp.org>.
  9447. 'OMP_PARALLEL'
  9448. Represents '#pragma omp parallel [clause1 ... clauseN]'. It has
  9449. four operands:
  9450. Operand 'OMP_PARALLEL_BODY' is valid while in GENERIC and High
  9451. GIMPLE forms. It contains the body of code to be executed by all
  9452. the threads. During GIMPLE lowering, this operand becomes 'NULL'
  9453. and the body is emitted linearly after 'OMP_PARALLEL'.
  9454. Operand 'OMP_PARALLEL_CLAUSES' is the list of clauses associated
  9455. with the directive.
  9456. Operand 'OMP_PARALLEL_FN' is created by 'pass_lower_omp', it
  9457. contains the 'FUNCTION_DECL' for the function that will contain the
  9458. body of the parallel region.
  9459. Operand 'OMP_PARALLEL_DATA_ARG' is also created by
  9460. 'pass_lower_omp'. If there are shared variables to be communicated
  9461. to the children threads, this operand will contain the 'VAR_DECL'
  9462. that contains all the shared values and variables.
  9463. 'OMP_FOR'
  9464. Represents '#pragma omp for [clause1 ... clauseN]'. It has six
  9465. operands:
  9466. Operand 'OMP_FOR_BODY' contains the loop body.
  9467. Operand 'OMP_FOR_CLAUSES' is the list of clauses associated with
  9468. the directive.
  9469. Operand 'OMP_FOR_INIT' is the loop initialization code of the form
  9470. 'VAR = N1'.
  9471. Operand 'OMP_FOR_COND' is the loop conditional expression of the
  9472. form 'VAR {<,>,<=,>=} N2'.
  9473. Operand 'OMP_FOR_INCR' is the loop index increment of the form 'VAR
  9474. {+=,-=} INCR'.
  9475. Operand 'OMP_FOR_PRE_BODY' contains side effect code from operands
  9476. 'OMP_FOR_INIT', 'OMP_FOR_COND' and 'OMP_FOR_INC'. These side
  9477. effects are part of the 'OMP_FOR' block but must be evaluated
  9478. before the start of loop body.
  9479. The loop index variable 'VAR' must be a signed integer variable,
  9480. which is implicitly private to each thread. Bounds 'N1' and 'N2'
  9481. and the increment expression 'INCR' are required to be loop
  9482. invariant integer expressions that are evaluated without any
  9483. synchronization. The evaluation order, frequency of evaluation and
  9484. side effects are unspecified by the standard.
  9485. 'OMP_SECTIONS'
  9486. Represents '#pragma omp sections [clause1 ... clauseN]'.
  9487. Operand 'OMP_SECTIONS_BODY' contains the sections body, which in
  9488. turn contains a set of 'OMP_SECTION' nodes for each of the
  9489. concurrent sections delimited by '#pragma omp section'.
  9490. Operand 'OMP_SECTIONS_CLAUSES' is the list of clauses associated
  9491. with the directive.
  9492. 'OMP_SECTION'
  9493. Section delimiter for 'OMP_SECTIONS'.
  9494. 'OMP_SINGLE'
  9495. Represents '#pragma omp single'.
  9496. Operand 'OMP_SINGLE_BODY' contains the body of code to be executed
  9497. by a single thread.
  9498. Operand 'OMP_SINGLE_CLAUSES' is the list of clauses associated with
  9499. the directive.
  9500. 'OMP_MASTER'
  9501. Represents '#pragma omp master'.
  9502. Operand 'OMP_MASTER_BODY' contains the body of code to be executed
  9503. by the master thread.
  9504. 'OMP_ORDERED'
  9505. Represents '#pragma omp ordered'.
  9506. Operand 'OMP_ORDERED_BODY' contains the body of code to be executed
  9507. in the sequential order dictated by the loop index variable.
  9508. 'OMP_CRITICAL'
  9509. Represents '#pragma omp critical [name]'.
  9510. Operand 'OMP_CRITICAL_BODY' is the critical section.
  9511. Operand 'OMP_CRITICAL_NAME' is an optional identifier to label the
  9512. critical section.
  9513. 'OMP_RETURN'
  9514. This does not represent any OpenMP directive, it is an artificial
  9515. marker to indicate the end of the body of an OpenMP. It is used by
  9516. the flow graph ('tree-cfg.c') and OpenMP region building code
  9517. ('omp-low.c').
  9518. 'OMP_CONTINUE'
  9519. Similarly, this instruction does not represent an OpenMP directive,
  9520. it is used by 'OMP_FOR' (and similar codes) as well as
  9521. 'OMP_SECTIONS' to mark the place where the code needs to loop to
  9522. the next iteration, or the next section, respectively.
  9523. In some cases, 'OMP_CONTINUE' is placed right before 'OMP_RETURN'.
  9524. But if there are cleanups that need to occur right after the
  9525. looping body, it will be emitted between 'OMP_CONTINUE' and
  9526. 'OMP_RETURN'.
  9527. 'OMP_ATOMIC'
  9528. Represents '#pragma omp atomic'.
  9529. Operand 0 is the address at which the atomic operation is to be
  9530. performed.
  9531. Operand 1 is the expression to evaluate. The gimplifier tries
  9532. three alternative code generation strategies. Whenever possible,
  9533. an atomic update built-in is used. If that fails, a
  9534. compare-and-swap loop is attempted. If that also fails, a regular
  9535. critical section around the expression is used.
  9536. 'OMP_CLAUSE'
  9537. Represents clauses associated with one of the 'OMP_' directives.
  9538. Clauses are represented by separate subcodes defined in 'tree.h'.
  9539. Clauses codes can be one of: 'OMP_CLAUSE_PRIVATE',
  9540. 'OMP_CLAUSE_SHARED', 'OMP_CLAUSE_FIRSTPRIVATE',
  9541. 'OMP_CLAUSE_LASTPRIVATE', 'OMP_CLAUSE_COPYIN',
  9542. 'OMP_CLAUSE_COPYPRIVATE', 'OMP_CLAUSE_IF',
  9543. 'OMP_CLAUSE_NUM_THREADS', 'OMP_CLAUSE_SCHEDULE',
  9544. 'OMP_CLAUSE_NOWAIT', 'OMP_CLAUSE_ORDERED', 'OMP_CLAUSE_DEFAULT',
  9545. 'OMP_CLAUSE_REDUCTION', 'OMP_CLAUSE_COLLAPSE', 'OMP_CLAUSE_UNTIED',
  9546. 'OMP_CLAUSE_FINAL', and 'OMP_CLAUSE_MERGEABLE'. Each code
  9547. represents the corresponding OpenMP clause.
  9548. Clauses associated with the same directive are chained together via
  9549. 'OMP_CLAUSE_CHAIN'. Those clauses that accept a list of variables
  9550. are restricted to exactly one, accessed with 'OMP_CLAUSE_VAR'.
  9551. Therefore, multiple variables under the same clause 'C' need to be
  9552. represented as multiple 'C' clauses chained together. This
  9553. facilitates adding new clauses during compilation.
  9554. 
  9555. File: gccint.info, Node: OpenACC, Prev: OpenMP, Up: Statements
  9556. 11.7.8 OpenACC
  9557. --------------
  9558. All the statements starting with 'OACC_' represent directives and
  9559. clauses used by the OpenACC API <https://www.openacc.org>.
  9560. 'OACC_CACHE'
  9561. Represents '#pragma acc cache (var ...)'.
  9562. 'OACC_DATA'
  9563. Represents '#pragma acc data [clause1 ... clauseN]'.
  9564. 'OACC_DECLARE'
  9565. Represents '#pragma acc declare [clause1 ... clauseN]'.
  9566. 'OACC_ENTER_DATA'
  9567. Represents '#pragma acc enter data [clause1 ... clauseN]'.
  9568. 'OACC_EXIT_DATA'
  9569. Represents '#pragma acc exit data [clause1 ... clauseN]'.
  9570. 'OACC_HOST_DATA'
  9571. Represents '#pragma acc host_data [clause1 ... clauseN]'.
  9572. 'OACC_KERNELS'
  9573. Represents '#pragma acc kernels [clause1 ... clauseN]'.
  9574. 'OACC_LOOP'
  9575. Represents '#pragma acc loop [clause1 ... clauseN]'.
  9576. See the description of the 'OMP_FOR' code.
  9577. 'OACC_PARALLEL'
  9578. Represents '#pragma acc parallel [clause1 ... clauseN]'.
  9579. 'OACC_SERIAL'
  9580. Represents '#pragma acc serial [clause1 ... clauseN]'.
  9581. 'OACC_UPDATE'
  9582. Represents '#pragma acc update [clause1 ... clauseN]'.
  9583. 
  9584. File: gccint.info, Node: Functions, Next: Language-dependent trees, Prev: Statements, Up: GENERIC
  9585. 11.8 Functions
  9586. ==============
  9587. A function is represented by a 'FUNCTION_DECL' node. It stores the
  9588. basic pieces of the function such as body, parameters, and return type
  9589. as well as information on the surrounding context, visibility, and
  9590. linkage.
  9591. * Menu:
  9592. * Function Basics:: Function names, body, and parameters.
  9593. * Function Properties:: Context, linkage, etc.
  9594. 
  9595. File: gccint.info, Node: Function Basics, Next: Function Properties, Up: Functions
  9596. 11.8.1 Function Basics
  9597. ----------------------
  9598. A function has four core parts: the name, the parameters, the result,
  9599. and the body. The following macros and functions access these parts of
  9600. a 'FUNCTION_DECL' as well as other basic features:
  9601. 'DECL_NAME'
  9602. This macro returns the unqualified name of the function, as an
  9603. 'IDENTIFIER_NODE'. For an instantiation of a function template,
  9604. the 'DECL_NAME' is the unqualified name of the template, not
  9605. something like 'f<int>'. The value of 'DECL_NAME' is undefined
  9606. when used on a constructor, destructor, overloaded operator, or
  9607. type-conversion operator, or any function that is implicitly
  9608. generated by the compiler. See below for macros that can be used
  9609. to distinguish these cases.
  9610. 'DECL_ASSEMBLER_NAME'
  9611. This macro returns the mangled name of the function, also an
  9612. 'IDENTIFIER_NODE'. This name does not contain leading underscores
  9613. on systems that prefix all identifiers with underscores. The
  9614. mangled name is computed in the same way on all platforms; if
  9615. special processing is required to deal with the object file format
  9616. used on a particular platform, it is the responsibility of the back
  9617. end to perform those modifications. (Of course, the back end
  9618. should not modify 'DECL_ASSEMBLER_NAME' itself.)
  9619. Using 'DECL_ASSEMBLER_NAME' will cause additional memory to be
  9620. allocated (for the mangled name of the entity) so it should be used
  9621. only when emitting assembly code. It should not be used within the
  9622. optimizers to determine whether or not two declarations are the
  9623. same, even though some of the existing optimizers do use it in that
  9624. way. These uses will be removed over time.
  9625. 'DECL_ARGUMENTS'
  9626. This macro returns the 'PARM_DECL' for the first argument to the
  9627. function. Subsequent 'PARM_DECL' nodes can be obtained by
  9628. following the 'TREE_CHAIN' links.
  9629. 'DECL_RESULT'
  9630. This macro returns the 'RESULT_DECL' for the function.
  9631. 'DECL_SAVED_TREE'
  9632. This macro returns the complete body of the function.
  9633. 'TREE_TYPE'
  9634. This macro returns the 'FUNCTION_TYPE' or 'METHOD_TYPE' for the
  9635. function.
  9636. 'DECL_INITIAL'
  9637. A function that has a definition in the current translation unit
  9638. will have a non-'NULL' 'DECL_INITIAL'. However, back ends should
  9639. not make use of the particular value given by 'DECL_INITIAL'.
  9640. It should contain a tree of 'BLOCK' nodes that mirrors the scopes
  9641. that variables are bound in the function. Each block contains a
  9642. list of decls declared in a basic block, a pointer to a chain of
  9643. blocks at the next lower scope level, then a pointer to the next
  9644. block at the same level and a backpointer to the parent 'BLOCK' or
  9645. 'FUNCTION_DECL'. So given a function as follows:
  9646. void foo()
  9647. {
  9648. int a;
  9649. {
  9650. int b;
  9651. }
  9652. int c;
  9653. }
  9654. you would get the following:
  9655. tree foo = FUNCTION_DECL;
  9656. tree decl_a = VAR_DECL;
  9657. tree decl_b = VAR_DECL;
  9658. tree decl_c = VAR_DECL;
  9659. tree block_a = BLOCK;
  9660. tree block_b = BLOCK;
  9661. tree block_c = BLOCK;
  9662. BLOCK_VARS(block_a) = decl_a;
  9663. BLOCK_SUBBLOCKS(block_a) = block_b;
  9664. BLOCK_CHAIN(block_a) = block_c;
  9665. BLOCK_SUPERCONTEXT(block_a) = foo;
  9666. BLOCK_VARS(block_b) = decl_b;
  9667. BLOCK_SUPERCONTEXT(block_b) = block_a;
  9668. BLOCK_VARS(block_c) = decl_c;
  9669. BLOCK_SUPERCONTEXT(block_c) = foo;
  9670. DECL_INITIAL(foo) = block_a;
  9671. 
  9672. File: gccint.info, Node: Function Properties, Prev: Function Basics, Up: Functions
  9673. 11.8.2 Function Properties
  9674. --------------------------
  9675. To determine the scope of a function, you can use the 'DECL_CONTEXT'
  9676. macro. This macro will return the class (either a 'RECORD_TYPE' or a
  9677. 'UNION_TYPE') or namespace (a 'NAMESPACE_DECL') of which the function is
  9678. a member. For a virtual function, this macro returns the class in which
  9679. the function was actually defined, not the base class in which the
  9680. virtual declaration occurred.
  9681. In C, the 'DECL_CONTEXT' for a function maybe another function. This
  9682. representation indicates that the GNU nested function extension is in
  9683. use. For details on the semantics of nested functions, see the GCC
  9684. Manual. The nested function can refer to local variables in its
  9685. containing function. Such references are not explicitly marked in the
  9686. tree structure; back ends must look at the 'DECL_CONTEXT' for the
  9687. referenced 'VAR_DECL'. If the 'DECL_CONTEXT' for the referenced
  9688. 'VAR_DECL' is not the same as the function currently being processed,
  9689. and neither 'DECL_EXTERNAL' nor 'TREE_STATIC' hold, then the reference
  9690. is to a local variable in a containing function, and the back end must
  9691. take appropriate action.
  9692. 'DECL_EXTERNAL'
  9693. This predicate holds if the function is undefined.
  9694. 'TREE_PUBLIC'
  9695. This predicate holds if the function has external linkage.
  9696. 'TREE_STATIC'
  9697. This predicate holds if the function has been defined.
  9698. 'TREE_THIS_VOLATILE'
  9699. This predicate holds if the function does not return normally.
  9700. 'TREE_READONLY'
  9701. This predicate holds if the function can only read its arguments.
  9702. 'DECL_PURE_P'
  9703. This predicate holds if the function can only read its arguments,
  9704. but may also read global memory.
  9705. 'DECL_VIRTUAL_P'
  9706. This predicate holds if the function is virtual.
  9707. 'DECL_ARTIFICIAL'
  9708. This macro holds if the function was implicitly generated by the
  9709. compiler, rather than explicitly declared. In addition to
  9710. implicitly generated class member functions, this macro holds for
  9711. the special functions created to implement static initialization
  9712. and destruction, to compute run-time type information, and so
  9713. forth.
  9714. 'DECL_FUNCTION_SPECIFIC_TARGET'
  9715. This macro returns a tree node that holds the target options that
  9716. are to be used to compile this particular function or 'NULL_TREE'
  9717. if the function is to be compiled with the target options specified
  9718. on the command line.
  9719. 'DECL_FUNCTION_SPECIFIC_OPTIMIZATION'
  9720. This macro returns a tree node that holds the optimization options
  9721. that are to be used to compile this particular function or
  9722. 'NULL_TREE' if the function is to be compiled with the optimization
  9723. options specified on the command line.
  9724. 
  9725. File: gccint.info, Node: Language-dependent trees, Next: C and C++ Trees, Prev: Functions, Up: GENERIC
  9726. 11.9 Language-dependent trees
  9727. =============================
  9728. Front ends may wish to keep some state associated with various GENERIC
  9729. trees while parsing. To support this, trees provide a set of flags that
  9730. may be used by the front end. They are accessed using
  9731. 'TREE_LANG_FLAG_n' where 'n' is currently 0 through 6.
  9732. If necessary, a front end can use some language-dependent tree codes in
  9733. its GENERIC representation, so long as it provides a hook for converting
  9734. them to GIMPLE and doesn't expect them to work with any (hypothetical)
  9735. optimizers that run before the conversion to GIMPLE. The intermediate
  9736. representation used while parsing C and C++ looks very little like
  9737. GENERIC, but the C and C++ gimplifier hooks are perfectly happy to take
  9738. it as input and spit out GIMPLE.
  9739. 
  9740. File: gccint.info, Node: C and C++ Trees, Prev: Language-dependent trees, Up: GENERIC
  9741. 11.10 C and C++ Trees
  9742. =====================
  9743. This section documents the internal representation used by GCC to
  9744. represent C and C++ source programs. When presented with a C or C++
  9745. source program, GCC parses the program, performs semantic analysis
  9746. (including the generation of error messages), and then produces the
  9747. internal representation described here. This representation contains a
  9748. complete representation for the entire translation unit provided as
  9749. input to the front end. This representation is then typically processed
  9750. by a code-generator in order to produce machine code, but could also be
  9751. used in the creation of source browsers, intelligent editors, automatic
  9752. documentation generators, interpreters, and any other programs needing
  9753. the ability to process C or C++ code.
  9754. This section explains the internal representation. In particular, it
  9755. documents the internal representation for C and C++ source constructs,
  9756. and the macros, functions, and variables that can be used to access
  9757. these constructs. The C++ representation is largely a superset of the
  9758. representation used in the C front end. There is only one construct
  9759. used in C that does not appear in the C++ front end and that is the GNU
  9760. "nested function" extension. Many of the macros documented here do not
  9761. apply in C because the corresponding language constructs do not appear
  9762. in C.
  9763. The C and C++ front ends generate a mix of GENERIC trees and ones
  9764. specific to C and C++. These language-specific trees are higher-level
  9765. constructs than the ones in GENERIC to make the parser's job easier.
  9766. This section describes those trees that aren't part of GENERIC as well
  9767. as aspects of GENERIC trees that are treated in a language-specific
  9768. manner.
  9769. If you are developing a "back end", be it is a code-generator or some
  9770. other tool, that uses this representation, you may occasionally find
  9771. that you need to ask questions not easily answered by the functions and
  9772. macros available here. If that situation occurs, it is quite likely
  9773. that GCC already supports the functionality you desire, but that the
  9774. interface is simply not documented here. In that case, you should ask
  9775. the GCC maintainers (via mail to <gcc@gcc.gnu.org>) about documenting
  9776. the functionality you require. Similarly, if you find yourself writing
  9777. functions that do not deal directly with your back end, but instead
  9778. might be useful to other people using the GCC front end, you should
  9779. submit your patches for inclusion in GCC.
  9780. * Menu:
  9781. * Types for C++:: Fundamental and aggregate types.
  9782. * Namespaces:: Namespaces.
  9783. * Classes:: Classes.
  9784. * Functions for C++:: Overloading and accessors for C++.
  9785. * Statements for C++:: Statements specific to C and C++.
  9786. * C++ Expressions:: From 'typeid' to 'throw'.
  9787. 
  9788. File: gccint.info, Node: Types for C++, Next: Namespaces, Up: C and C++ Trees
  9789. 11.10.1 Types for C++
  9790. ---------------------
  9791. In C++, an array type is not qualified; rather the type of the array
  9792. elements is qualified. This situation is reflected in the intermediate
  9793. representation. The macros described here will always examine the
  9794. qualification of the underlying element type when applied to an array
  9795. type. (If the element type is itself an array, then the recursion
  9796. continues until a non-array type is found, and the qualification of this
  9797. type is examined.) So, for example, 'CP_TYPE_CONST_P' will hold of the
  9798. type 'const int ()[7]', denoting an array of seven 'int's.
  9799. The following functions and macros deal with cv-qualification of types:
  9800. 'cp_type_quals'
  9801. This function returns the set of type qualifiers applied to this
  9802. type. This value is 'TYPE_UNQUALIFIED' if no qualifiers have been
  9803. applied. The 'TYPE_QUAL_CONST' bit is set if the type is
  9804. 'const'-qualified. The 'TYPE_QUAL_VOLATILE' bit is set if the type
  9805. is 'volatile'-qualified. The 'TYPE_QUAL_RESTRICT' bit is set if
  9806. the type is 'restrict'-qualified.
  9807. 'CP_TYPE_CONST_P'
  9808. This macro holds if the type is 'const'-qualified.
  9809. 'CP_TYPE_VOLATILE_P'
  9810. This macro holds if the type is 'volatile'-qualified.
  9811. 'CP_TYPE_RESTRICT_P'
  9812. This macro holds if the type is 'restrict'-qualified.
  9813. 'CP_TYPE_CONST_NON_VOLATILE_P'
  9814. This predicate holds for a type that is 'const'-qualified, but
  9815. _not_ 'volatile'-qualified; other cv-qualifiers are ignored as
  9816. well: only the 'const'-ness is tested.
  9817. A few other macros and functions are usable with all types:
  9818. 'TYPE_SIZE'
  9819. The number of bits required to represent the type, represented as
  9820. an 'INTEGER_CST'. For an incomplete type, 'TYPE_SIZE' will be
  9821. 'NULL_TREE'.
  9822. 'TYPE_ALIGN'
  9823. The alignment of the type, in bits, represented as an 'int'.
  9824. 'TYPE_NAME'
  9825. This macro returns a declaration (in the form of a 'TYPE_DECL') for
  9826. the type. (Note this macro does _not_ return an 'IDENTIFIER_NODE',
  9827. as you might expect, given its name!) You can look at the
  9828. 'DECL_NAME' of the 'TYPE_DECL' to obtain the actual name of the
  9829. type. The 'TYPE_NAME' will be 'NULL_TREE' for a type that is not a
  9830. built-in type, the result of a typedef, or a named class type.
  9831. 'CP_INTEGRAL_TYPE'
  9832. This predicate holds if the type is an integral type. Notice that
  9833. in C++, enumerations are _not_ integral types.
  9834. 'ARITHMETIC_TYPE_P'
  9835. This predicate holds if the type is an integral type (in the C++
  9836. sense) or a floating point type.
  9837. 'CLASS_TYPE_P'
  9838. This predicate holds for a class-type.
  9839. 'TYPE_BUILT_IN'
  9840. This predicate holds for a built-in type.
  9841. 'TYPE_PTRDATAMEM_P'
  9842. This predicate holds if the type is a pointer to data member.
  9843. 'TYPE_PTR_P'
  9844. This predicate holds if the type is a pointer type, and the pointee
  9845. is not a data member.
  9846. 'TYPE_PTRFN_P'
  9847. This predicate holds for a pointer to function type.
  9848. 'TYPE_PTROB_P'
  9849. This predicate holds for a pointer to object type. Note however
  9850. that it does not hold for the generic pointer to object type 'void
  9851. *'. You may use 'TYPE_PTROBV_P' to test for a pointer to object
  9852. type as well as 'void *'.
  9853. The table below describes types specific to C and C++ as well as
  9854. language-dependent info about GENERIC types.
  9855. 'POINTER_TYPE'
  9856. Used to represent pointer types, and pointer to data member types.
  9857. If 'TREE_TYPE' is a pointer to data member type, then
  9858. 'TYPE_PTRDATAMEM_P' will hold. For a pointer to data member type
  9859. of the form 'T X::*', 'TYPE_PTRMEM_CLASS_TYPE' will be the type
  9860. 'X', while 'TYPE_PTRMEM_POINTED_TO_TYPE' will be the type 'T'.
  9861. 'RECORD_TYPE'
  9862. Used to represent 'struct' and 'class' types in C and C++. If
  9863. 'TYPE_PTRMEMFUNC_P' holds, then this type is a pointer-to-member
  9864. type. In that case, the 'TYPE_PTRMEMFUNC_FN_TYPE' is a
  9865. 'POINTER_TYPE' pointing to a 'METHOD_TYPE'. The 'METHOD_TYPE' is
  9866. the type of a function pointed to by the pointer-to-member
  9867. function. If 'TYPE_PTRMEMFUNC_P' does not hold, this type is a
  9868. class type. For more information, *note Classes::.
  9869. 'UNKNOWN_TYPE'
  9870. This node is used to represent a type the knowledge of which is
  9871. insufficient for a sound processing.
  9872. 'TYPENAME_TYPE'
  9873. Used to represent a construct of the form 'typename T::A'. The
  9874. 'TYPE_CONTEXT' is 'T'; the 'TYPE_NAME' is an 'IDENTIFIER_NODE' for
  9875. 'A'. If the type is specified via a template-id, then
  9876. 'TYPENAME_TYPE_FULLNAME' yields a 'TEMPLATE_ID_EXPR'. The
  9877. 'TREE_TYPE' is non-'NULL' if the node is implicitly generated in
  9878. support for the implicit typename extension; in which case the
  9879. 'TREE_TYPE' is a type node for the base-class.
  9880. 'TYPEOF_TYPE'
  9881. Used to represent the '__typeof__' extension. The 'TYPE_FIELDS' is
  9882. the expression the type of which is being represented.
  9883. 
  9884. File: gccint.info, Node: Namespaces, Next: Classes, Prev: Types for C++, Up: C and C++ Trees
  9885. 11.10.2 Namespaces
  9886. ------------------
  9887. The root of the entire intermediate representation is the variable
  9888. 'global_namespace'. This is the namespace specified with '::' in C++
  9889. source code. All other namespaces, types, variables, functions, and so
  9890. forth can be found starting with this namespace.
  9891. However, except for the fact that it is distinguished as the root of
  9892. the representation, the global namespace is no different from any other
  9893. namespace. Thus, in what follows, we describe namespaces generally,
  9894. rather than the global namespace in particular.
  9895. A namespace is represented by a 'NAMESPACE_DECL' node.
  9896. The following macros and functions can be used on a 'NAMESPACE_DECL':
  9897. 'DECL_NAME'
  9898. This macro is used to obtain the 'IDENTIFIER_NODE' corresponding to
  9899. the unqualified name of the name of the namespace (*note
  9900. Identifiers::). The name of the global namespace is '::', even
  9901. though in C++ the global namespace is unnamed. However, you should
  9902. use comparison with 'global_namespace', rather than 'DECL_NAME' to
  9903. determine whether or not a namespace is the global one. An unnamed
  9904. namespace will have a 'DECL_NAME' equal to
  9905. 'anonymous_namespace_name'. Within a single translation unit, all
  9906. unnamed namespaces will have the same name.
  9907. 'DECL_CONTEXT'
  9908. This macro returns the enclosing namespace. The 'DECL_CONTEXT' for
  9909. the 'global_namespace' is 'NULL_TREE'.
  9910. 'DECL_NAMESPACE_ALIAS'
  9911. If this declaration is for a namespace alias, then
  9912. 'DECL_NAMESPACE_ALIAS' is the namespace for which this one is an
  9913. alias.
  9914. Do not attempt to use 'cp_namespace_decls' for a namespace which is
  9915. an alias. Instead, follow 'DECL_NAMESPACE_ALIAS' links until you
  9916. reach an ordinary, non-alias, namespace, and call
  9917. 'cp_namespace_decls' there.
  9918. 'DECL_NAMESPACE_STD_P'
  9919. This predicate holds if the namespace is the special '::std'
  9920. namespace.
  9921. 'cp_namespace_decls'
  9922. This function will return the declarations contained in the
  9923. namespace, including types, overloaded functions, other namespaces,
  9924. and so forth. If there are no declarations, this function will
  9925. return 'NULL_TREE'. The declarations are connected through their
  9926. 'TREE_CHAIN' fields.
  9927. Although most entries on this list will be declarations,
  9928. 'TREE_LIST' nodes may also appear. In this case, the 'TREE_VALUE'
  9929. will be an 'OVERLOAD'. The value of the 'TREE_PURPOSE' is
  9930. unspecified; back ends should ignore this value. As with the other
  9931. kinds of declarations returned by 'cp_namespace_decls', the
  9932. 'TREE_CHAIN' will point to the next declaration in this list.
  9933. For more information on the kinds of declarations that can occur on
  9934. this list, *Note Declarations::. Some declarations will not appear
  9935. on this list. In particular, no 'FIELD_DECL', 'LABEL_DECL', or
  9936. 'PARM_DECL' nodes will appear here.
  9937. This function cannot be used with namespaces that have
  9938. 'DECL_NAMESPACE_ALIAS' set.
  9939. 
  9940. File: gccint.info, Node: Classes, Next: Functions for C++, Prev: Namespaces, Up: C and C++ Trees
  9941. 11.10.3 Classes
  9942. ---------------
  9943. Besides namespaces, the other high-level scoping construct in C++ is the
  9944. class. (Throughout this manual the term "class" is used to mean the
  9945. types referred to in the ANSI/ISO C++ Standard as classes; these include
  9946. types defined with the 'class', 'struct', and 'union' keywords.)
  9947. A class type is represented by either a 'RECORD_TYPE' or a
  9948. 'UNION_TYPE'. A class declared with the 'union' tag is represented by a
  9949. 'UNION_TYPE', while classes declared with either the 'struct' or the
  9950. 'class' tag are represented by 'RECORD_TYPE's. You can use the
  9951. 'CLASSTYPE_DECLARED_CLASS' macro to discern whether or not a particular
  9952. type is a 'class' as opposed to a 'struct'. This macro will be true
  9953. only for classes declared with the 'class' tag.
  9954. Almost all members are available on the 'TYPE_FIELDS' list. Given one
  9955. member, the next can be found by following the 'TREE_CHAIN'. You should
  9956. not depend in any way on the order in which fields appear on this list.
  9957. All nodes on this list will be 'DECL' nodes. A 'FIELD_DECL' is used to
  9958. represent a non-static data member, a 'VAR_DECL' is used to represent a
  9959. static data member, and a 'TYPE_DECL' is used to represent a type. Note
  9960. that the 'CONST_DECL' for an enumeration constant will appear on this
  9961. list, if the enumeration type was declared in the class. (Of course,
  9962. the 'TYPE_DECL' for the enumeration type will appear here as well.)
  9963. There are no entries for base classes on this list. In particular,
  9964. there is no 'FIELD_DECL' for the "base-class portion" of an object. If
  9965. a function member is overloaded, each of the overloaded functions
  9966. appears; no 'OVERLOAD' nodes appear on the 'TYPE_FIELDS' list.
  9967. Implicitly declared functions (including default constructors, copy
  9968. constructors, assignment operators, and destructors) will appear on this
  9969. list as well.
  9970. The 'TYPE_VFIELD' is a compiler-generated field used to point to
  9971. virtual function tables. It may or may not appear on the 'TYPE_FIELDS'
  9972. list. However, back ends should handle the 'TYPE_VFIELD' just like all
  9973. the entries on the 'TYPE_FIELDS' list.
  9974. Every class has an associated "binfo", which can be obtained with
  9975. 'TYPE_BINFO'. Binfos are used to represent base-classes. The binfo
  9976. given by 'TYPE_BINFO' is the degenerate case, whereby every class is
  9977. considered to be its own base-class. The base binfos for a particular
  9978. binfo are held in a vector, whose length is obtained with
  9979. 'BINFO_N_BASE_BINFOS'. The base binfos themselves are obtained with
  9980. 'BINFO_BASE_BINFO' and 'BINFO_BASE_ITERATE'. To add a new binfo, use
  9981. 'BINFO_BASE_APPEND'. The vector of base binfos can be obtained with
  9982. 'BINFO_BASE_BINFOS', but normally you do not need to use that. The
  9983. class type associated with a binfo is given by 'BINFO_TYPE'. It is not
  9984. always the case that 'BINFO_TYPE (TYPE_BINFO (x))', because of typedefs
  9985. and qualified types. Neither is it the case that 'TYPE_BINFO
  9986. (BINFO_TYPE (y))' is the same binfo as 'y'. The reason is that if 'y'
  9987. is a binfo representing a base-class 'B' of a derived class 'D', then
  9988. 'BINFO_TYPE (y)' will be 'B', and 'TYPE_BINFO (BINFO_TYPE (y))' will be
  9989. 'B' as its own base-class, rather than as a base-class of 'D'.
  9990. The access to a base type can be found with 'BINFO_BASE_ACCESS'. This
  9991. will produce 'access_public_node', 'access_private_node' or
  9992. 'access_protected_node'. If bases are always public,
  9993. 'BINFO_BASE_ACCESSES' may be 'NULL'.
  9994. 'BINFO_VIRTUAL_P' is used to specify whether the binfo is inherited
  9995. virtually or not. The other flags, 'BINFO_FLAG_0' to 'BINFO_FLAG_6',
  9996. can be used for language specific use.
  9997. The following macros can be used on a tree node representing a
  9998. class-type.
  9999. 'LOCAL_CLASS_P'
  10000. This predicate holds if the class is local class _i.e._ declared
  10001. inside a function body.
  10002. 'TYPE_POLYMORPHIC_P'
  10003. This predicate holds if the class has at least one virtual function
  10004. (declared or inherited).
  10005. 'TYPE_HAS_DEFAULT_CONSTRUCTOR'
  10006. This predicate holds whenever its argument represents a class-type
  10007. with default constructor.
  10008. 'CLASSTYPE_HAS_MUTABLE'
  10009. 'TYPE_HAS_MUTABLE_P'
  10010. These predicates hold for a class-type having a mutable data
  10011. member.
  10012. 'CLASSTYPE_NON_POD_P'
  10013. This predicate holds only for class-types that are not PODs.
  10014. 'TYPE_HAS_NEW_OPERATOR'
  10015. This predicate holds for a class-type that defines 'operator new'.
  10016. 'TYPE_HAS_ARRAY_NEW_OPERATOR'
  10017. This predicate holds for a class-type for which 'operator new[]' is
  10018. defined.
  10019. 'TYPE_OVERLOADS_CALL_EXPR'
  10020. This predicate holds for class-type for which the function call
  10021. 'operator()' is overloaded.
  10022. 'TYPE_OVERLOADS_ARRAY_REF'
  10023. This predicate holds for a class-type that overloads 'operator[]'
  10024. 'TYPE_OVERLOADS_ARROW'
  10025. This predicate holds for a class-type for which 'operator->' is
  10026. overloaded.
  10027. 
  10028. File: gccint.info, Node: Functions for C++, Next: Statements for C++, Prev: Classes, Up: C and C++ Trees
  10029. 11.10.4 Functions for C++
  10030. -------------------------
  10031. A function is represented by a 'FUNCTION_DECL' node. A set of
  10032. overloaded functions is sometimes represented by an 'OVERLOAD' node.
  10033. An 'OVERLOAD' node is not a declaration, so none of the 'DECL_' macros
  10034. should be used on an 'OVERLOAD'. An 'OVERLOAD' node is similar to a
  10035. 'TREE_LIST'. Use 'OVL_CURRENT' to get the function associated with an
  10036. 'OVERLOAD' node; use 'OVL_NEXT' to get the next 'OVERLOAD' node in the
  10037. list of overloaded functions. The macros 'OVL_CURRENT' and 'OVL_NEXT'
  10038. are actually polymorphic; you can use them to work with 'FUNCTION_DECL'
  10039. nodes as well as with overloads. In the case of a 'FUNCTION_DECL',
  10040. 'OVL_CURRENT' will always return the function itself, and 'OVL_NEXT'
  10041. will always be 'NULL_TREE'.
  10042. To determine the scope of a function, you can use the 'DECL_CONTEXT'
  10043. macro. This macro will return the class (either a 'RECORD_TYPE' or a
  10044. 'UNION_TYPE') or namespace (a 'NAMESPACE_DECL') of which the function is
  10045. a member. For a virtual function, this macro returns the class in which
  10046. the function was actually defined, not the base class in which the
  10047. virtual declaration occurred.
  10048. If a friend function is defined in a class scope, the
  10049. 'DECL_FRIEND_CONTEXT' macro can be used to determine the class in which
  10050. it was defined. For example, in
  10051. class C { friend void f() {} };
  10052. the 'DECL_CONTEXT' for 'f' will be the 'global_namespace', but the
  10053. 'DECL_FRIEND_CONTEXT' will be the 'RECORD_TYPE' for 'C'.
  10054. The following macros and functions can be used on a 'FUNCTION_DECL':
  10055. 'DECL_MAIN_P'
  10056. This predicate holds for a function that is the program entry point
  10057. '::code'.
  10058. 'DECL_LOCAL_FUNCTION_P'
  10059. This predicate holds if the function was declared at block scope,
  10060. even though it has a global scope.
  10061. 'DECL_ANTICIPATED'
  10062. This predicate holds if the function is a built-in function but its
  10063. prototype is not yet explicitly declared.
  10064. 'DECL_EXTERN_C_FUNCTION_P'
  10065. This predicate holds if the function is declared as an ''extern
  10066. "C"'' function.
  10067. 'DECL_LINKONCE_P'
  10068. This macro holds if multiple copies of this function may be emitted
  10069. in various translation units. It is the responsibility of the
  10070. linker to merge the various copies. Template instantiations are
  10071. the most common example of functions for which 'DECL_LINKONCE_P'
  10072. holds; G++ instantiates needed templates in all translation units
  10073. which require them, and then relies on the linker to remove
  10074. duplicate instantiations.
  10075. FIXME: This macro is not yet implemented.
  10076. 'DECL_FUNCTION_MEMBER_P'
  10077. This macro holds if the function is a member of a class, rather
  10078. than a member of a namespace.
  10079. 'DECL_STATIC_FUNCTION_P'
  10080. This predicate holds if the function a static member function.
  10081. 'DECL_NONSTATIC_MEMBER_FUNCTION_P'
  10082. This macro holds for a non-static member function.
  10083. 'DECL_CONST_MEMFUNC_P'
  10084. This predicate holds for a 'const'-member function.
  10085. 'DECL_VOLATILE_MEMFUNC_P'
  10086. This predicate holds for a 'volatile'-member function.
  10087. 'DECL_CONSTRUCTOR_P'
  10088. This macro holds if the function is a constructor.
  10089. 'DECL_NONCONVERTING_P'
  10090. This predicate holds if the constructor is a non-converting
  10091. constructor.
  10092. 'DECL_COMPLETE_CONSTRUCTOR_P'
  10093. This predicate holds for a function which is a constructor for an
  10094. object of a complete type.
  10095. 'DECL_BASE_CONSTRUCTOR_P'
  10096. This predicate holds for a function which is a constructor for a
  10097. base class sub-object.
  10098. 'DECL_COPY_CONSTRUCTOR_P'
  10099. This predicate holds for a function which is a copy-constructor.
  10100. 'DECL_DESTRUCTOR_P'
  10101. This macro holds if the function is a destructor.
  10102. 'DECL_COMPLETE_DESTRUCTOR_P'
  10103. This predicate holds if the function is the destructor for an
  10104. object a complete type.
  10105. 'DECL_OVERLOADED_OPERATOR_P'
  10106. This macro holds if the function is an overloaded operator.
  10107. 'DECL_CONV_FN_P'
  10108. This macro holds if the function is a type-conversion operator.
  10109. 'DECL_GLOBAL_CTOR_P'
  10110. This predicate holds if the function is a file-scope initialization
  10111. function.
  10112. 'DECL_GLOBAL_DTOR_P'
  10113. This predicate holds if the function is a file-scope finalization
  10114. function.
  10115. 'DECL_THUNK_P'
  10116. This predicate holds if the function is a thunk.
  10117. These functions represent stub code that adjusts the 'this' pointer
  10118. and then jumps to another function. When the jumped-to function
  10119. returns, control is transferred directly to the caller, without
  10120. returning to the thunk. The first parameter to the thunk is always
  10121. the 'this' pointer; the thunk should add 'THUNK_DELTA' to this
  10122. value. (The 'THUNK_DELTA' is an 'int', not an 'INTEGER_CST'.)
  10123. Then, if 'THUNK_VCALL_OFFSET' (an 'INTEGER_CST') is nonzero the
  10124. adjusted 'this' pointer must be adjusted again. The complete
  10125. calculation is given by the following pseudo-code:
  10126. this += THUNK_DELTA
  10127. if (THUNK_VCALL_OFFSET)
  10128. this += (*((ptrdiff_t **) this))[THUNK_VCALL_OFFSET]
  10129. Finally, the thunk should jump to the location given by
  10130. 'DECL_INITIAL'; this will always be an expression for the address
  10131. of a function.
  10132. 'DECL_NON_THUNK_FUNCTION_P'
  10133. This predicate holds if the function is _not_ a thunk function.
  10134. 'GLOBAL_INIT_PRIORITY'
  10135. If either 'DECL_GLOBAL_CTOR_P' or 'DECL_GLOBAL_DTOR_P' holds, then
  10136. this gives the initialization priority for the function. The
  10137. linker will arrange that all functions for which
  10138. 'DECL_GLOBAL_CTOR_P' holds are run in increasing order of priority
  10139. before 'main' is called. When the program exits, all functions for
  10140. which 'DECL_GLOBAL_DTOR_P' holds are run in the reverse order.
  10141. 'TYPE_RAISES_EXCEPTIONS'
  10142. This macro returns the list of exceptions that a (member-)function
  10143. can raise. The returned list, if non 'NULL', is comprised of nodes
  10144. whose 'TREE_VALUE' represents a type.
  10145. 'TYPE_NOTHROW_P'
  10146. This predicate holds when the exception-specification of its
  10147. arguments is of the form ''()''.
  10148. 'DECL_ARRAY_DELETE_OPERATOR_P'
  10149. This predicate holds if the function an overloaded 'operator
  10150. delete[]'.
  10151. 
  10152. File: gccint.info, Node: Statements for C++, Next: C++ Expressions, Prev: Functions for C++, Up: C and C++ Trees
  10153. 11.10.5 Statements for C++
  10154. --------------------------
  10155. A function that has a definition in the current translation unit will
  10156. have a non-'NULL' 'DECL_INITIAL'. However, back ends should not make
  10157. use of the particular value given by 'DECL_INITIAL'.
  10158. The 'DECL_SAVED_TREE' macro will give the complete body of the
  10159. function.
  10160. 11.10.5.1 Statements
  10161. ....................
  10162. There are tree nodes corresponding to all of the source-level statement
  10163. constructs, used within the C and C++ frontends. These are enumerated
  10164. here, together with a list of the various macros that can be used to
  10165. obtain information about them. There are a few macros that can be used
  10166. with all statements:
  10167. 'STMT_IS_FULL_EXPR_P'
  10168. In C++, statements normally constitute "full expressions";
  10169. temporaries created during a statement are destroyed when the
  10170. statement is complete. However, G++ sometimes represents
  10171. expressions by statements; these statements will not have
  10172. 'STMT_IS_FULL_EXPR_P' set. Temporaries created during such
  10173. statements should be destroyed when the innermost enclosing
  10174. statement with 'STMT_IS_FULL_EXPR_P' set is exited.
  10175. Here is the list of the various statement nodes, and the macros used to
  10176. access them. This documentation describes the use of these nodes in
  10177. non-template functions (including instantiations of template functions).
  10178. In template functions, the same nodes are used, but sometimes in
  10179. slightly different ways.
  10180. Many of the statements have substatements. For example, a 'while' loop
  10181. will have a body, which is itself a statement. If the substatement is
  10182. 'NULL_TREE', it is considered equivalent to a statement consisting of a
  10183. single ';', i.e., an expression statement in which the expression has
  10184. been omitted. A substatement may in fact be a list of statements,
  10185. connected via their 'TREE_CHAIN's. So, you should always process the
  10186. statement tree by looping over substatements, like this:
  10187. void process_stmt (stmt)
  10188. tree stmt;
  10189. {
  10190. while (stmt)
  10191. {
  10192. switch (TREE_CODE (stmt))
  10193. {
  10194. case IF_STMT:
  10195. process_stmt (THEN_CLAUSE (stmt));
  10196. /* More processing here. */
  10197. break;
  10198. ...
  10199. }
  10200. stmt = TREE_CHAIN (stmt);
  10201. }
  10202. }
  10203. In other words, while the 'then' clause of an 'if' statement in C++ can
  10204. be only one statement (although that one statement may be a compound
  10205. statement), the intermediate representation will sometimes use several
  10206. statements chained together.
  10207. 'BREAK_STMT'
  10208. Used to represent a 'break' statement. There are no additional
  10209. fields.
  10210. 'CLEANUP_STMT'
  10211. Used to represent an action that should take place upon exit from
  10212. the enclosing scope. Typically, these actions are calls to
  10213. destructors for local objects, but back ends cannot rely on this
  10214. fact. If these nodes are in fact representing such destructors,
  10215. 'CLEANUP_DECL' will be the 'VAR_DECL' destroyed. Otherwise,
  10216. 'CLEANUP_DECL' will be 'NULL_TREE'. In any case, the
  10217. 'CLEANUP_EXPR' is the expression to execute. The cleanups executed
  10218. on exit from a scope should be run in the reverse order of the
  10219. order in which the associated 'CLEANUP_STMT's were encountered.
  10220. 'CONTINUE_STMT'
  10221. Used to represent a 'continue' statement. There are no additional
  10222. fields.
  10223. 'CTOR_STMT'
  10224. Used to mark the beginning (if 'CTOR_BEGIN_P' holds) or end (if
  10225. 'CTOR_END_P' holds of the main body of a constructor. See also
  10226. 'SUBOBJECT' for more information on how to use these nodes.
  10227. 'DO_STMT'
  10228. Used to represent a 'do' loop. The body of the loop is given by
  10229. 'DO_BODY' while the termination condition for the loop is given by
  10230. 'DO_COND'. The condition for a 'do'-statement is always an
  10231. expression.
  10232. 'EMPTY_CLASS_EXPR'
  10233. Used to represent a temporary object of a class with no data whose
  10234. address is never taken. (All such objects are interchangeable.)
  10235. The 'TREE_TYPE' represents the type of the object.
  10236. 'EXPR_STMT'
  10237. Used to represent an expression statement. Use 'EXPR_STMT_EXPR' to
  10238. obtain the expression.
  10239. 'FOR_STMT'
  10240. Used to represent a 'for' statement. The 'FOR_INIT_STMT' is the
  10241. initialization statement for the loop. The 'FOR_COND' is the
  10242. termination condition. The 'FOR_EXPR' is the expression executed
  10243. right before the 'FOR_COND' on each loop iteration; often, this
  10244. expression increments a counter. The body of the loop is given by
  10245. 'FOR_BODY'. Note that 'FOR_INIT_STMT' and 'FOR_BODY' return
  10246. statements, while 'FOR_COND' and 'FOR_EXPR' return expressions.
  10247. 'HANDLER'
  10248. Used to represent a C++ 'catch' block. The 'HANDLER_TYPE' is the
  10249. type of exception that will be caught by this handler; it is equal
  10250. (by pointer equality) to 'NULL' if this handler is for all types.
  10251. 'HANDLER_PARMS' is the 'DECL_STMT' for the catch parameter, and
  10252. 'HANDLER_BODY' is the code for the block itself.
  10253. 'IF_STMT'
  10254. Used to represent an 'if' statement. The 'IF_COND' is the
  10255. expression.
  10256. If the condition is a 'TREE_LIST', then the 'TREE_PURPOSE' is a
  10257. statement (usually a 'DECL_STMT'). Each time the condition is
  10258. evaluated, the statement should be executed. Then, the
  10259. 'TREE_VALUE' should be used as the conditional expression itself.
  10260. This representation is used to handle C++ code like this:
  10261. C++ distinguishes between this and 'COND_EXPR' for handling
  10262. templates.
  10263. if (int i = 7) ...
  10264. where there is a new local variable (or variables) declared within
  10265. the condition.
  10266. The 'THEN_CLAUSE' represents the statement given by the 'then'
  10267. condition, while the 'ELSE_CLAUSE' represents the statement given
  10268. by the 'else' condition.
  10269. 'SUBOBJECT'
  10270. In a constructor, these nodes are used to mark the point at which a
  10271. subobject of 'this' is fully constructed. If, after this point, an
  10272. exception is thrown before a 'CTOR_STMT' with 'CTOR_END_P' set is
  10273. encountered, the 'SUBOBJECT_CLEANUP' must be executed. The
  10274. cleanups must be executed in the reverse order in which they
  10275. appear.
  10276. 'SWITCH_STMT'
  10277. Used to represent a 'switch' statement. The 'SWITCH_STMT_COND' is
  10278. the expression on which the switch is occurring. See the
  10279. documentation for an 'IF_STMT' for more information on the
  10280. representation used for the condition. The 'SWITCH_STMT_BODY' is
  10281. the body of the switch statement. The 'SWITCH_STMT_TYPE' is the
  10282. original type of switch expression as given in the source, before
  10283. any compiler conversions.
  10284. 'TRY_BLOCK'
  10285. Used to represent a 'try' block. The body of the try block is
  10286. given by 'TRY_STMTS'. Each of the catch blocks is a 'HANDLER'
  10287. node. The first handler is given by 'TRY_HANDLERS'. Subsequent
  10288. handlers are obtained by following the 'TREE_CHAIN' link from one
  10289. handler to the next. The body of the handler is given by
  10290. 'HANDLER_BODY'.
  10291. If 'CLEANUP_P' holds of the 'TRY_BLOCK', then the 'TRY_HANDLERS'
  10292. will not be a 'HANDLER' node. Instead, it will be an expression
  10293. that should be executed if an exception is thrown in the try block.
  10294. It must rethrow the exception after executing that code. And, if
  10295. an exception is thrown while the expression is executing,
  10296. 'terminate' must be called.
  10297. 'USING_STMT'
  10298. Used to represent a 'using' directive. The namespace is given by
  10299. 'USING_STMT_NAMESPACE', which will be a NAMESPACE_DECL. This node
  10300. is needed inside template functions, to implement using directives
  10301. during instantiation.
  10302. 'WHILE_STMT'
  10303. Used to represent a 'while' loop. The 'WHILE_COND' is the
  10304. termination condition for the loop. See the documentation for an
  10305. 'IF_STMT' for more information on the representation used for the
  10306. condition.
  10307. The 'WHILE_BODY' is the body of the loop.
  10308. 
  10309. File: gccint.info, Node: C++ Expressions, Prev: Statements for C++, Up: C and C++ Trees
  10310. 11.10.6 C++ Expressions
  10311. -----------------------
  10312. This section describes expressions specific to the C and C++ front ends.
  10313. 'TYPEID_EXPR'
  10314. Used to represent a 'typeid' expression.
  10315. 'NEW_EXPR'
  10316. 'VEC_NEW_EXPR'
  10317. Used to represent a call to 'new' and 'new[]' respectively.
  10318. 'DELETE_EXPR'
  10319. 'VEC_DELETE_EXPR'
  10320. Used to represent a call to 'delete' and 'delete[]' respectively.
  10321. 'MEMBER_REF'
  10322. Represents a reference to a member of a class.
  10323. 'THROW_EXPR'
  10324. Represents an instance of 'throw' in the program. Operand 0, which
  10325. is the expression to throw, may be 'NULL_TREE'.
  10326. 'AGGR_INIT_EXPR'
  10327. An 'AGGR_INIT_EXPR' represents the initialization as the return
  10328. value of a function call, or as the result of a constructor. An
  10329. 'AGGR_INIT_EXPR' will only appear as a full-expression, or as the
  10330. second operand of a 'TARGET_EXPR'. 'AGGR_INIT_EXPR's have a
  10331. representation similar to that of 'CALL_EXPR's. You can use the
  10332. 'AGGR_INIT_EXPR_FN' and 'AGGR_INIT_EXPR_ARG' macros to access the
  10333. function to call and the arguments to pass.
  10334. If 'AGGR_INIT_VIA_CTOR_P' holds of the 'AGGR_INIT_EXPR', then the
  10335. initialization is via a constructor call. The address of the
  10336. 'AGGR_INIT_EXPR_SLOT' operand, which is always a 'VAR_DECL', is
  10337. taken, and this value replaces the first argument in the argument
  10338. list.
  10339. In either case, the expression is void.
  10340. 
  10341. File: gccint.info, Node: GIMPLE, Next: Tree SSA, Prev: GENERIC, Up: Top
  10342. 12 GIMPLE
  10343. *********
  10344. GIMPLE is a three-address representation derived from GENERIC by
  10345. breaking down GENERIC expressions into tuples of no more than 3 operands
  10346. (with some exceptions like function calls). GIMPLE was heavily
  10347. influenced by the SIMPLE IL used by the McCAT compiler project at McGill
  10348. University, though we have made some different choices. For one thing,
  10349. SIMPLE doesn't support 'goto'.
  10350. Temporaries are introduced to hold intermediate values needed to
  10351. compute complex expressions. Additionally, all the control structures
  10352. used in GENERIC are lowered into conditional jumps, lexical scopes are
  10353. removed and exception regions are converted into an on the side
  10354. exception region tree.
  10355. The compiler pass which converts GENERIC into GIMPLE is referred to as
  10356. the 'gimplifier'. The gimplifier works recursively, generating GIMPLE
  10357. tuples out of the original GENERIC expressions.
  10358. One of the early implementation strategies used for the GIMPLE
  10359. representation was to use the same internal data structures used by
  10360. front ends to represent parse trees. This simplified implementation
  10361. because we could leverage existing functionality and interfaces.
  10362. However, GIMPLE is a much more restrictive representation than abstract
  10363. syntax trees (AST), therefore it does not require the full structural
  10364. complexity provided by the main tree data structure.
  10365. The GENERIC representation of a function is stored in the
  10366. 'DECL_SAVED_TREE' field of the associated 'FUNCTION_DECL' tree node. It
  10367. is converted to GIMPLE by a call to 'gimplify_function_tree'.
  10368. If a front end wants to include language-specific tree codes in the
  10369. tree representation which it provides to the back end, it must provide a
  10370. definition of 'LANG_HOOKS_GIMPLIFY_EXPR' which knows how to convert the
  10371. front end trees to GIMPLE. Usually such a hook will involve much of the
  10372. same code for expanding front end trees to RTL. This function can
  10373. return fully lowered GIMPLE, or it can return GENERIC trees and let the
  10374. main gimplifier lower them the rest of the way; this is often simpler.
  10375. GIMPLE that is not fully lowered is known as "High GIMPLE" and consists
  10376. of the IL before the pass 'pass_lower_cf'. High GIMPLE contains some
  10377. container statements like lexical scopes (represented by 'GIMPLE_BIND')
  10378. and nested expressions (e.g., 'GIMPLE_TRY'), while "Low GIMPLE" exposes
  10379. all of the implicit jumps for control and exception expressions directly
  10380. in the IL and EH region trees.
  10381. The C and C++ front ends currently convert directly from front end
  10382. trees to GIMPLE, and hand that off to the back end rather than first
  10383. converting to GENERIC. Their gimplifier hooks know about all the
  10384. '_STMT' nodes and how to convert them to GENERIC forms. There was some
  10385. work done on a genericization pass which would run first, but the
  10386. existence of 'STMT_EXPR' meant that in order to convert all of the C
  10387. statements into GENERIC equivalents would involve walking the entire
  10388. tree anyway, so it was simpler to lower all the way. This might change
  10389. in the future if someone writes an optimization pass which would work
  10390. better with higher-level trees, but currently the optimizers all expect
  10391. GIMPLE.
  10392. You can request to dump a C-like representation of the GIMPLE form with
  10393. the flag '-fdump-tree-gimple'.
  10394. * Menu:
  10395. * Tuple representation::
  10396. * Class hierarchy of GIMPLE statements::
  10397. * GIMPLE instruction set::
  10398. * GIMPLE Exception Handling::
  10399. * Temporaries::
  10400. * Operands::
  10401. * Manipulating GIMPLE statements::
  10402. * Tuple specific accessors::
  10403. * GIMPLE sequences::
  10404. * Sequence iterators::
  10405. * Adding a new GIMPLE statement code::
  10406. * Statement and operand traversals::
  10407. 
  10408. File: gccint.info, Node: Tuple representation, Next: Class hierarchy of GIMPLE statements, Up: GIMPLE
  10409. 12.1 Tuple representation
  10410. =========================
  10411. GIMPLE instructions are tuples of variable size divided in two groups: a
  10412. header describing the instruction and its locations, and a variable
  10413. length body with all the operands. Tuples are organized into a
  10414. hierarchy with 3 main classes of tuples.
  10415. 12.1.1 'gimple' (gsbase)
  10416. ------------------------
  10417. This is the root of the hierarchy, it holds basic information needed by
  10418. most GIMPLE statements. There are some fields that may not be relevant
  10419. to every GIMPLE statement, but those were moved into the base structure
  10420. to take advantage of holes left by other fields (thus making the
  10421. structure more compact). The structure takes 4 words (32 bytes) on 64
  10422. bit hosts:
  10423. Field Size (bits)
  10424. 'code' 8
  10425. 'subcode' 16
  10426. 'no_warning' 1
  10427. 'visited' 1
  10428. 'nontemporal_move' 1
  10429. 'plf' 2
  10430. 'modified' 1
  10431. 'has_volatile_ops' 1
  10432. 'references_memory_p' 1
  10433. 'uid' 32
  10434. 'location' 32
  10435. 'num_ops' 32
  10436. 'bb' 64
  10437. 'block' 63
  10438. Total size 32 bytes
  10439. * 'code' Main identifier for a GIMPLE instruction.
  10440. * 'subcode' Used to distinguish different variants of the same basic
  10441. instruction or provide flags applicable to a given code. The
  10442. 'subcode' flags field has different uses depending on the code of
  10443. the instruction, but mostly it distinguishes instructions of the
  10444. same family. The most prominent use of this field is in
  10445. assignments, where subcode indicates the operation done on the RHS
  10446. of the assignment. For example, a = b + c is encoded as
  10447. 'GIMPLE_ASSIGN <PLUS_EXPR, a, b, c>'.
  10448. * 'no_warning' Bitflag to indicate whether a warning has already been
  10449. issued on this statement.
  10450. * 'visited' General purpose "visited" marker. Set and cleared by
  10451. each pass when needed.
  10452. * 'nontemporal_move' Bitflag used in assignments that represent
  10453. non-temporal moves. Although this bitflag is only used in
  10454. assignments, it was moved into the base to take advantage of the
  10455. bit holes left by the previous fields.
  10456. * 'plf' Pass Local Flags. This 2-bit mask can be used as general
  10457. purpose markers by any pass. Passes are responsible for clearing
  10458. and setting these two flags accordingly.
  10459. * 'modified' Bitflag to indicate whether the statement has been
  10460. modified. Used mainly by the operand scanner to determine when to
  10461. re-scan a statement for operands.
  10462. * 'has_volatile_ops' Bitflag to indicate whether this statement
  10463. contains operands that have been marked volatile.
  10464. * 'references_memory_p' Bitflag to indicate whether this statement
  10465. contains memory references (i.e., its operands are either global
  10466. variables, or pointer dereferences or anything that must reside in
  10467. memory).
  10468. * 'uid' This is an unsigned integer used by passes that want to
  10469. assign IDs to every statement. These IDs must be assigned and used
  10470. by each pass.
  10471. * 'location' This is a 'location_t' identifier to specify source code
  10472. location for this statement. It is inherited from the front end.
  10473. * 'num_ops' Number of operands that this statement has. This
  10474. specifies the size of the operand vector embedded in the tuple.
  10475. Only used in some tuples, but it is declared in the base tuple to
  10476. take advantage of the 32-bit hole left by the previous fields.
  10477. * 'bb' Basic block holding the instruction.
  10478. * 'block' Lexical block holding this statement. Also used for debug
  10479. information generation.
  10480. 12.1.2 'gimple_statement_with_ops'
  10481. ----------------------------------
  10482. This tuple is actually split in two: 'gimple_statement_with_ops_base'
  10483. and 'gimple_statement_with_ops'. This is needed to accommodate the way
  10484. the operand vector is allocated. The operand vector is defined to be an
  10485. array of 1 element. So, to allocate a dynamic number of operands, the
  10486. memory allocator ('gimple_alloc') simply allocates enough memory to hold
  10487. the structure itself plus 'N - 1' operands which run "off the end" of
  10488. the structure. For example, to allocate space for a tuple with 3
  10489. operands, 'gimple_alloc' reserves 'sizeof (struct
  10490. gimple_statement_with_ops) + 2 * sizeof (tree)' bytes.
  10491. On the other hand, several fields in this tuple need to be shared with
  10492. the 'gimple_statement_with_memory_ops' tuple. So, these common fields
  10493. are placed in 'gimple_statement_with_ops_base' which is then inherited
  10494. from the other two tuples.
  10495. 'gsbase' 256
  10496. 'def_ops' 64
  10497. 'use_ops' 64
  10498. 'op' 'num_ops' * 64
  10499. Total 48 + 8 * 'num_ops' bytes
  10500. size
  10501. * 'gsbase' Inherited from 'struct gimple'.
  10502. * 'def_ops' Array of pointers into the operand array indicating all
  10503. the slots that contain a variable written-to by the statement.
  10504. This array is also used for immediate use chaining. Note that it
  10505. would be possible to not rely on this array, but the changes
  10506. required to implement this are pretty invasive.
  10507. * 'use_ops' Similar to 'def_ops' but for variables read by the
  10508. statement.
  10509. * 'op' Array of trees with 'num_ops' slots.
  10510. 12.1.3 'gimple_statement_with_memory_ops'
  10511. -----------------------------------------
  10512. This tuple is essentially identical to 'gimple_statement_with_ops',
  10513. except that it contains 4 additional fields to hold vectors related
  10514. memory stores and loads. Similar to the previous case, the structure is
  10515. split in two to accommodate for the operand vector
  10516. ('gimple_statement_with_memory_ops_base' and
  10517. 'gimple_statement_with_memory_ops').
  10518. Field Size (bits)
  10519. 'gsbase' 256
  10520. 'def_ops' 64
  10521. 'use_ops' 64
  10522. 'vdef_ops' 64
  10523. 'vuse_ops' 64
  10524. 'stores' 64
  10525. 'loads' 64
  10526. 'op' 'num_ops' * 64
  10527. Total size 80 + 8 * 'num_ops' bytes
  10528. * 'vdef_ops' Similar to 'def_ops' but for 'VDEF' operators. There is
  10529. one entry per memory symbol written by this statement. This is
  10530. used to maintain the memory SSA use-def and def-def chains.
  10531. * 'vuse_ops' Similar to 'use_ops' but for 'VUSE' operators. There is
  10532. one entry per memory symbol loaded by this statement. This is used
  10533. to maintain the memory SSA use-def chains.
  10534. * 'stores' Bitset with all the UIDs for the symbols written-to by the
  10535. statement. This is different than 'vdef_ops' in that all the
  10536. affected symbols are mentioned in this set. If memory partitioning
  10537. is enabled, the 'vdef_ops' vector will refer to memory partitions.
  10538. Furthermore, no SSA information is stored in this set.
  10539. * 'loads' Similar to 'stores', but for memory loads. (Note that
  10540. there is some amount of redundancy here, it should be possible to
  10541. reduce memory utilization further by removing these sets).
  10542. All the other tuples are defined in terms of these three basic ones.
  10543. Each tuple will add some fields.
  10544. 
  10545. File: gccint.info, Node: Class hierarchy of GIMPLE statements, Next: GIMPLE instruction set, Prev: Tuple representation, Up: GIMPLE
  10546. 12.2 Class hierarchy of GIMPLE statements
  10547. =========================================
  10548. The following diagram shows the C++ inheritance hierarchy of statement
  10549. kinds, along with their relationships to 'GSS_' values (layouts) and
  10550. 'GIMPLE_' values (codes):
  10551. gimple
  10552. | layout: GSS_BASE
  10553. | used for 4 codes: GIMPLE_ERROR_MARK
  10554. | GIMPLE_NOP
  10555. | GIMPLE_OMP_SECTIONS_SWITCH
  10556. | GIMPLE_PREDICT
  10557. |
  10558. + gimple_statement_with_ops_base
  10559. | | (no GSS layout)
  10560. | |
  10561. | + gimple_statement_with_ops
  10562. | | | layout: GSS_WITH_OPS
  10563. | | |
  10564. | | + gcond
  10565. | | | code: GIMPLE_COND
  10566. | | |
  10567. | | + gdebug
  10568. | | | code: GIMPLE_DEBUG
  10569. | | |
  10570. | | + ggoto
  10571. | | | code: GIMPLE_GOTO
  10572. | | |
  10573. | | + glabel
  10574. | | | code: GIMPLE_LABEL
  10575. | | |
  10576. | | + gswitch
  10577. | | code: GIMPLE_SWITCH
  10578. | |
  10579. | + gimple_statement_with_memory_ops_base
  10580. | | layout: GSS_WITH_MEM_OPS_BASE
  10581. | |
  10582. | + gimple_statement_with_memory_ops
  10583. | | | layout: GSS_WITH_MEM_OPS
  10584. | | |
  10585. | | + gassign
  10586. | | | code GIMPLE_ASSIGN
  10587. | | |
  10588. | | + greturn
  10589. | | code GIMPLE_RETURN
  10590. | |
  10591. | + gcall
  10592. | | layout: GSS_CALL, code: GIMPLE_CALL
  10593. | |
  10594. | + gasm
  10595. | | layout: GSS_ASM, code: GIMPLE_ASM
  10596. | |
  10597. | + gtransaction
  10598. | layout: GSS_TRANSACTION, code: GIMPLE_TRANSACTION
  10599. |
  10600. + gimple_statement_omp
  10601. | | layout: GSS_OMP. Used for code GIMPLE_OMP_SECTION
  10602. | |
  10603. | + gomp_critical
  10604. | | layout: GSS_OMP_CRITICAL, code: GIMPLE_OMP_CRITICAL
  10605. | |
  10606. | + gomp_for
  10607. | | layout: GSS_OMP_FOR, code: GIMPLE_OMP_FOR
  10608. | |
  10609. | + gomp_parallel_layout
  10610. | | | layout: GSS_OMP_PARALLEL_LAYOUT
  10611. | | |
  10612. | | + gimple_statement_omp_taskreg
  10613. | | | |
  10614. | | | + gomp_parallel
  10615. | | | | code: GIMPLE_OMP_PARALLEL
  10616. | | | |
  10617. | | | + gomp_task
  10618. | | | code: GIMPLE_OMP_TASK
  10619. | | |
  10620. | | + gimple_statement_omp_target
  10621. | | code: GIMPLE_OMP_TARGET
  10622. | |
  10623. | + gomp_sections
  10624. | | layout: GSS_OMP_SECTIONS, code: GIMPLE_OMP_SECTIONS
  10625. | |
  10626. | + gimple_statement_omp_single_layout
  10627. | | layout: GSS_OMP_SINGLE_LAYOUT
  10628. | |
  10629. | + gomp_single
  10630. | | code: GIMPLE_OMP_SINGLE
  10631. | |
  10632. | + gomp_teams
  10633. | code: GIMPLE_OMP_TEAMS
  10634. |
  10635. + gbind
  10636. | layout: GSS_BIND, code: GIMPLE_BIND
  10637. |
  10638. + gcatch
  10639. | layout: GSS_CATCH, code: GIMPLE_CATCH
  10640. |
  10641. + geh_filter
  10642. | layout: GSS_EH_FILTER, code: GIMPLE_EH_FILTER
  10643. |
  10644. + geh_else
  10645. | layout: GSS_EH_ELSE, code: GIMPLE_EH_ELSE
  10646. |
  10647. + geh_mnt
  10648. | layout: GSS_EH_MNT, code: GIMPLE_EH_MUST_NOT_THROW
  10649. |
  10650. + gphi
  10651. | layout: GSS_PHI, code: GIMPLE_PHI
  10652. |
  10653. + gimple_statement_eh_ctrl
  10654. | | layout: GSS_EH_CTRL
  10655. | |
  10656. | + gresx
  10657. | | code: GIMPLE_RESX
  10658. | |
  10659. | + geh_dispatch
  10660. | code: GIMPLE_EH_DISPATCH
  10661. |
  10662. + gtry
  10663. | layout: GSS_TRY, code: GIMPLE_TRY
  10664. |
  10665. + gimple_statement_wce
  10666. | layout: GSS_WCE, code: GIMPLE_WITH_CLEANUP_EXPR
  10667. |
  10668. + gomp_continue
  10669. | layout: GSS_OMP_CONTINUE, code: GIMPLE_OMP_CONTINUE
  10670. |
  10671. + gomp_atomic_load
  10672. | layout: GSS_OMP_ATOMIC_LOAD, code: GIMPLE_OMP_ATOMIC_LOAD
  10673. |
  10674. + gimple_statement_omp_atomic_store_layout
  10675. | layout: GSS_OMP_ATOMIC_STORE_LAYOUT,
  10676. | code: GIMPLE_OMP_ATOMIC_STORE
  10677. |
  10678. + gomp_atomic_store
  10679. | code: GIMPLE_OMP_ATOMIC_STORE
  10680. |
  10681. + gomp_return
  10682. code: GIMPLE_OMP_RETURN
  10683. 
  10684. File: gccint.info, Node: GIMPLE instruction set, Next: GIMPLE Exception Handling, Prev: Class hierarchy of GIMPLE statements, Up: GIMPLE
  10685. 12.3 GIMPLE instruction set
  10686. ===========================
  10687. The following table briefly describes the GIMPLE instruction set.
  10688. Instruction High GIMPLE Low GIMPLE
  10689. 'GIMPLE_ASM' x x
  10690. 'GIMPLE_ASSIGN' x x
  10691. 'GIMPLE_BIND' x
  10692. 'GIMPLE_CALL' x x
  10693. 'GIMPLE_CATCH' x
  10694. 'GIMPLE_COND' x x
  10695. 'GIMPLE_DEBUG' x x
  10696. 'GIMPLE_EH_FILTER' x
  10697. 'GIMPLE_GOTO' x x
  10698. 'GIMPLE_LABEL' x x
  10699. 'GIMPLE_NOP' x x
  10700. 'GIMPLE_OMP_ATOMIC_LOAD' x x
  10701. 'GIMPLE_OMP_ATOMIC_STORE' x x
  10702. 'GIMPLE_OMP_CONTINUE' x x
  10703. 'GIMPLE_OMP_CRITICAL' x x
  10704. 'GIMPLE_OMP_FOR' x x
  10705. 'GIMPLE_OMP_MASTER' x x
  10706. 'GIMPLE_OMP_ORDERED' x x
  10707. 'GIMPLE_OMP_PARALLEL' x x
  10708. 'GIMPLE_OMP_RETURN' x x
  10709. 'GIMPLE_OMP_SECTION' x x
  10710. 'GIMPLE_OMP_SECTIONS' x x
  10711. 'GIMPLE_OMP_SECTIONS_SWITCH' x x
  10712. 'GIMPLE_OMP_SINGLE' x x
  10713. 'GIMPLE_PHI' x
  10714. 'GIMPLE_RESX' x
  10715. 'GIMPLE_RETURN' x x
  10716. 'GIMPLE_SWITCH' x x
  10717. 'GIMPLE_TRY' x
  10718. 
  10719. File: gccint.info, Node: GIMPLE Exception Handling, Next: Temporaries, Prev: GIMPLE instruction set, Up: GIMPLE
  10720. 12.4 Exception Handling
  10721. =======================
  10722. Other exception handling constructs are represented using
  10723. 'GIMPLE_TRY_CATCH'. 'GIMPLE_TRY_CATCH' has two operands. The first
  10724. operand is a sequence of statements to execute. If executing these
  10725. statements does not throw an exception, then the second operand is
  10726. ignored. Otherwise, if an exception is thrown, then the second operand
  10727. of the 'GIMPLE_TRY_CATCH' is checked. The second operand may have the
  10728. following forms:
  10729. 1. A sequence of statements to execute. When an exception occurs,
  10730. these statements are executed, and then the exception is rethrown.
  10731. 2. A sequence of 'GIMPLE_CATCH' statements. Each 'GIMPLE_CATCH' has a
  10732. list of applicable exception types and handler code. If the thrown
  10733. exception matches one of the caught types, the associated handler
  10734. code is executed. If the handler code falls off the bottom,
  10735. execution continues after the original 'GIMPLE_TRY_CATCH'.
  10736. 3. A 'GIMPLE_EH_FILTER' statement. This has a list of permitted
  10737. exception types, and code to handle a match failure. If the thrown
  10738. exception does not match one of the allowed types, the associated
  10739. match failure code is executed. If the thrown exception does
  10740. match, it continues unwinding the stack looking for the next
  10741. handler.
  10742. Currently throwing an exception is not directly represented in GIMPLE,
  10743. since it is implemented by calling a function. At some point in the
  10744. future we will want to add some way to express that the call will throw
  10745. an exception of a known type.
  10746. Just before running the optimizers, the compiler lowers the high-level
  10747. EH constructs above into a set of 'goto's, magic labels, and EH regions.
  10748. Continuing to unwind at the end of a cleanup is represented with a
  10749. 'GIMPLE_RESX'.
  10750. 
  10751. File: gccint.info, Node: Temporaries, Next: Operands, Prev: GIMPLE Exception Handling, Up: GIMPLE
  10752. 12.5 Temporaries
  10753. ================
  10754. When gimplification encounters a subexpression that is too complex, it
  10755. creates a new temporary variable to hold the value of the subexpression,
  10756. and adds a new statement to initialize it before the current statement.
  10757. These special temporaries are known as 'expression temporaries', and are
  10758. allocated using 'get_formal_tmp_var'. The compiler tries to always
  10759. evaluate identical expressions into the same temporary, to simplify
  10760. elimination of redundant calculations.
  10761. We can only use expression temporaries when we know that it will not be
  10762. reevaluated before its value is used, and that it will not be otherwise
  10763. modified(1). Other temporaries can be allocated using
  10764. 'get_initialized_tmp_var' or 'create_tmp_var'.
  10765. Currently, an expression like 'a = b + 5' is not reduced any further.
  10766. We tried converting it to something like
  10767. T1 = b + 5;
  10768. a = T1;
  10769. but this bloated the representation for minimal benefit. However, a
  10770. variable which must live in memory cannot appear in an expression; its
  10771. value is explicitly loaded into a temporary first. Similarly, storing
  10772. the value of an expression to a memory variable goes through a
  10773. temporary.
  10774. ---------- Footnotes ----------
  10775. (1) These restrictions are derived from those in Morgan 4.8.
  10776. 
  10777. File: gccint.info, Node: Operands, Next: Manipulating GIMPLE statements, Prev: Temporaries, Up: GIMPLE
  10778. 12.6 Operands
  10779. =============
  10780. In general, expressions in GIMPLE consist of an operation and the
  10781. appropriate number of simple operands; these operands must either be a
  10782. GIMPLE rvalue ('is_gimple_val'), i.e. a constant or a register variable.
  10783. More complex operands are factored out into temporaries, so that
  10784. a = b + c + d
  10785. becomes
  10786. T1 = b + c;
  10787. a = T1 + d;
  10788. The same rule holds for arguments to a 'GIMPLE_CALL'.
  10789. The target of an assignment is usually a variable, but can also be a
  10790. 'MEM_REF' or a compound lvalue as described below.
  10791. * Menu:
  10792. * Compound Expressions::
  10793. * Compound Lvalues::
  10794. * Conditional Expressions::
  10795. * Logical Operators::
  10796. 
  10797. File: gccint.info, Node: Compound Expressions, Next: Compound Lvalues, Up: Operands
  10798. 12.6.1 Compound Expressions
  10799. ---------------------------
  10800. The left-hand side of a C comma expression is simply moved into a
  10801. separate statement.
  10802. 
  10803. File: gccint.info, Node: Compound Lvalues, Next: Conditional Expressions, Prev: Compound Expressions, Up: Operands
  10804. 12.6.2 Compound Lvalues
  10805. -----------------------
  10806. Currently compound lvalues involving array and structure field
  10807. references are not broken down; an expression like 'a.b[2] = 42' is not
  10808. reduced any further (though complex array subscripts are). This
  10809. restriction is a workaround for limitations in later optimizers; if we
  10810. were to convert this to
  10811. T1 = &a.b;
  10812. T1[2] = 42;
  10813. alias analysis would not remember that the reference to 'T1[2]' came by
  10814. way of 'a.b', so it would think that the assignment could alias another
  10815. member of 'a'; this broke 'struct-alias-1.c'. Future optimizer
  10816. improvements may make this limitation unnecessary.
  10817. 
  10818. File: gccint.info, Node: Conditional Expressions, Next: Logical Operators, Prev: Compound Lvalues, Up: Operands
  10819. 12.6.3 Conditional Expressions
  10820. ------------------------------
  10821. A C '?:' expression is converted into an 'if' statement with each branch
  10822. assigning to the same temporary. So,
  10823. a = b ? c : d;
  10824. becomes
  10825. if (b == 1)
  10826. T1 = c;
  10827. else
  10828. T1 = d;
  10829. a = T1;
  10830. The GIMPLE level if-conversion pass re-introduces '?:' expression, if
  10831. appropriate. It is used to vectorize loops with conditions using vector
  10832. conditional operations.
  10833. Note that in GIMPLE, 'if' statements are represented using
  10834. 'GIMPLE_COND', as described below.
  10835. 
  10836. File: gccint.info, Node: Logical Operators, Prev: Conditional Expressions, Up: Operands
  10837. 12.6.4 Logical Operators
  10838. ------------------------
  10839. Except when they appear in the condition operand of a 'GIMPLE_COND',
  10840. logical 'and' and 'or' operators are simplified as follows: 'a = b && c'
  10841. becomes
  10842. T1 = (bool)b;
  10843. if (T1 == true)
  10844. T1 = (bool)c;
  10845. a = T1;
  10846. Note that 'T1' in this example cannot be an expression temporary,
  10847. because it has two different assignments.
  10848. 12.6.5 Manipulating operands
  10849. ----------------------------
  10850. All gimple operands are of type 'tree'. But only certain types of trees
  10851. are allowed to be used as operand tuples. Basic validation is
  10852. controlled by the function 'get_gimple_rhs_class', which given a tree
  10853. code, returns an 'enum' with the following values of type 'enum
  10854. gimple_rhs_class'
  10855. * 'GIMPLE_INVALID_RHS' The tree cannot be used as a GIMPLE operand.
  10856. * 'GIMPLE_TERNARY_RHS' The tree is a valid GIMPLE ternary operation.
  10857. * 'GIMPLE_BINARY_RHS' The tree is a valid GIMPLE binary operation.
  10858. * 'GIMPLE_UNARY_RHS' The tree is a valid GIMPLE unary operation.
  10859. * 'GIMPLE_SINGLE_RHS' The tree is a single object, that cannot be
  10860. split into simpler operands (for instance, 'SSA_NAME', 'VAR_DECL',
  10861. 'COMPONENT_REF', etc).
  10862. This operand class also acts as an escape hatch for tree nodes that
  10863. may be flattened out into the operand vector, but would need more
  10864. than two slots on the RHS. For instance, a 'COND_EXPR' expression
  10865. of the form '(a op b) ? x : y' could be flattened out on the
  10866. operand vector using 4 slots, but it would also require additional
  10867. processing to distinguish 'c = a op b' from 'c = a op b ? x : y'.
  10868. Something similar occurs with 'ASSERT_EXPR'. In time, these
  10869. special case tree expressions should be flattened into the operand
  10870. vector.
  10871. For tree nodes in the categories 'GIMPLE_TERNARY_RHS',
  10872. 'GIMPLE_BINARY_RHS' and 'GIMPLE_UNARY_RHS', they cannot be stored inside
  10873. tuples directly. They first need to be flattened and separated into
  10874. individual components. For instance, given the GENERIC expression
  10875. a = b + c
  10876. its tree representation is:
  10877. MODIFY_EXPR <VAR_DECL <a>, PLUS_EXPR <VAR_DECL <b>, VAR_DECL <c>>>
  10878. In this case, the GIMPLE form for this statement is logically identical
  10879. to its GENERIC form but in GIMPLE, the 'PLUS_EXPR' on the RHS of the
  10880. assignment is not represented as a tree, instead the two operands are
  10881. taken out of the 'PLUS_EXPR' sub-tree and flattened into the GIMPLE
  10882. tuple as follows:
  10883. GIMPLE_ASSIGN <PLUS_EXPR, VAR_DECL <a>, VAR_DECL <b>, VAR_DECL <c>>
  10884. 12.6.6 Operand vector allocation
  10885. --------------------------------
  10886. The operand vector is stored at the bottom of the three tuple structures
  10887. that accept operands. This means, that depending on the code of a given
  10888. statement, its operand vector will be at different offsets from the base
  10889. of the structure. To access tuple operands use the following accessors
  10890. -- GIMPLE function: unsigned gimple_num_ops (gimple g)
  10891. Returns the number of operands in statement G.
  10892. -- GIMPLE function: tree gimple_op (gimple g, unsigned i)
  10893. Returns operand 'I' from statement 'G'.
  10894. -- GIMPLE function: tree * gimple_ops (gimple g)
  10895. Returns a pointer into the operand vector for statement 'G'. This
  10896. is computed using an internal table called 'gimple_ops_offset_'[].
  10897. This table is indexed by the gimple code of 'G'.
  10898. When the compiler is built, this table is filled-in using the sizes
  10899. of the structures used by each statement code defined in
  10900. gimple.def. Since the operand vector is at the bottom of the
  10901. structure, for a gimple code 'C' the offset is computed as sizeof
  10902. (struct-of 'C') - sizeof (tree).
  10903. This mechanism adds one memory indirection to every access when
  10904. using 'gimple_op'(), if this becomes a bottleneck, a pass can
  10905. choose to memoize the result from 'gimple_ops'() and use that to
  10906. access the operands.
  10907. 12.6.7 Operand validation
  10908. -------------------------
  10909. When adding a new operand to a gimple statement, the operand will be
  10910. validated according to what each tuple accepts in its operand vector.
  10911. These predicates are called by the 'gimple_NAME_set_...()'. Each tuple
  10912. will use one of the following predicates (Note, this list is not
  10913. exhaustive):
  10914. -- GIMPLE function: bool is_gimple_val (tree t)
  10915. Returns true if t is a "GIMPLE value", which are all the
  10916. non-addressable stack variables (variables for which
  10917. 'is_gimple_reg' returns true) and constants (expressions for which
  10918. 'is_gimple_min_invariant' returns true).
  10919. -- GIMPLE function: bool is_gimple_addressable (tree t)
  10920. Returns true if t is a symbol or memory reference whose address can
  10921. be taken.
  10922. -- GIMPLE function: bool is_gimple_asm_val (tree t)
  10923. Similar to 'is_gimple_val' but it also accepts hard registers.
  10924. -- GIMPLE function: bool is_gimple_call_addr (tree t)
  10925. Return true if t is a valid expression to use as the function
  10926. called by a 'GIMPLE_CALL'.
  10927. -- GIMPLE function: bool is_gimple_mem_ref_addr (tree t)
  10928. Return true if t is a valid expression to use as first operand of a
  10929. 'MEM_REF' expression.
  10930. -- GIMPLE function: bool is_gimple_constant (tree t)
  10931. Return true if t is a valid gimple constant.
  10932. -- GIMPLE function: bool is_gimple_min_invariant (tree t)
  10933. Return true if t is a valid minimal invariant. This is different
  10934. from constants, in that the specific value of t may not be known at
  10935. compile time, but it is known that it doesn't change (e.g., the
  10936. address of a function local variable).
  10937. -- GIMPLE function: bool is_gimple_ip_invariant (tree t)
  10938. Return true if t is an interprocedural invariant. This means that
  10939. t is a valid invariant in all functions (e.g. it can be an address
  10940. of a global variable but not of a local one).
  10941. -- GIMPLE function: bool is_gimple_ip_invariant_address (tree t)
  10942. Return true if t is an 'ADDR_EXPR' that does not change once the
  10943. program is running (and which is valid in all functions).
  10944. 12.6.8 Statement validation
  10945. ---------------------------
  10946. -- GIMPLE function: bool is_gimple_assign (gimple g)
  10947. Return true if the code of g is 'GIMPLE_ASSIGN'.
  10948. -- GIMPLE function: bool is_gimple_call (gimple g)
  10949. Return true if the code of g is 'GIMPLE_CALL'.
  10950. -- GIMPLE function: bool is_gimple_debug (gimple g)
  10951. Return true if the code of g is 'GIMPLE_DEBUG'.
  10952. -- GIMPLE function: bool gimple_assign_cast_p (const_gimple g)
  10953. Return true if g is a 'GIMPLE_ASSIGN' that performs a type cast
  10954. operation.
  10955. -- GIMPLE function: bool gimple_debug_bind_p (gimple g)
  10956. Return true if g is a 'GIMPLE_DEBUG' that binds the value of an
  10957. expression to a variable.
  10958. -- GIMPLE function: bool is_gimple_omp (gimple g)
  10959. Return true if g is any of the OpenMP codes.
  10960. -- GIMPLE function: gimple_debug_begin_stmt_p (gimple g)
  10961. Return true if g is a 'GIMPLE_DEBUG' that marks the beginning of a
  10962. source statement.
  10963. -- GIMPLE function: gimple_debug_inline_entry_p (gimple g)
  10964. Return true if g is a 'GIMPLE_DEBUG' that marks the entry point of
  10965. an inlined function.
  10966. -- GIMPLE function: gimple_debug_nonbind_marker_p (gimple g)
  10967. Return true if g is a 'GIMPLE_DEBUG' that marks a program location,
  10968. without any variable binding.
  10969. 
  10970. File: gccint.info, Node: Manipulating GIMPLE statements, Next: Tuple specific accessors, Prev: Operands, Up: GIMPLE
  10971. 12.7 Manipulating GIMPLE statements
  10972. ===================================
  10973. This section documents all the functions available to handle each of the
  10974. GIMPLE instructions.
  10975. 12.7.1 Common accessors
  10976. -----------------------
  10977. The following are common accessors for gimple statements.
  10978. -- GIMPLE function: enum gimple_code gimple_code (gimple g)
  10979. Return the code for statement 'G'.
  10980. -- GIMPLE function: basic_block gimple_bb (gimple g)
  10981. Return the basic block to which statement 'G' belongs to.
  10982. -- GIMPLE function: tree gimple_block (gimple g)
  10983. Return the lexical scope block holding statement 'G'.
  10984. -- GIMPLE function: tree gimple_expr_type (gimple stmt)
  10985. Return the type of the main expression computed by 'STMT'. Return
  10986. 'void_type_node' if 'STMT' computes nothing. This will only return
  10987. something meaningful for 'GIMPLE_ASSIGN', 'GIMPLE_COND' and
  10988. 'GIMPLE_CALL'. For all other tuple codes, it will return
  10989. 'void_type_node'.
  10990. -- GIMPLE function: enum tree_code gimple_expr_code (gimple stmt)
  10991. Return the tree code for the expression computed by 'STMT'. This
  10992. is only meaningful for 'GIMPLE_CALL', 'GIMPLE_ASSIGN' and
  10993. 'GIMPLE_COND'. If 'STMT' is 'GIMPLE_CALL', it will return
  10994. 'CALL_EXPR'. For 'GIMPLE_COND', it returns the code of the
  10995. comparison predicate. For 'GIMPLE_ASSIGN' it returns the code of
  10996. the operation performed by the 'RHS' of the assignment.
  10997. -- GIMPLE function: void gimple_set_block (gimple g, tree block)
  10998. Set the lexical scope block of 'G' to 'BLOCK'.
  10999. -- GIMPLE function: location_t gimple_locus (gimple g)
  11000. Return locus information for statement 'G'.
  11001. -- GIMPLE function: void gimple_set_locus (gimple g, location_t locus)
  11002. Set locus information for statement 'G'.
  11003. -- GIMPLE function: bool gimple_locus_empty_p (gimple g)
  11004. Return true if 'G' does not have locus information.
  11005. -- GIMPLE function: bool gimple_no_warning_p (gimple stmt)
  11006. Return true if no warnings should be emitted for statement 'STMT'.
  11007. -- GIMPLE function: void gimple_set_visited (gimple stmt, bool
  11008. visited_p)
  11009. Set the visited status on statement 'STMT' to 'VISITED_P'.
  11010. -- GIMPLE function: bool gimple_visited_p (gimple stmt)
  11011. Return the visited status on statement 'STMT'.
  11012. -- GIMPLE function: void gimple_set_plf (gimple stmt, enum plf_mask
  11013. plf, bool val_p)
  11014. Set pass local flag 'PLF' on statement 'STMT' to 'VAL_P'.
  11015. -- GIMPLE function: unsigned int gimple_plf (gimple stmt, enum plf_mask
  11016. plf)
  11017. Return the value of pass local flag 'PLF' on statement 'STMT'.
  11018. -- GIMPLE function: bool gimple_has_ops (gimple g)
  11019. Return true if statement 'G' has register or memory operands.
  11020. -- GIMPLE function: bool gimple_has_mem_ops (gimple g)
  11021. Return true if statement 'G' has memory operands.
  11022. -- GIMPLE function: unsigned gimple_num_ops (gimple g)
  11023. Return the number of operands for statement 'G'.
  11024. -- GIMPLE function: tree * gimple_ops (gimple g)
  11025. Return the array of operands for statement 'G'.
  11026. -- GIMPLE function: tree gimple_op (gimple g, unsigned i)
  11027. Return operand 'I' for statement 'G'.
  11028. -- GIMPLE function: tree * gimple_op_ptr (gimple g, unsigned i)
  11029. Return a pointer to operand 'I' for statement 'G'.
  11030. -- GIMPLE function: void gimple_set_op (gimple g, unsigned i, tree op)
  11031. Set operand 'I' of statement 'G' to 'OP'.
  11032. -- GIMPLE function: bitmap gimple_addresses_taken (gimple stmt)
  11033. Return the set of symbols that have had their address taken by
  11034. 'STMT'.
  11035. -- GIMPLE function: struct def_optype_d * gimple_def_ops (gimple g)
  11036. Return the set of 'DEF' operands for statement 'G'.
  11037. -- GIMPLE function: void gimple_set_def_ops (gimple g, struct
  11038. def_optype_d *def)
  11039. Set 'DEF' to be the set of 'DEF' operands for statement 'G'.
  11040. -- GIMPLE function: struct use_optype_d * gimple_use_ops (gimple g)
  11041. Return the set of 'USE' operands for statement 'G'.
  11042. -- GIMPLE function: void gimple_set_use_ops (gimple g, struct
  11043. use_optype_d *use)
  11044. Set 'USE' to be the set of 'USE' operands for statement 'G'.
  11045. -- GIMPLE function: struct voptype_d * gimple_vuse_ops (gimple g)
  11046. Return the set of 'VUSE' operands for statement 'G'.
  11047. -- GIMPLE function: void gimple_set_vuse_ops (gimple g, struct
  11048. voptype_d *ops)
  11049. Set 'OPS' to be the set of 'VUSE' operands for statement 'G'.
  11050. -- GIMPLE function: struct voptype_d * gimple_vdef_ops (gimple g)
  11051. Return the set of 'VDEF' operands for statement 'G'.
  11052. -- GIMPLE function: void gimple_set_vdef_ops (gimple g, struct
  11053. voptype_d *ops)
  11054. Set 'OPS' to be the set of 'VDEF' operands for statement 'G'.
  11055. -- GIMPLE function: bitmap gimple_loaded_syms (gimple g)
  11056. Return the set of symbols loaded by statement 'G'. Each element of
  11057. the set is the 'DECL_UID' of the corresponding symbol.
  11058. -- GIMPLE function: bitmap gimple_stored_syms (gimple g)
  11059. Return the set of symbols stored by statement 'G'. Each element of
  11060. the set is the 'DECL_UID' of the corresponding symbol.
  11061. -- GIMPLE function: bool gimple_modified_p (gimple g)
  11062. Return true if statement 'G' has operands and the modified field
  11063. has been set.
  11064. -- GIMPLE function: bool gimple_has_volatile_ops (gimple stmt)
  11065. Return true if statement 'STMT' contains volatile operands.
  11066. -- GIMPLE function: void gimple_set_has_volatile_ops (gimple stmt, bool
  11067. volatilep)
  11068. Return true if statement 'STMT' contains volatile operands.
  11069. -- GIMPLE function: void update_stmt (gimple s)
  11070. Mark statement 'S' as modified, and update it.
  11071. -- GIMPLE function: void update_stmt_if_modified (gimple s)
  11072. Update statement 'S' if it has been marked modified.
  11073. -- GIMPLE function: gimple gimple_copy (gimple stmt)
  11074. Return a deep copy of statement 'STMT'.
  11075. 
  11076. File: gccint.info, Node: Tuple specific accessors, Next: GIMPLE sequences, Prev: Manipulating GIMPLE statements, Up: GIMPLE
  11077. 12.8 Tuple specific accessors
  11078. =============================
  11079. * Menu:
  11080. * GIMPLE_ASM::
  11081. * GIMPLE_ASSIGN::
  11082. * GIMPLE_BIND::
  11083. * GIMPLE_CALL::
  11084. * GIMPLE_CATCH::
  11085. * GIMPLE_COND::
  11086. * GIMPLE_DEBUG::
  11087. * GIMPLE_EH_FILTER::
  11088. * GIMPLE_LABEL::
  11089. * GIMPLE_GOTO::
  11090. * GIMPLE_NOP::
  11091. * GIMPLE_OMP_ATOMIC_LOAD::
  11092. * GIMPLE_OMP_ATOMIC_STORE::
  11093. * GIMPLE_OMP_CONTINUE::
  11094. * GIMPLE_OMP_CRITICAL::
  11095. * GIMPLE_OMP_FOR::
  11096. * GIMPLE_OMP_MASTER::
  11097. * GIMPLE_OMP_ORDERED::
  11098. * GIMPLE_OMP_PARALLEL::
  11099. * GIMPLE_OMP_RETURN::
  11100. * GIMPLE_OMP_SECTION::
  11101. * GIMPLE_OMP_SECTIONS::
  11102. * GIMPLE_OMP_SINGLE::
  11103. * GIMPLE_PHI::
  11104. * GIMPLE_RESX::
  11105. * GIMPLE_RETURN::
  11106. * GIMPLE_SWITCH::
  11107. * GIMPLE_TRY::
  11108. * GIMPLE_WITH_CLEANUP_EXPR::
  11109. 
  11110. File: gccint.info, Node: GIMPLE_ASM, Next: GIMPLE_ASSIGN, Up: Tuple specific accessors
  11111. 12.8.1 'GIMPLE_ASM'
  11112. -------------------
  11113. -- GIMPLE function: gasm *gimple_build_asm_vec ( const char *string,
  11114. vec<tree, va_gc> *inputs, vec<tree, va_gc> *outputs, vec<tree,
  11115. va_gc> *clobbers, vec<tree, va_gc> *labels)
  11116. Build a 'GIMPLE_ASM' statement. This statement is used for
  11117. building in-line assembly constructs. 'STRING' is the assembly
  11118. code. 'INPUTS', 'OUTPUTS', 'CLOBBERS' and 'LABELS' are the inputs,
  11119. outputs, clobbered registers and labels.
  11120. -- GIMPLE function: unsigned gimple_asm_ninputs (const gasm *g)
  11121. Return the number of input operands for 'GIMPLE_ASM' 'G'.
  11122. -- GIMPLE function: unsigned gimple_asm_noutputs (const gasm *g)
  11123. Return the number of output operands for 'GIMPLE_ASM' 'G'.
  11124. -- GIMPLE function: unsigned gimple_asm_nclobbers (const gasm *g)
  11125. Return the number of clobber operands for 'GIMPLE_ASM' 'G'.
  11126. -- GIMPLE function: tree gimple_asm_input_op (const gasm *g, unsigned
  11127. index)
  11128. Return input operand 'INDEX' of 'GIMPLE_ASM' 'G'.
  11129. -- GIMPLE function: void gimple_asm_set_input_op (gasm *g, unsigned
  11130. index, tree in_op)
  11131. Set 'IN_OP' to be input operand 'INDEX' in 'GIMPLE_ASM' 'G'.
  11132. -- GIMPLE function: tree gimple_asm_output_op (const gasm *g, unsigned
  11133. index)
  11134. Return output operand 'INDEX' of 'GIMPLE_ASM' 'G'.
  11135. -- GIMPLE function: void gimple_asm_set_output_op (gasm *g, unsigned
  11136. index, tree out_op)
  11137. Set 'OUT_OP' to be output operand 'INDEX' in 'GIMPLE_ASM' 'G'.
  11138. -- GIMPLE function: tree gimple_asm_clobber_op (const gasm *g, unsigned
  11139. index)
  11140. Return clobber operand 'INDEX' of 'GIMPLE_ASM' 'G'.
  11141. -- GIMPLE function: void gimple_asm_set_clobber_op (gasm *g, unsigned
  11142. index, tree clobber_op)
  11143. Set 'CLOBBER_OP' to be clobber operand 'INDEX' in 'GIMPLE_ASM' 'G'.
  11144. -- GIMPLE function: const char * gimple_asm_string (const gasm *g)
  11145. Return the string representing the assembly instruction in
  11146. 'GIMPLE_ASM' 'G'.
  11147. -- GIMPLE function: bool gimple_asm_volatile_p (const gasm *g)
  11148. Return true if 'G' is an asm statement marked volatile.
  11149. -- GIMPLE function: void gimple_asm_set_volatile (gasm *g, bool
  11150. volatile_p)
  11151. Mark asm statement 'G' as volatile or non-volatile based on
  11152. 'VOLATILE_P'.
  11153. 
  11154. File: gccint.info, Node: GIMPLE_ASSIGN, Next: GIMPLE_BIND, Prev: GIMPLE_ASM, Up: Tuple specific accessors
  11155. 12.8.2 'GIMPLE_ASSIGN'
  11156. ----------------------
  11157. -- GIMPLE function: gassign *gimple_build_assign (tree lhs, tree rhs)
  11158. Build a 'GIMPLE_ASSIGN' statement. The left-hand side is an lvalue
  11159. passed in lhs. The right-hand side can be either a unary or binary
  11160. tree expression. The expression tree rhs will be flattened and its
  11161. operands assigned to the corresponding operand slots in the new
  11162. statement. This function is useful when you already have a tree
  11163. expression that you want to convert into a tuple. However, try to
  11164. avoid building expression trees for the sole purpose of calling
  11165. this function. If you already have the operands in separate trees,
  11166. it is better to use 'gimple_build_assign' with 'enum tree_code'
  11167. argument and separate arguments for each operand.
  11168. -- GIMPLE function: gassign *gimple_build_assign (tree lhs, enum
  11169. tree_code subcode, tree op1, tree op2, tree op3)
  11170. This function is similar to two operand 'gimple_build_assign', but
  11171. is used to build a 'GIMPLE_ASSIGN' statement when the operands of
  11172. the right-hand side of the assignment are already split into
  11173. different operands.
  11174. The left-hand side is an lvalue passed in lhs. Subcode is the
  11175. 'tree_code' for the right-hand side of the assignment. Op1, op2
  11176. and op3 are the operands.
  11177. -- GIMPLE function: gassign *gimple_build_assign (tree lhs, enum
  11178. tree_code subcode, tree op1, tree op2)
  11179. Like the above 5 operand 'gimple_build_assign', but with the last
  11180. argument 'NULL' - this overload should not be used for
  11181. 'GIMPLE_TERNARY_RHS' assignments.
  11182. -- GIMPLE function: gassign *gimple_build_assign (tree lhs, enum
  11183. tree_code subcode, tree op1)
  11184. Like the above 4 operand 'gimple_build_assign', but with the last
  11185. argument 'NULL' - this overload should be used only for
  11186. 'GIMPLE_UNARY_RHS' and 'GIMPLE_SINGLE_RHS' assignments.
  11187. -- GIMPLE function: gimple gimplify_assign (tree dst, tree src,
  11188. gimple_seq *seq_p)
  11189. Build a new 'GIMPLE_ASSIGN' tuple and append it to the end of
  11190. '*SEQ_P'.
  11191. 'DST'/'SRC' are the destination and source respectively. You can pass
  11192. ungimplified trees in 'DST' or 'SRC', in which case they will be
  11193. converted to a gimple operand if necessary.
  11194. This function returns the newly created 'GIMPLE_ASSIGN' tuple.
  11195. -- GIMPLE function: enum tree_code gimple_assign_rhs_code (gimple g)
  11196. Return the code of the expression computed on the 'RHS' of
  11197. assignment statement 'G'.
  11198. -- GIMPLE function: enum gimple_rhs_class gimple_assign_rhs_class
  11199. (gimple g)
  11200. Return the gimple rhs class of the code for the expression computed
  11201. on the rhs of assignment statement 'G'. This will never return
  11202. 'GIMPLE_INVALID_RHS'.
  11203. -- GIMPLE function: tree gimple_assign_lhs (gimple g)
  11204. Return the 'LHS' of assignment statement 'G'.
  11205. -- GIMPLE function: tree * gimple_assign_lhs_ptr (gimple g)
  11206. Return a pointer to the 'LHS' of assignment statement 'G'.
  11207. -- GIMPLE function: tree gimple_assign_rhs1 (gimple g)
  11208. Return the first operand on the 'RHS' of assignment statement 'G'.
  11209. -- GIMPLE function: tree * gimple_assign_rhs1_ptr (gimple g)
  11210. Return the address of the first operand on the 'RHS' of assignment
  11211. statement 'G'.
  11212. -- GIMPLE function: tree gimple_assign_rhs2 (gimple g)
  11213. Return the second operand on the 'RHS' of assignment statement 'G'.
  11214. -- GIMPLE function: tree * gimple_assign_rhs2_ptr (gimple g)
  11215. Return the address of the second operand on the 'RHS' of assignment
  11216. statement 'G'.
  11217. -- GIMPLE function: tree gimple_assign_rhs3 (gimple g)
  11218. Return the third operand on the 'RHS' of assignment statement 'G'.
  11219. -- GIMPLE function: tree * gimple_assign_rhs3_ptr (gimple g)
  11220. Return the address of the third operand on the 'RHS' of assignment
  11221. statement 'G'.
  11222. -- GIMPLE function: void gimple_assign_set_lhs (gimple g, tree lhs)
  11223. Set 'LHS' to be the 'LHS' operand of assignment statement 'G'.
  11224. -- GIMPLE function: void gimple_assign_set_rhs1 (gimple g, tree rhs)
  11225. Set 'RHS' to be the first operand on the 'RHS' of assignment
  11226. statement 'G'.
  11227. -- GIMPLE function: void gimple_assign_set_rhs2 (gimple g, tree rhs)
  11228. Set 'RHS' to be the second operand on the 'RHS' of assignment
  11229. statement 'G'.
  11230. -- GIMPLE function: void gimple_assign_set_rhs3 (gimple g, tree rhs)
  11231. Set 'RHS' to be the third operand on the 'RHS' of assignment
  11232. statement 'G'.
  11233. -- GIMPLE function: bool gimple_assign_cast_p (const_gimple s)
  11234. Return true if 'S' is a type-cast assignment.
  11235. 
  11236. File: gccint.info, Node: GIMPLE_BIND, Next: GIMPLE_CALL, Prev: GIMPLE_ASSIGN, Up: Tuple specific accessors
  11237. 12.8.3 'GIMPLE_BIND'
  11238. --------------------
  11239. -- GIMPLE function: gbind *gimple_build_bind (tree vars, gimple_seq
  11240. body)
  11241. Build a 'GIMPLE_BIND' statement with a list of variables in 'VARS'
  11242. and a body of statements in sequence 'BODY'.
  11243. -- GIMPLE function: tree gimple_bind_vars (const gbind *g)
  11244. Return the variables declared in the 'GIMPLE_BIND' statement 'G'.
  11245. -- GIMPLE function: void gimple_bind_set_vars (gbind *g, tree vars)
  11246. Set 'VARS' to be the set of variables declared in the 'GIMPLE_BIND'
  11247. statement 'G'.
  11248. -- GIMPLE function: void gimple_bind_append_vars (gbind *g, tree vars)
  11249. Append 'VARS' to the set of variables declared in the 'GIMPLE_BIND'
  11250. statement 'G'.
  11251. -- GIMPLE function: gimple_seq gimple_bind_body (gbind *g)
  11252. Return the GIMPLE sequence contained in the 'GIMPLE_BIND' statement
  11253. 'G'.
  11254. -- GIMPLE function: void gimple_bind_set_body (gbind *g, gimple_seq
  11255. seq)
  11256. Set 'SEQ' to be sequence contained in the 'GIMPLE_BIND' statement
  11257. 'G'.
  11258. -- GIMPLE function: void gimple_bind_add_stmt (gbind *gs, gimple stmt)
  11259. Append a statement to the end of a 'GIMPLE_BIND''s body.
  11260. -- GIMPLE function: void gimple_bind_add_seq (gbind *gs, gimple_seq
  11261. seq)
  11262. Append a sequence of statements to the end of a 'GIMPLE_BIND''s
  11263. body.
  11264. -- GIMPLE function: tree gimple_bind_block (const gbind *g)
  11265. Return the 'TREE_BLOCK' node associated with 'GIMPLE_BIND'
  11266. statement 'G'. This is analogous to the 'BIND_EXPR_BLOCK' field in
  11267. trees.
  11268. -- GIMPLE function: void gimple_bind_set_block (gbind *g, tree block)
  11269. Set 'BLOCK' to be the 'TREE_BLOCK' node associated with
  11270. 'GIMPLE_BIND' statement 'G'.
  11271. 
  11272. File: gccint.info, Node: GIMPLE_CALL, Next: GIMPLE_CATCH, Prev: GIMPLE_BIND, Up: Tuple specific accessors
  11273. 12.8.4 'GIMPLE_CALL'
  11274. --------------------
  11275. -- GIMPLE function: gcall *gimple_build_call (tree fn, unsigned nargs,
  11276. ...)
  11277. Build a 'GIMPLE_CALL' statement to function 'FN'. The argument
  11278. 'FN' must be either a 'FUNCTION_DECL' or a gimple call address as
  11279. determined by 'is_gimple_call_addr'. 'NARGS' are the number of
  11280. arguments. The rest of the arguments follow the argument 'NARGS',
  11281. and must be trees that are valid as rvalues in gimple (i.e., each
  11282. operand is validated with 'is_gimple_operand').
  11283. -- GIMPLE function: gcall *gimple_build_call_from_tree (tree call_expr,
  11284. tree fnptrtype)
  11285. Build a 'GIMPLE_CALL' from a 'CALL_EXPR' node. The arguments and
  11286. the function are taken from the expression directly. The type of
  11287. the 'GIMPLE_CALL' is set from the second parameter passed by a
  11288. caller. This routine assumes that 'call_expr' is already in GIMPLE
  11289. form. That is, its operands are GIMPLE values and the function
  11290. call needs no further simplification. All the call flags in
  11291. 'call_expr' are copied over to the new 'GIMPLE_CALL'.
  11292. -- GIMPLE function: gcall *gimple_build_call_vec (tree fn, 'vec<tree>'
  11293. args)
  11294. Identical to 'gimple_build_call' but the arguments are stored in a
  11295. 'vec<tree>'.
  11296. -- GIMPLE function: tree gimple_call_lhs (gimple g)
  11297. Return the 'LHS' of call statement 'G'.
  11298. -- GIMPLE function: tree * gimple_call_lhs_ptr (gimple g)
  11299. Return a pointer to the 'LHS' of call statement 'G'.
  11300. -- GIMPLE function: void gimple_call_set_lhs (gimple g, tree lhs)
  11301. Set 'LHS' to be the 'LHS' operand of call statement 'G'.
  11302. -- GIMPLE function: tree gimple_call_fn (gimple g)
  11303. Return the tree node representing the function called by call
  11304. statement 'G'.
  11305. -- GIMPLE function: void gimple_call_set_fn (gcall *g, tree fn)
  11306. Set 'FN' to be the function called by call statement 'G'. This has
  11307. to be a gimple value specifying the address of the called function.
  11308. -- GIMPLE function: tree gimple_call_fndecl (gimple g)
  11309. If a given 'GIMPLE_CALL''s callee is a 'FUNCTION_DECL', return it.
  11310. Otherwise return 'NULL'. This function is analogous to
  11311. 'get_callee_fndecl' in 'GENERIC'.
  11312. -- GIMPLE function: tree gimple_call_set_fndecl (gimple g, tree fndecl)
  11313. Set the called function to 'FNDECL'.
  11314. -- GIMPLE function: tree gimple_call_return_type (const gcall *g)
  11315. Return the type returned by call statement 'G'.
  11316. -- GIMPLE function: tree gimple_call_chain (gimple g)
  11317. Return the static chain for call statement 'G'.
  11318. -- GIMPLE function: void gimple_call_set_chain (gcall *g, tree chain)
  11319. Set 'CHAIN' to be the static chain for call statement 'G'.
  11320. -- GIMPLE function: unsigned gimple_call_num_args (gimple g)
  11321. Return the number of arguments used by call statement 'G'.
  11322. -- GIMPLE function: tree gimple_call_arg (gimple g, unsigned index)
  11323. Return the argument at position 'INDEX' for call statement 'G'.
  11324. The first argument is 0.
  11325. -- GIMPLE function: tree * gimple_call_arg_ptr (gimple g, unsigned
  11326. index)
  11327. Return a pointer to the argument at position 'INDEX' for call
  11328. statement 'G'.
  11329. -- GIMPLE function: void gimple_call_set_arg (gimple g, unsigned index,
  11330. tree arg)
  11331. Set 'ARG' to be the argument at position 'INDEX' for call statement
  11332. 'G'.
  11333. -- GIMPLE function: void gimple_call_set_tail (gcall *s)
  11334. Mark call statement 'S' as being a tail call (i.e., a call just
  11335. before the exit of a function). These calls are candidate for tail
  11336. call optimization.
  11337. -- GIMPLE function: bool gimple_call_tail_p (gcall *s)
  11338. Return true if 'GIMPLE_CALL' 'S' is marked as a tail call.
  11339. -- GIMPLE function: bool gimple_call_noreturn_p (gimple s)
  11340. Return true if 'S' is a noreturn call.
  11341. -- GIMPLE function: gimple gimple_call_copy_skip_args (gcall *stmt,
  11342. bitmap args_to_skip)
  11343. Build a 'GIMPLE_CALL' identical to 'STMT' but skipping the
  11344. arguments in the positions marked by the set 'ARGS_TO_SKIP'.
  11345. 
  11346. File: gccint.info, Node: GIMPLE_CATCH, Next: GIMPLE_COND, Prev: GIMPLE_CALL, Up: Tuple specific accessors
  11347. 12.8.5 'GIMPLE_CATCH'
  11348. ---------------------
  11349. -- GIMPLE function: gcatch *gimple_build_catch (tree types, gimple_seq
  11350. handler)
  11351. Build a 'GIMPLE_CATCH' statement. 'TYPES' are the tree types this
  11352. catch handles. 'HANDLER' is a sequence of statements with the code
  11353. for the handler.
  11354. -- GIMPLE function: tree gimple_catch_types (const gcatch *g)
  11355. Return the types handled by 'GIMPLE_CATCH' statement 'G'.
  11356. -- GIMPLE function: tree * gimple_catch_types_ptr (gcatch *g)
  11357. Return a pointer to the types handled by 'GIMPLE_CATCH' statement
  11358. 'G'.
  11359. -- GIMPLE function: gimple_seq gimple_catch_handler (gcatch *g)
  11360. Return the GIMPLE sequence representing the body of the handler of
  11361. 'GIMPLE_CATCH' statement 'G'.
  11362. -- GIMPLE function: void gimple_catch_set_types (gcatch *g, tree t)
  11363. Set 'T' to be the set of types handled by 'GIMPLE_CATCH' 'G'.
  11364. -- GIMPLE function: void gimple_catch_set_handler (gcatch *g,
  11365. gimple_seq handler)
  11366. Set 'HANDLER' to be the body of 'GIMPLE_CATCH' 'G'.
  11367. 
  11368. File: gccint.info, Node: GIMPLE_COND, Next: GIMPLE_DEBUG, Prev: GIMPLE_CATCH, Up: Tuple specific accessors
  11369. 12.8.6 'GIMPLE_COND'
  11370. --------------------
  11371. -- GIMPLE function: gcond *gimple_build_cond ( enum tree_code
  11372. pred_code, tree lhs, tree rhs, tree t_label, tree f_label)
  11373. Build a 'GIMPLE_COND' statement. 'A' 'GIMPLE_COND' statement
  11374. compares 'LHS' and 'RHS' and if the condition in 'PRED_CODE' is
  11375. true, jump to the label in 't_label', otherwise jump to the label
  11376. in 'f_label'. 'PRED_CODE' are relational operator tree codes like
  11377. 'EQ_EXPR', 'LT_EXPR', 'LE_EXPR', 'NE_EXPR', etc.
  11378. -- GIMPLE function: gcond *gimple_build_cond_from_tree (tree cond, tree
  11379. t_label, tree f_label)
  11380. Build a 'GIMPLE_COND' statement from the conditional expression
  11381. tree 'COND'. 'T_LABEL' and 'F_LABEL' are as in
  11382. 'gimple_build_cond'.
  11383. -- GIMPLE function: enum tree_code gimple_cond_code (gimple g)
  11384. Return the code of the predicate computed by conditional statement
  11385. 'G'.
  11386. -- GIMPLE function: void gimple_cond_set_code (gcond *g, enum tree_code
  11387. code)
  11388. Set 'CODE' to be the predicate code for the conditional statement
  11389. 'G'.
  11390. -- GIMPLE function: tree gimple_cond_lhs (gimple g)
  11391. Return the 'LHS' of the predicate computed by conditional statement
  11392. 'G'.
  11393. -- GIMPLE function: void gimple_cond_set_lhs (gcond *g, tree lhs)
  11394. Set 'LHS' to be the 'LHS' operand of the predicate computed by
  11395. conditional statement 'G'.
  11396. -- GIMPLE function: tree gimple_cond_rhs (gimple g)
  11397. Return the 'RHS' operand of the predicate computed by conditional
  11398. 'G'.
  11399. -- GIMPLE function: void gimple_cond_set_rhs (gcond *g, tree rhs)
  11400. Set 'RHS' to be the 'RHS' operand of the predicate computed by
  11401. conditional statement 'G'.
  11402. -- GIMPLE function: tree gimple_cond_true_label (const gcond *g)
  11403. Return the label used by conditional statement 'G' when its
  11404. predicate evaluates to true.
  11405. -- GIMPLE function: void gimple_cond_set_true_label (gcond *g, tree
  11406. label)
  11407. Set 'LABEL' to be the label used by conditional statement 'G' when
  11408. its predicate evaluates to true.
  11409. -- GIMPLE function: void gimple_cond_set_false_label (gcond *g, tree
  11410. label)
  11411. Set 'LABEL' to be the label used by conditional statement 'G' when
  11412. its predicate evaluates to false.
  11413. -- GIMPLE function: tree gimple_cond_false_label (const gcond *g)
  11414. Return the label used by conditional statement 'G' when its
  11415. predicate evaluates to false.
  11416. -- GIMPLE function: void gimple_cond_make_false (gcond *g)
  11417. Set the conditional 'COND_STMT' to be of the form 'if (1 == 0)'.
  11418. -- GIMPLE function: void gimple_cond_make_true (gcond *g)
  11419. Set the conditional 'COND_STMT' to be of the form 'if (1 == 1)'.
  11420. 
  11421. File: gccint.info, Node: GIMPLE_DEBUG, Next: GIMPLE_EH_FILTER, Prev: GIMPLE_COND, Up: Tuple specific accessors
  11422. 12.8.7 'GIMPLE_DEBUG'
  11423. ---------------------
  11424. -- GIMPLE function: gdebug *gimple_build_debug_bind (tree var, tree
  11425. value, gimple stmt)
  11426. Build a 'GIMPLE_DEBUG' statement with 'GIMPLE_DEBUG_BIND'
  11427. 'subcode'. The effect of this statement is to tell debug
  11428. information generation machinery that the value of user variable
  11429. 'var' is given by 'value' at that point, and to remain with that
  11430. value until 'var' runs out of scope, a dynamically-subsequent debug
  11431. bind statement overrides the binding, or conflicting values reach a
  11432. control flow merge point. Even if components of the 'value'
  11433. expression change afterwards, the variable is supposed to retain
  11434. the same value, though not necessarily the same location.
  11435. It is expected that 'var' be most often a tree for automatic user
  11436. variables ('VAR_DECL' or 'PARM_DECL') that satisfy the requirements
  11437. for gimple registers, but it may also be a tree for a scalarized
  11438. component of a user variable ('ARRAY_REF', 'COMPONENT_REF'), or a
  11439. debug temporary ('DEBUG_EXPR_DECL').
  11440. As for 'value', it can be an arbitrary tree expression, but it is
  11441. recommended that it be in a suitable form for a gimple assignment
  11442. 'RHS'. It is not expected that user variables that could appear as
  11443. 'var' ever appear in 'value', because in the latter we'd have their
  11444. 'SSA_NAME's instead, but even if they were not in SSA form, user
  11445. variables appearing in 'value' are to be regarded as part of the
  11446. executable code space, whereas those in 'var' are to be regarded as
  11447. part of the source code space. There is no way to refer to the
  11448. value bound to a user variable within a 'value' expression.
  11449. If 'value' is 'GIMPLE_DEBUG_BIND_NOVALUE', debug information
  11450. generation machinery is informed that the variable 'var' is
  11451. unbound, i.e., that its value is indeterminate, which sometimes
  11452. means it is really unavailable, and other times that the compiler
  11453. could not keep track of it.
  11454. Block and location information for the newly-created stmt are taken
  11455. from 'stmt', if given.
  11456. -- GIMPLE function: tree gimple_debug_bind_get_var (gimple stmt)
  11457. Return the user variable VAR that is bound at 'stmt'.
  11458. -- GIMPLE function: tree gimple_debug_bind_get_value (gimple stmt)
  11459. Return the value expression that is bound to a user variable at
  11460. 'stmt'.
  11461. -- GIMPLE function: tree * gimple_debug_bind_get_value_ptr (gimple
  11462. stmt)
  11463. Return a pointer to the value expression that is bound to a user
  11464. variable at 'stmt'.
  11465. -- GIMPLE function: void gimple_debug_bind_set_var (gimple stmt, tree
  11466. var)
  11467. Modify the user variable bound at 'stmt' to VAR.
  11468. -- GIMPLE function: void gimple_debug_bind_set_value (gimple stmt, tree
  11469. var)
  11470. Modify the value bound to the user variable bound at 'stmt' to
  11471. VALUE.
  11472. -- GIMPLE function: void gimple_debug_bind_reset_value (gimple stmt)
  11473. Modify the value bound to the user variable bound at 'stmt' so that
  11474. the variable becomes unbound.
  11475. -- GIMPLE function: bool gimple_debug_bind_has_value_p (gimple stmt)
  11476. Return 'TRUE' if 'stmt' binds a user variable to a value, and
  11477. 'FALSE' if it unbinds the variable.
  11478. -- GIMPLE function: gimple gimple_build_debug_begin_stmt (tree block,
  11479. location_t location)
  11480. Build a 'GIMPLE_DEBUG' statement with 'GIMPLE_DEBUG_BEGIN_STMT'
  11481. 'subcode'. The effect of this statement is to tell debug
  11482. information generation machinery that the user statement at the
  11483. given 'location' and 'block' starts at the point at which the
  11484. statement is inserted. The intent is that side effects (e.g.
  11485. variable bindings) of all prior user statements are observable, and
  11486. that none of the side effects of subsequent user statements are.
  11487. -- GIMPLE function: gimple gimple_build_debug_inline_entry (tree block,
  11488. location_t location)
  11489. Build a 'GIMPLE_DEBUG' statement with 'GIMPLE_DEBUG_INLINE_ENTRY'
  11490. 'subcode'. The effect of this statement is to tell debug
  11491. information generation machinery that a function call at 'location'
  11492. underwent inline substitution, that 'block' is the enclosing
  11493. lexical block created for the substitution, and that at the point
  11494. of the program in which the stmt is inserted, all parameters for
  11495. the inlined function are bound to the respective arguments, and
  11496. none of the side effects of its stmts are observable.
  11497. 
  11498. File: gccint.info, Node: GIMPLE_EH_FILTER, Next: GIMPLE_LABEL, Prev: GIMPLE_DEBUG, Up: Tuple specific accessors
  11499. 12.8.8 'GIMPLE_EH_FILTER'
  11500. -------------------------
  11501. -- GIMPLE function: geh_filter *gimple_build_eh_filter (tree types,
  11502. gimple_seq failure)
  11503. Build a 'GIMPLE_EH_FILTER' statement. 'TYPES' are the filter's
  11504. types. 'FAILURE' is a sequence with the filter's failure action.
  11505. -- GIMPLE function: tree gimple_eh_filter_types (gimple g)
  11506. Return the types handled by 'GIMPLE_EH_FILTER' statement 'G'.
  11507. -- GIMPLE function: tree * gimple_eh_filter_types_ptr (gimple g)
  11508. Return a pointer to the types handled by 'GIMPLE_EH_FILTER'
  11509. statement 'G'.
  11510. -- GIMPLE function: gimple_seq gimple_eh_filter_failure (gimple g)
  11511. Return the sequence of statement to execute when 'GIMPLE_EH_FILTER'
  11512. statement fails.
  11513. -- GIMPLE function: void gimple_eh_filter_set_types (geh_filter *g,
  11514. tree types)
  11515. Set 'TYPES' to be the set of types handled by 'GIMPLE_EH_FILTER'
  11516. 'G'.
  11517. -- GIMPLE function: void gimple_eh_filter_set_failure (geh_filter *g,
  11518. gimple_seq failure)
  11519. Set 'FAILURE' to be the sequence of statements to execute on
  11520. failure for 'GIMPLE_EH_FILTER' 'G'.
  11521. -- GIMPLE function: tree gimple_eh_must_not_throw_fndecl ( geh_mnt
  11522. *eh_mnt_stmt)
  11523. Get the function decl to be called by the MUST_NOT_THROW region.
  11524. -- GIMPLE function: void gimple_eh_must_not_throw_set_fndecl ( geh_mnt
  11525. *eh_mnt_stmt, tree decl)
  11526. Set the function decl to be called by GS to DECL.
  11527. 
  11528. File: gccint.info, Node: GIMPLE_LABEL, Next: GIMPLE_GOTO, Prev: GIMPLE_EH_FILTER, Up: Tuple specific accessors
  11529. 12.8.9 'GIMPLE_LABEL'
  11530. ---------------------
  11531. -- GIMPLE function: glabel *gimple_build_label (tree label)
  11532. Build a 'GIMPLE_LABEL' statement with corresponding to the tree
  11533. label, 'LABEL'.
  11534. -- GIMPLE function: tree gimple_label_label (const glabel *g)
  11535. Return the 'LABEL_DECL' node used by 'GIMPLE_LABEL' statement 'G'.
  11536. -- GIMPLE function: void gimple_label_set_label (glabel *g, tree label)
  11537. Set 'LABEL' to be the 'LABEL_DECL' node used by 'GIMPLE_LABEL'
  11538. statement 'G'.
  11539. 
  11540. File: gccint.info, Node: GIMPLE_GOTO, Next: GIMPLE_NOP, Prev: GIMPLE_LABEL, Up: Tuple specific accessors
  11541. 12.8.10 'GIMPLE_GOTO'
  11542. ---------------------
  11543. -- GIMPLE function: ggoto *gimple_build_goto (tree dest)
  11544. Build a 'GIMPLE_GOTO' statement to label 'DEST'.
  11545. -- GIMPLE function: tree gimple_goto_dest (gimple g)
  11546. Return the destination of the unconditional jump 'G'.
  11547. -- GIMPLE function: void gimple_goto_set_dest (ggoto *g, tree dest)
  11548. Set 'DEST' to be the destination of the unconditional jump 'G'.
  11549. 
  11550. File: gccint.info, Node: GIMPLE_NOP, Next: GIMPLE_OMP_ATOMIC_LOAD, Prev: GIMPLE_GOTO, Up: Tuple specific accessors
  11551. 12.8.11 'GIMPLE_NOP'
  11552. --------------------
  11553. -- GIMPLE function: gimple gimple_build_nop (void)
  11554. Build a 'GIMPLE_NOP' statement.
  11555. -- GIMPLE function: bool gimple_nop_p (gimple g)
  11556. Returns 'TRUE' if statement 'G' is a 'GIMPLE_NOP'.
  11557. 
  11558. File: gccint.info, Node: GIMPLE_OMP_ATOMIC_LOAD, Next: GIMPLE_OMP_ATOMIC_STORE, Prev: GIMPLE_NOP, Up: Tuple specific accessors
  11559. 12.8.12 'GIMPLE_OMP_ATOMIC_LOAD'
  11560. --------------------------------
  11561. -- GIMPLE function: gomp_atomic_load *gimple_build_omp_atomic_load (
  11562. tree lhs, tree rhs)
  11563. Build a 'GIMPLE_OMP_ATOMIC_LOAD' statement. 'LHS' is the left-hand
  11564. side of the assignment. 'RHS' is the right-hand side of the
  11565. assignment.
  11566. -- GIMPLE function: void gimple_omp_atomic_load_set_lhs (
  11567. gomp_atomic_load *g, tree lhs)
  11568. Set the 'LHS' of an atomic load.
  11569. -- GIMPLE function: tree gimple_omp_atomic_load_lhs ( const
  11570. gomp_atomic_load *g)
  11571. Get the 'LHS' of an atomic load.
  11572. -- GIMPLE function: void gimple_omp_atomic_load_set_rhs (
  11573. gomp_atomic_load *g, tree rhs)
  11574. Set the 'RHS' of an atomic set.
  11575. -- GIMPLE function: tree gimple_omp_atomic_load_rhs ( const
  11576. gomp_atomic_load *g)
  11577. Get the 'RHS' of an atomic set.
  11578. 
  11579. File: gccint.info, Node: GIMPLE_OMP_ATOMIC_STORE, Next: GIMPLE_OMP_CONTINUE, Prev: GIMPLE_OMP_ATOMIC_LOAD, Up: Tuple specific accessors
  11580. 12.8.13 'GIMPLE_OMP_ATOMIC_STORE'
  11581. ---------------------------------
  11582. -- GIMPLE function: gomp_atomic_store *gimple_build_omp_atomic_store (
  11583. tree val)
  11584. Build a 'GIMPLE_OMP_ATOMIC_STORE' statement. 'VAL' is the value to
  11585. be stored.
  11586. -- GIMPLE function: void gimple_omp_atomic_store_set_val (
  11587. gomp_atomic_store *g, tree val)
  11588. Set the value being stored in an atomic store.
  11589. -- GIMPLE function: tree gimple_omp_atomic_store_val ( const
  11590. gomp_atomic_store *g)
  11591. Return the value being stored in an atomic store.
  11592. 
  11593. File: gccint.info, Node: GIMPLE_OMP_CONTINUE, Next: GIMPLE_OMP_CRITICAL, Prev: GIMPLE_OMP_ATOMIC_STORE, Up: Tuple specific accessors
  11594. 12.8.14 'GIMPLE_OMP_CONTINUE'
  11595. -----------------------------
  11596. -- GIMPLE function: gomp_continue *gimple_build_omp_continue ( tree
  11597. control_def, tree control_use)
  11598. Build a 'GIMPLE_OMP_CONTINUE' statement. 'CONTROL_DEF' is the
  11599. definition of the control variable. 'CONTROL_USE' is the use of
  11600. the control variable.
  11601. -- GIMPLE function: tree gimple_omp_continue_control_def ( const
  11602. gomp_continue *s)
  11603. Return the definition of the control variable on a
  11604. 'GIMPLE_OMP_CONTINUE' in 'S'.
  11605. -- GIMPLE function: tree gimple_omp_continue_control_def_ptr (
  11606. gomp_continue *s)
  11607. Same as above, but return the pointer.
  11608. -- GIMPLE function: tree gimple_omp_continue_set_control_def (
  11609. gomp_continue *s)
  11610. Set the control variable definition for a 'GIMPLE_OMP_CONTINUE'
  11611. statement in 'S'.
  11612. -- GIMPLE function: tree gimple_omp_continue_control_use ( const
  11613. gomp_continue *s)
  11614. Return the use of the control variable on a 'GIMPLE_OMP_CONTINUE'
  11615. in 'S'.
  11616. -- GIMPLE function: tree gimple_omp_continue_control_use_ptr (
  11617. gomp_continue *s)
  11618. Same as above, but return the pointer.
  11619. -- GIMPLE function: tree gimple_omp_continue_set_control_use (
  11620. gomp_continue *s)
  11621. Set the control variable use for a 'GIMPLE_OMP_CONTINUE' statement
  11622. in 'S'.
  11623. 
  11624. File: gccint.info, Node: GIMPLE_OMP_CRITICAL, Next: GIMPLE_OMP_FOR, Prev: GIMPLE_OMP_CONTINUE, Up: Tuple specific accessors
  11625. 12.8.15 'GIMPLE_OMP_CRITICAL'
  11626. -----------------------------
  11627. -- GIMPLE function: gomp_critical *gimple_build_omp_critical (
  11628. gimple_seq body, tree name)
  11629. Build a 'GIMPLE_OMP_CRITICAL' statement. 'BODY' is the sequence of
  11630. statements for which only one thread can execute. 'NAME' is an
  11631. optional identifier for this critical block.
  11632. -- GIMPLE function: tree gimple_omp_critical_name ( const gomp_critical
  11633. *g)
  11634. Return the name associated with 'OMP_CRITICAL' statement 'G'.
  11635. -- GIMPLE function: tree * gimple_omp_critical_name_ptr ( gomp_critical
  11636. *g)
  11637. Return a pointer to the name associated with 'OMP' critical
  11638. statement 'G'.
  11639. -- GIMPLE function: void gimple_omp_critical_set_name ( gomp_critical
  11640. *g, tree name)
  11641. Set 'NAME' to be the name associated with 'OMP' critical statement
  11642. 'G'.
  11643. 
  11644. File: gccint.info, Node: GIMPLE_OMP_FOR, Next: GIMPLE_OMP_MASTER, Prev: GIMPLE_OMP_CRITICAL, Up: Tuple specific accessors
  11645. 12.8.16 'GIMPLE_OMP_FOR'
  11646. ------------------------
  11647. -- GIMPLE function: gomp_for *gimple_build_omp_for (gimple_seq body,
  11648. tree clauses, tree index, tree initial, tree final, tree incr,
  11649. gimple_seq pre_body, enum tree_code omp_for_cond)
  11650. Build a 'GIMPLE_OMP_FOR' statement. 'BODY' is sequence of
  11651. statements inside the for loop. 'CLAUSES', are any of the loop
  11652. construct's clauses. 'PRE_BODY' is the sequence of statements that
  11653. are loop invariant. 'INDEX' is the index variable. 'INITIAL' is
  11654. the initial value of 'INDEX'. 'FINAL' is final value of 'INDEX'.
  11655. OMP_FOR_COND is the predicate used to compare 'INDEX' and 'FINAL'.
  11656. 'INCR' is the increment expression.
  11657. -- GIMPLE function: tree gimple_omp_for_clauses (gimple g)
  11658. Return the clauses associated with 'OMP_FOR' 'G'.
  11659. -- GIMPLE function: tree * gimple_omp_for_clauses_ptr (gimple g)
  11660. Return a pointer to the 'OMP_FOR' 'G'.
  11661. -- GIMPLE function: void gimple_omp_for_set_clauses (gimple g, tree
  11662. clauses)
  11663. Set 'CLAUSES' to be the list of clauses associated with 'OMP_FOR'
  11664. 'G'.
  11665. -- GIMPLE function: tree gimple_omp_for_index (gimple g)
  11666. Return the index variable for 'OMP_FOR' 'G'.
  11667. -- GIMPLE function: tree * gimple_omp_for_index_ptr (gimple g)
  11668. Return a pointer to the index variable for 'OMP_FOR' 'G'.
  11669. -- GIMPLE function: void gimple_omp_for_set_index (gimple g, tree
  11670. index)
  11671. Set 'INDEX' to be the index variable for 'OMP_FOR' 'G'.
  11672. -- GIMPLE function: tree gimple_omp_for_initial (gimple g)
  11673. Return the initial value for 'OMP_FOR' 'G'.
  11674. -- GIMPLE function: tree * gimple_omp_for_initial_ptr (gimple g)
  11675. Return a pointer to the initial value for 'OMP_FOR' 'G'.
  11676. -- GIMPLE function: void gimple_omp_for_set_initial (gimple g, tree
  11677. initial)
  11678. Set 'INITIAL' to be the initial value for 'OMP_FOR' 'G'.
  11679. -- GIMPLE function: tree gimple_omp_for_final (gimple g)
  11680. Return the final value for 'OMP_FOR' 'G'.
  11681. -- GIMPLE function: tree * gimple_omp_for_final_ptr (gimple g)
  11682. turn a pointer to the final value for 'OMP_FOR' 'G'.
  11683. -- GIMPLE function: void gimple_omp_for_set_final (gimple g, tree
  11684. final)
  11685. Set 'FINAL' to be the final value for 'OMP_FOR' 'G'.
  11686. -- GIMPLE function: tree gimple_omp_for_incr (gimple g)
  11687. Return the increment value for 'OMP_FOR' 'G'.
  11688. -- GIMPLE function: tree * gimple_omp_for_incr_ptr (gimple g)
  11689. Return a pointer to the increment value for 'OMP_FOR' 'G'.
  11690. -- GIMPLE function: void gimple_omp_for_set_incr (gimple g, tree incr)
  11691. Set 'INCR' to be the increment value for 'OMP_FOR' 'G'.
  11692. -- GIMPLE function: gimple_seq gimple_omp_for_pre_body (gimple g)
  11693. Return the sequence of statements to execute before the 'OMP_FOR'
  11694. statement 'G' starts.
  11695. -- GIMPLE function: void gimple_omp_for_set_pre_body (gimple g,
  11696. gimple_seq pre_body)
  11697. Set 'PRE_BODY' to be the sequence of statements to execute before
  11698. the 'OMP_FOR' statement 'G' starts.
  11699. -- GIMPLE function: void gimple_omp_for_set_cond (gimple g, enum
  11700. tree_code cond)
  11701. Set 'COND' to be the condition code for 'OMP_FOR' 'G'.
  11702. -- GIMPLE function: enum tree_code gimple_omp_for_cond (gimple g)
  11703. Return the condition code associated with 'OMP_FOR' 'G'.
  11704. 
  11705. File: gccint.info, Node: GIMPLE_OMP_MASTER, Next: GIMPLE_OMP_ORDERED, Prev: GIMPLE_OMP_FOR, Up: Tuple specific accessors
  11706. 12.8.17 'GIMPLE_OMP_MASTER'
  11707. ---------------------------
  11708. -- GIMPLE function: gimple gimple_build_omp_master (gimple_seq body)
  11709. Build a 'GIMPLE_OMP_MASTER' statement. 'BODY' is the sequence of
  11710. statements to be executed by just the master.
  11711. 
  11712. File: gccint.info, Node: GIMPLE_OMP_ORDERED, Next: GIMPLE_OMP_PARALLEL, Prev: GIMPLE_OMP_MASTER, Up: Tuple specific accessors
  11713. 12.8.18 'GIMPLE_OMP_ORDERED'
  11714. ----------------------------
  11715. -- GIMPLE function: gimple gimple_build_omp_ordered (gimple_seq body)
  11716. Build a 'GIMPLE_OMP_ORDERED' statement.
  11717. 'BODY' is the sequence of statements inside a loop that will executed
  11718. in sequence.
  11719. 
  11720. File: gccint.info, Node: GIMPLE_OMP_PARALLEL, Next: GIMPLE_OMP_RETURN, Prev: GIMPLE_OMP_ORDERED, Up: Tuple specific accessors
  11721. 12.8.19 'GIMPLE_OMP_PARALLEL'
  11722. -----------------------------
  11723. -- GIMPLE function: gomp_parallel *gimple_build_omp_parallel
  11724. (gimple_seq body, tree clauses, tree child_fn, tree data_arg)
  11725. Build a 'GIMPLE_OMP_PARALLEL' statement.
  11726. 'BODY' is sequence of statements which are executed in parallel.
  11727. 'CLAUSES', are the 'OMP' parallel construct's clauses. 'CHILD_FN' is
  11728. the function created for the parallel threads to execute. 'DATA_ARG'
  11729. are the shared data argument(s).
  11730. -- GIMPLE function: bool gimple_omp_parallel_combined_p (gimple g)
  11731. Return true if 'OMP' parallel statement 'G' has the
  11732. 'GF_OMP_PARALLEL_COMBINED' flag set.
  11733. -- GIMPLE function: void gimple_omp_parallel_set_combined_p (gimple g)
  11734. Set the 'GF_OMP_PARALLEL_COMBINED' field in 'OMP' parallel
  11735. statement 'G'.
  11736. -- GIMPLE function: gimple_seq gimple_omp_body (gimple g)
  11737. Return the body for the 'OMP' statement 'G'.
  11738. -- GIMPLE function: void gimple_omp_set_body (gimple g, gimple_seq
  11739. body)
  11740. Set 'BODY' to be the body for the 'OMP' statement 'G'.
  11741. -- GIMPLE function: tree gimple_omp_parallel_clauses (gimple g)
  11742. Return the clauses associated with 'OMP_PARALLEL' 'G'.
  11743. -- GIMPLE function: tree * gimple_omp_parallel_clauses_ptr (
  11744. gomp_parallel *g)
  11745. Return a pointer to the clauses associated with 'OMP_PARALLEL' 'G'.
  11746. -- GIMPLE function: void gimple_omp_parallel_set_clauses (
  11747. gomp_parallel *g, tree clauses)
  11748. Set 'CLAUSES' to be the list of clauses associated with
  11749. 'OMP_PARALLEL' 'G'.
  11750. -- GIMPLE function: tree gimple_omp_parallel_child_fn ( const
  11751. gomp_parallel *g)
  11752. Return the child function used to hold the body of 'OMP_PARALLEL'
  11753. 'G'.
  11754. -- GIMPLE function: tree * gimple_omp_parallel_child_fn_ptr (
  11755. gomp_parallel *g)
  11756. Return a pointer to the child function used to hold the body of
  11757. 'OMP_PARALLEL' 'G'.
  11758. -- GIMPLE function: void gimple_omp_parallel_set_child_fn (
  11759. gomp_parallel *g, tree child_fn)
  11760. Set 'CHILD_FN' to be the child function for 'OMP_PARALLEL' 'G'.
  11761. -- GIMPLE function: tree gimple_omp_parallel_data_arg ( const
  11762. gomp_parallel *g)
  11763. Return the artificial argument used to send variables and values
  11764. from the parent to the children threads in 'OMP_PARALLEL' 'G'.
  11765. -- GIMPLE function: tree * gimple_omp_parallel_data_arg_ptr (
  11766. gomp_parallel *g)
  11767. Return a pointer to the data argument for 'OMP_PARALLEL' 'G'.
  11768. -- GIMPLE function: void gimple_omp_parallel_set_data_arg (
  11769. gomp_parallel *g, tree data_arg)
  11770. Set 'DATA_ARG' to be the data argument for 'OMP_PARALLEL' 'G'.
  11771. 
  11772. File: gccint.info, Node: GIMPLE_OMP_RETURN, Next: GIMPLE_OMP_SECTION, Prev: GIMPLE_OMP_PARALLEL, Up: Tuple specific accessors
  11773. 12.8.20 'GIMPLE_OMP_RETURN'
  11774. ---------------------------
  11775. -- GIMPLE function: gimple gimple_build_omp_return (bool wait_p)
  11776. Build a 'GIMPLE_OMP_RETURN' statement. 'WAIT_P' is true if this is
  11777. a non-waiting return.
  11778. -- GIMPLE function: void gimple_omp_return_set_nowait (gimple s)
  11779. Set the nowait flag on 'GIMPLE_OMP_RETURN' statement 'S'.
  11780. -- GIMPLE function: bool gimple_omp_return_nowait_p (gimple g)
  11781. Return true if 'OMP' return statement 'G' has the
  11782. 'GF_OMP_RETURN_NOWAIT' flag set.
  11783. 
  11784. File: gccint.info, Node: GIMPLE_OMP_SECTION, Next: GIMPLE_OMP_SECTIONS, Prev: GIMPLE_OMP_RETURN, Up: Tuple specific accessors
  11785. 12.8.21 'GIMPLE_OMP_SECTION'
  11786. ----------------------------
  11787. -- GIMPLE function: gimple gimple_build_omp_section (gimple_seq body)
  11788. Build a 'GIMPLE_OMP_SECTION' statement for a sections statement.
  11789. 'BODY' is the sequence of statements in the section.
  11790. -- GIMPLE function: bool gimple_omp_section_last_p (gimple g)
  11791. Return true if 'OMP' section statement 'G' has the
  11792. 'GF_OMP_SECTION_LAST' flag set.
  11793. -- GIMPLE function: void gimple_omp_section_set_last (gimple g)
  11794. Set the 'GF_OMP_SECTION_LAST' flag on 'G'.
  11795. 
  11796. File: gccint.info, Node: GIMPLE_OMP_SECTIONS, Next: GIMPLE_OMP_SINGLE, Prev: GIMPLE_OMP_SECTION, Up: Tuple specific accessors
  11797. 12.8.22 'GIMPLE_OMP_SECTIONS'
  11798. -----------------------------
  11799. -- GIMPLE function: gomp_sections *gimple_build_omp_sections (
  11800. gimple_seq body, tree clauses)
  11801. Build a 'GIMPLE_OMP_SECTIONS' statement. 'BODY' is a sequence of
  11802. section statements. 'CLAUSES' are any of the 'OMP' sections
  11803. construct's clauses: private, firstprivate, lastprivate, reduction,
  11804. and nowait.
  11805. -- GIMPLE function: gimple gimple_build_omp_sections_switch (void)
  11806. Build a 'GIMPLE_OMP_SECTIONS_SWITCH' statement.
  11807. -- GIMPLE function: tree gimple_omp_sections_control (gimple g)
  11808. Return the control variable associated with the
  11809. 'GIMPLE_OMP_SECTIONS' in 'G'.
  11810. -- GIMPLE function: tree * gimple_omp_sections_control_ptr (gimple g)
  11811. Return a pointer to the clauses associated with the
  11812. 'GIMPLE_OMP_SECTIONS' in 'G'.
  11813. -- GIMPLE function: void gimple_omp_sections_set_control (gimple g,
  11814. tree control)
  11815. Set 'CONTROL' to be the set of clauses associated with the
  11816. 'GIMPLE_OMP_SECTIONS' in 'G'.
  11817. -- GIMPLE function: tree gimple_omp_sections_clauses (gimple g)
  11818. Return the clauses associated with 'OMP_SECTIONS' 'G'.
  11819. -- GIMPLE function: tree * gimple_omp_sections_clauses_ptr (gimple g)
  11820. Return a pointer to the clauses associated with 'OMP_SECTIONS' 'G'.
  11821. -- GIMPLE function: void gimple_omp_sections_set_clauses (gimple g,
  11822. tree clauses)
  11823. Set 'CLAUSES' to be the set of clauses associated with
  11824. 'OMP_SECTIONS' 'G'.
  11825. 
  11826. File: gccint.info, Node: GIMPLE_OMP_SINGLE, Next: GIMPLE_PHI, Prev: GIMPLE_OMP_SECTIONS, Up: Tuple specific accessors
  11827. 12.8.23 'GIMPLE_OMP_SINGLE'
  11828. ---------------------------
  11829. -- GIMPLE function: gomp_single *gimple_build_omp_single ( gimple_seq
  11830. body, tree clauses)
  11831. Build a 'GIMPLE_OMP_SINGLE' statement. 'BODY' is the sequence of
  11832. statements that will be executed once. 'CLAUSES' are any of the
  11833. 'OMP' single construct's clauses: private, firstprivate,
  11834. copyprivate, nowait.
  11835. -- GIMPLE function: tree gimple_omp_single_clauses (gimple g)
  11836. Return the clauses associated with 'OMP_SINGLE' 'G'.
  11837. -- GIMPLE function: tree * gimple_omp_single_clauses_ptr (gimple g)
  11838. Return a pointer to the clauses associated with 'OMP_SINGLE' 'G'.
  11839. -- GIMPLE function: void gimple_omp_single_set_clauses ( gomp_single
  11840. *g, tree clauses)
  11841. Set 'CLAUSES' to be the clauses associated with 'OMP_SINGLE' 'G'.
  11842. 
  11843. File: gccint.info, Node: GIMPLE_PHI, Next: GIMPLE_RESX, Prev: GIMPLE_OMP_SINGLE, Up: Tuple specific accessors
  11844. 12.8.24 'GIMPLE_PHI'
  11845. --------------------
  11846. -- GIMPLE function: unsigned gimple_phi_capacity (gimple g)
  11847. Return the maximum number of arguments supported by 'GIMPLE_PHI'
  11848. 'G'.
  11849. -- GIMPLE function: unsigned gimple_phi_num_args (gimple g)
  11850. Return the number of arguments in 'GIMPLE_PHI' 'G'. This must
  11851. always be exactly the number of incoming edges for the basic block
  11852. holding 'G'.
  11853. -- GIMPLE function: tree gimple_phi_result (gimple g)
  11854. Return the 'SSA' name created by 'GIMPLE_PHI' 'G'.
  11855. -- GIMPLE function: tree * gimple_phi_result_ptr (gimple g)
  11856. Return a pointer to the 'SSA' name created by 'GIMPLE_PHI' 'G'.
  11857. -- GIMPLE function: void gimple_phi_set_result (gphi *g, tree result)
  11858. Set 'RESULT' to be the 'SSA' name created by 'GIMPLE_PHI' 'G'.
  11859. -- GIMPLE function: struct phi_arg_d * gimple_phi_arg (gimple g, index)
  11860. Return the 'PHI' argument corresponding to incoming edge 'INDEX'
  11861. for 'GIMPLE_PHI' 'G'.
  11862. -- GIMPLE function: void gimple_phi_set_arg (gphi *g, index, struct
  11863. phi_arg_d * phiarg)
  11864. Set 'PHIARG' to be the argument corresponding to incoming edge
  11865. 'INDEX' for 'GIMPLE_PHI' 'G'.
  11866. 
  11867. File: gccint.info, Node: GIMPLE_RESX, Next: GIMPLE_RETURN, Prev: GIMPLE_PHI, Up: Tuple specific accessors
  11868. 12.8.25 'GIMPLE_RESX'
  11869. ---------------------
  11870. -- GIMPLE function: gresx *gimple_build_resx (int region)
  11871. Build a 'GIMPLE_RESX' statement which is a statement. This
  11872. statement is a placeholder for _Unwind_Resume before we know if a
  11873. function call or a branch is needed. 'REGION' is the exception
  11874. region from which control is flowing.
  11875. -- GIMPLE function: int gimple_resx_region (const gresx *g)
  11876. Return the region number for 'GIMPLE_RESX' 'G'.
  11877. -- GIMPLE function: void gimple_resx_set_region (gresx *g, int region)
  11878. Set 'REGION' to be the region number for 'GIMPLE_RESX' 'G'.
  11879. 
  11880. File: gccint.info, Node: GIMPLE_RETURN, Next: GIMPLE_SWITCH, Prev: GIMPLE_RESX, Up: Tuple specific accessors
  11881. 12.8.26 'GIMPLE_RETURN'
  11882. -----------------------
  11883. -- GIMPLE function: greturn *gimple_build_return (tree retval)
  11884. Build a 'GIMPLE_RETURN' statement whose return value is retval.
  11885. -- GIMPLE function: tree gimple_return_retval (const greturn *g)
  11886. Return the return value for 'GIMPLE_RETURN' 'G'.
  11887. -- GIMPLE function: void gimple_return_set_retval (greturn *g, tree
  11888. retval)
  11889. Set 'RETVAL' to be the return value for 'GIMPLE_RETURN' 'G'.
  11890. 
  11891. File: gccint.info, Node: GIMPLE_SWITCH, Next: GIMPLE_TRY, Prev: GIMPLE_RETURN, Up: Tuple specific accessors
  11892. 12.8.27 'GIMPLE_SWITCH'
  11893. -----------------------
  11894. -- GIMPLE function: gswitch *gimple_build_switch (tree index, tree
  11895. default_label, 'vec'<tree> *args)
  11896. Build a 'GIMPLE_SWITCH' statement. 'INDEX' is the index variable
  11897. to switch on, and 'DEFAULT_LABEL' represents the default label.
  11898. 'ARGS' is a vector of 'CASE_LABEL_EXPR' trees that contain the
  11899. non-default case labels. Each label is a tree of code
  11900. 'CASE_LABEL_EXPR'.
  11901. -- GIMPLE function: unsigned gimple_switch_num_labels ( const gswitch
  11902. *g)
  11903. Return the number of labels associated with the switch statement
  11904. 'G'.
  11905. -- GIMPLE function: void gimple_switch_set_num_labels (gswitch *g,
  11906. unsigned nlabels)
  11907. Set 'NLABELS' to be the number of labels for the switch statement
  11908. 'G'.
  11909. -- GIMPLE function: tree gimple_switch_index (const gswitch *g)
  11910. Return the index variable used by the switch statement 'G'.
  11911. -- GIMPLE function: void gimple_switch_set_index (gswitch *g, tree
  11912. index)
  11913. Set 'INDEX' to be the index variable for switch statement 'G'.
  11914. -- GIMPLE function: tree gimple_switch_label (const gswitch *g,
  11915. unsigned index)
  11916. Return the label numbered 'INDEX'. The default label is 0,
  11917. followed by any labels in a switch statement.
  11918. -- GIMPLE function: void gimple_switch_set_label (gswitch *g, unsigned
  11919. index, tree label)
  11920. Set the label number 'INDEX' to 'LABEL'. 0 is always the default
  11921. label.
  11922. -- GIMPLE function: tree gimple_switch_default_label ( const gswitch
  11923. *g)
  11924. Return the default label for a switch statement.
  11925. -- GIMPLE function: void gimple_switch_set_default_label (gswitch *g,
  11926. tree label)
  11927. Set the default label for a switch statement.
  11928. 
  11929. File: gccint.info, Node: GIMPLE_TRY, Next: GIMPLE_WITH_CLEANUP_EXPR, Prev: GIMPLE_SWITCH, Up: Tuple specific accessors
  11930. 12.8.28 'GIMPLE_TRY'
  11931. --------------------
  11932. -- GIMPLE function: gtry *gimple_build_try (gimple_seq eval, gimple_seq
  11933. cleanup, unsigned int kind)
  11934. Build a 'GIMPLE_TRY' statement. 'EVAL' is a sequence with the
  11935. expression to evaluate. 'CLEANUP' is a sequence of statements to
  11936. run at clean-up time. 'KIND' is the enumeration value
  11937. 'GIMPLE_TRY_CATCH' if this statement denotes a try/catch construct
  11938. or 'GIMPLE_TRY_FINALLY' if this statement denotes a try/finally
  11939. construct.
  11940. -- GIMPLE function: enum gimple_try_flags gimple_try_kind (gimple g)
  11941. Return the kind of try block represented by 'GIMPLE_TRY' 'G'. This
  11942. is either 'GIMPLE_TRY_CATCH' or 'GIMPLE_TRY_FINALLY'.
  11943. -- GIMPLE function: bool gimple_try_catch_is_cleanup (gimple g)
  11944. Return the 'GIMPLE_TRY_CATCH_IS_CLEANUP' flag.
  11945. -- GIMPLE function: gimple_seq gimple_try_eval (gimple g)
  11946. Return the sequence of statements used as the body for 'GIMPLE_TRY'
  11947. 'G'.
  11948. -- GIMPLE function: gimple_seq gimple_try_cleanup (gimple g)
  11949. Return the sequence of statements used as the cleanup body for
  11950. 'GIMPLE_TRY' 'G'.
  11951. -- GIMPLE function: void gimple_try_set_catch_is_cleanup (gimple g,
  11952. bool catch_is_cleanup)
  11953. Set the 'GIMPLE_TRY_CATCH_IS_CLEANUP' flag.
  11954. -- GIMPLE function: void gimple_try_set_eval (gtry *g, gimple_seq eval)
  11955. Set 'EVAL' to be the sequence of statements to use as the body for
  11956. 'GIMPLE_TRY' 'G'.
  11957. -- GIMPLE function: void gimple_try_set_cleanup (gtry *g, gimple_seq
  11958. cleanup)
  11959. Set 'CLEANUP' to be the sequence of statements to use as the
  11960. cleanup body for 'GIMPLE_TRY' 'G'.
  11961. 
  11962. File: gccint.info, Node: GIMPLE_WITH_CLEANUP_EXPR, Prev: GIMPLE_TRY, Up: Tuple specific accessors
  11963. 12.8.29 'GIMPLE_WITH_CLEANUP_EXPR'
  11964. ----------------------------------
  11965. -- GIMPLE function: gimple gimple_build_wce (gimple_seq cleanup)
  11966. Build a 'GIMPLE_WITH_CLEANUP_EXPR' statement. 'CLEANUP' is the
  11967. clean-up expression.
  11968. -- GIMPLE function: gimple_seq gimple_wce_cleanup (gimple g)
  11969. Return the cleanup sequence for cleanup statement 'G'.
  11970. -- GIMPLE function: void gimple_wce_set_cleanup (gimple g, gimple_seq
  11971. cleanup)
  11972. Set 'CLEANUP' to be the cleanup sequence for 'G'.
  11973. -- GIMPLE function: bool gimple_wce_cleanup_eh_only (gimple g)
  11974. Return the 'CLEANUP_EH_ONLY' flag for a 'WCE' tuple.
  11975. -- GIMPLE function: void gimple_wce_set_cleanup_eh_only (gimple g, bool
  11976. eh_only_p)
  11977. Set the 'CLEANUP_EH_ONLY' flag for a 'WCE' tuple.
  11978. 
  11979. File: gccint.info, Node: GIMPLE sequences, Next: Sequence iterators, Prev: Tuple specific accessors, Up: GIMPLE
  11980. 12.9 GIMPLE sequences
  11981. =====================
  11982. GIMPLE sequences are the tuple equivalent of 'STATEMENT_LIST''s used in
  11983. 'GENERIC'. They are used to chain statements together, and when used in
  11984. conjunction with sequence iterators, provide a framework for iterating
  11985. through statements.
  11986. GIMPLE sequences are of type struct 'gimple_sequence', but are more
  11987. commonly passed by reference to functions dealing with sequences. The
  11988. type for a sequence pointer is 'gimple_seq' which is the same as struct
  11989. 'gimple_sequence' *. When declaring a local sequence, you can define a
  11990. local variable of type struct 'gimple_sequence'. When declaring a
  11991. sequence allocated on the garbage collected heap, use the function
  11992. 'gimple_seq_alloc' documented below.
  11993. There are convenience functions for iterating through sequences in the
  11994. section entitled Sequence Iterators.
  11995. Below is a list of functions to manipulate and query sequences.
  11996. -- GIMPLE function: void gimple_seq_add_stmt (gimple_seq *seq, gimple
  11997. g)
  11998. Link a gimple statement to the end of the sequence *'SEQ' if 'G' is
  11999. not 'NULL'. If *'SEQ' is 'NULL', allocate a sequence before
  12000. linking.
  12001. -- GIMPLE function: void gimple_seq_add_seq (gimple_seq *dest,
  12002. gimple_seq src)
  12003. Append sequence 'SRC' to the end of sequence *'DEST' if 'SRC' is
  12004. not 'NULL'. If *'DEST' is 'NULL', allocate a new sequence before
  12005. appending.
  12006. -- GIMPLE function: gimple_seq gimple_seq_deep_copy (gimple_seq src)
  12007. Perform a deep copy of sequence 'SRC' and return the result.
  12008. -- GIMPLE function: gimple_seq gimple_seq_reverse (gimple_seq seq)
  12009. Reverse the order of the statements in the sequence 'SEQ'. Return
  12010. 'SEQ'.
  12011. -- GIMPLE function: gimple gimple_seq_first (gimple_seq s)
  12012. Return the first statement in sequence 'S'.
  12013. -- GIMPLE function: gimple gimple_seq_last (gimple_seq s)
  12014. Return the last statement in sequence 'S'.
  12015. -- GIMPLE function: void gimple_seq_set_last (gimple_seq s, gimple
  12016. last)
  12017. Set the last statement in sequence 'S' to the statement in 'LAST'.
  12018. -- GIMPLE function: void gimple_seq_set_first (gimple_seq s, gimple
  12019. first)
  12020. Set the first statement in sequence 'S' to the statement in
  12021. 'FIRST'.
  12022. -- GIMPLE function: void gimple_seq_init (gimple_seq s)
  12023. Initialize sequence 'S' to an empty sequence.
  12024. -- GIMPLE function: gimple_seq gimple_seq_alloc (void)
  12025. Allocate a new sequence in the garbage collected store and return
  12026. it.
  12027. -- GIMPLE function: void gimple_seq_copy (gimple_seq dest, gimple_seq
  12028. src)
  12029. Copy the sequence 'SRC' into the sequence 'DEST'.
  12030. -- GIMPLE function: bool gimple_seq_empty_p (gimple_seq s)
  12031. Return true if the sequence 'S' is empty.
  12032. -- GIMPLE function: gimple_seq bb_seq (basic_block bb)
  12033. Returns the sequence of statements in 'BB'.
  12034. -- GIMPLE function: void set_bb_seq (basic_block bb, gimple_seq seq)
  12035. Sets the sequence of statements in 'BB' to 'SEQ'.
  12036. -- GIMPLE function: bool gimple_seq_singleton_p (gimple_seq seq)
  12037. Determine whether 'SEQ' contains exactly one statement.
  12038. 
  12039. File: gccint.info, Node: Sequence iterators, Next: Adding a new GIMPLE statement code, Prev: GIMPLE sequences, Up: GIMPLE
  12040. 12.10 Sequence iterators
  12041. ========================
  12042. Sequence iterators are convenience constructs for iterating through
  12043. statements in a sequence. Given a sequence 'SEQ', here is a typical use
  12044. of gimple sequence iterators:
  12045. gimple_stmt_iterator gsi;
  12046. for (gsi = gsi_start (seq); !gsi_end_p (gsi); gsi_next (&gsi))
  12047. {
  12048. gimple g = gsi_stmt (gsi);
  12049. /* Do something with gimple statement G. */
  12050. }
  12051. Backward iterations are possible:
  12052. for (gsi = gsi_last (seq); !gsi_end_p (gsi); gsi_prev (&gsi))
  12053. Forward and backward iterations on basic blocks are possible with
  12054. 'gsi_start_bb' and 'gsi_last_bb'.
  12055. In the documentation below we sometimes refer to enum
  12056. 'gsi_iterator_update'. The valid options for this enumeration are:
  12057. * 'GSI_NEW_STMT' Only valid when a single statement is added. Move
  12058. the iterator to it.
  12059. * 'GSI_SAME_STMT' Leave the iterator at the same statement.
  12060. * 'GSI_CONTINUE_LINKING' Move iterator to whatever position is
  12061. suitable for linking other statements in the same direction.
  12062. Below is a list of the functions used to manipulate and use statement
  12063. iterators.
  12064. -- GIMPLE function: gimple_stmt_iterator gsi_start (gimple_seq seq)
  12065. Return a new iterator pointing to the sequence 'SEQ''s first
  12066. statement. If 'SEQ' is empty, the iterator's basic block is
  12067. 'NULL'. Use 'gsi_start_bb' instead when the iterator needs to
  12068. always have the correct basic block set.
  12069. -- GIMPLE function: gimple_stmt_iterator gsi_start_bb (basic_block bb)
  12070. Return a new iterator pointing to the first statement in basic
  12071. block 'BB'.
  12072. -- GIMPLE function: gimple_stmt_iterator gsi_last (gimple_seq seq)
  12073. Return a new iterator initially pointing to the last statement of
  12074. sequence 'SEQ'. If 'SEQ' is empty, the iterator's basic block is
  12075. 'NULL'. Use 'gsi_last_bb' instead when the iterator needs to
  12076. always have the correct basic block set.
  12077. -- GIMPLE function: gimple_stmt_iterator gsi_last_bb (basic_block bb)
  12078. Return a new iterator pointing to the last statement in basic block
  12079. 'BB'.
  12080. -- GIMPLE function: bool gsi_end_p (gimple_stmt_iterator i)
  12081. Return 'TRUE' if at the end of 'I'.
  12082. -- GIMPLE function: bool gsi_one_before_end_p (gimple_stmt_iterator i)
  12083. Return 'TRUE' if we're one statement before the end of 'I'.
  12084. -- GIMPLE function: void gsi_next (gimple_stmt_iterator *i)
  12085. Advance the iterator to the next gimple statement.
  12086. -- GIMPLE function: void gsi_prev (gimple_stmt_iterator *i)
  12087. Advance the iterator to the previous gimple statement.
  12088. -- GIMPLE function: gimple gsi_stmt (gimple_stmt_iterator i)
  12089. Return the current stmt.
  12090. -- GIMPLE function: gimple_stmt_iterator gsi_after_labels (basic_block
  12091. bb)
  12092. Return a block statement iterator that points to the first
  12093. non-label statement in block 'BB'.
  12094. -- GIMPLE function: gimple * gsi_stmt_ptr (gimple_stmt_iterator *i)
  12095. Return a pointer to the current stmt.
  12096. -- GIMPLE function: basic_block gsi_bb (gimple_stmt_iterator i)
  12097. Return the basic block associated with this iterator.
  12098. -- GIMPLE function: gimple_seq gsi_seq (gimple_stmt_iterator i)
  12099. Return the sequence associated with this iterator.
  12100. -- GIMPLE function: void gsi_remove (gimple_stmt_iterator *i, bool
  12101. remove_eh_info)
  12102. Remove the current stmt from the sequence. The iterator is updated
  12103. to point to the next statement. When 'REMOVE_EH_INFO' is true we
  12104. remove the statement pointed to by iterator 'I' from the 'EH'
  12105. tables. Otherwise we do not modify the 'EH' tables. Generally,
  12106. 'REMOVE_EH_INFO' should be true when the statement is going to be
  12107. removed from the 'IL' and not reinserted elsewhere.
  12108. -- GIMPLE function: void gsi_link_seq_before (gimple_stmt_iterator *i,
  12109. gimple_seq seq, enum gsi_iterator_update mode)
  12110. Links the sequence of statements 'SEQ' before the statement pointed
  12111. by iterator 'I'. 'MODE' indicates what to do with the iterator
  12112. after insertion (see 'enum gsi_iterator_update' above).
  12113. -- GIMPLE function: void gsi_link_before (gimple_stmt_iterator *i,
  12114. gimple g, enum gsi_iterator_update mode)
  12115. Links statement 'G' before the statement pointed-to by iterator
  12116. 'I'. Updates iterator 'I' according to 'MODE'.
  12117. -- GIMPLE function: void gsi_link_seq_after (gimple_stmt_iterator *i,
  12118. gimple_seq seq, enum gsi_iterator_update mode)
  12119. Links sequence 'SEQ' after the statement pointed-to by iterator
  12120. 'I'. 'MODE' is as in 'gsi_insert_after'.
  12121. -- GIMPLE function: void gsi_link_after (gimple_stmt_iterator *i,
  12122. gimple g, enum gsi_iterator_update mode)
  12123. Links statement 'G' after the statement pointed-to by iterator 'I'.
  12124. 'MODE' is as in 'gsi_insert_after'.
  12125. -- GIMPLE function: gimple_seq gsi_split_seq_after
  12126. (gimple_stmt_iterator i)
  12127. Move all statements in the sequence after 'I' to a new sequence.
  12128. Return this new sequence.
  12129. -- GIMPLE function: gimple_seq gsi_split_seq_before
  12130. (gimple_stmt_iterator *i)
  12131. Move all statements in the sequence before 'I' to a new sequence.
  12132. Return this new sequence.
  12133. -- GIMPLE function: void gsi_replace (gimple_stmt_iterator *i, gimple
  12134. stmt, bool update_eh_info)
  12135. Replace the statement pointed-to by 'I' to 'STMT'. If
  12136. 'UPDATE_EH_INFO' is true, the exception handling information of the
  12137. original statement is moved to the new statement.
  12138. -- GIMPLE function: void gsi_insert_before (gimple_stmt_iterator *i,
  12139. gimple stmt, enum gsi_iterator_update mode)
  12140. Insert statement 'STMT' before the statement pointed-to by iterator
  12141. 'I', update 'STMT''s basic block and scan it for new operands.
  12142. 'MODE' specifies how to update iterator 'I' after insertion (see
  12143. enum 'gsi_iterator_update').
  12144. -- GIMPLE function: void gsi_insert_seq_before (gimple_stmt_iterator
  12145. *i, gimple_seq seq, enum gsi_iterator_update mode)
  12146. Like 'gsi_insert_before', but for all the statements in 'SEQ'.
  12147. -- GIMPLE function: void gsi_insert_after (gimple_stmt_iterator *i,
  12148. gimple stmt, enum gsi_iterator_update mode)
  12149. Insert statement 'STMT' after the statement pointed-to by iterator
  12150. 'I', update 'STMT''s basic block and scan it for new operands.
  12151. 'MODE' specifies how to update iterator 'I' after insertion (see
  12152. enum 'gsi_iterator_update').
  12153. -- GIMPLE function: void gsi_insert_seq_after (gimple_stmt_iterator *i,
  12154. gimple_seq seq, enum gsi_iterator_update mode)
  12155. Like 'gsi_insert_after', but for all the statements in 'SEQ'.
  12156. -- GIMPLE function: gimple_stmt_iterator gsi_for_stmt (gimple stmt)
  12157. Finds iterator for 'STMT'.
  12158. -- GIMPLE function: void gsi_move_after (gimple_stmt_iterator *from,
  12159. gimple_stmt_iterator *to)
  12160. Move the statement at 'FROM' so it comes right after the statement
  12161. at 'TO'.
  12162. -- GIMPLE function: void gsi_move_before (gimple_stmt_iterator *from,
  12163. gimple_stmt_iterator *to)
  12164. Move the statement at 'FROM' so it comes right before the statement
  12165. at 'TO'.
  12166. -- GIMPLE function: void gsi_move_to_bb_end (gimple_stmt_iterator
  12167. *from, basic_block bb)
  12168. Move the statement at 'FROM' to the end of basic block 'BB'.
  12169. -- GIMPLE function: void gsi_insert_on_edge (edge e, gimple stmt)
  12170. Add 'STMT' to the pending list of edge 'E'. No actual insertion is
  12171. made until a call to 'gsi_commit_edge_inserts'() is made.
  12172. -- GIMPLE function: void gsi_insert_seq_on_edge (edge e, gimple_seq
  12173. seq)
  12174. Add the sequence of statements in 'SEQ' to the pending list of edge
  12175. 'E'. No actual insertion is made until a call to
  12176. 'gsi_commit_edge_inserts'() is made.
  12177. -- GIMPLE function: basic_block gsi_insert_on_edge_immediate (edge e,
  12178. gimple stmt)
  12179. Similar to 'gsi_insert_on_edge'+'gsi_commit_edge_inserts'. If a
  12180. new block has to be created, it is returned.
  12181. -- GIMPLE function: void gsi_commit_one_edge_insert (edge e,
  12182. basic_block *new_bb)
  12183. Commit insertions pending at edge 'E'. If a new block is created,
  12184. set 'NEW_BB' to this block, otherwise set it to 'NULL'.
  12185. -- GIMPLE function: void gsi_commit_edge_inserts (void)
  12186. This routine will commit all pending edge insertions, creating any
  12187. new basic blocks which are necessary.
  12188. 
  12189. File: gccint.info, Node: Adding a new GIMPLE statement code, Next: Statement and operand traversals, Prev: Sequence iterators, Up: GIMPLE
  12190. 12.11 Adding a new GIMPLE statement code
  12191. ========================================
  12192. The first step in adding a new GIMPLE statement code, is modifying the
  12193. file 'gimple.def', which contains all the GIMPLE codes. Then you must
  12194. add a corresponding gimple subclass located in 'gimple.h'. This in
  12195. turn, will require you to add a corresponding 'GTY' tag in
  12196. 'gsstruct.def', and code to handle this tag in 'gss_for_code' which is
  12197. located in 'gimple.c'.
  12198. In order for the garbage collector to know the size of the structure
  12199. you created in 'gimple.h', you need to add a case to handle your new
  12200. GIMPLE statement in 'gimple_size' which is located in 'gimple.c'.
  12201. You will probably want to create a function to build the new gimple
  12202. statement in 'gimple.c'. The function should be called
  12203. 'gimple_build_NEW-TUPLE-NAME', and should return the new tuple as a
  12204. pointer to the appropriate gimple subclass.
  12205. If your new statement requires accessors for any members or operands it
  12206. may have, put simple inline accessors in 'gimple.h' and any non-trivial
  12207. accessors in 'gimple.c' with a corresponding prototype in 'gimple.h'.
  12208. You should add the new statement subclass to the class hierarchy
  12209. diagram in 'gimple.texi'.
  12210. 
  12211. File: gccint.info, Node: Statement and operand traversals, Prev: Adding a new GIMPLE statement code, Up: GIMPLE
  12212. 12.12 Statement and operand traversals
  12213. ======================================
  12214. There are two functions available for walking statements and sequences:
  12215. 'walk_gimple_stmt' and 'walk_gimple_seq', accordingly, and a third
  12216. function for walking the operands in a statement: 'walk_gimple_op'.
  12217. -- GIMPLE function: tree walk_gimple_stmt (gimple_stmt_iterator *gsi,
  12218. walk_stmt_fn callback_stmt, walk_tree_fn callback_op, struct
  12219. walk_stmt_info *wi)
  12220. This function is used to walk the current statement in 'GSI',
  12221. optionally using traversal state stored in 'WI'. If 'WI' is
  12222. 'NULL', no state is kept during the traversal.
  12223. The callback 'CALLBACK_STMT' is called. If 'CALLBACK_STMT' returns
  12224. true, it means that the callback function has handled all the
  12225. operands of the statement and it is not necessary to walk its
  12226. operands.
  12227. If 'CALLBACK_STMT' is 'NULL' or it returns false, 'CALLBACK_OP' is
  12228. called on each operand of the statement via 'walk_gimple_op'. If
  12229. 'walk_gimple_op' returns non-'NULL' for any operand, the remaining
  12230. operands are not scanned.
  12231. The return value is that returned by the last call to
  12232. 'walk_gimple_op', or 'NULL_TREE' if no 'CALLBACK_OP' is specified.
  12233. -- GIMPLE function: tree walk_gimple_op (gimple stmt, walk_tree_fn
  12234. callback_op, struct walk_stmt_info *wi)
  12235. Use this function to walk the operands of statement 'STMT'. Every
  12236. operand is walked via 'walk_tree' with optional state information
  12237. in 'WI'.
  12238. 'CALLBACK_OP' is called on each operand of 'STMT' via 'walk_tree'.
  12239. Additional parameters to 'walk_tree' must be stored in 'WI'. For
  12240. each operand 'OP', 'walk_tree' is called as:
  12241. walk_tree (&OP, CALLBACK_OP, WI, PSET)
  12242. If 'CALLBACK_OP' returns non-'NULL' for an operand, the remaining
  12243. operands are not scanned. The return value is that returned by the
  12244. last call to 'walk_tree', or 'NULL_TREE' if no 'CALLBACK_OP' is
  12245. specified.
  12246. -- GIMPLE function: tree walk_gimple_seq (gimple_seq seq, walk_stmt_fn
  12247. callback_stmt, walk_tree_fn callback_op, struct walk_stmt_info
  12248. *wi)
  12249. This function walks all the statements in the sequence 'SEQ'
  12250. calling 'walk_gimple_stmt' on each one. 'WI' is as in
  12251. 'walk_gimple_stmt'. If 'walk_gimple_stmt' returns non-'NULL', the
  12252. walk is stopped and the value returned. Otherwise, all the
  12253. statements are walked and 'NULL_TREE' returned.
  12254. 
  12255. File: gccint.info, Node: Tree SSA, Next: RTL, Prev: GIMPLE, Up: Top
  12256. 13 Analysis and Optimization of GIMPLE tuples
  12257. *********************************************
  12258. GCC uses three main intermediate languages to represent the program
  12259. during compilation: GENERIC, GIMPLE and RTL. GENERIC is a
  12260. language-independent representation generated by each front end. It is
  12261. used to serve as an interface between the parser and optimizer. GENERIC
  12262. is a common representation that is able to represent programs written in
  12263. all the languages supported by GCC.
  12264. GIMPLE and RTL are used to optimize the program. GIMPLE is used for
  12265. target and language independent optimizations (e.g., inlining, constant
  12266. propagation, tail call elimination, redundancy elimination, etc). Much
  12267. like GENERIC, GIMPLE is a language independent, tree based
  12268. representation. However, it differs from GENERIC in that the GIMPLE
  12269. grammar is more restrictive: expressions contain no more than 3 operands
  12270. (except function calls), it has no control flow structures and
  12271. expressions with side effects are only allowed on the right hand side of
  12272. assignments. See the chapter describing GENERIC and GIMPLE for more
  12273. details.
  12274. This chapter describes the data structures and functions used in the
  12275. GIMPLE optimizers (also known as "tree optimizers" or "middle end"). In
  12276. particular, it focuses on all the macros, data structures, functions and
  12277. programming constructs needed to implement optimization passes for
  12278. GIMPLE.
  12279. * Menu:
  12280. * Annotations:: Attributes for variables.
  12281. * SSA Operands:: SSA names referenced by GIMPLE statements.
  12282. * SSA:: Static Single Assignment representation.
  12283. * Alias analysis:: Representing aliased loads and stores.
  12284. * Memory model:: Memory model used by the middle-end.
  12285. 
  12286. File: gccint.info, Node: Annotations, Next: SSA Operands, Up: Tree SSA
  12287. 13.1 Annotations
  12288. ================
  12289. The optimizers need to associate attributes with variables during the
  12290. optimization process. For instance, we need to know whether a variable
  12291. has aliases. All these attributes are stored in data structures called
  12292. annotations which are then linked to the field 'ann' in 'struct
  12293. tree_common'.
  12294. 
  12295. File: gccint.info, Node: SSA Operands, Next: SSA, Prev: Annotations, Up: Tree SSA
  12296. 13.2 SSA Operands
  12297. =================
  12298. Almost every GIMPLE statement will contain a reference to a variable or
  12299. memory location. Since statements come in different shapes and sizes,
  12300. their operands are going to be located at various spots inside the
  12301. statement's tree. To facilitate access to the statement's operands,
  12302. they are organized into lists associated inside each statement's
  12303. annotation. Each element in an operand list is a pointer to a
  12304. 'VAR_DECL', 'PARM_DECL' or 'SSA_NAME' tree node. This provides a very
  12305. convenient way of examining and replacing operands.
  12306. Data flow analysis and optimization is done on all tree nodes
  12307. representing variables. Any node for which 'SSA_VAR_P' returns nonzero
  12308. is considered when scanning statement operands. However, not all
  12309. 'SSA_VAR_P' variables are processed in the same way. For the purposes
  12310. of optimization, we need to distinguish between references to local
  12311. scalar variables and references to globals, statics, structures, arrays,
  12312. aliased variables, etc. The reason is simple, the compiler can gather
  12313. complete data flow information for a local scalar. On the other hand, a
  12314. global variable may be modified by a function call, it may not be
  12315. possible to keep track of all the elements of an array or the fields of
  12316. a structure, etc.
  12317. The operand scanner gathers two kinds of operands: "real" and
  12318. "virtual". An operand for which 'is_gimple_reg' returns true is
  12319. considered real, otherwise it is a virtual operand. We also distinguish
  12320. between uses and definitions. An operand is used if its value is loaded
  12321. by the statement (e.g., the operand at the RHS of an assignment). If
  12322. the statement assigns a new value to the operand, the operand is
  12323. considered a definition (e.g., the operand at the LHS of an assignment).
  12324. Virtual and real operands also have very different data flow
  12325. properties. Real operands are unambiguous references to the full object
  12326. that they represent. For instance, given
  12327. {
  12328. int a, b;
  12329. a = b
  12330. }
  12331. Since 'a' and 'b' are non-aliased locals, the statement 'a = b' will
  12332. have one real definition and one real use because variable 'a' is
  12333. completely modified with the contents of variable 'b'. Real definition
  12334. are also known as "killing definitions". Similarly, the use of 'b'
  12335. reads all its bits.
  12336. In contrast, virtual operands are used with variables that can have a
  12337. partial or ambiguous reference. This includes structures, arrays,
  12338. globals, and aliased variables. In these cases, we have two types of
  12339. definitions. For globals, structures, and arrays, we can determine from
  12340. a statement whether a variable of these types has a killing definition.
  12341. If the variable does, then the statement is marked as having a "must
  12342. definition" of that variable. However, if a statement is only defining
  12343. a part of the variable (i.e. a field in a structure), or if we know that
  12344. a statement might define the variable but we cannot say for sure, then
  12345. we mark that statement as having a "may definition". For instance,
  12346. given
  12347. {
  12348. int a, b, *p;
  12349. if (...)
  12350. p = &a;
  12351. else
  12352. p = &b;
  12353. *p = 5;
  12354. return *p;
  12355. }
  12356. The assignment '*p = 5' may be a definition of 'a' or 'b'. If we
  12357. cannot determine statically where 'p' is pointing to at the time of the
  12358. store operation, we create virtual definitions to mark that statement as
  12359. a potential definition site for 'a' and 'b'. Memory loads are similarly
  12360. marked with virtual use operands. Virtual operands are shown in tree
  12361. dumps right before the statement that contains them. To request a tree
  12362. dump with virtual operands, use the '-vops' option to '-fdump-tree':
  12363. {
  12364. int a, b, *p;
  12365. if (...)
  12366. p = &a;
  12367. else
  12368. p = &b;
  12369. # a = VDEF <a>
  12370. # b = VDEF <b>
  12371. *p = 5;
  12372. # VUSE <a>
  12373. # VUSE <b>
  12374. return *p;
  12375. }
  12376. Notice that 'VDEF' operands have two copies of the referenced variable.
  12377. This indicates that this is not a killing definition of that variable.
  12378. In this case we refer to it as a "may definition" or "aliased store".
  12379. The presence of the second copy of the variable in the 'VDEF' operand
  12380. will become important when the function is converted into SSA form.
  12381. This will be used to link all the non-killing definitions to prevent
  12382. optimizations from making incorrect assumptions about them.
  12383. Operands are updated as soon as the statement is finished via a call to
  12384. 'update_stmt'. If statement elements are changed via 'SET_USE' or
  12385. 'SET_DEF', then no further action is required (i.e., those macros take
  12386. care of updating the statement). If changes are made by manipulating
  12387. the statement's tree directly, then a call must be made to 'update_stmt'
  12388. when complete. Calling one of the 'bsi_insert' routines or
  12389. 'bsi_replace' performs an implicit call to 'update_stmt'.
  12390. 13.2.1 Operand Iterators And Access Routines
  12391. --------------------------------------------
  12392. Operands are collected by 'tree-ssa-operands.c'. They are stored inside
  12393. each statement's annotation and can be accessed through either the
  12394. operand iterators or an access routine.
  12395. The following access routines are available for examining operands:
  12396. 1. 'SINGLE_SSA_{USE,DEF,TREE}_OPERAND': These accessors will return
  12397. NULL unless there is exactly one operand matching the specified
  12398. flags. If there is exactly one operand, the operand is returned as
  12399. either a 'tree', 'def_operand_p', or 'use_operand_p'.
  12400. tree t = SINGLE_SSA_TREE_OPERAND (stmt, flags);
  12401. use_operand_p u = SINGLE_SSA_USE_OPERAND (stmt, SSA_ALL_VIRTUAL_USES);
  12402. def_operand_p d = SINGLE_SSA_DEF_OPERAND (stmt, SSA_OP_ALL_DEFS);
  12403. 2. 'ZERO_SSA_OPERANDS': This macro returns true if there are no
  12404. operands matching the specified flags.
  12405. if (ZERO_SSA_OPERANDS (stmt, SSA_OP_ALL_VIRTUALS))
  12406. return;
  12407. 3. 'NUM_SSA_OPERANDS': This macro Returns the number of operands
  12408. matching 'flags'. This actually executes a loop to perform the
  12409. count, so only use this if it is really needed.
  12410. int count = NUM_SSA_OPERANDS (stmt, flags)
  12411. If you wish to iterate over some or all operands, use the
  12412. 'FOR_EACH_SSA_{USE,DEF,TREE}_OPERAND' iterator. For example, to print
  12413. all the operands for a statement:
  12414. void
  12415. print_ops (tree stmt)
  12416. {
  12417. ssa_op_iter;
  12418. tree var;
  12419. FOR_EACH_SSA_TREE_OPERAND (var, stmt, iter, SSA_OP_ALL_OPERANDS)
  12420. print_generic_expr (stderr, var, TDF_SLIM);
  12421. }
  12422. How to choose the appropriate iterator:
  12423. 1. Determine whether you are need to see the operand pointers, or just
  12424. the trees, and choose the appropriate macro:
  12425. Need Macro:
  12426. ---- -------
  12427. use_operand_p FOR_EACH_SSA_USE_OPERAND
  12428. def_operand_p FOR_EACH_SSA_DEF_OPERAND
  12429. tree FOR_EACH_SSA_TREE_OPERAND
  12430. 2. You need to declare a variable of the type you are interested in,
  12431. and an ssa_op_iter structure which serves as the loop controlling
  12432. variable.
  12433. 3. Determine which operands you wish to use, and specify the flags of
  12434. those you are interested in. They are documented in
  12435. 'tree-ssa-operands.h':
  12436. #define SSA_OP_USE 0x01 /* Real USE operands. */
  12437. #define SSA_OP_DEF 0x02 /* Real DEF operands. */
  12438. #define SSA_OP_VUSE 0x04 /* VUSE operands. */
  12439. #define SSA_OP_VDEF 0x08 /* VDEF operands. */
  12440. /* These are commonly grouped operand flags. */
  12441. #define SSA_OP_VIRTUAL_USES (SSA_OP_VUSE)
  12442. #define SSA_OP_VIRTUAL_DEFS (SSA_OP_VDEF)
  12443. #define SSA_OP_ALL_VIRTUALS (SSA_OP_VIRTUAL_USES | SSA_OP_VIRTUAL_DEFS)
  12444. #define SSA_OP_ALL_USES (SSA_OP_VIRTUAL_USES | SSA_OP_USE)
  12445. #define SSA_OP_ALL_DEFS (SSA_OP_VIRTUAL_DEFS | SSA_OP_DEF)
  12446. #define SSA_OP_ALL_OPERANDS (SSA_OP_ALL_USES | SSA_OP_ALL_DEFS)
  12447. So if you want to look at the use pointers for all the 'USE' and 'VUSE'
  12448. operands, you would do something like:
  12449. use_operand_p use_p;
  12450. ssa_op_iter iter;
  12451. FOR_EACH_SSA_USE_OPERAND (use_p, stmt, iter, (SSA_OP_USE | SSA_OP_VUSE))
  12452. {
  12453. process_use_ptr (use_p);
  12454. }
  12455. The 'TREE' macro is basically the same as the 'USE' and 'DEF' macros,
  12456. only with the use or def dereferenced via 'USE_FROM_PTR (use_p)' and
  12457. 'DEF_FROM_PTR (def_p)'. Since we aren't using operand pointers, use and
  12458. defs flags can be mixed.
  12459. tree var;
  12460. ssa_op_iter iter;
  12461. FOR_EACH_SSA_TREE_OPERAND (var, stmt, iter, SSA_OP_VUSE)
  12462. {
  12463. print_generic_expr (stderr, var, TDF_SLIM);
  12464. }
  12465. 'VDEF's are broken into two flags, one for the 'DEF' portion
  12466. ('SSA_OP_VDEF') and one for the USE portion ('SSA_OP_VUSE').
  12467. There are many examples in the code, in addition to the documentation
  12468. in 'tree-ssa-operands.h' and 'ssa-iterators.h'.
  12469. There are also a couple of variants on the stmt iterators regarding PHI
  12470. nodes.
  12471. 'FOR_EACH_PHI_ARG' Works exactly like 'FOR_EACH_SSA_USE_OPERAND',
  12472. except it works over 'PHI' arguments instead of statement operands.
  12473. /* Look at every virtual PHI use. */
  12474. FOR_EACH_PHI_ARG (use_p, phi_stmt, iter, SSA_OP_VIRTUAL_USES)
  12475. {
  12476. my_code;
  12477. }
  12478. /* Look at every real PHI use. */
  12479. FOR_EACH_PHI_ARG (use_p, phi_stmt, iter, SSA_OP_USES)
  12480. my_code;
  12481. /* Look at every PHI use. */
  12482. FOR_EACH_PHI_ARG (use_p, phi_stmt, iter, SSA_OP_ALL_USES)
  12483. my_code;
  12484. 'FOR_EACH_PHI_OR_STMT_{USE,DEF}' works exactly like
  12485. 'FOR_EACH_SSA_{USE,DEF}_OPERAND', except it will function on either a
  12486. statement or a 'PHI' node. These should be used when it is appropriate
  12487. but they are not quite as efficient as the individual 'FOR_EACH_PHI' and
  12488. 'FOR_EACH_SSA' routines.
  12489. FOR_EACH_PHI_OR_STMT_USE (use_operand_p, stmt, iter, flags)
  12490. {
  12491. my_code;
  12492. }
  12493. FOR_EACH_PHI_OR_STMT_DEF (def_operand_p, phi, iter, flags)
  12494. {
  12495. my_code;
  12496. }
  12497. 13.2.2 Immediate Uses
  12498. ---------------------
  12499. Immediate use information is now always available. Using the immediate
  12500. use iterators, you may examine every use of any 'SSA_NAME'. For
  12501. instance, to change each use of 'ssa_var' to 'ssa_var2' and call
  12502. fold_stmt on each stmt after that is done:
  12503. use_operand_p imm_use_p;
  12504. imm_use_iterator iterator;
  12505. tree ssa_var, stmt;
  12506. FOR_EACH_IMM_USE_STMT (stmt, iterator, ssa_var)
  12507. {
  12508. FOR_EACH_IMM_USE_ON_STMT (imm_use_p, iterator)
  12509. SET_USE (imm_use_p, ssa_var_2);
  12510. fold_stmt (stmt);
  12511. }
  12512. There are 2 iterators which can be used. 'FOR_EACH_IMM_USE_FAST' is
  12513. used when the immediate uses are not changed, i.e., you are looking at
  12514. the uses, but not setting them.
  12515. If they do get changed, then care must be taken that things are not
  12516. changed under the iterators, so use the 'FOR_EACH_IMM_USE_STMT' and
  12517. 'FOR_EACH_IMM_USE_ON_STMT' iterators. They attempt to preserve the
  12518. sanity of the use list by moving all the uses for a statement into a
  12519. controlled position, and then iterating over those uses. Then the
  12520. optimization can manipulate the stmt when all the uses have been
  12521. processed. This is a little slower than the FAST version since it adds
  12522. a placeholder element and must sort through the list a bit for each
  12523. statement. This placeholder element must be also be removed if the loop
  12524. is terminated early. The macro 'BREAK_FROM_IMM_USE_STMT' is provided to
  12525. do this :
  12526. FOR_EACH_IMM_USE_STMT (stmt, iterator, ssa_var)
  12527. {
  12528. if (stmt == last_stmt)
  12529. BREAK_FROM_IMM_USE_STMT (iterator);
  12530. FOR_EACH_IMM_USE_ON_STMT (imm_use_p, iterator)
  12531. SET_USE (imm_use_p, ssa_var_2);
  12532. fold_stmt (stmt);
  12533. }
  12534. There are checks in 'verify_ssa' which verify that the immediate use
  12535. list is up to date, as well as checking that an optimization didn't
  12536. break from the loop without using this macro. It is safe to simply
  12537. 'break'; from a 'FOR_EACH_IMM_USE_FAST' traverse.
  12538. Some useful functions and macros:
  12539. 1. 'has_zero_uses (ssa_var)' : Returns true if there are no uses of
  12540. 'ssa_var'.
  12541. 2. 'has_single_use (ssa_var)' : Returns true if there is only a single
  12542. use of 'ssa_var'.
  12543. 3. 'single_imm_use (ssa_var, use_operand_p *ptr, tree *stmt)' :
  12544. Returns true if there is only a single use of 'ssa_var', and also
  12545. returns the use pointer and statement it occurs in, in the second
  12546. and third parameters.
  12547. 4. 'num_imm_uses (ssa_var)' : Returns the number of immediate uses of
  12548. 'ssa_var'. It is better not to use this if possible since it
  12549. simply utilizes a loop to count the uses.
  12550. 5. 'PHI_ARG_INDEX_FROM_USE (use_p)' : Given a use within a 'PHI' node,
  12551. return the index number for the use. An assert is triggered if the
  12552. use isn't located in a 'PHI' node.
  12553. 6. 'USE_STMT (use_p)' : Return the statement a use occurs in.
  12554. Note that uses are not put into an immediate use list until their
  12555. statement is actually inserted into the instruction stream via a 'bsi_*'
  12556. routine.
  12557. It is also still possible to utilize lazy updating of statements, but
  12558. this should be used only when absolutely required. Both alias analysis
  12559. and the dominator optimizations currently do this.
  12560. When lazy updating is being used, the immediate use information is out
  12561. of date and cannot be used reliably. Lazy updating is achieved by
  12562. simply marking statements modified via calls to 'gimple_set_modified'
  12563. instead of 'update_stmt'. When lazy updating is no longer required, all
  12564. the modified statements must have 'update_stmt' called in order to bring
  12565. them up to date. This must be done before the optimization is finished,
  12566. or 'verify_ssa' will trigger an abort.
  12567. This is done with a simple loop over the instruction stream:
  12568. block_stmt_iterator bsi;
  12569. basic_block bb;
  12570. FOR_EACH_BB (bb)
  12571. {
  12572. for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
  12573. update_stmt_if_modified (bsi_stmt (bsi));
  12574. }
  12575. 
  12576. File: gccint.info, Node: SSA, Next: Alias analysis, Prev: SSA Operands, Up: Tree SSA
  12577. 13.3 Static Single Assignment
  12578. =============================
  12579. Most of the tree optimizers rely on the data flow information provided
  12580. by the Static Single Assignment (SSA) form. We implement the SSA form
  12581. as described in 'R. Cytron, J. Ferrante, B. Rosen, M. Wegman, and K.
  12582. Zadeck. Efficiently Computing Static Single Assignment Form and the
  12583. Control Dependence Graph. ACM Transactions on Programming Languages and
  12584. Systems, 13(4):451-490, October 1991'.
  12585. The SSA form is based on the premise that program variables are
  12586. assigned in exactly one location in the program. Multiple assignments
  12587. to the same variable create new versions of that variable. Naturally,
  12588. actual programs are seldom in SSA form initially because variables tend
  12589. to be assigned multiple times. The compiler modifies the program
  12590. representation so that every time a variable is assigned in the code, a
  12591. new version of the variable is created. Different versions of the same
  12592. variable are distinguished by subscripting the variable name with its
  12593. version number. Variables used in the right-hand side of expressions
  12594. are renamed so that their version number matches that of the most recent
  12595. assignment.
  12596. We represent variable versions using 'SSA_NAME' nodes. The renaming
  12597. process in 'tree-ssa.c' wraps every real and virtual operand with an
  12598. 'SSA_NAME' node which contains the version number and the statement that
  12599. created the 'SSA_NAME'. Only definitions and virtual definitions may
  12600. create new 'SSA_NAME' nodes.
  12601. Sometimes, flow of control makes it impossible to determine the most
  12602. recent version of a variable. In these cases, the compiler inserts an
  12603. artificial definition for that variable called "PHI function" or "PHI
  12604. node". This new definition merges all the incoming versions of the
  12605. variable to create a new name for it. For instance,
  12606. if (...)
  12607. a_1 = 5;
  12608. else if (...)
  12609. a_2 = 2;
  12610. else
  12611. a_3 = 13;
  12612. # a_4 = PHI <a_1, a_2, a_3>
  12613. return a_4;
  12614. Since it is not possible to determine which of the three branches will
  12615. be taken at runtime, we don't know which of 'a_1', 'a_2' or 'a_3' to use
  12616. at the return statement. So, the SSA renamer creates a new version
  12617. 'a_4' which is assigned the result of "merging" 'a_1', 'a_2' and 'a_3'.
  12618. Hence, PHI nodes mean "one of these operands. I don't know which".
  12619. The following functions can be used to examine PHI nodes
  12620. -- Function: gimple_phi_result (PHI)
  12621. Returns the 'SSA_NAME' created by PHI node PHI (i.e., PHI's LHS).
  12622. -- Function: gimple_phi_num_args (PHI)
  12623. Returns the number of arguments in PHI. This number is exactly the
  12624. number of incoming edges to the basic block holding PHI.
  12625. -- Function: gimple_phi_arg (PHI, I)
  12626. Returns Ith argument of PHI.
  12627. -- Function: gimple_phi_arg_edge (PHI, I)
  12628. Returns the incoming edge for the Ith argument of PHI.
  12629. -- Function: gimple_phi_arg_def (PHI, I)
  12630. Returns the 'SSA_NAME' for the Ith argument of PHI.
  12631. 13.3.1 Preserving the SSA form
  12632. ------------------------------
  12633. Some optimization passes make changes to the function that invalidate
  12634. the SSA property. This can happen when a pass has added new symbols or
  12635. changed the program so that variables that were previously aliased
  12636. aren't anymore. Whenever something like this happens, the affected
  12637. symbols must be renamed into SSA form again. Transformations that emit
  12638. new code or replicate existing statements will also need to update the
  12639. SSA form.
  12640. Since GCC implements two different SSA forms for register and virtual
  12641. variables, keeping the SSA form up to date depends on whether you are
  12642. updating register or virtual names. In both cases, the general idea
  12643. behind incremental SSA updates is similar: when new SSA names are
  12644. created, they typically are meant to replace other existing names in the
  12645. program.
  12646. For instance, given the following code:
  12647. 1 L0:
  12648. 2 x_1 = PHI (0, x_5)
  12649. 3 if (x_1 < 10)
  12650. 4 if (x_1 > 7)
  12651. 5 y_2 = 0
  12652. 6 else
  12653. 7 y_3 = x_1 + x_7
  12654. 8 endif
  12655. 9 x_5 = x_1 + 1
  12656. 10 goto L0;
  12657. 11 endif
  12658. Suppose that we insert new names 'x_10' and 'x_11' (lines '4' and '8').
  12659. 1 L0:
  12660. 2 x_1 = PHI (0, x_5)
  12661. 3 if (x_1 < 10)
  12662. 4 x_10 = ...
  12663. 5 if (x_1 > 7)
  12664. 6 y_2 = 0
  12665. 7 else
  12666. 8 x_11 = ...
  12667. 9 y_3 = x_1 + x_7
  12668. 10 endif
  12669. 11 x_5 = x_1 + 1
  12670. 12 goto L0;
  12671. 13 endif
  12672. We want to replace all the uses of 'x_1' with the new definitions of
  12673. 'x_10' and 'x_11'. Note that the only uses that should be replaced are
  12674. those at lines '5', '9' and '11'. Also, the use of 'x_7' at line '9'
  12675. should _not_ be replaced (this is why we cannot just mark symbol 'x' for
  12676. renaming).
  12677. Additionally, we may need to insert a PHI node at line '11' because
  12678. that is a merge point for 'x_10' and 'x_11'. So the use of 'x_1' at
  12679. line '11' will be replaced with the new PHI node. The insertion of PHI
  12680. nodes is optional. They are not strictly necessary to preserve the SSA
  12681. form, and depending on what the caller inserted, they may not even be
  12682. useful for the optimizers.
  12683. Updating the SSA form is a two step process. First, the pass has to
  12684. identify which names need to be updated and/or which symbols need to be
  12685. renamed into SSA form for the first time. When new names are introduced
  12686. to replace existing names in the program, the mapping between the old
  12687. and the new names are registered by calling 'register_new_name_mapping'
  12688. (note that if your pass creates new code by duplicating basic blocks,
  12689. the call to 'tree_duplicate_bb' will set up the necessary mappings
  12690. automatically).
  12691. After the replacement mappings have been registered and new symbols
  12692. marked for renaming, a call to 'update_ssa' makes the registered
  12693. changes. This can be done with an explicit call or by creating 'TODO'
  12694. flags in the 'tree_opt_pass' structure for your pass. There are several
  12695. 'TODO' flags that control the behavior of 'update_ssa':
  12696. * 'TODO_update_ssa'. Update the SSA form inserting PHI nodes for
  12697. newly exposed symbols and virtual names marked for updating. When
  12698. updating real names, only insert PHI nodes for a real name 'O_j' in
  12699. blocks reached by all the new and old definitions for 'O_j'. If
  12700. the iterated dominance frontier for 'O_j' is not pruned, we may end
  12701. up inserting PHI nodes in blocks that have one or more edges with
  12702. no incoming definition for 'O_j'. This would lead to uninitialized
  12703. warnings for 'O_j''s symbol.
  12704. * 'TODO_update_ssa_no_phi'. Update the SSA form without inserting
  12705. any new PHI nodes at all. This is used by passes that have either
  12706. inserted all the PHI nodes themselves or passes that need only to
  12707. patch use-def and def-def chains for virtuals (e.g., DCE).
  12708. * 'TODO_update_ssa_full_phi'. Insert PHI nodes everywhere they are
  12709. needed. No pruning of the IDF is done. This is used by passes
  12710. that need the PHI nodes for 'O_j' even if it means that some
  12711. arguments will come from the default definition of 'O_j''s symbol
  12712. (e.g., 'pass_linear_transform').
  12713. WARNING: If you need to use this flag, chances are that your pass
  12714. may be doing something wrong. Inserting PHI nodes for an old name
  12715. where not all edges carry a new replacement may lead to silent
  12716. codegen errors or spurious uninitialized warnings.
  12717. * 'TODO_update_ssa_only_virtuals'. Passes that update the SSA form
  12718. on their own may want to delegate the updating of virtual names to
  12719. the generic updater. Since FUD chains are easier to maintain, this
  12720. simplifies the work they need to do. NOTE: If this flag is used,
  12721. any OLD->NEW mappings for real names are explicitly destroyed and
  12722. only the symbols marked for renaming are processed.
  12723. 13.3.2 Examining 'SSA_NAME' nodes
  12724. ---------------------------------
  12725. The following macros can be used to examine 'SSA_NAME' nodes
  12726. -- Macro: SSA_NAME_DEF_STMT (VAR)
  12727. Returns the statement S that creates the 'SSA_NAME' VAR. If S is
  12728. an empty statement (i.e., 'IS_EMPTY_STMT (S)' returns 'true'), it
  12729. means that the first reference to this variable is a USE or a VUSE.
  12730. -- Macro: SSA_NAME_VERSION (VAR)
  12731. Returns the version number of the 'SSA_NAME' object VAR.
  12732. 13.3.3 Walking the dominator tree
  12733. ---------------------------------
  12734. -- Tree SSA function: void walk_dominator_tree (WALK_DATA, BB)
  12735. This function walks the dominator tree for the current CFG calling
  12736. a set of callback functions defined in STRUCT DOM_WALK_DATA in
  12737. 'domwalk.h'. The call back functions you need to define give you
  12738. hooks to execute custom code at various points during traversal:
  12739. 1. Once to initialize any local data needed while processing BB
  12740. and its children. This local data is pushed into an internal
  12741. stack which is automatically pushed and popped as the walker
  12742. traverses the dominator tree.
  12743. 2. Once before traversing all the statements in the BB.
  12744. 3. Once for every statement inside BB.
  12745. 4. Once after traversing all the statements and before recursing
  12746. into BB's dominator children.
  12747. 5. It then recurses into all the dominator children of BB.
  12748. 6. After recursing into all the dominator children of BB it can,
  12749. optionally, traverse every statement in BB again (i.e.,
  12750. repeating steps 2 and 3).
  12751. 7. Once after walking the statements in BB and BB's dominator
  12752. children. At this stage, the block local data stack is
  12753. popped.
  12754. 
  12755. File: gccint.info, Node: Alias analysis, Next: Memory model, Prev: SSA, Up: Tree SSA
  12756. 13.4 Alias analysis
  12757. ===================
  12758. Alias analysis in GIMPLE SSA form consists of two pieces. First the
  12759. virtual SSA web ties conflicting memory accesses and provides a SSA
  12760. use-def chain and SSA immediate-use chains for walking possibly
  12761. dependent memory accesses. Second an alias-oracle can be queried to
  12762. disambiguate explicit and implicit memory references.
  12763. 1. Memory SSA form.
  12764. All statements that may use memory have exactly one accompanied use
  12765. of a virtual SSA name that represents the state of memory at the
  12766. given point in the IL.
  12767. All statements that may define memory have exactly one accompanied
  12768. definition of a virtual SSA name using the previous state of memory
  12769. and defining the new state of memory after the given point in the
  12770. IL.
  12771. int i;
  12772. int foo (void)
  12773. {
  12774. # .MEM_3 = VDEF <.MEM_2(D)>
  12775. i = 1;
  12776. # VUSE <.MEM_3>
  12777. return i;
  12778. }
  12779. The virtual SSA names in this case are '.MEM_2(D)' and '.MEM_3'.
  12780. The store to the global variable 'i' defines '.MEM_3' invalidating
  12781. '.MEM_2(D)'. The load from 'i' uses that new state '.MEM_3'.
  12782. The virtual SSA web serves as constraints to SSA optimizers
  12783. preventing illegitimate code-motion and optimization. It also
  12784. provides a way to walk related memory statements.
  12785. 2. Points-to and escape analysis.
  12786. Points-to analysis builds a set of constraints from the GIMPLE SSA
  12787. IL representing all pointer operations and facts we do or do not
  12788. know about pointers. Solving this set of constraints yields a
  12789. conservatively correct solution for each pointer variable in the
  12790. program (though we are only interested in SSA name pointers) as to
  12791. what it may possibly point to.
  12792. This points-to solution for a given SSA name pointer is stored in
  12793. the 'pt_solution' sub-structure of the 'SSA_NAME_PTR_INFO' record.
  12794. The following accessor functions are available:
  12795. * 'pt_solution_includes'
  12796. * 'pt_solutions_intersect'
  12797. Points-to analysis also computes the solution for two special set
  12798. of pointers, 'ESCAPED' and 'CALLUSED'. Those represent all memory
  12799. that has escaped the scope of analysis or that is used by pure or
  12800. nested const calls.
  12801. 3. Type-based alias analysis
  12802. Type-based alias analysis is frontend dependent though generic
  12803. support is provided by the middle-end in 'alias.c'. TBAA code is
  12804. used by both tree optimizers and RTL optimizers.
  12805. Every language that wishes to perform language-specific alias
  12806. analysis should define a function that computes, given a 'tree'
  12807. node, an alias set for the node. Nodes in different alias sets are
  12808. not allowed to alias. For an example, see the C front-end function
  12809. 'c_get_alias_set'.
  12810. 4. Tree alias-oracle
  12811. The tree alias-oracle provides means to disambiguate two memory
  12812. references and memory references against statements. The following
  12813. queries are available:
  12814. * 'refs_may_alias_p'
  12815. * 'ref_maybe_used_by_stmt_p'
  12816. * 'stmt_may_clobber_ref_p'
  12817. In addition to those two kind of statement walkers are available
  12818. walking statements related to a reference ref.
  12819. 'walk_non_aliased_vuses' walks over dominating memory defining
  12820. statements and calls back if the statement does not clobber ref
  12821. providing the non-aliased VUSE. The walk stops at the first
  12822. clobbering statement or if asked to. 'walk_aliased_vdefs' walks
  12823. over dominating memory defining statements and calls back on each
  12824. statement clobbering ref providing its aliasing VDEF. The walk
  12825. stops if asked to.
  12826. 
  12827. File: gccint.info, Node: Memory model, Prev: Alias analysis, Up: Tree SSA
  12828. 13.5 Memory model
  12829. =================
  12830. The memory model used by the middle-end models that of the C/C++
  12831. languages. The middle-end has the notion of an effective type of a
  12832. memory region which is used for type-based alias analysis.
  12833. The following is a refinement of ISO C99 6.5/6, clarifying the block
  12834. copy case to follow common sense and extending the concept of a dynamic
  12835. effective type to objects with a declared type as required for C++.
  12836. The effective type of an object for an access to its stored value is
  12837. the declared type of the object or the effective type determined by
  12838. a previous store to it. If a value is stored into an object through
  12839. an lvalue having a type that is not a character type, then the
  12840. type of the lvalue becomes the effective type of the object for that
  12841. access and for subsequent accesses that do not modify the stored value.
  12842. If a value is copied into an object using memcpy or memmove,
  12843. or is copied as an array of character type, then the effective type
  12844. of the modified object for that access and for subsequent accesses that
  12845. do not modify the value is undetermined. For all other accesses to an
  12846. object, the effective type of the object is simply the type of the
  12847. lvalue used for the access.
  12848. 
  12849. File: gccint.info, Node: RTL, Next: Control Flow, Prev: Tree SSA, Up: Top
  12850. 14 RTL Representation
  12851. *********************
  12852. The last part of the compiler work is done on a low-level intermediate
  12853. representation called Register Transfer Language. In this language, the
  12854. instructions to be output are described, pretty much one by one, in an
  12855. algebraic form that describes what the instruction does.
  12856. RTL is inspired by Lisp lists. It has both an internal form, made up
  12857. of structures that point at other structures, and a textual form that is
  12858. used in the machine description and in printed debugging dumps. The
  12859. textual form uses nested parentheses to indicate the pointers in the
  12860. internal form.
  12861. * Menu:
  12862. * RTL Objects:: Expressions vs vectors vs strings vs integers.
  12863. * RTL Classes:: Categories of RTL expression objects, and their structure.
  12864. * Accessors:: Macros to access expression operands or vector elts.
  12865. * Special Accessors:: Macros to access specific annotations on RTL.
  12866. * Flags:: Other flags in an RTL expression.
  12867. * Machine Modes:: Describing the size and format of a datum.
  12868. * Constants:: Expressions with constant values.
  12869. * Regs and Memory:: Expressions representing register contents or memory.
  12870. * Arithmetic:: Expressions representing arithmetic on other expressions.
  12871. * Comparisons:: Expressions representing comparison of expressions.
  12872. * Bit-Fields:: Expressions representing bit-fields in memory or reg.
  12873. * Vector Operations:: Expressions involving vector datatypes.
  12874. * Conversions:: Extending, truncating, floating or fixing.
  12875. * RTL Declarations:: Declaring volatility, constancy, etc.
  12876. * Side Effects:: Expressions for storing in registers, etc.
  12877. * Incdec:: Embedded side-effects for autoincrement addressing.
  12878. * Assembler:: Representing 'asm' with operands.
  12879. * Debug Information:: Expressions representing debugging information.
  12880. * Insns:: Expression types for entire insns.
  12881. * Calls:: RTL representation of function call insns.
  12882. * Sharing:: Some expressions are unique; others *must* be copied.
  12883. * Reading RTL:: Reading textual RTL from a file.
  12884. 
  12885. File: gccint.info, Node: RTL Objects, Next: RTL Classes, Up: RTL
  12886. 14.1 RTL Object Types
  12887. =====================
  12888. RTL uses five kinds of objects: expressions, integers, wide integers,
  12889. strings and vectors. Expressions are the most important ones. An RTL
  12890. expression ("RTX", for short) is a C structure, but it is usually
  12891. referred to with a pointer; a type that is given the typedef name 'rtx'.
  12892. An integer is simply an 'int'; their written form uses decimal digits.
  12893. A wide integer is an integral object whose type is 'HOST_WIDE_INT';
  12894. their written form uses decimal digits.
  12895. A string is a sequence of characters. In core it is represented as a
  12896. 'char *' in usual C fashion, and it is written in C syntax as well.
  12897. However, strings in RTL may never be null. If you write an empty string
  12898. in a machine description, it is represented in core as a null pointer
  12899. rather than as a pointer to a null character. In certain contexts,
  12900. these null pointers instead of strings are valid. Within RTL code,
  12901. strings are most commonly found inside 'symbol_ref' expressions, but
  12902. they appear in other contexts in the RTL expressions that make up
  12903. machine descriptions.
  12904. In a machine description, strings are normally written with double
  12905. quotes, as you would in C. However, strings in machine descriptions may
  12906. extend over many lines, which is invalid C, and adjacent string
  12907. constants are not concatenated as they are in C. Any string constant
  12908. may be surrounded with a single set of parentheses. Sometimes this
  12909. makes the machine description easier to read.
  12910. There is also a special syntax for strings, which can be useful when C
  12911. code is embedded in a machine description. Wherever a string can
  12912. appear, it is also valid to write a C-style brace block. The entire
  12913. brace block, including the outermost pair of braces, is considered to be
  12914. the string constant. Double quote characters inside the braces are not
  12915. special. Therefore, if you write string constants in the C code, you
  12916. need not escape each quote character with a backslash.
  12917. A vector contains an arbitrary number of pointers to expressions. The
  12918. number of elements in the vector is explicitly present in the vector.
  12919. The written form of a vector consists of square brackets ('[...]')
  12920. surrounding the elements, in sequence and with whitespace separating
  12921. them. Vectors of length zero are not created; null pointers are used
  12922. instead.
  12923. Expressions are classified by "expression codes" (also called RTX
  12924. codes). The expression code is a name defined in 'rtl.def', which is
  12925. also (in uppercase) a C enumeration constant. The possible expression
  12926. codes and their meanings are machine-independent. The code of an RTX
  12927. can be extracted with the macro 'GET_CODE (X)' and altered with
  12928. 'PUT_CODE (X, NEWCODE)'.
  12929. The expression code determines how many operands the expression
  12930. contains, and what kinds of objects they are. In RTL, unlike Lisp, you
  12931. cannot tell by looking at an operand what kind of object it is.
  12932. Instead, you must know from its context--from the expression code of the
  12933. containing expression. For example, in an expression of code 'subreg',
  12934. the first operand is to be regarded as an expression and the second
  12935. operand as a polynomial integer. In an expression of code 'plus', there
  12936. are two operands, both of which are to be regarded as expressions. In a
  12937. 'symbol_ref' expression, there is one operand, which is to be regarded
  12938. as a string.
  12939. Expressions are written as parentheses containing the name of the
  12940. expression type, its flags and machine mode if any, and then the
  12941. operands of the expression (separated by spaces).
  12942. Expression code names in the 'md' file are written in lowercase, but
  12943. when they appear in C code they are written in uppercase. In this
  12944. manual, they are shown as follows: 'const_int'.
  12945. In a few contexts a null pointer is valid where an expression is
  12946. normally wanted. The written form of this is '(nil)'.
  12947. 
  12948. File: gccint.info, Node: RTL Classes, Next: Accessors, Prev: RTL Objects, Up: RTL
  12949. 14.2 RTL Classes and Formats
  12950. ============================
  12951. The various expression codes are divided into several "classes", which
  12952. are represented by single characters. You can determine the class of an
  12953. RTX code with the macro 'GET_RTX_CLASS (CODE)'. Currently, 'rtl.def'
  12954. defines these classes:
  12955. 'RTX_OBJ'
  12956. An RTX code that represents an actual object, such as a register
  12957. ('REG') or a memory location ('MEM', 'SYMBOL_REF'). 'LO_SUM') is
  12958. also included; instead, 'SUBREG' and 'STRICT_LOW_PART' are not in
  12959. this class, but in class 'RTX_EXTRA'.
  12960. 'RTX_CONST_OBJ'
  12961. An RTX code that represents a constant object. 'HIGH' is also
  12962. included in this class.
  12963. 'RTX_COMPARE'
  12964. An RTX code for a non-symmetric comparison, such as 'GEU' or 'LT'.
  12965. 'RTX_COMM_COMPARE'
  12966. An RTX code for a symmetric (commutative) comparison, such as 'EQ'
  12967. or 'ORDERED'.
  12968. 'RTX_UNARY'
  12969. An RTX code for a unary arithmetic operation, such as 'NEG', 'NOT',
  12970. or 'ABS'. This category also includes value extension (sign or
  12971. zero) and conversions between integer and floating point.
  12972. 'RTX_COMM_ARITH'
  12973. An RTX code for a commutative binary operation, such as 'PLUS' or
  12974. 'AND'. 'NE' and 'EQ' are comparisons, so they have class
  12975. 'RTX_COMM_COMPARE'.
  12976. 'RTX_BIN_ARITH'
  12977. An RTX code for a non-commutative binary operation, such as
  12978. 'MINUS', 'DIV', or 'ASHIFTRT'.
  12979. 'RTX_BITFIELD_OPS'
  12980. An RTX code for a bit-field operation. Currently only
  12981. 'ZERO_EXTRACT' and 'SIGN_EXTRACT'. These have three inputs and are
  12982. lvalues (so they can be used for insertion as well). *Note
  12983. Bit-Fields::.
  12984. 'RTX_TERNARY'
  12985. An RTX code for other three input operations. Currently only
  12986. 'IF_THEN_ELSE', 'VEC_MERGE', 'SIGN_EXTRACT', 'ZERO_EXTRACT', and
  12987. 'FMA'.
  12988. 'RTX_INSN'
  12989. An RTX code for an entire instruction: 'INSN', 'JUMP_INSN', and
  12990. 'CALL_INSN'. *Note Insns::.
  12991. 'RTX_MATCH'
  12992. An RTX code for something that matches in insns, such as
  12993. 'MATCH_DUP'. These only occur in machine descriptions.
  12994. 'RTX_AUTOINC'
  12995. An RTX code for an auto-increment addressing mode, such as
  12996. 'POST_INC'. 'XEXP (X, 0)' gives the auto-modified register.
  12997. 'RTX_EXTRA'
  12998. All other RTX codes. This category includes the remaining codes
  12999. used only in machine descriptions ('DEFINE_*', etc.). It also
  13000. includes all the codes describing side effects ('SET', 'USE',
  13001. 'CLOBBER', etc.) and the non-insns that may appear on an insn
  13002. chain, such as 'NOTE', 'BARRIER', and 'CODE_LABEL'. 'SUBREG' is
  13003. also part of this class.
  13004. For each expression code, 'rtl.def' specifies the number of contained
  13005. objects and their kinds using a sequence of characters called the
  13006. "format" of the expression code. For example, the format of 'subreg' is
  13007. 'ep'.
  13008. These are the most commonly used format characters:
  13009. 'e'
  13010. An expression (actually a pointer to an expression).
  13011. 'i'
  13012. An integer.
  13013. 'w'
  13014. A wide integer.
  13015. 's'
  13016. A string.
  13017. 'E'
  13018. A vector of expressions.
  13019. A few other format characters are used occasionally:
  13020. 'u'
  13021. 'u' is equivalent to 'e' except that it is printed differently in
  13022. debugging dumps. It is used for pointers to insns.
  13023. 'n'
  13024. 'n' is equivalent to 'i' except that it is printed differently in
  13025. debugging dumps. It is used for the line number or code number of
  13026. a 'note' insn.
  13027. 'S'
  13028. 'S' indicates a string which is optional. In the RTL objects in
  13029. core, 'S' is equivalent to 's', but when the object is read, from
  13030. an 'md' file, the string value of this operand may be omitted. An
  13031. omitted string is taken to be the null string.
  13032. 'V'
  13033. 'V' indicates a vector which is optional. In the RTL objects in
  13034. core, 'V' is equivalent to 'E', but when the object is read from an
  13035. 'md' file, the vector value of this operand may be omitted. An
  13036. omitted vector is effectively the same as a vector of no elements.
  13037. 'B'
  13038. 'B' indicates a pointer to basic block structure.
  13039. 'p'
  13040. A polynomial integer. At present this is used only for
  13041. 'SUBREG_BYTE'.
  13042. '0'
  13043. '0' means a slot whose contents do not fit any normal category.
  13044. '0' slots are not printed at all in dumps, and are often used in
  13045. special ways by small parts of the compiler.
  13046. There are macros to get the number of operands and the format of an
  13047. expression code:
  13048. 'GET_RTX_LENGTH (CODE)'
  13049. Number of operands of an RTX of code CODE.
  13050. 'GET_RTX_FORMAT (CODE)'
  13051. The format of an RTX of code CODE, as a C string.
  13052. Some classes of RTX codes always have the same format. For example, it
  13053. is safe to assume that all comparison operations have format 'ee'.
  13054. 'RTX_UNARY'
  13055. All codes of this class have format 'e'.
  13056. 'RTX_BIN_ARITH'
  13057. 'RTX_COMM_ARITH'
  13058. 'RTX_COMM_COMPARE'
  13059. 'RTX_COMPARE'
  13060. All codes of these classes have format 'ee'.
  13061. 'RTX_BITFIELD_OPS'
  13062. 'RTX_TERNARY'
  13063. All codes of these classes have format 'eee'.
  13064. 'RTX_INSN'
  13065. All codes of this class have formats that begin with 'iuueiee'.
  13066. *Note Insns::. Note that not all RTL objects linked onto an insn
  13067. chain are of class 'RTX_INSN'.
  13068. 'RTX_CONST_OBJ'
  13069. 'RTX_OBJ'
  13070. 'RTX_MATCH'
  13071. 'RTX_EXTRA'
  13072. You can make no assumptions about the format of these codes.
  13073. 
  13074. File: gccint.info, Node: Accessors, Next: Special Accessors, Prev: RTL Classes, Up: RTL
  13075. 14.3 Access to Operands
  13076. =======================
  13077. Operands of expressions are accessed using the macros 'XEXP', 'XINT',
  13078. 'XWINT' and 'XSTR'. Each of these macros takes two arguments: an
  13079. expression-pointer (RTX) and an operand number (counting from zero).
  13080. Thus,
  13081. XEXP (X, 2)
  13082. accesses operand 2 of expression X, as an expression.
  13083. XINT (X, 2)
  13084. accesses the same operand as an integer. 'XSTR', used in the same
  13085. fashion, would access it as a string.
  13086. Any operand can be accessed as an integer, as an expression or as a
  13087. string. You must choose the correct method of access for the kind of
  13088. value actually stored in the operand. You would do this based on the
  13089. expression code of the containing expression. That is also how you
  13090. would know how many operands there are.
  13091. For example, if X is an 'int_list' expression, you know that it has two
  13092. operands which can be correctly accessed as 'XINT (X, 0)' and 'XEXP (X,
  13093. 1)'. Incorrect accesses like 'XEXP (X, 0)' and 'XINT (X, 1)' would
  13094. compile, but would trigger an internal compiler error when rtl checking
  13095. is enabled. Nothing stops you from writing 'XEXP (X, 28)' either, but
  13096. this will access memory past the end of the expression with
  13097. unpredictable results.
  13098. Access to operands which are vectors is more complicated. You can use
  13099. the macro 'XVEC' to get the vector-pointer itself, or the macros
  13100. 'XVECEXP' and 'XVECLEN' to access the elements and length of a vector.
  13101. 'XVEC (EXP, IDX)'
  13102. Access the vector-pointer which is operand number IDX in EXP.
  13103. 'XVECLEN (EXP, IDX)'
  13104. Access the length (number of elements) in the vector which is in
  13105. operand number IDX in EXP. This value is an 'int'.
  13106. 'XVECEXP (EXP, IDX, ELTNUM)'
  13107. Access element number ELTNUM in the vector which is in operand
  13108. number IDX in EXP. This value is an RTX.
  13109. It is up to you to make sure that ELTNUM is not negative and is
  13110. less than 'XVECLEN (EXP, IDX)'.
  13111. All the macros defined in this section expand into lvalues and
  13112. therefore can be used to assign the operands, lengths and vector
  13113. elements as well as to access them.
  13114. 
  13115. File: gccint.info, Node: Special Accessors, Next: Flags, Prev: Accessors, Up: RTL
  13116. 14.4 Access to Special Operands
  13117. ===============================
  13118. Some RTL nodes have special annotations associated with them.
  13119. 'MEM'
  13120. 'MEM_ALIAS_SET (X)'
  13121. If 0, X is not in any alias set, and may alias anything.
  13122. Otherwise, X can only alias 'MEM's in a conflicting alias set.
  13123. This value is set in a language-dependent manner in the
  13124. front-end, and should not be altered in the back-end. In some
  13125. front-ends, these numbers may correspond in some way to types,
  13126. or other language-level entities, but they need not, and the
  13127. back-end makes no such assumptions. These set numbers are
  13128. tested with 'alias_sets_conflict_p'.
  13129. 'MEM_EXPR (X)'
  13130. If this register is known to hold the value of some user-level
  13131. declaration, this is that tree node. It may also be a
  13132. 'COMPONENT_REF', in which case this is some field reference,
  13133. and 'TREE_OPERAND (X, 0)' contains the declaration, or another
  13134. 'COMPONENT_REF', or null if there is no compile-time object
  13135. associated with the reference.
  13136. 'MEM_OFFSET_KNOWN_P (X)'
  13137. True if the offset of the memory reference from 'MEM_EXPR' is
  13138. known. 'MEM_OFFSET (X)' provides the offset if so.
  13139. 'MEM_OFFSET (X)'
  13140. The offset from the start of 'MEM_EXPR'. The value is only
  13141. valid if 'MEM_OFFSET_KNOWN_P (X)' is true.
  13142. 'MEM_SIZE_KNOWN_P (X)'
  13143. True if the size of the memory reference is known. 'MEM_SIZE
  13144. (X)' provides its size if so.
  13145. 'MEM_SIZE (X)'
  13146. The size in bytes of the memory reference. This is mostly
  13147. relevant for 'BLKmode' references as otherwise the size is
  13148. implied by the mode. The value is only valid if
  13149. 'MEM_SIZE_KNOWN_P (X)' is true.
  13150. 'MEM_ALIGN (X)'
  13151. The known alignment in bits of the memory reference.
  13152. 'MEM_ADDR_SPACE (X)'
  13153. The address space of the memory reference. This will commonly
  13154. be zero for the generic address space.
  13155. 'REG'
  13156. 'ORIGINAL_REGNO (X)'
  13157. This field holds the number the register "originally" had; for
  13158. a pseudo register turned into a hard reg this will hold the
  13159. old pseudo register number.
  13160. 'REG_EXPR (X)'
  13161. If this register is known to hold the value of some user-level
  13162. declaration, this is that tree node.
  13163. 'REG_OFFSET (X)'
  13164. If this register is known to hold the value of some user-level
  13165. declaration, this is the offset into that logical storage.
  13166. 'SYMBOL_REF'
  13167. 'SYMBOL_REF_DECL (X)'
  13168. If the 'symbol_ref' X was created for a 'VAR_DECL' or a
  13169. 'FUNCTION_DECL', that tree is recorded here. If this value is
  13170. null, then X was created by back end code generation routines,
  13171. and there is no associated front end symbol table entry.
  13172. 'SYMBOL_REF_DECL' may also point to a tree of class ''c'',
  13173. that is, some sort of constant. In this case, the
  13174. 'symbol_ref' is an entry in the per-file constant pool; again,
  13175. there is no associated front end symbol table entry.
  13176. 'SYMBOL_REF_CONSTANT (X)'
  13177. If 'CONSTANT_POOL_ADDRESS_P (X)' is true, this is the constant
  13178. pool entry for X. It is null otherwise.
  13179. 'SYMBOL_REF_DATA (X)'
  13180. A field of opaque type used to store 'SYMBOL_REF_DECL' or
  13181. 'SYMBOL_REF_CONSTANT'.
  13182. 'SYMBOL_REF_FLAGS (X)'
  13183. In a 'symbol_ref', this is used to communicate various
  13184. predicates about the symbol. Some of these are common enough
  13185. to be computed by common code, some are specific to the
  13186. target. The common bits are:
  13187. 'SYMBOL_FLAG_FUNCTION'
  13188. Set if the symbol refers to a function.
  13189. 'SYMBOL_FLAG_LOCAL'
  13190. Set if the symbol is local to this "module". See
  13191. 'TARGET_BINDS_LOCAL_P'.
  13192. 'SYMBOL_FLAG_EXTERNAL'
  13193. Set if this symbol is not defined in this translation
  13194. unit. Note that this is not the inverse of
  13195. 'SYMBOL_FLAG_LOCAL'.
  13196. 'SYMBOL_FLAG_SMALL'
  13197. Set if the symbol is located in the small data section.
  13198. See 'TARGET_IN_SMALL_DATA_P'.
  13199. 'SYMBOL_REF_TLS_MODEL (X)'
  13200. This is a multi-bit field accessor that returns the
  13201. 'tls_model' to be used for a thread-local storage symbol.
  13202. It returns zero for non-thread-local symbols.
  13203. 'SYMBOL_FLAG_HAS_BLOCK_INFO'
  13204. Set if the symbol has 'SYMBOL_REF_BLOCK' and
  13205. 'SYMBOL_REF_BLOCK_OFFSET' fields.
  13206. 'SYMBOL_FLAG_ANCHOR'
  13207. Set if the symbol is used as a section anchor. "Section
  13208. anchors" are symbols that have a known position within an
  13209. 'object_block' and that can be used to access nearby
  13210. members of that block. They are used to implement
  13211. '-fsection-anchors'.
  13212. If this flag is set, then 'SYMBOL_FLAG_HAS_BLOCK_INFO'
  13213. will be too.
  13214. Bits beginning with 'SYMBOL_FLAG_MACH_DEP' are available for
  13215. the target's use.
  13216. 'SYMBOL_REF_BLOCK (X)'
  13217. If 'SYMBOL_REF_HAS_BLOCK_INFO_P (X)', this is the 'object_block'
  13218. structure to which the symbol belongs, or 'NULL' if it has not been
  13219. assigned a block.
  13220. 'SYMBOL_REF_BLOCK_OFFSET (X)'
  13221. If 'SYMBOL_REF_HAS_BLOCK_INFO_P (X)', this is the offset of X from
  13222. the first object in 'SYMBOL_REF_BLOCK (X)'. The value is negative
  13223. if X has not yet been assigned to a block, or it has not been given
  13224. an offset within that block.
  13225. 
  13226. File: gccint.info, Node: Flags, Next: Machine Modes, Prev: Special Accessors, Up: RTL
  13227. 14.5 Flags in an RTL Expression
  13228. ===============================
  13229. RTL expressions contain several flags (one-bit bit-fields) that are used
  13230. in certain types of expression. Most often they are accessed with the
  13231. following macros, which expand into lvalues.
  13232. 'CROSSING_JUMP_P (X)'
  13233. Nonzero in a 'jump_insn' if it crosses between hot and cold
  13234. sections, which could potentially be very far apart in the
  13235. executable. The presence of this flag indicates to other
  13236. optimizations that this branching instruction should not be
  13237. "collapsed" into a simpler branching construct. It is used when
  13238. the optimization to partition basic blocks into hot and cold
  13239. sections is turned on.
  13240. 'CONSTANT_POOL_ADDRESS_P (X)'
  13241. Nonzero in a 'symbol_ref' if it refers to part of the current
  13242. function's constant pool. For most targets these addresses are in
  13243. a '.rodata' section entirely separate from the function, but for
  13244. some targets the addresses are close to the beginning of the
  13245. function. In either case GCC assumes these addresses can be
  13246. addressed directly, perhaps with the help of base registers.
  13247. Stored in the 'unchanging' field and printed as '/u'.
  13248. 'INSN_ANNULLED_BRANCH_P (X)'
  13249. In a 'jump_insn', 'call_insn', or 'insn' indicates that the branch
  13250. is an annulling one. See the discussion under 'sequence' below.
  13251. Stored in the 'unchanging' field and printed as '/u'.
  13252. 'INSN_DELETED_P (X)'
  13253. In an 'insn', 'call_insn', 'jump_insn', 'code_label',
  13254. 'jump_table_data', 'barrier', or 'note', nonzero if the insn has
  13255. been deleted. Stored in the 'volatil' field and printed as '/v'.
  13256. 'INSN_FROM_TARGET_P (X)'
  13257. In an 'insn' or 'jump_insn' or 'call_insn' in a delay slot of a
  13258. branch, indicates that the insn is from the target of the branch.
  13259. If the branch insn has 'INSN_ANNULLED_BRANCH_P' set, this insn will
  13260. only be executed if the branch is taken. For annulled branches
  13261. with 'INSN_FROM_TARGET_P' clear, the insn will be executed only if
  13262. the branch is not taken. When 'INSN_ANNULLED_BRANCH_P' is not set,
  13263. this insn will always be executed. Stored in the 'in_struct' field
  13264. and printed as '/s'.
  13265. 'LABEL_PRESERVE_P (X)'
  13266. In a 'code_label' or 'note', indicates that the label is referenced
  13267. by code or data not visible to the RTL of a given function. Labels
  13268. referenced by a non-local goto will have this bit set. Stored in
  13269. the 'in_struct' field and printed as '/s'.
  13270. 'LABEL_REF_NONLOCAL_P (X)'
  13271. In 'label_ref' and 'reg_label' expressions, nonzero if this is a
  13272. reference to a non-local label. Stored in the 'volatil' field and
  13273. printed as '/v'.
  13274. 'MEM_KEEP_ALIAS_SET_P (X)'
  13275. In 'mem' expressions, 1 if we should keep the alias set for this
  13276. mem unchanged when we access a component. Set to 1, for example,
  13277. when we are already in a non-addressable component of an aggregate.
  13278. Stored in the 'jump' field and printed as '/j'.
  13279. 'MEM_VOLATILE_P (X)'
  13280. In 'mem', 'asm_operands', and 'asm_input' expressions, nonzero for
  13281. volatile memory references. Stored in the 'volatil' field and
  13282. printed as '/v'.
  13283. 'MEM_NOTRAP_P (X)'
  13284. In 'mem', nonzero for memory references that will not trap. Stored
  13285. in the 'call' field and printed as '/c'.
  13286. 'MEM_POINTER (X)'
  13287. Nonzero in a 'mem' if the memory reference holds a pointer. Stored
  13288. in the 'frame_related' field and printed as '/f'.
  13289. 'MEM_READONLY_P (X)'
  13290. Nonzero in a 'mem', if the memory is statically allocated and
  13291. read-only.
  13292. Read-only in this context means never modified during the lifetime
  13293. of the program, not necessarily in ROM or in write-disabled pages.
  13294. A common example of the later is a shared library's global offset
  13295. table. This table is initialized by the runtime loader, so the
  13296. memory is technically writable, but after control is transferred
  13297. from the runtime loader to the application, this memory will never
  13298. be subsequently modified.
  13299. Stored in the 'unchanging' field and printed as '/u'.
  13300. 'PREFETCH_SCHEDULE_BARRIER_P (X)'
  13301. In a 'prefetch', indicates that the prefetch is a scheduling
  13302. barrier. No other INSNs will be moved over it. Stored in the
  13303. 'volatil' field and printed as '/v'.
  13304. 'REG_FUNCTION_VALUE_P (X)'
  13305. Nonzero in a 'reg' if it is the place in which this function's
  13306. value is going to be returned. (This happens only in a hard
  13307. register.) Stored in the 'return_val' field and printed as '/i'.
  13308. 'REG_POINTER (X)'
  13309. Nonzero in a 'reg' if the register holds a pointer. Stored in the
  13310. 'frame_related' field and printed as '/f'.
  13311. 'REG_USERVAR_P (X)'
  13312. In a 'reg', nonzero if it corresponds to a variable present in the
  13313. user's source code. Zero for temporaries generated internally by
  13314. the compiler. Stored in the 'volatil' field and printed as '/v'.
  13315. The same hard register may be used also for collecting the values
  13316. of functions called by this one, but 'REG_FUNCTION_VALUE_P' is zero
  13317. in this kind of use.
  13318. 'RTL_CONST_CALL_P (X)'
  13319. In a 'call_insn' indicates that the insn represents a call to a
  13320. const function. Stored in the 'unchanging' field and printed as
  13321. '/u'.
  13322. 'RTL_PURE_CALL_P (X)'
  13323. In a 'call_insn' indicates that the insn represents a call to a
  13324. pure function. Stored in the 'return_val' field and printed as
  13325. '/i'.
  13326. 'RTL_CONST_OR_PURE_CALL_P (X)'
  13327. In a 'call_insn', true if 'RTL_CONST_CALL_P' or 'RTL_PURE_CALL_P'
  13328. is true.
  13329. 'RTL_LOOPING_CONST_OR_PURE_CALL_P (X)'
  13330. In a 'call_insn' indicates that the insn represents a possibly
  13331. infinite looping call to a const or pure function. Stored in the
  13332. 'call' field and printed as '/c'. Only true if one of
  13333. 'RTL_CONST_CALL_P' or 'RTL_PURE_CALL_P' is true.
  13334. 'RTX_FRAME_RELATED_P (X)'
  13335. Nonzero in an 'insn', 'call_insn', 'jump_insn', 'barrier', or 'set'
  13336. which is part of a function prologue and sets the stack pointer,
  13337. sets the frame pointer, or saves a register. This flag should also
  13338. be set on an instruction that sets up a temporary register to use
  13339. in place of the frame pointer. Stored in the 'frame_related' field
  13340. and printed as '/f'.
  13341. In particular, on RISC targets where there are limits on the sizes
  13342. of immediate constants, it is sometimes impossible to reach the
  13343. register save area directly from the stack pointer. In that case,
  13344. a temporary register is used that is near enough to the register
  13345. save area, and the Canonical Frame Address, i.e., DWARF2's logical
  13346. frame pointer, register must (temporarily) be changed to be this
  13347. temporary register. So, the instruction that sets this temporary
  13348. register must be marked as 'RTX_FRAME_RELATED_P'.
  13349. If the marked instruction is overly complex (defined in terms of
  13350. what 'dwarf2out_frame_debug_expr' can handle), you will also have
  13351. to create a 'REG_FRAME_RELATED_EXPR' note and attach it to the
  13352. instruction. This note should contain a simple expression of the
  13353. computation performed by this instruction, i.e., one that
  13354. 'dwarf2out_frame_debug_expr' can handle.
  13355. This flag is required for exception handling support on targets
  13356. with RTL prologues.
  13357. 'SCHED_GROUP_P (X)'
  13358. During instruction scheduling, in an 'insn', 'call_insn',
  13359. 'jump_insn' or 'jump_table_data', indicates that the previous insn
  13360. must be scheduled together with this insn. This is used to ensure
  13361. that certain groups of instructions will not be split up by the
  13362. instruction scheduling pass, for example, 'use' insns before a
  13363. 'call_insn' may not be separated from the 'call_insn'. Stored in
  13364. the 'in_struct' field and printed as '/s'.
  13365. 'SET_IS_RETURN_P (X)'
  13366. For a 'set', nonzero if it is for a return. Stored in the 'jump'
  13367. field and printed as '/j'.
  13368. 'SIBLING_CALL_P (X)'
  13369. For a 'call_insn', nonzero if the insn is a sibling call. Stored
  13370. in the 'jump' field and printed as '/j'.
  13371. 'STRING_POOL_ADDRESS_P (X)'
  13372. For a 'symbol_ref' expression, nonzero if it addresses this
  13373. function's string constant pool. Stored in the 'frame_related'
  13374. field and printed as '/f'.
  13375. 'SUBREG_PROMOTED_UNSIGNED_P (X)'
  13376. Returns a value greater then zero for a 'subreg' that has
  13377. 'SUBREG_PROMOTED_VAR_P' nonzero if the object being referenced is
  13378. kept zero-extended, zero if it is kept sign-extended, and less then
  13379. zero if it is extended some other way via the 'ptr_extend'
  13380. instruction. Stored in the 'unchanging' field and 'volatil' field,
  13381. printed as '/u' and '/v'. This macro may only be used to get the
  13382. value it may not be used to change the value. Use
  13383. 'SUBREG_PROMOTED_UNSIGNED_SET' to change the value.
  13384. 'SUBREG_PROMOTED_UNSIGNED_SET (X)'
  13385. Set the 'unchanging' and 'volatil' fields in a 'subreg' to reflect
  13386. zero, sign, or other extension. If 'volatil' is zero, then
  13387. 'unchanging' as nonzero means zero extension and as zero means sign
  13388. extension. If 'volatil' is nonzero then some other type of
  13389. extension was done via the 'ptr_extend' instruction.
  13390. 'SUBREG_PROMOTED_VAR_P (X)'
  13391. Nonzero in a 'subreg' if it was made when accessing an object that
  13392. was promoted to a wider mode in accord with the 'PROMOTED_MODE'
  13393. machine description macro (*note Storage Layout::). In this case,
  13394. the mode of the 'subreg' is the declared mode of the object and the
  13395. mode of 'SUBREG_REG' is the mode of the register that holds the
  13396. object. Promoted variables are always either sign- or
  13397. zero-extended to the wider mode on every assignment. Stored in the
  13398. 'in_struct' field and printed as '/s'.
  13399. 'SYMBOL_REF_USED (X)'
  13400. In a 'symbol_ref', indicates that X has been used. This is
  13401. normally only used to ensure that X is only declared external once.
  13402. Stored in the 'used' field.
  13403. 'SYMBOL_REF_WEAK (X)'
  13404. In a 'symbol_ref', indicates that X has been declared weak. Stored
  13405. in the 'return_val' field and printed as '/i'.
  13406. 'SYMBOL_REF_FLAG (X)'
  13407. In a 'symbol_ref', this is used as a flag for machine-specific
  13408. purposes. Stored in the 'volatil' field and printed as '/v'.
  13409. Most uses of 'SYMBOL_REF_FLAG' are historic and may be subsumed by
  13410. 'SYMBOL_REF_FLAGS'. Certainly use of 'SYMBOL_REF_FLAGS' is
  13411. mandatory if the target requires more than one bit of storage.
  13412. These are the fields to which the above macros refer:
  13413. 'call'
  13414. In a 'mem', 1 means that the memory reference will not trap.
  13415. In a 'call', 1 means that this pure or const call may possibly
  13416. infinite loop.
  13417. In an RTL dump, this flag is represented as '/c'.
  13418. 'frame_related'
  13419. In an 'insn' or 'set' expression, 1 means that it is part of a
  13420. function prologue and sets the stack pointer, sets the frame
  13421. pointer, saves a register, or sets up a temporary register to use
  13422. in place of the frame pointer.
  13423. In 'reg' expressions, 1 means that the register holds a pointer.
  13424. In 'mem' expressions, 1 means that the memory reference holds a
  13425. pointer.
  13426. In 'symbol_ref' expressions, 1 means that the reference addresses
  13427. this function's string constant pool.
  13428. In an RTL dump, this flag is represented as '/f'.
  13429. 'in_struct'
  13430. In 'reg' expressions, it is 1 if the register has its entire life
  13431. contained within the test expression of some loop.
  13432. In 'subreg' expressions, 1 means that the 'subreg' is accessing an
  13433. object that has had its mode promoted from a wider mode.
  13434. In 'label_ref' expressions, 1 means that the referenced label is
  13435. outside the innermost loop containing the insn in which the
  13436. 'label_ref' was found.
  13437. In 'code_label' expressions, it is 1 if the label may never be
  13438. deleted. This is used for labels which are the target of non-local
  13439. gotos. Such a label that would have been deleted is replaced with
  13440. a 'note' of type 'NOTE_INSN_DELETED_LABEL'.
  13441. In an 'insn' during dead-code elimination, 1 means that the insn is
  13442. dead code.
  13443. In an 'insn' or 'jump_insn' during reorg for an insn in the delay
  13444. slot of a branch, 1 means that this insn is from the target of the
  13445. branch.
  13446. In an 'insn' during instruction scheduling, 1 means that this insn
  13447. must be scheduled as part of a group together with the previous
  13448. insn.
  13449. In an RTL dump, this flag is represented as '/s'.
  13450. 'return_val'
  13451. In 'reg' expressions, 1 means the register contains the value to be
  13452. returned by the current function. On machines that pass parameters
  13453. in registers, the same register number may be used for parameters
  13454. as well, but this flag is not set on such uses.
  13455. In 'symbol_ref' expressions, 1 means the referenced symbol is weak.
  13456. In 'call' expressions, 1 means the call is pure.
  13457. In an RTL dump, this flag is represented as '/i'.
  13458. 'jump'
  13459. In a 'mem' expression, 1 means we should keep the alias set for
  13460. this mem unchanged when we access a component.
  13461. In a 'set', 1 means it is for a return.
  13462. In a 'call_insn', 1 means it is a sibling call.
  13463. In a 'jump_insn', 1 means it is a crossing jump.
  13464. In an RTL dump, this flag is represented as '/j'.
  13465. 'unchanging'
  13466. In 'reg' and 'mem' expressions, 1 means that the value of the
  13467. expression never changes.
  13468. In 'subreg' expressions, it is 1 if the 'subreg' references an
  13469. unsigned object whose mode has been promoted to a wider mode.
  13470. In an 'insn' or 'jump_insn' in the delay slot of a branch
  13471. instruction, 1 means an annulling branch should be used.
  13472. In a 'symbol_ref' expression, 1 means that this symbol addresses
  13473. something in the per-function constant pool.
  13474. In a 'call_insn' 1 means that this instruction is a call to a const
  13475. function.
  13476. In an RTL dump, this flag is represented as '/u'.
  13477. 'used'
  13478. This flag is used directly (without an access macro) at the end of
  13479. RTL generation for a function, to count the number of times an
  13480. expression appears in insns. Expressions that appear more than
  13481. once are copied, according to the rules for shared structure (*note
  13482. Sharing::).
  13483. For a 'reg', it is used directly (without an access macro) by the
  13484. leaf register renumbering code to ensure that each register is only
  13485. renumbered once.
  13486. In a 'symbol_ref', it indicates that an external declaration for
  13487. the symbol has already been written.
  13488. 'volatil'
  13489. In a 'mem', 'asm_operands', or 'asm_input' expression, it is 1 if
  13490. the memory reference is volatile. Volatile memory references may
  13491. not be deleted, reordered or combined.
  13492. In a 'symbol_ref' expression, it is used for machine-specific
  13493. purposes.
  13494. In a 'reg' expression, it is 1 if the value is a user-level
  13495. variable. 0 indicates an internal compiler temporary.
  13496. In an 'insn', 1 means the insn has been deleted.
  13497. In 'label_ref' and 'reg_label' expressions, 1 means a reference to
  13498. a non-local label.
  13499. In 'prefetch' expressions, 1 means that the containing insn is a
  13500. scheduling barrier.
  13501. In an RTL dump, this flag is represented as '/v'.
  13502. 
  13503. File: gccint.info, Node: Machine Modes, Next: Constants, Prev: Flags, Up: RTL
  13504. 14.6 Machine Modes
  13505. ==================
  13506. A machine mode describes a size of data object and the representation
  13507. used for it. In the C code, machine modes are represented by an
  13508. enumeration type, 'machine_mode', defined in 'machmode.def'. Each RTL
  13509. expression has room for a machine mode and so do certain kinds of tree
  13510. expressions (declarations and types, to be precise).
  13511. In debugging dumps and machine descriptions, the machine mode of an RTL
  13512. expression is written after the expression code with a colon to separate
  13513. them. The letters 'mode' which appear at the end of each machine mode
  13514. name are omitted. For example, '(reg:SI 38)' is a 'reg' expression with
  13515. machine mode 'SImode'. If the mode is 'VOIDmode', it is not written at
  13516. all.
  13517. Here is a table of machine modes. The term "byte" below refers to an
  13518. object of 'BITS_PER_UNIT' bits (*note Storage Layout::).
  13519. 'BImode'
  13520. "Bit" mode represents a single bit, for predicate registers.
  13521. 'QImode'
  13522. "Quarter-Integer" mode represents a single byte treated as an
  13523. integer.
  13524. 'HImode'
  13525. "Half-Integer" mode represents a two-byte integer.
  13526. 'PSImode'
  13527. "Partial Single Integer" mode represents an integer which occupies
  13528. four bytes but which doesn't really use all four. On some
  13529. machines, this is the right mode to use for pointers.
  13530. 'SImode'
  13531. "Single Integer" mode represents a four-byte integer.
  13532. 'PDImode'
  13533. "Partial Double Integer" mode represents an integer which occupies
  13534. eight bytes but which doesn't really use all eight. On some
  13535. machines, this is the right mode to use for certain pointers.
  13536. 'DImode'
  13537. "Double Integer" mode represents an eight-byte integer.
  13538. 'TImode'
  13539. "Tetra Integer" (?) mode represents a sixteen-byte integer.
  13540. 'OImode'
  13541. "Octa Integer" (?) mode represents a thirty-two-byte integer.
  13542. 'XImode'
  13543. "Hexadeca Integer" (?) mode represents a sixty-four-byte integer.
  13544. 'QFmode'
  13545. "Quarter-Floating" mode represents a quarter-precision (single
  13546. byte) floating point number.
  13547. 'HFmode'
  13548. "Half-Floating" mode represents a half-precision (two byte)
  13549. floating point number.
  13550. 'TQFmode'
  13551. "Three-Quarter-Floating" (?) mode represents a
  13552. three-quarter-precision (three byte) floating point number.
  13553. 'SFmode'
  13554. "Single Floating" mode represents a four byte floating point
  13555. number. In the common case, of a processor with IEEE arithmetic
  13556. and 8-bit bytes, this is a single-precision IEEE floating point
  13557. number; it can also be used for double-precision (on processors
  13558. with 16-bit bytes) and single-precision VAX and IBM types.
  13559. 'DFmode'
  13560. "Double Floating" mode represents an eight byte floating point
  13561. number. In the common case, of a processor with IEEE arithmetic
  13562. and 8-bit bytes, this is a double-precision IEEE floating point
  13563. number.
  13564. 'XFmode'
  13565. "Extended Floating" mode represents an IEEE extended floating point
  13566. number. This mode only has 80 meaningful bits (ten bytes). Some
  13567. processors require such numbers to be padded to twelve bytes,
  13568. others to sixteen; this mode is used for either.
  13569. 'SDmode'
  13570. "Single Decimal Floating" mode represents a four byte decimal
  13571. floating point number (as distinct from conventional binary
  13572. floating point).
  13573. 'DDmode'
  13574. "Double Decimal Floating" mode represents an eight byte decimal
  13575. floating point number.
  13576. 'TDmode'
  13577. "Tetra Decimal Floating" mode represents a sixteen byte decimal
  13578. floating point number all 128 of whose bits are meaningful.
  13579. 'TFmode'
  13580. "Tetra Floating" mode represents a sixteen byte floating point
  13581. number all 128 of whose bits are meaningful. One common use is the
  13582. IEEE quad-precision format.
  13583. 'QQmode'
  13584. "Quarter-Fractional" mode represents a single byte treated as a
  13585. signed fractional number. The default format is "s.7".
  13586. 'HQmode'
  13587. "Half-Fractional" mode represents a two-byte signed fractional
  13588. number. The default format is "s.15".
  13589. 'SQmode'
  13590. "Single Fractional" mode represents a four-byte signed fractional
  13591. number. The default format is "s.31".
  13592. 'DQmode'
  13593. "Double Fractional" mode represents an eight-byte signed fractional
  13594. number. The default format is "s.63".
  13595. 'TQmode'
  13596. "Tetra Fractional" mode represents a sixteen-byte signed fractional
  13597. number. The default format is "s.127".
  13598. 'UQQmode'
  13599. "Unsigned Quarter-Fractional" mode represents a single byte treated
  13600. as an unsigned fractional number. The default format is ".8".
  13601. 'UHQmode'
  13602. "Unsigned Half-Fractional" mode represents a two-byte unsigned
  13603. fractional number. The default format is ".16".
  13604. 'USQmode'
  13605. "Unsigned Single Fractional" mode represents a four-byte unsigned
  13606. fractional number. The default format is ".32".
  13607. 'UDQmode'
  13608. "Unsigned Double Fractional" mode represents an eight-byte unsigned
  13609. fractional number. The default format is ".64".
  13610. 'UTQmode'
  13611. "Unsigned Tetra Fractional" mode represents a sixteen-byte unsigned
  13612. fractional number. The default format is ".128".
  13613. 'HAmode'
  13614. "Half-Accumulator" mode represents a two-byte signed accumulator.
  13615. The default format is "s8.7".
  13616. 'SAmode'
  13617. "Single Accumulator" mode represents a four-byte signed
  13618. accumulator. The default format is "s16.15".
  13619. 'DAmode'
  13620. "Double Accumulator" mode represents an eight-byte signed
  13621. accumulator. The default format is "s32.31".
  13622. 'TAmode'
  13623. "Tetra Accumulator" mode represents a sixteen-byte signed
  13624. accumulator. The default format is "s64.63".
  13625. 'UHAmode'
  13626. "Unsigned Half-Accumulator" mode represents a two-byte unsigned
  13627. accumulator. The default format is "8.8".
  13628. 'USAmode'
  13629. "Unsigned Single Accumulator" mode represents a four-byte unsigned
  13630. accumulator. The default format is "16.16".
  13631. 'UDAmode'
  13632. "Unsigned Double Accumulator" mode represents an eight-byte
  13633. unsigned accumulator. The default format is "32.32".
  13634. 'UTAmode'
  13635. "Unsigned Tetra Accumulator" mode represents a sixteen-byte
  13636. unsigned accumulator. The default format is "64.64".
  13637. 'CCmode'
  13638. "Condition Code" mode represents the value of a condition code,
  13639. which is a machine-specific set of bits used to represent the
  13640. result of a comparison operation. Other machine-specific modes may
  13641. also be used for the condition code. These modes are not used on
  13642. machines that use 'cc0' (*note Condition Code::).
  13643. 'BLKmode'
  13644. "Block" mode represents values that are aggregates to which none of
  13645. the other modes apply. In RTL, only memory references can have
  13646. this mode, and only if they appear in string-move or vector
  13647. instructions. On machines which have no such instructions,
  13648. 'BLKmode' will not appear in RTL.
  13649. 'VOIDmode'
  13650. Void mode means the absence of a mode or an unspecified mode. For
  13651. example, RTL expressions of code 'const_int' have mode 'VOIDmode'
  13652. because they can be taken to have whatever mode the context
  13653. requires. In debugging dumps of RTL, 'VOIDmode' is expressed by
  13654. the absence of any mode.
  13655. 'QCmode, HCmode, SCmode, DCmode, XCmode, TCmode'
  13656. These modes stand for a complex number represented as a pair of
  13657. floating point values. The floating point values are in 'QFmode',
  13658. 'HFmode', 'SFmode', 'DFmode', 'XFmode', and 'TFmode', respectively.
  13659. 'CQImode, CHImode, CSImode, CDImode, CTImode, COImode, CPSImode'
  13660. These modes stand for a complex number represented as a pair of
  13661. integer values. The integer values are in 'QImode', 'HImode',
  13662. 'SImode', 'DImode', 'TImode', 'OImode', and 'PSImode',
  13663. respectively.
  13664. 'BND32mode BND64mode'
  13665. These modes stand for bounds for pointer of 32 and 64 bit size
  13666. respectively. Mode size is double pointer mode size.
  13667. The machine description defines 'Pmode' as a C macro which expands into
  13668. the machine mode used for addresses. Normally this is the mode whose
  13669. size is 'BITS_PER_WORD', 'SImode' on 32-bit machines.
  13670. The only modes which a machine description must support are 'QImode',
  13671. and the modes corresponding to 'BITS_PER_WORD', 'FLOAT_TYPE_SIZE' and
  13672. 'DOUBLE_TYPE_SIZE'. The compiler will attempt to use 'DImode' for
  13673. 8-byte structures and unions, but this can be prevented by overriding
  13674. the definition of 'MAX_FIXED_MODE_SIZE'. Alternatively, you can have
  13675. the compiler use 'TImode' for 16-byte structures and unions. Likewise,
  13676. you can arrange for the C type 'short int' to avoid using 'HImode'.
  13677. Very few explicit references to machine modes remain in the compiler
  13678. and these few references will soon be removed. Instead, the machine
  13679. modes are divided into mode classes. These are represented by the
  13680. enumeration type 'enum mode_class' defined in 'machmode.h'. The
  13681. possible mode classes are:
  13682. 'MODE_INT'
  13683. Integer modes. By default these are 'BImode', 'QImode', 'HImode',
  13684. 'SImode', 'DImode', 'TImode', and 'OImode'.
  13685. 'MODE_PARTIAL_INT'
  13686. The "partial integer" modes, 'PQImode', 'PHImode', 'PSImode' and
  13687. 'PDImode'.
  13688. 'MODE_FLOAT'
  13689. Floating point modes. By default these are 'QFmode', 'HFmode',
  13690. 'TQFmode', 'SFmode', 'DFmode', 'XFmode' and 'TFmode'.
  13691. 'MODE_DECIMAL_FLOAT'
  13692. Decimal floating point modes. By default these are 'SDmode',
  13693. 'DDmode' and 'TDmode'.
  13694. 'MODE_FRACT'
  13695. Signed fractional modes. By default these are 'QQmode', 'HQmode',
  13696. 'SQmode', 'DQmode' and 'TQmode'.
  13697. 'MODE_UFRACT'
  13698. Unsigned fractional modes. By default these are 'UQQmode',
  13699. 'UHQmode', 'USQmode', 'UDQmode' and 'UTQmode'.
  13700. 'MODE_ACCUM'
  13701. Signed accumulator modes. By default these are 'HAmode', 'SAmode',
  13702. 'DAmode' and 'TAmode'.
  13703. 'MODE_UACCUM'
  13704. Unsigned accumulator modes. By default these are 'UHAmode',
  13705. 'USAmode', 'UDAmode' and 'UTAmode'.
  13706. 'MODE_COMPLEX_INT'
  13707. Complex integer modes. (These are not currently implemented).
  13708. 'MODE_COMPLEX_FLOAT'
  13709. Complex floating point modes. By default these are 'QCmode',
  13710. 'HCmode', 'SCmode', 'DCmode', 'XCmode', and 'TCmode'.
  13711. 'MODE_CC'
  13712. Modes representing condition code values. These are 'CCmode' plus
  13713. any 'CC_MODE' modes listed in the 'MACHINE-modes.def'. *Note Jump
  13714. Patterns::, also see *note Condition Code::.
  13715. 'MODE_POINTER_BOUNDS'
  13716. Pointer bounds modes. Used to represent values of pointer bounds
  13717. type. Operations in these modes may be executed as NOPs depending
  13718. on hardware features and environment setup.
  13719. 'MODE_RANDOM'
  13720. This is a catchall mode class for modes which don't fit into the
  13721. above classes. Currently 'VOIDmode' and 'BLKmode' are in
  13722. 'MODE_RANDOM'.
  13723. 'machmode.h' also defines various wrapper classes that combine a
  13724. 'machine_mode' with a static assertion that a particular condition
  13725. holds. The classes are:
  13726. 'scalar_int_mode'
  13727. A mode that has class 'MODE_INT' or 'MODE_PARTIAL_INT'.
  13728. 'scalar_float_mode'
  13729. A mode that has class 'MODE_FLOAT' or 'MODE_DECIMAL_FLOAT'.
  13730. 'scalar_mode'
  13731. A mode that holds a single numerical value. In practice this means
  13732. that the mode is a 'scalar_int_mode', is a 'scalar_float_mode', or
  13733. has class 'MODE_FRACT', 'MODE_UFRACT', 'MODE_ACCUM', 'MODE_UACCUM'
  13734. or 'MODE_POINTER_BOUNDS'.
  13735. 'complex_mode'
  13736. A mode that has class 'MODE_COMPLEX_INT' or 'MODE_COMPLEX_FLOAT'.
  13737. 'fixed_size_mode'
  13738. A mode whose size is known at compile time.
  13739. Named modes use the most constrained of the available wrapper classes,
  13740. if one exists, otherwise they use 'machine_mode'. For example, 'QImode'
  13741. is a 'scalar_int_mode', 'SFmode' is a 'scalar_float_mode' and 'BLKmode'
  13742. is a plain 'machine_mode'. It is possible to refer to any mode as a raw
  13743. 'machine_mode' by adding the 'E_' prefix, where 'E' stands for
  13744. "enumeration". For example, the raw 'machine_mode' names of the modes
  13745. just mentioned are 'E_QImode', 'E_SFmode' and 'E_BLKmode' respectively.
  13746. The wrapper classes implicitly convert to 'machine_mode' and to any
  13747. wrapper class that represents a more general condition; for example
  13748. 'scalar_int_mode' and 'scalar_float_mode' both convert to 'scalar_mode'
  13749. and all three convert to 'fixed_size_mode'. The classes act like
  13750. 'machine_mode's that accept only certain named modes.
  13751. 'machmode.h' also defines a template class 'opt_mode<T>' that holds a
  13752. 'T' or nothing, where 'T' can be either 'machine_mode' or one of the
  13753. wrapper classes above. The main operations on an 'opt_mode<T>' X are as
  13754. follows:
  13755. 'X.exists ()'
  13756. Return true if X holds a mode rather than nothing.
  13757. 'X.exists (&Y)'
  13758. Return true if X holds a mode rather than nothing, storing the mode
  13759. in Y if so. Y must be assignment-compatible with T.
  13760. 'X.require ()'
  13761. Assert that X holds a mode rather than nothing and return that
  13762. mode.
  13763. 'X = Y'
  13764. Set X to Y, where Y is a T or implicitly converts to a T.
  13765. The default constructor sets an 'opt_mode<T>' to nothing. There is
  13766. also a constructor that takes an initial value of type T.
  13767. It is possible to use the 'is-a.h' accessors on a 'machine_mode' or
  13768. machine mode wrapper X:
  13769. 'is_a <T> (X)'
  13770. Return true if X meets the conditions for wrapper class T.
  13771. 'is_a <T> (X, &Y)'
  13772. Return true if X meets the conditions for wrapper class T, storing
  13773. it in Y if so. Y must be assignment-compatible with T.
  13774. 'as_a <T> (X)'
  13775. Assert that X meets the conditions for wrapper class T and return
  13776. it as a T.
  13777. 'dyn_cast <T> (X)'
  13778. Return an 'opt_mode<T>' that holds X if X meets the conditions for
  13779. wrapper class T and that holds nothing otherwise.
  13780. The purpose of these wrapper classes is to give stronger static type
  13781. checking. For example, if a function takes a 'scalar_int_mode', a
  13782. caller that has a general 'machine_mode' must either check or assert
  13783. that the code is indeed a scalar integer first, using one of the
  13784. functions above.
  13785. The wrapper classes are normal C++ classes, with user-defined
  13786. constructors. Sometimes it is useful to have a POD version of the same
  13787. type, particularly if the type appears in a 'union'. The template class
  13788. 'pod_mode<T>' provides a POD version of wrapper class T. It is
  13789. assignment-compatible with T and implicitly converts to both
  13790. 'machine_mode' and T.
  13791. Here are some C macros that relate to machine modes:
  13792. 'GET_MODE (X)'
  13793. Returns the machine mode of the RTX X.
  13794. 'PUT_MODE (X, NEWMODE)'
  13795. Alters the machine mode of the RTX X to be NEWMODE.
  13796. 'NUM_MACHINE_MODES'
  13797. Stands for the number of machine modes available on the target
  13798. machine. This is one greater than the largest numeric value of any
  13799. machine mode.
  13800. 'GET_MODE_NAME (M)'
  13801. Returns the name of mode M as a string.
  13802. 'GET_MODE_CLASS (M)'
  13803. Returns the mode class of mode M.
  13804. 'GET_MODE_WIDER_MODE (M)'
  13805. Returns the next wider natural mode. For example, the expression
  13806. 'GET_MODE_WIDER_MODE (QImode)' returns 'HImode'.
  13807. 'GET_MODE_SIZE (M)'
  13808. Returns the size in bytes of a datum of mode M.
  13809. 'GET_MODE_BITSIZE (M)'
  13810. Returns the size in bits of a datum of mode M.
  13811. 'GET_MODE_IBIT (M)'
  13812. Returns the number of integral bits of a datum of fixed-point mode
  13813. M.
  13814. 'GET_MODE_FBIT (M)'
  13815. Returns the number of fractional bits of a datum of fixed-point
  13816. mode M.
  13817. 'GET_MODE_MASK (M)'
  13818. Returns a bitmask containing 1 for all bits in a word that fit
  13819. within mode M. This macro can only be used for modes whose bitsize
  13820. is less than or equal to 'HOST_BITS_PER_INT'.
  13821. 'GET_MODE_ALIGNMENT (M)'
  13822. Return the required alignment, in bits, for an object of mode M.
  13823. 'GET_MODE_UNIT_SIZE (M)'
  13824. Returns the size in bytes of the subunits of a datum of mode M.
  13825. This is the same as 'GET_MODE_SIZE' except in the case of complex
  13826. modes. For them, the unit size is the size of the real or
  13827. imaginary part.
  13828. 'GET_MODE_NUNITS (M)'
  13829. Returns the number of units contained in a mode, i.e.,
  13830. 'GET_MODE_SIZE' divided by 'GET_MODE_UNIT_SIZE'.
  13831. 'GET_CLASS_NARROWEST_MODE (C)'
  13832. Returns the narrowest mode in mode class C.
  13833. The following 3 variables are defined on every target. They can be
  13834. used to allocate buffers that are guaranteed to be large enough to hold
  13835. any value that can be represented on the target. The first two can be
  13836. overridden by defining them in the target's mode.def file, however, the
  13837. value must be a constant that can determined very early in the
  13838. compilation process. The third symbol cannot be overridden.
  13839. 'BITS_PER_UNIT'
  13840. The number of bits in an addressable storage unit (byte). If you
  13841. do not define this, the default is 8.
  13842. 'MAX_BITSIZE_MODE_ANY_INT'
  13843. The maximum bitsize of any mode that is used in integer math. This
  13844. should be overridden by the target if it uses large integers as
  13845. containers for larger vectors but otherwise never uses the contents
  13846. to compute integer values.
  13847. 'MAX_BITSIZE_MODE_ANY_MODE'
  13848. The bitsize of the largest mode on the target. The default value
  13849. is the largest mode size given in the mode definition file, which
  13850. is always correct for targets whose modes have a fixed size.
  13851. Targets that might increase the size of a mode beyond this default
  13852. should define 'MAX_BITSIZE_MODE_ANY_MODE' to the actual upper limit
  13853. in 'MACHINE-modes.def'.
  13854. The global variables 'byte_mode' and 'word_mode' contain modes whose
  13855. classes are 'MODE_INT' and whose bitsizes are either 'BITS_PER_UNIT' or
  13856. 'BITS_PER_WORD', respectively. On 32-bit machines, these are 'QImode'
  13857. and 'SImode', respectively.
  13858. 
  13859. File: gccint.info, Node: Constants, Next: Regs and Memory, Prev: Machine Modes, Up: RTL
  13860. 14.7 Constant Expression Types
  13861. ==============================
  13862. The simplest RTL expressions are those that represent constant values.
  13863. '(const_int I)'
  13864. This type of expression represents the integer value I. I is
  13865. customarily accessed with the macro 'INTVAL' as in 'INTVAL (EXP)',
  13866. which is equivalent to 'XWINT (EXP, 0)'.
  13867. Constants generated for modes with fewer bits than in
  13868. 'HOST_WIDE_INT' must be sign extended to full width (e.g., with
  13869. 'gen_int_mode'). For constants for modes with more bits than in
  13870. 'HOST_WIDE_INT' the implied high order bits of that constant are
  13871. copies of the top bit. Note however that values are neither
  13872. inherently signed nor inherently unsigned; where necessary,
  13873. signedness is determined by the rtl operation instead.
  13874. There is only one expression object for the integer value zero; it
  13875. is the value of the variable 'const0_rtx'. Likewise, the only
  13876. expression for integer value one is found in 'const1_rtx', the only
  13877. expression for integer value two is found in 'const2_rtx', and the
  13878. only expression for integer value negative one is found in
  13879. 'constm1_rtx'. Any attempt to create an expression of code
  13880. 'const_int' and value zero, one, two or negative one will return
  13881. 'const0_rtx', 'const1_rtx', 'const2_rtx' or 'constm1_rtx' as
  13882. appropriate.
  13883. Similarly, there is only one object for the integer whose value is
  13884. 'STORE_FLAG_VALUE'. It is found in 'const_true_rtx'. If
  13885. 'STORE_FLAG_VALUE' is one, 'const_true_rtx' and 'const1_rtx' will
  13886. point to the same object. If 'STORE_FLAG_VALUE' is -1,
  13887. 'const_true_rtx' and 'constm1_rtx' will point to the same object.
  13888. '(const_double:M I0 I1 ...)'
  13889. This represents either a floating-point constant of mode M or (on
  13890. older ports that do not define 'TARGET_SUPPORTS_WIDE_INT') an
  13891. integer constant too large to fit into 'HOST_BITS_PER_WIDE_INT'
  13892. bits but small enough to fit within twice that number of bits. In
  13893. the latter case, M will be 'VOIDmode'. For integral values
  13894. constants for modes with more bits than twice the number in
  13895. 'HOST_WIDE_INT' the implied high order bits of that constant are
  13896. copies of the top bit of 'CONST_DOUBLE_HIGH'. Note however that
  13897. integral values are neither inherently signed nor inherently
  13898. unsigned; where necessary, signedness is determined by the rtl
  13899. operation instead.
  13900. On more modern ports, 'CONST_DOUBLE' only represents floating point
  13901. values. New ports define 'TARGET_SUPPORTS_WIDE_INT' to make this
  13902. designation.
  13903. If M is 'VOIDmode', the bits of the value are stored in I0 and I1.
  13904. I0 is customarily accessed with the macro 'CONST_DOUBLE_LOW' and I1
  13905. with 'CONST_DOUBLE_HIGH'.
  13906. If the constant is floating point (regardless of its precision),
  13907. then the number of integers used to store the value depends on the
  13908. size of 'REAL_VALUE_TYPE' (*note Floating Point::). The integers
  13909. represent a floating point number, but not precisely in the target
  13910. machine's or host machine's floating point format. To convert them
  13911. to the precise bit pattern used by the target machine, use the
  13912. macro 'REAL_VALUE_TO_TARGET_DOUBLE' and friends (*note Data
  13913. Output::).
  13914. '(const_wide_int:M NUNITS ELT0 ...)'
  13915. This contains an array of 'HOST_WIDE_INT's that is large enough to
  13916. hold any constant that can be represented on the target. This form
  13917. of rtl is only used on targets that define
  13918. 'TARGET_SUPPORTS_WIDE_INT' to be nonzero and then 'CONST_DOUBLE's
  13919. are only used to hold floating-point values. If the target leaves
  13920. 'TARGET_SUPPORTS_WIDE_INT' defined as 0, 'CONST_WIDE_INT's are not
  13921. used and 'CONST_DOUBLE's are as they were before.
  13922. The values are stored in a compressed format. The higher-order 0s
  13923. or -1s are not represented if they are just the logical sign
  13924. extension of the number that is represented.
  13925. 'CONST_WIDE_INT_VEC (CODE)'
  13926. Returns the entire array of 'HOST_WIDE_INT's that are used to store
  13927. the value. This macro should be rarely used.
  13928. 'CONST_WIDE_INT_NUNITS (CODE)'
  13929. The number of 'HOST_WIDE_INT's used to represent the number. Note
  13930. that this generally is smaller than the number of 'HOST_WIDE_INT's
  13931. implied by the mode size.
  13932. 'CONST_WIDE_INT_ELT (CODE,I)'
  13933. Returns the 'i'th element of the array. Element 0 is contains the
  13934. low order bits of the constant.
  13935. '(const_fixed:M ...)'
  13936. Represents a fixed-point constant of mode M. The operand is a data
  13937. structure of type 'struct fixed_value' and is accessed with the
  13938. macro 'CONST_FIXED_VALUE'. The high part of data is accessed with
  13939. 'CONST_FIXED_VALUE_HIGH'; the low part is accessed with
  13940. 'CONST_FIXED_VALUE_LOW'.
  13941. '(const_poly_int:M [C0 C1 ...])'
  13942. Represents a 'poly_int'-style polynomial integer with coefficients
  13943. C0, C1, .... The coefficients are 'wide_int'-based integers rather
  13944. than rtxes. 'CONST_POLY_INT_COEFFS' gives the values of individual
  13945. coefficients (which is mostly only useful in low-level routines)
  13946. and 'const_poly_int_value' gives the full 'poly_int' value.
  13947. '(const_vector:M [X0 X1 ...])'
  13948. Represents a vector constant. The values in square brackets are
  13949. elements of the vector, which are always 'const_int',
  13950. 'const_wide_int', 'const_double' or 'const_fixed' expressions.
  13951. Each vector constant V is treated as a specific instance of an
  13952. arbitrary-length sequence that itself contains
  13953. 'CONST_VECTOR_NPATTERNS (V)' interleaved patterns. Each pattern
  13954. has the form:
  13955. { BASE0, BASE1, BASE1 + STEP, BASE1 + STEP * 2, ... }
  13956. The first three elements in each pattern are enough to determine
  13957. the values of the other elements. However, if all STEPs are zero,
  13958. only the first two elements are needed. If in addition each BASE1
  13959. is equal to the corresponding BASE0, only the first element in each
  13960. pattern is needed. The number of determining elements per pattern
  13961. is given by 'CONST_VECTOR_NELTS_PER_PATTERN (V)'.
  13962. For example, the constant:
  13963. { 0, 1, 2, 6, 3, 8, 4, 10, 5, 12, 6, 14, 7, 16, 8, 18 }
  13964. is interpreted as an interleaving of the sequences:
  13965. { 0, 2, 3, 4, 5, 6, 7, 8 }
  13966. { 1, 6, 8, 10, 12, 14, 16, 18 }
  13967. where the sequences are represented by the following patterns:
  13968. BASE0 == 0, BASE1 == 2, STEP == 1
  13969. BASE0 == 1, BASE1 == 6, STEP == 2
  13970. In this case:
  13971. CONST_VECTOR_NPATTERNS (V) == 2
  13972. CONST_VECTOR_NELTS_PER_PATTERN (V) == 3
  13973. Thus the first 6 elements ('{ 0, 1, 2, 6, 3, 8 }') are enough to
  13974. determine the whole sequence; we refer to them as the "encoded"
  13975. elements. They are the only elements present in the square
  13976. brackets for variable-length 'const_vector's (i.e. for
  13977. 'const_vector's whose mode M has a variable number of elements).
  13978. However, as a convenience to code that needs to handle both
  13979. 'const_vector's and 'parallel's, all elements are present in the
  13980. square brackets for fixed-length 'const_vector's; the encoding
  13981. scheme simply reduces the amount of work involved in processing
  13982. constants that follow a regular pattern.
  13983. Sometimes this scheme can create two possible encodings of the same
  13984. vector. For example { 0, 1 } could be seen as two patterns with
  13985. one element each or one pattern with two elements (BASE0 and
  13986. BASE1). The canonical encoding is always the one with the fewest
  13987. patterns or (if both encodings have the same number of petterns)
  13988. the one with the fewest encoded elements.
  13989. 'const_vector_encoding_nelts (V)' gives the total number of encoded
  13990. elements in V, which is 6 in the example above.
  13991. 'CONST_VECTOR_ENCODED_ELT (V, I)' accesses the value of encoded
  13992. element I.
  13993. 'CONST_VECTOR_DUPLICATE_P (V)' is true if V simply contains
  13994. repeated instances of 'CONST_VECTOR_NPATTERNS (V)' values. This is
  13995. a shorthand for testing 'CONST_VECTOR_NELTS_PER_PATTERN (V) == 1'.
  13996. 'CONST_VECTOR_STEPPED_P (V)' is true if at least one pattern in V
  13997. has a nonzero step. This is a shorthand for testing
  13998. 'CONST_VECTOR_NELTS_PER_PATTERN (V) == 3'.
  13999. 'CONST_VECTOR_NUNITS (V)' gives the total number of elements in V;
  14000. it is a shorthand for getting the number of units in 'GET_MODE
  14001. (V)'.
  14002. The utility function 'const_vector_elt' gives the value of an
  14003. arbitrary element as an 'rtx'. 'const_vector_int_elt' gives the
  14004. same value as a 'wide_int'.
  14005. '(const_string STR)'
  14006. Represents a constant string with value STR. Currently this is
  14007. used only for insn attributes (*note Insn Attributes::) since
  14008. constant strings in C are placed in memory.
  14009. '(symbol_ref:MODE SYMBOL)'
  14010. Represents the value of an assembler label for data. SYMBOL is a
  14011. string that describes the name of the assembler label. If it
  14012. starts with a '*', the label is the rest of SYMBOL not including
  14013. the '*'. Otherwise, the label is SYMBOL, usually prefixed with
  14014. '_'.
  14015. The 'symbol_ref' contains a mode, which is usually 'Pmode'.
  14016. Usually that is the only mode for which a symbol is directly valid.
  14017. '(label_ref:MODE LABEL)'
  14018. Represents the value of an assembler label for code. It contains
  14019. one operand, an expression, which must be a 'code_label' or a
  14020. 'note' of type 'NOTE_INSN_DELETED_LABEL' that appears in the
  14021. instruction sequence to identify the place where the label should
  14022. go.
  14023. The reason for using a distinct expression type for code label
  14024. references is so that jump optimization can distinguish them.
  14025. The 'label_ref' contains a mode, which is usually 'Pmode'. Usually
  14026. that is the only mode for which a label is directly valid.
  14027. '(const:M EXP)'
  14028. Represents a constant that is the result of an assembly-time
  14029. arithmetic computation. The operand, EXP, contains only
  14030. 'const_int', 'symbol_ref', 'label_ref' or 'unspec' expressions,
  14031. combined with 'plus' and 'minus'. Any such 'unspec's are
  14032. target-specific and typically represent some form of relocation
  14033. operator. M should be a valid address mode.
  14034. '(high:M EXP)'
  14035. Represents the high-order bits of EXP. The number of bits is
  14036. machine-dependent and is normally the number of bits specified in
  14037. an instruction that initializes the high order bits of a register.
  14038. It is used with 'lo_sum' to represent the typical two-instruction
  14039. sequence used in RISC machines to reference large immediate values
  14040. and/or link-time constants such as global memory addresses. In the
  14041. latter case, M is 'Pmode' and EXP is usually a constant expression
  14042. involving 'symbol_ref'.
  14043. The macro 'CONST0_RTX (MODE)' refers to an expression with value 0 in
  14044. mode MODE. If mode MODE is of mode class 'MODE_INT', it returns
  14045. 'const0_rtx'. If mode MODE is of mode class 'MODE_FLOAT', it returns a
  14046. 'CONST_DOUBLE' expression in mode MODE. Otherwise, it returns a
  14047. 'CONST_VECTOR' expression in mode MODE. Similarly, the macro
  14048. 'CONST1_RTX (MODE)' refers to an expression with value 1 in mode MODE
  14049. and similarly for 'CONST2_RTX'. The 'CONST1_RTX' and 'CONST2_RTX'
  14050. macros are undefined for vector modes.
  14051. 
  14052. File: gccint.info, Node: Regs and Memory, Next: Arithmetic, Prev: Constants, Up: RTL
  14053. 14.8 Registers and Memory
  14054. =========================
  14055. Here are the RTL expression types for describing access to machine
  14056. registers and to main memory.
  14057. '(reg:M N)'
  14058. For small values of the integer N (those that are less than
  14059. 'FIRST_PSEUDO_REGISTER'), this stands for a reference to machine
  14060. register number N: a "hard register". For larger values of N, it
  14061. stands for a temporary value or "pseudo register". The compiler's
  14062. strategy is to generate code assuming an unlimited number of such
  14063. pseudo registers, and later convert them into hard registers or
  14064. into memory references.
  14065. M is the machine mode of the reference. It is necessary because
  14066. machines can generally refer to each register in more than one
  14067. mode. For example, a register may contain a full word but there
  14068. may be instructions to refer to it as a half word or as a single
  14069. byte, as well as instructions to refer to it as a floating point
  14070. number of various precisions.
  14071. Even for a register that the machine can access in only one mode,
  14072. the mode must always be specified.
  14073. The symbol 'FIRST_PSEUDO_REGISTER' is defined by the machine
  14074. description, since the number of hard registers on the machine is
  14075. an invariant characteristic of the machine. Note, however, that
  14076. not all of the machine registers must be general registers. All
  14077. the machine registers that can be used for storage of data are
  14078. given hard register numbers, even those that can be used only in
  14079. certain instructions or can hold only certain types of data.
  14080. A hard register may be accessed in various modes throughout one
  14081. function, but each pseudo register is given a natural mode and is
  14082. accessed only in that mode. When it is necessary to describe an
  14083. access to a pseudo register using a nonnatural mode, a 'subreg'
  14084. expression is used.
  14085. A 'reg' expression with a machine mode that specifies more than one
  14086. word of data may actually stand for several consecutive registers.
  14087. If in addition the register number specifies a hardware register,
  14088. then it actually represents several consecutive hardware registers
  14089. starting with the specified one.
  14090. Each pseudo register number used in a function's RTL code is
  14091. represented by a unique 'reg' expression.
  14092. Some pseudo register numbers, those within the range of
  14093. 'FIRST_VIRTUAL_REGISTER' to 'LAST_VIRTUAL_REGISTER' only appear
  14094. during the RTL generation phase and are eliminated before the
  14095. optimization phases. These represent locations in the stack frame
  14096. that cannot be determined until RTL generation for the function has
  14097. been completed. The following virtual register numbers are
  14098. defined:
  14099. 'VIRTUAL_INCOMING_ARGS_REGNUM'
  14100. This points to the first word of the incoming arguments passed
  14101. on the stack. Normally these arguments are placed there by
  14102. the caller, but the callee may have pushed some arguments that
  14103. were previously passed in registers.
  14104. When RTL generation is complete, this virtual register is
  14105. replaced by the sum of the register given by
  14106. 'ARG_POINTER_REGNUM' and the value of 'FIRST_PARM_OFFSET'.
  14107. 'VIRTUAL_STACK_VARS_REGNUM'
  14108. If 'FRAME_GROWS_DOWNWARD' is defined to a nonzero value, this
  14109. points to immediately above the first variable on the stack.
  14110. Otherwise, it points to the first variable on the stack.
  14111. 'VIRTUAL_STACK_VARS_REGNUM' is replaced with the sum of the
  14112. register given by 'FRAME_POINTER_REGNUM' and the value
  14113. 'TARGET_STARTING_FRAME_OFFSET'.
  14114. 'VIRTUAL_STACK_DYNAMIC_REGNUM'
  14115. This points to the location of dynamically allocated memory on
  14116. the stack immediately after the stack pointer has been
  14117. adjusted by the amount of memory desired.
  14118. This virtual register is replaced by the sum of the register
  14119. given by 'STACK_POINTER_REGNUM' and the value
  14120. 'STACK_DYNAMIC_OFFSET'.
  14121. 'VIRTUAL_OUTGOING_ARGS_REGNUM'
  14122. This points to the location in the stack at which outgoing
  14123. arguments should be written when the stack is pre-pushed
  14124. (arguments pushed using push insns should always use
  14125. 'STACK_POINTER_REGNUM').
  14126. This virtual register is replaced by the sum of the register
  14127. given by 'STACK_POINTER_REGNUM' and the value
  14128. 'STACK_POINTER_OFFSET'.
  14129. '(subreg:M1 REG:M2 BYTENUM)'
  14130. 'subreg' expressions are used to refer to a register in a machine
  14131. mode other than its natural one, or to refer to one register of a
  14132. multi-part 'reg' that actually refers to several registers.
  14133. Each pseudo register has a natural mode. If it is necessary to
  14134. operate on it in a different mode, the register must be enclosed in
  14135. a 'subreg'.
  14136. There are currently three supported types for the first operand of
  14137. a 'subreg':
  14138. * pseudo registers This is the most common case. Most 'subreg's
  14139. have pseudo 'reg's as their first operand.
  14140. * mem 'subreg's of 'mem' were common in earlier versions of GCC
  14141. and are still supported. During the reload pass these are
  14142. replaced by plain 'mem's. On machines that do not do
  14143. instruction scheduling, use of 'subreg's of 'mem' are still
  14144. used, but this is no longer recommended. Such 'subreg's are
  14145. considered to be 'register_operand's rather than
  14146. 'memory_operand's before and during reload. Because of this,
  14147. the scheduling passes cannot properly schedule instructions
  14148. with 'subreg's of 'mem', so for machines that do scheduling,
  14149. 'subreg's of 'mem' should never be used. To support this, the
  14150. combine and recog passes have explicit code to inhibit the
  14151. creation of 'subreg's of 'mem' when 'INSN_SCHEDULING' is
  14152. defined.
  14153. The use of 'subreg's of 'mem' after the reload pass is an area
  14154. that is not well understood and should be avoided. There is
  14155. still some code in the compiler to support this, but this code
  14156. has possibly rotted. This use of 'subreg's is discouraged and
  14157. will most likely not be supported in the future.
  14158. * hard registers It is seldom necessary to wrap hard registers
  14159. in 'subreg's; such registers would normally reduce to a single
  14160. 'reg' rtx. This use of 'subreg's is discouraged and may not
  14161. be supported in the future.
  14162. 'subreg's of 'subreg's are not supported. Using
  14163. 'simplify_gen_subreg' is the recommended way to avoid this problem.
  14164. 'subreg's come in two distinct flavors, each having its own usage
  14165. and rules:
  14166. Paradoxical subregs
  14167. When M1 is strictly wider than M2, the 'subreg' expression is
  14168. called "paradoxical". The canonical test for this class of
  14169. 'subreg' is:
  14170. paradoxical_subreg_p (M1, M2)
  14171. Paradoxical 'subreg's can be used as both lvalues and rvalues.
  14172. When used as an lvalue, the low-order bits of the source value
  14173. are stored in REG and the high-order bits are discarded. When
  14174. used as an rvalue, the low-order bits of the 'subreg' are
  14175. taken from REG while the high-order bits may or may not be
  14176. defined.
  14177. The high-order bits of rvalues are defined in the following
  14178. circumstances:
  14179. * 'subreg's of 'mem' When M2 is smaller than a word, the
  14180. macro 'LOAD_EXTEND_OP', can control how the high-order
  14181. bits are defined.
  14182. * 'subreg' of 'reg's The upper bits are defined when
  14183. 'SUBREG_PROMOTED_VAR_P' is true.
  14184. 'SUBREG_PROMOTED_UNSIGNED_P' describes what the upper
  14185. bits hold. Such subregs usually represent local
  14186. variables, register variables and parameter pseudo
  14187. variables that have been promoted to a wider mode.
  14188. BYTENUM is always zero for a paradoxical 'subreg', even on
  14189. big-endian targets.
  14190. For example, the paradoxical 'subreg':
  14191. (set (subreg:SI (reg:HI X) 0) Y)
  14192. stores the lower 2 bytes of Y in X and discards the upper 2
  14193. bytes. A subsequent:
  14194. (set Z (subreg:SI (reg:HI X) 0))
  14195. would set the lower two bytes of Z to Y and set the upper two
  14196. bytes to an unknown value assuming 'SUBREG_PROMOTED_VAR_P' is
  14197. false.
  14198. Normal subregs
  14199. When M1 is at least as narrow as M2 the 'subreg' expression is
  14200. called "normal".
  14201. Normal 'subreg's restrict consideration to certain bits of
  14202. REG. For this purpose, REG is divided into
  14203. individually-addressable blocks in which each block has:
  14204. REGMODE_NATURAL_SIZE (M2)
  14205. bytes. Usually the value is 'UNITS_PER_WORD'; that is, most
  14206. targets usually treat each word of a register as being
  14207. independently addressable.
  14208. There are two types of normal 'subreg'. If M1 is known to be
  14209. no bigger than a block, the 'subreg' refers to the
  14210. least-significant part (or "lowpart") of one block of REG. If
  14211. M1 is known to be larger than a block, the 'subreg' refers to
  14212. two or more complete blocks.
  14213. When used as an lvalue, 'subreg' is a block-based accessor.
  14214. Storing to a 'subreg' modifies all the blocks of REG that
  14215. overlap the 'subreg', but it leaves the other blocks of REG
  14216. alone.
  14217. When storing to a normal 'subreg' that is smaller than a
  14218. block, the other bits of the referenced block are usually left
  14219. in an undefined state. This laxity makes it easier to
  14220. generate efficient code for such instructions. To represent
  14221. an instruction that preserves all the bits outside of those in
  14222. the 'subreg', use 'strict_low_part' or 'zero_extract' around
  14223. the 'subreg'.
  14224. BYTENUM must identify the offset of the first byte of the
  14225. 'subreg' from the start of REG, assuming that REG is laid out
  14226. in memory order. The memory order of bytes is defined by two
  14227. target macros, 'WORDS_BIG_ENDIAN' and 'BYTES_BIG_ENDIAN':
  14228. * 'WORDS_BIG_ENDIAN', if set to 1, says that byte number
  14229. zero is part of the most significant word; otherwise, it
  14230. is part of the least significant word.
  14231. * 'BYTES_BIG_ENDIAN', if set to 1, says that byte number
  14232. zero is the most significant byte within a word;
  14233. otherwise, it is the least significant byte within a
  14234. word.
  14235. On a few targets, 'FLOAT_WORDS_BIG_ENDIAN' disagrees with
  14236. 'WORDS_BIG_ENDIAN'. However, most parts of the compiler treat
  14237. floating point values as if they had the same endianness as
  14238. integer values. This works because they handle them solely as
  14239. a collection of integer values, with no particular numerical
  14240. value. Only real.c and the runtime libraries care about
  14241. 'FLOAT_WORDS_BIG_ENDIAN'.
  14242. Thus,
  14243. (subreg:HI (reg:SI X) 2)
  14244. on a 'BYTES_BIG_ENDIAN', 'UNITS_PER_WORD == 4' target is the
  14245. same as
  14246. (subreg:HI (reg:SI X) 0)
  14247. on a little-endian, 'UNITS_PER_WORD == 4' target. Both
  14248. 'subreg's access the lower two bytes of register X.
  14249. Note that the byte offset is a polynomial integer; it may not
  14250. be a compile-time constant on targets with variable-sized
  14251. modes. However, the restrictions above mean that there are
  14252. only a certain set of acceptable offsets for a given
  14253. combination of M1 and M2. The compiler can always tell which
  14254. blocks a valid subreg occupies, and whether the subreg is a
  14255. lowpart of a block.
  14256. A 'MODE_PARTIAL_INT' mode behaves as if it were as wide as the
  14257. corresponding 'MODE_INT' mode, except that it has an unknown number
  14258. of undefined bits. For example:
  14259. (subreg:PSI (reg:SI 0) 0)
  14260. accesses the whole of '(reg:SI 0)', but the exact relationship
  14261. between the 'PSImode' value and the 'SImode' value is not defined.
  14262. If we assume 'REGMODE_NATURAL_SIZE (DImode) <= 4', then the
  14263. following two 'subreg's:
  14264. (subreg:PSI (reg:DI 0) 0)
  14265. (subreg:PSI (reg:DI 0) 4)
  14266. represent independent 4-byte accesses to the two halves of '(reg:DI
  14267. 0)'. Both 'subreg's have an unknown number of undefined bits.
  14268. If 'REGMODE_NATURAL_SIZE (PSImode) <= 2' then these two 'subreg's:
  14269. (subreg:HI (reg:PSI 0) 0)
  14270. (subreg:HI (reg:PSI 0) 2)
  14271. represent independent 2-byte accesses that together span the whole
  14272. of '(reg:PSI 0)'. Storing to the first 'subreg' does not affect
  14273. the value of the second, and vice versa. '(reg:PSI 0)' has an
  14274. unknown number of undefined bits, so the assignment:
  14275. (set (subreg:HI (reg:PSI 0) 0) (reg:HI 4))
  14276. does not guarantee that '(subreg:HI (reg:PSI 0) 0)' has the value
  14277. '(reg:HI 4)'.
  14278. The rules above apply to both pseudo REGs and hard REGs. If the
  14279. semantics are not correct for particular combinations of M1, M2 and
  14280. hard REG, the target-specific code must ensure that those
  14281. combinations are never used. For example:
  14282. TARGET_CAN_CHANGE_MODE_CLASS (M2, M1, CLASS)
  14283. must be false for every class CLASS that includes REG.
  14284. GCC must be able to determine at compile time whether a subreg is
  14285. paradoxical, whether it occupies a whole number of blocks, or
  14286. whether it is a lowpart of a block. This means that certain
  14287. combinations of variable-sized mode are not permitted. For
  14288. example, if M2 holds N 'SI' values, where N is greater than zero,
  14289. it is not possible to form a 'DI' 'subreg' of it; such a 'subreg'
  14290. would be paradoxical when N is 1 but not when N is greater than 1.
  14291. The first operand of a 'subreg' expression is customarily accessed
  14292. with the 'SUBREG_REG' macro and the second operand is customarily
  14293. accessed with the 'SUBREG_BYTE' macro.
  14294. It has been several years since a platform in which
  14295. 'BYTES_BIG_ENDIAN' not equal to 'WORDS_BIG_ENDIAN' has been tested.
  14296. Anyone wishing to support such a platform in the future may be
  14297. confronted with code rot.
  14298. '(scratch:M)'
  14299. This represents a scratch register that will be required for the
  14300. execution of a single instruction and not used subsequently. It is
  14301. converted into a 'reg' by either the local register allocator or
  14302. the reload pass.
  14303. 'scratch' is usually present inside a 'clobber' operation (*note
  14304. Side Effects::).
  14305. '(cc0)'
  14306. This refers to the machine's condition code register. It has no
  14307. operands and may not have a machine mode. There are two ways to
  14308. use it:
  14309. * To stand for a complete set of condition code flags. This is
  14310. best on most machines, where each comparison sets the entire
  14311. series of flags.
  14312. With this technique, '(cc0)' may be validly used in only two
  14313. contexts: as the destination of an assignment (in test and
  14314. compare instructions) and in comparison operators comparing
  14315. against zero ('const_int' with value zero; that is to say,
  14316. 'const0_rtx').
  14317. * To stand for a single flag that is the result of a single
  14318. condition. This is useful on machines that have only a single
  14319. flag bit, and in which comparison instructions must specify
  14320. the condition to test.
  14321. With this technique, '(cc0)' may be validly used in only two
  14322. contexts: as the destination of an assignment (in test and
  14323. compare instructions) where the source is a comparison
  14324. operator, and as the first operand of 'if_then_else' (in a
  14325. conditional branch).
  14326. There is only one expression object of code 'cc0'; it is the value
  14327. of the variable 'cc0_rtx'. Any attempt to create an expression of
  14328. code 'cc0' will return 'cc0_rtx'.
  14329. Instructions can set the condition code implicitly. On many
  14330. machines, nearly all instructions set the condition code based on
  14331. the value that they compute or store. It is not necessary to
  14332. record these actions explicitly in the RTL because the machine
  14333. description includes a prescription for recognizing the
  14334. instructions that do so (by means of the macro 'NOTICE_UPDATE_CC').
  14335. *Note Condition Code::. Only instructions whose sole purpose is to
  14336. set the condition code, and instructions that use the condition
  14337. code, need mention '(cc0)'.
  14338. On some machines, the condition code register is given a register
  14339. number and a 'reg' is used instead of '(cc0)'. This is usually the
  14340. preferable approach if only a small subset of instructions modify
  14341. the condition code. Other machines store condition codes in
  14342. general registers; in such cases a pseudo register should be used.
  14343. Some machines, such as the SPARC and RS/6000, have two sets of
  14344. arithmetic instructions, one that sets and one that does not set
  14345. the condition code. This is best handled by normally generating
  14346. the instruction that does not set the condition code, and making a
  14347. pattern that both performs the arithmetic and sets the condition
  14348. code register (which would not be '(cc0)' in this case). For
  14349. examples, search for 'addcc' and 'andcc' in 'sparc.md'.
  14350. '(pc)'
  14351. This represents the machine's program counter. It has no operands
  14352. and may not have a machine mode. '(pc)' may be validly used only
  14353. in certain specific contexts in jump instructions.
  14354. There is only one expression object of code 'pc'; it is the value
  14355. of the variable 'pc_rtx'. Any attempt to create an expression of
  14356. code 'pc' will return 'pc_rtx'.
  14357. All instructions that do not jump alter the program counter
  14358. implicitly by incrementing it, but there is no need to mention this
  14359. in the RTL.
  14360. '(mem:M ADDR ALIAS)'
  14361. This RTX represents a reference to main memory at an address
  14362. represented by the expression ADDR. M specifies how large a unit
  14363. of memory is accessed. ALIAS specifies an alias set for the
  14364. reference. In general two items are in different alias sets if
  14365. they cannot reference the same memory address.
  14366. The construct '(mem:BLK (scratch))' is considered to alias all
  14367. other memories. Thus it may be used as a memory barrier in
  14368. epilogue stack deallocation patterns.
  14369. '(concatM RTX RTX)'
  14370. This RTX represents the concatenation of two other RTXs. This is
  14371. used for complex values. It should only appear in the RTL attached
  14372. to declarations and during RTL generation. It should not appear in
  14373. the ordinary insn chain.
  14374. '(concatnM [RTX ...])'
  14375. This RTX represents the concatenation of all the RTX to make a
  14376. single value. Like 'concat', this should only appear in
  14377. declarations, and not in the insn chain.
  14378. 
  14379. File: gccint.info, Node: Arithmetic, Next: Comparisons, Prev: Regs and Memory, Up: RTL
  14380. 14.9 RTL Expressions for Arithmetic
  14381. ===================================
  14382. Unless otherwise specified, all the operands of arithmetic expressions
  14383. must be valid for mode M. An operand is valid for mode M if it has mode
  14384. M, or if it is a 'const_int' or 'const_double' and M is a mode of class
  14385. 'MODE_INT'.
  14386. For commutative binary operations, constants should be placed in the
  14387. second operand.
  14388. '(plus:M X Y)'
  14389. '(ss_plus:M X Y)'
  14390. '(us_plus:M X Y)'
  14391. These three expressions all represent the sum of the values
  14392. represented by X and Y carried out in machine mode M. They differ
  14393. in their behavior on overflow of integer modes. 'plus' wraps round
  14394. modulo the width of M; 'ss_plus' saturates at the maximum signed
  14395. value representable in M; 'us_plus' saturates at the maximum
  14396. unsigned value.
  14397. '(lo_sum:M X Y)'
  14398. This expression represents the sum of X and the low-order bits of
  14399. Y. It is used with 'high' (*note Constants::) to represent the
  14400. typical two-instruction sequence used in RISC machines to reference
  14401. large immediate values and/or link-time constants such as global
  14402. memory addresses. In the latter case, M is 'Pmode' and Y is
  14403. usually a constant expression involving 'symbol_ref'.
  14404. The number of low order bits is machine-dependent but is normally
  14405. the number of bits in mode M minus the number of bits set by
  14406. 'high'.
  14407. '(minus:M X Y)'
  14408. '(ss_minus:M X Y)'
  14409. '(us_minus:M X Y)'
  14410. These three expressions represent the result of subtracting Y from
  14411. X, carried out in mode M. Behavior on overflow is the same as for
  14412. the three variants of 'plus' (see above).
  14413. '(compare:M X Y)'
  14414. Represents the result of subtracting Y from X for purposes of
  14415. comparison. The result is computed without overflow, as if with
  14416. infinite precision.
  14417. Of course, machines cannot really subtract with infinite precision.
  14418. However, they can pretend to do so when only the sign of the result
  14419. will be used, which is the case when the result is stored in the
  14420. condition code. And that is the _only_ way this kind of expression
  14421. may validly be used: as a value to be stored in the condition
  14422. codes, either '(cc0)' or a register. *Note Comparisons::.
  14423. The mode M is not related to the modes of X and Y, but instead is
  14424. the mode of the condition code value. If '(cc0)' is used, it is
  14425. 'VOIDmode'. Otherwise it is some mode in class 'MODE_CC', often
  14426. 'CCmode'. *Note Condition Code::. If M is 'VOIDmode' or 'CCmode',
  14427. the operation returns sufficient information (in an unspecified
  14428. format) so that any comparison operator can be applied to the
  14429. result of the 'COMPARE' operation. For other modes in class
  14430. 'MODE_CC', the operation only returns a subset of this information.
  14431. Normally, X and Y must have the same mode. Otherwise, 'compare' is
  14432. valid only if the mode of X is in class 'MODE_INT' and Y is a
  14433. 'const_int' or 'const_double' with mode 'VOIDmode'. The mode of X
  14434. determines what mode the comparison is to be done in; thus it must
  14435. not be 'VOIDmode'.
  14436. If one of the operands is a constant, it should be placed in the
  14437. second operand and the comparison code adjusted as appropriate.
  14438. A 'compare' specifying two 'VOIDmode' constants is not valid since
  14439. there is no way to know in what mode the comparison is to be
  14440. performed; the comparison must either be folded during the
  14441. compilation or the first operand must be loaded into a register
  14442. while its mode is still known.
  14443. '(neg:M X)'
  14444. '(ss_neg:M X)'
  14445. '(us_neg:M X)'
  14446. These two expressions represent the negation (subtraction from
  14447. zero) of the value represented by X, carried out in mode M. They
  14448. differ in the behavior on overflow of integer modes. In the case
  14449. of 'neg', the negation of the operand may be a number not
  14450. representable in mode M, in which case it is truncated to M.
  14451. 'ss_neg' and 'us_neg' ensure that an out-of-bounds result saturates
  14452. to the maximum or minimum signed or unsigned value.
  14453. '(mult:M X Y)'
  14454. '(ss_mult:M X Y)'
  14455. '(us_mult:M X Y)'
  14456. Represents the signed product of the values represented by X and Y
  14457. carried out in machine mode M. 'ss_mult' and 'us_mult' ensure that
  14458. an out-of-bounds result saturates to the maximum or minimum signed
  14459. or unsigned value.
  14460. Some machines support a multiplication that generates a product
  14461. wider than the operands. Write the pattern for this as
  14462. (mult:M (sign_extend:M X) (sign_extend:M Y))
  14463. where M is wider than the modes of X and Y, which need not be the
  14464. same.
  14465. For unsigned widening multiplication, use the same idiom, but with
  14466. 'zero_extend' instead of 'sign_extend'.
  14467. '(fma:M X Y Z)'
  14468. Represents the 'fma', 'fmaf', and 'fmal' builtin functions, which
  14469. compute 'X * Y + Z' without doing an intermediate rounding step.
  14470. '(div:M X Y)'
  14471. '(ss_div:M X Y)'
  14472. Represents the quotient in signed division of X by Y, carried out
  14473. in machine mode M. If M is a floating point mode, it represents
  14474. the exact quotient; otherwise, the integerized quotient. 'ss_div'
  14475. ensures that an out-of-bounds result saturates to the maximum or
  14476. minimum signed value.
  14477. Some machines have division instructions in which the operands and
  14478. quotient widths are not all the same; you should represent such
  14479. instructions using 'truncate' and 'sign_extend' as in,
  14480. (truncate:M1 (div:M2 X (sign_extend:M2 Y)))
  14481. '(udiv:M X Y)'
  14482. '(us_div:M X Y)'
  14483. Like 'div' but represents unsigned division. 'us_div' ensures that
  14484. an out-of-bounds result saturates to the maximum or minimum
  14485. unsigned value.
  14486. '(mod:M X Y)'
  14487. '(umod:M X Y)'
  14488. Like 'div' and 'udiv' but represent the remainder instead of the
  14489. quotient.
  14490. '(smin:M X Y)'
  14491. '(smax:M X Y)'
  14492. Represents the smaller (for 'smin') or larger (for 'smax') of X and
  14493. Y, interpreted as signed values in mode M. When used with floating
  14494. point, if both operands are zeros, or if either operand is 'NaN',
  14495. then it is unspecified which of the two operands is returned as the
  14496. result.
  14497. '(umin:M X Y)'
  14498. '(umax:M X Y)'
  14499. Like 'smin' and 'smax', but the values are interpreted as unsigned
  14500. integers.
  14501. '(not:M X)'
  14502. Represents the bitwise complement of the value represented by X,
  14503. carried out in mode M, which must be a fixed-point machine mode.
  14504. '(and:M X Y)'
  14505. Represents the bitwise logical-and of the values represented by X
  14506. and Y, carried out in machine mode M, which must be a fixed-point
  14507. machine mode.
  14508. '(ior:M X Y)'
  14509. Represents the bitwise inclusive-or of the values represented by X
  14510. and Y, carried out in machine mode M, which must be a fixed-point
  14511. mode.
  14512. '(xor:M X Y)'
  14513. Represents the bitwise exclusive-or of the values represented by X
  14514. and Y, carried out in machine mode M, which must be a fixed-point
  14515. mode.
  14516. '(ashift:M X C)'
  14517. '(ss_ashift:M X C)'
  14518. '(us_ashift:M X C)'
  14519. These three expressions represent the result of arithmetically
  14520. shifting X left by C places. They differ in their behavior on
  14521. overflow of integer modes. An 'ashift' operation is a plain shift
  14522. with no special behavior in case of a change in the sign bit;
  14523. 'ss_ashift' and 'us_ashift' saturates to the minimum or maximum
  14524. representable value if any of the bits shifted out differs from the
  14525. final sign bit.
  14526. X have mode M, a fixed-point machine mode. C be a fixed-point mode
  14527. or be a constant with mode 'VOIDmode'; which mode is determined by
  14528. the mode called for in the machine description entry for the
  14529. left-shift instruction. For example, on the VAX, the mode of C is
  14530. 'QImode' regardless of M.
  14531. '(lshiftrt:M X C)'
  14532. '(ashiftrt:M X C)'
  14533. Like 'ashift' but for right shift. Unlike the case for left shift,
  14534. these two operations are distinct.
  14535. '(rotate:M X C)'
  14536. '(rotatert:M X C)'
  14537. Similar but represent left and right rotate. If C is a constant,
  14538. use 'rotate'.
  14539. '(abs:M X)'
  14540. '(ss_abs:M X)'
  14541. Represents the absolute value of X, computed in mode M. 'ss_abs'
  14542. ensures that an out-of-bounds result saturates to the maximum
  14543. signed value.
  14544. '(sqrt:M X)'
  14545. Represents the square root of X, computed in mode M. Most often M
  14546. will be a floating point mode.
  14547. '(ffs:M X)'
  14548. Represents one plus the index of the least significant 1-bit in X,
  14549. represented as an integer of mode M. (The value is zero if X is
  14550. zero.) The mode of X must be M or 'VOIDmode'.
  14551. '(clrsb:M X)'
  14552. Represents the number of redundant leading sign bits in X,
  14553. represented as an integer of mode M, starting at the most
  14554. significant bit position. This is one less than the number of
  14555. leading sign bits (either 0 or 1), with no special cases. The mode
  14556. of X must be M or 'VOIDmode'.
  14557. '(clz:M X)'
  14558. Represents the number of leading 0-bits in X, represented as an
  14559. integer of mode M, starting at the most significant bit position.
  14560. If X is zero, the value is determined by
  14561. 'CLZ_DEFINED_VALUE_AT_ZERO' (*note Misc::). Note that this is one
  14562. of the few expressions that is not invariant under widening. The
  14563. mode of X must be M or 'VOIDmode'.
  14564. '(ctz:M X)'
  14565. Represents the number of trailing 0-bits in X, represented as an
  14566. integer of mode M, starting at the least significant bit position.
  14567. If X is zero, the value is determined by
  14568. 'CTZ_DEFINED_VALUE_AT_ZERO' (*note Misc::). Except for this case,
  14569. 'ctz(x)' is equivalent to 'ffs(X) - 1'. The mode of X must be M or
  14570. 'VOIDmode'.
  14571. '(popcount:M X)'
  14572. Represents the number of 1-bits in X, represented as an integer of
  14573. mode M. The mode of X must be M or 'VOIDmode'.
  14574. '(parity:M X)'
  14575. Represents the number of 1-bits modulo 2 in X, represented as an
  14576. integer of mode M. The mode of X must be M or 'VOIDmode'.
  14577. '(bswap:M X)'
  14578. Represents the value X with the order of bytes reversed, carried
  14579. out in mode M, which must be a fixed-point machine mode. The mode
  14580. of X must be M or 'VOIDmode'.
  14581. 
  14582. File: gccint.info, Node: Comparisons, Next: Bit-Fields, Prev: Arithmetic, Up: RTL
  14583. 14.10 Comparison Operations
  14584. ===========================
  14585. Comparison operators test a relation on two operands and are considered
  14586. to represent a machine-dependent nonzero value described by, but not
  14587. necessarily equal to, 'STORE_FLAG_VALUE' (*note Misc::) if the relation
  14588. holds, or zero if it does not, for comparison operators whose results
  14589. have a 'MODE_INT' mode, 'FLOAT_STORE_FLAG_VALUE' (*note Misc::) if the
  14590. relation holds, or zero if it does not, for comparison operators that
  14591. return floating-point values, and a vector of either
  14592. 'VECTOR_STORE_FLAG_VALUE' (*note Misc::) if the relation holds, or of
  14593. zeros if it does not, for comparison operators that return vector
  14594. results. The mode of the comparison operation is independent of the
  14595. mode of the data being compared. If the comparison operation is being
  14596. tested (e.g., the first operand of an 'if_then_else'), the mode must be
  14597. 'VOIDmode'.
  14598. There are two ways that comparison operations may be used. The
  14599. comparison operators may be used to compare the condition codes '(cc0)'
  14600. against zero, as in '(eq (cc0) (const_int 0))'. Such a construct
  14601. actually refers to the result of the preceding instruction in which the
  14602. condition codes were set. The instruction setting the condition code
  14603. must be adjacent to the instruction using the condition code; only
  14604. 'note' insns may separate them.
  14605. Alternatively, a comparison operation may directly compare two data
  14606. objects. The mode of the comparison is determined by the operands; they
  14607. must both be valid for a common machine mode. A comparison with both
  14608. operands constant would be invalid as the machine mode could not be
  14609. deduced from it, but such a comparison should never exist in RTL due to
  14610. constant folding.
  14611. In the example above, if '(cc0)' were last set to '(compare X Y)', the
  14612. comparison operation is identical to '(eq X Y)'. Usually only one style
  14613. of comparisons is supported on a particular machine, but the combine
  14614. pass will try to merge the operations to produce the 'eq' shown in case
  14615. it exists in the context of the particular insn involved.
  14616. Inequality comparisons come in two flavors, signed and unsigned. Thus,
  14617. there are distinct expression codes 'gt' and 'gtu' for signed and
  14618. unsigned greater-than. These can produce different results for the same
  14619. pair of integer values: for example, 1 is signed greater-than -1 but not
  14620. unsigned greater-than, because -1 when regarded as unsigned is actually
  14621. '0xffffffff' which is greater than 1.
  14622. The signed comparisons are also used for floating point values.
  14623. Floating point comparisons are distinguished by the machine modes of the
  14624. operands.
  14625. '(eq:M X Y)'
  14626. 'STORE_FLAG_VALUE' if the values represented by X and Y are equal,
  14627. otherwise 0.
  14628. '(ne:M X Y)'
  14629. 'STORE_FLAG_VALUE' if the values represented by X and Y are not
  14630. equal, otherwise 0.
  14631. '(gt:M X Y)'
  14632. 'STORE_FLAG_VALUE' if the X is greater than Y. If they are
  14633. fixed-point, the comparison is done in a signed sense.
  14634. '(gtu:M X Y)'
  14635. Like 'gt' but does unsigned comparison, on fixed-point numbers
  14636. only.
  14637. '(lt:M X Y)'
  14638. '(ltu:M X Y)'
  14639. Like 'gt' and 'gtu' but test for "less than".
  14640. '(ge:M X Y)'
  14641. '(geu:M X Y)'
  14642. Like 'gt' and 'gtu' but test for "greater than or equal".
  14643. '(le:M X Y)'
  14644. '(leu:M X Y)'
  14645. Like 'gt' and 'gtu' but test for "less than or equal".
  14646. '(if_then_else COND THEN ELSE)'
  14647. This is not a comparison operation but is listed here because it is
  14648. always used in conjunction with a comparison operation. To be
  14649. precise, COND is a comparison expression. This expression
  14650. represents a choice, according to COND, between the value
  14651. represented by THEN and the one represented by ELSE.
  14652. On most machines, 'if_then_else' expressions are valid only to
  14653. express conditional jumps.
  14654. '(cond [TEST1 VALUE1 TEST2 VALUE2 ...] DEFAULT)'
  14655. Similar to 'if_then_else', but more general. Each of TEST1, TEST2,
  14656. ... is performed in turn. The result of this expression is the
  14657. VALUE corresponding to the first nonzero test, or DEFAULT if none
  14658. of the tests are nonzero expressions.
  14659. This is currently not valid for instruction patterns and is
  14660. supported only for insn attributes. *Note Insn Attributes::.
  14661. 
  14662. File: gccint.info, Node: Bit-Fields, Next: Vector Operations, Prev: Comparisons, Up: RTL
  14663. 14.11 Bit-Fields
  14664. ================
  14665. Special expression codes exist to represent bit-field instructions.
  14666. '(sign_extract:M LOC SIZE POS)'
  14667. This represents a reference to a sign-extended bit-field contained
  14668. or starting in LOC (a memory or register reference). The bit-field
  14669. is SIZE bits wide and starts at bit POS. The compilation option
  14670. 'BITS_BIG_ENDIAN' says which end of the memory unit POS counts
  14671. from.
  14672. If LOC is in memory, its mode must be a single-byte integer mode.
  14673. If LOC is in a register, the mode to use is specified by the
  14674. operand of the 'insv' or 'extv' pattern (*note Standard Names::)
  14675. and is usually a full-word integer mode, which is the default if
  14676. none is specified.
  14677. The mode of POS is machine-specific and is also specified in the
  14678. 'insv' or 'extv' pattern.
  14679. The mode M is the same as the mode that would be used for LOC if it
  14680. were a register.
  14681. A 'sign_extract' cannot appear as an lvalue, or part thereof, in
  14682. RTL.
  14683. '(zero_extract:M LOC SIZE POS)'
  14684. Like 'sign_extract' but refers to an unsigned or zero-extended
  14685. bit-field. The same sequence of bits are extracted, but they are
  14686. filled to an entire word with zeros instead of by sign-extension.
  14687. Unlike 'sign_extract', this type of expressions can be lvalues in
  14688. RTL; they may appear on the left side of an assignment, indicating
  14689. insertion of a value into the specified bit-field.
  14690. 
  14691. File: gccint.info, Node: Vector Operations, Next: Conversions, Prev: Bit-Fields, Up: RTL
  14692. 14.12 Vector Operations
  14693. =======================
  14694. All normal RTL expressions can be used with vector modes; they are
  14695. interpreted as operating on each part of the vector independently.
  14696. Additionally, there are a few new expressions to describe specific
  14697. vector operations.
  14698. '(vec_merge:M VEC1 VEC2 ITEMS)'
  14699. This describes a merge operation between two vectors. The result
  14700. is a vector of mode M; its elements are selected from either VEC1
  14701. or VEC2. Which elements are selected is described by ITEMS, which
  14702. is a bit mask represented by a 'const_int'; a zero bit indicates
  14703. the corresponding element in the result vector is taken from VEC2
  14704. while a set bit indicates it is taken from VEC1.
  14705. '(vec_select:M VEC1 SELECTION)'
  14706. This describes an operation that selects parts of a vector. VEC1
  14707. is the source vector, and SELECTION is a 'parallel' that contains a
  14708. 'const_int' (or another expression, if the selection can be made at
  14709. runtime) for each of the subparts of the result vector, giving the
  14710. number of the source subpart that should be stored into it. The
  14711. result mode M is either the submode for a single element of VEC1
  14712. (if only one subpart is selected), or another vector mode with that
  14713. element submode (if multiple subparts are selected).
  14714. '(vec_concat:M X1 X2)'
  14715. Describes a vector concat operation. The result is a concatenation
  14716. of the vectors or scalars X1 and X2; its length is the sum of the
  14717. lengths of the two inputs.
  14718. '(vec_duplicate:M X)'
  14719. This operation converts a scalar into a vector or a small vector
  14720. into a larger one by duplicating the input values. The output
  14721. vector mode must have the same submodes as the input vector mode or
  14722. the scalar modes, and the number of output parts must be an integer
  14723. multiple of the number of input parts.
  14724. '(vec_series:M BASE STEP)'
  14725. This operation creates a vector in which element I is equal to
  14726. 'BASE + I*STEP'. M must be a vector integer mode.
  14727. 
  14728. File: gccint.info, Node: Conversions, Next: RTL Declarations, Prev: Vector Operations, Up: RTL
  14729. 14.13 Conversions
  14730. =================
  14731. All conversions between machine modes must be represented by explicit
  14732. conversion operations. For example, an expression which is the sum of a
  14733. byte and a full word cannot be written as '(plus:SI (reg:QI 34) (reg:SI
  14734. 80))' because the 'plus' operation requires two operands of the same
  14735. machine mode. Therefore, the byte-sized operand is enclosed in a
  14736. conversion operation, as in
  14737. (plus:SI (sign_extend:SI (reg:QI 34)) (reg:SI 80))
  14738. The conversion operation is not a mere placeholder, because there may
  14739. be more than one way of converting from a given starting mode to the
  14740. desired final mode. The conversion operation code says how to do it.
  14741. For all conversion operations, X must not be 'VOIDmode' because the
  14742. mode in which to do the conversion would not be known. The conversion
  14743. must either be done at compile-time or X must be placed into a register.
  14744. '(sign_extend:M X)'
  14745. Represents the result of sign-extending the value X to machine mode
  14746. M. M must be a fixed-point mode and X a fixed-point value of a
  14747. mode narrower than M.
  14748. '(zero_extend:M X)'
  14749. Represents the result of zero-extending the value X to machine mode
  14750. M. M must be a fixed-point mode and X a fixed-point value of a
  14751. mode narrower than M.
  14752. '(float_extend:M X)'
  14753. Represents the result of extending the value X to machine mode M.
  14754. M must be a floating point mode and X a floating point value of a
  14755. mode narrower than M.
  14756. '(truncate:M X)'
  14757. Represents the result of truncating the value X to machine mode M.
  14758. M must be a fixed-point mode and X a fixed-point value of a mode
  14759. wider than M.
  14760. '(ss_truncate:M X)'
  14761. Represents the result of truncating the value X to machine mode M,
  14762. using signed saturation in the case of overflow. Both M and the
  14763. mode of X must be fixed-point modes.
  14764. '(us_truncate:M X)'
  14765. Represents the result of truncating the value X to machine mode M,
  14766. using unsigned saturation in the case of overflow. Both M and the
  14767. mode of X must be fixed-point modes.
  14768. '(float_truncate:M X)'
  14769. Represents the result of truncating the value X to machine mode M.
  14770. M must be a floating point mode and X a floating point value of a
  14771. mode wider than M.
  14772. '(float:M X)'
  14773. Represents the result of converting fixed point value X, regarded
  14774. as signed, to floating point mode M.
  14775. '(unsigned_float:M X)'
  14776. Represents the result of converting fixed point value X, regarded
  14777. as unsigned, to floating point mode M.
  14778. '(fix:M X)'
  14779. When M is a floating-point mode, represents the result of
  14780. converting floating point value X (valid for mode M) to an integer,
  14781. still represented in floating point mode M, by rounding towards
  14782. zero.
  14783. When M is a fixed-point mode, represents the result of converting
  14784. floating point value X to mode M, regarded as signed. How rounding
  14785. is done is not specified, so this operation may be used validly in
  14786. compiling C code only for integer-valued operands.
  14787. '(unsigned_fix:M X)'
  14788. Represents the result of converting floating point value X to fixed
  14789. point mode M, regarded as unsigned. How rounding is done is not
  14790. specified.
  14791. '(fract_convert:M X)'
  14792. Represents the result of converting fixed-point value X to
  14793. fixed-point mode M, signed integer value X to fixed-point mode M,
  14794. floating-point value X to fixed-point mode M, fixed-point value X
  14795. to integer mode M regarded as signed, or fixed-point value X to
  14796. floating-point mode M. When overflows or underflows happen, the
  14797. results are undefined.
  14798. '(sat_fract:M X)'
  14799. Represents the result of converting fixed-point value X to
  14800. fixed-point mode M, signed integer value X to fixed-point mode M,
  14801. or floating-point value X to fixed-point mode M. When overflows or
  14802. underflows happen, the results are saturated to the maximum or the
  14803. minimum.
  14804. '(unsigned_fract_convert:M X)'
  14805. Represents the result of converting fixed-point value X to integer
  14806. mode M regarded as unsigned, or unsigned integer value X to
  14807. fixed-point mode M. When overflows or underflows happen, the
  14808. results are undefined.
  14809. '(unsigned_sat_fract:M X)'
  14810. Represents the result of converting unsigned integer value X to
  14811. fixed-point mode M. When overflows or underflows happen, the
  14812. results are saturated to the maximum or the minimum.
  14813. 
  14814. File: gccint.info, Node: RTL Declarations, Next: Side Effects, Prev: Conversions, Up: RTL
  14815. 14.14 Declarations
  14816. ==================
  14817. Declaration expression codes do not represent arithmetic operations but
  14818. rather state assertions about their operands.
  14819. '(strict_low_part (subreg:M (reg:N R) 0))'
  14820. This expression code is used in only one context: as the
  14821. destination operand of a 'set' expression. In addition, the
  14822. operand of this expression must be a non-paradoxical 'subreg'
  14823. expression.
  14824. The presence of 'strict_low_part' says that the part of the
  14825. register which is meaningful in mode N, but is not part of mode M,
  14826. is not to be altered. Normally, an assignment to such a subreg is
  14827. allowed to have undefined effects on the rest of the register when
  14828. M is smaller than 'REGMODE_NATURAL_SIZE (N)'.
  14829. 
  14830. File: gccint.info, Node: Side Effects, Next: Incdec, Prev: RTL Declarations, Up: RTL
  14831. 14.15 Side Effect Expressions
  14832. =============================
  14833. The expression codes described so far represent values, not actions.
  14834. But machine instructions never produce values; they are meaningful only
  14835. for their side effects on the state of the machine. Special expression
  14836. codes are used to represent side effects.
  14837. The body of an instruction is always one of these side effect codes;
  14838. the codes described above, which represent values, appear only as the
  14839. operands of these.
  14840. '(set LVAL X)'
  14841. Represents the action of storing the value of X into the place
  14842. represented by LVAL. LVAL must be an expression representing a
  14843. place that can be stored in: 'reg' (or 'subreg', 'strict_low_part'
  14844. or 'zero_extract'), 'mem', 'pc', 'parallel', or 'cc0'.
  14845. If LVAL is a 'reg', 'subreg' or 'mem', it has a machine mode; then
  14846. X must be valid for that mode.
  14847. If LVAL is a 'reg' whose machine mode is less than the full width
  14848. of the register, then it means that the part of the register
  14849. specified by the machine mode is given the specified value and the
  14850. rest of the register receives an undefined value. Likewise, if
  14851. LVAL is a 'subreg' whose machine mode is narrower than the mode of
  14852. the register, the rest of the register can be changed in an
  14853. undefined way.
  14854. If LVAL is a 'strict_low_part' of a subreg, then the part of the
  14855. register specified by the machine mode of the 'subreg' is given the
  14856. value X and the rest of the register is not changed.
  14857. If LVAL is a 'zero_extract', then the referenced part of the
  14858. bit-field (a memory or register reference) specified by the
  14859. 'zero_extract' is given the value X and the rest of the bit-field
  14860. is not changed. Note that 'sign_extract' cannot appear in LVAL.
  14861. If LVAL is '(cc0)', it has no machine mode, and X may be either a
  14862. 'compare' expression or a value that may have any mode. The latter
  14863. case represents a "test" instruction. The expression '(set (cc0)
  14864. (reg:M N))' is equivalent to '(set (cc0) (compare (reg:M N)
  14865. (const_int 0)))'. Use the former expression to save space during
  14866. the compilation.
  14867. If LVAL is a 'parallel', it is used to represent the case of a
  14868. function returning a structure in multiple registers. Each element
  14869. of the 'parallel' is an 'expr_list' whose first operand is a 'reg'
  14870. and whose second operand is a 'const_int' representing the offset
  14871. (in bytes) into the structure at which the data in that register
  14872. corresponds. The first element may be null to indicate that the
  14873. structure is also passed partly in memory.
  14874. If LVAL is '(pc)', we have a jump instruction, and the
  14875. possibilities for X are very limited. It may be a 'label_ref'
  14876. expression (unconditional jump). It may be an 'if_then_else'
  14877. (conditional jump), in which case either the second or the third
  14878. operand must be '(pc)' (for the case which does not jump) and the
  14879. other of the two must be a 'label_ref' (for the case which does
  14880. jump). X may also be a 'mem' or '(plus:SI (pc) Y)', where Y may be
  14881. a 'reg' or a 'mem'; these unusual patterns are used to represent
  14882. jumps through branch tables.
  14883. If LVAL is neither '(cc0)' nor '(pc)', the mode of LVAL must not be
  14884. 'VOIDmode' and the mode of X must be valid for the mode of LVAL.
  14885. LVAL is customarily accessed with the 'SET_DEST' macro and X with
  14886. the 'SET_SRC' macro.
  14887. '(return)'
  14888. As the sole expression in a pattern, represents a return from the
  14889. current function, on machines where this can be done with one
  14890. instruction, such as VAXen. On machines where a multi-instruction
  14891. "epilogue" must be executed in order to return from the function,
  14892. returning is done by jumping to a label which precedes the
  14893. epilogue, and the 'return' expression code is never used.
  14894. Inside an 'if_then_else' expression, represents the value to be
  14895. placed in 'pc' to return to the caller.
  14896. Note that an insn pattern of '(return)' is logically equivalent to
  14897. '(set (pc) (return))', but the latter form is never used.
  14898. '(simple_return)'
  14899. Like '(return)', but truly represents only a function return, while
  14900. '(return)' may represent an insn that also performs other functions
  14901. of the function epilogue. Like '(return)', this may also occur in
  14902. conditional jumps.
  14903. '(call FUNCTION NARGS)'
  14904. Represents a function call. FUNCTION is a 'mem' expression whose
  14905. address is the address of the function to be called. NARGS is an
  14906. expression which can be used for two purposes: on some machines it
  14907. represents the number of bytes of stack argument; on others, it
  14908. represents the number of argument registers.
  14909. Each machine has a standard machine mode which FUNCTION must have.
  14910. The machine description defines macro 'FUNCTION_MODE' to expand
  14911. into the requisite mode name. The purpose of this mode is to
  14912. specify what kind of addressing is allowed, on machines where the
  14913. allowed kinds of addressing depend on the machine mode being
  14914. addressed.
  14915. '(clobber X)'
  14916. Represents the storing or possible storing of an unpredictable,
  14917. undescribed value into X, which must be a 'reg', 'scratch',
  14918. 'parallel' or 'mem' expression.
  14919. One place this is used is in string instructions that store
  14920. standard values into particular hard registers. It may not be
  14921. worth the trouble to describe the values that are stored, but it is
  14922. essential to inform the compiler that the registers will be
  14923. altered, lest it attempt to keep data in them across the string
  14924. instruction.
  14925. If X is '(mem:BLK (const_int 0))' or '(mem:BLK (scratch))', it
  14926. means that all memory locations must be presumed clobbered. If X
  14927. is a 'parallel', it has the same meaning as a 'parallel' in a 'set'
  14928. expression.
  14929. Note that the machine description classifies certain hard registers
  14930. as "call-clobbered". All function call instructions are assumed by
  14931. default to clobber these registers, so there is no need to use
  14932. 'clobber' expressions to indicate this fact. Also, each function
  14933. call is assumed to have the potential to alter any memory location,
  14934. unless the function is declared 'const'.
  14935. If the last group of expressions in a 'parallel' are each a
  14936. 'clobber' expression whose arguments are 'reg' or 'match_scratch'
  14937. (*note RTL Template::) expressions, the combiner phase can add the
  14938. appropriate 'clobber' expressions to an insn it has constructed
  14939. when doing so will cause a pattern to be matched.
  14940. This feature can be used, for example, on a machine that whose
  14941. multiply and add instructions don't use an MQ register but which
  14942. has an add-accumulate instruction that does clobber the MQ
  14943. register. Similarly, a combined instruction might require a
  14944. temporary register while the constituent instructions might not.
  14945. When a 'clobber' expression for a register appears inside a
  14946. 'parallel' with other side effects, the register allocator
  14947. guarantees that the register is unoccupied both before and after
  14948. that insn if it is a hard register clobber. For pseudo-register
  14949. clobber, the register allocator and the reload pass do not assign
  14950. the same hard register to the clobber and the input operands if
  14951. there is an insn alternative containing the '&' constraint (*note
  14952. Modifiers::) for the clobber and the hard register is in register
  14953. classes of the clobber in the alternative. You can clobber either
  14954. a specific hard register, a pseudo register, or a 'scratch'
  14955. expression; in the latter two cases, GCC will allocate a hard
  14956. register that is available there for use as a temporary.
  14957. For instructions that require a temporary register, you should use
  14958. 'scratch' instead of a pseudo-register because this will allow the
  14959. combiner phase to add the 'clobber' when required. You do this by
  14960. coding ('clobber' ('match_scratch' ...)). If you do clobber a
  14961. pseudo register, use one which appears nowhere else--generate a new
  14962. one each time. Otherwise, you may confuse CSE.
  14963. There is one other known use for clobbering a pseudo register in a
  14964. 'parallel': when one of the input operands of the insn is also
  14965. clobbered by the insn. In this case, using the same pseudo
  14966. register in the clobber and elsewhere in the insn produces the
  14967. expected results.
  14968. '(use X)'
  14969. Represents the use of the value of X. It indicates that the value
  14970. in X at this point in the program is needed, even though it may not
  14971. be apparent why this is so. Therefore, the compiler will not
  14972. attempt to delete previous instructions whose only effect is to
  14973. store a value in X. X must be a 'reg' expression.
  14974. In some situations, it may be tempting to add a 'use' of a register
  14975. in a 'parallel' to describe a situation where the value of a
  14976. special register will modify the behavior of the instruction. A
  14977. hypothetical example might be a pattern for an addition that can
  14978. either wrap around or use saturating addition depending on the
  14979. value of a special control register:
  14980. (parallel [(set (reg:SI 2) (unspec:SI [(reg:SI 3)
  14981. (reg:SI 4)] 0))
  14982. (use (reg:SI 1))])
  14983. This will not work, several of the optimizers only look at
  14984. expressions locally; it is very likely that if you have multiple
  14985. insns with identical inputs to the 'unspec', they will be optimized
  14986. away even if register 1 changes in between.
  14987. This means that 'use' can _only_ be used to describe that the
  14988. register is live. You should think twice before adding 'use'
  14989. statements, more often you will want to use 'unspec' instead. The
  14990. 'use' RTX is most commonly useful to describe that a fixed register
  14991. is implicitly used in an insn. It is also safe to use in patterns
  14992. where the compiler knows for other reasons that the result of the
  14993. whole pattern is variable, such as 'cpymemM' or 'call' patterns.
  14994. During the reload phase, an insn that has a 'use' as pattern can
  14995. carry a reg_equal note. These 'use' insns will be deleted before
  14996. the reload phase exits.
  14997. During the delayed branch scheduling phase, X may be an insn. This
  14998. indicates that X previously was located at this place in the code
  14999. and its data dependencies need to be taken into account. These
  15000. 'use' insns will be deleted before the delayed branch scheduling
  15001. phase exits.
  15002. '(parallel [X0 X1 ...])'
  15003. Represents several side effects performed in parallel. The square
  15004. brackets stand for a vector; the operand of 'parallel' is a vector
  15005. of expressions. X0, X1 and so on are individual side effect
  15006. expressions--expressions of code 'set', 'call', 'return',
  15007. 'simple_return', 'clobber' or 'use'.
  15008. "In parallel" means that first all the values used in the
  15009. individual side-effects are computed, and second all the actual
  15010. side-effects are performed. For example,
  15011. (parallel [(set (reg:SI 1) (mem:SI (reg:SI 1)))
  15012. (set (mem:SI (reg:SI 1)) (reg:SI 1))])
  15013. says unambiguously that the values of hard register 1 and the
  15014. memory location addressed by it are interchanged. In both places
  15015. where '(reg:SI 1)' appears as a memory address it refers to the
  15016. value in register 1 _before_ the execution of the insn.
  15017. It follows that it is _incorrect_ to use 'parallel' and expect the
  15018. result of one 'set' to be available for the next one. For example,
  15019. people sometimes attempt to represent a jump-if-zero instruction
  15020. this way:
  15021. (parallel [(set (cc0) (reg:SI 34))
  15022. (set (pc) (if_then_else
  15023. (eq (cc0) (const_int 0))
  15024. (label_ref ...)
  15025. (pc)))])
  15026. But this is incorrect, because it says that the jump condition
  15027. depends on the condition code value _before_ this instruction, not
  15028. on the new value that is set by this instruction.
  15029. Peephole optimization, which takes place together with final
  15030. assembly code output, can produce insns whose patterns consist of a
  15031. 'parallel' whose elements are the operands needed to output the
  15032. resulting assembler code--often 'reg', 'mem' or constant
  15033. expressions. This would not be well-formed RTL at any other stage
  15034. in compilation, but it is OK then because no further optimization
  15035. remains to be done. However, the definition of the macro
  15036. 'NOTICE_UPDATE_CC', if any, must deal with such insns if you define
  15037. any peephole optimizations.
  15038. '(cond_exec [COND EXPR])'
  15039. Represents a conditionally executed expression. The EXPR is
  15040. executed only if the COND is nonzero. The COND expression must not
  15041. have side-effects, but the EXPR may very well have side-effects.
  15042. '(sequence [INSNS ...])'
  15043. Represents a sequence of insns. If a 'sequence' appears in the
  15044. chain of insns, then each of the INSNS that appears in the sequence
  15045. must be suitable for appearing in the chain of insns, i.e. must
  15046. satisfy the 'INSN_P' predicate.
  15047. After delay-slot scheduling is completed, an insn and all the insns
  15048. that reside in its delay slots are grouped together into a
  15049. 'sequence'. The insn requiring the delay slot is the first insn in
  15050. the vector; subsequent insns are to be placed in the delay slot.
  15051. 'INSN_ANNULLED_BRANCH_P' is set on an insn in a delay slot to
  15052. indicate that a branch insn should be used that will conditionally
  15053. annul the effect of the insns in the delay slots. In such a case,
  15054. 'INSN_FROM_TARGET_P' indicates that the insn is from the target of
  15055. the branch and should be executed only if the branch is taken;
  15056. otherwise the insn should be executed only if the branch is not
  15057. taken. *Note Delay Slots::.
  15058. Some back ends also use 'sequence' objects for purposes other than
  15059. delay-slot groups. This is not supported in the common parts of
  15060. the compiler, which treat such sequences as delay-slot groups.
  15061. DWARF2 Call Frame Address (CFA) adjustments are sometimes also
  15062. expressed using 'sequence' objects as the value of a
  15063. 'RTX_FRAME_RELATED_P' note. This only happens if the CFA
  15064. adjustments cannot be easily derived from the pattern of the
  15065. instruction to which the note is attached. In such cases, the
  15066. value of the note is used instead of best-guesing the semantics of
  15067. the instruction. The back end can attach notes containing a
  15068. 'sequence' of 'set' patterns that express the effect of the parent
  15069. instruction.
  15070. These expression codes appear in place of a side effect, as the body of
  15071. an insn, though strictly speaking they do not always describe side
  15072. effects as such:
  15073. '(asm_input S)'
  15074. Represents literal assembler code as described by the string S.
  15075. '(unspec [OPERANDS ...] INDEX)'
  15076. '(unspec_volatile [OPERANDS ...] INDEX)'
  15077. Represents a machine-specific operation on OPERANDS. INDEX selects
  15078. between multiple machine-specific operations. 'unspec_volatile' is
  15079. used for volatile operations and operations that may trap; 'unspec'
  15080. is used for other operations.
  15081. These codes may appear inside a 'pattern' of an insn, inside a
  15082. 'parallel', or inside an expression.
  15083. '(addr_vec:M [LR0 LR1 ...])'
  15084. Represents a table of jump addresses. The vector elements LR0,
  15085. etc., are 'label_ref' expressions. The mode M specifies how much
  15086. space is given to each address; normally M would be 'Pmode'.
  15087. '(addr_diff_vec:M BASE [LR0 LR1 ...] MIN MAX FLAGS)'
  15088. Represents a table of jump addresses expressed as offsets from
  15089. BASE. The vector elements LR0, etc., are 'label_ref' expressions
  15090. and so is BASE. The mode M specifies how much space is given to
  15091. each address-difference. MIN and MAX are set up by branch
  15092. shortening and hold a label with a minimum and a maximum address,
  15093. respectively. FLAGS indicates the relative position of BASE, MIN
  15094. and MAX to the containing insn and of MIN and MAX to BASE. See
  15095. rtl.def for details.
  15096. '(prefetch:M ADDR RW LOCALITY)'
  15097. Represents prefetch of memory at address ADDR. Operand RW is 1 if
  15098. the prefetch is for data to be written, 0 otherwise; targets that
  15099. do not support write prefetches should treat this as a normal
  15100. prefetch. Operand LOCALITY specifies the amount of temporal
  15101. locality; 0 if there is none or 1, 2, or 3 for increasing levels of
  15102. temporal locality; targets that do not support locality hints
  15103. should ignore this.
  15104. This insn is used to minimize cache-miss latency by moving data
  15105. into a cache before it is accessed. It should use only
  15106. non-faulting data prefetch instructions.
  15107. 
  15108. File: gccint.info, Node: Incdec, Next: Assembler, Prev: Side Effects, Up: RTL
  15109. 14.16 Embedded Side-Effects on Addresses
  15110. ========================================
  15111. Six special side-effect expression codes appear as memory addresses.
  15112. '(pre_dec:M X)'
  15113. Represents the side effect of decrementing X by a standard amount
  15114. and represents also the value that X has after being decremented.
  15115. X must be a 'reg' or 'mem', but most machines allow only a 'reg'.
  15116. M must be the machine mode for pointers on the machine in use. The
  15117. amount X is decremented by is the length in bytes of the machine
  15118. mode of the containing memory reference of which this expression
  15119. serves as the address. Here is an example of its use:
  15120. (mem:DF (pre_dec:SI (reg:SI 39)))
  15121. This says to decrement pseudo register 39 by the length of a
  15122. 'DFmode' value and use the result to address a 'DFmode' value.
  15123. '(pre_inc:M X)'
  15124. Similar, but specifies incrementing X instead of decrementing it.
  15125. '(post_dec:M X)'
  15126. Represents the same side effect as 'pre_dec' but a different value.
  15127. The value represented here is the value X has before being
  15128. decremented.
  15129. '(post_inc:M X)'
  15130. Similar, but specifies incrementing X instead of decrementing it.
  15131. '(post_modify:M X Y)'
  15132. Represents the side effect of setting X to Y and represents X
  15133. before X is modified. X must be a 'reg' or 'mem', but most
  15134. machines allow only a 'reg'. M must be the machine mode for
  15135. pointers on the machine in use.
  15136. The expression Y must be one of three forms: '(plus:M X Z)',
  15137. '(minus:M X Z)', or '(plus:M X I)', where Z is an index register
  15138. and I is a constant.
  15139. Here is an example of its use:
  15140. (mem:SF (post_modify:SI (reg:SI 42) (plus (reg:SI 42)
  15141. (reg:SI 48))))
  15142. This says to modify pseudo register 42 by adding the contents of
  15143. pseudo register 48 to it, after the use of what ever 42 points to.
  15144. '(pre_modify:M X EXPR)'
  15145. Similar except side effects happen before the use.
  15146. These embedded side effect expressions must be used with care.
  15147. Instruction patterns may not use them. Until the 'flow' pass of the
  15148. compiler, they may occur only to represent pushes onto the stack. The
  15149. 'flow' pass finds cases where registers are incremented or decremented
  15150. in one instruction and used as an address shortly before or after; these
  15151. cases are then transformed to use pre- or post-increment or -decrement.
  15152. If a register used as the operand of these expressions is used in
  15153. another address in an insn, the original value of the register is used.
  15154. Uses of the register outside of an address are not permitted within the
  15155. same insn as a use in an embedded side effect expression because such
  15156. insns behave differently on different machines and hence must be treated
  15157. as ambiguous and disallowed.
  15158. An instruction that can be represented with an embedded side effect
  15159. could also be represented using 'parallel' containing an additional
  15160. 'set' to describe how the address register is altered. This is not done
  15161. because machines that allow these operations at all typically allow them
  15162. wherever a memory address is called for. Describing them as additional
  15163. parallel stores would require doubling the number of entries in the
  15164. machine description.
  15165. 
  15166. File: gccint.info, Node: Assembler, Next: Debug Information, Prev: Incdec, Up: RTL
  15167. 14.17 Assembler Instructions as Expressions
  15168. ===========================================
  15169. The RTX code 'asm_operands' represents a value produced by a
  15170. user-specified assembler instruction. It is used to represent an 'asm'
  15171. statement with arguments. An 'asm' statement with a single output
  15172. operand, like this:
  15173. asm ("foo %1,%2,%0" : "=a" (outputvar) : "g" (x + y), "di" (*z));
  15174. is represented using a single 'asm_operands' RTX which represents the
  15175. value that is stored in 'outputvar':
  15176. (set RTX-FOR-OUTPUTVAR
  15177. (asm_operands "foo %1,%2,%0" "a" 0
  15178. [RTX-FOR-ADDITION-RESULT RTX-FOR-*Z]
  15179. [(asm_input:M1 "g")
  15180. (asm_input:M2 "di")]))
  15181. Here the operands of the 'asm_operands' RTX are the assembler template
  15182. string, the output-operand's constraint, the index-number of the output
  15183. operand among the output operands specified, a vector of input operand
  15184. RTX's, and a vector of input-operand modes and constraints. The mode M1
  15185. is the mode of the sum 'x+y'; M2 is that of '*z'.
  15186. When an 'asm' statement has multiple output values, its insn has
  15187. several such 'set' RTX's inside of a 'parallel'. Each 'set' contains an
  15188. 'asm_operands'; all of these share the same assembler template and
  15189. vectors, but each contains the constraint for the respective output
  15190. operand. They are also distinguished by the output-operand index
  15191. number, which is 0, 1, ... for successive output operands.
  15192. 
  15193. File: gccint.info, Node: Debug Information, Next: Insns, Prev: Assembler, Up: RTL
  15194. 14.18 Variable Location Debug Information in RTL
  15195. ================================================
  15196. Variable tracking relies on 'MEM_EXPR' and 'REG_EXPR' annotations to
  15197. determine what user variables memory and register references refer to.
  15198. Variable tracking at assignments uses these notes only when they refer
  15199. to variables that live at fixed locations (e.g., addressable variables,
  15200. global non-automatic variables). For variables whose location may vary,
  15201. it relies on the following types of notes.
  15202. '(var_location:MODE VAR EXP STAT)'
  15203. Binds variable 'var', a tree, to value EXP, an RTL expression. It
  15204. appears only in 'NOTE_INSN_VAR_LOCATION' and 'DEBUG_INSN's, with
  15205. slightly different meanings. MODE, if present, represents the mode
  15206. of EXP, which is useful if it is a modeless expression. STAT is
  15207. only meaningful in notes, indicating whether the variable is known
  15208. to be initialized or uninitialized.
  15209. '(debug_expr:MODE DECL)'
  15210. Stands for the value bound to the 'DEBUG_EXPR_DECL' DECL, that
  15211. points back to it, within value expressions in 'VAR_LOCATION'
  15212. nodes.
  15213. '(debug_implicit_ptr:MODE DECL)'
  15214. Stands for the location of a DECL that is no longer addressable.
  15215. '(entry_value:MODE DECL)'
  15216. Stands for the value a DECL had at the entry point of the
  15217. containing function.
  15218. '(debug_parameter_ref:MODE DECL)'
  15219. Refers to a parameter that was completely optimized out.
  15220. '(debug_marker:MODE)'
  15221. Marks a program location. With 'VOIDmode', it stands for the
  15222. beginning of a statement, a recommended inspection point logically
  15223. after all prior side effects, and before any subsequent side
  15224. effects. With 'BLKmode', it indicates an inline entry point: the
  15225. lexical block encoded in the 'INSN_LOCATION' is the enclosing block
  15226. that encloses the inlined function.
  15227. 
  15228. File: gccint.info, Node: Insns, Next: Calls, Prev: Debug Information, Up: RTL
  15229. 14.19 Insns
  15230. ===========
  15231. The RTL representation of the code for a function is a doubly-linked
  15232. chain of objects called "insns". Insns are expressions with special
  15233. codes that are used for no other purpose. Some insns are actual
  15234. instructions; others represent dispatch tables for 'switch' statements;
  15235. others represent labels to jump to or various sorts of declarative
  15236. information.
  15237. In addition to its own specific data, each insn must have a unique
  15238. id-number that distinguishes it from all other insns in the current
  15239. function (after delayed branch scheduling, copies of an insn with the
  15240. same id-number may be present in multiple places in a function, but
  15241. these copies will always be identical and will only appear inside a
  15242. 'sequence'), and chain pointers to the preceding and following insns.
  15243. These three fields occupy the same position in every insn, independent
  15244. of the expression code of the insn. They could be accessed with 'XEXP'
  15245. and 'XINT', but instead three special macros are always used:
  15246. 'INSN_UID (I)'
  15247. Accesses the unique id of insn I.
  15248. 'PREV_INSN (I)'
  15249. Accesses the chain pointer to the insn preceding I. If I is the
  15250. first insn, this is a null pointer.
  15251. 'NEXT_INSN (I)'
  15252. Accesses the chain pointer to the insn following I. If I is the
  15253. last insn, this is a null pointer.
  15254. The first insn in the chain is obtained by calling 'get_insns'; the
  15255. last insn is the result of calling 'get_last_insn'. Within the chain
  15256. delimited by these insns, the 'NEXT_INSN' and 'PREV_INSN' pointers must
  15257. always correspond: if INSN is not the first insn,
  15258. NEXT_INSN (PREV_INSN (INSN)) == INSN
  15259. is always true and if INSN is not the last insn,
  15260. PREV_INSN (NEXT_INSN (INSN)) == INSN
  15261. is always true.
  15262. After delay slot scheduling, some of the insns in the chain might be
  15263. 'sequence' expressions, which contain a vector of insns. The value of
  15264. 'NEXT_INSN' in all but the last of these insns is the next insn in the
  15265. vector; the value of 'NEXT_INSN' of the last insn in the vector is the
  15266. same as the value of 'NEXT_INSN' for the 'sequence' in which it is
  15267. contained. Similar rules apply for 'PREV_INSN'.
  15268. This means that the above invariants are not necessarily true for insns
  15269. inside 'sequence' expressions. Specifically, if INSN is the first insn
  15270. in a 'sequence', 'NEXT_INSN (PREV_INSN (INSN))' is the insn containing
  15271. the 'sequence' expression, as is the value of 'PREV_INSN (NEXT_INSN
  15272. (INSN))' if INSN is the last insn in the 'sequence' expression. You can
  15273. use these expressions to find the containing 'sequence' expression.
  15274. Every insn has one of the following expression codes:
  15275. 'insn'
  15276. The expression code 'insn' is used for instructions that do not
  15277. jump and do not do function calls. 'sequence' expressions are
  15278. always contained in insns with code 'insn' even if one of those
  15279. insns should jump or do function calls.
  15280. Insns with code 'insn' have four additional fields beyond the three
  15281. mandatory ones listed above. These four are described in a table
  15282. below.
  15283. 'jump_insn'
  15284. The expression code 'jump_insn' is used for instructions that may
  15285. jump (or, more generally, may contain 'label_ref' expressions to
  15286. which 'pc' can be set in that instruction). If there is an
  15287. instruction to return from the current function, it is recorded as
  15288. a 'jump_insn'.
  15289. 'jump_insn' insns have the same extra fields as 'insn' insns,
  15290. accessed in the same way and in addition contain a field
  15291. 'JUMP_LABEL' which is defined once jump optimization has completed.
  15292. For simple conditional and unconditional jumps, this field contains
  15293. the 'code_label' to which this insn will (possibly conditionally)
  15294. branch. In a more complex jump, 'JUMP_LABEL' records one of the
  15295. labels that the insn refers to; other jump target labels are
  15296. recorded as 'REG_LABEL_TARGET' notes. The exception is 'addr_vec'
  15297. and 'addr_diff_vec', where 'JUMP_LABEL' is 'NULL_RTX' and the only
  15298. way to find the labels is to scan the entire body of the insn.
  15299. Return insns count as jumps, but their 'JUMP_LABEL' is 'RETURN' or
  15300. 'SIMPLE_RETURN'.
  15301. 'call_insn'
  15302. The expression code 'call_insn' is used for instructions that may
  15303. do function calls. It is important to distinguish these
  15304. instructions because they imply that certain registers and memory
  15305. locations may be altered unpredictably.
  15306. 'call_insn' insns have the same extra fields as 'insn' insns,
  15307. accessed in the same way and in addition contain a field
  15308. 'CALL_INSN_FUNCTION_USAGE', which contains a list (chain of
  15309. 'expr_list' expressions) containing 'use', 'clobber' and sometimes
  15310. 'set' expressions that denote hard registers and 'mem's used or
  15311. clobbered by the called function.
  15312. A 'mem' generally points to a stack slot in which arguments passed
  15313. to the libcall by reference (*note TARGET_PASS_BY_REFERENCE:
  15314. Register Arguments.) are stored. If the argument is caller-copied
  15315. (*note TARGET_CALLEE_COPIES: Register Arguments.), the stack slot
  15316. will be mentioned in 'clobber' and 'use' entries; if it's
  15317. callee-copied, only a 'use' will appear, and the 'mem' may point to
  15318. addresses that are not stack slots.
  15319. Registers occurring inside a 'clobber' in this list augment
  15320. registers specified in 'CALL_USED_REGISTERS' (*note Register
  15321. Basics::).
  15322. If the list contains a 'set' involving two registers, it indicates
  15323. that the function returns one of its arguments. Such a 'set' may
  15324. look like a no-op if the same register holds the argument and the
  15325. return value.
  15326. 'code_label'
  15327. A 'code_label' insn represents a label that a jump insn can jump
  15328. to. It contains two special fields of data in addition to the
  15329. three standard ones. 'CODE_LABEL_NUMBER' is used to hold the
  15330. "label number", a number that identifies this label uniquely among
  15331. all the labels in the compilation (not just in the current
  15332. function). Ultimately, the label is represented in the assembler
  15333. output as an assembler label, usually of the form 'LN' where N is
  15334. the label number.
  15335. When a 'code_label' appears in an RTL expression, it normally
  15336. appears within a 'label_ref' which represents the address of the
  15337. label, as a number.
  15338. Besides as a 'code_label', a label can also be represented as a
  15339. 'note' of type 'NOTE_INSN_DELETED_LABEL'.
  15340. The field 'LABEL_NUSES' is only defined once the jump optimization
  15341. phase is completed. It contains the number of times this label is
  15342. referenced in the current function.
  15343. The field 'LABEL_KIND' differentiates four different types of
  15344. labels: 'LABEL_NORMAL', 'LABEL_STATIC_ENTRY', 'LABEL_GLOBAL_ENTRY',
  15345. and 'LABEL_WEAK_ENTRY'. The only labels that do not have type
  15346. 'LABEL_NORMAL' are "alternate entry points" to the current
  15347. function. These may be static (visible only in the containing
  15348. translation unit), global (exposed to all translation units), or
  15349. weak (global, but can be overridden by another symbol with the same
  15350. name).
  15351. Much of the compiler treats all four kinds of label identically.
  15352. Some of it needs to know whether or not a label is an alternate
  15353. entry point; for this purpose, the macro 'LABEL_ALT_ENTRY_P' is
  15354. provided. It is equivalent to testing whether 'LABEL_KIND (label)
  15355. == LABEL_NORMAL'. The only place that cares about the distinction
  15356. between static, global, and weak alternate entry points, besides
  15357. the front-end code that creates them, is the function
  15358. 'output_alternate_entry_point', in 'final.c'.
  15359. To set the kind of a label, use the 'SET_LABEL_KIND' macro.
  15360. 'jump_table_data'
  15361. A 'jump_table_data' insn is a placeholder for the jump-table data
  15362. of a 'casesi' or 'tablejump' insn. They are placed after a
  15363. 'tablejump_p' insn. A 'jump_table_data' insn is not part o a basic
  15364. blockm but it is associated with the basic block that ends with the
  15365. 'tablejump_p' insn. The 'PATTERN' of a 'jump_table_data' is always
  15366. either an 'addr_vec' or an 'addr_diff_vec', and a 'jump_table_data'
  15367. insn is always preceded by a 'code_label'. The 'tablejump_p' insn
  15368. refers to that 'code_label' via its 'JUMP_LABEL'.
  15369. 'barrier'
  15370. Barriers are placed in the instruction stream when control cannot
  15371. flow past them. They are placed after unconditional jump
  15372. instructions to indicate that the jumps are unconditional and after
  15373. calls to 'volatile' functions, which do not return (e.g., 'exit').
  15374. They contain no information beyond the three standard fields.
  15375. 'note'
  15376. 'note' insns are used to represent additional debugging and
  15377. declarative information. They contain two nonstandard fields, an
  15378. integer which is accessed with the macro 'NOTE_LINE_NUMBER' and a
  15379. string accessed with 'NOTE_SOURCE_FILE'.
  15380. If 'NOTE_LINE_NUMBER' is positive, the note represents the position
  15381. of a source line and 'NOTE_SOURCE_FILE' is the source file name
  15382. that the line came from. These notes control generation of line
  15383. number data in the assembler output.
  15384. Otherwise, 'NOTE_LINE_NUMBER' is not really a line number but a
  15385. code with one of the following values (and 'NOTE_SOURCE_FILE' must
  15386. contain a null pointer):
  15387. 'NOTE_INSN_DELETED'
  15388. Such a note is completely ignorable. Some passes of the
  15389. compiler delete insns by altering them into notes of this
  15390. kind.
  15391. 'NOTE_INSN_DELETED_LABEL'
  15392. This marks what used to be a 'code_label', but was not used
  15393. for other purposes than taking its address and was transformed
  15394. to mark that no code jumps to it.
  15395. 'NOTE_INSN_BLOCK_BEG'
  15396. 'NOTE_INSN_BLOCK_END'
  15397. These types of notes indicate the position of the beginning
  15398. and end of a level of scoping of variable names. They control
  15399. the output of debugging information.
  15400. 'NOTE_INSN_EH_REGION_BEG'
  15401. 'NOTE_INSN_EH_REGION_END'
  15402. These types of notes indicate the position of the beginning
  15403. and end of a level of scoping for exception handling.
  15404. 'NOTE_EH_HANDLER' identifies which region is associated with
  15405. these notes.
  15406. 'NOTE_INSN_FUNCTION_BEG'
  15407. Appears at the start of the function body, after the function
  15408. prologue.
  15409. 'NOTE_INSN_VAR_LOCATION'
  15410. This note is used to generate variable location debugging
  15411. information. It indicates that the user variable in its
  15412. 'VAR_LOCATION' operand is at the location given in the RTL
  15413. expression, or holds a value that can be computed by
  15414. evaluating the RTL expression from that static point in the
  15415. program up to the next such note for the same user variable.
  15416. 'NOTE_INSN_BEGIN_STMT'
  15417. This note is used to generate 'is_stmt' markers in line number
  15418. debuggign information. It indicates the beginning of a user
  15419. statement.
  15420. 'NOTE_INSN_INLINE_ENTRY'
  15421. This note is used to generate 'entry_pc' for inlined
  15422. subroutines in debugging information. It indicates an
  15423. inspection point at which all arguments for the inlined
  15424. function have been bound, and before its first statement.
  15425. These codes are printed symbolically when they appear in debugging
  15426. dumps.
  15427. 'debug_insn'
  15428. The expression code 'debug_insn' is used for pseudo-instructions
  15429. that hold debugging information for variable tracking at
  15430. assignments (see '-fvar-tracking-assignments' option). They are
  15431. the RTL representation of 'GIMPLE_DEBUG' statements (*note
  15432. GIMPLE_DEBUG::), with a 'VAR_LOCATION' operand that binds a user
  15433. variable tree to an RTL representation of the 'value' in the
  15434. corresponding statement. A 'DEBUG_EXPR' in it stands for the value
  15435. bound to the corresponding 'DEBUG_EXPR_DECL'.
  15436. 'GIMPLE_DEBUG_BEGIN_STMT' and 'GIMPLE_DEBUG_INLINE_ENTRY' are
  15437. expanded to RTL as a 'DEBUG_INSN' with a 'DEBUG_MARKER' 'PATTERN';
  15438. the difference is the RTL mode: the former's 'DEBUG_MARKER' is
  15439. 'VOIDmode', whereas the latter is 'BLKmode'; information about the
  15440. inlined function can be taken from the lexical block encoded in the
  15441. 'INSN_LOCATION'. These 'DEBUG_INSN's, that do not carry
  15442. 'VAR_LOCATION' information, just 'DEBUG_MARKER's, can be detected
  15443. by testing 'DEBUG_MARKER_INSN_P', whereas those that do can be
  15444. recognized as 'DEBUG_BIND_INSN_P'.
  15445. Throughout optimization passes, 'DEBUG_INSN's are not reordered
  15446. with respect to each other, particularly during scheduling.
  15447. Binding information is kept in pseudo-instruction form, so that,
  15448. unlike notes, it gets the same treatment and adjustments that
  15449. regular instructions would. It is the variable tracking pass that
  15450. turns these pseudo-instructions into 'NOTE_INSN_VAR_LOCATION',
  15451. 'NOTE_INSN_BEGIN_STMT' and 'NOTE_INSN_INLINE_ENTRY' notes,
  15452. analyzing control flow, value equivalences and changes to registers
  15453. and memory referenced in value expressions, propagating the values
  15454. of debug temporaries and determining expressions that can be used
  15455. to compute the value of each user variable at as many points
  15456. (ranges, actually) in the program as possible.
  15457. Unlike 'NOTE_INSN_VAR_LOCATION', the value expression in an
  15458. 'INSN_VAR_LOCATION' denotes a value at that specific point in the
  15459. program, rather than an expression that can be evaluated at any
  15460. later point before an overriding 'VAR_LOCATION' is encountered.
  15461. E.g., if a user variable is bound to a 'REG' and then a subsequent
  15462. insn modifies the 'REG', the note location would keep mapping the
  15463. user variable to the register across the insn, whereas the insn
  15464. location would keep the variable bound to the value, so that the
  15465. variable tracking pass would emit another location note for the
  15466. variable at the point in which the register is modified.
  15467. The machine mode of an insn is normally 'VOIDmode', but some phases use
  15468. the mode for various purposes.
  15469. The common subexpression elimination pass sets the mode of an insn to
  15470. 'QImode' when it is the first insn in a block that has already been
  15471. processed.
  15472. The second Haifa scheduling pass, for targets that can multiple issue,
  15473. sets the mode of an insn to 'TImode' when it is believed that the
  15474. instruction begins an issue group. That is, when the instruction cannot
  15475. issue simultaneously with the previous. This may be relied on by later
  15476. passes, in particular machine-dependent reorg.
  15477. Here is a table of the extra fields of 'insn', 'jump_insn' and
  15478. 'call_insn' insns:
  15479. 'PATTERN (I)'
  15480. An expression for the side effect performed by this insn. This
  15481. must be one of the following codes: 'set', 'call', 'use',
  15482. 'clobber', 'return', 'simple_return', 'asm_input', 'asm_output',
  15483. 'addr_vec', 'addr_diff_vec', 'trap_if', 'unspec',
  15484. 'unspec_volatile', 'parallel', 'cond_exec', or 'sequence'. If it
  15485. is a 'parallel', each element of the 'parallel' must be one these
  15486. codes, except that 'parallel' expressions cannot be nested and
  15487. 'addr_vec' and 'addr_diff_vec' are not permitted inside a
  15488. 'parallel' expression.
  15489. 'INSN_CODE (I)'
  15490. An integer that says which pattern in the machine description
  15491. matches this insn, or -1 if the matching has not yet been
  15492. attempted.
  15493. Such matching is never attempted and this field remains -1 on an
  15494. insn whose pattern consists of a single 'use', 'clobber',
  15495. 'asm_input', 'addr_vec' or 'addr_diff_vec' expression.
  15496. Matching is also never attempted on insns that result from an 'asm'
  15497. statement. These contain at least one 'asm_operands' expression.
  15498. The function 'asm_noperands' returns a non-negative value for such
  15499. insns.
  15500. In the debugging output, this field is printed as a number followed
  15501. by a symbolic representation that locates the pattern in the 'md'
  15502. file as some small positive or negative offset from a named
  15503. pattern.
  15504. 'LOG_LINKS (I)'
  15505. A list (chain of 'insn_list' expressions) giving information about
  15506. dependencies between instructions within a basic block. Neither a
  15507. jump nor a label may come between the related insns. These are
  15508. only used by the schedulers and by combine. This is a deprecated
  15509. data structure. Def-use and use-def chains are now preferred.
  15510. 'REG_NOTES (I)'
  15511. A list (chain of 'expr_list', 'insn_list' and 'int_list'
  15512. expressions) giving miscellaneous information about the insn. It
  15513. is often information pertaining to the registers used in this insn.
  15514. The 'LOG_LINKS' field of an insn is a chain of 'insn_list' expressions.
  15515. Each of these has two operands: the first is an insn, and the second is
  15516. another 'insn_list' expression (the next one in the chain). The last
  15517. 'insn_list' in the chain has a null pointer as second operand. The
  15518. significant thing about the chain is which insns appear in it (as first
  15519. operands of 'insn_list' expressions). Their order is not significant.
  15520. This list is originally set up by the flow analysis pass; it is a null
  15521. pointer until then. Flow only adds links for those data dependencies
  15522. which can be used for instruction combination. For each insn, the flow
  15523. analysis pass adds a link to insns which store into registers values
  15524. that are used for the first time in this insn.
  15525. The 'REG_NOTES' field of an insn is a chain similar to the 'LOG_LINKS'
  15526. field but it includes 'expr_list' and 'int_list' expressions in addition
  15527. to 'insn_list' expressions. There are several kinds of register notes,
  15528. which are distinguished by the machine mode, which in a register note is
  15529. really understood as being an 'enum reg_note'. The first operand OP of
  15530. the note is data whose meaning depends on the kind of note.
  15531. The macro 'REG_NOTE_KIND (X)' returns the kind of register note. Its
  15532. counterpart, the macro 'PUT_REG_NOTE_KIND (X, NEWKIND)' sets the
  15533. register note type of X to be NEWKIND.
  15534. Register notes are of three classes: They may say something about an
  15535. input to an insn, they may say something about an output of an insn, or
  15536. they may create a linkage between two insns. There are also a set of
  15537. values that are only used in 'LOG_LINKS'.
  15538. These register notes annotate inputs to an insn:
  15539. 'REG_DEAD'
  15540. The value in OP dies in this insn; that is to say, altering the
  15541. value immediately after this insn would not affect the future
  15542. behavior of the program.
  15543. It does not follow that the register OP has no useful value after
  15544. this insn since OP is not necessarily modified by this insn.
  15545. Rather, no subsequent instruction uses the contents of OP.
  15546. 'REG_UNUSED'
  15547. The register OP being set by this insn will not be used in a
  15548. subsequent insn. This differs from a 'REG_DEAD' note, which
  15549. indicates that the value in an input will not be used subsequently.
  15550. These two notes are independent; both may be present for the same
  15551. register.
  15552. 'REG_INC'
  15553. The register OP is incremented (or decremented; at this level there
  15554. is no distinction) by an embedded side effect inside this insn.
  15555. This means it appears in a 'post_inc', 'pre_inc', 'post_dec' or
  15556. 'pre_dec' expression.
  15557. 'REG_NONNEG'
  15558. The register OP is known to have a nonnegative value when this insn
  15559. is reached. This is used by special looping instructions that
  15560. terminate when the register goes negative.
  15561. The 'REG_NONNEG' note is added only to 'doloop_end' insns, if its
  15562. pattern uses a 'ge' condition.
  15563. 'REG_LABEL_OPERAND'
  15564. This insn uses OP, a 'code_label' or a 'note' of type
  15565. 'NOTE_INSN_DELETED_LABEL', but is not a 'jump_insn', or it is a
  15566. 'jump_insn' that refers to the operand as an ordinary operand. The
  15567. label may still eventually be a jump target, but if so in an
  15568. indirect jump in a subsequent insn. The presence of this note
  15569. allows jump optimization to be aware that OP is, in fact, being
  15570. used, and flow optimization to build an accurate flow graph.
  15571. 'REG_LABEL_TARGET'
  15572. This insn is a 'jump_insn' but not an 'addr_vec' or
  15573. 'addr_diff_vec'. It uses OP, a 'code_label' as a direct or
  15574. indirect jump target. Its purpose is similar to that of
  15575. 'REG_LABEL_OPERAND'. This note is only present if the insn has
  15576. multiple targets; the last label in the insn (in the highest
  15577. numbered insn-field) goes into the 'JUMP_LABEL' field and does not
  15578. have a 'REG_LABEL_TARGET' note. *Note JUMP_LABEL: Insns.
  15579. 'REG_SETJMP'
  15580. Appears attached to each 'CALL_INSN' to 'setjmp' or a related
  15581. function.
  15582. The following notes describe attributes of outputs of an insn:
  15583. 'REG_EQUIV'
  15584. 'REG_EQUAL'
  15585. This note is only valid on an insn that sets only one register and
  15586. indicates that that register will be equal to OP at run time; the
  15587. scope of this equivalence differs between the two types of notes.
  15588. The value which the insn explicitly copies into the register may
  15589. look different from OP, but they will be equal at run time. If the
  15590. output of the single 'set' is a 'strict_low_part' or 'zero_extract'
  15591. expression, the note refers to the register that is contained in
  15592. its first operand.
  15593. For 'REG_EQUIV', the register is equivalent to OP throughout the
  15594. entire function, and could validly be replaced in all its
  15595. occurrences by OP. ("Validly" here refers to the data flow of the
  15596. program; simple replacement may make some insns invalid.) For
  15597. example, when a constant is loaded into a register that is never
  15598. assigned any other value, this kind of note is used.
  15599. When a parameter is copied into a pseudo-register at entry to a
  15600. function, a note of this kind records that the register is
  15601. equivalent to the stack slot where the parameter was passed.
  15602. Although in this case the register may be set by other insns, it is
  15603. still valid to replace the register by the stack slot throughout
  15604. the function.
  15605. A 'REG_EQUIV' note is also used on an instruction which copies a
  15606. register parameter into a pseudo-register at entry to a function,
  15607. if there is a stack slot where that parameter could be stored.
  15608. Although other insns may set the pseudo-register, it is valid for
  15609. the compiler to replace the pseudo-register by stack slot
  15610. throughout the function, provided the compiler ensures that the
  15611. stack slot is properly initialized by making the replacement in the
  15612. initial copy instruction as well. This is used on machines for
  15613. which the calling convention allocates stack space for register
  15614. parameters. See 'REG_PARM_STACK_SPACE' in *note Stack Arguments::.
  15615. In the case of 'REG_EQUAL', the register that is set by this insn
  15616. will be equal to OP at run time at the end of this insn but not
  15617. necessarily elsewhere in the function. In this case, OP is
  15618. typically an arithmetic expression. For example, when a sequence
  15619. of insns such as a library call is used to perform an arithmetic
  15620. operation, this kind of note is attached to the insn that produces
  15621. or copies the final value.
  15622. These two notes are used in different ways by the compiler passes.
  15623. 'REG_EQUAL' is used by passes prior to register allocation (such as
  15624. common subexpression elimination and loop optimization) to tell
  15625. them how to think of that value. 'REG_EQUIV' notes are used by
  15626. register allocation to indicate that there is an available
  15627. substitute expression (either a constant or a 'mem' expression for
  15628. the location of a parameter on the stack) that may be used in place
  15629. of a register if insufficient registers are available.
  15630. Except for stack homes for parameters, which are indicated by a
  15631. 'REG_EQUIV' note and are not useful to the early optimization
  15632. passes and pseudo registers that are equivalent to a memory
  15633. location throughout their entire life, which is not detected until
  15634. later in the compilation, all equivalences are initially indicated
  15635. by an attached 'REG_EQUAL' note. In the early stages of register
  15636. allocation, a 'REG_EQUAL' note is changed into a 'REG_EQUIV' note
  15637. if OP is a constant and the insn represents the only set of its
  15638. destination register.
  15639. Thus, compiler passes prior to register allocation need only check
  15640. for 'REG_EQUAL' notes and passes subsequent to register allocation
  15641. need only check for 'REG_EQUIV' notes.
  15642. These notes describe linkages between insns. They occur in pairs: one
  15643. insn has one of a pair of notes that points to a second insn, which has
  15644. the inverse note pointing back to the first insn.
  15645. 'REG_CC_SETTER'
  15646. 'REG_CC_USER'
  15647. On machines that use 'cc0', the insns which set and use 'cc0' set
  15648. and use 'cc0' are adjacent. However, when branch delay slot
  15649. filling is done, this may no longer be true. In this case a
  15650. 'REG_CC_USER' note will be placed on the insn setting 'cc0' to
  15651. point to the insn using 'cc0' and a 'REG_CC_SETTER' note will be
  15652. placed on the insn using 'cc0' to point to the insn setting 'cc0'.
  15653. These values are only used in the 'LOG_LINKS' field, and indicate the
  15654. type of dependency that each link represents. Links which indicate a
  15655. data dependence (a read after write dependence) do not use any code,
  15656. they simply have mode 'VOIDmode', and are printed without any
  15657. descriptive text.
  15658. 'REG_DEP_TRUE'
  15659. This indicates a true dependence (a read after write dependence).
  15660. 'REG_DEP_OUTPUT'
  15661. This indicates an output dependence (a write after write
  15662. dependence).
  15663. 'REG_DEP_ANTI'
  15664. This indicates an anti dependence (a write after read dependence).
  15665. These notes describe information gathered from gcov profile data. They
  15666. are stored in the 'REG_NOTES' field of an insn.
  15667. 'REG_BR_PROB'
  15668. This is used to specify the ratio of branches to non-branches of a
  15669. branch insn according to the profile data. The note is represented
  15670. as an 'int_list' expression whose integer value is an encoding of
  15671. 'profile_probability' type. 'profile_probability' provide member
  15672. function 'from_reg_br_prob_note' and 'to_reg_br_prob_note' to
  15673. extract and store the probability into the RTL encoding.
  15674. 'REG_BR_PRED'
  15675. These notes are found in JUMP insns after delayed branch scheduling
  15676. has taken place. They indicate both the direction and the
  15677. likelihood of the JUMP. The format is a bitmask of ATTR_FLAG_*
  15678. values.
  15679. 'REG_FRAME_RELATED_EXPR'
  15680. This is used on an RTX_FRAME_RELATED_P insn wherein the attached
  15681. expression is used in place of the actual insn pattern. This is
  15682. done in cases where the pattern is either complex or misleading.
  15683. The note 'REG_CALL_NOCF_CHECK' is used in conjunction with the
  15684. '-fcf-protection=branch' option. The note is set if a 'nocf_check'
  15685. attribute is specified for a function type or a pointer to function
  15686. type. The note is stored in the 'REG_NOTES' field of an insn.
  15687. 'REG_CALL_NOCF_CHECK'
  15688. Users have control through the 'nocf_check' attribute to identify
  15689. which calls to a function should be skipped from control-flow
  15690. instrumentation when the option '-fcf-protection=branch' is
  15691. specified. The compiler puts a 'REG_CALL_NOCF_CHECK' note on each
  15692. 'CALL_INSN' instruction that has a function type marked with a
  15693. 'nocf_check' attribute.
  15694. For convenience, the machine mode in an 'insn_list' or 'expr_list' is
  15695. printed using these symbolic codes in debugging dumps.
  15696. The only difference between the expression codes 'insn_list' and
  15697. 'expr_list' is that the first operand of an 'insn_list' is assumed to be
  15698. an insn and is printed in debugging dumps as the insn's unique id; the
  15699. first operand of an 'expr_list' is printed in the ordinary way as an
  15700. expression.
  15701. 
  15702. File: gccint.info, Node: Calls, Next: Sharing, Prev: Insns, Up: RTL
  15703. 14.20 RTL Representation of Function-Call Insns
  15704. ===============================================
  15705. Insns that call subroutines have the RTL expression code 'call_insn'.
  15706. These insns must satisfy special rules, and their bodies must use a
  15707. special RTL expression code, 'call'.
  15708. A 'call' expression has two operands, as follows:
  15709. (call (mem:FM ADDR) NBYTES)
  15710. Here NBYTES is an operand that represents the number of bytes of
  15711. argument data being passed to the subroutine, FM is a machine mode
  15712. (which must equal as the definition of the 'FUNCTION_MODE' macro in the
  15713. machine description) and ADDR represents the address of the subroutine.
  15714. For a subroutine that returns no value, the 'call' expression as shown
  15715. above is the entire body of the insn, except that the insn might also
  15716. contain 'use' or 'clobber' expressions.
  15717. For a subroutine that returns a value whose mode is not 'BLKmode', the
  15718. value is returned in a hard register. If this register's number is R,
  15719. then the body of the call insn looks like this:
  15720. (set (reg:M R)
  15721. (call (mem:FM ADDR) NBYTES))
  15722. This RTL expression makes it clear (to the optimizer passes) that the
  15723. appropriate register receives a useful value in this insn.
  15724. When a subroutine returns a 'BLKmode' value, it is handled by passing
  15725. to the subroutine the address of a place to store the value. So the
  15726. call insn itself does not "return" any value, and it has the same RTL
  15727. form as a call that returns nothing.
  15728. On some machines, the call instruction itself clobbers some register,
  15729. for example to contain the return address. 'call_insn' insns on these
  15730. machines should have a body which is a 'parallel' that contains both the
  15731. 'call' expression and 'clobber' expressions that indicate which
  15732. registers are destroyed. Similarly, if the call instruction requires
  15733. some register other than the stack pointer that is not explicitly
  15734. mentioned in its RTL, a 'use' subexpression should mention that
  15735. register.
  15736. Functions that are called are assumed to modify all registers listed in
  15737. the configuration macro 'CALL_USED_REGISTERS' (*note Register Basics::)
  15738. and, with the exception of 'const' functions and library calls, to
  15739. modify all of memory.
  15740. Insns containing just 'use' expressions directly precede the
  15741. 'call_insn' insn to indicate which registers contain inputs to the
  15742. function. Similarly, if registers other than those in
  15743. 'CALL_USED_REGISTERS' are clobbered by the called function, insns
  15744. containing a single 'clobber' follow immediately after the call to
  15745. indicate which registers.
  15746. 
  15747. File: gccint.info, Node: Sharing, Next: Reading RTL, Prev: Calls, Up: RTL
  15748. 14.21 Structure Sharing Assumptions
  15749. ===================================
  15750. The compiler assumes that certain kinds of RTL expressions are unique;
  15751. there do not exist two distinct objects representing the same value. In
  15752. other cases, it makes an opposite assumption: that no RTL expression
  15753. object of a certain kind appears in more than one place in the
  15754. containing structure.
  15755. These assumptions refer to a single function; except for the RTL
  15756. objects that describe global variables and external functions, and a few
  15757. standard objects such as small integer constants, no RTL objects are
  15758. common to two functions.
  15759. * Each pseudo-register has only a single 'reg' object to represent
  15760. it, and therefore only a single machine mode.
  15761. * For any symbolic label, there is only one 'symbol_ref' object
  15762. referring to it.
  15763. * All 'const_int' expressions with equal values are shared.
  15764. * All 'const_poly_int' expressions with equal modes and values are
  15765. shared.
  15766. * There is only one 'pc' expression.
  15767. * There is only one 'cc0' expression.
  15768. * There is only one 'const_double' expression with value 0 for each
  15769. floating point mode. Likewise for values 1 and 2.
  15770. * There is only one 'const_vector' expression with value 0 for each
  15771. vector mode, be it an integer or a double constant vector.
  15772. * No 'label_ref' or 'scratch' appears in more than one place in the
  15773. RTL structure; in other words, it is safe to do a tree-walk of all
  15774. the insns in the function and assume that each time a 'label_ref'
  15775. or 'scratch' is seen it is distinct from all others that are seen.
  15776. * Only one 'mem' object is normally created for each static variable
  15777. or stack slot, so these objects are frequently shared in all the
  15778. places they appear. However, separate but equal objects for these
  15779. variables are occasionally made.
  15780. * When a single 'asm' statement has multiple output operands, a
  15781. distinct 'asm_operands' expression is made for each output operand.
  15782. However, these all share the vector which contains the sequence of
  15783. input operands. This sharing is used later on to test whether two
  15784. 'asm_operands' expressions come from the same statement, so all
  15785. optimizations must carefully preserve the sharing if they copy the
  15786. vector at all.
  15787. * No RTL object appears in more than one place in the RTL structure
  15788. except as described above. Many passes of the compiler rely on
  15789. this by assuming that they can modify RTL objects in place without
  15790. unwanted side-effects on other insns.
  15791. * During initial RTL generation, shared structure is freely
  15792. introduced. After all the RTL for a function has been generated,
  15793. all shared structure is copied by 'unshare_all_rtl' in
  15794. 'emit-rtl.c', after which the above rules are guaranteed to be
  15795. followed.
  15796. * During the combiner pass, shared structure within an insn can exist
  15797. temporarily. However, the shared structure is copied before the
  15798. combiner is finished with the insn. This is done by calling
  15799. 'copy_rtx_if_shared', which is a subroutine of 'unshare_all_rtl'.
  15800. 
  15801. File: gccint.info, Node: Reading RTL, Prev: Sharing, Up: RTL
  15802. 14.22 Reading RTL
  15803. =================
  15804. To read an RTL object from a file, call 'read_rtx'. It takes one
  15805. argument, a stdio stream, and returns a single RTL object. This routine
  15806. is defined in 'read-rtl.c'. It is not available in the compiler itself,
  15807. only the various programs that generate the compiler back end from the
  15808. machine description.
  15809. People frequently have the idea of using RTL stored as text in a file
  15810. as an interface between a language front end and the bulk of GCC. This
  15811. idea is not feasible.
  15812. GCC was designed to use RTL internally only. Correct RTL for a given
  15813. program is very dependent on the particular target machine. And the RTL
  15814. does not contain all the information about the program.
  15815. The proper way to interface GCC to a new language front end is with the
  15816. "tree" data structure, described in the files 'tree.h' and 'tree.def'.
  15817. The documentation for this structure (*note GENERIC::) is incomplete.
  15818. 
  15819. File: gccint.info, Node: Control Flow, Next: Loop Analysis and Representation, Prev: RTL, Up: Top
  15820. 15 Control Flow Graph
  15821. *********************
  15822. A control flow graph (CFG) is a data structure built on top of the
  15823. intermediate code representation (the RTL or 'GIMPLE' instruction
  15824. stream) abstracting the control flow behavior of a function that is
  15825. being compiled. The CFG is a directed graph where the vertices
  15826. represent basic blocks and edges represent possible transfer of control
  15827. flow from one basic block to another. The data structures used to
  15828. represent the control flow graph are defined in 'basic-block.h'.
  15829. In GCC, the representation of control flow is maintained throughout the
  15830. compilation process, from constructing the CFG early in 'pass_build_cfg'
  15831. to 'pass_free_cfg' (see 'passes.def'). The CFG takes various different
  15832. modes and may undergo extensive manipulations, but the graph is always
  15833. valid between its construction and its release. This way, transfer of
  15834. information such as data flow, a measured profile, or the loop tree, can
  15835. be propagated through the passes pipeline, and even from 'GIMPLE' to
  15836. 'RTL'.
  15837. Often the CFG may be better viewed as integral part of instruction
  15838. chain, than structure built on the top of it. Updating the compiler's
  15839. intermediate representation for instructions cannot be easily done
  15840. without proper maintenance of the CFG simultaneously.
  15841. * Menu:
  15842. * Basic Blocks:: The definition and representation of basic blocks.
  15843. * Edges:: Types of edges and their representation.
  15844. * Profile information:: Representation of frequencies and probabilities.
  15845. * Maintaining the CFG:: Keeping the control flow graph and up to date.
  15846. * Liveness information:: Using and maintaining liveness information.
  15847. 
  15848. File: gccint.info, Node: Basic Blocks, Next: Edges, Up: Control Flow
  15849. 15.1 Basic Blocks
  15850. =================
  15851. A basic block is a straight-line sequence of code with only one entry
  15852. point and only one exit. In GCC, basic blocks are represented using the
  15853. 'basic_block' data type.
  15854. Special basic blocks represent possible entry and exit points of a
  15855. function. These blocks are called 'ENTRY_BLOCK_PTR' and
  15856. 'EXIT_BLOCK_PTR'. These blocks do not contain any code.
  15857. The 'BASIC_BLOCK' array contains all basic blocks in an unspecified
  15858. order. Each 'basic_block' structure has a field that holds a unique
  15859. integer identifier 'index' that is the index of the block in the
  15860. 'BASIC_BLOCK' array. The total number of basic blocks in the function
  15861. is 'n_basic_blocks'. Both the basic block indices and the total number
  15862. of basic blocks may vary during the compilation process, as passes
  15863. reorder, create, duplicate, and destroy basic blocks. The index for any
  15864. block should never be greater than 'last_basic_block'. The indices 0
  15865. and 1 are special codes reserved for 'ENTRY_BLOCK' and 'EXIT_BLOCK', the
  15866. indices of 'ENTRY_BLOCK_PTR' and 'EXIT_BLOCK_PTR'.
  15867. Two pointer members of the 'basic_block' structure are the pointers
  15868. 'next_bb' and 'prev_bb'. These are used to keep doubly linked chain of
  15869. basic blocks in the same order as the underlying instruction stream.
  15870. The chain of basic blocks is updated transparently by the provided API
  15871. for manipulating the CFG. The macro 'FOR_EACH_BB' can be used to visit
  15872. all the basic blocks in lexicographical order, except 'ENTRY_BLOCK' and
  15873. 'EXIT_BLOCK'. The macro 'FOR_ALL_BB' also visits all basic blocks in
  15874. lexicographical order, including 'ENTRY_BLOCK' and 'EXIT_BLOCK'.
  15875. The functions 'post_order_compute' and 'inverted_post_order_compute'
  15876. can be used to compute topological orders of the CFG. The orders are
  15877. stored as vectors of basic block indices. The 'BASIC_BLOCK' array can
  15878. be used to iterate each basic block by index. Dominator traversals are
  15879. also possible using 'walk_dominator_tree'. Given two basic blocks A and
  15880. B, block A dominates block B if A is _always_ executed before B.
  15881. Each 'basic_block' also contains pointers to the first instruction (the
  15882. "head") and the last instruction (the "tail") or "end" of the
  15883. instruction stream contained in a basic block. In fact, since the
  15884. 'basic_block' data type is used to represent blocks in both major
  15885. intermediate representations of GCC ('GIMPLE' and RTL), there are
  15886. pointers to the head and end of a basic block for both representations,
  15887. stored in intermediate representation specific data in the 'il' field of
  15888. 'struct basic_block_def'.
  15889. For RTL, these pointers are 'BB_HEAD' and 'BB_END'.
  15890. In the RTL representation of a function, the instruction stream
  15891. contains not only the "real" instructions, but also "notes" or "insn
  15892. notes" (to distinguish them from "reg notes"). Any function that moves
  15893. or duplicates the basic blocks needs to take care of updating of these
  15894. notes. Many of these notes expect that the instruction stream consists
  15895. of linear regions, so updating can sometimes be tedious. All types of
  15896. insn notes are defined in 'insn-notes.def'.
  15897. In the RTL function representation, the instructions contained in a
  15898. basic block always follow a 'NOTE_INSN_BASIC_BLOCK', but zero or more
  15899. 'CODE_LABEL' nodes can precede the block note. A basic block ends with
  15900. a control flow instruction or with the last instruction before the next
  15901. 'CODE_LABEL' or 'NOTE_INSN_BASIC_BLOCK'. By definition, a 'CODE_LABEL'
  15902. cannot appear in the middle of the instruction stream of a basic block.
  15903. In addition to notes, the jump table vectors are also represented as
  15904. "pseudo-instructions" inside the insn stream. These vectors never
  15905. appear in the basic block and should always be placed just after the
  15906. table jump instructions referencing them. After removing the table-jump
  15907. it is often difficult to eliminate the code computing the address and
  15908. referencing the vector, so cleaning up these vectors is postponed until
  15909. after liveness analysis. Thus the jump table vectors may appear in the
  15910. insn stream unreferenced and without any purpose. Before any edge is
  15911. made "fall-thru", the existence of such construct in the way needs to be
  15912. checked by calling 'can_fallthru' function.
  15913. For the 'GIMPLE' representation, the PHI nodes and statements contained
  15914. in a basic block are in a 'gimple_seq' pointed to by the basic block
  15915. intermediate language specific pointers. Abstract containers and
  15916. iterators are used to access the PHI nodes and statements in a basic
  15917. blocks. These iterators are called "GIMPLE statement iterators" (GSIs).
  15918. Grep for '^gsi' in the various 'gimple-*' and 'tree-*' files. There is
  15919. a 'gimple_stmt_iterator' type for iterating over all kinds of statement,
  15920. and a 'gphi_iterator' subclass for iterating over PHI nodes. The
  15921. following snippet will pretty-print all PHI nodes the statements of the
  15922. current function in the GIMPLE representation.
  15923. basic_block bb;
  15924. FOR_EACH_BB (bb)
  15925. {
  15926. gphi_iterator pi;
  15927. gimple_stmt_iterator si;
  15928. for (pi = gsi_start_phis (bb); !gsi_end_p (pi); gsi_next (&pi))
  15929. {
  15930. gphi *phi = pi.phi ();
  15931. print_gimple_stmt (dump_file, phi, 0, TDF_SLIM);
  15932. }
  15933. for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
  15934. {
  15935. gimple stmt = gsi_stmt (si);
  15936. print_gimple_stmt (dump_file, stmt, 0, TDF_SLIM);
  15937. }
  15938. }
  15939. 
  15940. File: gccint.info, Node: Edges, Next: Profile information, Prev: Basic Blocks, Up: Control Flow
  15941. 15.2 Edges
  15942. ==========
  15943. Edges represent possible control flow transfers from the end of some
  15944. basic block A to the head of another basic block B. We say that A is a
  15945. predecessor of B, and B is a successor of A. Edges are represented in
  15946. GCC with the 'edge' data type. Each 'edge' acts as a link between two
  15947. basic blocks: The 'src' member of an edge points to the predecessor
  15948. basic block of the 'dest' basic block. The members 'preds' and 'succs'
  15949. of the 'basic_block' data type point to type-safe vectors of edges to
  15950. the predecessors and successors of the block.
  15951. When walking the edges in an edge vector, "edge iterators" should be
  15952. used. Edge iterators are constructed using the 'edge_iterator' data
  15953. structure and several methods are available to operate on them:
  15954. 'ei_start'
  15955. This function initializes an 'edge_iterator' that points to the
  15956. first edge in a vector of edges.
  15957. 'ei_last'
  15958. This function initializes an 'edge_iterator' that points to the
  15959. last edge in a vector of edges.
  15960. 'ei_end_p'
  15961. This predicate is 'true' if an 'edge_iterator' represents the last
  15962. edge in an edge vector.
  15963. 'ei_one_before_end_p'
  15964. This predicate is 'true' if an 'edge_iterator' represents the
  15965. second last edge in an edge vector.
  15966. 'ei_next'
  15967. This function takes a pointer to an 'edge_iterator' and makes it
  15968. point to the next edge in the sequence.
  15969. 'ei_prev'
  15970. This function takes a pointer to an 'edge_iterator' and makes it
  15971. point to the previous edge in the sequence.
  15972. 'ei_edge'
  15973. This function returns the 'edge' currently pointed to by an
  15974. 'edge_iterator'.
  15975. 'ei_safe_safe'
  15976. This function returns the 'edge' currently pointed to by an
  15977. 'edge_iterator', but returns 'NULL' if the iterator is pointing at
  15978. the end of the sequence. This function has been provided for
  15979. existing code makes the assumption that a 'NULL' edge indicates the
  15980. end of the sequence.
  15981. The convenience macro 'FOR_EACH_EDGE' can be used to visit all of the
  15982. edges in a sequence of predecessor or successor edges. It must not be
  15983. used when an element might be removed during the traversal, otherwise
  15984. elements will be missed. Here is an example of how to use the macro:
  15985. edge e;
  15986. edge_iterator ei;
  15987. FOR_EACH_EDGE (e, ei, bb->succs)
  15988. {
  15989. if (e->flags & EDGE_FALLTHRU)
  15990. break;
  15991. }
  15992. There are various reasons why control flow may transfer from one block
  15993. to another. One possibility is that some instruction, for example a
  15994. 'CODE_LABEL', in a linearized instruction stream just always starts a
  15995. new basic block. In this case a "fall-thru" edge links the basic block
  15996. to the first following basic block. But there are several other reasons
  15997. why edges may be created. The 'flags' field of the 'edge' data type is
  15998. used to store information about the type of edge we are dealing with.
  15999. Each edge is of one of the following types:
  16000. _jump_
  16001. No type flags are set for edges corresponding to jump instructions.
  16002. These edges are used for unconditional or conditional jumps and in
  16003. RTL also for table jumps. They are the easiest to manipulate as
  16004. they may be freely redirected when the flow graph is not in SSA
  16005. form.
  16006. _fall-thru_
  16007. Fall-thru edges are present in case where the basic block may
  16008. continue execution to the following one without branching. These
  16009. edges have the 'EDGE_FALLTHRU' flag set. Unlike other types of
  16010. edges, these edges must come into the basic block immediately
  16011. following in the instruction stream. The function
  16012. 'force_nonfallthru' is available to insert an unconditional jump in
  16013. the case that redirection is needed. Note that this may require
  16014. creation of a new basic block.
  16015. _exception handling_
  16016. Exception handling edges represent possible control transfers from
  16017. a trapping instruction to an exception handler. The definition of
  16018. "trapping" varies. In C++, only function calls can throw, but for
  16019. Ada exceptions like division by zero or segmentation fault are
  16020. defined and thus each instruction possibly throwing this kind of
  16021. exception needs to be handled as control flow instruction.
  16022. Exception edges have the 'EDGE_ABNORMAL' and 'EDGE_EH' flags set.
  16023. When updating the instruction stream it is easy to change possibly
  16024. trapping instruction to non-trapping, by simply removing the
  16025. exception edge. The opposite conversion is difficult, but should
  16026. not happen anyway. The edges can be eliminated via
  16027. 'purge_dead_edges' call.
  16028. In the RTL representation, the destination of an exception edge is
  16029. specified by 'REG_EH_REGION' note attached to the insn. In case of
  16030. a trapping call the 'EDGE_ABNORMAL_CALL' flag is set too. In the
  16031. 'GIMPLE' representation, this extra flag is not set.
  16032. In the RTL representation, the predicate 'may_trap_p' may be used
  16033. to check whether instruction still may trap or not. For the tree
  16034. representation, the 'tree_could_trap_p' predicate is available, but
  16035. this predicate only checks for possible memory traps, as in
  16036. dereferencing an invalid pointer location.
  16037. _sibling calls_
  16038. Sibling calls or tail calls terminate the function in a
  16039. non-standard way and thus an edge to the exit must be present.
  16040. 'EDGE_SIBCALL' and 'EDGE_ABNORMAL' are set in such case. These
  16041. edges only exist in the RTL representation.
  16042. _computed jumps_
  16043. Computed jumps contain edges to all labels in the function
  16044. referenced from the code. All those edges have 'EDGE_ABNORMAL'
  16045. flag set. The edges used to represent computed jumps often cause
  16046. compile time performance problems, since functions consisting of
  16047. many taken labels and many computed jumps may have _very_ dense
  16048. flow graphs, so these edges need to be handled with special care.
  16049. During the earlier stages of the compilation process, GCC tries to
  16050. avoid such dense flow graphs by factoring computed jumps. For
  16051. example, given the following series of jumps,
  16052. goto *x;
  16053. [ ... ]
  16054. goto *x;
  16055. [ ... ]
  16056. goto *x;
  16057. [ ... ]
  16058. factoring the computed jumps results in the following code sequence
  16059. which has a much simpler flow graph:
  16060. goto y;
  16061. [ ... ]
  16062. goto y;
  16063. [ ... ]
  16064. goto y;
  16065. [ ... ]
  16066. y:
  16067. goto *x;
  16068. However, the classic problem with this transformation is that it
  16069. has a runtime cost in there resulting code: An extra jump.
  16070. Therefore, the computed jumps are un-factored in the later passes
  16071. of the compiler (in the pass called
  16072. 'pass_duplicate_computed_gotos'). Be aware of that when you work
  16073. on passes in that area. There have been numerous examples already
  16074. where the compile time for code with unfactored computed jumps
  16075. caused some serious headaches.
  16076. _nonlocal goto handlers_
  16077. GCC allows nested functions to return into caller using a 'goto' to
  16078. a label passed to as an argument to the callee. The labels passed
  16079. to nested functions contain special code to cleanup after function
  16080. call. Such sections of code are referred to as "nonlocal goto
  16081. receivers". If a function contains such nonlocal goto receivers,
  16082. an edge from the call to the label is created with the
  16083. 'EDGE_ABNORMAL' and 'EDGE_ABNORMAL_CALL' flags set.
  16084. _function entry points_
  16085. By definition, execution of function starts at basic block 0, so
  16086. there is always an edge from the 'ENTRY_BLOCK_PTR' to basic block
  16087. 0. There is no 'GIMPLE' representation for alternate entry points
  16088. at this moment. In RTL, alternate entry points are specified by
  16089. 'CODE_LABEL' with 'LABEL_ALTERNATE_NAME' defined. This feature is
  16090. currently used for multiple entry point prologues and is limited to
  16091. post-reload passes only. This can be used by back-ends to emit
  16092. alternate prologues for functions called from different contexts.
  16093. In future full support for multiple entry functions defined by
  16094. Fortran 90 needs to be implemented.
  16095. _function exits_
  16096. In the pre-reload representation a function terminates after the
  16097. last instruction in the insn chain and no explicit return
  16098. instructions are used. This corresponds to the fall-thru edge into
  16099. exit block. After reload, optimal RTL epilogues are used that use
  16100. explicit (conditional) return instructions that are represented by
  16101. edges with no flags set.
  16102. 
  16103. File: gccint.info, Node: Profile information, Next: Maintaining the CFG, Prev: Edges, Up: Control Flow
  16104. 15.3 Profile information
  16105. ========================
  16106. In many cases a compiler must make a choice whether to trade speed in
  16107. one part of code for speed in another, or to trade code size for code
  16108. speed. In such cases it is useful to know information about how often
  16109. some given block will be executed. That is the purpose for maintaining
  16110. profile within the flow graph. GCC can handle profile information
  16111. obtained through "profile feedback", but it can also estimate branch
  16112. probabilities based on statics and heuristics.
  16113. The feedback based profile is produced by compiling the program with
  16114. instrumentation, executing it on a train run and reading the numbers of
  16115. executions of basic blocks and edges back to the compiler while
  16116. re-compiling the program to produce the final executable. This method
  16117. provides very accurate information about where a program spends most of
  16118. its time on the train run. Whether it matches the average run of course
  16119. depends on the choice of train data set, but several studies have shown
  16120. that the behavior of a program usually changes just marginally over
  16121. different data sets.
  16122. When profile feedback is not available, the compiler may be asked to
  16123. attempt to predict the behavior of each branch in the program using a
  16124. set of heuristics (see 'predict.def' for details) and compute estimated
  16125. frequencies of each basic block by propagating the probabilities over
  16126. the graph.
  16127. Each 'basic_block' contains two integer fields to represent profile
  16128. information: 'frequency' and 'count'. The 'frequency' is an estimation
  16129. how often is basic block executed within a function. It is represented
  16130. as an integer scaled in the range from 0 to 'BB_FREQ_BASE'. The most
  16131. frequently executed basic block in function is initially set to
  16132. 'BB_FREQ_BASE' and the rest of frequencies are scaled accordingly.
  16133. During optimization, the frequency of the most frequent basic block can
  16134. both decrease (for instance by loop unrolling) or grow (for instance by
  16135. cross-jumping optimization), so scaling sometimes has to be performed
  16136. multiple times.
  16137. The 'count' contains hard-counted numbers of execution measured during
  16138. training runs and is nonzero only when profile feedback is available.
  16139. This value is represented as the host's widest integer (typically a 64
  16140. bit integer) of the special type 'gcov_type'.
  16141. Most optimization passes can use only the frequency information of a
  16142. basic block, but a few passes may want to know hard execution counts.
  16143. The frequencies should always match the counts after scaling, however
  16144. during updating of the profile information numerical error may
  16145. accumulate into quite large errors.
  16146. Each edge also contains a branch probability field: an integer in the
  16147. range from 0 to 'REG_BR_PROB_BASE'. It represents probability of
  16148. passing control from the end of the 'src' basic block to the 'dest'
  16149. basic block, i.e. the probability that control will flow along this
  16150. edge. The 'EDGE_FREQUENCY' macro is available to compute how frequently
  16151. a given edge is taken. There is a 'count' field for each edge as well,
  16152. representing same information as for a basic block.
  16153. The basic block frequencies are not represented in the instruction
  16154. stream, but in the RTL representation the edge frequencies are
  16155. represented for conditional jumps (via the 'REG_BR_PROB' macro) since
  16156. they are used when instructions are output to the assembly file and the
  16157. flow graph is no longer maintained.
  16158. The probability that control flow arrives via a given edge to its
  16159. destination basic block is called "reverse probability" and is not
  16160. directly represented, but it may be easily computed from frequencies of
  16161. basic blocks.
  16162. Updating profile information is a delicate task that can unfortunately
  16163. not be easily integrated with the CFG manipulation API. Many of the
  16164. functions and hooks to modify the CFG, such as
  16165. 'redirect_edge_and_branch', do not have enough information to easily
  16166. update the profile, so updating it is in the majority of cases left up
  16167. to the caller. It is difficult to uncover bugs in the profile updating
  16168. code, because they manifest themselves only by producing worse code, and
  16169. checking profile consistency is not possible because of numeric error
  16170. accumulation. Hence special attention needs to be given to this issue
  16171. in each pass that modifies the CFG.
  16172. It is important to point out that 'REG_BR_PROB_BASE' and 'BB_FREQ_BASE'
  16173. are both set low enough to be possible to compute second power of any
  16174. frequency or probability in the flow graph, it is not possible to even
  16175. square the 'count' field, as modern CPUs are fast enough to execute
  16176. $2^32$ operations quickly.
  16177. 
  16178. File: gccint.info, Node: Maintaining the CFG, Next: Liveness information, Prev: Profile information, Up: Control Flow
  16179. 15.4 Maintaining the CFG
  16180. ========================
  16181. An important task of each compiler pass is to keep both the control flow
  16182. graph and all profile information up-to-date. Reconstruction of the
  16183. control flow graph after each pass is not an option, since it may be
  16184. very expensive and lost profile information cannot be reconstructed at
  16185. all.
  16186. GCC has two major intermediate representations, and both use the
  16187. 'basic_block' and 'edge' data types to represent control flow. Both
  16188. representations share as much of the CFG maintenance code as possible.
  16189. For each representation, a set of "hooks" is defined so that each
  16190. representation can provide its own implementation of CFG manipulation
  16191. routines when necessary. These hooks are defined in 'cfghooks.h'.
  16192. There are hooks for almost all common CFG manipulations, including block
  16193. splitting and merging, edge redirection and creating and deleting basic
  16194. blocks. These hooks should provide everything you need to maintain and
  16195. manipulate the CFG in both the RTL and 'GIMPLE' representation.
  16196. At the moment, the basic block boundaries are maintained transparently
  16197. when modifying instructions, so there rarely is a need to move them
  16198. manually (such as in case someone wants to output instruction outside
  16199. basic block explicitly).
  16200. In the RTL representation, each instruction has a 'BLOCK_FOR_INSN'
  16201. value that represents pointer to the basic block that contains the
  16202. instruction. In the 'GIMPLE' representation, the function 'gimple_bb'
  16203. returns a pointer to the basic block containing the queried statement.
  16204. When changes need to be applied to a function in its 'GIMPLE'
  16205. representation, "GIMPLE statement iterators" should be used. These
  16206. iterators provide an integrated abstraction of the flow graph and the
  16207. instruction stream. Block statement iterators are constructed using the
  16208. 'gimple_stmt_iterator' data structure and several modifiers are
  16209. available, including the following:
  16210. 'gsi_start'
  16211. This function initializes a 'gimple_stmt_iterator' that points to
  16212. the first non-empty statement in a basic block.
  16213. 'gsi_last'
  16214. This function initializes a 'gimple_stmt_iterator' that points to
  16215. the last statement in a basic block.
  16216. 'gsi_end_p'
  16217. This predicate is 'true' if a 'gimple_stmt_iterator' represents the
  16218. end of a basic block.
  16219. 'gsi_next'
  16220. This function takes a 'gimple_stmt_iterator' and makes it point to
  16221. its successor.
  16222. 'gsi_prev'
  16223. This function takes a 'gimple_stmt_iterator' and makes it point to
  16224. its predecessor.
  16225. 'gsi_insert_after'
  16226. This function inserts a statement after the 'gimple_stmt_iterator'
  16227. passed in. The final parameter determines whether the statement
  16228. iterator is updated to point to the newly inserted statement, or
  16229. left pointing to the original statement.
  16230. 'gsi_insert_before'
  16231. This function inserts a statement before the 'gimple_stmt_iterator'
  16232. passed in. The final parameter determines whether the statement
  16233. iterator is updated to point to the newly inserted statement, or
  16234. left pointing to the original statement.
  16235. 'gsi_remove'
  16236. This function removes the 'gimple_stmt_iterator' passed in and
  16237. rechains the remaining statements in a basic block, if any.
  16238. In the RTL representation, the macros 'BB_HEAD' and 'BB_END' may be
  16239. used to get the head and end 'rtx' of a basic block. No abstract
  16240. iterators are defined for traversing the insn chain, but you can just
  16241. use 'NEXT_INSN' and 'PREV_INSN' instead. *Note Insns::.
  16242. Usually a code manipulating pass simplifies the instruction stream and
  16243. the flow of control, possibly eliminating some edges. This may for
  16244. example happen when a conditional jump is replaced with an unconditional
  16245. jump. Updating of edges is not transparent and each optimization pass
  16246. is required to do so manually. However only few cases occur in
  16247. practice. The pass may call 'purge_dead_edges' on a given basic block
  16248. to remove superfluous edges, if any.
  16249. Another common scenario is redirection of branch instructions, but this
  16250. is best modeled as redirection of edges in the control flow graph and
  16251. thus use of 'redirect_edge_and_branch' is preferred over more low level
  16252. functions, such as 'redirect_jump' that operate on RTL chain only. The
  16253. CFG hooks defined in 'cfghooks.h' should provide the complete API
  16254. required for manipulating and maintaining the CFG.
  16255. It is also possible that a pass has to insert control flow instruction
  16256. into the middle of a basic block, thus creating an entry point in the
  16257. middle of the basic block, which is impossible by definition: The block
  16258. must be split to make sure it only has one entry point, i.e. the head of
  16259. the basic block. The CFG hook 'split_block' may be used when an
  16260. instruction in the middle of a basic block has to become the target of a
  16261. jump or branch instruction.
  16262. For a global optimizer, a common operation is to split edges in the
  16263. flow graph and insert instructions on them. In the RTL representation,
  16264. this can be easily done using the 'insert_insn_on_edge' function that
  16265. emits an instruction "on the edge", caching it for a later
  16266. 'commit_edge_insertions' call that will take care of moving the inserted
  16267. instructions off the edge into the instruction stream contained in a
  16268. basic block. This includes the creation of new basic blocks where
  16269. needed. In the 'GIMPLE' representation, the equivalent functions are
  16270. 'gsi_insert_on_edge' which inserts a block statement iterator on an
  16271. edge, and 'gsi_commit_edge_inserts' which flushes the instruction to
  16272. actual instruction stream.
  16273. While debugging the optimization pass, the 'verify_flow_info' function
  16274. may be useful to find bugs in the control flow graph updating code.
  16275. 
  16276. File: gccint.info, Node: Liveness information, Prev: Maintaining the CFG, Up: Control Flow
  16277. 15.5 Liveness information
  16278. =========================
  16279. Liveness information is useful to determine whether some register is
  16280. "live" at given point of program, i.e. that it contains a value that may
  16281. be used at a later point in the program. This information is used, for
  16282. instance, during register allocation, as the pseudo registers only need
  16283. to be assigned to a unique hard register or to a stack slot if they are
  16284. live. The hard registers and stack slots may be freely reused for other
  16285. values when a register is dead.
  16286. Liveness information is available in the back end starting with
  16287. 'pass_df_initialize' and ending with 'pass_df_finish'. Three flavors of
  16288. live analysis are available: With 'LR', it is possible to determine at
  16289. any point 'P' in the function if the register may be used on some path
  16290. from 'P' to the end of the function. With 'UR', it is possible to
  16291. determine if there is a path from the beginning of the function to 'P'
  16292. that defines the variable. 'LIVE' is the intersection of the 'LR' and
  16293. 'UR' and a variable is live at 'P' if there is both an assignment that
  16294. reaches it from the beginning of the function and a use that can be
  16295. reached on some path from 'P' to the end of the function.
  16296. In general 'LIVE' is the most useful of the three. The macros
  16297. 'DF_[LR,UR,LIVE]_[IN,OUT]' can be used to access this information. The
  16298. macros take a basic block number and return a bitmap that is indexed by
  16299. the register number. This information is only guaranteed to be up to
  16300. date after calls are made to 'df_analyze'. See the file 'df-core.c' for
  16301. details on using the dataflow.
  16302. The liveness information is stored partly in the RTL instruction stream
  16303. and partly in the flow graph. Local information is stored in the
  16304. instruction stream: Each instruction may contain 'REG_DEAD' notes
  16305. representing that the value of a given register is no longer needed, or
  16306. 'REG_UNUSED' notes representing that the value computed by the
  16307. instruction is never used. The second is useful for instructions
  16308. computing multiple values at once.
  16309. 
  16310. File: gccint.info, Node: Loop Analysis and Representation, Next: Machine Desc, Prev: Control Flow, Up: Top
  16311. 16 Analysis and Representation of Loops
  16312. ***************************************
  16313. GCC provides extensive infrastructure for work with natural loops, i.e.,
  16314. strongly connected components of CFG with only one entry block. This
  16315. chapter describes representation of loops in GCC, both on GIMPLE and in
  16316. RTL, as well as the interfaces to loop-related analyses (induction
  16317. variable analysis and number of iterations analysis).
  16318. * Menu:
  16319. * Loop representation:: Representation and analysis of loops.
  16320. * Loop querying:: Getting information about loops.
  16321. * Loop manipulation:: Loop manipulation functions.
  16322. * LCSSA:: Loop-closed SSA form.
  16323. * Scalar evolutions:: Induction variables on GIMPLE.
  16324. * loop-iv:: Induction variables on RTL.
  16325. * Number of iterations:: Number of iterations analysis.
  16326. * Dependency analysis:: Data dependency analysis.
  16327. 
  16328. File: gccint.info, Node: Loop representation, Next: Loop querying, Up: Loop Analysis and Representation
  16329. 16.1 Loop representation
  16330. ========================
  16331. This chapter describes the representation of loops in GCC, and functions
  16332. that can be used to build, modify and analyze this representation. Most
  16333. of the interfaces and data structures are declared in 'cfgloop.h'. Loop
  16334. structures are analyzed and this information disposed or updated at the
  16335. discretion of individual passes. Still most of the generic CFG
  16336. manipulation routines are aware of loop structures and try to keep them
  16337. up-to-date. By this means an increasing part of the compilation
  16338. pipeline is setup to maintain loop structure across passes to allow
  16339. attaching meta information to individual loops for consumption by later
  16340. passes.
  16341. In general, a natural loop has one entry block (header) and possibly
  16342. several back edges (latches) leading to the header from the inside of
  16343. the loop. Loops with several latches may appear if several loops share
  16344. a single header, or if there is a branching in the middle of the loop.
  16345. The representation of loops in GCC however allows only loops with a
  16346. single latch. During loop analysis, headers of such loops are split and
  16347. forwarder blocks are created in order to disambiguate their structures.
  16348. Heuristic based on profile information and structure of the induction
  16349. variables in the loops is used to determine whether the latches
  16350. correspond to sub-loops or to control flow in a single loop. This means
  16351. that the analysis sometimes changes the CFG, and if you run it in the
  16352. middle of an optimization pass, you must be able to deal with the new
  16353. blocks. You may avoid CFG changes by passing
  16354. 'LOOPS_MAY_HAVE_MULTIPLE_LATCHES' flag to the loop discovery, note
  16355. however that most other loop manipulation functions will not work
  16356. correctly for loops with multiple latch edges (the functions that only
  16357. query membership of blocks to loops and subloop relationships, or
  16358. enumerate and test loop exits, can be expected to work).
  16359. Body of the loop is the set of blocks that are dominated by its header,
  16360. and reachable from its latch against the direction of edges in CFG. The
  16361. loops are organized in a containment hierarchy (tree) such that all the
  16362. loops immediately contained inside loop L are the children of L in the
  16363. tree. This tree is represented by the 'struct loops' structure. The
  16364. root of this tree is a fake loop that contains all blocks in the
  16365. function. Each of the loops is represented in a 'struct loop'
  16366. structure. Each loop is assigned an index ('num' field of the 'struct
  16367. loop' structure), and the pointer to the loop is stored in the
  16368. corresponding field of the 'larray' vector in the loops structure. The
  16369. indices do not have to be continuous, there may be empty ('NULL')
  16370. entries in the 'larray' created by deleting loops. Also, there is no
  16371. guarantee on the relative order of a loop and its subloops in the
  16372. numbering. The index of a loop never changes.
  16373. The entries of the 'larray' field should not be accessed directly. The
  16374. function 'get_loop' returns the loop description for a loop with the
  16375. given index. 'number_of_loops' function returns number of loops in the
  16376. function. To traverse all loops, use 'FOR_EACH_LOOP' macro. The
  16377. 'flags' argument of the macro is used to determine the direction of
  16378. traversal and the set of loops visited. Each loop is guaranteed to be
  16379. visited exactly once, regardless of the changes to the loop tree, and
  16380. the loops may be removed during the traversal. The newly created loops
  16381. are never traversed, if they need to be visited, this must be done
  16382. separately after their creation.
  16383. Each basic block contains the reference to the innermost loop it
  16384. belongs to ('loop_father'). For this reason, it is only possible to
  16385. have one 'struct loops' structure initialized at the same time for each
  16386. CFG. The global variable 'current_loops' contains the 'struct loops'
  16387. structure. Many of the loop manipulation functions assume that
  16388. dominance information is up-to-date.
  16389. The loops are analyzed through 'loop_optimizer_init' function. The
  16390. argument of this function is a set of flags represented in an integer
  16391. bitmask. These flags specify what other properties of the loop
  16392. structures should be calculated/enforced and preserved later:
  16393. * 'LOOPS_MAY_HAVE_MULTIPLE_LATCHES': If this flag is set, no changes
  16394. to CFG will be performed in the loop analysis, in particular, loops
  16395. with multiple latch edges will not be disambiguated. If a loop has
  16396. multiple latches, its latch block is set to NULL. Most of the loop
  16397. manipulation functions will not work for loops in this shape. No
  16398. other flags that require CFG changes can be passed to
  16399. loop_optimizer_init.
  16400. * 'LOOPS_HAVE_PREHEADERS': Forwarder blocks are created in such a way
  16401. that each loop has only one entry edge, and additionally, the
  16402. source block of this entry edge has only one successor. This
  16403. creates a natural place where the code can be moved out of the
  16404. loop, and ensures that the entry edge of the loop leads from its
  16405. immediate super-loop.
  16406. * 'LOOPS_HAVE_SIMPLE_LATCHES': Forwarder blocks are created to force
  16407. the latch block of each loop to have only one successor. This
  16408. ensures that the latch of the loop does not belong to any of its
  16409. sub-loops, and makes manipulation with the loops significantly
  16410. easier. Most of the loop manipulation functions assume that the
  16411. loops are in this shape. Note that with this flag, the "normal"
  16412. loop without any control flow inside and with one exit consists of
  16413. two basic blocks.
  16414. * 'LOOPS_HAVE_MARKED_IRREDUCIBLE_REGIONS': Basic blocks and edges in
  16415. the strongly connected components that are not natural loops (have
  16416. more than one entry block) are marked with 'BB_IRREDUCIBLE_LOOP'
  16417. and 'EDGE_IRREDUCIBLE_LOOP' flags. The flag is not set for blocks
  16418. and edges that belong to natural loops that are in such an
  16419. irreducible region (but it is set for the entry and exit edges of
  16420. such a loop, if they lead to/from this region).
  16421. * 'LOOPS_HAVE_RECORDED_EXITS': The lists of exits are recorded and
  16422. updated for each loop. This makes some functions (e.g.,
  16423. 'get_loop_exit_edges') more efficient. Some functions (e.g.,
  16424. 'single_exit') can be used only if the lists of exits are recorded.
  16425. These properties may also be computed/enforced later, using functions
  16426. 'create_preheaders', 'force_single_succ_latches',
  16427. 'mark_irreducible_loops' and 'record_loop_exits'. The properties can be
  16428. queried using 'loops_state_satisfies_p'.
  16429. The memory occupied by the loops structures should be freed with
  16430. 'loop_optimizer_finalize' function. When loop structures are setup to
  16431. be preserved across passes this function reduces the information to be
  16432. kept up-to-date to a minimum (only 'LOOPS_MAY_HAVE_MULTIPLE_LATCHES'
  16433. set).
  16434. The CFG manipulation functions in general do not update loop
  16435. structures. Specialized versions that additionally do so are provided
  16436. for the most common tasks. On GIMPLE, 'cleanup_tree_cfg_loop' function
  16437. can be used to cleanup CFG while updating the loops structures if
  16438. 'current_loops' is set.
  16439. At the moment loop structure is preserved from the start of GIMPLE loop
  16440. optimizations until the end of RTL loop optimizations. During this time
  16441. a loop can be tracked by its 'struct loop' and number.
  16442. 
  16443. File: gccint.info, Node: Loop querying, Next: Loop manipulation, Prev: Loop representation, Up: Loop Analysis and Representation
  16444. 16.2 Loop querying
  16445. ==================
  16446. The functions to query the information about loops are declared in
  16447. 'cfgloop.h'. Some of the information can be taken directly from the
  16448. structures. 'loop_father' field of each basic block contains the
  16449. innermost loop to that the block belongs. The most useful fields of
  16450. loop structure (that are kept up-to-date at all times) are:
  16451. * 'header', 'latch': Header and latch basic blocks of the loop.
  16452. * 'num_nodes': Number of basic blocks in the loop (including the
  16453. basic blocks of the sub-loops).
  16454. * 'outer', 'inner', 'next': The super-loop, the first sub-loop, and
  16455. the sibling of the loop in the loops tree.
  16456. There are other fields in the loop structures, many of them used only
  16457. by some of the passes, or not updated during CFG changes; in general,
  16458. they should not be accessed directly.
  16459. The most important functions to query loop structures are:
  16460. * 'loop_depth': The depth of the loop in the loops tree, i.e., the
  16461. number of super-loops of the loop.
  16462. * 'flow_loops_dump': Dumps the information about loops to a file.
  16463. * 'verify_loop_structure': Checks consistency of the loop structures.
  16464. * 'loop_latch_edge': Returns the latch edge of a loop.
  16465. * 'loop_preheader_edge': If loops have preheaders, returns the
  16466. preheader edge of a loop.
  16467. * 'flow_loop_nested_p': Tests whether loop is a sub-loop of another
  16468. loop.
  16469. * 'flow_bb_inside_loop_p': Tests whether a basic block belongs to a
  16470. loop (including its sub-loops).
  16471. * 'find_common_loop': Finds the common super-loop of two loops.
  16472. * 'superloop_at_depth': Returns the super-loop of a loop with the
  16473. given depth.
  16474. * 'tree_num_loop_insns', 'num_loop_insns': Estimates the number of
  16475. insns in the loop, on GIMPLE and on RTL.
  16476. * 'loop_exit_edge_p': Tests whether edge is an exit from a loop.
  16477. * 'mark_loop_exit_edges': Marks all exit edges of all loops with
  16478. 'EDGE_LOOP_EXIT' flag.
  16479. * 'get_loop_body', 'get_loop_body_in_dom_order',
  16480. 'get_loop_body_in_bfs_order': Enumerates the basic blocks in the
  16481. loop in depth-first search order in reversed CFG, ordered by
  16482. dominance relation, and breath-first search order, respectively.
  16483. * 'single_exit': Returns the single exit edge of the loop, or 'NULL'
  16484. if the loop has more than one exit. You can only use this function
  16485. if LOOPS_HAVE_MARKED_SINGLE_EXITS property is used.
  16486. * 'get_loop_exit_edges': Enumerates the exit edges of a loop.
  16487. * 'just_once_each_iteration_p': Returns true if the basic block is
  16488. executed exactly once during each iteration of a loop (that is, it
  16489. does not belong to a sub-loop, and it dominates the latch of the
  16490. loop).
  16491. 
  16492. File: gccint.info, Node: Loop manipulation, Next: LCSSA, Prev: Loop querying, Up: Loop Analysis and Representation
  16493. 16.3 Loop manipulation
  16494. ======================
  16495. The loops tree can be manipulated using the following functions:
  16496. * 'flow_loop_tree_node_add': Adds a node to the tree.
  16497. * 'flow_loop_tree_node_remove': Removes a node from the tree.
  16498. * 'add_bb_to_loop': Adds a basic block to a loop.
  16499. * 'remove_bb_from_loops': Removes a basic block from loops.
  16500. Most low-level CFG functions update loops automatically. The following
  16501. functions handle some more complicated cases of CFG manipulations:
  16502. * 'remove_path': Removes an edge and all blocks it dominates.
  16503. * 'split_loop_exit_edge': Splits exit edge of the loop, ensuring that
  16504. PHI node arguments remain in the loop (this ensures that
  16505. loop-closed SSA form is preserved). Only useful on GIMPLE.
  16506. Finally, there are some higher-level loop transformations implemented.
  16507. While some of them are written so that they should work on non-innermost
  16508. loops, they are mostly untested in that case, and at the moment, they
  16509. are only reliable for the innermost loops:
  16510. * 'create_iv': Creates a new induction variable. Only works on
  16511. GIMPLE. 'standard_iv_increment_position' can be used to find a
  16512. suitable place for the iv increment.
  16513. * 'duplicate_loop_to_header_edge',
  16514. 'tree_duplicate_loop_to_header_edge': These functions (on RTL and
  16515. on GIMPLE) duplicate the body of the loop prescribed number of
  16516. times on one of the edges entering loop header, thus performing
  16517. either loop unrolling or loop peeling. 'can_duplicate_loop_p'
  16518. ('can_unroll_loop_p' on GIMPLE) must be true for the duplicated
  16519. loop.
  16520. * 'loop_version': This function creates a copy of a loop, and a
  16521. branch before them that selects one of them depending on the
  16522. prescribed condition. This is useful for optimizations that need
  16523. to verify some assumptions in runtime (one of the copies of the
  16524. loop is usually left unchanged, while the other one is transformed
  16525. in some way).
  16526. * 'tree_unroll_loop': Unrolls the loop, including peeling the extra
  16527. iterations to make the number of iterations divisible by unroll
  16528. factor, updating the exit condition, and removing the exits that
  16529. now cannot be taken. Works only on GIMPLE.
  16530. 
  16531. File: gccint.info, Node: LCSSA, Next: Scalar evolutions, Prev: Loop manipulation, Up: Loop Analysis and Representation
  16532. 16.4 Loop-closed SSA form
  16533. =========================
  16534. Throughout the loop optimizations on tree level, one extra condition is
  16535. enforced on the SSA form: No SSA name is used outside of the loop in
  16536. that it is defined. The SSA form satisfying this condition is called
  16537. "loop-closed SSA form" - LCSSA. To enforce LCSSA, PHI nodes must be
  16538. created at the exits of the loops for the SSA names that are used
  16539. outside of them. Only the real operands (not virtual SSA names) are
  16540. held in LCSSA, in order to save memory.
  16541. There are various benefits of LCSSA:
  16542. * Many optimizations (value range analysis, final value replacement)
  16543. are interested in the values that are defined in the loop and used
  16544. outside of it, i.e., exactly those for that we create new PHI
  16545. nodes.
  16546. * In induction variable analysis, it is not necessary to specify the
  16547. loop in that the analysis should be performed - the scalar
  16548. evolution analysis always returns the results with respect to the
  16549. loop in that the SSA name is defined.
  16550. * It makes updating of SSA form during loop transformations simpler.
  16551. Without LCSSA, operations like loop unrolling may force creation of
  16552. PHI nodes arbitrarily far from the loop, while in LCSSA, the SSA
  16553. form can be updated locally. However, since we only keep real
  16554. operands in LCSSA, we cannot use this advantage (we could have
  16555. local updating of real operands, but it is not much more efficient
  16556. than to use generic SSA form updating for it as well; the amount of
  16557. changes to SSA is the same).
  16558. However, it also means LCSSA must be updated. This is usually
  16559. straightforward, unless you create a new value in loop and use it
  16560. outside, or unless you manipulate loop exit edges (functions are
  16561. provided to make these manipulations simple).
  16562. 'rewrite_into_loop_closed_ssa' is used to rewrite SSA form to LCSSA, and
  16563. 'verify_loop_closed_ssa' to check that the invariant of LCSSA is
  16564. preserved.
  16565. 
  16566. File: gccint.info, Node: Scalar evolutions, Next: loop-iv, Prev: LCSSA, Up: Loop Analysis and Representation
  16567. 16.5 Scalar evolutions
  16568. ======================
  16569. Scalar evolutions (SCEV) are used to represent results of induction
  16570. variable analysis on GIMPLE. They enable us to represent variables with
  16571. complicated behavior in a simple and consistent way (we only use it to
  16572. express values of polynomial induction variables, but it is possible to
  16573. extend it). The interfaces to SCEV analysis are declared in
  16574. 'tree-scalar-evolution.h'. To use scalar evolutions analysis,
  16575. 'scev_initialize' must be used. To stop using SCEV, 'scev_finalize'
  16576. should be used. SCEV analysis caches results in order to save time and
  16577. memory. This cache however is made invalid by most of the loop
  16578. transformations, including removal of code. If such a transformation is
  16579. performed, 'scev_reset' must be called to clean the caches.
  16580. Given an SSA name, its behavior in loops can be analyzed using the
  16581. 'analyze_scalar_evolution' function. The returned SCEV however does not
  16582. have to be fully analyzed and it may contain references to other SSA
  16583. names defined in the loop. To resolve these (potentially recursive)
  16584. references, 'instantiate_parameters' or 'resolve_mixers' functions must
  16585. be used. 'instantiate_parameters' is useful when you use the results of
  16586. SCEV only for some analysis, and when you work with whole nest of loops
  16587. at once. It will try replacing all SSA names by their SCEV in all
  16588. loops, including the super-loops of the current loop, thus providing a
  16589. complete information about the behavior of the variable in the loop
  16590. nest. 'resolve_mixers' is useful if you work with only one loop at a
  16591. time, and if you possibly need to create code based on the value of the
  16592. induction variable. It will only resolve the SSA names defined in the
  16593. current loop, leaving the SSA names defined outside unchanged, even if
  16594. their evolution in the outer loops is known.
  16595. The SCEV is a normal tree expression, except for the fact that it may
  16596. contain several special tree nodes. One of them is 'SCEV_NOT_KNOWN',
  16597. used for SSA names whose value cannot be expressed. The other one is
  16598. 'POLYNOMIAL_CHREC'. Polynomial chrec has three arguments - base, step
  16599. and loop (both base and step may contain further polynomial chrecs).
  16600. Type of the expression and of base and step must be the same. A
  16601. variable has evolution 'POLYNOMIAL_CHREC(base, step, loop)' if it is (in
  16602. the specified loop) equivalent to 'x_1' in the following example
  16603. while (...)
  16604. {
  16605. x_1 = phi (base, x_2);
  16606. x_2 = x_1 + step;
  16607. }
  16608. Note that this includes the language restrictions on the operations.
  16609. For example, if we compile C code and 'x' has signed type, then the
  16610. overflow in addition would cause undefined behavior, and we may assume
  16611. that this does not happen. Hence, the value with this SCEV cannot
  16612. overflow (which restricts the number of iterations of such a loop).
  16613. In many cases, one wants to restrict the attention just to affine
  16614. induction variables. In this case, the extra expressive power of SCEV
  16615. is not useful, and may complicate the optimizations. In this case,
  16616. 'simple_iv' function may be used to analyze a value - the result is a
  16617. loop-invariant base and step.
  16618. 
  16619. File: gccint.info, Node: loop-iv, Next: Number of iterations, Prev: Scalar evolutions, Up: Loop Analysis and Representation
  16620. 16.6 IV analysis on RTL
  16621. =======================
  16622. The induction variable on RTL is simple and only allows analysis of
  16623. affine induction variables, and only in one loop at once. The interface
  16624. is declared in 'cfgloop.h'. Before analyzing induction variables in a
  16625. loop L, 'iv_analysis_loop_init' function must be called on L. After the
  16626. analysis (possibly calling 'iv_analysis_loop_init' for several loops) is
  16627. finished, 'iv_analysis_done' should be called. The following functions
  16628. can be used to access the results of the analysis:
  16629. * 'iv_analyze': Analyzes a single register used in the given insn.
  16630. If no use of the register in this insn is found, the following
  16631. insns are scanned, so that this function can be called on the insn
  16632. returned by get_condition.
  16633. * 'iv_analyze_result': Analyzes result of the assignment in the given
  16634. insn.
  16635. * 'iv_analyze_expr': Analyzes a more complicated expression. All its
  16636. operands are analyzed by 'iv_analyze', and hence they must be used
  16637. in the specified insn or one of the following insns.
  16638. The description of the induction variable is provided in 'struct
  16639. rtx_iv'. In order to handle subregs, the representation is a bit
  16640. complicated; if the value of the 'extend' field is not 'UNKNOWN', the
  16641. value of the induction variable in the i-th iteration is
  16642. delta + mult * extend_{extend_mode} (subreg_{mode} (base + i * step)),
  16643. with the following exception: if 'first_special' is true, then the
  16644. value in the first iteration (when 'i' is zero) is 'delta + mult *
  16645. base'. However, if 'extend' is equal to 'UNKNOWN', then 'first_special'
  16646. must be false, 'delta' 0, 'mult' 1 and the value in the i-th iteration
  16647. is
  16648. subreg_{mode} (base + i * step)
  16649. The function 'get_iv_value' can be used to perform these calculations.
  16650. 
  16651. File: gccint.info, Node: Number of iterations, Next: Dependency analysis, Prev: loop-iv, Up: Loop Analysis and Representation
  16652. 16.7 Number of iterations analysis
  16653. ==================================
  16654. Both on GIMPLE and on RTL, there are functions available to determine
  16655. the number of iterations of a loop, with a similar interface. The
  16656. number of iterations of a loop in GCC is defined as the number of
  16657. executions of the loop latch. In many cases, it is not possible to
  16658. determine the number of iterations unconditionally - the determined
  16659. number is correct only if some assumptions are satisfied. The analysis
  16660. tries to verify these conditions using the information contained in the
  16661. program; if it fails, the conditions are returned together with the
  16662. result. The following information and conditions are provided by the
  16663. analysis:
  16664. * 'assumptions': If this condition is false, the rest of the
  16665. information is invalid.
  16666. * 'noloop_assumptions' on RTL, 'may_be_zero' on GIMPLE: If this
  16667. condition is true, the loop exits in the first iteration.
  16668. * 'infinite': If this condition is true, the loop is infinite. This
  16669. condition is only available on RTL. On GIMPLE, conditions for
  16670. finiteness of the loop are included in 'assumptions'.
  16671. * 'niter_expr' on RTL, 'niter' on GIMPLE: The expression that gives
  16672. number of iterations. The number of iterations is defined as the
  16673. number of executions of the loop latch.
  16674. Both on GIMPLE and on RTL, it necessary for the induction variable
  16675. analysis framework to be initialized (SCEV on GIMPLE, loop-iv on RTL).
  16676. On GIMPLE, the results are stored to 'struct tree_niter_desc' structure.
  16677. Number of iterations before the loop is exited through a given exit can
  16678. be determined using 'number_of_iterations_exit' function. On RTL, the
  16679. results are returned in 'struct niter_desc' structure. The
  16680. corresponding function is named 'check_simple_exit'. There are also
  16681. functions that pass through all the exits of a loop and try to find one
  16682. with easy to determine number of iterations - 'find_loop_niter' on
  16683. GIMPLE and 'find_simple_exit' on RTL. Finally, there are functions that
  16684. provide the same information, but additionally cache it, so that
  16685. repeated calls to number of iterations are not so costly -
  16686. 'number_of_latch_executions' on GIMPLE and 'get_simple_loop_desc' on
  16687. RTL.
  16688. Note that some of these functions may behave slightly differently than
  16689. others - some of them return only the expression for the number of
  16690. iterations, and fail if there are some assumptions. The function
  16691. 'number_of_latch_executions' works only for single-exit loops. The
  16692. function 'number_of_cond_exit_executions' can be used to determine
  16693. number of executions of the exit condition of a single-exit loop (i.e.,
  16694. the 'number_of_latch_executions' increased by one).
  16695. On GIMPLE, below constraint flags affect semantics of some APIs of
  16696. number of iterations analyzer:
  16697. * 'LOOP_C_INFINITE': If this constraint flag is set, the loop is
  16698. known to be infinite. APIs like 'number_of_iterations_exit' can
  16699. return false directly without doing any analysis.
  16700. * 'LOOP_C_FINITE': If this constraint flag is set, the loop is known
  16701. to be finite, in other words, loop's number of iterations can be
  16702. computed with 'assumptions' be true.
  16703. Generally, the constraint flags are set/cleared by consumers which are
  16704. loop optimizers. It's also the consumers' responsibility to set/clear
  16705. constraints correctly. Failing to do that might result in hard to track
  16706. down bugs in scev/niter consumers. One typical use case is vectorizer:
  16707. it drives number of iterations analyzer by setting 'LOOP_C_FINITE' and
  16708. vectorizes possibly infinite loop by versioning loop with analysis
  16709. result. In return, constraints set by consumers can also help number of
  16710. iterations analyzer in following optimizers. For example, 'niter' of a
  16711. loop versioned under 'assumptions' is valid unconditionally.
  16712. Other constraints may be added in the future, for example, a constraint
  16713. indicating that loops' latch must roll thus 'may_be_zero' would be false
  16714. unconditionally.
  16715. 
  16716. File: gccint.info, Node: Dependency analysis, Prev: Number of iterations, Up: Loop Analysis and Representation
  16717. 16.8 Data Dependency Analysis
  16718. =============================
  16719. The code for the data dependence analysis can be found in
  16720. 'tree-data-ref.c' and its interface and data structures are described in
  16721. 'tree-data-ref.h'. The function that computes the data dependences for
  16722. all the array and pointer references for a given loop is
  16723. 'compute_data_dependences_for_loop'. This function is currently used by
  16724. the linear loop transform and the vectorization passes. Before calling
  16725. this function, one has to allocate two vectors: a first vector will
  16726. contain the set of data references that are contained in the analyzed
  16727. loop body, and the second vector will contain the dependence relations
  16728. between the data references. Thus if the vector of data references is
  16729. of size 'n', the vector containing the dependence relations will contain
  16730. 'n*n' elements. However if the analyzed loop contains side effects,
  16731. such as calls that potentially can interfere with the data references in
  16732. the current analyzed loop, the analysis stops while scanning the loop
  16733. body for data references, and inserts a single 'chrec_dont_know' in the
  16734. dependence relation array.
  16735. The data references are discovered in a particular order during the
  16736. scanning of the loop body: the loop body is analyzed in execution order,
  16737. and the data references of each statement are pushed at the end of the
  16738. data reference array. Two data references syntactically occur in the
  16739. program in the same order as in the array of data references. This
  16740. syntactic order is important in some classical data dependence tests,
  16741. and mapping this order to the elements of this array avoids costly
  16742. queries to the loop body representation.
  16743. Three types of data references are currently handled: ARRAY_REF,
  16744. INDIRECT_REF and COMPONENT_REF. The data structure for the data
  16745. reference is 'data_reference', where 'data_reference_p' is a name of a
  16746. pointer to the data reference structure. The structure contains the
  16747. following elements:
  16748. * 'base_object_info': Provides information about the base object of
  16749. the data reference and its access functions. These access
  16750. functions represent the evolution of the data reference in the loop
  16751. relative to its base, in keeping with the classical meaning of the
  16752. data reference access function for the support of arrays. For
  16753. example, for a reference 'a.b[i][j]', the base object is 'a.b' and
  16754. the access functions, one for each array subscript, are: '{i_init,
  16755. + i_step}_1, {j_init, +, j_step}_2'.
  16756. * 'first_location_in_loop': Provides information about the first
  16757. location accessed by the data reference in the loop and about the
  16758. access function used to represent evolution relative to this
  16759. location. This data is used to support pointers, and is not used
  16760. for arrays (for which we have base objects). Pointer accesses are
  16761. represented as a one-dimensional access that starts from the first
  16762. location accessed in the loop. For example:
  16763. for1 i
  16764. for2 j
  16765. *((int *)p + i + j) = a[i][j];
  16766. The access function of the pointer access is '{0, + 4B}_for2'
  16767. relative to 'p + i'. The access functions of the array are
  16768. '{i_init, + i_step}_for1' and '{j_init, +, j_step}_for2' relative
  16769. to 'a'.
  16770. Usually, the object the pointer refers to is either unknown, or we
  16771. cannot prove that the access is confined to the boundaries of a
  16772. certain object.
  16773. Two data references can be compared only if at least one of these
  16774. two representations has all its fields filled for both data
  16775. references.
  16776. The current strategy for data dependence tests is as follows: If
  16777. both 'a' and 'b' are represented as arrays, compare 'a.base_object'
  16778. and 'b.base_object'; if they are equal, apply dependence tests (use
  16779. access functions based on base_objects). Else if both 'a' and 'b'
  16780. are represented as pointers, compare 'a.first_location' and
  16781. 'b.first_location'; if they are equal, apply dependence tests (use
  16782. access functions based on first location). However, if 'a' and 'b'
  16783. are represented differently, only try to prove that the bases are
  16784. definitely different.
  16785. * Aliasing information.
  16786. * Alignment information.
  16787. The structure describing the relation between two data references is
  16788. 'data_dependence_relation' and the shorter name for a pointer to such a
  16789. structure is 'ddr_p'. This structure contains:
  16790. * a pointer to each data reference,
  16791. * a tree node 'are_dependent' that is set to 'chrec_known' if the
  16792. analysis has proved that there is no dependence between these two
  16793. data references, 'chrec_dont_know' if the analysis was not able to
  16794. determine any useful result and potentially there could exist a
  16795. dependence between these data references, and 'are_dependent' is
  16796. set to 'NULL_TREE' if there exist a dependence relation between the
  16797. data references, and the description of this dependence relation is
  16798. given in the 'subscripts', 'dir_vects', and 'dist_vects' arrays,
  16799. * a boolean that determines whether the dependence relation can be
  16800. represented by a classical distance vector,
  16801. * an array 'subscripts' that contains a description of each subscript
  16802. of the data references. Given two array accesses a subscript is
  16803. the tuple composed of the access functions for a given dimension.
  16804. For example, given 'A[f1][f2][f3]' and 'B[g1][g2][g3]', there are
  16805. three subscripts: '(f1, g1), (f2, g2), (f3, g3)'.
  16806. * two arrays 'dir_vects' and 'dist_vects' that contain classical
  16807. representations of the data dependences under the form of direction
  16808. and distance dependence vectors,
  16809. * an array of loops 'loop_nest' that contains the loops to which the
  16810. distance and direction vectors refer to.
  16811. Several functions for pretty printing the information extracted by the
  16812. data dependence analysis are available: 'dump_ddrs' prints with a
  16813. maximum verbosity the details of a data dependence relations array,
  16814. 'dump_dist_dir_vectors' prints only the classical distance and direction
  16815. vectors for a data dependence relations array, and
  16816. 'dump_data_references' prints the details of the data references
  16817. contained in a data reference array.
  16818. 
  16819. File: gccint.info, Node: Machine Desc, Next: Target Macros, Prev: Loop Analysis and Representation, Up: Top
  16820. 17 Machine Descriptions
  16821. ***********************
  16822. A machine description has two parts: a file of instruction patterns
  16823. ('.md' file) and a C header file of macro definitions.
  16824. The '.md' file for a target machine contains a pattern for each
  16825. instruction that the target machine supports (or at least each
  16826. instruction that is worth telling the compiler about). It may also
  16827. contain comments. A semicolon causes the rest of the line to be a
  16828. comment, unless the semicolon is inside a quoted string.
  16829. See the next chapter for information on the C header file.
  16830. * Menu:
  16831. * Overview:: How the machine description is used.
  16832. * Patterns:: How to write instruction patterns.
  16833. * Example:: An explained example of a 'define_insn' pattern.
  16834. * RTL Template:: The RTL template defines what insns match a pattern.
  16835. * Output Template:: The output template says how to make assembler code
  16836. from such an insn.
  16837. * Output Statement:: For more generality, write C code to output
  16838. the assembler code.
  16839. * Predicates:: Controlling what kinds of operands can be used
  16840. for an insn.
  16841. * Constraints:: Fine-tuning operand selection.
  16842. * Standard Names:: Names mark patterns to use for code generation.
  16843. * Pattern Ordering:: When the order of patterns makes a difference.
  16844. * Dependent Patterns:: Having one pattern may make you need another.
  16845. * Jump Patterns:: Special considerations for patterns for jump insns.
  16846. * Looping Patterns:: How to define patterns for special looping insns.
  16847. * Insn Canonicalizations::Canonicalization of Instructions
  16848. * Expander Definitions::Generating a sequence of several RTL insns
  16849. for a standard operation.
  16850. * Insn Splitting:: Splitting Instructions into Multiple Instructions.
  16851. * Including Patterns:: Including Patterns in Machine Descriptions.
  16852. * Peephole Definitions::Defining machine-specific peephole optimizations.
  16853. * Insn Attributes:: Specifying the value of attributes for generated insns.
  16854. * Conditional Execution::Generating 'define_insn' patterns for
  16855. predication.
  16856. * Define Subst:: Generating 'define_insn' and 'define_expand'
  16857. patterns from other patterns.
  16858. * Constant Definitions::Defining symbolic constants that can be used in the
  16859. md file.
  16860. * Iterators:: Using iterators to generate patterns from a template.
  16861. 
  16862. File: gccint.info, Node: Overview, Next: Patterns, Up: Machine Desc
  16863. 17.1 Overview of How the Machine Description is Used
  16864. ====================================================
  16865. There are three main conversions that happen in the compiler:
  16866. 1. The front end reads the source code and builds a parse tree.
  16867. 2. The parse tree is used to generate an RTL insn list based on named
  16868. instruction patterns.
  16869. 3. The insn list is matched against the RTL templates to produce
  16870. assembler code.
  16871. For the generate pass, only the names of the insns matter, from either
  16872. a named 'define_insn' or a 'define_expand'. The compiler will choose
  16873. the pattern with the right name and apply the operands according to the
  16874. documentation later in this chapter, without regard for the RTL template
  16875. or operand constraints. Note that the names the compiler looks for are
  16876. hard-coded in the compiler--it will ignore unnamed patterns and patterns
  16877. with names it doesn't know about, but if you don't provide a named
  16878. pattern it needs, it will abort.
  16879. If a 'define_insn' is used, the template given is inserted into the
  16880. insn list. If a 'define_expand' is used, one of three things happens,
  16881. based on the condition logic. The condition logic may manually create
  16882. new insns for the insn list, say via 'emit_insn()', and invoke 'DONE'.
  16883. For certain named patterns, it may invoke 'FAIL' to tell the compiler to
  16884. use an alternate way of performing that task. If it invokes neither
  16885. 'DONE' nor 'FAIL', the template given in the pattern is inserted, as if
  16886. the 'define_expand' were a 'define_insn'.
  16887. Once the insn list is generated, various optimization passes convert,
  16888. replace, and rearrange the insns in the insn list. This is where the
  16889. 'define_split' and 'define_peephole' patterns get used, for example.
  16890. Finally, the insn list's RTL is matched up with the RTL templates in
  16891. the 'define_insn' patterns, and those patterns are used to emit the
  16892. final assembly code. For this purpose, each named 'define_insn' acts
  16893. like it's unnamed, since the names are ignored.
  16894. 
  16895. File: gccint.info, Node: Patterns, Next: Example, Prev: Overview, Up: Machine Desc
  16896. 17.2 Everything about Instruction Patterns
  16897. ==========================================
  16898. A 'define_insn' expression is used to define instruction patterns to
  16899. which insns may be matched. A 'define_insn' expression contains an
  16900. incomplete RTL expression, with pieces to be filled in later, operand
  16901. constraints that restrict how the pieces can be filled in, and an output
  16902. template or C code to generate the assembler output.
  16903. A 'define_insn' is an RTL expression containing four or five operands:
  16904. 1. An optional name N. When a name is present, the compiler
  16905. automically generates a C++ function 'gen_N' that takes the
  16906. operands of the instruction as arguments and returns the
  16907. instruction's rtx pattern. The compiler also assigns the
  16908. instruction a unique code 'CODE_FOR_N', with all such codes
  16909. belonging to an enum called 'insn_code'.
  16910. These names serve one of two purposes. The first is to indicate
  16911. that the instruction performs a certain standard job for the
  16912. RTL-generation pass of the compiler, such as a move, an addition,
  16913. or a conditional jump. The second is to help the target generate
  16914. certain target-specific operations, such as when implementing
  16915. target-specific intrinsic functions.
  16916. It is better to prefix target-specific names with the name of the
  16917. target, to avoid any clash with current or future standard names.
  16918. The absence of a name is indicated by writing an empty string where
  16919. the name should go. Nameless instruction patterns are never used
  16920. for generating RTL code, but they may permit several simpler insns
  16921. to be combined later on.
  16922. For the purpose of debugging the compiler, you may also specify a
  16923. name beginning with the '*' character. Such a name is used only
  16924. for identifying the instruction in RTL dumps; it is equivalent to
  16925. having a nameless pattern for all other purposes. Names beginning
  16926. with the '*' character are not required to be unique.
  16927. The name may also have the form '@N'. This has the same effect as
  16928. a name 'N', but in addition tells the compiler to generate further
  16929. helper functions; see *note Parameterized Names:: for details.
  16930. 2. The "RTL template": This is a vector of incomplete RTL expressions
  16931. which describe the semantics of the instruction (*note RTL
  16932. Template::). It is incomplete because it may contain
  16933. 'match_operand', 'match_operator', and 'match_dup' expressions that
  16934. stand for operands of the instruction.
  16935. If the vector has multiple elements, the RTL template is treated as
  16936. a 'parallel' expression.
  16937. 3. The condition: This is a string which contains a C expression.
  16938. When the compiler attempts to match RTL against a pattern, the
  16939. condition is evaluated. If the condition evaluates to 'true', the
  16940. match is permitted. The condition may be an empty string, which is
  16941. treated as always 'true'.
  16942. For a named pattern, the condition may not depend on the data in
  16943. the insn being matched, but only the target-machine-type flags.
  16944. The compiler needs to test these conditions during initialization
  16945. in order to learn exactly which named instructions are available in
  16946. a particular run.
  16947. For nameless patterns, the condition is applied only when matching
  16948. an individual insn, and only after the insn has matched the
  16949. pattern's recognition template. The insn's operands may be found
  16950. in the vector 'operands'.
  16951. An instruction condition cannot become more restrictive as
  16952. compilation progresses. If the condition accepts a particular RTL
  16953. instruction at one stage of compilation, it must continue to accept
  16954. that instruction until the final pass. For example,
  16955. '!reload_completed' and 'can_create_pseudo_p ()' are both invalid
  16956. instruction conditions, because they are true during the earlier
  16957. RTL passes and false during the later ones. For the same reason,
  16958. if a condition accepts an instruction before register allocation,
  16959. it cannot later try to control register allocation by excluding
  16960. certain register or value combinations.
  16961. Although a condition cannot become more restrictive as compilation
  16962. progresses, the condition for a nameless pattern _can_ become more
  16963. permissive. For example, a nameless instruction can require
  16964. 'reload_completed' to be true, in which case it only matches after
  16965. register allocation.
  16966. 4. The "output template" or "output statement": This is either a
  16967. string, or a fragment of C code which returns a string.
  16968. When simple substitution isn't general enough, you can specify a
  16969. piece of C code to compute the output. *Note Output Statement::.
  16970. 5. The "insn attributes": This is an optional vector containing the
  16971. values of attributes for insns matching this pattern (*note Insn
  16972. Attributes::).
  16973. 
  16974. File: gccint.info, Node: Example, Next: RTL Template, Prev: Patterns, Up: Machine Desc
  16975. 17.3 Example of 'define_insn'
  16976. =============================
  16977. Here is an example of an instruction pattern, taken from the machine
  16978. description for the 68000/68020.
  16979. (define_insn "tstsi"
  16980. [(set (cc0)
  16981. (match_operand:SI 0 "general_operand" "rm"))]
  16982. ""
  16983. "*
  16984. {
  16985. if (TARGET_68020 || ! ADDRESS_REG_P (operands[0]))
  16986. return \"tstl %0\";
  16987. return \"cmpl #0,%0\";
  16988. }")
  16989. This can also be written using braced strings:
  16990. (define_insn "tstsi"
  16991. [(set (cc0)
  16992. (match_operand:SI 0 "general_operand" "rm"))]
  16993. ""
  16994. {
  16995. if (TARGET_68020 || ! ADDRESS_REG_P (operands[0]))
  16996. return "tstl %0";
  16997. return "cmpl #0,%0";
  16998. })
  16999. This describes an instruction which sets the condition codes based on
  17000. the value of a general operand. It has no condition, so any insn with
  17001. an RTL description of the form shown may be matched to this pattern.
  17002. The name 'tstsi' means "test a 'SImode' value" and tells the RTL
  17003. generation pass that, when it is necessary to test such a value, an insn
  17004. to do so can be constructed using this pattern.
  17005. The output control string is a piece of C code which chooses which
  17006. output template to return based on the kind of operand and the specific
  17007. type of CPU for which code is being generated.
  17008. '"rm"' is an operand constraint. Its meaning is explained below.
  17009. 
  17010. File: gccint.info, Node: RTL Template, Next: Output Template, Prev: Example, Up: Machine Desc
  17011. 17.4 RTL Template
  17012. =================
  17013. The RTL template is used to define which insns match the particular
  17014. pattern and how to find their operands. For named patterns, the RTL
  17015. template also says how to construct an insn from specified operands.
  17016. Construction involves substituting specified operands into a copy of
  17017. the template. Matching involves determining the values that serve as
  17018. the operands in the insn being matched. Both of these activities are
  17019. controlled by special expression types that direct matching and
  17020. substitution of the operands.
  17021. '(match_operand:M N PREDICATE CONSTRAINT)'
  17022. This expression is a placeholder for operand number N of the insn.
  17023. When constructing an insn, operand number N will be substituted at
  17024. this point. When matching an insn, whatever appears at this
  17025. position in the insn will be taken as operand number N; but it must
  17026. satisfy PREDICATE or this instruction pattern will not match at
  17027. all.
  17028. Operand numbers must be chosen consecutively counting from zero in
  17029. each instruction pattern. There may be only one 'match_operand'
  17030. expression in the pattern for each operand number. Usually
  17031. operands are numbered in the order of appearance in 'match_operand'
  17032. expressions. In the case of a 'define_expand', any operand numbers
  17033. used only in 'match_dup' expressions have higher values than all
  17034. other operand numbers.
  17035. PREDICATE is a string that is the name of a function that accepts
  17036. two arguments, an expression and a machine mode. *Note
  17037. Predicates::. During matching, the function will be called with
  17038. the putative operand as the expression and M as the mode argument
  17039. (if M is not specified, 'VOIDmode' will be used, which normally
  17040. causes PREDICATE to accept any mode). If it returns zero, this
  17041. instruction pattern fails to match. PREDICATE may be an empty
  17042. string; then it means no test is to be done on the operand, so
  17043. anything which occurs in this position is valid.
  17044. Most of the time, PREDICATE will reject modes other than M--but not
  17045. always. For example, the predicate 'address_operand' uses M as the
  17046. mode of memory ref that the address should be valid for. Many
  17047. predicates accept 'const_int' nodes even though their mode is
  17048. 'VOIDmode'.
  17049. CONSTRAINT controls reloading and the choice of the best register
  17050. class to use for a value, as explained later (*note Constraints::).
  17051. If the constraint would be an empty string, it can be omitted.
  17052. People are often unclear on the difference between the constraint
  17053. and the predicate. The predicate helps decide whether a given insn
  17054. matches the pattern. The constraint plays no role in this
  17055. decision; instead, it controls various decisions in the case of an
  17056. insn which does match.
  17057. '(match_scratch:M N CONSTRAINT)'
  17058. This expression is also a placeholder for operand number N and
  17059. indicates that operand must be a 'scratch' or 'reg' expression.
  17060. When matching patterns, this is equivalent to
  17061. (match_operand:M N "scratch_operand" CONSTRAINT)
  17062. but, when generating RTL, it produces a ('scratch':M) expression.
  17063. If the last few expressions in a 'parallel' are 'clobber'
  17064. expressions whose operands are either a hard register or
  17065. 'match_scratch', the combiner can add or delete them when
  17066. necessary. *Note Side Effects::.
  17067. '(match_dup N)'
  17068. This expression is also a placeholder for operand number N. It is
  17069. used when the operand needs to appear more than once in the insn.
  17070. In construction, 'match_dup' acts just like 'match_operand': the
  17071. operand is substituted into the insn being constructed. But in
  17072. matching, 'match_dup' behaves differently. It assumes that operand
  17073. number N has already been determined by a 'match_operand' appearing
  17074. earlier in the recognition template, and it matches only an
  17075. identical-looking expression.
  17076. Note that 'match_dup' should not be used to tell the compiler that
  17077. a particular register is being used for two operands (example:
  17078. 'add' that adds one register to another; the second register is
  17079. both an input operand and the output operand). Use a matching
  17080. constraint (*note Simple Constraints::) for those. 'match_dup' is
  17081. for the cases where one operand is used in two places in the
  17082. template, such as an instruction that computes both a quotient and
  17083. a remainder, where the opcode takes two input operands but the RTL
  17084. template has to refer to each of those twice; once for the quotient
  17085. pattern and once for the remainder pattern.
  17086. '(match_operator:M N PREDICATE [OPERANDS...])'
  17087. This pattern is a kind of placeholder for a variable RTL expression
  17088. code.
  17089. When constructing an insn, it stands for an RTL expression whose
  17090. expression code is taken from that of operand N, and whose operands
  17091. are constructed from the patterns OPERANDS.
  17092. When matching an expression, it matches an expression if the
  17093. function PREDICATE returns nonzero on that expression _and_ the
  17094. patterns OPERANDS match the operands of the expression.
  17095. Suppose that the function 'commutative_operator' is defined as
  17096. follows, to match any expression whose operator is one of the
  17097. commutative arithmetic operators of RTL and whose mode is MODE:
  17098. int
  17099. commutative_integer_operator (x, mode)
  17100. rtx x;
  17101. machine_mode mode;
  17102. {
  17103. enum rtx_code code = GET_CODE (x);
  17104. if (GET_MODE (x) != mode)
  17105. return 0;
  17106. return (GET_RTX_CLASS (code) == RTX_COMM_ARITH
  17107. || code == EQ || code == NE);
  17108. }
  17109. Then the following pattern will match any RTL expression consisting
  17110. of a commutative operator applied to two general operands:
  17111. (match_operator:SI 3 "commutative_operator"
  17112. [(match_operand:SI 1 "general_operand" "g")
  17113. (match_operand:SI 2 "general_operand" "g")])
  17114. Here the vector '[OPERANDS...]' contains two patterns because the
  17115. expressions to be matched all contain two operands.
  17116. When this pattern does match, the two operands of the commutative
  17117. operator are recorded as operands 1 and 2 of the insn. (This is
  17118. done by the two instances of 'match_operand'.) Operand 3 of the
  17119. insn will be the entire commutative expression: use 'GET_CODE
  17120. (operands[3])' to see which commutative operator was used.
  17121. The machine mode M of 'match_operator' works like that of
  17122. 'match_operand': it is passed as the second argument to the
  17123. predicate function, and that function is solely responsible for
  17124. deciding whether the expression to be matched "has" that mode.
  17125. When constructing an insn, argument 3 of the gen-function will
  17126. specify the operation (i.e. the expression code) for the expression
  17127. to be made. It should be an RTL expression, whose expression code
  17128. is copied into a new expression whose operands are arguments 1 and
  17129. 2 of the gen-function. The subexpressions of argument 3 are not
  17130. used; only its expression code matters.
  17131. When 'match_operator' is used in a pattern for matching an insn, it
  17132. usually best if the operand number of the 'match_operator' is
  17133. higher than that of the actual operands of the insn. This improves
  17134. register allocation because the register allocator often looks at
  17135. operands 1 and 2 of insns to see if it can do register tying.
  17136. There is no way to specify constraints in 'match_operator'. The
  17137. operand of the insn which corresponds to the 'match_operator' never
  17138. has any constraints because it is never reloaded as a whole.
  17139. However, if parts of its OPERANDS are matched by 'match_operand'
  17140. patterns, those parts may have constraints of their own.
  17141. '(match_op_dup:M N[OPERANDS...])'
  17142. Like 'match_dup', except that it applies to operators instead of
  17143. operands. When constructing an insn, operand number N will be
  17144. substituted at this point. But in matching, 'match_op_dup' behaves
  17145. differently. It assumes that operand number N has already been
  17146. determined by a 'match_operator' appearing earlier in the
  17147. recognition template, and it matches only an identical-looking
  17148. expression.
  17149. '(match_parallel N PREDICATE [SUBPAT...])'
  17150. This pattern is a placeholder for an insn that consists of a
  17151. 'parallel' expression with a variable number of elements. This
  17152. expression should only appear at the top level of an insn pattern.
  17153. When constructing an insn, operand number N will be substituted at
  17154. this point. When matching an insn, it matches if the body of the
  17155. insn is a 'parallel' expression with at least as many elements as
  17156. the vector of SUBPAT expressions in the 'match_parallel', if each
  17157. SUBPAT matches the corresponding element of the 'parallel', _and_
  17158. the function PREDICATE returns nonzero on the 'parallel' that is
  17159. the body of the insn. It is the responsibility of the predicate to
  17160. validate elements of the 'parallel' beyond those listed in the
  17161. 'match_parallel'.
  17162. A typical use of 'match_parallel' is to match load and store
  17163. multiple expressions, which can contain a variable number of
  17164. elements in a 'parallel'. For example,
  17165. (define_insn ""
  17166. [(match_parallel 0 "load_multiple_operation"
  17167. [(set (match_operand:SI 1 "gpc_reg_operand" "=r")
  17168. (match_operand:SI 2 "memory_operand" "m"))
  17169. (use (reg:SI 179))
  17170. (clobber (reg:SI 179))])]
  17171. ""
  17172. "loadm 0,0,%1,%2")
  17173. This example comes from 'a29k.md'. The function
  17174. 'load_multiple_operation' is defined in 'a29k.c' and checks that
  17175. subsequent elements in the 'parallel' are the same as the 'set' in
  17176. the pattern, except that they are referencing subsequent registers
  17177. and memory locations.
  17178. An insn that matches this pattern might look like:
  17179. (parallel
  17180. [(set (reg:SI 20) (mem:SI (reg:SI 100)))
  17181. (use (reg:SI 179))
  17182. (clobber (reg:SI 179))
  17183. (set (reg:SI 21)
  17184. (mem:SI (plus:SI (reg:SI 100)
  17185. (const_int 4))))
  17186. (set (reg:SI 22)
  17187. (mem:SI (plus:SI (reg:SI 100)
  17188. (const_int 8))))])
  17189. '(match_par_dup N [SUBPAT...])'
  17190. Like 'match_op_dup', but for 'match_parallel' instead of
  17191. 'match_operator'.
  17192. 
  17193. File: gccint.info, Node: Output Template, Next: Output Statement, Prev: RTL Template, Up: Machine Desc
  17194. 17.5 Output Templates and Operand Substitution
  17195. ==============================================
  17196. The "output template" is a string which specifies how to output the
  17197. assembler code for an instruction pattern. Most of the template is a
  17198. fixed string which is output literally. The character '%' is used to
  17199. specify where to substitute an operand; it can also be used to identify
  17200. places where different variants of the assembler require different
  17201. syntax.
  17202. In the simplest case, a '%' followed by a digit N says to output
  17203. operand N at that point in the string.
  17204. '%' followed by a letter and a digit says to output an operand in an
  17205. alternate fashion. Four letters have standard, built-in meanings
  17206. described below. The machine description macro 'PRINT_OPERAND' can
  17207. define additional letters with nonstandard meanings.
  17208. '%cDIGIT' can be used to substitute an operand that is a constant value
  17209. without the syntax that normally indicates an immediate operand.
  17210. '%nDIGIT' is like '%cDIGIT' except that the value of the constant is
  17211. negated before printing.
  17212. '%aDIGIT' can be used to substitute an operand as if it were a memory
  17213. reference, with the actual operand treated as the address. This may be
  17214. useful when outputting a "load address" instruction, because often the
  17215. assembler syntax for such an instruction requires you to write the
  17216. operand as if it were a memory reference.
  17217. '%lDIGIT' is used to substitute a 'label_ref' into a jump instruction.
  17218. '%=' outputs a number which is unique to each instruction in the entire
  17219. compilation. This is useful for making local labels to be referred to
  17220. more than once in a single template that generates multiple assembler
  17221. instructions.
  17222. '%' followed by a punctuation character specifies a substitution that
  17223. does not use an operand. Only one case is standard: '%%' outputs a '%'
  17224. into the assembler code. Other nonstandard cases can be defined in the
  17225. 'PRINT_OPERAND' macro. You must also define which punctuation
  17226. characters are valid with the 'PRINT_OPERAND_PUNCT_VALID_P' macro.
  17227. The template may generate multiple assembler instructions. Write the
  17228. text for the instructions, with '\;' between them.
  17229. When the RTL contains two operands which are required by constraint to
  17230. match each other, the output template must refer only to the
  17231. lower-numbered operand. Matching operands are not always identical, and
  17232. the rest of the compiler arranges to put the proper RTL expression for
  17233. printing into the lower-numbered operand.
  17234. One use of nonstandard letters or punctuation following '%' is to
  17235. distinguish between different assembler languages for the same machine;
  17236. for example, Motorola syntax versus MIT syntax for the 68000. Motorola
  17237. syntax requires periods in most opcode names, while MIT syntax does not.
  17238. For example, the opcode 'movel' in MIT syntax is 'move.l' in Motorola
  17239. syntax. The same file of patterns is used for both kinds of output
  17240. syntax, but the character sequence '%.' is used in each place where
  17241. Motorola syntax wants a period. The 'PRINT_OPERAND' macro for Motorola
  17242. syntax defines the sequence to output a period; the macro for MIT syntax
  17243. defines it to do nothing.
  17244. As a special case, a template consisting of the single character '#'
  17245. instructs the compiler to first split the insn, and then output the
  17246. resulting instructions separately. This helps eliminate redundancy in
  17247. the output templates. If you have a 'define_insn' that needs to emit
  17248. multiple assembler instructions, and there is a matching 'define_split'
  17249. already defined, then you can simply use '#' as the output template
  17250. instead of writing an output template that emits the multiple assembler
  17251. instructions.
  17252. Note that '#' only has an effect while generating assembly code; it
  17253. does not affect whether a split occurs earlier. An associated
  17254. 'define_split' must exist and it must be suitable for use after register
  17255. allocation.
  17256. If the macro 'ASSEMBLER_DIALECT' is defined, you can use construct of
  17257. the form '{option0|option1|option2}' in the templates. These describe
  17258. multiple variants of assembler language syntax. *Note Instruction
  17259. Output::.
  17260. 
  17261. File: gccint.info, Node: Output Statement, Next: Predicates, Prev: Output Template, Up: Machine Desc
  17262. 17.6 C Statements for Assembler Output
  17263. ======================================
  17264. Often a single fixed template string cannot produce correct and
  17265. efficient assembler code for all the cases that are recognized by a
  17266. single instruction pattern. For example, the opcodes may depend on the
  17267. kinds of operands; or some unfortunate combinations of operands may
  17268. require extra machine instructions.
  17269. If the output control string starts with a '@', then it is actually a
  17270. series of templates, each on a separate line. (Blank lines and leading
  17271. spaces and tabs are ignored.) The templates correspond to the pattern's
  17272. constraint alternatives (*note Multi-Alternative::). For example, if a
  17273. target machine has a two-address add instruction 'addr' to add into a
  17274. register and another 'addm' to add a register to memory, you might write
  17275. this pattern:
  17276. (define_insn "addsi3"
  17277. [(set (match_operand:SI 0 "general_operand" "=r,m")
  17278. (plus:SI (match_operand:SI 1 "general_operand" "0,0")
  17279. (match_operand:SI 2 "general_operand" "g,r")))]
  17280. ""
  17281. "@
  17282. addr %2,%0
  17283. addm %2,%0")
  17284. If the output control string starts with a '*', then it is not an
  17285. output template but rather a piece of C program that should compute a
  17286. template. It should execute a 'return' statement to return the
  17287. template-string you want. Most such templates use C string literals,
  17288. which require doublequote characters to delimit them. To include these
  17289. doublequote characters in the string, prefix each one with '\'.
  17290. If the output control string is written as a brace block instead of a
  17291. double-quoted string, it is automatically assumed to be C code. In that
  17292. case, it is not necessary to put in a leading asterisk, or to escape the
  17293. doublequotes surrounding C string literals.
  17294. The operands may be found in the array 'operands', whose C data type is
  17295. 'rtx []'.
  17296. It is very common to select different ways of generating assembler code
  17297. based on whether an immediate operand is within a certain range. Be
  17298. careful when doing this, because the result of 'INTVAL' is an integer on
  17299. the host machine. If the host machine has more bits in an 'int' than
  17300. the target machine has in the mode in which the constant will be used,
  17301. then some of the bits you get from 'INTVAL' will be superfluous. For
  17302. proper results, you must carefully disregard the values of those bits.
  17303. It is possible to output an assembler instruction and then go on to
  17304. output or compute more of them, using the subroutine 'output_asm_insn'.
  17305. This receives two arguments: a template-string and a vector of operands.
  17306. The vector may be 'operands', or it may be another array of 'rtx' that
  17307. you declare locally and initialize yourself.
  17308. When an insn pattern has multiple alternatives in its constraints,
  17309. often the appearance of the assembler code is determined mostly by which
  17310. alternative was matched. When this is so, the C code can test the
  17311. variable 'which_alternative', which is the ordinal number of the
  17312. alternative that was actually satisfied (0 for the first, 1 for the
  17313. second alternative, etc.).
  17314. For example, suppose there are two opcodes for storing zero, 'clrreg'
  17315. for registers and 'clrmem' for memory locations. Here is how a pattern
  17316. could use 'which_alternative' to choose between them:
  17317. (define_insn ""
  17318. [(set (match_operand:SI 0 "general_operand" "=r,m")
  17319. (const_int 0))]
  17320. ""
  17321. {
  17322. return (which_alternative == 0
  17323. ? "clrreg %0" : "clrmem %0");
  17324. })
  17325. The example above, where the assembler code to generate was _solely_
  17326. determined by the alternative, could also have been specified as
  17327. follows, having the output control string start with a '@':
  17328. (define_insn ""
  17329. [(set (match_operand:SI 0 "general_operand" "=r,m")
  17330. (const_int 0))]
  17331. ""
  17332. "@
  17333. clrreg %0
  17334. clrmem %0")
  17335. If you just need a little bit of C code in one (or a few) alternatives,
  17336. you can use '*' inside of a '@' multi-alternative template:
  17337. (define_insn ""
  17338. [(set (match_operand:SI 0 "general_operand" "=r,<,m")
  17339. (const_int 0))]
  17340. ""
  17341. "@
  17342. clrreg %0
  17343. * return stack_mem_p (operands[0]) ? \"push 0\" : \"clrmem %0\";
  17344. clrmem %0")
  17345. 
  17346. File: gccint.info, Node: Predicates, Next: Constraints, Prev: Output Statement, Up: Machine Desc
  17347. 17.7 Predicates
  17348. ===============
  17349. A predicate determines whether a 'match_operand' or 'match_operator'
  17350. expression matches, and therefore whether the surrounding instruction
  17351. pattern will be used for that combination of operands. GCC has a number
  17352. of machine-independent predicates, and you can define machine-specific
  17353. predicates as needed. By convention, predicates used with
  17354. 'match_operand' have names that end in '_operand', and those used with
  17355. 'match_operator' have names that end in '_operator'.
  17356. All predicates are boolean functions (in the mathematical sense) of two
  17357. arguments: the RTL expression that is being considered at that position
  17358. in the instruction pattern, and the machine mode that the
  17359. 'match_operand' or 'match_operator' specifies. In this section, the
  17360. first argument is called OP and the second argument MODE. Predicates
  17361. can be called from C as ordinary two-argument functions; this can be
  17362. useful in output templates or other machine-specific code.
  17363. Operand predicates can allow operands that are not actually acceptable
  17364. to the hardware, as long as the constraints give reload the ability to
  17365. fix them up (*note Constraints::). However, GCC will usually generate
  17366. better code if the predicates specify the requirements of the machine
  17367. instructions as closely as possible. Reload cannot fix up operands that
  17368. must be constants ("immediate operands"); you must use a predicate that
  17369. allows only constants, or else enforce the requirement in the extra
  17370. condition.
  17371. Most predicates handle their MODE argument in a uniform manner. If
  17372. MODE is 'VOIDmode' (unspecified), then OP can have any mode. If MODE is
  17373. anything else, then OP must have the same mode, unless OP is a
  17374. 'CONST_INT' or integer 'CONST_DOUBLE'. These RTL expressions always
  17375. have 'VOIDmode', so it would be counterproductive to check that their
  17376. mode matches. Instead, predicates that accept 'CONST_INT' and/or
  17377. integer 'CONST_DOUBLE' check that the value stored in the constant will
  17378. fit in the requested mode.
  17379. Predicates with this behavior are called "normal". 'genrecog' can
  17380. optimize the instruction recognizer based on knowledge of how normal
  17381. predicates treat modes. It can also diagnose certain kinds of common
  17382. errors in the use of normal predicates; for instance, it is almost
  17383. always an error to use a normal predicate without specifying a mode.
  17384. Predicates that do something different with their MODE argument are
  17385. called "special". The generic predicates 'address_operand' and
  17386. 'pmode_register_operand' are special predicates. 'genrecog' does not do
  17387. any optimizations or diagnosis when special predicates are used.
  17388. * Menu:
  17389. * Machine-Independent Predicates:: Predicates available to all back ends.
  17390. * Defining Predicates:: How to write machine-specific predicate
  17391. functions.
  17392. 
  17393. File: gccint.info, Node: Machine-Independent Predicates, Next: Defining Predicates, Up: Predicates
  17394. 17.7.1 Machine-Independent Predicates
  17395. -------------------------------------
  17396. These are the generic predicates available to all back ends. They are
  17397. defined in 'recog.c'. The first category of predicates allow only
  17398. constant, or "immediate", operands.
  17399. -- Function: immediate_operand
  17400. This predicate allows any sort of constant that fits in MODE. It
  17401. is an appropriate choice for instructions that take operands that
  17402. must be constant.
  17403. -- Function: const_int_operand
  17404. This predicate allows any 'CONST_INT' expression that fits in MODE.
  17405. It is an appropriate choice for an immediate operand that does not
  17406. allow a symbol or label.
  17407. -- Function: const_double_operand
  17408. This predicate accepts any 'CONST_DOUBLE' expression that has
  17409. exactly MODE. If MODE is 'VOIDmode', it will also accept
  17410. 'CONST_INT'. It is intended for immediate floating point
  17411. constants.
  17412. The second category of predicates allow only some kind of machine
  17413. register.
  17414. -- Function: register_operand
  17415. This predicate allows any 'REG' or 'SUBREG' expression that is
  17416. valid for MODE. It is often suitable for arithmetic instruction
  17417. operands on a RISC machine.
  17418. -- Function: pmode_register_operand
  17419. This is a slight variant on 'register_operand' which works around a
  17420. limitation in the machine-description reader.
  17421. (match_operand N "pmode_register_operand" CONSTRAINT)
  17422. means exactly what
  17423. (match_operand:P N "register_operand" CONSTRAINT)
  17424. would mean, if the machine-description reader accepted ':P' mode
  17425. suffixes. Unfortunately, it cannot, because 'Pmode' is an alias
  17426. for some other mode, and might vary with machine-specific options.
  17427. *Note Misc::.
  17428. -- Function: scratch_operand
  17429. This predicate allows hard registers and 'SCRATCH' expressions, but
  17430. not pseudo-registers. It is used internally by 'match_scratch'; it
  17431. should not be used directly.
  17432. The third category of predicates allow only some kind of memory
  17433. reference.
  17434. -- Function: memory_operand
  17435. This predicate allows any valid reference to a quantity of mode
  17436. MODE in memory, as determined by the weak form of
  17437. 'GO_IF_LEGITIMATE_ADDRESS' (*note Addressing Modes::).
  17438. -- Function: address_operand
  17439. This predicate is a little unusual; it allows any operand that is a
  17440. valid expression for the _address_ of a quantity of mode MODE,
  17441. again determined by the weak form of 'GO_IF_LEGITIMATE_ADDRESS'.
  17442. To first order, if '(mem:MODE (EXP))' is acceptable to
  17443. 'memory_operand', then EXP is acceptable to 'address_operand'.
  17444. Note that EXP does not necessarily have the mode MODE.
  17445. -- Function: indirect_operand
  17446. This is a stricter form of 'memory_operand' which allows only
  17447. memory references with a 'general_operand' as the address
  17448. expression. New uses of this predicate are discouraged, because
  17449. 'general_operand' is very permissive, so it's hard to tell what an
  17450. 'indirect_operand' does or does not allow. If a target has
  17451. different requirements for memory operands for different
  17452. instructions, it is better to define target-specific predicates
  17453. which enforce the hardware's requirements explicitly.
  17454. -- Function: push_operand
  17455. This predicate allows a memory reference suitable for pushing a
  17456. value onto the stack. This will be a 'MEM' which refers to
  17457. 'stack_pointer_rtx', with a side effect in its address expression
  17458. (*note Incdec::); which one is determined by the 'STACK_PUSH_CODE'
  17459. macro (*note Frame Layout::).
  17460. -- Function: pop_operand
  17461. This predicate allows a memory reference suitable for popping a
  17462. value off the stack. Again, this will be a 'MEM' referring to
  17463. 'stack_pointer_rtx', with a side effect in its address expression.
  17464. However, this time 'STACK_POP_CODE' is expected.
  17465. The fourth category of predicates allow some combination of the above
  17466. operands.
  17467. -- Function: nonmemory_operand
  17468. This predicate allows any immediate or register operand valid for
  17469. MODE.
  17470. -- Function: nonimmediate_operand
  17471. This predicate allows any register or memory operand valid for
  17472. MODE.
  17473. -- Function: general_operand
  17474. This predicate allows any immediate, register, or memory operand
  17475. valid for MODE.
  17476. Finally, there are two generic operator predicates.
  17477. -- Function: comparison_operator
  17478. This predicate matches any expression which performs an arithmetic
  17479. comparison in MODE; that is, 'COMPARISON_P' is true for the
  17480. expression code.
  17481. -- Function: ordered_comparison_operator
  17482. This predicate matches any expression which performs an arithmetic
  17483. comparison in MODE and whose expression code is valid for integer
  17484. modes; that is, the expression code will be one of 'eq', 'ne',
  17485. 'lt', 'ltu', 'le', 'leu', 'gt', 'gtu', 'ge', 'geu'.
  17486. 
  17487. File: gccint.info, Node: Defining Predicates, Prev: Machine-Independent Predicates, Up: Predicates
  17488. 17.7.2 Defining Machine-Specific Predicates
  17489. -------------------------------------------
  17490. Many machines have requirements for their operands that cannot be
  17491. expressed precisely using the generic predicates. You can define
  17492. additional predicates using 'define_predicate' and
  17493. 'define_special_predicate' expressions. These expressions have three
  17494. operands:
  17495. * The name of the predicate, as it will be referred to in
  17496. 'match_operand' or 'match_operator' expressions.
  17497. * An RTL expression which evaluates to true if the predicate allows
  17498. the operand OP, false if it does not. This expression can only use
  17499. the following RTL codes:
  17500. 'MATCH_OPERAND'
  17501. When written inside a predicate expression, a 'MATCH_OPERAND'
  17502. expression evaluates to true if the predicate it names would
  17503. allow OP. The operand number and constraint are ignored. Due
  17504. to limitations in 'genrecog', you can only refer to generic
  17505. predicates and predicates that have already been defined.
  17506. 'MATCH_CODE'
  17507. This expression evaluates to true if OP or a specified
  17508. subexpression of OP has one of a given list of RTX codes.
  17509. The first operand of this expression is a string constant
  17510. containing a comma-separated list of RTX code names (in lower
  17511. case). These are the codes for which the 'MATCH_CODE' will be
  17512. true.
  17513. The second operand is a string constant which indicates what
  17514. subexpression of OP to examine. If it is absent or the empty
  17515. string, OP itself is examined. Otherwise, the string constant
  17516. must be a sequence of digits and/or lowercase letters. Each
  17517. character indicates a subexpression to extract from the
  17518. current expression; for the first character this is OP, for
  17519. the second and subsequent characters it is the result of the
  17520. previous character. A digit N extracts 'XEXP (E, N)'; a
  17521. letter L extracts 'XVECEXP (E, 0, N)' where N is the
  17522. alphabetic ordinal of L (0 for 'a', 1 for 'b', and so on).
  17523. The 'MATCH_CODE' then examines the RTX code of the
  17524. subexpression extracted by the complete string. It is not
  17525. possible to extract components of an 'rtvec' that is not at
  17526. position 0 within its RTX object.
  17527. 'MATCH_TEST'
  17528. This expression has one operand, a string constant containing
  17529. a C expression. The predicate's arguments, OP and MODE, are
  17530. available with those names in the C expression. The
  17531. 'MATCH_TEST' evaluates to true if the C expression evaluates
  17532. to a nonzero value. 'MATCH_TEST' expressions must not have
  17533. side effects.
  17534. 'AND'
  17535. 'IOR'
  17536. 'NOT'
  17537. 'IF_THEN_ELSE'
  17538. The basic 'MATCH_' expressions can be combined using these
  17539. logical operators, which have the semantics of the C operators
  17540. '&&', '||', '!', and '? :' respectively. As in Common Lisp,
  17541. you may give an 'AND' or 'IOR' expression an arbitrary number
  17542. of arguments; this has exactly the same effect as writing a
  17543. chain of two-argument 'AND' or 'IOR' expressions.
  17544. * An optional block of C code, which should execute 'return true' if
  17545. the predicate is found to match and 'return false' if it does not.
  17546. It must not have any side effects. The predicate arguments, OP and
  17547. MODE, are available with those names.
  17548. If a code block is present in a predicate definition, then the RTL
  17549. expression must evaluate to true _and_ the code block must execute
  17550. 'return true' for the predicate to allow the operand. The RTL
  17551. expression is evaluated first; do not re-check anything in the code
  17552. block that was checked in the RTL expression.
  17553. The program 'genrecog' scans 'define_predicate' and
  17554. 'define_special_predicate' expressions to determine which RTX codes are
  17555. possibly allowed. You should always make this explicit in the RTL
  17556. predicate expression, using 'MATCH_OPERAND' and 'MATCH_CODE'.
  17557. Here is an example of a simple predicate definition, from the IA64
  17558. machine description:
  17559. ;; True if OP is a 'SYMBOL_REF' which refers to the sdata section.
  17560. (define_predicate "small_addr_symbolic_operand"
  17561. (and (match_code "symbol_ref")
  17562. (match_test "SYMBOL_REF_SMALL_ADDR_P (op)")))
  17563. And here is another, showing the use of the C block.
  17564. ;; True if OP is a register operand that is (or could be) a GR reg.
  17565. (define_predicate "gr_register_operand"
  17566. (match_operand 0 "register_operand")
  17567. {
  17568. unsigned int regno;
  17569. if (GET_CODE (op) == SUBREG)
  17570. op = SUBREG_REG (op);
  17571. regno = REGNO (op);
  17572. return (regno >= FIRST_PSEUDO_REGISTER || GENERAL_REGNO_P (regno));
  17573. })
  17574. Predicates written with 'define_predicate' automatically include a test
  17575. that MODE is 'VOIDmode', or OP has the same mode as MODE, or OP is a
  17576. 'CONST_INT' or 'CONST_DOUBLE'. They do _not_ check specifically for
  17577. integer 'CONST_DOUBLE', nor do they test that the value of either kind
  17578. of constant fits in the requested mode. This is because target-specific
  17579. predicates that take constants usually have to do more stringent value
  17580. checks anyway. If you need the exact same treatment of 'CONST_INT' or
  17581. 'CONST_DOUBLE' that the generic predicates provide, use a
  17582. 'MATCH_OPERAND' subexpression to call 'const_int_operand',
  17583. 'const_double_operand', or 'immediate_operand'.
  17584. Predicates written with 'define_special_predicate' do not get any
  17585. automatic mode checks, and are treated as having special mode handling
  17586. by 'genrecog'.
  17587. The program 'genpreds' is responsible for generating code to test
  17588. predicates. It also writes a header file containing function
  17589. declarations for all machine-specific predicates. It is not necessary
  17590. to declare these predicates in 'CPU-protos.h'.
  17591. 
  17592. File: gccint.info, Node: Constraints, Next: Standard Names, Prev: Predicates, Up: Machine Desc
  17593. 17.8 Operand Constraints
  17594. ========================
  17595. Each 'match_operand' in an instruction pattern can specify constraints
  17596. for the operands allowed. The constraints allow you to fine-tune
  17597. matching within the set of operands allowed by the predicate.
  17598. Constraints can say whether an operand may be in a register, and which
  17599. kinds of register; whether the operand can be a memory reference, and
  17600. which kinds of address; whether the operand may be an immediate
  17601. constant, and which possible values it may have. Constraints can also
  17602. require two operands to match. Side-effects aren't allowed in operands
  17603. of inline 'asm', unless '<' or '>' constraints are used, because there
  17604. is no guarantee that the side effects will happen exactly once in an
  17605. instruction that can update the addressing register.
  17606. * Menu:
  17607. * Simple Constraints:: Basic use of constraints.
  17608. * Multi-Alternative:: When an insn has two alternative constraint-patterns.
  17609. * Class Preferences:: Constraints guide which hard register to put things in.
  17610. * Modifiers:: More precise control over effects of constraints.
  17611. * Machine Constraints:: Existing constraints for some particular machines.
  17612. * Disable Insn Alternatives:: Disable insn alternatives using attributes.
  17613. * Define Constraints:: How to define machine-specific constraints.
  17614. * C Constraint Interface:: How to test constraints from C code.
  17615. 
  17616. File: gccint.info, Node: Simple Constraints, Next: Multi-Alternative, Up: Constraints
  17617. 17.8.1 Simple Constraints
  17618. -------------------------
  17619. The simplest kind of constraint is a string full of letters, each of
  17620. which describes one kind of operand that is permitted. Here are the
  17621. letters that are allowed:
  17622. whitespace
  17623. Whitespace characters are ignored and can be inserted at any
  17624. position except the first. This enables each alternative for
  17625. different operands to be visually aligned in the machine
  17626. description even if they have different number of constraints and
  17627. modifiers.
  17628. 'm'
  17629. A memory operand is allowed, with any kind of address that the
  17630. machine supports in general. Note that the letter used for the
  17631. general memory constraint can be re-defined by a back end using the
  17632. 'TARGET_MEM_CONSTRAINT' macro.
  17633. 'o'
  17634. A memory operand is allowed, but only if the address is
  17635. "offsettable". This means that adding a small integer (actually,
  17636. the width in bytes of the operand, as determined by its machine
  17637. mode) may be added to the address and the result is also a valid
  17638. memory address.
  17639. For example, an address which is constant is offsettable; so is an
  17640. address that is the sum of a register and a constant (as long as a
  17641. slightly larger constant is also within the range of
  17642. address-offsets supported by the machine); but an autoincrement or
  17643. autodecrement address is not offsettable. More complicated
  17644. indirect/indexed addresses may or may not be offsettable depending
  17645. on the other addressing modes that the machine supports.
  17646. Note that in an output operand which can be matched by another
  17647. operand, the constraint letter 'o' is valid only when accompanied
  17648. by both '<' (if the target machine has predecrement addressing) and
  17649. '>' (if the target machine has preincrement addressing).
  17650. 'V'
  17651. A memory operand that is not offsettable. In other words, anything
  17652. that would fit the 'm' constraint but not the 'o' constraint.
  17653. '<'
  17654. A memory operand with autodecrement addressing (either predecrement
  17655. or postdecrement) is allowed. In inline 'asm' this constraint is
  17656. only allowed if the operand is used exactly once in an instruction
  17657. that can handle the side effects. Not using an operand with '<' in
  17658. constraint string in the inline 'asm' pattern at all or using it in
  17659. multiple instructions isn't valid, because the side effects
  17660. wouldn't be performed or would be performed more than once.
  17661. Furthermore, on some targets the operand with '<' in constraint
  17662. string must be accompanied by special instruction suffixes like
  17663. '%U0' instruction suffix on PowerPC or '%P0' on IA-64.
  17664. '>'
  17665. A memory operand with autoincrement addressing (either preincrement
  17666. or postincrement) is allowed. In inline 'asm' the same
  17667. restrictions as for '<' apply.
  17668. 'r'
  17669. A register operand is allowed provided that it is in a general
  17670. register.
  17671. 'i'
  17672. An immediate integer operand (one with constant value) is allowed.
  17673. This includes symbolic constants whose values will be known only at
  17674. assembly time or later.
  17675. 'n'
  17676. An immediate integer operand with a known numeric value is allowed.
  17677. Many systems cannot support assembly-time constants for operands
  17678. less than a word wide. Constraints for these operands should use
  17679. 'n' rather than 'i'.
  17680. 'I', 'J', 'K', ... 'P'
  17681. Other letters in the range 'I' through 'P' may be defined in a
  17682. machine-dependent fashion to permit immediate integer operands with
  17683. explicit integer values in specified ranges. For example, on the
  17684. 68000, 'I' is defined to stand for the range of values 1 to 8.
  17685. This is the range permitted as a shift count in the shift
  17686. instructions.
  17687. 'E'
  17688. An immediate floating operand (expression code 'const_double') is
  17689. allowed, but only if the target floating point format is the same
  17690. as that of the host machine (on which the compiler is running).
  17691. 'F'
  17692. An immediate floating operand (expression code 'const_double' or
  17693. 'const_vector') is allowed.
  17694. 'G', 'H'
  17695. 'G' and 'H' may be defined in a machine-dependent fashion to permit
  17696. immediate floating operands in particular ranges of values.
  17697. 's'
  17698. An immediate integer operand whose value is not an explicit integer
  17699. is allowed.
  17700. This might appear strange; if an insn allows a constant operand
  17701. with a value not known at compile time, it certainly must allow any
  17702. known value. So why use 's' instead of 'i'? Sometimes it allows
  17703. better code to be generated.
  17704. For example, on the 68000 in a fullword instruction it is possible
  17705. to use an immediate operand; but if the immediate value is between
  17706. -128 and 127, better code results from loading the value into a
  17707. register and using the register. This is because the load into the
  17708. register can be done with a 'moveq' instruction. We arrange for
  17709. this to happen by defining the letter 'K' to mean "any integer
  17710. outside the range -128 to 127", and then specifying 'Ks' in the
  17711. operand constraints.
  17712. 'g'
  17713. Any register, memory or immediate integer operand is allowed,
  17714. except for registers that are not general registers.
  17715. 'X'
  17716. Any operand whatsoever is allowed, even if it does not satisfy
  17717. 'general_operand'. This is normally used in the constraint of a
  17718. 'match_scratch' when certain alternatives will not actually require
  17719. a scratch register.
  17720. '0', '1', '2', ... '9'
  17721. An operand that matches the specified operand number is allowed.
  17722. If a digit is used together with letters within the same
  17723. alternative, the digit should come last.
  17724. This number is allowed to be more than a single digit. If multiple
  17725. digits are encountered consecutively, they are interpreted as a
  17726. single decimal integer. There is scant chance for ambiguity, since
  17727. to-date it has never been desirable that '10' be interpreted as
  17728. matching either operand 1 _or_ operand 0. Should this be desired,
  17729. one can use multiple alternatives instead.
  17730. This is called a "matching constraint" and what it really means is
  17731. that the assembler has only a single operand that fills two roles
  17732. considered separate in the RTL insn. For example, an add insn has
  17733. two input operands and one output operand in the RTL, but on most
  17734. CISC machines an add instruction really has only two operands, one
  17735. of them an input-output operand:
  17736. addl #35,r12
  17737. Matching constraints are used in these circumstances. More
  17738. precisely, the two operands that match must include one input-only
  17739. operand and one output-only operand. Moreover, the digit must be a
  17740. smaller number than the number of the operand that uses it in the
  17741. constraint.
  17742. For operands to match in a particular case usually means that they
  17743. are identical-looking RTL expressions. But in a few special cases
  17744. specific kinds of dissimilarity are allowed. For example, '*x' as
  17745. an input operand will match '*x++' as an output operand. For
  17746. proper results in such cases, the output template should always use
  17747. the output-operand's number when printing the operand.
  17748. 'p'
  17749. An operand that is a valid memory address is allowed. This is for
  17750. "load address" and "push address" instructions.
  17751. 'p' in the constraint must be accompanied by 'address_operand' as
  17752. the predicate in the 'match_operand'. This predicate interprets
  17753. the mode specified in the 'match_operand' as the mode of the memory
  17754. reference for which the address would be valid.
  17755. OTHER-LETTERS
  17756. Other letters can be defined in machine-dependent fashion to stand
  17757. for particular classes of registers or other arbitrary operand
  17758. types. 'd', 'a' and 'f' are defined on the 68000/68020 to stand
  17759. for data, address and floating point registers.
  17760. In order to have valid assembler code, each operand must satisfy its
  17761. constraint. But a failure to do so does not prevent the pattern from
  17762. applying to an insn. Instead, it directs the compiler to modify the
  17763. code so that the constraint will be satisfied. Usually this is done by
  17764. copying an operand into a register.
  17765. Contrast, therefore, the two instruction patterns that follow:
  17766. (define_insn ""
  17767. [(set (match_operand:SI 0 "general_operand" "=r")
  17768. (plus:SI (match_dup 0)
  17769. (match_operand:SI 1 "general_operand" "r")))]
  17770. ""
  17771. "...")
  17772. which has two operands, one of which must appear in two places, and
  17773. (define_insn ""
  17774. [(set (match_operand:SI 0 "general_operand" "=r")
  17775. (plus:SI (match_operand:SI 1 "general_operand" "0")
  17776. (match_operand:SI 2 "general_operand" "r")))]
  17777. ""
  17778. "...")
  17779. which has three operands, two of which are required by a constraint to
  17780. be identical. If we are considering an insn of the form
  17781. (insn N PREV NEXT
  17782. (set (reg:SI 3)
  17783. (plus:SI (reg:SI 6) (reg:SI 109)))
  17784. ...)
  17785. the first pattern would not apply at all, because this insn does not
  17786. contain two identical subexpressions in the right place. The pattern
  17787. would say, "That does not look like an add instruction; try other
  17788. patterns". The second pattern would say, "Yes, that's an add
  17789. instruction, but there is something wrong with it". It would direct the
  17790. reload pass of the compiler to generate additional insns to make the
  17791. constraint true. The results might look like this:
  17792. (insn N2 PREV N
  17793. (set (reg:SI 3) (reg:SI 6))
  17794. ...)
  17795. (insn N N2 NEXT
  17796. (set (reg:SI 3)
  17797. (plus:SI (reg:SI 3) (reg:SI 109)))
  17798. ...)
  17799. It is up to you to make sure that each operand, in each pattern, has
  17800. constraints that can handle any RTL expression that could be present for
  17801. that operand. (When multiple alternatives are in use, each pattern
  17802. must, for each possible combination of operand expressions, have at
  17803. least one alternative which can handle that combination of operands.)
  17804. The constraints don't need to _allow_ any possible operand--when this is
  17805. the case, they do not constrain--but they must at least point the way to
  17806. reloading any possible operand so that it will fit.
  17807. * If the constraint accepts whatever operands the predicate permits,
  17808. there is no problem: reloading is never necessary for this operand.
  17809. For example, an operand whose constraints permit everything except
  17810. registers is safe provided its predicate rejects registers.
  17811. An operand whose predicate accepts only constant values is safe
  17812. provided its constraints include the letter 'i'. If any possible
  17813. constant value is accepted, then nothing less than 'i' will do; if
  17814. the predicate is more selective, then the constraints may also be
  17815. more selective.
  17816. * Any operand expression can be reloaded by copying it into a
  17817. register. So if an operand's constraints allow some kind of
  17818. register, it is certain to be safe. It need not permit all classes
  17819. of registers; the compiler knows how to copy a register into
  17820. another register of the proper class in order to make an
  17821. instruction valid.
  17822. * A nonoffsettable memory reference can be reloaded by copying the
  17823. address into a register. So if the constraint uses the letter 'o',
  17824. all memory references are taken care of.
  17825. * A constant operand can be reloaded by allocating space in memory to
  17826. hold it as preinitialized data. Then the memory reference can be
  17827. used in place of the constant. So if the constraint uses the
  17828. letters 'o' or 'm', constant operands are not a problem.
  17829. * If the constraint permits a constant and a pseudo register used in
  17830. an insn was not allocated to a hard register and is equivalent to a
  17831. constant, the register will be replaced with the constant. If the
  17832. predicate does not permit a constant and the insn is re-recognized
  17833. for some reason, the compiler will crash. Thus the predicate must
  17834. always recognize any objects allowed by the constraint.
  17835. If the operand's predicate can recognize registers, but the constraint
  17836. does not permit them, it can make the compiler crash. When this operand
  17837. happens to be a register, the reload pass will be stymied, because it
  17838. does not know how to copy a register temporarily into memory.
  17839. If the predicate accepts a unary operator, the constraint applies to
  17840. the operand. For example, the MIPS processor at ISA level 3 supports an
  17841. instruction which adds two registers in 'SImode' to produce a 'DImode'
  17842. result, but only if the registers are correctly sign extended. This
  17843. predicate for the input operands accepts a 'sign_extend' of an 'SImode'
  17844. register. Write the constraint to indicate the type of register that is
  17845. required for the operand of the 'sign_extend'.
  17846. 
  17847. File: gccint.info, Node: Multi-Alternative, Next: Class Preferences, Prev: Simple Constraints, Up: Constraints
  17848. 17.8.2 Multiple Alternative Constraints
  17849. ---------------------------------------
  17850. Sometimes a single instruction has multiple alternative sets of possible
  17851. operands. For example, on the 68000, a logical-or instruction can
  17852. combine register or an immediate value into memory, or it can combine
  17853. any kind of operand into a register; but it cannot combine one memory
  17854. location into another.
  17855. These constraints are represented as multiple alternatives. An
  17856. alternative can be described by a series of letters for each operand.
  17857. The overall constraint for an operand is made from the letters for this
  17858. operand from the first alternative, a comma, the letters for this
  17859. operand from the second alternative, a comma, and so on until the last
  17860. alternative. All operands for a single instruction must have the same
  17861. number of alternatives. Here is how it is done for fullword logical-or
  17862. on the 68000:
  17863. (define_insn "iorsi3"
  17864. [(set (match_operand:SI 0 "general_operand" "=m,d")
  17865. (ior:SI (match_operand:SI 1 "general_operand" "%0,0")
  17866. (match_operand:SI 2 "general_operand" "dKs,dmKs")))]
  17867. ...)
  17868. The first alternative has 'm' (memory) for operand 0, '0' for operand 1
  17869. (meaning it must match operand 0), and 'dKs' for operand 2. The second
  17870. alternative has 'd' (data register) for operand 0, '0' for operand 1,
  17871. and 'dmKs' for operand 2. The '=' and '%' in the constraints apply to
  17872. all the alternatives; their meaning is explained in the next section
  17873. (*note Class Preferences::).
  17874. If all the operands fit any one alternative, the instruction is valid.
  17875. Otherwise, for each alternative, the compiler counts how many
  17876. instructions must be added to copy the operands so that that alternative
  17877. applies. The alternative requiring the least copying is chosen. If two
  17878. alternatives need the same amount of copying, the one that comes first
  17879. is chosen. These choices can be altered with the '?' and '!'
  17880. characters:
  17881. '?'
  17882. Disparage slightly the alternative that the '?' appears in, as a
  17883. choice when no alternative applies exactly. The compiler regards
  17884. this alternative as one unit more costly for each '?' that appears
  17885. in it.
  17886. '!'
  17887. Disparage severely the alternative that the '!' appears in. This
  17888. alternative can still be used if it fits without reloading, but if
  17889. reloading is needed, some other alternative will be used.
  17890. '^'
  17891. This constraint is analogous to '?' but it disparages slightly the
  17892. alternative only if the operand with the '^' needs a reload.
  17893. '$'
  17894. This constraint is analogous to '!' but it disparages severely the
  17895. alternative only if the operand with the '$' needs a reload.
  17896. When an insn pattern has multiple alternatives in its constraints,
  17897. often the appearance of the assembler code is determined mostly by which
  17898. alternative was matched. When this is so, the C code for writing the
  17899. assembler code can use the variable 'which_alternative', which is the
  17900. ordinal number of the alternative that was actually satisfied (0 for the
  17901. first, 1 for the second alternative, etc.). *Note Output Statement::.
  17902. 
  17903. File: gccint.info, Node: Class Preferences, Next: Modifiers, Prev: Multi-Alternative, Up: Constraints
  17904. 17.8.3 Register Class Preferences
  17905. ---------------------------------
  17906. The operand constraints have another function: they enable the compiler
  17907. to decide which kind of hardware register a pseudo register is best
  17908. allocated to. The compiler examines the constraints that apply to the
  17909. insns that use the pseudo register, looking for the machine-dependent
  17910. letters such as 'd' and 'a' that specify classes of registers. The
  17911. pseudo register is put in whichever class gets the most "votes". The
  17912. constraint letters 'g' and 'r' also vote: they vote in favor of a
  17913. general register. The machine description says which registers are
  17914. considered general.
  17915. Of course, on some machines all registers are equivalent, and no
  17916. register classes are defined. Then none of this complexity is relevant.
  17917. 
  17918. File: gccint.info, Node: Modifiers, Next: Machine Constraints, Prev: Class Preferences, Up: Constraints
  17919. 17.8.4 Constraint Modifier Characters
  17920. -------------------------------------
  17921. Here are constraint modifier characters.
  17922. '='
  17923. Means that this operand is written to by this instruction: the
  17924. previous value is discarded and replaced by new data.
  17925. '+'
  17926. Means that this operand is both read and written by the
  17927. instruction.
  17928. When the compiler fixes up the operands to satisfy the constraints,
  17929. it needs to know which operands are read by the instruction and
  17930. which are written by it. '=' identifies an operand which is only
  17931. written; '+' identifies an operand that is both read and written;
  17932. all other operands are assumed to only be read.
  17933. If you specify '=' or '+' in a constraint, you put it in the first
  17934. character of the constraint string.
  17935. '&'
  17936. Means (in a particular alternative) that this operand is an
  17937. "earlyclobber" operand, which is written before the instruction is
  17938. finished using the input operands. Therefore, this operand may not
  17939. lie in a register that is read by the instruction or as part of any
  17940. memory address.
  17941. '&' applies only to the alternative in which it is written. In
  17942. constraints with multiple alternatives, sometimes one alternative
  17943. requires '&' while others do not. See, for example, the 'movdf'
  17944. insn of the 68000.
  17945. A operand which is read by the instruction can be tied to an
  17946. earlyclobber operand if its only use as an input occurs before the
  17947. early result is written. Adding alternatives of this form often
  17948. allows GCC to produce better code when only some of the read
  17949. operands can be affected by the earlyclobber. See, for example,
  17950. the 'mulsi3' insn of the ARM.
  17951. Furthermore, if the "earlyclobber" operand is also a read/write
  17952. operand, then that operand is written only after it's used.
  17953. '&' does not obviate the need to write '=' or '+'. As
  17954. "earlyclobber" operands are always written, a read-only
  17955. "earlyclobber" operand is ill-formed and will be rejected by the
  17956. compiler.
  17957. '%'
  17958. Declares the instruction to be commutative for this operand and the
  17959. following operand. This means that the compiler may interchange
  17960. the two operands if that is the cheapest way to make all operands
  17961. fit the constraints. '%' applies to all alternatives and must
  17962. appear as the first character in the constraint. Only read-only
  17963. operands can use '%'.
  17964. This is often used in patterns for addition instructions that
  17965. really have only two operands: the result must go in one of the
  17966. arguments. Here for example, is how the 68000 halfword-add
  17967. instruction is defined:
  17968. (define_insn "addhi3"
  17969. [(set (match_operand:HI 0 "general_operand" "=m,r")
  17970. (plus:HI (match_operand:HI 1 "general_operand" "%0,0")
  17971. (match_operand:HI 2 "general_operand" "di,g")))]
  17972. ...)
  17973. GCC can only handle one commutative pair in an asm; if you use
  17974. more, the compiler may fail. Note that you need not use the
  17975. modifier if the two alternatives are strictly identical; this would
  17976. only waste time in the reload pass. The modifier is not
  17977. operational after register allocation, so the result of
  17978. 'define_peephole2' and 'define_split's performed after reload
  17979. cannot rely on '%' to make the intended insn match.
  17980. '#'
  17981. Says that all following characters, up to the next comma, are to be
  17982. ignored as a constraint. They are significant only for choosing
  17983. register preferences.
  17984. '*'
  17985. Says that the following character should be ignored when choosing
  17986. register preferences. '*' has no effect on the meaning of the
  17987. constraint as a constraint, and no effect on reloading. For LRA
  17988. '*' additionally disparages slightly the alternative if the
  17989. following character matches the operand.
  17990. Here is an example: the 68000 has an instruction to sign-extend a
  17991. halfword in a data register, and can also sign-extend a value by
  17992. copying it into an address register. While either kind of register
  17993. is acceptable, the constraints on an address-register destination
  17994. are less strict, so it is best if register allocation makes an
  17995. address register its goal. Therefore, '*' is used so that the 'd'
  17996. constraint letter (for data register) is ignored when computing
  17997. register preferences.
  17998. (define_insn "extendhisi2"
  17999. [(set (match_operand:SI 0 "general_operand" "=*d,a")
  18000. (sign_extend:SI
  18001. (match_operand:HI 1 "general_operand" "0,g")))]
  18002. ...)
  18003. 
  18004. File: gccint.info, Node: Machine Constraints, Next: Disable Insn Alternatives, Prev: Modifiers, Up: Constraints
  18005. 17.8.5 Constraints for Particular Machines
  18006. ------------------------------------------
  18007. Whenever possible, you should use the general-purpose constraint letters
  18008. in 'asm' arguments, since they will convey meaning more readily to
  18009. people reading your code. Failing that, use the constraint letters that
  18010. usually have very similar meanings across architectures. The most
  18011. commonly used constraints are 'm' and 'r' (for memory and
  18012. general-purpose registers respectively; *note Simple Constraints::), and
  18013. 'I', usually the letter indicating the most common immediate-constant
  18014. format.
  18015. Each architecture defines additional constraints. These constraints
  18016. are used by the compiler itself for instruction generation, as well as
  18017. for 'asm' statements; therefore, some of the constraints are not
  18018. particularly useful for 'asm'. Here is a summary of some of the
  18019. machine-dependent constraints available on some particular machines; it
  18020. includes both constraints that are useful for 'asm' and constraints that
  18021. aren't. The compiler source file mentioned in the table heading for
  18022. each architecture is the definitive reference for the meanings of that
  18023. architecture's constraints.
  18024. _AArch64 family--'config/aarch64/constraints.md'_
  18025. 'k'
  18026. The stack pointer register ('SP')
  18027. 'w'
  18028. Floating point register, Advanced SIMD vector register or SVE
  18029. vector register
  18030. 'x'
  18031. Like 'w', but restricted to registers 0 to 15 inclusive.
  18032. 'y'
  18033. Like 'w', but restricted to registers 0 to 7 inclusive.
  18034. 'Upl'
  18035. One of the low eight SVE predicate registers ('P0' to 'P7')
  18036. 'Upa'
  18037. Any of the SVE predicate registers ('P0' to 'P15')
  18038. 'I'
  18039. Integer constant that is valid as an immediate operand in an
  18040. 'ADD' instruction
  18041. 'J'
  18042. Integer constant that is valid as an immediate operand in a
  18043. 'SUB' instruction (once negated)
  18044. 'K'
  18045. Integer constant that can be used with a 32-bit logical
  18046. instruction
  18047. 'L'
  18048. Integer constant that can be used with a 64-bit logical
  18049. instruction
  18050. 'M'
  18051. Integer constant that is valid as an immediate operand in a
  18052. 32-bit 'MOV' pseudo instruction. The 'MOV' may be assembled
  18053. to one of several different machine instructions depending on
  18054. the value
  18055. 'N'
  18056. Integer constant that is valid as an immediate operand in a
  18057. 64-bit 'MOV' pseudo instruction
  18058. 'S'
  18059. An absolute symbolic address or a label reference
  18060. 'Y'
  18061. Floating point constant zero
  18062. 'Z'
  18063. Integer constant zero
  18064. 'Ush'
  18065. The high part (bits 12 and upwards) of the pc-relative address
  18066. of a symbol within 4GB of the instruction
  18067. 'Q'
  18068. A memory address which uses a single base register with no
  18069. offset
  18070. 'Ump'
  18071. A memory address suitable for a load/store pair instruction in
  18072. SI, DI, SF and DF modes
  18073. _AMD GCN --'config/gcn/constraints.md'_
  18074. 'I'
  18075. Immediate integer in the range -16 to 64
  18076. 'J'
  18077. Immediate 16-bit signed integer
  18078. 'Kf'
  18079. Immediate constant -1
  18080. 'L'
  18081. Immediate 15-bit unsigned integer
  18082. 'A'
  18083. Immediate constant that can be inlined in an instruction
  18084. encoding: integer -16..64, or float 0.0, +/-0.5, +/-1.0,
  18085. +/-2.0, +/-4.0, 1.0/(2.0*PI)
  18086. 'B'
  18087. Immediate 32-bit signed integer that can be attached to an
  18088. instruction encoding
  18089. 'C'
  18090. Immediate 32-bit integer in range -16..4294967295 (i.e.
  18091. 32-bit unsigned integer or 'A' constraint)
  18092. 'DA'
  18093. Immediate 64-bit constant that can be split into two 'A'
  18094. constants
  18095. 'DB'
  18096. Immediate 64-bit constant that can be split into two 'B'
  18097. constants
  18098. 'U'
  18099. Any 'unspec'
  18100. 'Y'
  18101. Any 'symbol_ref' or 'label_ref'
  18102. 'v'
  18103. VGPR register
  18104. 'Sg'
  18105. SGPR register
  18106. 'SD'
  18107. SGPR registers valid for instruction destinations, including
  18108. VCC, M0 and EXEC
  18109. 'SS'
  18110. SGPR registers valid for instruction sources, including VCC,
  18111. M0, EXEC and SCC
  18112. 'Sm'
  18113. SGPR registers valid as a source for scalar memory
  18114. instructions (excludes M0 and EXEC)
  18115. 'Sv'
  18116. SGPR registers valid as a source or destination for vector
  18117. instructions (excludes EXEC)
  18118. 'ca'
  18119. All condition registers: SCC, VCCZ, EXECZ
  18120. 'cs'
  18121. Scalar condition register: SCC
  18122. 'cV'
  18123. Vector condition register: VCC, VCC_LO, VCC_HI
  18124. 'e'
  18125. EXEC register (EXEC_LO and EXEC_HI)
  18126. 'RB'
  18127. Memory operand with address space suitable for 'buffer_*'
  18128. instructions
  18129. 'RF'
  18130. Memory operand with address space suitable for 'flat_*'
  18131. instructions
  18132. 'RS'
  18133. Memory operand with address space suitable for 's_*'
  18134. instructions
  18135. 'RL'
  18136. Memory operand with address space suitable for 'ds_*' LDS
  18137. instructions
  18138. 'RG'
  18139. Memory operand with address space suitable for 'ds_*' GDS
  18140. instructions
  18141. 'RD'
  18142. Memory operand with address space suitable for any 'ds_*'
  18143. instructions
  18144. 'RM'
  18145. Memory operand with address space suitable for 'global_*'
  18146. instructions
  18147. _ARC --'config/arc/constraints.md'_
  18148. 'q'
  18149. Registers usable in ARCompact 16-bit instructions: 'r0'-'r3',
  18150. 'r12'-'r15'. This constraint can only match when the '-mq'
  18151. option is in effect.
  18152. 'e'
  18153. Registers usable as base-regs of memory addresses in ARCompact
  18154. 16-bit memory instructions: 'r0'-'r3', 'r12'-'r15', 'sp'.
  18155. This constraint can only match when the '-mq' option is in
  18156. effect.
  18157. 'D'
  18158. ARC FPX (dpfp) 64-bit registers. 'D0', 'D1'.
  18159. 'I'
  18160. A signed 12-bit integer constant.
  18161. 'Cal'
  18162. constant for arithmetic/logical operations. This might be any
  18163. constant that can be put into a long immediate by the assmbler
  18164. or linker without involving a PIC relocation.
  18165. 'K'
  18166. A 3-bit unsigned integer constant.
  18167. 'L'
  18168. A 6-bit unsigned integer constant.
  18169. 'CnL'
  18170. One's complement of a 6-bit unsigned integer constant.
  18171. 'CmL'
  18172. Two's complement of a 6-bit unsigned integer constant.
  18173. 'M'
  18174. A 5-bit unsigned integer constant.
  18175. 'O'
  18176. A 7-bit unsigned integer constant.
  18177. 'P'
  18178. A 8-bit unsigned integer constant.
  18179. 'H'
  18180. Any const_double value.
  18181. _ARM family--'config/arm/constraints.md'_
  18182. 'h'
  18183. In Thumb state, the core registers 'r8'-'r15'.
  18184. 'k'
  18185. The stack pointer register.
  18186. 'l'
  18187. In Thumb State the core registers 'r0'-'r7'. In ARM state
  18188. this is an alias for the 'r' constraint.
  18189. 't'
  18190. VFP floating-point registers 's0'-'s31'. Used for 32 bit
  18191. values.
  18192. 'w'
  18193. VFP floating-point registers 'd0'-'d31' and the appropriate
  18194. subset 'd0'-'d15' based on command line options. Used for 64
  18195. bit values only. Not valid for Thumb1.
  18196. 'y'
  18197. The iWMMX co-processor registers.
  18198. 'z'
  18199. The iWMMX GR registers.
  18200. 'G'
  18201. The floating-point constant 0.0
  18202. 'I'
  18203. Integer that is valid as an immediate operand in a data
  18204. processing instruction. That is, an integer in the range 0 to
  18205. 255 rotated by a multiple of 2
  18206. 'J'
  18207. Integer in the range -4095 to 4095
  18208. 'K'
  18209. Integer that satisfies constraint 'I' when inverted (ones
  18210. complement)
  18211. 'L'
  18212. Integer that satisfies constraint 'I' when negated (twos
  18213. complement)
  18214. 'M'
  18215. Integer in the range 0 to 32
  18216. 'Q'
  18217. A memory reference where the exact address is in a single
  18218. register (''m'' is preferable for 'asm' statements)
  18219. 'R'
  18220. An item in the constant pool
  18221. 'S'
  18222. A symbol in the text segment of the current file
  18223. 'Uv'
  18224. A memory reference suitable for VFP load/store insns
  18225. (reg+constant offset)
  18226. 'Uy'
  18227. A memory reference suitable for iWMMXt load/store
  18228. instructions.
  18229. 'Uq'
  18230. A memory reference suitable for the ARMv4 ldrsb instruction.
  18231. _AVR family--'config/avr/constraints.md'_
  18232. 'l'
  18233. Registers from r0 to r15
  18234. 'a'
  18235. Registers from r16 to r23
  18236. 'd'
  18237. Registers from r16 to r31
  18238. 'w'
  18239. Registers from r24 to r31. These registers can be used in
  18240. 'adiw' command
  18241. 'e'
  18242. Pointer register (r26-r31)
  18243. 'b'
  18244. Base pointer register (r28-r31)
  18245. 'q'
  18246. Stack pointer register (SPH:SPL)
  18247. 't'
  18248. Temporary register r0
  18249. 'x'
  18250. Register pair X (r27:r26)
  18251. 'y'
  18252. Register pair Y (r29:r28)
  18253. 'z'
  18254. Register pair Z (r31:r30)
  18255. 'I'
  18256. Constant greater than -1, less than 64
  18257. 'J'
  18258. Constant greater than -64, less than 1
  18259. 'K'
  18260. Constant integer 2
  18261. 'L'
  18262. Constant integer 0
  18263. 'M'
  18264. Constant that fits in 8 bits
  18265. 'N'
  18266. Constant integer -1
  18267. 'O'
  18268. Constant integer 8, 16, or 24
  18269. 'P'
  18270. Constant integer 1
  18271. 'G'
  18272. A floating point constant 0.0
  18273. 'Q'
  18274. A memory address based on Y or Z pointer with displacement.
  18275. _Blackfin family--'config/bfin/constraints.md'_
  18276. 'a'
  18277. P register
  18278. 'd'
  18279. D register
  18280. 'z'
  18281. A call clobbered P register.
  18282. 'qN'
  18283. A single register. If N is in the range 0 to 7, the
  18284. corresponding D register. If it is 'A', then the register P0.
  18285. 'D'
  18286. Even-numbered D register
  18287. 'W'
  18288. Odd-numbered D register
  18289. 'e'
  18290. Accumulator register.
  18291. 'A'
  18292. Even-numbered accumulator register.
  18293. 'B'
  18294. Odd-numbered accumulator register.
  18295. 'b'
  18296. I register
  18297. 'v'
  18298. B register
  18299. 'f'
  18300. M register
  18301. 'c'
  18302. Registers used for circular buffering, i.e. I, B, or L
  18303. registers.
  18304. 'C'
  18305. The CC register.
  18306. 't'
  18307. LT0 or LT1.
  18308. 'k'
  18309. LC0 or LC1.
  18310. 'u'
  18311. LB0 or LB1.
  18312. 'x'
  18313. Any D, P, B, M, I or L register.
  18314. 'y'
  18315. Additional registers typically used only in prologues and
  18316. epilogues: RETS, RETN, RETI, RETX, RETE, ASTAT, SEQSTAT and
  18317. USP.
  18318. 'w'
  18319. Any register except accumulators or CC.
  18320. 'Ksh'
  18321. Signed 16 bit integer (in the range -32768 to 32767)
  18322. 'Kuh'
  18323. Unsigned 16 bit integer (in the range 0 to 65535)
  18324. 'Ks7'
  18325. Signed 7 bit integer (in the range -64 to 63)
  18326. 'Ku7'
  18327. Unsigned 7 bit integer (in the range 0 to 127)
  18328. 'Ku5'
  18329. Unsigned 5 bit integer (in the range 0 to 31)
  18330. 'Ks4'
  18331. Signed 4 bit integer (in the range -8 to 7)
  18332. 'Ks3'
  18333. Signed 3 bit integer (in the range -3 to 4)
  18334. 'Ku3'
  18335. Unsigned 3 bit integer (in the range 0 to 7)
  18336. 'PN'
  18337. Constant N, where N is a single-digit constant in the range 0
  18338. to 4.
  18339. 'PA'
  18340. An integer equal to one of the MACFLAG_XXX constants that is
  18341. suitable for use with either accumulator.
  18342. 'PB'
  18343. An integer equal to one of the MACFLAG_XXX constants that is
  18344. suitable for use only with accumulator A1.
  18345. 'M1'
  18346. Constant 255.
  18347. 'M2'
  18348. Constant 65535.
  18349. 'J'
  18350. An integer constant with exactly a single bit set.
  18351. 'L'
  18352. An integer constant with all bits set except exactly one.
  18353. 'H'
  18354. 'Q'
  18355. Any SYMBOL_REF.
  18356. _CR16 Architecture--'config/cr16/cr16.h'_
  18357. 'b'
  18358. Registers from r0 to r14 (registers without stack pointer)
  18359. 't'
  18360. Register from r0 to r11 (all 16-bit registers)
  18361. 'p'
  18362. Register from r12 to r15 (all 32-bit registers)
  18363. 'I'
  18364. Signed constant that fits in 4 bits
  18365. 'J'
  18366. Signed constant that fits in 5 bits
  18367. 'K'
  18368. Signed constant that fits in 6 bits
  18369. 'L'
  18370. Unsigned constant that fits in 4 bits
  18371. 'M'
  18372. Signed constant that fits in 32 bits
  18373. 'N'
  18374. Check for 64 bits wide constants for add/sub instructions
  18375. 'G'
  18376. Floating point constant that is legal for store immediate
  18377. _C-SKY--'config/csky/constraints.md'_
  18378. 'a'
  18379. The mini registers r0 - r7.
  18380. 'b'
  18381. The low registers r0 - r15.
  18382. 'c'
  18383. C register.
  18384. 'y'
  18385. HI and LO registers.
  18386. 'l'
  18387. LO register.
  18388. 'h'
  18389. HI register.
  18390. 'v'
  18391. Vector registers.
  18392. 'z'
  18393. Stack pointer register (SP).
  18394. The C-SKY back end supports a large set of additional constraints
  18395. that are only useful for instruction selection or splitting rather
  18396. than inline asm, such as constraints representing constant integer
  18397. ranges accepted by particular instruction encodings. Refer to the
  18398. source code for details.
  18399. _Epiphany--'config/epiphany/constraints.md'_
  18400. 'U16'
  18401. An unsigned 16-bit constant.
  18402. 'K'
  18403. An unsigned 5-bit constant.
  18404. 'L'
  18405. A signed 11-bit constant.
  18406. 'Cm1'
  18407. A signed 11-bit constant added to -1. Can only match when the
  18408. '-m1reg-REG' option is active.
  18409. 'Cl1'
  18410. Left-shift of -1, i.e., a bit mask with a block of leading
  18411. ones, the rest being a block of trailing zeroes. Can only
  18412. match when the '-m1reg-REG' option is active.
  18413. 'Cr1'
  18414. Right-shift of -1, i.e., a bit mask with a trailing block of
  18415. ones, the rest being zeroes. Or to put it another way, one
  18416. less than a power of two. Can only match when the
  18417. '-m1reg-REG' option is active.
  18418. 'Cal'
  18419. Constant for arithmetic/logical operations. This is like 'i',
  18420. except that for position independent code, no symbols /
  18421. expressions needing relocations are allowed.
  18422. 'Csy'
  18423. Symbolic constant for call/jump instruction.
  18424. 'Rcs'
  18425. The register class usable in short insns. This is a register
  18426. class constraint, and can thus drive register allocation.
  18427. This constraint won't match unless '-mprefer-short-insn-regs'
  18428. is in effect.
  18429. 'Rsc'
  18430. The the register class of registers that can be used to hold a
  18431. sibcall call address. I.e., a caller-saved register.
  18432. 'Rct'
  18433. Core control register class.
  18434. 'Rgs'
  18435. The register group usable in short insns. This constraint
  18436. does not use a register class, so that it only passively
  18437. matches suitable registers, and doesn't drive register
  18438. allocation.
  18439. 'Car'
  18440. Constant suitable for the addsi3_r pattern. This is a valid
  18441. offset For byte, halfword, or word addressing.
  18442. 'Rra'
  18443. Matches the return address if it can be replaced with the link
  18444. register.
  18445. 'Rcc'
  18446. Matches the integer condition code register.
  18447. 'Sra'
  18448. Matches the return address if it is in a stack slot.
  18449. 'Cfm'
  18450. Matches control register values to switch fp mode, which are
  18451. encapsulated in 'UNSPEC_FP_MODE'.
  18452. _FRV--'config/frv/frv.h'_
  18453. 'a'
  18454. Register in the class 'ACC_REGS' ('acc0' to 'acc7').
  18455. 'b'
  18456. Register in the class 'EVEN_ACC_REGS' ('acc0' to 'acc7').
  18457. 'c'
  18458. Register in the class 'CC_REGS' ('fcc0' to 'fcc3' and 'icc0'
  18459. to 'icc3').
  18460. 'd'
  18461. Register in the class 'GPR_REGS' ('gr0' to 'gr63').
  18462. 'e'
  18463. Register in the class 'EVEN_REGS' ('gr0' to 'gr63'). Odd
  18464. registers are excluded not in the class but through the use of
  18465. a machine mode larger than 4 bytes.
  18466. 'f'
  18467. Register in the class 'FPR_REGS' ('fr0' to 'fr63').
  18468. 'h'
  18469. Register in the class 'FEVEN_REGS' ('fr0' to 'fr63'). Odd
  18470. registers are excluded not in the class but through the use of
  18471. a machine mode larger than 4 bytes.
  18472. 'l'
  18473. Register in the class 'LR_REG' (the 'lr' register).
  18474. 'q'
  18475. Register in the class 'QUAD_REGS' ('gr2' to 'gr63'). Register
  18476. numbers not divisible by 4 are excluded not in the class but
  18477. through the use of a machine mode larger than 8 bytes.
  18478. 't'
  18479. Register in the class 'ICC_REGS' ('icc0' to 'icc3').
  18480. 'u'
  18481. Register in the class 'FCC_REGS' ('fcc0' to 'fcc3').
  18482. 'v'
  18483. Register in the class 'ICR_REGS' ('cc4' to 'cc7').
  18484. 'w'
  18485. Register in the class 'FCR_REGS' ('cc0' to 'cc3').
  18486. 'x'
  18487. Register in the class 'QUAD_FPR_REGS' ('fr0' to 'fr63').
  18488. Register numbers not divisible by 4 are excluded not in the
  18489. class but through the use of a machine mode larger than 8
  18490. bytes.
  18491. 'z'
  18492. Register in the class 'SPR_REGS' ('lcr' and 'lr').
  18493. 'A'
  18494. Register in the class 'QUAD_ACC_REGS' ('acc0' to 'acc7').
  18495. 'B'
  18496. Register in the class 'ACCG_REGS' ('accg0' to 'accg7').
  18497. 'C'
  18498. Register in the class 'CR_REGS' ('cc0' to 'cc7').
  18499. 'G'
  18500. Floating point constant zero
  18501. 'I'
  18502. 6-bit signed integer constant
  18503. 'J'
  18504. 10-bit signed integer constant
  18505. 'L'
  18506. 16-bit signed integer constant
  18507. 'M'
  18508. 16-bit unsigned integer constant
  18509. 'N'
  18510. 12-bit signed integer constant that is negative--i.e. in the
  18511. range of -2048 to -1
  18512. 'O'
  18513. Constant zero
  18514. 'P'
  18515. 12-bit signed integer constant that is greater than zero--i.e.
  18516. in the range of 1 to 2047.
  18517. _FT32--'config/ft32/constraints.md'_
  18518. 'A'
  18519. An absolute address
  18520. 'B'
  18521. An offset address
  18522. 'W'
  18523. A register indirect memory operand
  18524. 'e'
  18525. An offset address.
  18526. 'f'
  18527. An offset address.
  18528. 'O'
  18529. The constant zero or one
  18530. 'I'
  18531. A 16-bit signed constant (-32768 ... 32767)
  18532. 'w'
  18533. A bitfield mask suitable for bext or bins
  18534. 'x'
  18535. An inverted bitfield mask suitable for bext or bins
  18536. 'L'
  18537. A 16-bit unsigned constant, multiple of 4 (0 ... 65532)
  18538. 'S'
  18539. A 20-bit signed constant (-524288 ... 524287)
  18540. 'b'
  18541. A constant for a bitfield width (1 ... 16)
  18542. 'KA'
  18543. A 10-bit signed constant (-512 ... 511)
  18544. _Hewlett-Packard PA-RISC--'config/pa/pa.h'_
  18545. 'a'
  18546. General register 1
  18547. 'f'
  18548. Floating point register
  18549. 'q'
  18550. Shift amount register
  18551. 'x'
  18552. Floating point register (deprecated)
  18553. 'y'
  18554. Upper floating point register (32-bit), floating point
  18555. register (64-bit)
  18556. 'Z'
  18557. Any register
  18558. 'I'
  18559. Signed 11-bit integer constant
  18560. 'J'
  18561. Signed 14-bit integer constant
  18562. 'K'
  18563. Integer constant that can be deposited with a 'zdepi'
  18564. instruction
  18565. 'L'
  18566. Signed 5-bit integer constant
  18567. 'M'
  18568. Integer constant 0
  18569. 'N'
  18570. Integer constant that can be loaded with a 'ldil' instruction
  18571. 'O'
  18572. Integer constant whose value plus one is a power of 2
  18573. 'P'
  18574. Integer constant that can be used for 'and' operations in
  18575. 'depi' and 'extru' instructions
  18576. 'S'
  18577. Integer constant 31
  18578. 'U'
  18579. Integer constant 63
  18580. 'G'
  18581. Floating-point constant 0.0
  18582. 'A'
  18583. A 'lo_sum' data-linkage-table memory operand
  18584. 'Q'
  18585. A memory operand that can be used as the destination operand
  18586. of an integer store instruction
  18587. 'R'
  18588. A scaled or unscaled indexed memory operand
  18589. 'T'
  18590. A memory operand for floating-point loads and stores
  18591. 'W'
  18592. A register indirect memory operand
  18593. _Intel IA-64--'config/ia64/ia64.h'_
  18594. 'a'
  18595. General register 'r0' to 'r3' for 'addl' instruction
  18596. 'b'
  18597. Branch register
  18598. 'c'
  18599. Predicate register ('c' as in "conditional")
  18600. 'd'
  18601. Application register residing in M-unit
  18602. 'e'
  18603. Application register residing in I-unit
  18604. 'f'
  18605. Floating-point register
  18606. 'm'
  18607. Memory operand. If used together with '<' or '>', the operand
  18608. can have postincrement and postdecrement which require
  18609. printing with '%Pn' on IA-64.
  18610. 'G'
  18611. Floating-point constant 0.0 or 1.0
  18612. 'I'
  18613. 14-bit signed integer constant
  18614. 'J'
  18615. 22-bit signed integer constant
  18616. 'K'
  18617. 8-bit signed integer constant for logical instructions
  18618. 'L'
  18619. 8-bit adjusted signed integer constant for compare pseudo-ops
  18620. 'M'
  18621. 6-bit unsigned integer constant for shift counts
  18622. 'N'
  18623. 9-bit signed integer constant for load and store
  18624. postincrements
  18625. 'O'
  18626. The constant zero
  18627. 'P'
  18628. 0 or -1 for 'dep' instruction
  18629. 'Q'
  18630. Non-volatile memory for floating-point loads and stores
  18631. 'R'
  18632. Integer constant in the range 1 to 4 for 'shladd' instruction
  18633. 'S'
  18634. Memory operand except postincrement and postdecrement. This
  18635. is now roughly the same as 'm' when not used together with '<'
  18636. or '>'.
  18637. _M32C--'config/m32c/m32c.c'_
  18638. 'Rsp'
  18639. 'Rfb'
  18640. 'Rsb'
  18641. '$sp', '$fb', '$sb'.
  18642. 'Rcr'
  18643. Any control register, when they're 16 bits wide (nothing if
  18644. control registers are 24 bits wide)
  18645. 'Rcl'
  18646. Any control register, when they're 24 bits wide.
  18647. 'R0w'
  18648. 'R1w'
  18649. 'R2w'
  18650. 'R3w'
  18651. $r0, $r1, $r2, $r3.
  18652. 'R02'
  18653. $r0 or $r2, or $r2r0 for 32 bit values.
  18654. 'R13'
  18655. $r1 or $r3, or $r3r1 for 32 bit values.
  18656. 'Rdi'
  18657. A register that can hold a 64 bit value.
  18658. 'Rhl'
  18659. $r0 or $r1 (registers with addressable high/low bytes)
  18660. 'R23'
  18661. $r2 or $r3
  18662. 'Raa'
  18663. Address registers
  18664. 'Raw'
  18665. Address registers when they're 16 bits wide.
  18666. 'Ral'
  18667. Address registers when they're 24 bits wide.
  18668. 'Rqi'
  18669. Registers that can hold QI values.
  18670. 'Rad'
  18671. Registers that can be used with displacements ($a0, $a1, $sb).
  18672. 'Rsi'
  18673. Registers that can hold 32 bit values.
  18674. 'Rhi'
  18675. Registers that can hold 16 bit values.
  18676. 'Rhc'
  18677. Registers chat can hold 16 bit values, including all control
  18678. registers.
  18679. 'Rra'
  18680. $r0 through R1, plus $a0 and $a1.
  18681. 'Rfl'
  18682. The flags register.
  18683. 'Rmm'
  18684. The memory-based pseudo-registers $mem0 through $mem15.
  18685. 'Rpi'
  18686. Registers that can hold pointers (16 bit registers for r8c,
  18687. m16c; 24 bit registers for m32cm, m32c).
  18688. 'Rpa'
  18689. Matches multiple registers in a PARALLEL to form a larger
  18690. register. Used to match function return values.
  18691. 'Is3'
  18692. -8 ... 7
  18693. 'IS1'
  18694. -128 ... 127
  18695. 'IS2'
  18696. -32768 ... 32767
  18697. 'IU2'
  18698. 0 ... 65535
  18699. 'In4'
  18700. -8 ... -1 or 1 ... 8
  18701. 'In5'
  18702. -16 ... -1 or 1 ... 16
  18703. 'In6'
  18704. -32 ... -1 or 1 ... 32
  18705. 'IM2'
  18706. -65536 ... -1
  18707. 'Ilb'
  18708. An 8 bit value with exactly one bit set.
  18709. 'Ilw'
  18710. A 16 bit value with exactly one bit set.
  18711. 'Sd'
  18712. The common src/dest memory addressing modes.
  18713. 'Sa'
  18714. Memory addressed using $a0 or $a1.
  18715. 'Si'
  18716. Memory addressed with immediate addresses.
  18717. 'Ss'
  18718. Memory addressed using the stack pointer ($sp).
  18719. 'Sf'
  18720. Memory addressed using the frame base register ($fb).
  18721. 'Ss'
  18722. Memory addressed using the small base register ($sb).
  18723. 'S1'
  18724. $r1h
  18725. _MicroBlaze--'config/microblaze/constraints.md'_
  18726. 'd'
  18727. A general register ('r0' to 'r31').
  18728. 'z'
  18729. A status register ('rmsr', '$fcc1' to '$fcc7').
  18730. _MIPS--'config/mips/constraints.md'_
  18731. 'd'
  18732. A general-purpose register. This is equivalent to 'r' unless
  18733. generating MIPS16 code, in which case the MIPS16 register set
  18734. is used.
  18735. 'f'
  18736. A floating-point register (if available).
  18737. 'h'
  18738. Formerly the 'hi' register. This constraint is no longer
  18739. supported.
  18740. 'l'
  18741. The 'lo' register. Use this register to store values that are
  18742. no bigger than a word.
  18743. 'x'
  18744. The concatenated 'hi' and 'lo' registers. Use this register
  18745. to store doubleword values.
  18746. 'c'
  18747. A register suitable for use in an indirect jump. This will
  18748. always be '$25' for '-mabicalls'.
  18749. 'v'
  18750. Register '$3'. Do not use this constraint in new code; it is
  18751. retained only for compatibility with glibc.
  18752. 'y'
  18753. Equivalent to 'r'; retained for backwards compatibility.
  18754. 'z'
  18755. A floating-point condition code register.
  18756. 'I'
  18757. A signed 16-bit constant (for arithmetic instructions).
  18758. 'J'
  18759. Integer zero.
  18760. 'K'
  18761. An unsigned 16-bit constant (for logic instructions).
  18762. 'L'
  18763. A signed 32-bit constant in which the lower 16 bits are zero.
  18764. Such constants can be loaded using 'lui'.
  18765. 'M'
  18766. A constant that cannot be loaded using 'lui', 'addiu' or
  18767. 'ori'.
  18768. 'N'
  18769. A constant in the range -65535 to -1 (inclusive).
  18770. 'O'
  18771. A signed 15-bit constant.
  18772. 'P'
  18773. A constant in the range 1 to 65535 (inclusive).
  18774. 'G'
  18775. Floating-point zero.
  18776. 'R'
  18777. An address that can be used in a non-macro load or store.
  18778. 'ZC'
  18779. A memory operand whose address is formed by a base register
  18780. and offset that is suitable for use in instructions with the
  18781. same addressing mode as 'll' and 'sc'.
  18782. 'ZD'
  18783. An address suitable for a 'prefetch' instruction, or for any
  18784. other instruction with the same addressing mode as 'prefetch'.
  18785. _Motorola 680x0--'config/m68k/constraints.md'_
  18786. 'a'
  18787. Address register
  18788. 'd'
  18789. Data register
  18790. 'f'
  18791. 68881 floating-point register, if available
  18792. 'I'
  18793. Integer in the range 1 to 8
  18794. 'J'
  18795. 16-bit signed number
  18796. 'K'
  18797. Signed number whose magnitude is greater than 0x80
  18798. 'L'
  18799. Integer in the range -8 to -1
  18800. 'M'
  18801. Signed number whose magnitude is greater than 0x100
  18802. 'N'
  18803. Range 24 to 31, rotatert:SI 8 to 1 expressed as rotate
  18804. 'O'
  18805. 16 (for rotate using swap)
  18806. 'P'
  18807. Range 8 to 15, rotatert:HI 8 to 1 expressed as rotate
  18808. 'R'
  18809. Numbers that mov3q can handle
  18810. 'G'
  18811. Floating point constant that is not a 68881 constant
  18812. 'S'
  18813. Operands that satisfy 'm' when -mpcrel is in effect
  18814. 'T'
  18815. Operands that satisfy 's' when -mpcrel is not in effect
  18816. 'Q'
  18817. Address register indirect addressing mode
  18818. 'U'
  18819. Register offset addressing
  18820. 'W'
  18821. const_call_operand
  18822. 'Cs'
  18823. symbol_ref or const
  18824. 'Ci'
  18825. const_int
  18826. 'C0'
  18827. const_int 0
  18828. 'Cj'
  18829. Range of signed numbers that don't fit in 16 bits
  18830. 'Cmvq'
  18831. Integers valid for mvq
  18832. 'Capsw'
  18833. Integers valid for a moveq followed by a swap
  18834. 'Cmvz'
  18835. Integers valid for mvz
  18836. 'Cmvs'
  18837. Integers valid for mvs
  18838. 'Ap'
  18839. push_operand
  18840. 'Ac'
  18841. Non-register operands allowed in clr
  18842. _Moxie--'config/moxie/constraints.md'_
  18843. 'A'
  18844. An absolute address
  18845. 'B'
  18846. An offset address
  18847. 'W'
  18848. A register indirect memory operand
  18849. 'I'
  18850. A constant in the range of 0 to 255.
  18851. 'N'
  18852. A constant in the range of 0 to -255.
  18853. _MSP430-'config/msp430/constraints.md'_
  18854. 'R12'
  18855. Register R12.
  18856. 'R13'
  18857. Register R13.
  18858. 'K'
  18859. Integer constant 1.
  18860. 'L'
  18861. Integer constant -1^20..1^19.
  18862. 'M'
  18863. Integer constant 1-4.
  18864. 'Ya'
  18865. Memory references which do not require an extended MOVX
  18866. instruction.
  18867. 'Yl'
  18868. Memory reference, labels only.
  18869. 'Ys'
  18870. Memory reference, stack only.
  18871. _NDS32--'config/nds32/constraints.md'_
  18872. 'w'
  18873. LOW register class $r0 to $r7 constraint for V3/V3M ISA.
  18874. 'l'
  18875. LOW register class $r0 to $r7.
  18876. 'd'
  18877. MIDDLE register class $r0 to $r11, $r16 to $r19.
  18878. 'h'
  18879. HIGH register class $r12 to $r14, $r20 to $r31.
  18880. 't'
  18881. Temporary assist register $ta (i.e. $r15).
  18882. 'k'
  18883. Stack register $sp.
  18884. 'Iu03'
  18885. Unsigned immediate 3-bit value.
  18886. 'In03'
  18887. Negative immediate 3-bit value in the range of -7-0.
  18888. 'Iu04'
  18889. Unsigned immediate 4-bit value.
  18890. 'Is05'
  18891. Signed immediate 5-bit value.
  18892. 'Iu05'
  18893. Unsigned immediate 5-bit value.
  18894. 'In05'
  18895. Negative immediate 5-bit value in the range of -31-0.
  18896. 'Ip05'
  18897. Unsigned immediate 5-bit value for movpi45 instruction with
  18898. range 16-47.
  18899. 'Iu06'
  18900. Unsigned immediate 6-bit value constraint for addri36.sp
  18901. instruction.
  18902. 'Iu08'
  18903. Unsigned immediate 8-bit value.
  18904. 'Iu09'
  18905. Unsigned immediate 9-bit value.
  18906. 'Is10'
  18907. Signed immediate 10-bit value.
  18908. 'Is11'
  18909. Signed immediate 11-bit value.
  18910. 'Is15'
  18911. Signed immediate 15-bit value.
  18912. 'Iu15'
  18913. Unsigned immediate 15-bit value.
  18914. 'Ic15'
  18915. A constant which is not in the range of imm15u but ok for bclr
  18916. instruction.
  18917. 'Ie15'
  18918. A constant which is not in the range of imm15u but ok for bset
  18919. instruction.
  18920. 'It15'
  18921. A constant which is not in the range of imm15u but ok for btgl
  18922. instruction.
  18923. 'Ii15'
  18924. A constant whose compliment value is in the range of imm15u
  18925. and ok for bitci instruction.
  18926. 'Is16'
  18927. Signed immediate 16-bit value.
  18928. 'Is17'
  18929. Signed immediate 17-bit value.
  18930. 'Is19'
  18931. Signed immediate 19-bit value.
  18932. 'Is20'
  18933. Signed immediate 20-bit value.
  18934. 'Ihig'
  18935. The immediate value that can be simply set high 20-bit.
  18936. 'Izeb'
  18937. The immediate value 0xff.
  18938. 'Izeh'
  18939. The immediate value 0xffff.
  18940. 'Ixls'
  18941. The immediate value 0x01.
  18942. 'Ix11'
  18943. The immediate value 0x7ff.
  18944. 'Ibms'
  18945. The immediate value with power of 2.
  18946. 'Ifex'
  18947. The immediate value with power of 2 minus 1.
  18948. 'U33'
  18949. Memory constraint for 333 format.
  18950. 'U45'
  18951. Memory constraint for 45 format.
  18952. 'U37'
  18953. Memory constraint for 37 format.
  18954. _Nios II family--'config/nios2/constraints.md'_
  18955. 'I'
  18956. Integer that is valid as an immediate operand in an
  18957. instruction taking a signed 16-bit number. Range -32768 to
  18958. 32767.
  18959. 'J'
  18960. Integer that is valid as an immediate operand in an
  18961. instruction taking an unsigned 16-bit number. Range 0 to
  18962. 65535.
  18963. 'K'
  18964. Integer that is valid as an immediate operand in an
  18965. instruction taking only the upper 16-bits of a 32-bit number.
  18966. Range 32-bit numbers with the lower 16-bits being 0.
  18967. 'L'
  18968. Integer that is valid as an immediate operand for a shift
  18969. instruction. Range 0 to 31.
  18970. 'M'
  18971. Integer that is valid as an immediate operand for only the
  18972. value 0. Can be used in conjunction with the format modifier
  18973. 'z' to use 'r0' instead of '0' in the assembly output.
  18974. 'N'
  18975. Integer that is valid as an immediate operand for a custom
  18976. instruction opcode. Range 0 to 255.
  18977. 'P'
  18978. An immediate operand for R2 andchi/andci instructions.
  18979. 'S'
  18980. Matches immediates which are addresses in the small data
  18981. section and therefore can be added to 'gp' as a 16-bit
  18982. immediate to re-create their 32-bit value.
  18983. 'U'
  18984. Matches constants suitable as an operand for the rdprs and
  18985. cache instructions.
  18986. 'v'
  18987. A memory operand suitable for Nios II R2 load/store exclusive
  18988. instructions.
  18989. 'w'
  18990. A memory operand suitable for load/store IO and cache
  18991. instructions.
  18992. 'T'
  18993. A 'const' wrapped 'UNSPEC' expression, representing a
  18994. supported PIC or TLS relocation.
  18995. _OpenRISC--'config/or1k/constraints.md'_
  18996. 'I'
  18997. Integer that is valid as an immediate operand in an
  18998. instruction taking a signed 16-bit number. Range -32768 to
  18999. 32767.
  19000. 'K'
  19001. Integer that is valid as an immediate operand in an
  19002. instruction taking an unsigned 16-bit number. Range 0 to
  19003. 65535.
  19004. 'M'
  19005. Signed 16-bit constant shifted left 16 bits. (Used with
  19006. 'l.movhi')
  19007. 'O'
  19008. Zero
  19009. 'c'
  19010. Register usable for sibcalls.
  19011. _PDP-11--'config/pdp11/constraints.md'_
  19012. 'a'
  19013. Floating point registers AC0 through AC3. These can be loaded
  19014. from/to memory with a single instruction.
  19015. 'd'
  19016. Odd numbered general registers (R1, R3, R5). These are used
  19017. for 16-bit multiply operations.
  19018. 'D'
  19019. A memory reference that is encoded within the opcode, but not
  19020. auto-increment or auto-decrement.
  19021. 'f'
  19022. Any of the floating point registers (AC0 through AC5).
  19023. 'G'
  19024. Floating point constant 0.
  19025. 'h'
  19026. Floating point registers AC4 and AC5. These cannot be loaded
  19027. from/to memory with a single instruction.
  19028. 'I'
  19029. An integer constant that fits in 16 bits.
  19030. 'J'
  19031. An integer constant whose low order 16 bits are zero.
  19032. 'K'
  19033. An integer constant that does not meet the constraints for
  19034. codes 'I' or 'J'.
  19035. 'L'
  19036. The integer constant 1.
  19037. 'M'
  19038. The integer constant -1.
  19039. 'N'
  19040. The integer constant 0.
  19041. 'O'
  19042. Integer constants 0 through 3; shifts by these amounts are
  19043. handled as multiple single-bit shifts rather than a single
  19044. variable-length shift.
  19045. 'Q'
  19046. A memory reference which requires an additional word (address
  19047. or offset) after the opcode.
  19048. 'R'
  19049. A memory reference that is encoded within the opcode.
  19050. _PowerPC and IBM RS6000--'config/rs6000/constraints.md'_
  19051. 'r'
  19052. A general purpose register (GPR), 'r0'...'r31'.
  19053. 'b'
  19054. A base register. Like 'r', but 'r0' is not allowed, so
  19055. 'r1'...'r31'.
  19056. 'f'
  19057. A floating point register (FPR), 'f0'...'f31'.
  19058. 'd'
  19059. A floating point register. This is the same as 'f' nowadays;
  19060. historically 'f' was for single-precision and 'd' was for
  19061. double-precision floating point.
  19062. 'v'
  19063. An Altivec vector register (VR), 'v0'...'v31'.
  19064. 'wa'
  19065. A VSX register (VSR), 'vs0'...'vs63'. This is either an FPR
  19066. ('vs0'...'vs31' are 'f0'...'f31') or a VR ('vs32'...'vs63' are
  19067. 'v0'...'v31').
  19068. When using 'wa', you should use the '%x' output modifier, so
  19069. that the correct register number is printed. For example:
  19070. asm ("xvadddp %x0,%x1,%x2"
  19071. : "=wa" (v1)
  19072. : "wa" (v2), "wa" (v3));
  19073. You should not use '%x' for 'v' operands:
  19074. asm ("xsaddqp %0,%1,%2"
  19075. : "=v" (v1)
  19076. : "v" (v2), "v" (v3));
  19077. 'h'
  19078. A special register ('vrsave', 'ctr', or 'lr').
  19079. 'c'
  19080. The count register, 'ctr'.
  19081. 'l'
  19082. The link register, 'lr'.
  19083. 'x'
  19084. Condition register field 0, 'cr0'.
  19085. 'y'
  19086. Any condition register field, 'cr0'...'cr7'.
  19087. 'z'
  19088. The carry bit, 'XER[CA]'.
  19089. 'we'
  19090. Like 'wa', if '-mpower9-vector' and '-m64' are used;
  19091. otherwise, 'NO_REGS'.
  19092. 'wn'
  19093. No register ('NO_REGS').
  19094. 'wr'
  19095. Like 'r', if '-mpowerpc64' is used; otherwise, 'NO_REGS'.
  19096. 'wx'
  19097. Like 'd', if '-mpowerpc-gfxopt' is used; otherwise, 'NO_REGS'.
  19098. 'wA'
  19099. Like 'b', if '-mpowerpc64' is used; otherwise, 'NO_REGS'.
  19100. 'wB'
  19101. Signed 5-bit constant integer that can be loaded into an
  19102. Altivec register.
  19103. 'wD'
  19104. Int constant that is the element number of the 64-bit scalar
  19105. in a vector.
  19106. 'wE'
  19107. Vector constant that can be loaded with the XXSPLTIB
  19108. instruction.
  19109. 'wF'
  19110. Memory operand suitable for power8 GPR load fusion.
  19111. 'wL'
  19112. Int constant that is the element number mfvsrld accesses in a
  19113. vector.
  19114. 'wM'
  19115. Match vector constant with all 1's if the XXLORC instruction
  19116. is available.
  19117. 'wO'
  19118. Memory operand suitable for the ISA 3.0 vector d-form
  19119. instructions.
  19120. 'wQ'
  19121. Memory operand suitable for the load/store quad instructions.
  19122. 'wS'
  19123. Vector constant that can be loaded with XXSPLTIB & sign
  19124. extension.
  19125. 'wY'
  19126. A memory operand for a DS-form instruction.
  19127. 'wZ'
  19128. An indexed or indirect memory operand, ignoring the bottom 4
  19129. bits.
  19130. 'I'
  19131. A signed 16-bit constant.
  19132. 'J'
  19133. An unsigned 16-bit constant shifted left 16 bits (use 'L'
  19134. instead for 'SImode' constants).
  19135. 'K'
  19136. An unsigned 16-bit constant.
  19137. 'L'
  19138. A signed 16-bit constant shifted left 16 bits.
  19139. 'M'
  19140. An integer constant greater than 31.
  19141. 'N'
  19142. An exact power of 2.
  19143. 'O'
  19144. The integer constant zero.
  19145. 'P'
  19146. A constant whose negation is a signed 16-bit constant.
  19147. 'eI'
  19148. A signed 34-bit integer constant if prefixed instructions are
  19149. supported.
  19150. 'G'
  19151. A floating point constant that can be loaded into a register
  19152. with one instruction per word.
  19153. 'H'
  19154. A floating point constant that can be loaded into a register
  19155. using three instructions.
  19156. 'm'
  19157. A memory operand. Normally, 'm' does not allow addresses that
  19158. update the base register. If the '<' or '>' constraint is
  19159. also used, they are allowed and therefore on PowerPC targets
  19160. in that case it is only safe to use 'm<>' in an 'asm'
  19161. statement if that 'asm' statement accesses the operand exactly
  19162. once. The 'asm' statement must also use '%U<OPNO>' as a
  19163. placeholder for the "update" flag in the corresponding load or
  19164. store instruction. For example:
  19165. asm ("st%U0 %1,%0" : "=m<>" (mem) : "r" (val));
  19166. is correct but:
  19167. asm ("st %1,%0" : "=m<>" (mem) : "r" (val));
  19168. is not.
  19169. 'es'
  19170. A "stable" memory operand; that is, one which does not include
  19171. any automodification of the base register. This used to be
  19172. useful when 'm' allowed automodification of the base register,
  19173. but as those are now only allowed when '<' or '>' is used,
  19174. 'es' is basically the same as 'm' without '<' and '>'.
  19175. 'Q'
  19176. A memory operand addressed by just a base register.
  19177. 'Y'
  19178. A memory operand for a DQ-form instruction.
  19179. 'Z'
  19180. A memory operand accessed with indexed or indirect addressing.
  19181. 'R'
  19182. An AIX TOC entry.
  19183. 'a'
  19184. An indexed or indirect address.
  19185. 'U'
  19186. A V.4 small data reference.
  19187. 'W'
  19188. A vector constant that does not require memory.
  19189. 'j'
  19190. The zero vector constant.
  19191. _PRU--'config/pru/constraints.md'_
  19192. 'I'
  19193. An unsigned 8-bit integer constant.
  19194. 'J'
  19195. An unsigned 16-bit integer constant.
  19196. 'L'
  19197. An unsigned 5-bit integer constant (for shift counts).
  19198. 'T'
  19199. A text segment (program memory) constant label.
  19200. 'Z'
  19201. Integer constant zero.
  19202. _RL78--'config/rl78/constraints.md'_
  19203. 'Int3'
  19204. An integer constant in the range 1 ... 7.
  19205. 'Int8'
  19206. An integer constant in the range 0 ... 255.
  19207. 'J'
  19208. An integer constant in the range -255 ... 0
  19209. 'K'
  19210. The integer constant 1.
  19211. 'L'
  19212. The integer constant -1.
  19213. 'M'
  19214. The integer constant 0.
  19215. 'N'
  19216. The integer constant 2.
  19217. 'O'
  19218. The integer constant -2.
  19219. 'P'
  19220. An integer constant in the range 1 ... 15.
  19221. 'Qbi'
  19222. The built-in compare types-eq, ne, gtu, ltu, geu, and leu.
  19223. 'Qsc'
  19224. The synthetic compare types-gt, lt, ge, and le.
  19225. 'Wab'
  19226. A memory reference with an absolute address.
  19227. 'Wbc'
  19228. A memory reference using 'BC' as a base register, with an
  19229. optional offset.
  19230. 'Wca'
  19231. A memory reference using 'AX', 'BC', 'DE', or 'HL' for the
  19232. address, for calls.
  19233. 'Wcv'
  19234. A memory reference using any 16-bit register pair for the
  19235. address, for calls.
  19236. 'Wd2'
  19237. A memory reference using 'DE' as a base register, with an
  19238. optional offset.
  19239. 'Wde'
  19240. A memory reference using 'DE' as a base register, without any
  19241. offset.
  19242. 'Wfr'
  19243. Any memory reference to an address in the far address space.
  19244. 'Wh1'
  19245. A memory reference using 'HL' as a base register, with an
  19246. optional one-byte offset.
  19247. 'Whb'
  19248. A memory reference using 'HL' as a base register, with 'B' or
  19249. 'C' as the index register.
  19250. 'Whl'
  19251. A memory reference using 'HL' as a base register, without any
  19252. offset.
  19253. 'Ws1'
  19254. A memory reference using 'SP' as a base register, with an
  19255. optional one-byte offset.
  19256. 'Y'
  19257. Any memory reference to an address in the near address space.
  19258. 'A'
  19259. The 'AX' register.
  19260. 'B'
  19261. The 'BC' register.
  19262. 'D'
  19263. The 'DE' register.
  19264. 'R'
  19265. 'A' through 'L' registers.
  19266. 'S'
  19267. The 'SP' register.
  19268. 'T'
  19269. The 'HL' register.
  19270. 'Z08W'
  19271. The 16-bit 'R8' register.
  19272. 'Z10W'
  19273. The 16-bit 'R10' register.
  19274. 'Zint'
  19275. The registers reserved for interrupts ('R24' to 'R31').
  19276. 'a'
  19277. The 'A' register.
  19278. 'b'
  19279. The 'B' register.
  19280. 'c'
  19281. The 'C' register.
  19282. 'd'
  19283. The 'D' register.
  19284. 'e'
  19285. The 'E' register.
  19286. 'h'
  19287. The 'H' register.
  19288. 'l'
  19289. The 'L' register.
  19290. 'v'
  19291. The virtual registers.
  19292. 'w'
  19293. The 'PSW' register.
  19294. 'x'
  19295. The 'X' register.
  19296. _RISC-V--'config/riscv/constraints.md'_
  19297. 'f'
  19298. A floating-point register (if available).
  19299. 'I'
  19300. An I-type 12-bit signed immediate.
  19301. 'J'
  19302. Integer zero.
  19303. 'K'
  19304. A 5-bit unsigned immediate for CSR access instructions.
  19305. 'A'
  19306. An address that is held in a general-purpose register.
  19307. _RX--'config/rx/constraints.md'_
  19308. 'Q'
  19309. An address which does not involve register indirect addressing
  19310. or pre/post increment/decrement addressing.
  19311. 'Symbol'
  19312. A symbol reference.
  19313. 'Int08'
  19314. A constant in the range -256 to 255, inclusive.
  19315. 'Sint08'
  19316. A constant in the range -128 to 127, inclusive.
  19317. 'Sint16'
  19318. A constant in the range -32768 to 32767, inclusive.
  19319. 'Sint24'
  19320. A constant in the range -8388608 to 8388607, inclusive.
  19321. 'Uint04'
  19322. A constant in the range 0 to 15, inclusive.
  19323. _S/390 and zSeries--'config/s390/s390.h'_
  19324. 'a'
  19325. Address register (general purpose register except r0)
  19326. 'c'
  19327. Condition code register
  19328. 'd'
  19329. Data register (arbitrary general purpose register)
  19330. 'f'
  19331. Floating-point register
  19332. 'I'
  19333. Unsigned 8-bit constant (0-255)
  19334. 'J'
  19335. Unsigned 12-bit constant (0-4095)
  19336. 'K'
  19337. Signed 16-bit constant (-32768-32767)
  19338. 'L'
  19339. Value appropriate as displacement.
  19340. '(0..4095)'
  19341. for short displacement
  19342. '(-524288..524287)'
  19343. for long displacement
  19344. 'M'
  19345. Constant integer with a value of 0x7fffffff.
  19346. 'N'
  19347. Multiple letter constraint followed by 4 parameter letters.
  19348. '0..9:'
  19349. number of the part counting from most to least
  19350. significant
  19351. 'H,Q:'
  19352. mode of the part
  19353. 'D,S,H:'
  19354. mode of the containing operand
  19355. '0,F:'
  19356. value of the other parts (F--all bits set)
  19357. The constraint matches if the specified part of a constant has
  19358. a value different from its other parts.
  19359. 'Q'
  19360. Memory reference without index register and with short
  19361. displacement.
  19362. 'R'
  19363. Memory reference with index register and short displacement.
  19364. 'S'
  19365. Memory reference without index register but with long
  19366. displacement.
  19367. 'T'
  19368. Memory reference with index register and long displacement.
  19369. 'U'
  19370. Pointer with short displacement.
  19371. 'W'
  19372. Pointer with long displacement.
  19373. 'Y'
  19374. Shift count operand.
  19375. _SPARC--'config/sparc/sparc.h'_
  19376. 'f'
  19377. Floating-point register on the SPARC-V8 architecture and lower
  19378. floating-point register on the SPARC-V9 architecture.
  19379. 'e'
  19380. Floating-point register. It is equivalent to 'f' on the
  19381. SPARC-V8 architecture and contains both lower and upper
  19382. floating-point registers on the SPARC-V9 architecture.
  19383. 'c'
  19384. Floating-point condition code register.
  19385. 'd'
  19386. Lower floating-point register. It is only valid on the
  19387. SPARC-V9 architecture when the Visual Instruction Set is
  19388. available.
  19389. 'b'
  19390. Floating-point register. It is only valid on the SPARC-V9
  19391. architecture when the Visual Instruction Set is available.
  19392. 'h'
  19393. 64-bit global or out register for the SPARC-V8+ architecture.
  19394. 'C'
  19395. The constant all-ones, for floating-point.
  19396. 'A'
  19397. Signed 5-bit constant
  19398. 'D'
  19399. A vector constant
  19400. 'I'
  19401. Signed 13-bit constant
  19402. 'J'
  19403. Zero
  19404. 'K'
  19405. 32-bit constant with the low 12 bits clear (a constant that
  19406. can be loaded with the 'sethi' instruction)
  19407. 'L'
  19408. A constant in the range supported by 'movcc' instructions
  19409. (11-bit signed immediate)
  19410. 'M'
  19411. A constant in the range supported by 'movrcc' instructions
  19412. (10-bit signed immediate)
  19413. 'N'
  19414. Same as 'K', except that it verifies that bits that are not in
  19415. the lower 32-bit range are all zero. Must be used instead of
  19416. 'K' for modes wider than 'SImode'
  19417. 'O'
  19418. The constant 4096
  19419. 'G'
  19420. Floating-point zero
  19421. 'H'
  19422. Signed 13-bit constant, sign-extended to 32 or 64 bits
  19423. 'P'
  19424. The constant -1
  19425. 'Q'
  19426. Floating-point constant whose integral representation can be
  19427. moved into an integer register using a single sethi
  19428. instruction
  19429. 'R'
  19430. Floating-point constant whose integral representation can be
  19431. moved into an integer register using a single mov instruction
  19432. 'S'
  19433. Floating-point constant whose integral representation can be
  19434. moved into an integer register using a high/lo_sum instruction
  19435. sequence
  19436. 'T'
  19437. Memory address aligned to an 8-byte boundary
  19438. 'U'
  19439. Even register
  19440. 'W'
  19441. Memory address for 'e' constraint registers
  19442. 'w'
  19443. Memory address with only a base register
  19444. 'Y'
  19445. Vector zero
  19446. _TI C6X family--'config/c6x/constraints.md'_
  19447. 'a'
  19448. Register file A (A0-A31).
  19449. 'b'
  19450. Register file B (B0-B31).
  19451. 'A'
  19452. Predicate registers in register file A (A0-A2 on C64X and
  19453. higher, A1 and A2 otherwise).
  19454. 'B'
  19455. Predicate registers in register file B (B0-B2).
  19456. 'C'
  19457. A call-used register in register file B (B0-B9, B16-B31).
  19458. 'Da'
  19459. Register file A, excluding predicate registers (A3-A31, plus
  19460. A0 if not C64X or higher).
  19461. 'Db'
  19462. Register file B, excluding predicate registers (B3-B31).
  19463. 'Iu4'
  19464. Integer constant in the range 0 ... 15.
  19465. 'Iu5'
  19466. Integer constant in the range 0 ... 31.
  19467. 'In5'
  19468. Integer constant in the range -31 ... 0.
  19469. 'Is5'
  19470. Integer constant in the range -16 ... 15.
  19471. 'I5x'
  19472. Integer constant that can be the operand of an ADDA or a SUBA
  19473. insn.
  19474. 'IuB'
  19475. Integer constant in the range 0 ... 65535.
  19476. 'IsB'
  19477. Integer constant in the range -32768 ... 32767.
  19478. 'IsC'
  19479. Integer constant in the range -2^{20} ... 2^{20} - 1.
  19480. 'Jc'
  19481. Integer constant that is a valid mask for the clr instruction.
  19482. 'Js'
  19483. Integer constant that is a valid mask for the set instruction.
  19484. 'Q'
  19485. Memory location with A base register.
  19486. 'R'
  19487. Memory location with B base register.
  19488. 'S0'
  19489. On C64x+ targets, a GP-relative small data reference.
  19490. 'S1'
  19491. Any kind of 'SYMBOL_REF', for use in a call address.
  19492. 'Si'
  19493. Any kind of immediate operand, unless it matches the S0
  19494. constraint.
  19495. 'T'
  19496. Memory location with B base register, but not using a long
  19497. offset.
  19498. 'W'
  19499. A memory operand with an address that cannot be used in an
  19500. unaligned access.
  19501. 'Z'
  19502. Register B14 (aka DP).
  19503. _TILE-Gx--'config/tilegx/constraints.md'_
  19504. 'R00'
  19505. 'R01'
  19506. 'R02'
  19507. 'R03'
  19508. 'R04'
  19509. 'R05'
  19510. 'R06'
  19511. 'R07'
  19512. 'R08'
  19513. 'R09'
  19514. 'R10'
  19515. Each of these represents a register constraint for an
  19516. individual register, from r0 to r10.
  19517. 'I'
  19518. Signed 8-bit integer constant.
  19519. 'J'
  19520. Signed 16-bit integer constant.
  19521. 'K'
  19522. Unsigned 16-bit integer constant.
  19523. 'L'
  19524. Integer constant that fits in one signed byte when incremented
  19525. by one (-129 ... 126).
  19526. 'm'
  19527. Memory operand. If used together with '<' or '>', the operand
  19528. can have postincrement which requires printing with '%In' and
  19529. '%in' on TILE-Gx. For example:
  19530. asm ("st_add %I0,%1,%i0" : "=m<>" (*mem) : "r" (val));
  19531. 'M'
  19532. A bit mask suitable for the BFINS instruction.
  19533. 'N'
  19534. Integer constant that is a byte tiled out eight times.
  19535. 'O'
  19536. The integer zero constant.
  19537. 'P'
  19538. Integer constant that is a sign-extended byte tiled out as
  19539. four shorts.
  19540. 'Q'
  19541. Integer constant that fits in one signed byte when incremented
  19542. (-129 ... 126), but excluding -1.
  19543. 'S'
  19544. Integer constant that has all 1 bits consecutive and starting
  19545. at bit 0.
  19546. 'T'
  19547. A 16-bit fragment of a got, tls, or pc-relative reference.
  19548. 'U'
  19549. Memory operand except postincrement. This is roughly the same
  19550. as 'm' when not used together with '<' or '>'.
  19551. 'W'
  19552. An 8-element vector constant with identical elements.
  19553. 'Y'
  19554. A 4-element vector constant with identical elements.
  19555. 'Z0'
  19556. The integer constant 0xffffffff.
  19557. 'Z1'
  19558. The integer constant 0xffffffff00000000.
  19559. _TILEPro--'config/tilepro/constraints.md'_
  19560. 'R00'
  19561. 'R01'
  19562. 'R02'
  19563. 'R03'
  19564. 'R04'
  19565. 'R05'
  19566. 'R06'
  19567. 'R07'
  19568. 'R08'
  19569. 'R09'
  19570. 'R10'
  19571. Each of these represents a register constraint for an
  19572. individual register, from r0 to r10.
  19573. 'I'
  19574. Signed 8-bit integer constant.
  19575. 'J'
  19576. Signed 16-bit integer constant.
  19577. 'K'
  19578. Nonzero integer constant with low 16 bits zero.
  19579. 'L'
  19580. Integer constant that fits in one signed byte when incremented
  19581. by one (-129 ... 126).
  19582. 'm'
  19583. Memory operand. If used together with '<' or '>', the operand
  19584. can have postincrement which requires printing with '%In' and
  19585. '%in' on TILEPro. For example:
  19586. asm ("swadd %I0,%1,%i0" : "=m<>" (mem) : "r" (val));
  19587. 'M'
  19588. A bit mask suitable for the MM instruction.
  19589. 'N'
  19590. Integer constant that is a byte tiled out four times.
  19591. 'O'
  19592. The integer zero constant.
  19593. 'P'
  19594. Integer constant that is a sign-extended byte tiled out as two
  19595. shorts.
  19596. 'Q'
  19597. Integer constant that fits in one signed byte when incremented
  19598. (-129 ... 126), but excluding -1.
  19599. 'T'
  19600. A symbolic operand, or a 16-bit fragment of a got, tls, or
  19601. pc-relative reference.
  19602. 'U'
  19603. Memory operand except postincrement. This is roughly the same
  19604. as 'm' when not used together with '<' or '>'.
  19605. 'W'
  19606. A 4-element vector constant with identical elements.
  19607. 'Y'
  19608. A 2-element vector constant with identical elements.
  19609. _Visium--'config/visium/constraints.md'_
  19610. 'b'
  19611. EAM register 'mdb'
  19612. 'c'
  19613. EAM register 'mdc'
  19614. 'f'
  19615. Floating point register
  19616. 'k'
  19617. Register for sibcall optimization
  19618. 'l'
  19619. General register, but not 'r29', 'r30' and 'r31'
  19620. 't'
  19621. Register 'r1'
  19622. 'u'
  19623. Register 'r2'
  19624. 'v'
  19625. Register 'r3'
  19626. 'G'
  19627. Floating-point constant 0.0
  19628. 'J'
  19629. Integer constant in the range 0 .. 65535 (16-bit immediate)
  19630. 'K'
  19631. Integer constant in the range 1 .. 31 (5-bit immediate)
  19632. 'L'
  19633. Integer constant in the range -65535 .. -1 (16-bit negative
  19634. immediate)
  19635. 'M'
  19636. Integer constant -1
  19637. 'O'
  19638. Integer constant 0
  19639. 'P'
  19640. Integer constant 32
  19641. _x86 family--'config/i386/constraints.md'_
  19642. 'R'
  19643. Legacy register--the eight integer registers available on all
  19644. i386 processors ('a', 'b', 'c', 'd', 'si', 'di', 'bp', 'sp').
  19645. 'q'
  19646. Any register accessible as 'Rl'. In 32-bit mode, 'a', 'b',
  19647. 'c', and 'd'; in 64-bit mode, any integer register.
  19648. 'Q'
  19649. Any register accessible as 'Rh': 'a', 'b', 'c', and 'd'.
  19650. 'l'
  19651. Any register that can be used as the index in a base+index
  19652. memory access: that is, any general register except the stack
  19653. pointer.
  19654. 'a'
  19655. The 'a' register.
  19656. 'b'
  19657. The 'b' register.
  19658. 'c'
  19659. The 'c' register.
  19660. 'd'
  19661. The 'd' register.
  19662. 'S'
  19663. The 'si' register.
  19664. 'D'
  19665. The 'di' register.
  19666. 'A'
  19667. The 'a' and 'd' registers. This class is used for
  19668. instructions that return double word results in the 'ax:dx'
  19669. register pair. Single word values will be allocated either in
  19670. 'ax' or 'dx'. For example on i386 the following implements
  19671. 'rdtsc':
  19672. unsigned long long rdtsc (void)
  19673. {
  19674. unsigned long long tick;
  19675. __asm__ __volatile__("rdtsc":"=A"(tick));
  19676. return tick;
  19677. }
  19678. This is not correct on x86-64 as it would allocate tick in
  19679. either 'ax' or 'dx'. You have to use the following variant
  19680. instead:
  19681. unsigned long long rdtsc (void)
  19682. {
  19683. unsigned int tickl, tickh;
  19684. __asm__ __volatile__("rdtsc":"=a"(tickl),"=d"(tickh));
  19685. return ((unsigned long long)tickh << 32)|tickl;
  19686. }
  19687. 'U'
  19688. The call-clobbered integer registers.
  19689. 'f'
  19690. Any 80387 floating-point (stack) register.
  19691. 't'
  19692. Top of 80387 floating-point stack ('%st(0)').
  19693. 'u'
  19694. Second from top of 80387 floating-point stack ('%st(1)').
  19695. 'Yk'
  19696. Any mask register that can be used as a predicate, i.e.
  19697. 'k1-k7'.
  19698. 'k'
  19699. Any mask register.
  19700. 'y'
  19701. Any MMX register.
  19702. 'x'
  19703. Any SSE register.
  19704. 'v'
  19705. Any EVEX encodable SSE register ('%xmm0-%xmm31').
  19706. 'w'
  19707. Any bound register.
  19708. 'Yz'
  19709. First SSE register ('%xmm0').
  19710. 'Yi'
  19711. Any SSE register, when SSE2 and inter-unit moves are enabled.
  19712. 'Yj'
  19713. Any SSE register, when SSE2 and inter-unit moves from vector
  19714. registers are enabled.
  19715. 'Ym'
  19716. Any MMX register, when inter-unit moves are enabled.
  19717. 'Yn'
  19718. Any MMX register, when inter-unit moves from vector registers
  19719. are enabled.
  19720. 'Yp'
  19721. Any integer register when 'TARGET_PARTIAL_REG_STALL' is
  19722. disabled.
  19723. 'Ya'
  19724. Any integer register when zero extensions with 'AND' are
  19725. disabled.
  19726. 'Yb'
  19727. Any register that can be used as the GOT base when calling
  19728. '___tls_get_addr': that is, any general register except 'a'
  19729. and 'sp' registers, for '-fno-plt' if linker supports it.
  19730. Otherwise, 'b' register.
  19731. 'Yf'
  19732. Any x87 register when 80387 floating-point arithmetic is
  19733. enabled.
  19734. 'Yr'
  19735. Lower SSE register when avoiding REX prefix and all SSE
  19736. registers otherwise.
  19737. 'Yv'
  19738. For AVX512VL, any EVEX-encodable SSE register
  19739. ('%xmm0-%xmm31'), otherwise any SSE register.
  19740. 'Yh'
  19741. Any EVEX-encodable SSE register, that has number factor of
  19742. four.
  19743. 'Bf'
  19744. Flags register operand.
  19745. 'Bg'
  19746. GOT memory operand.
  19747. 'Bm'
  19748. Vector memory operand.
  19749. 'Bc'
  19750. Constant memory operand.
  19751. 'Bn'
  19752. Memory operand without REX prefix.
  19753. 'Bs'
  19754. Sibcall memory operand.
  19755. 'Bw'
  19756. Call memory operand.
  19757. 'Bz'
  19758. Constant call address operand.
  19759. 'BC'
  19760. SSE constant -1 operand.
  19761. 'I'
  19762. Integer constant in the range 0 ... 31, for 32-bit shifts.
  19763. 'J'
  19764. Integer constant in the range 0 ... 63, for 64-bit shifts.
  19765. 'K'
  19766. Signed 8-bit integer constant.
  19767. 'L'
  19768. '0xFF' or '0xFFFF', for andsi as a zero-extending move.
  19769. 'M'
  19770. 0, 1, 2, or 3 (shifts for the 'lea' instruction).
  19771. 'N'
  19772. Unsigned 8-bit integer constant (for 'in' and 'out'
  19773. instructions).
  19774. 'O'
  19775. Integer constant in the range 0 ... 127, for 128-bit shifts.
  19776. 'G'
  19777. Standard 80387 floating point constant.
  19778. 'C'
  19779. SSE constant zero operand.
  19780. 'e'
  19781. 32-bit signed integer constant, or a symbolic reference known
  19782. to fit that range (for immediate operands in sign-extending
  19783. x86-64 instructions).
  19784. 'We'
  19785. 32-bit signed integer constant, or a symbolic reference known
  19786. to fit that range (for sign-extending conversion operations
  19787. that require non-'VOIDmode' immediate operands).
  19788. 'Wz'
  19789. 32-bit unsigned integer constant, or a symbolic reference
  19790. known to fit that range (for zero-extending conversion
  19791. operations that require non-'VOIDmode' immediate operands).
  19792. 'Wd'
  19793. 128-bit integer constant where both the high and low 64-bit
  19794. word satisfy the 'e' constraint.
  19795. 'Z'
  19796. 32-bit unsigned integer constant, or a symbolic reference
  19797. known to fit that range (for immediate operands in
  19798. zero-extending x86-64 instructions).
  19799. 'Tv'
  19800. VSIB address operand.
  19801. 'Ts'
  19802. Address operand without segment register.
  19803. _Xstormy16--'config/stormy16/stormy16.h'_
  19804. 'a'
  19805. Register r0.
  19806. 'b'
  19807. Register r1.
  19808. 'c'
  19809. Register r2.
  19810. 'd'
  19811. Register r8.
  19812. 'e'
  19813. Registers r0 through r7.
  19814. 't'
  19815. Registers r0 and r1.
  19816. 'y'
  19817. The carry register.
  19818. 'z'
  19819. Registers r8 and r9.
  19820. 'I'
  19821. A constant between 0 and 3 inclusive.
  19822. 'J'
  19823. A constant that has exactly one bit set.
  19824. 'K'
  19825. A constant that has exactly one bit clear.
  19826. 'L'
  19827. A constant between 0 and 255 inclusive.
  19828. 'M'
  19829. A constant between -255 and 0 inclusive.
  19830. 'N'
  19831. A constant between -3 and 0 inclusive.
  19832. 'O'
  19833. A constant between 1 and 4 inclusive.
  19834. 'P'
  19835. A constant between -4 and -1 inclusive.
  19836. 'Q'
  19837. A memory reference that is a stack push.
  19838. 'R'
  19839. A memory reference that is a stack pop.
  19840. 'S'
  19841. A memory reference that refers to a constant address of known
  19842. value.
  19843. 'T'
  19844. The register indicated by Rx (not implemented yet).
  19845. 'U'
  19846. A constant that is not between 2 and 15 inclusive.
  19847. 'Z'
  19848. The constant 0.
  19849. _Xtensa--'config/xtensa/constraints.md'_
  19850. 'a'
  19851. General-purpose 32-bit register
  19852. 'b'
  19853. One-bit boolean register
  19854. 'A'
  19855. MAC16 40-bit accumulator register
  19856. 'I'
  19857. Signed 12-bit integer constant, for use in MOVI instructions
  19858. 'J'
  19859. Signed 8-bit integer constant, for use in ADDI instructions
  19860. 'K'
  19861. Integer constant valid for BccI instructions
  19862. 'L'
  19863. Unsigned constant valid for BccUI instructions
  19864. 
  19865. File: gccint.info, Node: Disable Insn Alternatives, Next: Define Constraints, Prev: Machine Constraints, Up: Constraints
  19866. 17.8.6 Disable insn alternatives using the 'enabled' attribute
  19867. --------------------------------------------------------------
  19868. There are three insn attributes that may be used to selectively disable
  19869. instruction alternatives:
  19870. 'enabled'
  19871. Says whether an alternative is available on the current subtarget.
  19872. 'preferred_for_size'
  19873. Says whether an enabled alternative should be used in code that is
  19874. optimized for size.
  19875. 'preferred_for_speed'
  19876. Says whether an enabled alternative should be used in code that is
  19877. optimized for speed.
  19878. All these attributes should use '(const_int 1)' to allow an alternative
  19879. or '(const_int 0)' to disallow it. The attributes must be a static
  19880. property of the subtarget; they cannot for example depend on the current
  19881. operands, on the current optimization level, on the location of the insn
  19882. within the body of a loop, on whether register allocation has finished,
  19883. or on the current compiler pass.
  19884. The 'enabled' attribute is a correctness property. It tells GCC to act
  19885. as though the disabled alternatives were never defined in the first
  19886. place. This is useful when adding new instructions to an existing
  19887. pattern in cases where the new instructions are only available for
  19888. certain cpu architecture levels (typically mapped to the '-march='
  19889. command-line option).
  19890. In contrast, the 'preferred_for_size' and 'preferred_for_speed'
  19891. attributes are strong optimization hints rather than correctness
  19892. properties. 'preferred_for_size' tells GCC which alternatives to
  19893. consider when adding or modifying an instruction that GCC wants to
  19894. optimize for size. 'preferred_for_speed' does the same thing for speed.
  19895. Note that things like code motion can lead to cases where code optimized
  19896. for size uses alternatives that are not preferred for size, and
  19897. similarly for speed.
  19898. Although 'define_insn's can in principle specify the 'enabled'
  19899. attribute directly, it is often clearer to have subsiduary attributes
  19900. for each architectural feature of interest. The 'define_insn's can then
  19901. use these subsiduary attributes to say which alternatives require which
  19902. features. The example below does this for 'cpu_facility'.
  19903. E.g. the following two patterns could easily be merged using the
  19904. 'enabled' attribute:
  19905. (define_insn "*movdi_old"
  19906. [(set (match_operand:DI 0 "register_operand" "=d")
  19907. (match_operand:DI 1 "register_operand" " d"))]
  19908. "!TARGET_NEW"
  19909. "lgr %0,%1")
  19910. (define_insn "*movdi_new"
  19911. [(set (match_operand:DI 0 "register_operand" "=d,f,d")
  19912. (match_operand:DI 1 "register_operand" " d,d,f"))]
  19913. "TARGET_NEW"
  19914. "@
  19915. lgr %0,%1
  19916. ldgr %0,%1
  19917. lgdr %0,%1")
  19918. to:
  19919. (define_insn "*movdi_combined"
  19920. [(set (match_operand:DI 0 "register_operand" "=d,f,d")
  19921. (match_operand:DI 1 "register_operand" " d,d,f"))]
  19922. ""
  19923. "@
  19924. lgr %0,%1
  19925. ldgr %0,%1
  19926. lgdr %0,%1"
  19927. [(set_attr "cpu_facility" "*,new,new")])
  19928. with the 'enabled' attribute defined like this:
  19929. (define_attr "cpu_facility" "standard,new" (const_string "standard"))
  19930. (define_attr "enabled" ""
  19931. (cond [(eq_attr "cpu_facility" "standard") (const_int 1)
  19932. (and (eq_attr "cpu_facility" "new")
  19933. (ne (symbol_ref "TARGET_NEW") (const_int 0)))
  19934. (const_int 1)]
  19935. (const_int 0)))
  19936. 
  19937. File: gccint.info, Node: Define Constraints, Next: C Constraint Interface, Prev: Disable Insn Alternatives, Up: Constraints
  19938. 17.8.7 Defining Machine-Specific Constraints
  19939. --------------------------------------------
  19940. Machine-specific constraints fall into two categories: register and
  19941. non-register constraints. Within the latter category, constraints which
  19942. allow subsets of all possible memory or address operands should be
  19943. specially marked, to give 'reload' more information.
  19944. Machine-specific constraints can be given names of arbitrary length,
  19945. but they must be entirely composed of letters, digits, underscores
  19946. ('_'), and angle brackets ('< >'). Like C identifiers, they must begin
  19947. with a letter or underscore.
  19948. In order to avoid ambiguity in operand constraint strings, no
  19949. constraint can have a name that begins with any other constraint's name.
  19950. For example, if 'x' is defined as a constraint name, 'xy' may not be,
  19951. and vice versa. As a consequence of this rule, no constraint may begin
  19952. with one of the generic constraint letters: 'E F V X g i m n o p r s'.
  19953. Register constraints correspond directly to register classes. *Note
  19954. Register Classes::. There is thus not much flexibility in their
  19955. definitions.
  19956. -- MD Expression: define_register_constraint name regclass docstring
  19957. All three arguments are string constants. NAME is the name of the
  19958. constraint, as it will appear in 'match_operand' expressions. If
  19959. NAME is a multi-letter constraint its length shall be the same for
  19960. all constraints starting with the same letter. REGCLASS can be
  19961. either the name of the corresponding register class (*note Register
  19962. Classes::), or a C expression which evaluates to the appropriate
  19963. register class. If it is an expression, it must have no side
  19964. effects, and it cannot look at the operand. The usual use of
  19965. expressions is to map some register constraints to 'NO_REGS' when
  19966. the register class is not available on a given subarchitecture.
  19967. DOCSTRING is a sentence documenting the meaning of the constraint.
  19968. Docstrings are explained further below.
  19969. Non-register constraints are more like predicates: the constraint
  19970. definition gives a boolean expression which indicates whether the
  19971. constraint matches.
  19972. -- MD Expression: define_constraint name docstring exp
  19973. The NAME and DOCSTRING arguments are the same as for
  19974. 'define_register_constraint', but note that the docstring comes
  19975. immediately after the name for these expressions. EXP is an RTL
  19976. expression, obeying the same rules as the RTL expressions in
  19977. predicate definitions. *Note Defining Predicates::, for details.
  19978. If it evaluates true, the constraint matches; if it evaluates
  19979. false, it doesn't. Constraint expressions should indicate which
  19980. RTL codes they might match, just like predicate expressions.
  19981. 'match_test' C expressions have access to the following variables:
  19982. OP
  19983. The RTL object defining the operand.
  19984. MODE
  19985. The machine mode of OP.
  19986. IVAL
  19987. 'INTVAL (OP)', if OP is a 'const_int'.
  19988. HVAL
  19989. 'CONST_DOUBLE_HIGH (OP)', if OP is an integer 'const_double'.
  19990. LVAL
  19991. 'CONST_DOUBLE_LOW (OP)', if OP is an integer 'const_double'.
  19992. RVAL
  19993. 'CONST_DOUBLE_REAL_VALUE (OP)', if OP is a floating-point
  19994. 'const_double'.
  19995. The *VAL variables should only be used once another piece of the
  19996. expression has verified that OP is the appropriate kind of RTL
  19997. object.
  19998. Most non-register constraints should be defined with
  19999. 'define_constraint'. The remaining two definition expressions are only
  20000. appropriate for constraints that should be handled specially by 'reload'
  20001. if they fail to match.
  20002. -- MD Expression: define_memory_constraint name docstring exp
  20003. Use this expression for constraints that match a subset of all
  20004. memory operands: that is, 'reload' can make them match by
  20005. converting the operand to the form '(mem (reg X))', where X is a
  20006. base register (from the register class specified by
  20007. 'BASE_REG_CLASS', *note Register Classes::).
  20008. For example, on the S/390, some instructions do not accept
  20009. arbitrary memory references, but only those that do not make use of
  20010. an index register. The constraint letter 'Q' is defined to
  20011. represent a memory address of this type. If 'Q' is defined with
  20012. 'define_memory_constraint', a 'Q' constraint can handle any memory
  20013. operand, because 'reload' knows it can simply copy the memory
  20014. address into a base register if required. This is analogous to the
  20015. way an 'o' constraint can handle any memory operand.
  20016. The syntax and semantics are otherwise identical to
  20017. 'define_constraint'.
  20018. -- MD Expression: define_special_memory_constraint name docstring exp
  20019. Use this expression for constraints that match a subset of all
  20020. memory operands: that is, 'reload' cannot make them match by
  20021. reloading the address as it is described for
  20022. 'define_memory_constraint' or such address reload is undesirable
  20023. with the performance point of view.
  20024. For example, 'define_special_memory_constraint' can be useful if
  20025. specifically aligned memory is necessary or desirable for some insn
  20026. operand.
  20027. The syntax and semantics are otherwise identical to
  20028. 'define_constraint'.
  20029. -- MD Expression: define_address_constraint name docstring exp
  20030. Use this expression for constraints that match a subset of all
  20031. address operands: that is, 'reload' can make the constraint match
  20032. by converting the operand to the form '(reg X)', again with X a
  20033. base register.
  20034. Constraints defined with 'define_address_constraint' can only be
  20035. used with the 'address_operand' predicate, or machine-specific
  20036. predicates that work the same way. They are treated analogously to
  20037. the generic 'p' constraint.
  20038. The syntax and semantics are otherwise identical to
  20039. 'define_constraint'.
  20040. For historical reasons, names beginning with the letters 'G H' are
  20041. reserved for constraints that match only 'const_double's, and names
  20042. beginning with the letters 'I J K L M N O P' are reserved for
  20043. constraints that match only 'const_int's. This may change in the
  20044. future. For the time being, constraints with these names must be
  20045. written in a stylized form, so that 'genpreds' can tell you did it
  20046. correctly:
  20047. (define_constraint "[GHIJKLMNOP]..."
  20048. "DOC..."
  20049. (and (match_code "const_int") ; 'const_double' for G/H
  20050. CONDITION...)) ; usually a 'match_test'
  20051. It is fine to use names beginning with other letters for constraints
  20052. that match 'const_double's or 'const_int's.
  20053. Each docstring in a constraint definition should be one or more
  20054. complete sentences, marked up in Texinfo format. _They are currently
  20055. unused._ In the future they will be copied into the GCC manual, in
  20056. *note Machine Constraints::, replacing the hand-maintained tables
  20057. currently found in that section. Also, in the future the compiler may
  20058. use this to give more helpful diagnostics when poor choice of 'asm'
  20059. constraints causes a reload failure.
  20060. If you put the pseudo-Texinfo directive '@internal' at the beginning of
  20061. a docstring, then (in the future) it will appear only in the internals
  20062. manual's version of the machine-specific constraint tables. Use this
  20063. for constraints that should not appear in 'asm' statements.
  20064. 
  20065. File: gccint.info, Node: C Constraint Interface, Prev: Define Constraints, Up: Constraints
  20066. 17.8.8 Testing constraints from C
  20067. ---------------------------------
  20068. It is occasionally useful to test a constraint from C code rather than
  20069. implicitly via the constraint string in a 'match_operand'. The
  20070. generated file 'tm_p.h' declares a few interfaces for working with
  20071. constraints. At present these are defined for all constraints except
  20072. 'g' (which is equivalent to 'general_operand').
  20073. Some valid constraint names are not valid C identifiers, so there is a
  20074. mangling scheme for referring to them from C. Constraint names that do
  20075. not contain angle brackets or underscores are left unchanged.
  20076. Underscores are doubled, each '<' is replaced with '_l', and each '>'
  20077. with '_g'. Here are some examples:
  20078. *Original* *Mangled*
  20079. x x
  20080. P42x P42x
  20081. P4_x P4__x
  20082. P4>x P4_gx
  20083. P4>> P4_g_g
  20084. P4_g> P4__g_g
  20085. Throughout this section, the variable C is either a constraint in the
  20086. abstract sense, or a constant from 'enum constraint_num'; the variable M
  20087. is a mangled constraint name (usually as part of a larger identifier).
  20088. -- Enum: constraint_num
  20089. For each constraint except 'g', there is a corresponding
  20090. enumeration constant: 'CONSTRAINT_' plus the mangled name of the
  20091. constraint. Functions that take an 'enum constraint_num' as an
  20092. argument expect one of these constants.
  20093. -- Function: inline bool satisfies_constraint_M (rtx EXP)
  20094. For each non-register constraint M except 'g', there is one of
  20095. these functions; it returns 'true' if EXP satisfies the constraint.
  20096. These functions are only visible if 'rtl.h' was included before
  20097. 'tm_p.h'.
  20098. -- Function: bool constraint_satisfied_p (rtx EXP, enum constraint_num
  20099. C)
  20100. Like the 'satisfies_constraint_M' functions, but the constraint to
  20101. test is given as an argument, C. If C specifies a register
  20102. constraint, this function will always return 'false'.
  20103. -- Function: enum reg_class reg_class_for_constraint (enum
  20104. constraint_num C)
  20105. Returns the register class associated with C. If C is not a
  20106. register constraint, or those registers are not available for the
  20107. currently selected subtarget, returns 'NO_REGS'.
  20108. Here is an example use of 'satisfies_constraint_M'. In peephole
  20109. optimizations (*note Peephole Definitions::), operand constraint strings
  20110. are ignored, so if there are relevant constraints, they must be tested
  20111. in the C condition. In the example, the optimization is applied if
  20112. operand 2 does _not_ satisfy the 'K' constraint. (This is a simplified
  20113. version of a peephole definition from the i386 machine description.)
  20114. (define_peephole2
  20115. [(match_scratch:SI 3 "r")
  20116. (set (match_operand:SI 0 "register_operand" "")
  20117. (mult:SI (match_operand:SI 1 "memory_operand" "")
  20118. (match_operand:SI 2 "immediate_operand" "")))]
  20119. "!satisfies_constraint_K (operands[2])"
  20120. [(set (match_dup 3) (match_dup 1))
  20121. (set (match_dup 0) (mult:SI (match_dup 3) (match_dup 2)))]
  20122. "")
  20123. 
  20124. File: gccint.info, Node: Standard Names, Next: Pattern Ordering, Prev: Constraints, Up: Machine Desc
  20125. 17.9 Standard Pattern Names For Generation
  20126. ==========================================
  20127. Here is a table of the instruction names that are meaningful in the RTL
  20128. generation pass of the compiler. Giving one of these names to an
  20129. instruction pattern tells the RTL generation pass that it can use the
  20130. pattern to accomplish a certain task.
  20131. 'movM'
  20132. Here M stands for a two-letter machine mode name, in lowercase.
  20133. This instruction pattern moves data with that machine mode from
  20134. operand 1 to operand 0. For example, 'movsi' moves full-word data.
  20135. If operand 0 is a 'subreg' with mode M of a register whose own mode
  20136. is wider than M, the effect of this instruction is to store the
  20137. specified value in the part of the register that corresponds to
  20138. mode M. Bits outside of M, but which are within the same target
  20139. word as the 'subreg' are undefined. Bits which are outside the
  20140. target word are left unchanged.
  20141. This class of patterns is special in several ways. First of all,
  20142. each of these names up to and including full word size _must_ be
  20143. defined, because there is no other way to copy a datum from one
  20144. place to another. If there are patterns accepting operands in
  20145. larger modes, 'movM' must be defined for integer modes of those
  20146. sizes.
  20147. Second, these patterns are not used solely in the RTL generation
  20148. pass. Even the reload pass can generate move insns to copy values
  20149. from stack slots into temporary registers. When it does so, one of
  20150. the operands is a hard register and the other is an operand that
  20151. can need to be reloaded into a register.
  20152. Therefore, when given such a pair of operands, the pattern must
  20153. generate RTL which needs no reloading and needs no temporary
  20154. registers--no registers other than the operands. For example, if
  20155. you support the pattern with a 'define_expand', then in such a case
  20156. the 'define_expand' mustn't call 'force_reg' or any other such
  20157. function which might generate new pseudo registers.
  20158. This requirement exists even for subword modes on a RISC machine
  20159. where fetching those modes from memory normally requires several
  20160. insns and some temporary registers.
  20161. During reload a memory reference with an invalid address may be
  20162. passed as an operand. Such an address will be replaced with a
  20163. valid address later in the reload pass. In this case, nothing may
  20164. be done with the address except to use it as it stands. If it is
  20165. copied, it will not be replaced with a valid address. No attempt
  20166. should be made to make such an address into a valid address and no
  20167. routine (such as 'change_address') that will do so may be called.
  20168. Note that 'general_operand' will fail when applied to such an
  20169. address.
  20170. The global variable 'reload_in_progress' (which must be explicitly
  20171. declared if required) can be used to determine whether such special
  20172. handling is required.
  20173. The variety of operands that have reloads depends on the rest of
  20174. the machine description, but typically on a RISC machine these can
  20175. only be pseudo registers that did not get hard registers, while on
  20176. other machines explicit memory references will get optional
  20177. reloads.
  20178. If a scratch register is required to move an object to or from
  20179. memory, it can be allocated using 'gen_reg_rtx' prior to life
  20180. analysis.
  20181. If there are cases which need scratch registers during or after
  20182. reload, you must provide an appropriate secondary_reload target
  20183. hook.
  20184. The macro 'can_create_pseudo_p' can be used to determine if it is
  20185. unsafe to create new pseudo registers. If this variable is
  20186. nonzero, then it is unsafe to call 'gen_reg_rtx' to allocate a new
  20187. pseudo.
  20188. The constraints on a 'movM' must permit moving any hard register to
  20189. any other hard register provided that 'TARGET_HARD_REGNO_MODE_OK'
  20190. permits mode M in both registers and 'TARGET_REGISTER_MOVE_COST'
  20191. applied to their classes returns a value of 2.
  20192. It is obligatory to support floating point 'movM' instructions into
  20193. and out of any registers that can hold fixed point values, because
  20194. unions and structures (which have modes 'SImode' or 'DImode') can
  20195. be in those registers and they may have floating point members.
  20196. There may also be a need to support fixed point 'movM' instructions
  20197. in and out of floating point registers. Unfortunately, I have
  20198. forgotten why this was so, and I don't know whether it is still
  20199. true. If 'TARGET_HARD_REGNO_MODE_OK' rejects fixed point values in
  20200. floating point registers, then the constraints of the fixed point
  20201. 'movM' instructions must be designed to avoid ever trying to reload
  20202. into a floating point register.
  20203. 'reload_inM'
  20204. 'reload_outM'
  20205. These named patterns have been obsoleted by the target hook
  20206. 'secondary_reload'.
  20207. Like 'movM', but used when a scratch register is required to move
  20208. between operand 0 and operand 1. Operand 2 describes the scratch
  20209. register. See the discussion of the 'SECONDARY_RELOAD_CLASS' macro
  20210. in *note Register Classes::.
  20211. There are special restrictions on the form of the 'match_operand's
  20212. used in these patterns. First, only the predicate for the reload
  20213. operand is examined, i.e., 'reload_in' examines operand 1, but not
  20214. the predicates for operand 0 or 2. Second, there may be only one
  20215. alternative in the constraints. Third, only a single register
  20216. class letter may be used for the constraint; subsequent constraint
  20217. letters are ignored. As a special exception, an empty constraint
  20218. string matches the 'ALL_REGS' register class. This may relieve
  20219. ports of the burden of defining an 'ALL_REGS' constraint letter
  20220. just for these patterns.
  20221. 'movstrictM'
  20222. Like 'movM' except that if operand 0 is a 'subreg' with mode M of a
  20223. register whose natural mode is wider, the 'movstrictM' instruction
  20224. is guaranteed not to alter any of the register except the part
  20225. which belongs to mode M.
  20226. 'movmisalignM'
  20227. This variant of a move pattern is designed to load or store a value
  20228. from a memory address that is not naturally aligned for its mode.
  20229. For a store, the memory will be in operand 0; for a load, the
  20230. memory will be in operand 1. The other operand is guaranteed not
  20231. to be a memory, so that it's easy to tell whether this is a load or
  20232. store.
  20233. This pattern is used by the autovectorizer, and when expanding a
  20234. 'MISALIGNED_INDIRECT_REF' expression.
  20235. 'load_multiple'
  20236. Load several consecutive memory locations into consecutive
  20237. registers. Operand 0 is the first of the consecutive registers,
  20238. operand 1 is the first memory location, and operand 2 is a
  20239. constant: the number of consecutive registers.
  20240. Define this only if the target machine really has such an
  20241. instruction; do not define this if the most efficient way of
  20242. loading consecutive registers from memory is to do them one at a
  20243. time.
  20244. On some machines, there are restrictions as to which consecutive
  20245. registers can be stored into memory, such as particular starting or
  20246. ending register numbers or only a range of valid counts. For those
  20247. machines, use a 'define_expand' (*note Expander Definitions::) and
  20248. make the pattern fail if the restrictions are not met.
  20249. Write the generated insn as a 'parallel' with elements being a
  20250. 'set' of one register from the appropriate memory location (you may
  20251. also need 'use' or 'clobber' elements). Use a 'match_parallel'
  20252. (*note RTL Template::) to recognize the insn. See 'rs6000.md' for
  20253. examples of the use of this insn pattern.
  20254. 'store_multiple'
  20255. Similar to 'load_multiple', but store several consecutive registers
  20256. into consecutive memory locations. Operand 0 is the first of the
  20257. consecutive memory locations, operand 1 is the first register, and
  20258. operand 2 is a constant: the number of consecutive registers.
  20259. 'vec_load_lanesMN'
  20260. Perform an interleaved load of several vectors from memory operand
  20261. 1 into register operand 0. Both operands have mode M. The
  20262. register operand is viewed as holding consecutive vectors of mode
  20263. N, while the memory operand is a flat array that contains the same
  20264. number of elements. The operation is equivalent to:
  20265. int c = GET_MODE_SIZE (M) / GET_MODE_SIZE (N);
  20266. for (j = 0; j < GET_MODE_NUNITS (N); j++)
  20267. for (i = 0; i < c; i++)
  20268. operand0[i][j] = operand1[j * c + i];
  20269. For example, 'vec_load_lanestiv4hi' loads 8 16-bit values from
  20270. memory into a register of mode 'TI'. The register contains two
  20271. consecutive vectors of mode 'V4HI'.
  20272. This pattern can only be used if:
  20273. TARGET_ARRAY_MODE_SUPPORTED_P (N, C)
  20274. is true. GCC assumes that, if a target supports this kind of
  20275. instruction for some mode N, it also supports unaligned loads for
  20276. vectors of mode N.
  20277. This pattern is not allowed to 'FAIL'.
  20278. 'vec_mask_load_lanesMN'
  20279. Like 'vec_load_lanesMN', but takes an additional mask operand
  20280. (operand 2) that specifies which elements of the destination
  20281. vectors should be loaded. Other elements of the destination
  20282. vectors are set to zero. The operation is equivalent to:
  20283. int c = GET_MODE_SIZE (M) / GET_MODE_SIZE (N);
  20284. for (j = 0; j < GET_MODE_NUNITS (N); j++)
  20285. if (operand2[j])
  20286. for (i = 0; i < c; i++)
  20287. operand0[i][j] = operand1[j * c + i];
  20288. else
  20289. for (i = 0; i < c; i++)
  20290. operand0[i][j] = 0;
  20291. This pattern is not allowed to 'FAIL'.
  20292. 'vec_store_lanesMN'
  20293. Equivalent to 'vec_load_lanesMN', with the memory and register
  20294. operands reversed. That is, the instruction is equivalent to:
  20295. int c = GET_MODE_SIZE (M) / GET_MODE_SIZE (N);
  20296. for (j = 0; j < GET_MODE_NUNITS (N); j++)
  20297. for (i = 0; i < c; i++)
  20298. operand0[j * c + i] = operand1[i][j];
  20299. for a memory operand 0 and register operand 1.
  20300. This pattern is not allowed to 'FAIL'.
  20301. 'vec_mask_store_lanesMN'
  20302. Like 'vec_store_lanesMN', but takes an additional mask operand
  20303. (operand 2) that specifies which elements of the source vectors
  20304. should be stored. The operation is equivalent to:
  20305. int c = GET_MODE_SIZE (M) / GET_MODE_SIZE (N);
  20306. for (j = 0; j < GET_MODE_NUNITS (N); j++)
  20307. if (operand2[j])
  20308. for (i = 0; i < c; i++)
  20309. operand0[j * c + i] = operand1[i][j];
  20310. This pattern is not allowed to 'FAIL'.
  20311. 'gather_loadMN'
  20312. Load several separate memory locations into a vector of mode M.
  20313. Operand 1 is a scalar base address and operand 2 is a vector of
  20314. mode N containing offsets from that base. Operand 0 is a
  20315. destination vector with the same number of elements as N. For each
  20316. element index I:
  20317. * extend the offset element I to address width, using zero
  20318. extension if operand 3 is 1 and sign extension if operand 3 is
  20319. zero;
  20320. * multiply the extended offset by operand 4;
  20321. * add the result to the base; and
  20322. * load the value at that address into element I of operand 0.
  20323. The value of operand 3 does not matter if the offsets are already
  20324. address width.
  20325. 'mask_gather_loadMN'
  20326. Like 'gather_loadMN', but takes an extra mask operand as operand 5.
  20327. Bit I of the mask is set if element I of the result should be
  20328. loaded from memory and clear if element I of the result should be
  20329. set to zero.
  20330. 'scatter_storeMN'
  20331. Store a vector of mode M into several distinct memory locations.
  20332. Operand 0 is a scalar base address and operand 1 is a vector of
  20333. mode N containing offsets from that base. Operand 4 is the vector
  20334. of values that should be stored, which has the same number of
  20335. elements as N. For each element index I:
  20336. * extend the offset element I to address width, using zero
  20337. extension if operand 2 is 1 and sign extension if operand 2 is
  20338. zero;
  20339. * multiply the extended offset by operand 3;
  20340. * add the result to the base; and
  20341. * store element I of operand 4 to that address.
  20342. The value of operand 2 does not matter if the offsets are already
  20343. address width.
  20344. 'mask_scatter_storeMN'
  20345. Like 'scatter_storeMN', but takes an extra mask operand as operand
  20346. 5. Bit I of the mask is set if element I of the result should be
  20347. stored to memory.
  20348. 'vec_setM'
  20349. Set given field in the vector value. Operand 0 is the vector to
  20350. modify, operand 1 is new value of field and operand 2 specify the
  20351. field index.
  20352. 'vec_extractMN'
  20353. Extract given field from the vector value. Operand 1 is the
  20354. vector, operand 2 specify field index and operand 0 place to store
  20355. value into. The N mode is the mode of the field or vector of
  20356. fields that should be extracted, should be either element mode of
  20357. the vector mode M, or a vector mode with the same element mode and
  20358. smaller number of elements. If N is a vector mode, the index is
  20359. counted in units of that mode.
  20360. 'vec_initMN'
  20361. Initialize the vector to given values. Operand 0 is the vector to
  20362. initialize and operand 1 is parallel containing values for
  20363. individual fields. The N mode is the mode of the elements, should
  20364. be either element mode of the vector mode M, or a vector mode with
  20365. the same element mode and smaller number of elements.
  20366. 'vec_duplicateM'
  20367. Initialize vector output operand 0 so that each element has the
  20368. value given by scalar input operand 1. The vector has mode M and
  20369. the scalar has the mode appropriate for one element of M.
  20370. This pattern only handles duplicates of non-constant inputs.
  20371. Constant vectors go through the 'movM' pattern instead.
  20372. This pattern is not allowed to 'FAIL'.
  20373. 'vec_seriesM'
  20374. Initialize vector output operand 0 so that element I is equal to
  20375. operand 1 plus I times operand 2. In other words, create a linear
  20376. series whose base value is operand 1 and whose step is operand 2.
  20377. The vector output has mode M and the scalar inputs have the mode
  20378. appropriate for one element of M. This pattern is not used for
  20379. floating-point vectors, in order to avoid having to specify the
  20380. rounding behavior for I > 1.
  20381. This pattern is not allowed to 'FAIL'.
  20382. 'while_ultMN'
  20383. Set operand 0 to a mask that is true while incrementing operand 1
  20384. gives a value that is less than operand 2. Operand 0 has mode N
  20385. and operands 1 and 2 are scalar integers of mode M. The operation
  20386. is equivalent to:
  20387. operand0[0] = operand1 < operand2;
  20388. for (i = 1; i < GET_MODE_NUNITS (N); i++)
  20389. operand0[i] = operand0[i - 1] && (operand1 + i < operand2);
  20390. 'check_raw_ptrsM'
  20391. Check whether, given two pointers A and B and a length LEN, a write
  20392. of LEN bytes at A followed by a read of LEN bytes at B can be split
  20393. into interleaved byte accesses 'A[0], B[0], A[1], B[1], ...'
  20394. without affecting the dependencies between the bytes. Set operand
  20395. 0 to true if the split is possible and false otherwise.
  20396. Operands 1, 2 and 3 provide the values of A, B and LEN
  20397. respectively. Operand 4 is a constant integer that provides the
  20398. known common alignment of A and B. All inputs have mode M.
  20399. This split is possible if:
  20400. A == B || A + LEN <= B || B + LEN <= A
  20401. You should only define this pattern if the target has a way of
  20402. accelerating the test without having to do the individual
  20403. comparisons.
  20404. 'check_war_ptrsM'
  20405. Like 'check_raw_ptrsM', but with the read and write swapped round.
  20406. The split is possible in this case if:
  20407. B <= A || A + LEN <= B
  20408. 'vec_cmpMN'
  20409. Output a vector comparison. Operand 0 of mode N is the destination
  20410. for predicate in operand 1 which is a signed vector comparison with
  20411. operands of mode M in operands 2 and 3. Predicate is computed by
  20412. element-wise evaluation of the vector comparison with a truth value
  20413. of all-ones and a false value of all-zeros.
  20414. 'vec_cmpuMN'
  20415. Similar to 'vec_cmpMN' but perform unsigned vector comparison.
  20416. 'vec_cmpeqMN'
  20417. Similar to 'vec_cmpMN' but perform equality or non-equality vector
  20418. comparison only. If 'vec_cmpMN' or 'vec_cmpuMN' instruction
  20419. pattern is supported, it will be preferred over 'vec_cmpeqMN', so
  20420. there is no need to define this instruction pattern if the others
  20421. are supported.
  20422. 'vcondMN'
  20423. Output a conditional vector move. Operand 0 is the destination to
  20424. receive a combination of operand 1 and operand 2, which are of mode
  20425. M, dependent on the outcome of the predicate in operand 3 which is
  20426. a signed vector comparison with operands of mode N in operands 4
  20427. and 5. The modes M and N should have the same size. Operand 0
  20428. will be set to the value OP1 & MSK | OP2 & ~MSK where MSK is
  20429. computed by element-wise evaluation of the vector comparison with a
  20430. truth value of all-ones and a false value of all-zeros.
  20431. 'vconduMN'
  20432. Similar to 'vcondMN' but performs unsigned vector comparison.
  20433. 'vcondeqMN'
  20434. Similar to 'vcondMN' but performs equality or non-equality vector
  20435. comparison only. If 'vcondMN' or 'vconduMN' instruction pattern is
  20436. supported, it will be preferred over 'vcondeqMN', so there is no
  20437. need to define this instruction pattern if the others are
  20438. supported.
  20439. 'vcond_mask_MN'
  20440. Similar to 'vcondMN' but operand 3 holds a pre-computed result of
  20441. vector comparison.
  20442. 'maskloadMN'
  20443. Perform a masked load of vector from memory operand 1 of mode M
  20444. into register operand 0. Mask is provided in register operand 2 of
  20445. mode N.
  20446. This pattern is not allowed to 'FAIL'.
  20447. 'maskstoreMN'
  20448. Perform a masked store of vector from register operand 1 of mode M
  20449. into memory operand 0. Mask is provided in register operand 2 of
  20450. mode N.
  20451. This pattern is not allowed to 'FAIL'.
  20452. 'vec_permM'
  20453. Output a (variable) vector permutation. Operand 0 is the
  20454. destination to receive elements from operand 1 and operand 2, which
  20455. are of mode M. Operand 3 is the "selector". It is an integral
  20456. mode vector of the same width and number of elements as mode M.
  20457. The input elements are numbered from 0 in operand 1 through 2*N-1
  20458. in operand 2. The elements of the selector must be computed modulo
  20459. 2*N. Note that if 'rtx_equal_p(operand1, operand2)', this can be
  20460. implemented with just operand 1 and selector elements modulo N.
  20461. In order to make things easy for a number of targets, if there is
  20462. no 'vec_perm' pattern for mode M, but there is for mode Q where Q
  20463. is a vector of 'QImode' of the same width as M, the middle-end will
  20464. lower the mode M 'VEC_PERM_EXPR' to mode Q.
  20465. See also 'TARGET_VECTORIZER_VEC_PERM_CONST', which performs the
  20466. analogous operation for constant selectors.
  20467. 'pushM1'
  20468. Output a push instruction. Operand 0 is value to push. Used only
  20469. when 'PUSH_ROUNDING' is defined. For historical reason, this
  20470. pattern may be missing and in such case an 'mov' expander is used
  20471. instead, with a 'MEM' expression forming the push operation. The
  20472. 'mov' expander method is deprecated.
  20473. 'addM3'
  20474. Add operand 2 and operand 1, storing the result in operand 0. All
  20475. operands must have mode M. This can be used even on two-address
  20476. machines, by means of constraints requiring operands 1 and 0 to be
  20477. the same location.
  20478. 'ssaddM3', 'usaddM3'
  20479. 'subM3', 'sssubM3', 'ussubM3'
  20480. 'mulM3', 'ssmulM3', 'usmulM3'
  20481. 'divM3', 'ssdivM3'
  20482. 'udivM3', 'usdivM3'
  20483. 'modM3', 'umodM3'
  20484. 'uminM3', 'umaxM3'
  20485. 'andM3', 'iorM3', 'xorM3'
  20486. Similar, for other arithmetic operations.
  20487. 'addvM4'
  20488. Like 'addM3' but takes a 'code_label' as operand 3 and emits code
  20489. to jump to it if signed overflow occurs during the addition. This
  20490. pattern is used to implement the built-in functions performing
  20491. signed integer addition with overflow checking.
  20492. 'subvM4', 'mulvM4'
  20493. Similar, for other signed arithmetic operations.
  20494. 'uaddvM4'
  20495. Like 'addvM4' but for unsigned addition. That is to say, the
  20496. operation is the same as signed addition but the jump is taken only
  20497. on unsigned overflow.
  20498. 'usubvM4', 'umulvM4'
  20499. Similar, for other unsigned arithmetic operations.
  20500. 'addptrM3'
  20501. Like 'addM3' but is guaranteed to only be used for address
  20502. calculations. The expanded code is not allowed to clobber the
  20503. condition code. It only needs to be defined if 'addM3' sets the
  20504. condition code. If adds used for address calculations and normal
  20505. adds are not compatible it is required to expand a distinct pattern
  20506. (e.g. using an unspec). The pattern is used by LRA to emit address
  20507. calculations. 'addM3' is used if 'addptrM3' is not defined.
  20508. 'fmaM4'
  20509. Multiply operand 2 and operand 1, then add operand 3, storing the
  20510. result in operand 0 without doing an intermediate rounding step.
  20511. All operands must have mode M. This pattern is used to implement
  20512. the 'fma', 'fmaf', and 'fmal' builtin functions from the ISO C99
  20513. standard.
  20514. 'fmsM4'
  20515. Like 'fmaM4', except operand 3 subtracted from the product instead
  20516. of added to the product. This is represented in the rtl as
  20517. (fma:M OP1 OP2 (neg:M OP3))
  20518. 'fnmaM4'
  20519. Like 'fmaM4' except that the intermediate product is negated before
  20520. being added to operand 3. This is represented in the rtl as
  20521. (fma:M (neg:M OP1) OP2 OP3)
  20522. 'fnmsM4'
  20523. Like 'fmsM4' except that the intermediate product is negated before
  20524. subtracting operand 3. This is represented in the rtl as
  20525. (fma:M (neg:M OP1) OP2 (neg:M OP3))
  20526. 'sminM3', 'smaxM3'
  20527. Signed minimum and maximum operations. When used with floating
  20528. point, if both operands are zeros, or if either operand is 'NaN',
  20529. then it is unspecified which of the two operands is returned as the
  20530. result.
  20531. 'fminM3', 'fmaxM3'
  20532. IEEE-conformant minimum and maximum operations. If one operand is
  20533. a quiet 'NaN', then the other operand is returned. If both
  20534. operands are quiet 'NaN', then a quiet 'NaN' is returned. In the
  20535. case when gcc supports signaling 'NaN' (-fsignaling-nans) an
  20536. invalid floating point exception is raised and a quiet 'NaN' is
  20537. returned.
  20538. All operands have mode M, which is a scalar or vector
  20539. floating-point mode. These patterns are not allowed to 'FAIL'.
  20540. 'reduc_smin_scal_M', 'reduc_smax_scal_M'
  20541. Find the signed minimum/maximum of the elements of a vector. The
  20542. vector is operand 1, and operand 0 is the scalar result, with mode
  20543. equal to the mode of the elements of the input vector.
  20544. 'reduc_umin_scal_M', 'reduc_umax_scal_M'
  20545. Find the unsigned minimum/maximum of the elements of a vector. The
  20546. vector is operand 1, and operand 0 is the scalar result, with mode
  20547. equal to the mode of the elements of the input vector.
  20548. 'reduc_plus_scal_M'
  20549. Compute the sum of the elements of a vector. The vector is operand
  20550. 1, and operand 0 is the scalar result, with mode equal to the mode
  20551. of the elements of the input vector.
  20552. 'reduc_and_scal_M'
  20553. 'reduc_ior_scal_M'
  20554. 'reduc_xor_scal_M'
  20555. Compute the bitwise 'AND'/'IOR'/'XOR' reduction of the elements of
  20556. a vector of mode M. Operand 1 is the vector input and operand 0 is
  20557. the scalar result. The mode of the scalar result is the same as
  20558. one element of M.
  20559. 'extract_last_M'
  20560. Find the last set bit in mask operand 1 and extract the associated
  20561. element of vector operand 2. Store the result in scalar operand 0.
  20562. Operand 2 has vector mode M while operand 0 has the mode
  20563. appropriate for one element of M. Operand 1 has the usual mask
  20564. mode for vectors of mode M; see 'TARGET_VECTORIZE_GET_MASK_MODE'.
  20565. 'fold_extract_last_M'
  20566. If any bits of mask operand 2 are set, find the last set bit,
  20567. extract the associated element from vector operand 3, and store the
  20568. result in operand 0. Store operand 1 in operand 0 otherwise.
  20569. Operand 3 has mode M and operands 0 and 1 have the mode appropriate
  20570. for one element of M. Operand 2 has the usual mask mode for
  20571. vectors of mode M; see 'TARGET_VECTORIZE_GET_MASK_MODE'.
  20572. 'fold_left_plus_M'
  20573. Take scalar operand 1 and successively add each element from vector
  20574. operand 2. Store the result in scalar operand 0. The vector has
  20575. mode M and the scalars have the mode appropriate for one element of
  20576. M. The operation is strictly in-order: there is no reassociation.
  20577. 'mask_fold_left_plus_M'
  20578. Like 'fold_left_plus_M', but takes an additional mask operand
  20579. (operand 3) that specifies which elements of the source vector
  20580. should be added.
  20581. 'sdot_prodM'
  20582. 'udot_prodM'
  20583. Compute the sum of the products of two signed/unsigned elements.
  20584. Operand 1 and operand 2 are of the same mode. Their product, which
  20585. is of a wider mode, is computed and added to operand 3. Operand 3
  20586. is of a mode equal or wider than the mode of the product. The
  20587. result is placed in operand 0, which is of the same mode as operand
  20588. 3.
  20589. 'ssadM'
  20590. 'usadM'
  20591. Compute the sum of absolute differences of two signed/unsigned
  20592. elements. Operand 1 and operand 2 are of the same mode. Their
  20593. absolute difference, which is of a wider mode, is computed and
  20594. added to operand 3. Operand 3 is of a mode equal or wider than the
  20595. mode of the absolute difference. The result is placed in operand
  20596. 0, which is of the same mode as operand 3.
  20597. 'widen_ssumM3'
  20598. 'widen_usumM3'
  20599. Operands 0 and 2 are of the same mode, which is wider than the mode
  20600. of operand 1. Add operand 1 to operand 2 and place the widened
  20601. result in operand 0. (This is used express accumulation of
  20602. elements into an accumulator of a wider mode.)
  20603. 'smulhsM3'
  20604. 'umulhsM3'
  20605. Signed/unsigned multiply high with scale. This is equivalent to
  20606. the C code:
  20607. narrow op0, op1, op2;
  20608. ...
  20609. op0 = (narrow) (((wide) op1 * (wide) op2) >> (N / 2 - 1));
  20610. where the sign of 'narrow' determines whether this is a signed or
  20611. unsigned operation, and N is the size of 'wide' in bits.
  20612. 'smulhrsM3'
  20613. 'umulhrsM3'
  20614. Signed/unsigned multiply high with round and scale. This is
  20615. equivalent to the C code:
  20616. narrow op0, op1, op2;
  20617. ...
  20618. op0 = (narrow) (((((wide) op1 * (wide) op2) >> (N / 2 - 2)) + 1) >> 1);
  20619. where the sign of 'narrow' determines whether this is a signed or
  20620. unsigned operation, and N is the size of 'wide' in bits.
  20621. 'sdiv_pow2M3'
  20622. 'sdiv_pow2M3'
  20623. Signed division by power-of-2 immediate. Equivalent to:
  20624. signed op0, op1;
  20625. ...
  20626. op0 = op1 / (1 << imm);
  20627. 'vec_shl_insert_M'
  20628. Shift the elements in vector input operand 1 left one element (i.e.
  20629. away from element 0) and fill the vacated element 0 with the scalar
  20630. in operand 2. Store the result in vector output operand 0.
  20631. Operands 0 and 1 have mode M and operand 2 has the mode appropriate
  20632. for one element of M.
  20633. 'vec_shl_M'
  20634. Whole vector left shift in bits, i.e. away from element 0. Operand
  20635. 1 is a vector to be shifted. Operand 2 is an integer shift amount
  20636. in bits. Operand 0 is where the resulting shifted vector is
  20637. stored. The output and input vectors should have the same modes.
  20638. 'vec_shr_M'
  20639. Whole vector right shift in bits, i.e. towards element 0. Operand
  20640. 1 is a vector to be shifted. Operand 2 is an integer shift amount
  20641. in bits. Operand 0 is where the resulting shifted vector is
  20642. stored. The output and input vectors should have the same modes.
  20643. 'vec_pack_trunc_M'
  20644. Narrow (demote) and merge the elements of two vectors. Operands 1
  20645. and 2 are vectors of the same mode having N integral or floating
  20646. point elements of size S. Operand 0 is the resulting vector in
  20647. which 2*N elements of size S/2 are concatenated after narrowing
  20648. them down using truncation.
  20649. 'vec_pack_sbool_trunc_M'
  20650. Narrow and merge the elements of two vectors. Operands 1 and 2 are
  20651. vectors of the same type having N boolean elements. Operand 0 is
  20652. the resulting vector in which 2*N elements are concatenated. The
  20653. last operand (operand 3) is the number of elements in the output
  20654. vector 2*N as a 'CONST_INT'. This instruction pattern is used when
  20655. all the vector input and output operands have the same scalar mode
  20656. M and thus using 'vec_pack_trunc_M' would be ambiguous.
  20657. 'vec_pack_ssat_M', 'vec_pack_usat_M'
  20658. Narrow (demote) and merge the elements of two vectors. Operands 1
  20659. and 2 are vectors of the same mode having N integral elements of
  20660. size S. Operand 0 is the resulting vector in which the elements of
  20661. the two input vectors are concatenated after narrowing them down
  20662. using signed/unsigned saturating arithmetic.
  20663. 'vec_pack_sfix_trunc_M', 'vec_pack_ufix_trunc_M'
  20664. Narrow, convert to signed/unsigned integral type and merge the
  20665. elements of two vectors. Operands 1 and 2 are vectors of the same
  20666. mode having N floating point elements of size S. Operand 0 is the
  20667. resulting vector in which 2*N elements of size S/2 are
  20668. concatenated.
  20669. 'vec_packs_float_M', 'vec_packu_float_M'
  20670. Narrow, convert to floating point type and merge the elements of
  20671. two vectors. Operands 1 and 2 are vectors of the same mode having
  20672. N signed/unsigned integral elements of size S. Operand 0 is the
  20673. resulting vector in which 2*N elements of size S/2 are
  20674. concatenated.
  20675. 'vec_unpacks_hi_M', 'vec_unpacks_lo_M'
  20676. Extract and widen (promote) the high/low part of a vector of signed
  20677. integral or floating point elements. The input vector (operand 1)
  20678. has N elements of size S. Widen (promote) the high/low elements of
  20679. the vector using signed or floating point extension and place the
  20680. resulting N/2 values of size 2*S in the output vector (operand 0).
  20681. 'vec_unpacku_hi_M', 'vec_unpacku_lo_M'
  20682. Extract and widen (promote) the high/low part of a vector of
  20683. unsigned integral elements. The input vector (operand 1) has N
  20684. elements of size S. Widen (promote) the high/low elements of the
  20685. vector using zero extension and place the resulting N/2 values of
  20686. size 2*S in the output vector (operand 0).
  20687. 'vec_unpacks_sbool_hi_M', 'vec_unpacks_sbool_lo_M'
  20688. Extract the high/low part of a vector of boolean elements that have
  20689. scalar mode M. The input vector (operand 1) has N elements, the
  20690. output vector (operand 0) has N/2 elements. The last operand
  20691. (operand 2) is the number of elements of the input vector N as a
  20692. 'CONST_INT'. These patterns are used if both the input and output
  20693. vectors have the same scalar mode M and thus using
  20694. 'vec_unpacks_hi_M' or 'vec_unpacks_lo_M' would be ambiguous.
  20695. 'vec_unpacks_float_hi_M', 'vec_unpacks_float_lo_M'
  20696. 'vec_unpacku_float_hi_M', 'vec_unpacku_float_lo_M'
  20697. Extract, convert to floating point type and widen the high/low part
  20698. of a vector of signed/unsigned integral elements. The input vector
  20699. (operand 1) has N elements of size S. Convert the high/low
  20700. elements of the vector using floating point conversion and place
  20701. the resulting N/2 values of size 2*S in the output vector (operand
  20702. 0).
  20703. 'vec_unpack_sfix_trunc_hi_M',
  20704. 'vec_unpack_sfix_trunc_lo_M'
  20705. 'vec_unpack_ufix_trunc_hi_M'
  20706. 'vec_unpack_ufix_trunc_lo_M'
  20707. Extract, convert to signed/unsigned integer type and widen the
  20708. high/low part of a vector of floating point elements. The input
  20709. vector (operand 1) has N elements of size S. Convert the high/low
  20710. elements of the vector to integers and place the resulting N/2
  20711. values of size 2*S in the output vector (operand 0).
  20712. 'vec_widen_umult_hi_M', 'vec_widen_umult_lo_M'
  20713. 'vec_widen_smult_hi_M', 'vec_widen_smult_lo_M'
  20714. 'vec_widen_umult_even_M', 'vec_widen_umult_odd_M'
  20715. 'vec_widen_smult_even_M', 'vec_widen_smult_odd_M'
  20716. Signed/Unsigned widening multiplication. The two inputs (operands
  20717. 1 and 2) are vectors with N signed/unsigned elements of size S.
  20718. Multiply the high/low or even/odd elements of the two vectors, and
  20719. put the N/2 products of size 2*S in the output vector (operand 0).
  20720. A target shouldn't implement even/odd pattern pair if it is less
  20721. efficient than lo/hi one.
  20722. 'vec_widen_ushiftl_hi_M', 'vec_widen_ushiftl_lo_M'
  20723. 'vec_widen_sshiftl_hi_M', 'vec_widen_sshiftl_lo_M'
  20724. Signed/Unsigned widening shift left. The first input (operand 1)
  20725. is a vector with N signed/unsigned elements of size S. Operand 2
  20726. is a constant. Shift the high/low elements of operand 1, and put
  20727. the N/2 results of size 2*S in the output vector (operand 0).
  20728. 'mulhisi3'
  20729. Multiply operands 1 and 2, which have mode 'HImode', and store a
  20730. 'SImode' product in operand 0.
  20731. 'mulqihi3', 'mulsidi3'
  20732. Similar widening-multiplication instructions of other widths.
  20733. 'umulqihi3', 'umulhisi3', 'umulsidi3'
  20734. Similar widening-multiplication instructions that do unsigned
  20735. multiplication.
  20736. 'usmulqihi3', 'usmulhisi3', 'usmulsidi3'
  20737. Similar widening-multiplication instructions that interpret the
  20738. first operand as unsigned and the second operand as signed, then do
  20739. a signed multiplication.
  20740. 'smulM3_highpart'
  20741. Perform a signed multiplication of operands 1 and 2, which have
  20742. mode M, and store the most significant half of the product in
  20743. operand 0. The least significant half of the product is discarded.
  20744. 'umulM3_highpart'
  20745. Similar, but the multiplication is unsigned.
  20746. 'maddMN4'
  20747. Multiply operands 1 and 2, sign-extend them to mode N, add operand
  20748. 3, and store the result in operand 0. Operands 1 and 2 have mode M
  20749. and operands 0 and 3 have mode N. Both modes must be integer or
  20750. fixed-point modes and N must be twice the size of M.
  20751. In other words, 'maddMN4' is like 'mulMN3' except that it also adds
  20752. operand 3.
  20753. These instructions are not allowed to 'FAIL'.
  20754. 'umaddMN4'
  20755. Like 'maddMN4', but zero-extend the multiplication operands instead
  20756. of sign-extending them.
  20757. 'ssmaddMN4'
  20758. Like 'maddMN4', but all involved operations must be
  20759. signed-saturating.
  20760. 'usmaddMN4'
  20761. Like 'umaddMN4', but all involved operations must be
  20762. unsigned-saturating.
  20763. 'msubMN4'
  20764. Multiply operands 1 and 2, sign-extend them to mode N, subtract the
  20765. result from operand 3, and store the result in operand 0. Operands
  20766. 1 and 2 have mode M and operands 0 and 3 have mode N. Both modes
  20767. must be integer or fixed-point modes and N must be twice the size
  20768. of M.
  20769. In other words, 'msubMN4' is like 'mulMN3' except that it also
  20770. subtracts the result from operand 3.
  20771. These instructions are not allowed to 'FAIL'.
  20772. 'umsubMN4'
  20773. Like 'msubMN4', but zero-extend the multiplication operands instead
  20774. of sign-extending them.
  20775. 'ssmsubMN4'
  20776. Like 'msubMN4', but all involved operations must be
  20777. signed-saturating.
  20778. 'usmsubMN4'
  20779. Like 'umsubMN4', but all involved operations must be
  20780. unsigned-saturating.
  20781. 'divmodM4'
  20782. Signed division that produces both a quotient and a remainder.
  20783. Operand 1 is divided by operand 2 to produce a quotient stored in
  20784. operand 0 and a remainder stored in operand 3.
  20785. For machines with an instruction that produces both a quotient and
  20786. a remainder, provide a pattern for 'divmodM4' but do not provide
  20787. patterns for 'divM3' and 'modM3'. This allows optimization in the
  20788. relatively common case when both the quotient and remainder are
  20789. computed.
  20790. If an instruction that just produces a quotient or just a remainder
  20791. exists and is more efficient than the instruction that produces
  20792. both, write the output routine of 'divmodM4' to call
  20793. 'find_reg_note' and look for a 'REG_UNUSED' note on the quotient or
  20794. remainder and generate the appropriate instruction.
  20795. 'udivmodM4'
  20796. Similar, but does unsigned division.
  20797. 'ashlM3', 'ssashlM3', 'usashlM3'
  20798. Arithmetic-shift operand 1 left by a number of bits specified by
  20799. operand 2, and store the result in operand 0. Here M is the mode
  20800. of operand 0 and operand 1; operand 2's mode is specified by the
  20801. instruction pattern, and the compiler will convert the operand to
  20802. that mode before generating the instruction. The shift or rotate
  20803. expander or instruction pattern should explicitly specify the mode
  20804. of the operand 2, it should never be 'VOIDmode'. The meaning of
  20805. out-of-range shift counts can optionally be specified by
  20806. 'TARGET_SHIFT_TRUNCATION_MASK'. *Note
  20807. TARGET_SHIFT_TRUNCATION_MASK::. Operand 2 is always a scalar type.
  20808. 'ashrM3', 'lshrM3', 'rotlM3', 'rotrM3'
  20809. Other shift and rotate instructions, analogous to the 'ashlM3'
  20810. instructions. Operand 2 is always a scalar type.
  20811. 'vashlM3', 'vashrM3', 'vlshrM3', 'vrotlM3', 'vrotrM3'
  20812. Vector shift and rotate instructions that take vectors as operand 2
  20813. instead of a scalar type.
  20814. 'avgM3_floor'
  20815. 'uavgM3_floor'
  20816. Signed and unsigned average instructions. These instructions add
  20817. operands 1 and 2 without truncation, divide the result by 2, round
  20818. towards -Inf, and store the result in operand 0. This is
  20819. equivalent to the C code:
  20820. narrow op0, op1, op2;
  20821. ...
  20822. op0 = (narrow) (((wide) op1 + (wide) op2) >> 1);
  20823. where the sign of 'narrow' determines whether this is a signed or
  20824. unsigned operation.
  20825. 'avgM3_ceil'
  20826. 'uavgM3_ceil'
  20827. Like 'avgM3_floor' and 'uavgM3_floor', but round towards +Inf.
  20828. This is equivalent to the C code:
  20829. narrow op0, op1, op2;
  20830. ...
  20831. op0 = (narrow) (((wide) op1 + (wide) op2 + 1) >> 1);
  20832. 'bswapM2'
  20833. Reverse the order of bytes of operand 1 and store the result in
  20834. operand 0.
  20835. 'negM2', 'ssnegM2', 'usnegM2'
  20836. Negate operand 1 and store the result in operand 0.
  20837. 'negvM3'
  20838. Like 'negM2' but takes a 'code_label' as operand 2 and emits code
  20839. to jump to it if signed overflow occurs during the negation.
  20840. 'absM2'
  20841. Store the absolute value of operand 1 into operand 0.
  20842. 'sqrtM2'
  20843. Store the square root of operand 1 into operand 0. Both operands
  20844. have mode M, which is a scalar or vector floating-point mode.
  20845. This pattern is not allowed to 'FAIL'.
  20846. 'rsqrtM2'
  20847. Store the reciprocal of the square root of operand 1 into operand
  20848. 0. Both operands have mode M, which is a scalar or vector
  20849. floating-point mode.
  20850. On most architectures this pattern is only approximate, so either
  20851. its C condition or the 'TARGET_OPTAB_SUPPORTED_P' hook should check
  20852. for the appropriate math flags. (Using the C condition is more
  20853. direct, but using 'TARGET_OPTAB_SUPPORTED_P' can be useful if a
  20854. target-specific built-in also uses the 'rsqrtM2' pattern.)
  20855. This pattern is not allowed to 'FAIL'.
  20856. 'fmodM3'
  20857. Store the remainder of dividing operand 1 by operand 2 into operand
  20858. 0, rounded towards zero to an integer. All operands have mode M,
  20859. which is a scalar or vector floating-point mode.
  20860. This pattern is not allowed to 'FAIL'.
  20861. 'remainderM3'
  20862. Store the remainder of dividing operand 1 by operand 2 into operand
  20863. 0, rounded to the nearest integer. All operands have mode M, which
  20864. is a scalar or vector floating-point mode.
  20865. This pattern is not allowed to 'FAIL'.
  20866. 'scalbM3'
  20867. Raise 'FLT_RADIX' to the power of operand 2, multiply it by operand
  20868. 1, and store the result in operand 0. All operands have mode M,
  20869. which is a scalar or vector floating-point mode.
  20870. This pattern is not allowed to 'FAIL'.
  20871. 'ldexpM3'
  20872. Raise 2 to the power of operand 2, multiply it by operand 1, and
  20873. store the result in operand 0. Operands 0 and 1 have mode M, which
  20874. is a scalar or vector floating-point mode. Operand 2's mode has
  20875. the same number of elements as M and each element is wide enough to
  20876. store an 'int'. The integers are signed.
  20877. This pattern is not allowed to 'FAIL'.
  20878. 'cosM2'
  20879. Store the cosine of operand 1 into operand 0. Both operands have
  20880. mode M, which is a scalar or vector floating-point mode.
  20881. This pattern is not allowed to 'FAIL'.
  20882. 'sinM2'
  20883. Store the sine of operand 1 into operand 0. Both operands have
  20884. mode M, which is a scalar or vector floating-point mode.
  20885. This pattern is not allowed to 'FAIL'.
  20886. 'sincosM3'
  20887. Store the cosine of operand 2 into operand 0 and the sine of
  20888. operand 2 into operand 1. All operands have mode M, which is a
  20889. scalar or vector floating-point mode.
  20890. Targets that can calculate the sine and cosine simultaneously can
  20891. implement this pattern as opposed to implementing individual
  20892. 'sinM2' and 'cosM2' patterns. The 'sin' and 'cos' built-in
  20893. functions will then be expanded to the 'sincosM3' pattern, with one
  20894. of the output values left unused.
  20895. 'tanM2'
  20896. Store the tangent of operand 1 into operand 0. Both operands have
  20897. mode M, which is a scalar or vector floating-point mode.
  20898. This pattern is not allowed to 'FAIL'.
  20899. 'asinM2'
  20900. Store the arc sine of operand 1 into operand 0. Both operands have
  20901. mode M, which is a scalar or vector floating-point mode.
  20902. This pattern is not allowed to 'FAIL'.
  20903. 'acosM2'
  20904. Store the arc cosine of operand 1 into operand 0. Both operands
  20905. have mode M, which is a scalar or vector floating-point mode.
  20906. This pattern is not allowed to 'FAIL'.
  20907. 'atanM2'
  20908. Store the arc tangent of operand 1 into operand 0. Both operands
  20909. have mode M, which is a scalar or vector floating-point mode.
  20910. This pattern is not allowed to 'FAIL'.
  20911. 'expM2'
  20912. Raise e (the base of natural logarithms) to the power of operand 1
  20913. and store the result in operand 0. Both operands have mode M,
  20914. which is a scalar or vector floating-point mode.
  20915. This pattern is not allowed to 'FAIL'.
  20916. 'expm1M2'
  20917. Raise e (the base of natural logarithms) to the power of operand 1,
  20918. subtract 1, and store the result in operand 0. Both operands have
  20919. mode M, which is a scalar or vector floating-point mode.
  20920. For inputs close to zero, the pattern is expected to be more
  20921. accurate than a separate 'expM2' and 'subM3' would be.
  20922. This pattern is not allowed to 'FAIL'.
  20923. 'exp10M2'
  20924. Raise 10 to the power of operand 1 and store the result in operand
  20925. 0. Both operands have mode M, which is a scalar or vector
  20926. floating-point mode.
  20927. This pattern is not allowed to 'FAIL'.
  20928. 'exp2M2'
  20929. Raise 2 to the power of operand 1 and store the result in operand
  20930. 0. Both operands have mode M, which is a scalar or vector
  20931. floating-point mode.
  20932. This pattern is not allowed to 'FAIL'.
  20933. 'logM2'
  20934. Store the natural logarithm of operand 1 into operand 0. Both
  20935. operands have mode M, which is a scalar or vector floating-point
  20936. mode.
  20937. This pattern is not allowed to 'FAIL'.
  20938. 'log1pM2'
  20939. Add 1 to operand 1, compute the natural logarithm, and store the
  20940. result in operand 0. Both operands have mode M, which is a scalar
  20941. or vector floating-point mode.
  20942. For inputs close to zero, the pattern is expected to be more
  20943. accurate than a separate 'addM3' and 'logM2' would be.
  20944. This pattern is not allowed to 'FAIL'.
  20945. 'log10M2'
  20946. Store the base-10 logarithm of operand 1 into operand 0. Both
  20947. operands have mode M, which is a scalar or vector floating-point
  20948. mode.
  20949. This pattern is not allowed to 'FAIL'.
  20950. 'log2M2'
  20951. Store the base-2 logarithm of operand 1 into operand 0. Both
  20952. operands have mode M, which is a scalar or vector floating-point
  20953. mode.
  20954. This pattern is not allowed to 'FAIL'.
  20955. 'logbM2'
  20956. Store the base-'FLT_RADIX' logarithm of operand 1 into operand 0.
  20957. Both operands have mode M, which is a scalar or vector
  20958. floating-point mode.
  20959. This pattern is not allowed to 'FAIL'.
  20960. 'significandM2'
  20961. Store the significand of floating-point operand 1 in operand 0.
  20962. Both operands have mode M, which is a scalar or vector
  20963. floating-point mode.
  20964. This pattern is not allowed to 'FAIL'.
  20965. 'powM3'
  20966. Store the value of operand 1 raised to the exponent operand 2 into
  20967. operand 0. All operands have mode M, which is a scalar or vector
  20968. floating-point mode.
  20969. This pattern is not allowed to 'FAIL'.
  20970. 'atan2M3'
  20971. Store the arc tangent (inverse tangent) of operand 1 divided by
  20972. operand 2 into operand 0, using the signs of both arguments to
  20973. determine the quadrant of the result. All operands have mode M,
  20974. which is a scalar or vector floating-point mode.
  20975. This pattern is not allowed to 'FAIL'.
  20976. 'floorM2'
  20977. Store the largest integral value not greater than operand 1 in
  20978. operand 0. Both operands have mode M, which is a scalar or vector
  20979. floating-point mode. If '-ffp-int-builtin-inexact' is in effect,
  20980. the "inexact" exception may be raised for noninteger operands;
  20981. otherwise, it may not.
  20982. This pattern is not allowed to 'FAIL'.
  20983. 'btruncM2'
  20984. Round operand 1 to an integer, towards zero, and store the result
  20985. in operand 0. Both operands have mode M, which is a scalar or
  20986. vector floating-point mode. If '-ffp-int-builtin-inexact' is in
  20987. effect, the "inexact" exception may be raised for noninteger
  20988. operands; otherwise, it may not.
  20989. This pattern is not allowed to 'FAIL'.
  20990. 'roundM2'
  20991. Round operand 1 to the nearest integer, rounding away from zero in
  20992. the event of a tie, and store the result in operand 0. Both
  20993. operands have mode M, which is a scalar or vector floating-point
  20994. mode. If '-ffp-int-builtin-inexact' is in effect, the "inexact"
  20995. exception may be raised for noninteger operands; otherwise, it may
  20996. not.
  20997. This pattern is not allowed to 'FAIL'.
  20998. 'ceilM2'
  20999. Store the smallest integral value not less than operand 1 in
  21000. operand 0. Both operands have mode M, which is a scalar or vector
  21001. floating-point mode. If '-ffp-int-builtin-inexact' is in effect,
  21002. the "inexact" exception may be raised for noninteger operands;
  21003. otherwise, it may not.
  21004. This pattern is not allowed to 'FAIL'.
  21005. 'nearbyintM2'
  21006. Round operand 1 to an integer, using the current rounding mode, and
  21007. store the result in operand 0. Do not raise an inexact condition
  21008. when the result is different from the argument. Both operands have
  21009. mode M, which is a scalar or vector floating-point mode.
  21010. This pattern is not allowed to 'FAIL'.
  21011. 'rintM2'
  21012. Round operand 1 to an integer, using the current rounding mode, and
  21013. store the result in operand 0. Raise an inexact condition when the
  21014. result is different from the argument. Both operands have mode M,
  21015. which is a scalar or vector floating-point mode.
  21016. This pattern is not allowed to 'FAIL'.
  21017. 'lrintMN2'
  21018. Convert operand 1 (valid for floating point mode M) to fixed point
  21019. mode N as a signed number according to the current rounding mode
  21020. and store in operand 0 (which has mode N).
  21021. 'lroundMN2'
  21022. Convert operand 1 (valid for floating point mode M) to fixed point
  21023. mode N as a signed number rounding to nearest and away from zero
  21024. and store in operand 0 (which has mode N).
  21025. 'lfloorMN2'
  21026. Convert operand 1 (valid for floating point mode M) to fixed point
  21027. mode N as a signed number rounding down and store in operand 0
  21028. (which has mode N).
  21029. 'lceilMN2'
  21030. Convert operand 1 (valid for floating point mode M) to fixed point
  21031. mode N as a signed number rounding up and store in operand 0 (which
  21032. has mode N).
  21033. 'copysignM3'
  21034. Store a value with the magnitude of operand 1 and the sign of
  21035. operand 2 into operand 0. All operands have mode M, which is a
  21036. scalar or vector floating-point mode.
  21037. This pattern is not allowed to 'FAIL'.
  21038. 'xorsignM3'
  21039. Equivalent to 'op0 = op1 * copysign (1.0, op2)': store a value with
  21040. the magnitude of operand 1 and the sign of operand 2 into operand
  21041. 0. All operands have mode M, which is a scalar or vector
  21042. floating-point mode.
  21043. This pattern is not allowed to 'FAIL'.
  21044. 'ffsM2'
  21045. Store into operand 0 one plus the index of the least significant
  21046. 1-bit of operand 1. If operand 1 is zero, store zero.
  21047. M is either a scalar or vector integer mode. When it is a scalar,
  21048. operand 1 has mode M but operand 0 can have whatever scalar integer
  21049. mode is suitable for the target. The compiler will insert
  21050. conversion instructions as necessary (typically to convert the
  21051. result to the same width as 'int'). When M is a vector, both
  21052. operands must have mode M.
  21053. This pattern is not allowed to 'FAIL'.
  21054. 'clrsbM2'
  21055. Count leading redundant sign bits. Store into operand 0 the number
  21056. of redundant sign bits in operand 1, starting at the most
  21057. significant bit position. A redundant sign bit is defined as any
  21058. sign bit after the first. As such, this count will be one less
  21059. than the count of leading sign bits.
  21060. M is either a scalar or vector integer mode. When it is a scalar,
  21061. operand 1 has mode M but operand 0 can have whatever scalar integer
  21062. mode is suitable for the target. The compiler will insert
  21063. conversion instructions as necessary (typically to convert the
  21064. result to the same width as 'int'). When M is a vector, both
  21065. operands must have mode M.
  21066. This pattern is not allowed to 'FAIL'.
  21067. 'clzM2'
  21068. Store into operand 0 the number of leading 0-bits in operand 1,
  21069. starting at the most significant bit position. If operand 1 is 0,
  21070. the 'CLZ_DEFINED_VALUE_AT_ZERO' (*note Misc::) macro defines if the
  21071. result is undefined or has a useful value.
  21072. M is either a scalar or vector integer mode. When it is a scalar,
  21073. operand 1 has mode M but operand 0 can have whatever scalar integer
  21074. mode is suitable for the target. The compiler will insert
  21075. conversion instructions as necessary (typically to convert the
  21076. result to the same width as 'int'). When M is a vector, both
  21077. operands must have mode M.
  21078. This pattern is not allowed to 'FAIL'.
  21079. 'ctzM2'
  21080. Store into operand 0 the number of trailing 0-bits in operand 1,
  21081. starting at the least significant bit position. If operand 1 is 0,
  21082. the 'CTZ_DEFINED_VALUE_AT_ZERO' (*note Misc::) macro defines if the
  21083. result is undefined or has a useful value.
  21084. M is either a scalar or vector integer mode. When it is a scalar,
  21085. operand 1 has mode M but operand 0 can have whatever scalar integer
  21086. mode is suitable for the target. The compiler will insert
  21087. conversion instructions as necessary (typically to convert the
  21088. result to the same width as 'int'). When M is a vector, both
  21089. operands must have mode M.
  21090. This pattern is not allowed to 'FAIL'.
  21091. 'popcountM2'
  21092. Store into operand 0 the number of 1-bits in operand 1.
  21093. M is either a scalar or vector integer mode. When it is a scalar,
  21094. operand 1 has mode M but operand 0 can have whatever scalar integer
  21095. mode is suitable for the target. The compiler will insert
  21096. conversion instructions as necessary (typically to convert the
  21097. result to the same width as 'int'). When M is a vector, both
  21098. operands must have mode M.
  21099. This pattern is not allowed to 'FAIL'.
  21100. 'parityM2'
  21101. Store into operand 0 the parity of operand 1, i.e. the number of
  21102. 1-bits in operand 1 modulo 2.
  21103. M is either a scalar or vector integer mode. When it is a scalar,
  21104. operand 1 has mode M but operand 0 can have whatever scalar integer
  21105. mode is suitable for the target. The compiler will insert
  21106. conversion instructions as necessary (typically to convert the
  21107. result to the same width as 'int'). When M is a vector, both
  21108. operands must have mode M.
  21109. This pattern is not allowed to 'FAIL'.
  21110. 'one_cmplM2'
  21111. Store the bitwise-complement of operand 1 into operand 0.
  21112. 'cpymemM'
  21113. Block copy instruction. The destination and source blocks of
  21114. memory are the first two operands, and both are 'mem:BLK's with an
  21115. address in mode 'Pmode'.
  21116. The number of bytes to copy is the third operand, in mode M.
  21117. Usually, you specify 'Pmode' for M. However, if you can generate
  21118. better code knowing the range of valid lengths is smaller than
  21119. those representable in a full Pmode pointer, you should provide a
  21120. pattern with a mode corresponding to the range of values you can
  21121. handle efficiently (e.g., 'QImode' for values in the range 0-127;
  21122. note we avoid numbers that appear negative) and also a pattern with
  21123. 'Pmode'.
  21124. The fourth operand is the known shared alignment of the source and
  21125. destination, in the form of a 'const_int' rtx. Thus, if the
  21126. compiler knows that both source and destination are word-aligned,
  21127. it may provide the value 4 for this operand.
  21128. Optional operands 5 and 6 specify expected alignment and size of
  21129. block respectively. The expected alignment differs from alignment
  21130. in operand 4 in a way that the blocks are not required to be
  21131. aligned according to it in all cases. This expected alignment is
  21132. also in bytes, just like operand 4. Expected size, when unknown,
  21133. is set to '(const_int -1)'.
  21134. Descriptions of multiple 'cpymemM' patterns can only be beneficial
  21135. if the patterns for smaller modes have fewer restrictions on their
  21136. first, second and fourth operands. Note that the mode M in
  21137. 'cpymemM' does not impose any restriction on the mode of
  21138. individually copied data units in the block.
  21139. The 'cpymemM' patterns need not give special consideration to the
  21140. possibility that the source and destination strings might overlap.
  21141. These patterns are used to do inline expansion of
  21142. '__builtin_memcpy'.
  21143. 'movmemM'
  21144. Block move instruction. The destination and source blocks of
  21145. memory are the first two operands, and both are 'mem:BLK's with an
  21146. address in mode 'Pmode'.
  21147. The number of bytes to copy is the third operand, in mode M.
  21148. Usually, you specify 'Pmode' for M. However, if you can generate
  21149. better code knowing the range of valid lengths is smaller than
  21150. those representable in a full Pmode pointer, you should provide a
  21151. pattern with a mode corresponding to the range of values you can
  21152. handle efficiently (e.g., 'QImode' for values in the range 0-127;
  21153. note we avoid numbers that appear negative) and also a pattern with
  21154. 'Pmode'.
  21155. The fourth operand is the known shared alignment of the source and
  21156. destination, in the form of a 'const_int' rtx. Thus, if the
  21157. compiler knows that both source and destination are word-aligned,
  21158. it may provide the value 4 for this operand.
  21159. Optional operands 5 and 6 specify expected alignment and size of
  21160. block respectively. The expected alignment differs from alignment
  21161. in operand 4 in a way that the blocks are not required to be
  21162. aligned according to it in all cases. This expected alignment is
  21163. also in bytes, just like operand 4. Expected size, when unknown,
  21164. is set to '(const_int -1)'.
  21165. Descriptions of multiple 'movmemM' patterns can only be beneficial
  21166. if the patterns for smaller modes have fewer restrictions on their
  21167. first, second and fourth operands. Note that the mode M in
  21168. 'movmemM' does not impose any restriction on the mode of
  21169. individually copied data units in the block.
  21170. The 'movmemM' patterns must correctly handle the case where the
  21171. source and destination strings overlap. These patterns are used to
  21172. do inline expansion of '__builtin_memmove'.
  21173. 'movstr'
  21174. String copy instruction, with 'stpcpy' semantics. Operand 0 is an
  21175. output operand in mode 'Pmode'. The addresses of the destination
  21176. and source strings are operands 1 and 2, and both are 'mem:BLK's
  21177. with addresses in mode 'Pmode'. The execution of the expansion of
  21178. this pattern should store in operand 0 the address in which the
  21179. 'NUL' terminator was stored in the destination string.
  21180. This pattern has also several optional operands that are same as in
  21181. 'setmem'.
  21182. 'setmemM'
  21183. Block set instruction. The destination string is the first
  21184. operand, given as a 'mem:BLK' whose address is in mode 'Pmode'.
  21185. The number of bytes to set is the second operand, in mode M. The
  21186. value to initialize the memory with is the third operand. Targets
  21187. that only support the clearing of memory should reject any value
  21188. that is not the constant 0. See 'cpymemM' for a discussion of the
  21189. choice of mode.
  21190. The fourth operand is the known alignment of the destination, in
  21191. the form of a 'const_int' rtx. Thus, if the compiler knows that
  21192. the destination is word-aligned, it may provide the value 4 for
  21193. this operand.
  21194. Optional operands 5 and 6 specify expected alignment and size of
  21195. block respectively. The expected alignment differs from alignment
  21196. in operand 4 in a way that the blocks are not required to be
  21197. aligned according to it in all cases. This expected alignment is
  21198. also in bytes, just like operand 4. Expected size, when unknown,
  21199. is set to '(const_int -1)'. Operand 7 is the minimal size of the
  21200. block and operand 8 is the maximal size of the block (NULL if it
  21201. cannot be represented as CONST_INT). Operand 9 is the probable
  21202. maximal size (i.e. we cannot rely on it for correctness, but it can
  21203. be used for choosing proper code sequence for a given size).
  21204. The use for multiple 'setmemM' is as for 'cpymemM'.
  21205. 'cmpstrnM'
  21206. String compare instruction, with five operands. Operand 0 is the
  21207. output; it has mode M. The remaining four operands are like the
  21208. operands of 'cpymemM'. The two memory blocks specified are
  21209. compared byte by byte in lexicographic order starting at the
  21210. beginning of each string. The instruction is not allowed to
  21211. prefetch more than one byte at a time since either string may end
  21212. in the first byte and reading past that may access an invalid page
  21213. or segment and cause a fault. The comparison terminates early if
  21214. the fetched bytes are different or if they are equal to zero. The
  21215. effect of the instruction is to store a value in operand 0 whose
  21216. sign indicates the result of the comparison.
  21217. 'cmpstrM'
  21218. String compare instruction, without known maximum length. Operand
  21219. 0 is the output; it has mode M. The second and third operand are
  21220. the blocks of memory to be compared; both are 'mem:BLK' with an
  21221. address in mode 'Pmode'.
  21222. The fourth operand is the known shared alignment of the source and
  21223. destination, in the form of a 'const_int' rtx. Thus, if the
  21224. compiler knows that both source and destination are word-aligned,
  21225. it may provide the value 4 for this operand.
  21226. The two memory blocks specified are compared byte by byte in
  21227. lexicographic order starting at the beginning of each string. The
  21228. instruction is not allowed to prefetch more than one byte at a time
  21229. since either string may end in the first byte and reading past that
  21230. may access an invalid page or segment and cause a fault. The
  21231. comparison will terminate when the fetched bytes are different or
  21232. if they are equal to zero. The effect of the instruction is to
  21233. store a value in operand 0 whose sign indicates the result of the
  21234. comparison.
  21235. 'cmpmemM'
  21236. Block compare instruction, with five operands like the operands of
  21237. 'cmpstrM'. The two memory blocks specified are compared byte by
  21238. byte in lexicographic order starting at the beginning of each
  21239. block. Unlike 'cmpstrM' the instruction can prefetch any bytes in
  21240. the two memory blocks. Also unlike 'cmpstrM' the comparison will
  21241. not stop if both bytes are zero. The effect of the instruction is
  21242. to store a value in operand 0 whose sign indicates the result of
  21243. the comparison.
  21244. 'strlenM'
  21245. Compute the length of a string, with three operands. Operand 0 is
  21246. the result (of mode M), operand 1 is a 'mem' referring to the first
  21247. character of the string, operand 2 is the character to search for
  21248. (normally zero), and operand 3 is a constant describing the known
  21249. alignment of the beginning of the string.
  21250. 'floatMN2'
  21251. Convert signed integer operand 1 (valid for fixed point mode M) to
  21252. floating point mode N and store in operand 0 (which has mode N).
  21253. 'floatunsMN2'
  21254. Convert unsigned integer operand 1 (valid for fixed point mode M)
  21255. to floating point mode N and store in operand 0 (which has mode N).
  21256. 'fixMN2'
  21257. Convert operand 1 (valid for floating point mode M) to fixed point
  21258. mode N as a signed number and store in operand 0 (which has mode
  21259. N). This instruction's result is defined only when the value of
  21260. operand 1 is an integer.
  21261. If the machine description defines this pattern, it also needs to
  21262. define the 'ftrunc' pattern.
  21263. 'fixunsMN2'
  21264. Convert operand 1 (valid for floating point mode M) to fixed point
  21265. mode N as an unsigned number and store in operand 0 (which has mode
  21266. N). This instruction's result is defined only when the value of
  21267. operand 1 is an integer.
  21268. 'ftruncM2'
  21269. Convert operand 1 (valid for floating point mode M) to an integer
  21270. value, still represented in floating point mode M, and store it in
  21271. operand 0 (valid for floating point mode M).
  21272. 'fix_truncMN2'
  21273. Like 'fixMN2' but works for any floating point value of mode M by
  21274. converting the value to an integer.
  21275. 'fixuns_truncMN2'
  21276. Like 'fixunsMN2' but works for any floating point value of mode M
  21277. by converting the value to an integer.
  21278. 'truncMN2'
  21279. Truncate operand 1 (valid for mode M) to mode N and store in
  21280. operand 0 (which has mode N). Both modes must be fixed point or
  21281. both floating point.
  21282. 'extendMN2'
  21283. Sign-extend operand 1 (valid for mode M) to mode N and store in
  21284. operand 0 (which has mode N). Both modes must be fixed point or
  21285. both floating point.
  21286. 'zero_extendMN2'
  21287. Zero-extend operand 1 (valid for mode M) to mode N and store in
  21288. operand 0 (which has mode N). Both modes must be fixed point.
  21289. 'fractMN2'
  21290. Convert operand 1 of mode M to mode N and store in operand 0 (which
  21291. has mode N). Mode M and mode N could be fixed-point to
  21292. fixed-point, signed integer to fixed-point, fixed-point to signed
  21293. integer, floating-point to fixed-point, or fixed-point to
  21294. floating-point. When overflows or underflows happen, the results
  21295. are undefined.
  21296. 'satfractMN2'
  21297. Convert operand 1 of mode M to mode N and store in operand 0 (which
  21298. has mode N). Mode M and mode N could be fixed-point to
  21299. fixed-point, signed integer to fixed-point, or floating-point to
  21300. fixed-point. When overflows or underflows happen, the instruction
  21301. saturates the results to the maximum or the minimum.
  21302. 'fractunsMN2'
  21303. Convert operand 1 of mode M to mode N and store in operand 0 (which
  21304. has mode N). Mode M and mode N could be unsigned integer to
  21305. fixed-point, or fixed-point to unsigned integer. When overflows or
  21306. underflows happen, the results are undefined.
  21307. 'satfractunsMN2'
  21308. Convert unsigned integer operand 1 of mode M to fixed-point mode N
  21309. and store in operand 0 (which has mode N). When overflows or
  21310. underflows happen, the instruction saturates the results to the
  21311. maximum or the minimum.
  21312. 'extvM'
  21313. Extract a bit-field from register operand 1, sign-extend it, and
  21314. store it in operand 0. Operand 2 specifies the width of the field
  21315. in bits and operand 3 the starting bit, which counts from the most
  21316. significant bit if 'BITS_BIG_ENDIAN' is true and from the least
  21317. significant bit otherwise.
  21318. Operands 0 and 1 both have mode M. Operands 2 and 3 have a
  21319. target-specific mode.
  21320. 'extvmisalignM'
  21321. Extract a bit-field from memory operand 1, sign extend it, and
  21322. store it in operand 0. Operand 2 specifies the width in bits and
  21323. operand 3 the starting bit. The starting bit is always somewhere
  21324. in the first byte of operand 1; it counts from the most significant
  21325. bit if 'BITS_BIG_ENDIAN' is true and from the least significant bit
  21326. otherwise.
  21327. Operand 0 has mode M while operand 1 has 'BLK' mode. Operands 2
  21328. and 3 have a target-specific mode.
  21329. The instruction must not read beyond the last byte of the
  21330. bit-field.
  21331. 'extzvM'
  21332. Like 'extvM' except that the bit-field value is zero-extended.
  21333. 'extzvmisalignM'
  21334. Like 'extvmisalignM' except that the bit-field value is
  21335. zero-extended.
  21336. 'insvM'
  21337. Insert operand 3 into a bit-field of register operand 0. Operand 1
  21338. specifies the width of the field in bits and operand 2 the starting
  21339. bit, which counts from the most significant bit if
  21340. 'BITS_BIG_ENDIAN' is true and from the least significant bit
  21341. otherwise.
  21342. Operands 0 and 3 both have mode M. Operands 1 and 2 have a
  21343. target-specific mode.
  21344. 'insvmisalignM'
  21345. Insert operand 3 into a bit-field of memory operand 0. Operand 1
  21346. specifies the width of the field in bits and operand 2 the starting
  21347. bit. The starting bit is always somewhere in the first byte of
  21348. operand 0; it counts from the most significant bit if
  21349. 'BITS_BIG_ENDIAN' is true and from the least significant bit
  21350. otherwise.
  21351. Operand 3 has mode M while operand 0 has 'BLK' mode. Operands 1
  21352. and 2 have a target-specific mode.
  21353. The instruction must not read or write beyond the last byte of the
  21354. bit-field.
  21355. 'extv'
  21356. Extract a bit-field from operand 1 (a register or memory operand),
  21357. where operand 2 specifies the width in bits and operand 3 the
  21358. starting bit, and store it in operand 0. Operand 0 must have mode
  21359. 'word_mode'. Operand 1 may have mode 'byte_mode' or 'word_mode';
  21360. often 'word_mode' is allowed only for registers. Operands 2 and 3
  21361. must be valid for 'word_mode'.
  21362. The RTL generation pass generates this instruction only with
  21363. constants for operands 2 and 3 and the constant is never zero for
  21364. operand 2.
  21365. The bit-field value is sign-extended to a full word integer before
  21366. it is stored in operand 0.
  21367. This pattern is deprecated; please use 'extvM' and 'extvmisalignM'
  21368. instead.
  21369. 'extzv'
  21370. Like 'extv' except that the bit-field value is zero-extended.
  21371. This pattern is deprecated; please use 'extzvM' and
  21372. 'extzvmisalignM' instead.
  21373. 'insv'
  21374. Store operand 3 (which must be valid for 'word_mode') into a
  21375. bit-field in operand 0, where operand 1 specifies the width in bits
  21376. and operand 2 the starting bit. Operand 0 may have mode
  21377. 'byte_mode' or 'word_mode'; often 'word_mode' is allowed only for
  21378. registers. Operands 1 and 2 must be valid for 'word_mode'.
  21379. The RTL generation pass generates this instruction only with
  21380. constants for operands 1 and 2 and the constant is never zero for
  21381. operand 1.
  21382. This pattern is deprecated; please use 'insvM' and 'insvmisalignM'
  21383. instead.
  21384. 'movMODEcc'
  21385. Conditionally move operand 2 or operand 3 into operand 0 according
  21386. to the comparison in operand 1. If the comparison is true, operand
  21387. 2 is moved into operand 0, otherwise operand 3 is moved.
  21388. The mode of the operands being compared need not be the same as the
  21389. operands being moved. Some machines, sparc64 for example, have
  21390. instructions that conditionally move an integer value based on the
  21391. floating point condition codes and vice versa.
  21392. If the machine does not have conditional move instructions, do not
  21393. define these patterns.
  21394. 'addMODEcc'
  21395. Similar to 'movMODEcc' but for conditional addition. Conditionally
  21396. move operand 2 or (operands 2 + operand 3) into operand 0 according
  21397. to the comparison in operand 1. If the comparison is false,
  21398. operand 2 is moved into operand 0, otherwise (operand 2 + operand
  21399. 3) is moved.
  21400. 'cond_addMODE'
  21401. 'cond_subMODE'
  21402. 'cond_mulMODE'
  21403. 'cond_divMODE'
  21404. 'cond_udivMODE'
  21405. 'cond_modMODE'
  21406. 'cond_umodMODE'
  21407. 'cond_andMODE'
  21408. 'cond_iorMODE'
  21409. 'cond_xorMODE'
  21410. 'cond_sminMODE'
  21411. 'cond_smaxMODE'
  21412. 'cond_uminMODE'
  21413. 'cond_umaxMODE'
  21414. When operand 1 is true, perform an operation on operands 2 and 3
  21415. and store the result in operand 0, otherwise store operand 4 in
  21416. operand 0. The operation works elementwise if the operands are
  21417. vectors.
  21418. The scalar case is equivalent to:
  21419. op0 = op1 ? op2 OP op3 : op4;
  21420. while the vector case is equivalent to:
  21421. for (i = 0; i < GET_MODE_NUNITS (M); i++)
  21422. op0[i] = op1[i] ? op2[i] OP op3[i] : op4[i];
  21423. where, for example, OP is '+' for 'cond_addMODE'.
  21424. When defined for floating-point modes, the contents of 'op3[i]' are
  21425. not interpreted if 'op1[i]' is false, just like they would not be
  21426. in a normal C '?:' condition.
  21427. Operands 0, 2, 3 and 4 all have mode M. Operand 1 is a scalar
  21428. integer if M is scalar, otherwise it has the mode returned by
  21429. 'TARGET_VECTORIZE_GET_MASK_MODE'.
  21430. 'cond_fmaMODE'
  21431. 'cond_fmsMODE'
  21432. 'cond_fnmaMODE'
  21433. 'cond_fnmsMODE'
  21434. Like 'cond_addM', except that the conditional operation takes 3
  21435. operands rather than two. For example, the vector form of
  21436. 'cond_fmaMODE' is equivalent to:
  21437. for (i = 0; i < GET_MODE_NUNITS (M); i++)
  21438. op0[i] = op1[i] ? fma (op2[i], op3[i], op4[i]) : op5[i];
  21439. 'negMODEcc'
  21440. Similar to 'movMODEcc' but for conditional negation. Conditionally
  21441. move the negation of operand 2 or the unchanged operand 3 into
  21442. operand 0 according to the comparison in operand 1. If the
  21443. comparison is true, the negation of operand 2 is moved into operand
  21444. 0, otherwise operand 3 is moved.
  21445. 'notMODEcc'
  21446. Similar to 'negMODEcc' but for conditional complement.
  21447. Conditionally move the bitwise complement of operand 2 or the
  21448. unchanged operand 3 into operand 0 according to the comparison in
  21449. operand 1. If the comparison is true, the complement of operand 2
  21450. is moved into operand 0, otherwise operand 3 is moved.
  21451. 'cstoreMODE4'
  21452. Store zero or nonzero in operand 0 according to whether a
  21453. comparison is true. Operand 1 is a comparison operator. Operand 2
  21454. and operand 3 are the first and second operand of the comparison,
  21455. respectively. You specify the mode that operand 0 must have when
  21456. you write the 'match_operand' expression. The compiler
  21457. automatically sees which mode you have used and supplies an operand
  21458. of that mode.
  21459. The value stored for a true condition must have 1 as its low bit,
  21460. or else must be negative. Otherwise the instruction is not
  21461. suitable and you should omit it from the machine description. You
  21462. describe to the compiler exactly which value is stored by defining
  21463. the macro 'STORE_FLAG_VALUE' (*note Misc::). If a description
  21464. cannot be found that can be used for all the possible comparison
  21465. operators, you should pick one and use a 'define_expand' to map all
  21466. results onto the one you chose.
  21467. These operations may 'FAIL', but should do so only in relatively
  21468. uncommon cases; if they would 'FAIL' for common cases involving
  21469. integer comparisons, it is best to restrict the predicates to not
  21470. allow these operands. Likewise if a given comparison operator will
  21471. always fail, independent of the operands (for floating-point modes,
  21472. the 'ordered_comparison_operator' predicate is often useful in this
  21473. case).
  21474. If this pattern is omitted, the compiler will generate a
  21475. conditional branch--for example, it may copy a constant one to the
  21476. target and branching around an assignment of zero to the target--or
  21477. a libcall. If the predicate for operand 1 only rejects some
  21478. operators, it will also try reordering the operands and/or
  21479. inverting the result value (e.g. by an exclusive OR). These
  21480. possibilities could be cheaper or equivalent to the instructions
  21481. used for the 'cstoreMODE4' pattern followed by those required to
  21482. convert a positive result from 'STORE_FLAG_VALUE' to 1; in this
  21483. case, you can and should make operand 1's predicate reject some
  21484. operators in the 'cstoreMODE4' pattern, or remove the pattern
  21485. altogether from the machine description.
  21486. 'cbranchMODE4'
  21487. Conditional branch instruction combined with a compare instruction.
  21488. Operand 0 is a comparison operator. Operand 1 and operand 2 are
  21489. the first and second operands of the comparison, respectively.
  21490. Operand 3 is the 'code_label' to jump to.
  21491. 'jump'
  21492. A jump inside a function; an unconditional branch. Operand 0 is
  21493. the 'code_label' to jump to. This pattern name is mandatory on all
  21494. machines.
  21495. 'call'
  21496. Subroutine call instruction returning no value. Operand 0 is the
  21497. function to call; operand 1 is the number of bytes of arguments
  21498. pushed as a 'const_int'; operand 2 is the number of registers used
  21499. as operands.
  21500. On most machines, operand 2 is not actually stored into the RTL
  21501. pattern. It is supplied for the sake of some RISC machines which
  21502. need to put this information into the assembler code; they can put
  21503. it in the RTL instead of operand 1.
  21504. Operand 0 should be a 'mem' RTX whose address is the address of the
  21505. function. Note, however, that this address can be a 'symbol_ref'
  21506. expression even if it would not be a legitimate memory address on
  21507. the target machine. If it is also not a valid argument for a call
  21508. instruction, the pattern for this operation should be a
  21509. 'define_expand' (*note Expander Definitions::) that places the
  21510. address into a register and uses that register in the call
  21511. instruction.
  21512. 'call_value'
  21513. Subroutine call instruction returning a value. Operand 0 is the
  21514. hard register in which the value is returned. There are three more
  21515. operands, the same as the three operands of the 'call' instruction
  21516. (but with numbers increased by one).
  21517. Subroutines that return 'BLKmode' objects use the 'call' insn.
  21518. 'call_pop', 'call_value_pop'
  21519. Similar to 'call' and 'call_value', except used if defined and if
  21520. 'RETURN_POPS_ARGS' is nonzero. They should emit a 'parallel' that
  21521. contains both the function call and a 'set' to indicate the
  21522. adjustment made to the frame pointer.
  21523. For machines where 'RETURN_POPS_ARGS' can be nonzero, the use of
  21524. these patterns increases the number of functions for which the
  21525. frame pointer can be eliminated, if desired.
  21526. 'untyped_call'
  21527. Subroutine call instruction returning a value of any type. Operand
  21528. 0 is the function to call; operand 1 is a memory location where the
  21529. result of calling the function is to be stored; operand 2 is a
  21530. 'parallel' expression where each element is a 'set' expression that
  21531. indicates the saving of a function return value into the result
  21532. block.
  21533. This instruction pattern should be defined to support
  21534. '__builtin_apply' on machines where special instructions are needed
  21535. to call a subroutine with arbitrary arguments or to save the value
  21536. returned. This instruction pattern is required on machines that
  21537. have multiple registers that can hold a return value (i.e.
  21538. 'FUNCTION_VALUE_REGNO_P' is true for more than one register).
  21539. 'return'
  21540. Subroutine return instruction. This instruction pattern name
  21541. should be defined only if a single instruction can do all the work
  21542. of returning from a function.
  21543. Like the 'movM' patterns, this pattern is also used after the RTL
  21544. generation phase. In this case it is to support machines where
  21545. multiple instructions are usually needed to return from a function,
  21546. but some class of functions only requires one instruction to
  21547. implement a return. Normally, the applicable functions are those
  21548. which do not need to save any registers or allocate stack space.
  21549. It is valid for this pattern to expand to an instruction using
  21550. 'simple_return' if no epilogue is required.
  21551. 'simple_return'
  21552. Subroutine return instruction. This instruction pattern name
  21553. should be defined only if a single instruction can do all the work
  21554. of returning from a function on a path where no epilogue is
  21555. required. This pattern is very similar to the 'return' instruction
  21556. pattern, but it is emitted only by the shrink-wrapping optimization
  21557. on paths where the function prologue has not been executed, and a
  21558. function return should occur without any of the effects of the
  21559. epilogue. Additional uses may be introduced on paths where both
  21560. the prologue and the epilogue have executed.
  21561. For such machines, the condition specified in this pattern should
  21562. only be true when 'reload_completed' is nonzero and the function's
  21563. epilogue would only be a single instruction. For machines with
  21564. register windows, the routine 'leaf_function_p' may be used to
  21565. determine if a register window push is required.
  21566. Machines that have conditional return instructions should define
  21567. patterns such as
  21568. (define_insn ""
  21569. [(set (pc)
  21570. (if_then_else (match_operator
  21571. 0 "comparison_operator"
  21572. [(cc0) (const_int 0)])
  21573. (return)
  21574. (pc)))]
  21575. "CONDITION"
  21576. "...")
  21577. where CONDITION would normally be the same condition specified on
  21578. the named 'return' pattern.
  21579. 'untyped_return'
  21580. Untyped subroutine return instruction. This instruction pattern
  21581. should be defined to support '__builtin_return' on machines where
  21582. special instructions are needed to return a value of any type.
  21583. Operand 0 is a memory location where the result of calling a
  21584. function with '__builtin_apply' is stored; operand 1 is a
  21585. 'parallel' expression where each element is a 'set' expression that
  21586. indicates the restoring of a function return value from the result
  21587. block.
  21588. 'nop'
  21589. No-op instruction. This instruction pattern name should always be
  21590. defined to output a no-op in assembler code. '(const_int 0)' will
  21591. do as an RTL pattern.
  21592. 'indirect_jump'
  21593. An instruction to jump to an address which is operand zero. This
  21594. pattern name is mandatory on all machines.
  21595. 'casesi'
  21596. Instruction to jump through a dispatch table, including bounds
  21597. checking. This instruction takes five operands:
  21598. 1. The index to dispatch on, which has mode 'SImode'.
  21599. 2. The lower bound for indices in the table, an integer constant.
  21600. 3. The total range of indices in the table--the largest index
  21601. minus the smallest one (both inclusive).
  21602. 4. A label that precedes the table itself.
  21603. 5. A label to jump to if the index has a value outside the
  21604. bounds.
  21605. The table is an 'addr_vec' or 'addr_diff_vec' inside of a
  21606. 'jump_table_data'. The number of elements in the table is one plus
  21607. the difference between the upper bound and the lower bound.
  21608. 'tablejump'
  21609. Instruction to jump to a variable address. This is a low-level
  21610. capability which can be used to implement a dispatch table when
  21611. there is no 'casesi' pattern.
  21612. This pattern requires two operands: the address or offset, and a
  21613. label which should immediately precede the jump table. If the
  21614. macro 'CASE_VECTOR_PC_RELATIVE' evaluates to a nonzero value then
  21615. the first operand is an offset which counts from the address of the
  21616. table; otherwise, it is an absolute address to jump to. In either
  21617. case, the first operand has mode 'Pmode'.
  21618. The 'tablejump' insn is always the last insn before the jump table
  21619. it uses. Its assembler code normally has no need to use the second
  21620. operand, but you should incorporate it in the RTL pattern so that
  21621. the jump optimizer will not delete the table as unreachable code.
  21622. 'doloop_end'
  21623. Conditional branch instruction that decrements a register and jumps
  21624. if the register is nonzero. Operand 0 is the register to decrement
  21625. and test; operand 1 is the label to jump to if the register is
  21626. nonzero. *Note Looping Patterns::.
  21627. This optional instruction pattern should be defined for machines
  21628. with low-overhead looping instructions as the loop optimizer will
  21629. try to modify suitable loops to utilize it. The target hook
  21630. 'TARGET_CAN_USE_DOLOOP_P' controls the conditions under which
  21631. low-overhead loops can be used.
  21632. 'doloop_begin'
  21633. Companion instruction to 'doloop_end' required for machines that
  21634. need to perform some initialization, such as loading a special
  21635. counter register. Operand 1 is the associated 'doloop_end' pattern
  21636. and operand 0 is the register that it decrements.
  21637. If initialization insns do not always need to be emitted, use a
  21638. 'define_expand' (*note Expander Definitions::) and make it fail.
  21639. 'canonicalize_funcptr_for_compare'
  21640. Canonicalize the function pointer in operand 1 and store the result
  21641. into operand 0.
  21642. Operand 0 is always a 'reg' and has mode 'Pmode'; operand 1 may be
  21643. a 'reg', 'mem', 'symbol_ref', 'const_int', etc and also has mode
  21644. 'Pmode'.
  21645. Canonicalization of a function pointer usually involves computing
  21646. the address of the function which would be called if the function
  21647. pointer were used in an indirect call.
  21648. Only define this pattern if function pointers on the target machine
  21649. can have different values but still call the same function when
  21650. used in an indirect call.
  21651. 'save_stack_block'
  21652. 'save_stack_function'
  21653. 'save_stack_nonlocal'
  21654. 'restore_stack_block'
  21655. 'restore_stack_function'
  21656. 'restore_stack_nonlocal'
  21657. Most machines save and restore the stack pointer by copying it to
  21658. or from an object of mode 'Pmode'. Do not define these patterns on
  21659. such machines.
  21660. Some machines require special handling for stack pointer saves and
  21661. restores. On those machines, define the patterns corresponding to
  21662. the non-standard cases by using a 'define_expand' (*note Expander
  21663. Definitions::) that produces the required insns. The three types
  21664. of saves and restores are:
  21665. 1. 'save_stack_block' saves the stack pointer at the start of a
  21666. block that allocates a variable-sized object, and
  21667. 'restore_stack_block' restores the stack pointer when the
  21668. block is exited.
  21669. 2. 'save_stack_function' and 'restore_stack_function' do a
  21670. similar job for the outermost block of a function and are used
  21671. when the function allocates variable-sized objects or calls
  21672. 'alloca'. Only the epilogue uses the restored stack pointer,
  21673. allowing a simpler save or restore sequence on some machines.
  21674. 3. 'save_stack_nonlocal' is used in functions that contain labels
  21675. branched to by nested functions. It saves the stack pointer
  21676. in such a way that the inner function can use
  21677. 'restore_stack_nonlocal' to restore the stack pointer. The
  21678. compiler generates code to restore the frame and argument
  21679. pointer registers, but some machines require saving and
  21680. restoring additional data such as register window information
  21681. or stack backchains. Place insns in these patterns to save
  21682. and restore any such required data.
  21683. When saving the stack pointer, operand 0 is the save area and
  21684. operand 1 is the stack pointer. The mode used to allocate the save
  21685. area defaults to 'Pmode' but you can override that choice by
  21686. defining the 'STACK_SAVEAREA_MODE' macro (*note Storage Layout::).
  21687. You must specify an integral mode, or 'VOIDmode' if no save area is
  21688. needed for a particular type of save (either because no save is
  21689. needed or because a machine-specific save area can be used).
  21690. Operand 0 is the stack pointer and operand 1 is the save area for
  21691. restore operations. If 'save_stack_block' is defined, operand 0
  21692. must not be 'VOIDmode' since these saves can be arbitrarily nested.
  21693. A save area is a 'mem' that is at a constant offset from
  21694. 'virtual_stack_vars_rtx' when the stack pointer is saved for use by
  21695. nonlocal gotos and a 'reg' in the other two cases.
  21696. 'allocate_stack'
  21697. Subtract (or add if 'STACK_GROWS_DOWNWARD' is undefined) operand 1
  21698. from the stack pointer to create space for dynamically allocated
  21699. data.
  21700. Store the resultant pointer to this space into operand 0. If you
  21701. are allocating space from the main stack, do this by emitting a
  21702. move insn to copy 'virtual_stack_dynamic_rtx' to operand 0. If you
  21703. are allocating the space elsewhere, generate code to copy the
  21704. location of the space to operand 0. In the latter case, you must
  21705. ensure this space gets freed when the corresponding space on the
  21706. main stack is free.
  21707. Do not define this pattern if all that must be done is the
  21708. subtraction. Some machines require other operations such as stack
  21709. probes or maintaining the back chain. Define this pattern to emit
  21710. those operations in addition to updating the stack pointer.
  21711. 'check_stack'
  21712. If stack checking (*note Stack Checking::) cannot be done on your
  21713. system by probing the stack, define this pattern to perform the
  21714. needed check and signal an error if the stack has overflowed. The
  21715. single operand is the address in the stack farthest from the
  21716. current stack pointer that you need to validate. Normally, on
  21717. platforms where this pattern is needed, you would obtain the stack
  21718. limit from a global or thread-specific variable or register.
  21719. 'probe_stack_address'
  21720. If stack checking (*note Stack Checking::) can be done on your
  21721. system by probing the stack but without the need to actually access
  21722. it, define this pattern and signal an error if the stack has
  21723. overflowed. The single operand is the memory address in the stack
  21724. that needs to be probed.
  21725. 'probe_stack'
  21726. If stack checking (*note Stack Checking::) can be done on your
  21727. system by probing the stack but doing it with a "store zero"
  21728. instruction is not valid or optimal, define this pattern to do the
  21729. probing differently and signal an error if the stack has
  21730. overflowed. The single operand is the memory reference in the
  21731. stack that needs to be probed.
  21732. 'nonlocal_goto'
  21733. Emit code to generate a non-local goto, e.g., a jump from one
  21734. function to a label in an outer function. This pattern has four
  21735. arguments, each representing a value to be used in the jump. The
  21736. first argument is to be loaded into the frame pointer, the second
  21737. is the address to branch to (code to dispatch to the actual label),
  21738. the third is the address of a location where the stack is saved,
  21739. and the last is the address of the label, to be placed in the
  21740. location for the incoming static chain.
  21741. On most machines you need not define this pattern, since GCC will
  21742. already generate the correct code, which is to load the frame
  21743. pointer and static chain, restore the stack (using the
  21744. 'restore_stack_nonlocal' pattern, if defined), and jump indirectly
  21745. to the dispatcher. You need only define this pattern if this code
  21746. will not work on your machine.
  21747. 'nonlocal_goto_receiver'
  21748. This pattern, if defined, contains code needed at the target of a
  21749. nonlocal goto after the code already generated by GCC. You will
  21750. not normally need to define this pattern. A typical reason why you
  21751. might need this pattern is if some value, such as a pointer to a
  21752. global table, must be restored when the frame pointer is restored.
  21753. Note that a nonlocal goto only occurs within a unit-of-translation,
  21754. so a global table pointer that is shared by all functions of a
  21755. given module need not be restored. There are no arguments.
  21756. 'exception_receiver'
  21757. This pattern, if defined, contains code needed at the site of an
  21758. exception handler that isn't needed at the site of a nonlocal goto.
  21759. You will not normally need to define this pattern. A typical
  21760. reason why you might need this pattern is if some value, such as a
  21761. pointer to a global table, must be restored after control flow is
  21762. branched to the handler of an exception. There are no arguments.
  21763. 'builtin_setjmp_setup'
  21764. This pattern, if defined, contains additional code needed to
  21765. initialize the 'jmp_buf'. You will not normally need to define
  21766. this pattern. A typical reason why you might need this pattern is
  21767. if some value, such as a pointer to a global table, must be
  21768. restored. Though it is preferred that the pointer value be
  21769. recalculated if possible (given the address of a label for
  21770. instance). The single argument is a pointer to the 'jmp_buf'.
  21771. Note that the buffer is five words long and that the first three
  21772. are normally used by the generic mechanism.
  21773. 'builtin_setjmp_receiver'
  21774. This pattern, if defined, contains code needed at the site of a
  21775. built-in setjmp that isn't needed at the site of a nonlocal goto.
  21776. You will not normally need to define this pattern. A typical
  21777. reason why you might need this pattern is if some value, such as a
  21778. pointer to a global table, must be restored. It takes one
  21779. argument, which is the label to which builtin_longjmp transferred
  21780. control; this pattern may be emitted at a small offset from that
  21781. label.
  21782. 'builtin_longjmp'
  21783. This pattern, if defined, performs the entire action of the
  21784. longjmp. You will not normally need to define this pattern unless
  21785. you also define 'builtin_setjmp_setup'. The single argument is a
  21786. pointer to the 'jmp_buf'.
  21787. 'eh_return'
  21788. This pattern, if defined, affects the way '__builtin_eh_return',
  21789. and thence the call frame exception handling library routines, are
  21790. built. It is intended to handle non-trivial actions needed along
  21791. the abnormal return path.
  21792. The address of the exception handler to which the function should
  21793. return is passed as operand to this pattern. It will normally need
  21794. to copied by the pattern to some special register or memory
  21795. location. If the pattern needs to determine the location of the
  21796. target call frame in order to do so, it may use
  21797. 'EH_RETURN_STACKADJ_RTX', if defined; it will have already been
  21798. assigned.
  21799. If this pattern is not defined, the default action will be to
  21800. simply copy the return address to 'EH_RETURN_HANDLER_RTX'. Either
  21801. that macro or this pattern needs to be defined if call frame
  21802. exception handling is to be used.
  21803. 'prologue'
  21804. This pattern, if defined, emits RTL for entry to a function. The
  21805. function entry is responsible for setting up the stack frame,
  21806. initializing the frame pointer register, saving callee saved
  21807. registers, etc.
  21808. Using a prologue pattern is generally preferred over defining
  21809. 'TARGET_ASM_FUNCTION_PROLOGUE' to emit assembly code for the
  21810. prologue.
  21811. The 'prologue' pattern is particularly useful for targets which
  21812. perform instruction scheduling.
  21813. 'window_save'
  21814. This pattern, if defined, emits RTL for a register window save. It
  21815. should be defined if the target machine has register windows but
  21816. the window events are decoupled from calls to subroutines. The
  21817. canonical example is the SPARC architecture.
  21818. 'epilogue'
  21819. This pattern emits RTL for exit from a function. The function exit
  21820. is responsible for deallocating the stack frame, restoring callee
  21821. saved registers and emitting the return instruction.
  21822. Using an epilogue pattern is generally preferred over defining
  21823. 'TARGET_ASM_FUNCTION_EPILOGUE' to emit assembly code for the
  21824. epilogue.
  21825. The 'epilogue' pattern is particularly useful for targets which
  21826. perform instruction scheduling or which have delay slots for their
  21827. return instruction.
  21828. 'sibcall_epilogue'
  21829. This pattern, if defined, emits RTL for exit from a function
  21830. without the final branch back to the calling function. This
  21831. pattern will be emitted before any sibling call (aka tail call)
  21832. sites.
  21833. The 'sibcall_epilogue' pattern must not clobber any arguments used
  21834. for parameter passing or any stack slots for arguments passed to
  21835. the current function.
  21836. 'trap'
  21837. This pattern, if defined, signals an error, typically by causing
  21838. some kind of signal to be raised.
  21839. 'ctrapMM4'
  21840. Conditional trap instruction. Operand 0 is a piece of RTL which
  21841. performs a comparison, and operands 1 and 2 are the arms of the
  21842. comparison. Operand 3 is the trap code, an integer.
  21843. A typical 'ctrap' pattern looks like
  21844. (define_insn "ctrapsi4"
  21845. [(trap_if (match_operator 0 "trap_operator"
  21846. [(match_operand 1 "register_operand")
  21847. (match_operand 2 "immediate_operand")])
  21848. (match_operand 3 "const_int_operand" "i"))]
  21849. ""
  21850. "...")
  21851. 'prefetch'
  21852. This pattern, if defined, emits code for a non-faulting data
  21853. prefetch instruction. Operand 0 is the address of the memory to
  21854. prefetch. Operand 1 is a constant 1 if the prefetch is preparing
  21855. for a write to the memory address, or a constant 0 otherwise.
  21856. Operand 2 is the expected degree of temporal locality of the data
  21857. and is a value between 0 and 3, inclusive; 0 means that the data
  21858. has no temporal locality, so it need not be left in the cache after
  21859. the access; 3 means that the data has a high degree of temporal
  21860. locality and should be left in all levels of cache possible; 1 and
  21861. 2 mean, respectively, a low or moderate degree of temporal
  21862. locality.
  21863. Targets that do not support write prefetches or locality hints can
  21864. ignore the values of operands 1 and 2.
  21865. 'blockage'
  21866. This pattern defines a pseudo insn that prevents the instruction
  21867. scheduler and other passes from moving instructions and using
  21868. register equivalences across the boundary defined by the blockage
  21869. insn. This needs to be an UNSPEC_VOLATILE pattern or a volatile
  21870. ASM.
  21871. 'memory_blockage'
  21872. This pattern, if defined, represents a compiler memory barrier, and
  21873. will be placed at points across which RTL passes may not propagate
  21874. memory accesses. This instruction needs to read and write volatile
  21875. BLKmode memory. It does not need to generate any machine
  21876. instruction. If this pattern is not defined, the compiler falls
  21877. back to emitting an instruction corresponding to 'asm volatile (""
  21878. ::: "memory")'.
  21879. 'memory_barrier'
  21880. If the target memory model is not fully synchronous, then this
  21881. pattern should be defined to an instruction that orders both loads
  21882. and stores before the instruction with respect to loads and stores
  21883. after the instruction. This pattern has no operands.
  21884. 'speculation_barrier'
  21885. If the target can support speculative execution, then this pattern
  21886. should be defined to an instruction that will block subsequent
  21887. execution until any prior speculation conditions has been resolved.
  21888. The pattern must also ensure that the compiler cannot move memory
  21889. operations past the barrier, so it needs to be an UNSPEC_VOLATILE
  21890. pattern. The pattern has no operands.
  21891. If this pattern is not defined then the default expansion of
  21892. '__builtin_speculation_safe_value' will emit a warning. You can
  21893. suppress this warning by defining this pattern with a final
  21894. condition of '0' (zero), which tells the compiler that a
  21895. speculation barrier is not needed for this target.
  21896. 'sync_compare_and_swapMODE'
  21897. This pattern, if defined, emits code for an atomic compare-and-swap
  21898. operation. Operand 1 is the memory on which the atomic operation
  21899. is performed. Operand 2 is the "old" value to be compared against
  21900. the current contents of the memory location. Operand 3 is the
  21901. "new" value to store in the memory if the compare succeeds.
  21902. Operand 0 is the result of the operation; it should contain the
  21903. contents of the memory before the operation. If the compare
  21904. succeeds, this should obviously be a copy of operand 2.
  21905. This pattern must show that both operand 0 and operand 1 are
  21906. modified.
  21907. This pattern must issue any memory barrier instructions such that
  21908. all memory operations before the atomic operation occur before the
  21909. atomic operation and all memory operations after the atomic
  21910. operation occur after the atomic operation.
  21911. For targets where the success or failure of the compare-and-swap
  21912. operation is available via the status flags, it is possible to
  21913. avoid a separate compare operation and issue the subsequent branch
  21914. or store-flag operation immediately after the compare-and-swap. To
  21915. this end, GCC will look for a 'MODE_CC' set in the output of
  21916. 'sync_compare_and_swapMODE'; if the machine description includes
  21917. such a set, the target should also define special 'cbranchcc4'
  21918. and/or 'cstorecc4' instructions. GCC will then be able to take the
  21919. destination of the 'MODE_CC' set and pass it to the 'cbranchcc4' or
  21920. 'cstorecc4' pattern as the first operand of the comparison (the
  21921. second will be '(const_int 0)').
  21922. For targets where the operating system may provide support for this
  21923. operation via library calls, the 'sync_compare_and_swap_optab' may
  21924. be initialized to a function with the same interface as the
  21925. '__sync_val_compare_and_swap_N' built-in. If the entire set of
  21926. __SYNC builtins are supported via library calls, the target can
  21927. initialize all of the optabs at once with 'init_sync_libfuncs'.
  21928. For the purposes of C++11 'std::atomic::is_lock_free', it is
  21929. assumed that these library calls do _not_ use any kind of
  21930. interruptable locking.
  21931. 'sync_addMODE', 'sync_subMODE'
  21932. 'sync_iorMODE', 'sync_andMODE'
  21933. 'sync_xorMODE', 'sync_nandMODE'
  21934. These patterns emit code for an atomic operation on memory.
  21935. Operand 0 is the memory on which the atomic operation is performed.
  21936. Operand 1 is the second operand to the binary operator.
  21937. This pattern must issue any memory barrier instructions such that
  21938. all memory operations before the atomic operation occur before the
  21939. atomic operation and all memory operations after the atomic
  21940. operation occur after the atomic operation.
  21941. If these patterns are not defined, the operation will be
  21942. constructed from a compare-and-swap operation, if defined.
  21943. 'sync_old_addMODE', 'sync_old_subMODE'
  21944. 'sync_old_iorMODE', 'sync_old_andMODE'
  21945. 'sync_old_xorMODE', 'sync_old_nandMODE'
  21946. These patterns emit code for an atomic operation on memory, and
  21947. return the value that the memory contained before the operation.
  21948. Operand 0 is the result value, operand 1 is the memory on which the
  21949. atomic operation is performed, and operand 2 is the second operand
  21950. to the binary operator.
  21951. This pattern must issue any memory barrier instructions such that
  21952. all memory operations before the atomic operation occur before the
  21953. atomic operation and all memory operations after the atomic
  21954. operation occur after the atomic operation.
  21955. If these patterns are not defined, the operation will be
  21956. constructed from a compare-and-swap operation, if defined.
  21957. 'sync_new_addMODE', 'sync_new_subMODE'
  21958. 'sync_new_iorMODE', 'sync_new_andMODE'
  21959. 'sync_new_xorMODE', 'sync_new_nandMODE'
  21960. These patterns are like their 'sync_old_OP' counterparts, except
  21961. that they return the value that exists in the memory location after
  21962. the operation, rather than before the operation.
  21963. 'sync_lock_test_and_setMODE'
  21964. This pattern takes two forms, based on the capabilities of the
  21965. target. In either case, operand 0 is the result of the operand,
  21966. operand 1 is the memory on which the atomic operation is performed,
  21967. and operand 2 is the value to set in the lock.
  21968. In the ideal case, this operation is an atomic exchange operation,
  21969. in which the previous value in memory operand is copied into the
  21970. result operand, and the value operand is stored in the memory
  21971. operand.
  21972. For less capable targets, any value operand that is not the
  21973. constant 1 should be rejected with 'FAIL'. In this case the target
  21974. may use an atomic test-and-set bit operation. The result operand
  21975. should contain 1 if the bit was previously set and 0 if the bit was
  21976. previously clear. The true contents of the memory operand are
  21977. implementation defined.
  21978. This pattern must issue any memory barrier instructions such that
  21979. the pattern as a whole acts as an acquire barrier, that is all
  21980. memory operations after the pattern do not occur until the lock is
  21981. acquired.
  21982. If this pattern is not defined, the operation will be constructed
  21983. from a compare-and-swap operation, if defined.
  21984. 'sync_lock_releaseMODE'
  21985. This pattern, if defined, releases a lock set by
  21986. 'sync_lock_test_and_setMODE'. Operand 0 is the memory that
  21987. contains the lock; operand 1 is the value to store in the lock.
  21988. If the target doesn't implement full semantics for
  21989. 'sync_lock_test_and_setMODE', any value operand which is not the
  21990. constant 0 should be rejected with 'FAIL', and the true contents of
  21991. the memory operand are implementation defined.
  21992. This pattern must issue any memory barrier instructions such that
  21993. the pattern as a whole acts as a release barrier, that is the lock
  21994. is released only after all previous memory operations have
  21995. completed.
  21996. If this pattern is not defined, then a 'memory_barrier' pattern
  21997. will be emitted, followed by a store of the value to the memory
  21998. operand.
  21999. 'atomic_compare_and_swapMODE'
  22000. This pattern, if defined, emits code for an atomic compare-and-swap
  22001. operation with memory model semantics. Operand 2 is the memory on
  22002. which the atomic operation is performed. Operand 0 is an output
  22003. operand which is set to true or false based on whether the
  22004. operation succeeded. Operand 1 is an output operand which is set
  22005. to the contents of the memory before the operation was attempted.
  22006. Operand 3 is the value that is expected to be in memory. Operand 4
  22007. is the value to put in memory if the expected value is found there.
  22008. Operand 5 is set to 1 if this compare and swap is to be treated as
  22009. a weak operation. Operand 6 is the memory model to be used if the
  22010. operation is a success. Operand 7 is the memory model to be used
  22011. if the operation fails.
  22012. If memory referred to in operand 2 contains the value in operand 3,
  22013. then operand 4 is stored in memory pointed to by operand 2 and
  22014. fencing based on the memory model in operand 6 is issued.
  22015. If memory referred to in operand 2 does not contain the value in
  22016. operand 3, then fencing based on the memory model in operand 7 is
  22017. issued.
  22018. If a target does not support weak compare-and-swap operations, or
  22019. the port elects not to implement weak operations, the argument in
  22020. operand 5 can be ignored. Note a strong implementation must be
  22021. provided.
  22022. If this pattern is not provided, the '__atomic_compare_exchange'
  22023. built-in functions will utilize the legacy 'sync_compare_and_swap'
  22024. pattern with an '__ATOMIC_SEQ_CST' memory model.
  22025. 'atomic_loadMODE'
  22026. This pattern implements an atomic load operation with memory model
  22027. semantics. Operand 1 is the memory address being loaded from.
  22028. Operand 0 is the result of the load. Operand 2 is the memory model
  22029. to be used for the load operation.
  22030. If not present, the '__atomic_load' built-in function will either
  22031. resort to a normal load with memory barriers, or a compare-and-swap
  22032. operation if a normal load would not be atomic.
  22033. 'atomic_storeMODE'
  22034. This pattern implements an atomic store operation with memory model
  22035. semantics. Operand 0 is the memory address being stored to.
  22036. Operand 1 is the value to be written. Operand 2 is the memory
  22037. model to be used for the operation.
  22038. If not present, the '__atomic_store' built-in function will attempt
  22039. to perform a normal store and surround it with any required memory
  22040. fences. If the store would not be atomic, then an
  22041. '__atomic_exchange' is attempted with the result being ignored.
  22042. 'atomic_exchangeMODE'
  22043. This pattern implements an atomic exchange operation with memory
  22044. model semantics. Operand 1 is the memory location the operation is
  22045. performed on. Operand 0 is an output operand which is set to the
  22046. original value contained in the memory pointed to by operand 1.
  22047. Operand 2 is the value to be stored. Operand 3 is the memory model
  22048. to be used.
  22049. If this pattern is not present, the built-in function
  22050. '__atomic_exchange' will attempt to preform the operation with a
  22051. compare and swap loop.
  22052. 'atomic_addMODE', 'atomic_subMODE'
  22053. 'atomic_orMODE', 'atomic_andMODE'
  22054. 'atomic_xorMODE', 'atomic_nandMODE'
  22055. These patterns emit code for an atomic operation on memory with
  22056. memory model semantics. Operand 0 is the memory on which the
  22057. atomic operation is performed. Operand 1 is the second operand to
  22058. the binary operator. Operand 2 is the memory model to be used by
  22059. the operation.
  22060. If these patterns are not defined, attempts will be made to use
  22061. legacy 'sync' patterns, or equivalent patterns which return a
  22062. result. If none of these are available a compare-and-swap loop
  22063. will be used.
  22064. 'atomic_fetch_addMODE', 'atomic_fetch_subMODE'
  22065. 'atomic_fetch_orMODE', 'atomic_fetch_andMODE'
  22066. 'atomic_fetch_xorMODE', 'atomic_fetch_nandMODE'
  22067. These patterns emit code for an atomic operation on memory with
  22068. memory model semantics, and return the original value. Operand 0
  22069. is an output operand which contains the value of the memory
  22070. location before the operation was performed. Operand 1 is the
  22071. memory on which the atomic operation is performed. Operand 2 is
  22072. the second operand to the binary operator. Operand 3 is the memory
  22073. model to be used by the operation.
  22074. If these patterns are not defined, attempts will be made to use
  22075. legacy 'sync' patterns. If none of these are available a
  22076. compare-and-swap loop will be used.
  22077. 'atomic_add_fetchMODE', 'atomic_sub_fetchMODE'
  22078. 'atomic_or_fetchMODE', 'atomic_and_fetchMODE'
  22079. 'atomic_xor_fetchMODE', 'atomic_nand_fetchMODE'
  22080. These patterns emit code for an atomic operation on memory with
  22081. memory model semantics and return the result after the operation is
  22082. performed. Operand 0 is an output operand which contains the value
  22083. after the operation. Operand 1 is the memory on which the atomic
  22084. operation is performed. Operand 2 is the second operand to the
  22085. binary operator. Operand 3 is the memory model to be used by the
  22086. operation.
  22087. If these patterns are not defined, attempts will be made to use
  22088. legacy 'sync' patterns, or equivalent patterns which return the
  22089. result before the operation followed by the arithmetic operation
  22090. required to produce the result. If none of these are available a
  22091. compare-and-swap loop will be used.
  22092. 'atomic_test_and_set'
  22093. This pattern emits code for '__builtin_atomic_test_and_set'.
  22094. Operand 0 is an output operand which is set to true if the previous
  22095. previous contents of the byte was "set", and false otherwise.
  22096. Operand 1 is the 'QImode' memory to be modified. Operand 2 is the
  22097. memory model to be used.
  22098. The specific value that defines "set" is implementation defined,
  22099. and is normally based on what is performed by the native atomic
  22100. test and set instruction.
  22101. 'atomic_bit_test_and_setMODE'
  22102. 'atomic_bit_test_and_complementMODE'
  22103. 'atomic_bit_test_and_resetMODE'
  22104. These patterns emit code for an atomic bitwise operation on memory
  22105. with memory model semantics, and return the original value of the
  22106. specified bit. Operand 0 is an output operand which contains the
  22107. value of the specified bit from the memory location before the
  22108. operation was performed. Operand 1 is the memory on which the
  22109. atomic operation is performed. Operand 2 is the bit within the
  22110. operand, starting with least significant bit. Operand 3 is the
  22111. memory model to be used by the operation. Operand 4 is a flag - it
  22112. is 'const1_rtx' if operand 0 should contain the original value of
  22113. the specified bit in the least significant bit of the operand, and
  22114. 'const0_rtx' if the bit should be in its original position in the
  22115. operand. 'atomic_bit_test_and_setMODE' atomically sets the
  22116. specified bit after remembering its original value,
  22117. 'atomic_bit_test_and_complementMODE' inverts the specified bit and
  22118. 'atomic_bit_test_and_resetMODE' clears the specified bit.
  22119. If these patterns are not defined, attempts will be made to use
  22120. 'atomic_fetch_orMODE', 'atomic_fetch_xorMODE' or
  22121. 'atomic_fetch_andMODE' instruction patterns, or their 'sync'
  22122. counterparts. If none of these are available a compare-and-swap
  22123. loop will be used.
  22124. 'mem_thread_fence'
  22125. This pattern emits code required to implement a thread fence with
  22126. memory model semantics. Operand 0 is the memory model to be used.
  22127. For the '__ATOMIC_RELAXED' model no instructions need to be issued
  22128. and this expansion is not invoked.
  22129. The compiler always emits a compiler memory barrier regardless of
  22130. what expanding this pattern produced.
  22131. If this pattern is not defined, the compiler falls back to
  22132. expanding the 'memory_barrier' pattern, then to emitting
  22133. '__sync_synchronize' library call, and finally to just placing a
  22134. compiler memory barrier.
  22135. 'get_thread_pointerMODE'
  22136. 'set_thread_pointerMODE'
  22137. These patterns emit code that reads/sets the TLS thread pointer.
  22138. Currently, these are only needed if the target needs to support the
  22139. '__builtin_thread_pointer' and '__builtin_set_thread_pointer'
  22140. builtins.
  22141. The get/set patterns have a single output/input operand
  22142. respectively, with MODE intended to be 'Pmode'.
  22143. 'stack_protect_combined_set'
  22144. This pattern, if defined, moves a 'ptr_mode' value from an address
  22145. whose declaration RTX is given in operand 1 to the memory in
  22146. operand 0 without leaving the value in a register afterward. If
  22147. several instructions are needed by the target to perform the
  22148. operation (eg. to load the address from a GOT entry then load the
  22149. 'ptr_mode' value and finally store it), it is the backend's
  22150. responsibility to ensure no intermediate result gets spilled. This
  22151. is to avoid leaking the value some place that an attacker might use
  22152. to rewrite the stack guard slot after having clobbered it.
  22153. If this pattern is not defined, then the address declaration is
  22154. expanded first in the standard way and a 'stack_protect_set'
  22155. pattern is then generated to move the value from that address to
  22156. the address in operand 0.
  22157. 'stack_protect_set'
  22158. This pattern, if defined, moves a 'ptr_mode' value from the valid
  22159. memory location in operand 1 to the memory in operand 0 without
  22160. leaving the value in a register afterward. This is to avoid
  22161. leaking the value some place that an attacker might use to rewrite
  22162. the stack guard slot after having clobbered it.
  22163. Note: on targets where the addressing modes do not allow to load
  22164. directly from stack guard address, the address is expanded in a
  22165. standard way first which could cause some spills.
  22166. If this pattern is not defined, then a plain move pattern is
  22167. generated.
  22168. 'stack_protect_combined_test'
  22169. This pattern, if defined, compares a 'ptr_mode' value from an
  22170. address whose declaration RTX is given in operand 1 with the memory
  22171. in operand 0 without leaving the value in a register afterward and
  22172. branches to operand 2 if the values were equal. If several
  22173. instructions are needed by the target to perform the operation (eg.
  22174. to load the address from a GOT entry then load the 'ptr_mode' value
  22175. and finally store it), it is the backend's responsibility to ensure
  22176. no intermediate result gets spilled. This is to avoid leaking the
  22177. value some place that an attacker might use to rewrite the stack
  22178. guard slot after having clobbered it.
  22179. If this pattern is not defined, then the address declaration is
  22180. expanded first in the standard way and a 'stack_protect_test'
  22181. pattern is then generated to compare the value from that address to
  22182. the value at the memory in operand 0.
  22183. 'stack_protect_test'
  22184. This pattern, if defined, compares a 'ptr_mode' value from the
  22185. valid memory location in operand 1 with the memory in operand 0
  22186. without leaving the value in a register afterward and branches to
  22187. operand 2 if the values were equal.
  22188. If this pattern is not defined, then a plain compare pattern and
  22189. conditional branch pattern is used.
  22190. 'clear_cache'
  22191. This pattern, if defined, flushes the instruction cache for a
  22192. region of memory. The region is bounded to by the Pmode pointers
  22193. in operand 0 inclusive and operand 1 exclusive.
  22194. If this pattern is not defined, a call to the library function
  22195. '__clear_cache' is used.
  22196. 
  22197. File: gccint.info, Node: Pattern Ordering, Next: Dependent Patterns, Prev: Standard Names, Up: Machine Desc
  22198. 17.10 When the Order of Patterns Matters
  22199. ========================================
  22200. Sometimes an insn can match more than one instruction pattern. Then the
  22201. pattern that appears first in the machine description is the one used.
  22202. Therefore, more specific patterns (patterns that will match fewer
  22203. things) and faster instructions (those that will produce better code
  22204. when they do match) should usually go first in the description.
  22205. In some cases the effect of ordering the patterns can be used to hide a
  22206. pattern when it is not valid. For example, the 68000 has an instruction
  22207. for converting a fullword to floating point and another for converting a
  22208. byte to floating point. An instruction converting an integer to
  22209. floating point could match either one. We put the pattern to convert
  22210. the fullword first to make sure that one will be used rather than the
  22211. other. (Otherwise a large integer might be generated as a single-byte
  22212. immediate quantity, which would not work.) Instead of using this
  22213. pattern ordering it would be possible to make the pattern for
  22214. convert-a-byte smart enough to deal properly with any constant value.
  22215. 
  22216. File: gccint.info, Node: Dependent Patterns, Next: Jump Patterns, Prev: Pattern Ordering, Up: Machine Desc
  22217. 17.11 Interdependence of Patterns
  22218. =================================
  22219. In some cases machines support instructions identical except for the
  22220. machine mode of one or more operands. For example, there may be
  22221. "sign-extend halfword" and "sign-extend byte" instructions whose
  22222. patterns are
  22223. (set (match_operand:SI 0 ...)
  22224. (extend:SI (match_operand:HI 1 ...)))
  22225. (set (match_operand:SI 0 ...)
  22226. (extend:SI (match_operand:QI 1 ...)))
  22227. Constant integers do not specify a machine mode, so an instruction to
  22228. extend a constant value could match either pattern. The pattern it
  22229. actually will match is the one that appears first in the file. For
  22230. correct results, this must be the one for the widest possible mode
  22231. ('HImode', here). If the pattern matches the 'QImode' instruction, the
  22232. results will be incorrect if the constant value does not actually fit
  22233. that mode.
  22234. Such instructions to extend constants are rarely generated because they
  22235. are optimized away, but they do occasionally happen in nonoptimized
  22236. compilations.
  22237. If a constraint in a pattern allows a constant, the reload pass may
  22238. replace a register with a constant permitted by the constraint in some
  22239. cases. Similarly for memory references. Because of this substitution,
  22240. you should not provide separate patterns for increment and decrement
  22241. instructions. Instead, they should be generated from the same pattern
  22242. that supports register-register add insns by examining the operands and
  22243. generating the appropriate machine instruction.
  22244. 
  22245. File: gccint.info, Node: Jump Patterns, Next: Looping Patterns, Prev: Dependent Patterns, Up: Machine Desc
  22246. 17.12 Defining Jump Instruction Patterns
  22247. ========================================
  22248. GCC does not assume anything about how the machine realizes jumps. The
  22249. machine description should define a single pattern, usually a
  22250. 'define_expand', which expands to all the required insns.
  22251. Usually, this would be a comparison insn to set the condition code and
  22252. a separate branch insn testing the condition code and branching or not
  22253. according to its value. For many machines, however, separating compares
  22254. and branches is limiting, which is why the more flexible approach with
  22255. one 'define_expand' is used in GCC. The machine description becomes
  22256. clearer for architectures that have compare-and-branch instructions but
  22257. no condition code. It also works better when different sets of
  22258. comparison operators are supported by different kinds of conditional
  22259. branches (e.g. integer vs. floating-point), or by conditional branches
  22260. with respect to conditional stores.
  22261. Two separate insns are always used if the machine description
  22262. represents a condition code register using the legacy RTL expression
  22263. '(cc0)', and on most machines that use a separate condition code
  22264. register (*note Condition Code::). For machines that use '(cc0)', in
  22265. fact, the set and use of the condition code must be separate and
  22266. adjacent(1), thus allowing flags in 'cc_status' to be used (*note
  22267. Condition Code::) and so that the comparison and branch insns could be
  22268. located from each other by using the functions 'prev_cc0_setter' and
  22269. 'next_cc0_user'.
  22270. Even in this case having a single entry point for conditional branches
  22271. is advantageous, because it handles equally well the case where a single
  22272. comparison instruction records the results of both signed and unsigned
  22273. comparison of the given operands (with the branch insns coming in
  22274. distinct signed and unsigned flavors) as in the x86 or SPARC, and the
  22275. case where there are distinct signed and unsigned compare instructions
  22276. and only one set of conditional branch instructions as in the PowerPC.
  22277. ---------- Footnotes ----------
  22278. (1) 'note' insns can separate them, though.
  22279. 
  22280. File: gccint.info, Node: Looping Patterns, Next: Insn Canonicalizations, Prev: Jump Patterns, Up: Machine Desc
  22281. 17.13 Defining Looping Instruction Patterns
  22282. ===========================================
  22283. Some machines have special jump instructions that can be utilized to
  22284. make loops more efficient. A common example is the 68000 'dbra'
  22285. instruction which performs a decrement of a register and a branch if the
  22286. result was greater than zero. Other machines, in particular digital
  22287. signal processors (DSPs), have special block repeat instructions to
  22288. provide low-overhead loop support. For example, the TI TMS320C3x/C4x
  22289. DSPs have a block repeat instruction that loads special registers to
  22290. mark the top and end of a loop and to count the number of loop
  22291. iterations. This avoids the need for fetching and executing a
  22292. 'dbra'-like instruction and avoids pipeline stalls associated with the
  22293. jump.
  22294. GCC has two special named patterns to support low overhead looping.
  22295. They are 'doloop_begin' and 'doloop_end'. These are emitted by the loop
  22296. optimizer for certain well-behaved loops with a finite number of loop
  22297. iterations using information collected during strength reduction.
  22298. The 'doloop_end' pattern describes the actual looping instruction (or
  22299. the implicit looping operation) and the 'doloop_begin' pattern is an
  22300. optional companion pattern that can be used for initialization needed
  22301. for some low-overhead looping instructions.
  22302. Note that some machines require the actual looping instruction to be
  22303. emitted at the top of the loop (e.g., the TMS320C3x/C4x DSPs). Emitting
  22304. the true RTL for a looping instruction at the top of the loop can cause
  22305. problems with flow analysis. So instead, a dummy 'doloop' insn is
  22306. emitted at the end of the loop. The machine dependent reorg pass checks
  22307. for the presence of this 'doloop' insn and then searches back to the top
  22308. of the loop, where it inserts the true looping insn (provided there are
  22309. no instructions in the loop which would cause problems). Any additional
  22310. labels can be emitted at this point. In addition, if the desired
  22311. special iteration counter register was not allocated, this machine
  22312. dependent reorg pass could emit a traditional compare and jump
  22313. instruction pair.
  22314. For the 'doloop_end' pattern, the loop optimizer allocates an
  22315. additional pseudo register as an iteration counter. This pseudo
  22316. register cannot be used within the loop (i.e., general induction
  22317. variables cannot be derived from it), however, in many cases the loop
  22318. induction variable may become redundant and removed by the flow pass.
  22319. The 'doloop_end' pattern must have a specific structure to be handled
  22320. correctly by GCC. The example below is taken (slightly simplified) from
  22321. the PDP-11 target:
  22322. (define_expand "doloop_end"
  22323. [(parallel [(set (pc)
  22324. (if_then_else
  22325. (ne (match_operand:HI 0 "nonimmediate_operand" "+r,!m")
  22326. (const_int 1))
  22327. (label_ref (match_operand 1 "" ""))
  22328. (pc)))
  22329. (set (match_dup 0)
  22330. (plus:HI (match_dup 0)
  22331. (const_int -1)))])]
  22332. ""
  22333. "{
  22334. if (GET_MODE (operands[0]) != HImode)
  22335. FAIL;
  22336. }")
  22337. (define_insn "doloop_end_insn"
  22338. [(set (pc)
  22339. (if_then_else
  22340. (ne (match_operand:HI 0 "nonimmediate_operand" "+r,!m")
  22341. (const_int 1))
  22342. (label_ref (match_operand 1 "" ""))
  22343. (pc)))
  22344. (set (match_dup 0)
  22345. (plus:HI (match_dup 0)
  22346. (const_int -1)))]
  22347. ""
  22348. {
  22349. if (which_alternative == 0)
  22350. return "sob %0,%l1";
  22351. /* emulate sob */
  22352. output_asm_insn ("dec %0", operands);
  22353. return "bne %l1";
  22354. })
  22355. The first part of the pattern describes the branch condition. GCC
  22356. supports three cases for the way the target machine handles the loop
  22357. counter:
  22358. * Loop terminates when the loop register decrements to zero. This is
  22359. represented by a 'ne' comparison of the register (its old value)
  22360. with constant 1 (as in the example above).
  22361. * Loop terminates when the loop register decrements to -1. This is
  22362. represented by a 'ne' comparison of the register with constant
  22363. zero.
  22364. * Loop terminates when the loop register decrements to a negative
  22365. value. This is represented by a 'ge' comparison of the register
  22366. with constant zero. For this case, GCC will attach a 'REG_NONNEG'
  22367. note to the 'doloop_end' insn if it can determine that the register
  22368. will be non-negative.
  22369. Since the 'doloop_end' insn is a jump insn that also has an output, the
  22370. reload pass does not handle the output operand. Therefore, the
  22371. constraint must allow for that operand to be in memory rather than a
  22372. register. In the example shown above, that is handled (in the
  22373. 'doloop_end_insn' pattern) by using a loop instruction sequence that can
  22374. handle memory operands when the memory alternative appears.
  22375. GCC does not check the mode of the loop register operand when
  22376. generating the 'doloop_end' pattern. If the pattern is only valid for
  22377. some modes but not others, the pattern should be a 'define_expand'
  22378. pattern that checks the operand mode in the preparation code, and issues
  22379. 'FAIL' if an unsupported mode is found. The example above does this,
  22380. since the machine instruction to be used only exists for 'HImode'.
  22381. If the 'doloop_end' pattern is a 'define_expand', there must also be a
  22382. 'define_insn' or 'define_insn_and_split' matching the generated pattern.
  22383. Otherwise, the compiler will fail during loop optimization.
  22384. 
  22385. File: gccint.info, Node: Insn Canonicalizations, Next: Expander Definitions, Prev: Looping Patterns, Up: Machine Desc
  22386. 17.14 Canonicalization of Instructions
  22387. ======================================
  22388. There are often cases where multiple RTL expressions could represent an
  22389. operation performed by a single machine instruction. This situation is
  22390. most commonly encountered with logical, branch, and multiply-accumulate
  22391. instructions. In such cases, the compiler attempts to convert these
  22392. multiple RTL expressions into a single canonical form to reduce the
  22393. number of insn patterns required.
  22394. In addition to algebraic simplifications, following canonicalizations
  22395. are performed:
  22396. * For commutative and comparison operators, a constant is always made
  22397. the second operand. If a machine only supports a constant as the
  22398. second operand, only patterns that match a constant in the second
  22399. operand need be supplied.
  22400. * For associative operators, a sequence of operators will always
  22401. chain to the left; for instance, only the left operand of an
  22402. integer 'plus' can itself be a 'plus'. 'and', 'ior', 'xor',
  22403. 'plus', 'mult', 'smin', 'smax', 'umin', and 'umax' are associative
  22404. when applied to integers, and sometimes to floating-point.
  22405. * For these operators, if only one operand is a 'neg', 'not', 'mult',
  22406. 'plus', or 'minus' expression, it will be the first operand.
  22407. * In combinations of 'neg', 'mult', 'plus', and 'minus', the 'neg'
  22408. operations (if any) will be moved inside the operations as far as
  22409. possible. For instance, '(neg (mult A B))' is canonicalized as
  22410. '(mult (neg A) B)', but '(plus (mult (neg B) C) A)' is
  22411. canonicalized as '(minus A (mult B C))'.
  22412. * For the 'compare' operator, a constant is always the second operand
  22413. if the first argument is a condition code register or '(cc0)'.
  22414. * For instructions that inherently set a condition code register, the
  22415. 'compare' operator is always written as the first RTL expression of
  22416. the 'parallel' instruction pattern. For example,
  22417. (define_insn ""
  22418. [(set (reg:CCZ FLAGS_REG)
  22419. (compare:CCZ
  22420. (plus:SI
  22421. (match_operand:SI 1 "register_operand" "%r")
  22422. (match_operand:SI 2 "register_operand" "r"))
  22423. (const_int 0)))
  22424. (set (match_operand:SI 0 "register_operand" "=r")
  22425. (plus:SI (match_dup 1) (match_dup 2)))]
  22426. ""
  22427. "addl %0, %1, %2")
  22428. * An operand of 'neg', 'not', 'mult', 'plus', or 'minus' is made the
  22429. first operand under the same conditions as above.
  22430. * '(ltu (plus A B) B)' is converted to '(ltu (plus A B) A)'.
  22431. Likewise with 'geu' instead of 'ltu'.
  22432. * '(minus X (const_int N))' is converted to '(plus X (const_int
  22433. -N))'.
  22434. * Within address computations (i.e., inside 'mem'), a left shift is
  22435. converted into the appropriate multiplication by a power of two.
  22436. * De Morgan's Law is used to move bitwise negation inside a bitwise
  22437. logical-and or logical-or operation. If this results in only one
  22438. operand being a 'not' expression, it will be the first one.
  22439. A machine that has an instruction that performs a bitwise
  22440. logical-and of one operand with the bitwise negation of the other
  22441. should specify the pattern for that instruction as
  22442. (define_insn ""
  22443. [(set (match_operand:M 0 ...)
  22444. (and:M (not:M (match_operand:M 1 ...))
  22445. (match_operand:M 2 ...)))]
  22446. "..."
  22447. "...")
  22448. Similarly, a pattern for a "NAND" instruction should be written
  22449. (define_insn ""
  22450. [(set (match_operand:M 0 ...)
  22451. (ior:M (not:M (match_operand:M 1 ...))
  22452. (not:M (match_operand:M 2 ...))))]
  22453. "..."
  22454. "...")
  22455. In both cases, it is not necessary to include patterns for the many
  22456. logically equivalent RTL expressions.
  22457. * The only possible RTL expressions involving both bitwise
  22458. exclusive-or and bitwise negation are '(xor:M X Y)' and '(not:M
  22459. (xor:M X Y))'.
  22460. * The sum of three items, one of which is a constant, will only
  22461. appear in the form
  22462. (plus:M (plus:M X Y) CONSTANT)
  22463. * Equality comparisons of a group of bits (usually a single bit) with
  22464. zero will be written using 'zero_extract' rather than the
  22465. equivalent 'and' or 'sign_extract' operations.
  22466. * '(sign_extend:M1 (mult:M2 (sign_extend:M2 X) (sign_extend:M2 Y)))'
  22467. is converted to '(mult:M1 (sign_extend:M1 X) (sign_extend:M1 Y))',
  22468. and likewise for 'zero_extend'.
  22469. * '(sign_extend:M1 (mult:M2 (ashiftrt:M2 X S) (sign_extend:M2 Y)))'
  22470. is converted to '(mult:M1 (sign_extend:M1 (ashiftrt:M2 X S))
  22471. (sign_extend:M1 Y))', and likewise for patterns using 'zero_extend'
  22472. and 'lshiftrt'. If the second operand of 'mult' is also a shift,
  22473. then that is extended also. This transformation is only applied
  22474. when it can be proven that the original operation had sufficient
  22475. precision to prevent overflow.
  22476. Further canonicalization rules are defined in the function
  22477. 'commutative_operand_precedence' in 'gcc/rtlanal.c'.
  22478. 
  22479. File: gccint.info, Node: Expander Definitions, Next: Insn Splitting, Prev: Insn Canonicalizations, Up: Machine Desc
  22480. 17.15 Defining RTL Sequences for Code Generation
  22481. ================================================
  22482. On some target machines, some standard pattern names for RTL generation
  22483. cannot be handled with single insn, but a sequence of RTL insns can
  22484. represent them. For these target machines, you can write a
  22485. 'define_expand' to specify how to generate the sequence of RTL.
  22486. A 'define_expand' is an RTL expression that looks almost like a
  22487. 'define_insn'; but, unlike the latter, a 'define_expand' is used only
  22488. for RTL generation and it can produce more than one RTL insn.
  22489. A 'define_expand' RTX has four operands:
  22490. * The name. Each 'define_expand' must have a name, since the only
  22491. use for it is to refer to it by name.
  22492. * The RTL template. This is a vector of RTL expressions representing
  22493. a sequence of separate instructions. Unlike 'define_insn', there
  22494. is no implicit surrounding 'PARALLEL'.
  22495. * The condition, a string containing a C expression. This expression
  22496. is used to express how the availability of this pattern depends on
  22497. subclasses of target machine, selected by command-line options when
  22498. GCC is run. This is just like the condition of a 'define_insn'
  22499. that has a standard name. Therefore, the condition (if present)
  22500. may not depend on the data in the insn being matched, but only the
  22501. target-machine-type flags. The compiler needs to test these
  22502. conditions during initialization in order to learn exactly which
  22503. named instructions are available in a particular run.
  22504. * The preparation statements, a string containing zero or more C
  22505. statements which are to be executed before RTL code is generated
  22506. from the RTL template.
  22507. Usually these statements prepare temporary registers for use as
  22508. internal operands in the RTL template, but they can also generate
  22509. RTL insns directly by calling routines such as 'emit_insn', etc.
  22510. Any such insns precede the ones that come from the RTL template.
  22511. * Optionally, a vector containing the values of attributes. *Note
  22512. Insn Attributes::.
  22513. Every RTL insn emitted by a 'define_expand' must match some
  22514. 'define_insn' in the machine description. Otherwise, the compiler will
  22515. crash when trying to generate code for the insn or trying to optimize
  22516. it.
  22517. The RTL template, in addition to controlling generation of RTL insns,
  22518. also describes the operands that need to be specified when this pattern
  22519. is used. In particular, it gives a predicate for each operand.
  22520. A true operand, which needs to be specified in order to generate RTL
  22521. from the pattern, should be described with a 'match_operand' in its
  22522. first occurrence in the RTL template. This enters information on the
  22523. operand's predicate into the tables that record such things. GCC uses
  22524. the information to preload the operand into a register if that is
  22525. required for valid RTL code. If the operand is referred to more than
  22526. once, subsequent references should use 'match_dup'.
  22527. The RTL template may also refer to internal "operands" which are
  22528. temporary registers or labels used only within the sequence made by the
  22529. 'define_expand'. Internal operands are substituted into the RTL
  22530. template with 'match_dup', never with 'match_operand'. The values of
  22531. the internal operands are not passed in as arguments by the compiler
  22532. when it requests use of this pattern. Instead, they are computed within
  22533. the pattern, in the preparation statements. These statements compute
  22534. the values and store them into the appropriate elements of 'operands' so
  22535. that 'match_dup' can find them.
  22536. There are two special macros defined for use in the preparation
  22537. statements: 'DONE' and 'FAIL'. Use them with a following semicolon, as
  22538. a statement.
  22539. 'DONE'
  22540. Use the 'DONE' macro to end RTL generation for the pattern. The
  22541. only RTL insns resulting from the pattern on this occasion will be
  22542. those already emitted by explicit calls to 'emit_insn' within the
  22543. preparation statements; the RTL template will not be generated.
  22544. 'FAIL'
  22545. Make the pattern fail on this occasion. When a pattern fails, it
  22546. means that the pattern was not truly available. The calling
  22547. routines in the compiler will try other strategies for code
  22548. generation using other patterns.
  22549. Failure is currently supported only for binary (addition,
  22550. multiplication, shifting, etc.) and bit-field ('extv', 'extzv',
  22551. and 'insv') operations.
  22552. If the preparation falls through (invokes neither 'DONE' nor 'FAIL'),
  22553. then the 'define_expand' acts like a 'define_insn' in that the RTL
  22554. template is used to generate the insn.
  22555. The RTL template is not used for matching, only for generating the
  22556. initial insn list. If the preparation statement always invokes 'DONE'
  22557. or 'FAIL', the RTL template may be reduced to a simple list of operands,
  22558. such as this example:
  22559. (define_expand "addsi3"
  22560. [(match_operand:SI 0 "register_operand" "")
  22561. (match_operand:SI 1 "register_operand" "")
  22562. (match_operand:SI 2 "register_operand" "")]
  22563. ""
  22564. "
  22565. {
  22566. handle_add (operands[0], operands[1], operands[2]);
  22567. DONE;
  22568. }")
  22569. Here is an example, the definition of left-shift for the SPUR chip:
  22570. (define_expand "ashlsi3"
  22571. [(set (match_operand:SI 0 "register_operand" "")
  22572. (ashift:SI
  22573. (match_operand:SI 1 "register_operand" "")
  22574. (match_operand:SI 2 "nonmemory_operand" "")))]
  22575. ""
  22576. "
  22577. {
  22578. if (GET_CODE (operands[2]) != CONST_INT
  22579. || (unsigned) INTVAL (operands[2]) > 3)
  22580. FAIL;
  22581. }")
  22582. This example uses 'define_expand' so that it can generate an RTL insn
  22583. for shifting when the shift-count is in the supported range of 0 to 3
  22584. but fail in other cases where machine insns aren't available. When it
  22585. fails, the compiler tries another strategy using different patterns
  22586. (such as, a library call).
  22587. If the compiler were able to handle nontrivial condition-strings in
  22588. patterns with names, then it would be possible to use a 'define_insn' in
  22589. that case. Here is another case (zero-extension on the 68000) which
  22590. makes more use of the power of 'define_expand':
  22591. (define_expand "zero_extendhisi2"
  22592. [(set (match_operand:SI 0 "general_operand" "")
  22593. (const_int 0))
  22594. (set (strict_low_part
  22595. (subreg:HI
  22596. (match_dup 0)
  22597. 0))
  22598. (match_operand:HI 1 "general_operand" ""))]
  22599. ""
  22600. "operands[1] = make_safe_from (operands[1], operands[0]);")
  22601. Here two RTL insns are generated, one to clear the entire output operand
  22602. and the other to copy the input operand into its low half. This
  22603. sequence is incorrect if the input operand refers to [the old value of]
  22604. the output operand, so the preparation statement makes sure this isn't
  22605. so. The function 'make_safe_from' copies the 'operands[1]' into a
  22606. temporary register if it refers to 'operands[0]'. It does this by
  22607. emitting another RTL insn.
  22608. Finally, a third example shows the use of an internal operand.
  22609. Zero-extension on the SPUR chip is done by 'and'-ing the result against
  22610. a halfword mask. But this mask cannot be represented by a 'const_int'
  22611. because the constant value is too large to be legitimate on this
  22612. machine. So it must be copied into a register with 'force_reg' and then
  22613. the register used in the 'and'.
  22614. (define_expand "zero_extendhisi2"
  22615. [(set (match_operand:SI 0 "register_operand" "")
  22616. (and:SI (subreg:SI
  22617. (match_operand:HI 1 "register_operand" "")
  22618. 0)
  22619. (match_dup 2)))]
  22620. ""
  22621. "operands[2]
  22622. = force_reg (SImode, GEN_INT (65535)); ")
  22623. _Note:_ If the 'define_expand' is used to serve a standard binary or
  22624. unary arithmetic operation or a bit-field operation, then the last insn
  22625. it generates must not be a 'code_label', 'barrier' or 'note'. It must
  22626. be an 'insn', 'jump_insn' or 'call_insn'. If you don't need a real insn
  22627. at the end, emit an insn to copy the result of the operation into
  22628. itself. Such an insn will generate no code, but it can avoid problems
  22629. in the compiler.
  22630. 
  22631. File: gccint.info, Node: Insn Splitting, Next: Including Patterns, Prev: Expander Definitions, Up: Machine Desc
  22632. 17.16 Defining How to Split Instructions
  22633. ========================================
  22634. There are two cases where you should specify how to split a pattern into
  22635. multiple insns. On machines that have instructions requiring delay
  22636. slots (*note Delay Slots::) or that have instructions whose output is
  22637. not available for multiple cycles (*note Processor pipeline
  22638. description::), the compiler phases that optimize these cases need to be
  22639. able to move insns into one-instruction delay slots. However, some
  22640. insns may generate more than one machine instruction. These insns
  22641. cannot be placed into a delay slot.
  22642. Often you can rewrite the single insn as a list of individual insns,
  22643. each corresponding to one machine instruction. The disadvantage of
  22644. doing so is that it will cause the compilation to be slower and require
  22645. more space. If the resulting insns are too complex, it may also
  22646. suppress some optimizations. The compiler splits the insn if there is a
  22647. reason to believe that it might improve instruction or delay slot
  22648. scheduling.
  22649. The insn combiner phase also splits putative insns. If three insns are
  22650. merged into one insn with a complex expression that cannot be matched by
  22651. some 'define_insn' pattern, the combiner phase attempts to split the
  22652. complex pattern into two insns that are recognized. Usually it can
  22653. break the complex pattern into two patterns by splitting out some
  22654. subexpression. However, in some other cases, such as performing an
  22655. addition of a large constant in two insns on a RISC machine, the way to
  22656. split the addition into two insns is machine-dependent.
  22657. The 'define_split' definition tells the compiler how to split a complex
  22658. insn into several simpler insns. It looks like this:
  22659. (define_split
  22660. [INSN-PATTERN]
  22661. "CONDITION"
  22662. [NEW-INSN-PATTERN-1
  22663. NEW-INSN-PATTERN-2
  22664. ...]
  22665. "PREPARATION-STATEMENTS")
  22666. INSN-PATTERN is a pattern that needs to be split and CONDITION is the
  22667. final condition to be tested, as in a 'define_insn'. When an insn
  22668. matching INSN-PATTERN and satisfying CONDITION is found, it is replaced
  22669. in the insn list with the insns given by NEW-INSN-PATTERN-1,
  22670. NEW-INSN-PATTERN-2, etc.
  22671. The PREPARATION-STATEMENTS are similar to those statements that are
  22672. specified for 'define_expand' (*note Expander Definitions::) and are
  22673. executed before the new RTL is generated to prepare for the generated
  22674. code or emit some insns whose pattern is not fixed. Unlike those in
  22675. 'define_expand', however, these statements must not generate any new
  22676. pseudo-registers. Once reload has completed, they also must not
  22677. allocate any space in the stack frame.
  22678. There are two special macros defined for use in the preparation
  22679. statements: 'DONE' and 'FAIL'. Use them with a following semicolon, as
  22680. a statement.
  22681. 'DONE'
  22682. Use the 'DONE' macro to end RTL generation for the splitter. The
  22683. only RTL insns generated as replacement for the matched input insn
  22684. will be those already emitted by explicit calls to 'emit_insn'
  22685. within the preparation statements; the replacement pattern is not
  22686. used.
  22687. 'FAIL'
  22688. Make the 'define_split' fail on this occasion. When a
  22689. 'define_split' fails, it means that the splitter was not truly
  22690. available for the inputs it was given, and the input insn will not
  22691. be split.
  22692. If the preparation falls through (invokes neither 'DONE' nor 'FAIL'),
  22693. then the 'define_split' uses the replacement template.
  22694. Patterns are matched against INSN-PATTERN in two different
  22695. circumstances. If an insn needs to be split for delay slot scheduling
  22696. or insn scheduling, the insn is already known to be valid, which means
  22697. that it must have been matched by some 'define_insn' and, if
  22698. 'reload_completed' is nonzero, is known to satisfy the constraints of
  22699. that 'define_insn'. In that case, the new insn patterns must also be
  22700. insns that are matched by some 'define_insn' and, if 'reload_completed'
  22701. is nonzero, must also satisfy the constraints of those definitions.
  22702. As an example of this usage of 'define_split', consider the following
  22703. example from 'a29k.md', which splits a 'sign_extend' from 'HImode' to
  22704. 'SImode' into a pair of shift insns:
  22705. (define_split
  22706. [(set (match_operand:SI 0 "gen_reg_operand" "")
  22707. (sign_extend:SI (match_operand:HI 1 "gen_reg_operand" "")))]
  22708. ""
  22709. [(set (match_dup 0)
  22710. (ashift:SI (match_dup 1)
  22711. (const_int 16)))
  22712. (set (match_dup 0)
  22713. (ashiftrt:SI (match_dup 0)
  22714. (const_int 16)))]
  22715. "
  22716. { operands[1] = gen_lowpart (SImode, operands[1]); }")
  22717. When the combiner phase tries to split an insn pattern, it is always
  22718. the case that the pattern is _not_ matched by any 'define_insn'. The
  22719. combiner pass first tries to split a single 'set' expression and then
  22720. the same 'set' expression inside a 'parallel', but followed by a
  22721. 'clobber' of a pseudo-reg to use as a scratch register. In these cases,
  22722. the combiner expects exactly one or two new insn patterns to be
  22723. generated. It will verify that these patterns match some 'define_insn'
  22724. definitions, so you need not do this test in the 'define_split' (of
  22725. course, there is no point in writing a 'define_split' that will never
  22726. produce insns that match).
  22727. Here is an example of this use of 'define_split', taken from
  22728. 'rs6000.md':
  22729. (define_split
  22730. [(set (match_operand:SI 0 "gen_reg_operand" "")
  22731. (plus:SI (match_operand:SI 1 "gen_reg_operand" "")
  22732. (match_operand:SI 2 "non_add_cint_operand" "")))]
  22733. ""
  22734. [(set (match_dup 0) (plus:SI (match_dup 1) (match_dup 3)))
  22735. (set (match_dup 0) (plus:SI (match_dup 0) (match_dup 4)))]
  22736. "
  22737. {
  22738. int low = INTVAL (operands[2]) & 0xffff;
  22739. int high = (unsigned) INTVAL (operands[2]) >> 16;
  22740. if (low & 0x8000)
  22741. high++, low |= 0xffff0000;
  22742. operands[3] = GEN_INT (high << 16);
  22743. operands[4] = GEN_INT (low);
  22744. }")
  22745. Here the predicate 'non_add_cint_operand' matches any 'const_int' that
  22746. is _not_ a valid operand of a single add insn. The add with the smaller
  22747. displacement is written so that it can be substituted into the address
  22748. of a subsequent operation.
  22749. An example that uses a scratch register, from the same file, generates
  22750. an equality comparison of a register and a large constant:
  22751. (define_split
  22752. [(set (match_operand:CC 0 "cc_reg_operand" "")
  22753. (compare:CC (match_operand:SI 1 "gen_reg_operand" "")
  22754. (match_operand:SI 2 "non_short_cint_operand" "")))
  22755. (clobber (match_operand:SI 3 "gen_reg_operand" ""))]
  22756. "find_single_use (operands[0], insn, 0)
  22757. && (GET_CODE (*find_single_use (operands[0], insn, 0)) == EQ
  22758. || GET_CODE (*find_single_use (operands[0], insn, 0)) == NE)"
  22759. [(set (match_dup 3) (xor:SI (match_dup 1) (match_dup 4)))
  22760. (set (match_dup 0) (compare:CC (match_dup 3) (match_dup 5)))]
  22761. "
  22762. {
  22763. /* Get the constant we are comparing against, C, and see what it
  22764. looks like sign-extended to 16 bits. Then see what constant
  22765. could be XOR'ed with C to get the sign-extended value. */
  22766. int c = INTVAL (operands[2]);
  22767. int sextc = (c << 16) >> 16;
  22768. int xorv = c ^ sextc;
  22769. operands[4] = GEN_INT (xorv);
  22770. operands[5] = GEN_INT (sextc);
  22771. }")
  22772. To avoid confusion, don't write a single 'define_split' that accepts
  22773. some insns that match some 'define_insn' as well as some insns that
  22774. don't. Instead, write two separate 'define_split' definitions, one for
  22775. the insns that are valid and one for the insns that are not valid.
  22776. The splitter is allowed to split jump instructions into sequence of
  22777. jumps or create new jumps in while splitting non-jump instructions. As
  22778. the control flow graph and branch prediction information needs to be
  22779. updated, several restriction apply.
  22780. Splitting of jump instruction into sequence that over by another jump
  22781. instruction is always valid, as compiler expect identical behavior of
  22782. new jump. When new sequence contains multiple jump instructions or new
  22783. labels, more assistance is needed. Splitter is required to create only
  22784. unconditional jumps, or simple conditional jump instructions.
  22785. Additionally it must attach a 'REG_BR_PROB' note to each conditional
  22786. jump. A global variable 'split_branch_probability' holds the
  22787. probability of the original branch in case it was a simple conditional
  22788. jump, -1 otherwise. To simplify recomputing of edge frequencies, the
  22789. new sequence is required to have only forward jumps to the newly created
  22790. labels.
  22791. For the common case where the pattern of a define_split exactly matches
  22792. the pattern of a define_insn, use 'define_insn_and_split'. It looks
  22793. like this:
  22794. (define_insn_and_split
  22795. [INSN-PATTERN]
  22796. "CONDITION"
  22797. "OUTPUT-TEMPLATE"
  22798. "SPLIT-CONDITION"
  22799. [NEW-INSN-PATTERN-1
  22800. NEW-INSN-PATTERN-2
  22801. ...]
  22802. "PREPARATION-STATEMENTS"
  22803. [INSN-ATTRIBUTES])
  22804. INSN-PATTERN, CONDITION, OUTPUT-TEMPLATE, and INSN-ATTRIBUTES are used
  22805. as in 'define_insn'. The NEW-INSN-PATTERN vector and the
  22806. PREPARATION-STATEMENTS are used as in a 'define_split'. The
  22807. SPLIT-CONDITION is also used as in 'define_split', with the additional
  22808. behavior that if the condition starts with '&&', the condition used for
  22809. the split will be the constructed as a logical "and" of the split
  22810. condition with the insn condition. For example, from i386.md:
  22811. (define_insn_and_split "zero_extendhisi2_and"
  22812. [(set (match_operand:SI 0 "register_operand" "=r")
  22813. (zero_extend:SI (match_operand:HI 1 "register_operand" "0")))
  22814. (clobber (reg:CC 17))]
  22815. "TARGET_ZERO_EXTEND_WITH_AND && !optimize_size"
  22816. "#"
  22817. "&& reload_completed"
  22818. [(parallel [(set (match_dup 0)
  22819. (and:SI (match_dup 0) (const_int 65535)))
  22820. (clobber (reg:CC 17))])]
  22821. ""
  22822. [(set_attr "type" "alu1")])
  22823. In this case, the actual split condition will be
  22824. 'TARGET_ZERO_EXTEND_WITH_AND && !optimize_size && reload_completed'.
  22825. The 'define_insn_and_split' construction provides exactly the same
  22826. functionality as two separate 'define_insn' and 'define_split' patterns.
  22827. It exists for compactness, and as a maintenance tool to prevent having
  22828. to ensure the two patterns' templates match.
  22829. It is sometimes useful to have a 'define_insn_and_split' that replaces
  22830. specific operands of an instruction but leaves the rest of the
  22831. instruction pattern unchanged. You can do this directly with a
  22832. 'define_insn_and_split', but it requires a NEW-INSN-PATTERN-1 that
  22833. repeats most of the original INSN-PATTERN. There is also the
  22834. complication that an implicit 'parallel' in INSN-PATTERN must become an
  22835. explicit 'parallel' in NEW-INSN-PATTERN-1, which is easy to overlook. A
  22836. simpler alternative is to use 'define_insn_and_rewrite', which is a form
  22837. of 'define_insn_and_split' that automatically generates
  22838. NEW-INSN-PATTERN-1 by replacing each 'match_operand' in INSN-PATTERN
  22839. with a corresponding 'match_dup', and each 'match_operator' in the
  22840. pattern with a corresponding 'match_op_dup'. The arguments are
  22841. otherwise identical to 'define_insn_and_split':
  22842. (define_insn_and_rewrite
  22843. [INSN-PATTERN]
  22844. "CONDITION"
  22845. "OUTPUT-TEMPLATE"
  22846. "SPLIT-CONDITION"
  22847. "PREPARATION-STATEMENTS"
  22848. [INSN-ATTRIBUTES])
  22849. The 'match_dup's and 'match_op_dup's in the new instruction pattern use
  22850. any new operand values that the PREPARATION-STATEMENTS store in the
  22851. 'operands' array, as for a normal 'define_insn_and_split'.
  22852. PREPARATION-STATEMENTS can also emit additional instructions before the
  22853. new instruction. They can even emit an entirely different sequence of
  22854. instructions and use 'DONE' to avoid emitting a new form of the original
  22855. instruction.
  22856. The split in a 'define_insn_and_rewrite' is only intended to apply to
  22857. existing instructions that match INSN-PATTERN. SPLIT-CONDITION must
  22858. therefore start with '&&', so that the split condition applies on top of
  22859. CONDITION.
  22860. Here is an example from the AArch64 SVE port, in which operand 1 is
  22861. known to be equivalent to an all-true constant and isn't used by the
  22862. output template:
  22863. (define_insn_and_rewrite "*while_ult<GPI:mode><PRED_ALL:mode>_cc"
  22864. [(set (reg:CC CC_REGNUM)
  22865. (compare:CC
  22866. (unspec:SI [(match_operand:PRED_ALL 1)
  22867. (unspec:PRED_ALL
  22868. [(match_operand:GPI 2 "aarch64_reg_or_zero" "rZ")
  22869. (match_operand:GPI 3 "aarch64_reg_or_zero" "rZ")]
  22870. UNSPEC_WHILE_LO)]
  22871. UNSPEC_PTEST_PTRUE)
  22872. (const_int 0)))
  22873. (set (match_operand:PRED_ALL 0 "register_operand" "=Upa")
  22874. (unspec:PRED_ALL [(match_dup 2)
  22875. (match_dup 3)]
  22876. UNSPEC_WHILE_LO))]
  22877. "TARGET_SVE"
  22878. "whilelo\t%0.<PRED_ALL:Vetype>, %<w>2, %<w>3"
  22879. ;; Force the compiler to drop the unused predicate operand, so that we
  22880. ;; don't have an unnecessary PTRUE.
  22881. "&& !CONSTANT_P (operands[1])"
  22882. {
  22883. operands[1] = CONSTM1_RTX (<MODE>mode);
  22884. }
  22885. )
  22886. The splitter in this case simply replaces operand 1 with the constant
  22887. value that it is known to have. The equivalent 'define_insn_and_split'
  22888. would be:
  22889. (define_insn_and_split "*while_ult<GPI:mode><PRED_ALL:mode>_cc"
  22890. [(set (reg:CC CC_REGNUM)
  22891. (compare:CC
  22892. (unspec:SI [(match_operand:PRED_ALL 1)
  22893. (unspec:PRED_ALL
  22894. [(match_operand:GPI 2 "aarch64_reg_or_zero" "rZ")
  22895. (match_operand:GPI 3 "aarch64_reg_or_zero" "rZ")]
  22896. UNSPEC_WHILE_LO)]
  22897. UNSPEC_PTEST_PTRUE)
  22898. (const_int 0)))
  22899. (set (match_operand:PRED_ALL 0 "register_operand" "=Upa")
  22900. (unspec:PRED_ALL [(match_dup 2)
  22901. (match_dup 3)]
  22902. UNSPEC_WHILE_LO))]
  22903. "TARGET_SVE"
  22904. "whilelo\t%0.<PRED_ALL:Vetype>, %<w>2, %<w>3"
  22905. ;; Force the compiler to drop the unused predicate operand, so that we
  22906. ;; don't have an unnecessary PTRUE.
  22907. "&& !CONSTANT_P (operands[1])"
  22908. [(parallel
  22909. [(set (reg:CC CC_REGNUM)
  22910. (compare:CC
  22911. (unspec:SI [(match_dup 1)
  22912. (unspec:PRED_ALL [(match_dup 2)
  22913. (match_dup 3)]
  22914. UNSPEC_WHILE_LO)]
  22915. UNSPEC_PTEST_PTRUE)
  22916. (const_int 0)))
  22917. (set (match_dup 0)
  22918. (unspec:PRED_ALL [(match_dup 2)
  22919. (match_dup 3)]
  22920. UNSPEC_WHILE_LO))])]
  22921. {
  22922. operands[1] = CONSTM1_RTX (<MODE>mode);
  22923. }
  22924. )
  22925. 
  22926. File: gccint.info, Node: Including Patterns, Next: Peephole Definitions, Prev: Insn Splitting, Up: Machine Desc
  22927. 17.17 Including Patterns in Machine Descriptions.
  22928. =================================================
  22929. The 'include' pattern tells the compiler tools where to look for
  22930. patterns that are in files other than in the file '.md'. This is used
  22931. only at build time and there is no preprocessing allowed.
  22932. It looks like:
  22933. (include
  22934. PATHNAME)
  22935. For example:
  22936. (include "filestuff")
  22937. Where PATHNAME is a string that specifies the location of the file,
  22938. specifies the include file to be in 'gcc/config/target/filestuff'. The
  22939. directory 'gcc/config/target' is regarded as the default directory.
  22940. Machine descriptions may be split up into smaller more manageable
  22941. subsections and placed into subdirectories.
  22942. By specifying:
  22943. (include "BOGUS/filestuff")
  22944. the include file is specified to be in
  22945. 'gcc/config/TARGET/BOGUS/filestuff'.
  22946. Specifying an absolute path for the include file such as;
  22947. (include "/u2/BOGUS/filestuff")
  22948. is permitted but is not encouraged.
  22949. 17.17.1 RTL Generation Tool Options for Directory Search
  22950. --------------------------------------------------------
  22951. The '-IDIR' option specifies directories to search for machine
  22952. descriptions. For example:
  22953. genrecog -I/p1/abc/proc1 -I/p2/abcd/pro2 target.md
  22954. Add the directory DIR to the head of the list of directories to be
  22955. searched for header files. This can be used to override a system
  22956. machine definition file, substituting your own version, since these
  22957. directories are searched before the default machine description file
  22958. directories. If you use more than one '-I' option, the directories are
  22959. scanned in left-to-right order; the standard default directory come
  22960. after.
  22961. 
  22962. File: gccint.info, Node: Peephole Definitions, Next: Insn Attributes, Prev: Including Patterns, Up: Machine Desc
  22963. 17.18 Machine-Specific Peephole Optimizers
  22964. ==========================================
  22965. In addition to instruction patterns the 'md' file may contain
  22966. definitions of machine-specific peephole optimizations.
  22967. The combiner does not notice certain peephole optimizations when the
  22968. data flow in the program does not suggest that it should try them. For
  22969. example, sometimes two consecutive insns related in purpose can be
  22970. combined even though the second one does not appear to use a register
  22971. computed in the first one. A machine-specific peephole optimizer can
  22972. detect such opportunities.
  22973. There are two forms of peephole definitions that may be used. The
  22974. original 'define_peephole' is run at assembly output time to match insns
  22975. and substitute assembly text. Use of 'define_peephole' is deprecated.
  22976. A newer 'define_peephole2' matches insns and substitutes new insns.
  22977. The 'peephole2' pass is run after register allocation but before
  22978. scheduling, which may result in much better code for targets that do
  22979. scheduling.
  22980. * Menu:
  22981. * define_peephole:: RTL to Text Peephole Optimizers
  22982. * define_peephole2:: RTL to RTL Peephole Optimizers
  22983. 
  22984. File: gccint.info, Node: define_peephole, Next: define_peephole2, Up: Peephole Definitions
  22985. 17.18.1 RTL to Text Peephole Optimizers
  22986. ---------------------------------------
  22987. A definition looks like this:
  22988. (define_peephole
  22989. [INSN-PATTERN-1
  22990. INSN-PATTERN-2
  22991. ...]
  22992. "CONDITION"
  22993. "TEMPLATE"
  22994. "OPTIONAL-INSN-ATTRIBUTES")
  22995. The last string operand may be omitted if you are not using any
  22996. machine-specific information in this machine description. If present,
  22997. it must obey the same rules as in a 'define_insn'.
  22998. In this skeleton, INSN-PATTERN-1 and so on are patterns to match
  22999. consecutive insns. The optimization applies to a sequence of insns when
  23000. INSN-PATTERN-1 matches the first one, INSN-PATTERN-2 matches the next,
  23001. and so on.
  23002. Each of the insns matched by a peephole must also match a
  23003. 'define_insn'. Peepholes are checked only at the last stage just before
  23004. code generation, and only optionally. Therefore, any insn which would
  23005. match a peephole but no 'define_insn' will cause a crash in code
  23006. generation in an unoptimized compilation, or at various optimization
  23007. stages.
  23008. The operands of the insns are matched with 'match_operands',
  23009. 'match_operator', and 'match_dup', as usual. What is not usual is that
  23010. the operand numbers apply to all the insn patterns in the definition.
  23011. So, you can check for identical operands in two insns by using
  23012. 'match_operand' in one insn and 'match_dup' in the other.
  23013. The operand constraints used in 'match_operand' patterns do not have
  23014. any direct effect on the applicability of the peephole, but they will be
  23015. validated afterward, so make sure your constraints are general enough to
  23016. apply whenever the peephole matches. If the peephole matches but the
  23017. constraints are not satisfied, the compiler will crash.
  23018. It is safe to omit constraints in all the operands of the peephole; or
  23019. you can write constraints which serve as a double-check on the criteria
  23020. previously tested.
  23021. Once a sequence of insns matches the patterns, the CONDITION is
  23022. checked. This is a C expression which makes the final decision whether
  23023. to perform the optimization (we do so if the expression is nonzero). If
  23024. CONDITION is omitted (in other words, the string is empty) then the
  23025. optimization is applied to every sequence of insns that matches the
  23026. patterns.
  23027. The defined peephole optimizations are applied after register
  23028. allocation is complete. Therefore, the peephole definition can check
  23029. which operands have ended up in which kinds of registers, just by
  23030. looking at the operands.
  23031. The way to refer to the operands in CONDITION is to write 'operands[I]'
  23032. for operand number I (as matched by '(match_operand I ...)'). Use the
  23033. variable 'insn' to refer to the last of the insns being matched; use
  23034. 'prev_active_insn' to find the preceding insns.
  23035. When optimizing computations with intermediate results, you can use
  23036. CONDITION to match only when the intermediate results are not used
  23037. elsewhere. Use the C expression 'dead_or_set_p (INSN, OP)', where INSN
  23038. is the insn in which you expect the value to be used for the last time
  23039. (from the value of 'insn', together with use of 'prev_nonnote_insn'),
  23040. and OP is the intermediate value (from 'operands[I]').
  23041. Applying the optimization means replacing the sequence of insns with
  23042. one new insn. The TEMPLATE controls ultimate output of assembler code
  23043. for this combined insn. It works exactly like the template of a
  23044. 'define_insn'. Operand numbers in this template are the same ones used
  23045. in matching the original sequence of insns.
  23046. The result of a defined peephole optimizer does not need to match any
  23047. of the insn patterns in the machine description; it does not even have
  23048. an opportunity to match them. The peephole optimizer definition itself
  23049. serves as the insn pattern to control how the insn is output.
  23050. Defined peephole optimizers are run as assembler code is being output,
  23051. so the insns they produce are never combined or rearranged in any way.
  23052. Here is an example, taken from the 68000 machine description:
  23053. (define_peephole
  23054. [(set (reg:SI 15) (plus:SI (reg:SI 15) (const_int 4)))
  23055. (set (match_operand:DF 0 "register_operand" "=f")
  23056. (match_operand:DF 1 "register_operand" "ad"))]
  23057. "FP_REG_P (operands[0]) && ! FP_REG_P (operands[1])"
  23058. {
  23059. rtx xoperands[2];
  23060. xoperands[1] = gen_rtx_REG (SImode, REGNO (operands[1]) + 1);
  23061. #ifdef MOTOROLA
  23062. output_asm_insn ("move.l %1,(sp)", xoperands);
  23063. output_asm_insn ("move.l %1,-(sp)", operands);
  23064. return "fmove.d (sp)+,%0";
  23065. #else
  23066. output_asm_insn ("movel %1,sp@", xoperands);
  23067. output_asm_insn ("movel %1,sp@-", operands);
  23068. return "fmoved sp@+,%0";
  23069. #endif
  23070. })
  23071. The effect of this optimization is to change
  23072. jbsr _foobar
  23073. addql #4,sp
  23074. movel d1,sp@-
  23075. movel d0,sp@-
  23076. fmoved sp@+,fp0
  23077. into
  23078. jbsr _foobar
  23079. movel d1,sp@
  23080. movel d0,sp@-
  23081. fmoved sp@+,fp0
  23082. INSN-PATTERN-1 and so on look _almost_ like the second operand of
  23083. 'define_insn'. There is one important difference: the second operand of
  23084. 'define_insn' consists of one or more RTX's enclosed in square brackets.
  23085. Usually, there is only one: then the same action can be written as an
  23086. element of a 'define_peephole'. But when there are multiple actions in
  23087. a 'define_insn', they are implicitly enclosed in a 'parallel'. Then you
  23088. must explicitly write the 'parallel', and the square brackets within it,
  23089. in the 'define_peephole'. Thus, if an insn pattern looks like this,
  23090. (define_insn "divmodsi4"
  23091. [(set (match_operand:SI 0 "general_operand" "=d")
  23092. (div:SI (match_operand:SI 1 "general_operand" "0")
  23093. (match_operand:SI 2 "general_operand" "dmsK")))
  23094. (set (match_operand:SI 3 "general_operand" "=d")
  23095. (mod:SI (match_dup 1) (match_dup 2)))]
  23096. "TARGET_68020"
  23097. "divsl%.l %2,%3:%0")
  23098. then the way to mention this insn in a peephole is as follows:
  23099. (define_peephole
  23100. [...
  23101. (parallel
  23102. [(set (match_operand:SI 0 "general_operand" "=d")
  23103. (div:SI (match_operand:SI 1 "general_operand" "0")
  23104. (match_operand:SI 2 "general_operand" "dmsK")))
  23105. (set (match_operand:SI 3 "general_operand" "=d")
  23106. (mod:SI (match_dup 1) (match_dup 2)))])
  23107. ...]
  23108. ...)
  23109. 
  23110. File: gccint.info, Node: define_peephole2, Prev: define_peephole, Up: Peephole Definitions
  23111. 17.18.2 RTL to RTL Peephole Optimizers
  23112. --------------------------------------
  23113. The 'define_peephole2' definition tells the compiler how to substitute
  23114. one sequence of instructions for another sequence, what additional
  23115. scratch registers may be needed and what their lifetimes must be.
  23116. (define_peephole2
  23117. [INSN-PATTERN-1
  23118. INSN-PATTERN-2
  23119. ...]
  23120. "CONDITION"
  23121. [NEW-INSN-PATTERN-1
  23122. NEW-INSN-PATTERN-2
  23123. ...]
  23124. "PREPARATION-STATEMENTS")
  23125. The definition is almost identical to 'define_split' (*note Insn
  23126. Splitting::) except that the pattern to match is not a single
  23127. instruction, but a sequence of instructions.
  23128. It is possible to request additional scratch registers for use in the
  23129. output template. If appropriate registers are not free, the pattern
  23130. will simply not match.
  23131. Scratch registers are requested with a 'match_scratch' pattern at the
  23132. top level of the input pattern. The allocated register (initially) will
  23133. be dead at the point requested within the original sequence. If the
  23134. scratch is used at more than a single point, a 'match_dup' pattern at
  23135. the top level of the input pattern marks the last position in the input
  23136. sequence at which the register must be available.
  23137. Here is an example from the IA-32 machine description:
  23138. (define_peephole2
  23139. [(match_scratch:SI 2 "r")
  23140. (parallel [(set (match_operand:SI 0 "register_operand" "")
  23141. (match_operator:SI 3 "arith_or_logical_operator"
  23142. [(match_dup 0)
  23143. (match_operand:SI 1 "memory_operand" "")]))
  23144. (clobber (reg:CC 17))])]
  23145. "! optimize_size && ! TARGET_READ_MODIFY"
  23146. [(set (match_dup 2) (match_dup 1))
  23147. (parallel [(set (match_dup 0)
  23148. (match_op_dup 3 [(match_dup 0) (match_dup 2)]))
  23149. (clobber (reg:CC 17))])]
  23150. "")
  23151. This pattern tries to split a load from its use in the hopes that we'll
  23152. be able to schedule around the memory load latency. It allocates a
  23153. single 'SImode' register of class 'GENERAL_REGS' ('"r"') that needs to
  23154. be live only at the point just before the arithmetic.
  23155. A real example requiring extended scratch lifetimes is harder to come
  23156. by, so here's a silly made-up example:
  23157. (define_peephole2
  23158. [(match_scratch:SI 4 "r")
  23159. (set (match_operand:SI 0 "" "") (match_operand:SI 1 "" ""))
  23160. (set (match_operand:SI 2 "" "") (match_dup 1))
  23161. (match_dup 4)
  23162. (set (match_operand:SI 3 "" "") (match_dup 1))]
  23163. "/* determine 1 does not overlap 0 and 2 */"
  23164. [(set (match_dup 4) (match_dup 1))
  23165. (set (match_dup 0) (match_dup 4))
  23166. (set (match_dup 2) (match_dup 4))
  23167. (set (match_dup 3) (match_dup 4))]
  23168. "")
  23169. There are two special macros defined for use in the preparation
  23170. statements: 'DONE' and 'FAIL'. Use them with a following semicolon, as
  23171. a statement.
  23172. 'DONE'
  23173. Use the 'DONE' macro to end RTL generation for the peephole. The
  23174. only RTL insns generated as replacement for the matched input insn
  23175. will be those already emitted by explicit calls to 'emit_insn'
  23176. within the preparation statements; the replacement pattern is not
  23177. used.
  23178. 'FAIL'
  23179. Make the 'define_peephole2' fail on this occasion. When a
  23180. 'define_peephole2' fails, it means that the replacement was not
  23181. truly available for the particular inputs it was given. In that
  23182. case, GCC may still apply a later 'define_peephole2' that also
  23183. matches the given insn pattern. (Note that this is different from
  23184. 'define_split', where 'FAIL' prevents the input insn from being
  23185. split at all.)
  23186. If the preparation falls through (invokes neither 'DONE' nor 'FAIL'),
  23187. then the 'define_peephole2' uses the replacement template.
  23188. If we had not added the '(match_dup 4)' in the middle of the input
  23189. sequence, it might have been the case that the register we chose at the
  23190. beginning of the sequence is killed by the first or second 'set'.
  23191. 
  23192. File: gccint.info, Node: Insn Attributes, Next: Conditional Execution, Prev: Peephole Definitions, Up: Machine Desc
  23193. 17.19 Instruction Attributes
  23194. ============================
  23195. In addition to describing the instruction supported by the target
  23196. machine, the 'md' file also defines a group of "attributes" and a set of
  23197. values for each. Every generated insn is assigned a value for each
  23198. attribute. One possible attribute would be the effect that the insn has
  23199. on the machine's condition code. This attribute can then be used by
  23200. 'NOTICE_UPDATE_CC' to track the condition codes.
  23201. * Menu:
  23202. * Defining Attributes:: Specifying attributes and their values.
  23203. * Expressions:: Valid expressions for attribute values.
  23204. * Tagging Insns:: Assigning attribute values to insns.
  23205. * Attr Example:: An example of assigning attributes.
  23206. * Insn Lengths:: Computing the length of insns.
  23207. * Constant Attributes:: Defining attributes that are constant.
  23208. * Mnemonic Attribute:: Obtain the instruction mnemonic as attribute value.
  23209. * Delay Slots:: Defining delay slots required for a machine.
  23210. * Processor pipeline description:: Specifying information for insn scheduling.
  23211. 
  23212. File: gccint.info, Node: Defining Attributes, Next: Expressions, Up: Insn Attributes
  23213. 17.19.1 Defining Attributes and their Values
  23214. --------------------------------------------
  23215. The 'define_attr' expression is used to define each attribute required
  23216. by the target machine. It looks like:
  23217. (define_attr NAME LIST-OF-VALUES DEFAULT)
  23218. NAME is a string specifying the name of the attribute being defined.
  23219. Some attributes are used in a special way by the rest of the compiler.
  23220. The 'enabled' attribute can be used to conditionally enable or disable
  23221. insn alternatives (*note Disable Insn Alternatives::). The 'predicable'
  23222. attribute, together with a suitable 'define_cond_exec' (*note
  23223. Conditional Execution::), can be used to automatically generate
  23224. conditional variants of instruction patterns. The 'mnemonic' attribute
  23225. can be used to check for the instruction mnemonic (*note Mnemonic
  23226. Attribute::). The compiler internally uses the names 'ce_enabled' and
  23227. 'nonce_enabled', so they should not be used elsewhere as alternative
  23228. names.
  23229. LIST-OF-VALUES is either a string that specifies a comma-separated list
  23230. of values that can be assigned to the attribute, or a null string to
  23231. indicate that the attribute takes numeric values.
  23232. DEFAULT is an attribute expression that gives the value of this
  23233. attribute for insns that match patterns whose definition does not
  23234. include an explicit value for this attribute. *Note Attr Example::, for
  23235. more information on the handling of defaults. *Note Constant
  23236. Attributes::, for information on attributes that do not depend on any
  23237. particular insn.
  23238. For each defined attribute, a number of definitions are written to the
  23239. 'insn-attr.h' file. For cases where an explicit set of values is
  23240. specified for an attribute, the following are defined:
  23241. * A '#define' is written for the symbol 'HAVE_ATTR_NAME'.
  23242. * An enumerated class is defined for 'attr_NAME' with elements of the
  23243. form 'UPPER-NAME_UPPER-VALUE' where the attribute name and value
  23244. are first converted to uppercase.
  23245. * A function 'get_attr_NAME' is defined that is passed an insn and
  23246. returns the attribute value for that insn.
  23247. For example, if the following is present in the 'md' file:
  23248. (define_attr "type" "branch,fp,load,store,arith" ...)
  23249. the following lines will be written to the file 'insn-attr.h'.
  23250. #define HAVE_ATTR_type 1
  23251. enum attr_type {TYPE_BRANCH, TYPE_FP, TYPE_LOAD,
  23252. TYPE_STORE, TYPE_ARITH};
  23253. extern enum attr_type get_attr_type ();
  23254. If the attribute takes numeric values, no 'enum' type will be defined
  23255. and the function to obtain the attribute's value will return 'int'.
  23256. There are attributes which are tied to a specific meaning. These
  23257. attributes are not free to use for other purposes:
  23258. 'length'
  23259. The 'length' attribute is used to calculate the length of emitted
  23260. code chunks. This is especially important when verifying branch
  23261. distances. *Note Insn Lengths::.
  23262. 'enabled'
  23263. The 'enabled' attribute can be defined to prevent certain
  23264. alternatives of an insn definition from being used during code
  23265. generation. *Note Disable Insn Alternatives::.
  23266. 'mnemonic'
  23267. The 'mnemonic' attribute can be defined to implement instruction
  23268. specific checks in e.g. the pipeline description. *Note Mnemonic
  23269. Attribute::.
  23270. For each of these special attributes, the corresponding
  23271. 'HAVE_ATTR_NAME' '#define' is also written when the attribute is not
  23272. defined; in that case, it is defined as '0'.
  23273. Another way of defining an attribute is to use:
  23274. (define_enum_attr "ATTR" "ENUM" DEFAULT)
  23275. This works in just the same way as 'define_attr', except that the list
  23276. of values is taken from a separate enumeration called ENUM (*note
  23277. define_enum::). This form allows you to use the same list of values for
  23278. several attributes without having to repeat the list each time. For
  23279. example:
  23280. (define_enum "processor" [
  23281. model_a
  23282. model_b
  23283. ...
  23284. ])
  23285. (define_enum_attr "arch" "processor"
  23286. (const (symbol_ref "target_arch")))
  23287. (define_enum_attr "tune" "processor"
  23288. (const (symbol_ref "target_tune")))
  23289. defines the same attributes as:
  23290. (define_attr "arch" "model_a,model_b,..."
  23291. (const (symbol_ref "target_arch")))
  23292. (define_attr "tune" "model_a,model_b,..."
  23293. (const (symbol_ref "target_tune")))
  23294. but without duplicating the processor list. The second example defines
  23295. two separate C enums ('attr_arch' and 'attr_tune') whereas the first
  23296. defines a single C enum ('processor').
  23297. 
  23298. File: gccint.info, Node: Expressions, Next: Tagging Insns, Prev: Defining Attributes, Up: Insn Attributes
  23299. 17.19.2 Attribute Expressions
  23300. -----------------------------
  23301. RTL expressions used to define attributes use the codes described above
  23302. plus a few specific to attribute definitions, to be discussed below.
  23303. Attribute value expressions must have one of the following forms:
  23304. '(const_int I)'
  23305. The integer I specifies the value of a numeric attribute. I must
  23306. be non-negative.
  23307. The value of a numeric attribute can be specified either with a
  23308. 'const_int', or as an integer represented as a string in
  23309. 'const_string', 'eq_attr' (see below), 'attr', 'symbol_ref', simple
  23310. arithmetic expressions, and 'set_attr' overrides on specific
  23311. instructions (*note Tagging Insns::).
  23312. '(const_string VALUE)'
  23313. The string VALUE specifies a constant attribute value. If VALUE is
  23314. specified as '"*"', it means that the default value of the
  23315. attribute is to be used for the insn containing this expression.
  23316. '"*"' obviously cannot be used in the DEFAULT expression of a
  23317. 'define_attr'.
  23318. If the attribute whose value is being specified is numeric, VALUE
  23319. must be a string containing a non-negative integer (normally
  23320. 'const_int' would be used in this case). Otherwise, it must
  23321. contain one of the valid values for the attribute.
  23322. '(if_then_else TEST TRUE-VALUE FALSE-VALUE)'
  23323. TEST specifies an attribute test, whose format is defined below.
  23324. The value of this expression is TRUE-VALUE if TEST is true,
  23325. otherwise it is FALSE-VALUE.
  23326. '(cond [TEST1 VALUE1 ...] DEFAULT)'
  23327. The first operand of this expression is a vector containing an even
  23328. number of expressions and consisting of pairs of TEST and VALUE
  23329. expressions. The value of the 'cond' expression is that of the
  23330. VALUE corresponding to the first true TEST expression. If none of
  23331. the TEST expressions are true, the value of the 'cond' expression
  23332. is that of the DEFAULT expression.
  23333. TEST expressions can have one of the following forms:
  23334. '(const_int I)'
  23335. This test is true if I is nonzero and false otherwise.
  23336. '(not TEST)'
  23337. '(ior TEST1 TEST2)'
  23338. '(and TEST1 TEST2)'
  23339. These tests are true if the indicated logical function is true.
  23340. '(match_operand:M N PRED CONSTRAINTS)'
  23341. This test is true if operand N of the insn whose attribute value is
  23342. being determined has mode M (this part of the test is ignored if M
  23343. is 'VOIDmode') and the function specified by the string PRED
  23344. returns a nonzero value when passed operand N and mode M (this part
  23345. of the test is ignored if PRED is the null string).
  23346. The CONSTRAINTS operand is ignored and should be the null string.
  23347. '(match_test C-EXPR)'
  23348. The test is true if C expression C-EXPR is true. In non-constant
  23349. attributes, C-EXPR has access to the following variables:
  23350. INSN
  23351. The rtl instruction under test.
  23352. WHICH_ALTERNATIVE
  23353. The 'define_insn' alternative that INSN matches. *Note Output
  23354. Statement::.
  23355. OPERANDS
  23356. An array of INSN's rtl operands.
  23357. C-EXPR behaves like the condition in a C 'if' statement, so there
  23358. is no need to explicitly convert the expression into a boolean 0 or
  23359. 1 value. For example, the following two tests are equivalent:
  23360. (match_test "x & 2")
  23361. (match_test "(x & 2) != 0")
  23362. '(le ARITH1 ARITH2)'
  23363. '(leu ARITH1 ARITH2)'
  23364. '(lt ARITH1 ARITH2)'
  23365. '(ltu ARITH1 ARITH2)'
  23366. '(gt ARITH1 ARITH2)'
  23367. '(gtu ARITH1 ARITH2)'
  23368. '(ge ARITH1 ARITH2)'
  23369. '(geu ARITH1 ARITH2)'
  23370. '(ne ARITH1 ARITH2)'
  23371. '(eq ARITH1 ARITH2)'
  23372. These tests are true if the indicated comparison of the two
  23373. arithmetic expressions is true. Arithmetic expressions are formed
  23374. with 'plus', 'minus', 'mult', 'div', 'mod', 'abs', 'neg', 'and',
  23375. 'ior', 'xor', 'not', 'ashift', 'lshiftrt', and 'ashiftrt'
  23376. expressions.
  23377. 'const_int' and 'symbol_ref' are always valid terms (*note Insn
  23378. Lengths::,for additional forms). 'symbol_ref' is a string denoting
  23379. a C expression that yields an 'int' when evaluated by the
  23380. 'get_attr_...' routine. It should normally be a global variable.
  23381. '(eq_attr NAME VALUE)'
  23382. NAME is a string specifying the name of an attribute.
  23383. VALUE is a string that is either a valid value for attribute NAME,
  23384. a comma-separated list of values, or '!' followed by a value or
  23385. list. If VALUE does not begin with a '!', this test is true if the
  23386. value of the NAME attribute of the current insn is in the list
  23387. specified by VALUE. If VALUE begins with a '!', this test is true
  23388. if the attribute's value is _not_ in the specified list.
  23389. For example,
  23390. (eq_attr "type" "load,store")
  23391. is equivalent to
  23392. (ior (eq_attr "type" "load") (eq_attr "type" "store"))
  23393. If NAME specifies an attribute of 'alternative', it refers to the
  23394. value of the compiler variable 'which_alternative' (*note Output
  23395. Statement::) and the values must be small integers. For example,
  23396. (eq_attr "alternative" "2,3")
  23397. is equivalent to
  23398. (ior (eq (symbol_ref "which_alternative") (const_int 2))
  23399. (eq (symbol_ref "which_alternative") (const_int 3)))
  23400. Note that, for most attributes, an 'eq_attr' test is simplified in
  23401. cases where the value of the attribute being tested is known for
  23402. all insns matching a particular pattern. This is by far the most
  23403. common case.
  23404. '(attr_flag NAME)'
  23405. The value of an 'attr_flag' expression is true if the flag
  23406. specified by NAME is true for the 'insn' currently being scheduled.
  23407. NAME is a string specifying one of a fixed set of flags to test.
  23408. Test the flags 'forward' and 'backward' to determine the direction
  23409. of a conditional branch.
  23410. This example describes a conditional branch delay slot which can be
  23411. nullified for forward branches that are taken (annul-true) or for
  23412. backward branches which are not taken (annul-false).
  23413. (define_delay (eq_attr "type" "cbranch")
  23414. [(eq_attr "in_branch_delay" "true")
  23415. (and (eq_attr "in_branch_delay" "true")
  23416. (attr_flag "forward"))
  23417. (and (eq_attr "in_branch_delay" "true")
  23418. (attr_flag "backward"))])
  23419. The 'forward' and 'backward' flags are false if the current 'insn'
  23420. being scheduled is not a conditional branch.
  23421. 'attr_flag' is only used during delay slot scheduling and has no
  23422. meaning to other passes of the compiler.
  23423. '(attr NAME)'
  23424. The value of another attribute is returned. This is most useful
  23425. for numeric attributes, as 'eq_attr' and 'attr_flag' produce more
  23426. efficient code for non-numeric attributes.
  23427. 
  23428. File: gccint.info, Node: Tagging Insns, Next: Attr Example, Prev: Expressions, Up: Insn Attributes
  23429. 17.19.3 Assigning Attribute Values to Insns
  23430. -------------------------------------------
  23431. The value assigned to an attribute of an insn is primarily determined by
  23432. which pattern is matched by that insn (or which 'define_peephole'
  23433. generated it). Every 'define_insn' and 'define_peephole' can have an
  23434. optional last argument to specify the values of attributes for matching
  23435. insns. The value of any attribute not specified in a particular insn is
  23436. set to the default value for that attribute, as specified in its
  23437. 'define_attr'. Extensive use of default values for attributes permits
  23438. the specification of the values for only one or two attributes in the
  23439. definition of most insn patterns, as seen in the example in the next
  23440. section.
  23441. The optional last argument of 'define_insn' and 'define_peephole' is a
  23442. vector of expressions, each of which defines the value for a single
  23443. attribute. The most general way of assigning an attribute's value is to
  23444. use a 'set' expression whose first operand is an 'attr' expression
  23445. giving the name of the attribute being set. The second operand of the
  23446. 'set' is an attribute expression (*note Expressions::) giving the value
  23447. of the attribute.
  23448. When the attribute value depends on the 'alternative' attribute (i.e.,
  23449. which is the applicable alternative in the constraint of the insn), the
  23450. 'set_attr_alternative' expression can be used. It allows the
  23451. specification of a vector of attribute expressions, one for each
  23452. alternative.
  23453. When the generality of arbitrary attribute expressions is not required,
  23454. the simpler 'set_attr' expression can be used, which allows specifying a
  23455. string giving either a single attribute value or a list of attribute
  23456. values, one for each alternative.
  23457. The form of each of the above specifications is shown below. In each
  23458. case, NAME is a string specifying the attribute to be set.
  23459. '(set_attr NAME VALUE-STRING)'
  23460. VALUE-STRING is either a string giving the desired attribute value,
  23461. or a string containing a comma-separated list giving the values for
  23462. succeeding alternatives. The number of elements must match the
  23463. number of alternatives in the constraint of the insn pattern.
  23464. Note that it may be useful to specify '*' for some alternative, in
  23465. which case the attribute will assume its default value for insns
  23466. matching that alternative.
  23467. '(set_attr_alternative NAME [VALUE1 VALUE2 ...])'
  23468. Depending on the alternative of the insn, the value will be one of
  23469. the specified values. This is a shorthand for using a 'cond' with
  23470. tests on the 'alternative' attribute.
  23471. '(set (attr NAME) VALUE)'
  23472. The first operand of this 'set' must be the special RTL expression
  23473. 'attr', whose sole operand is a string giving the name of the
  23474. attribute being set. VALUE is the value of the attribute.
  23475. The following shows three different ways of representing the same
  23476. attribute value specification:
  23477. (set_attr "type" "load,store,arith")
  23478. (set_attr_alternative "type"
  23479. [(const_string "load") (const_string "store")
  23480. (const_string "arith")])
  23481. (set (attr "type")
  23482. (cond [(eq_attr "alternative" "1") (const_string "load")
  23483. (eq_attr "alternative" "2") (const_string "store")]
  23484. (const_string "arith")))
  23485. The 'define_asm_attributes' expression provides a mechanism to specify
  23486. the attributes assigned to insns produced from an 'asm' statement. It
  23487. has the form:
  23488. (define_asm_attributes [ATTR-SETS])
  23489. where ATTR-SETS is specified the same as for both the 'define_insn' and
  23490. the 'define_peephole' expressions.
  23491. These values will typically be the "worst case" attribute values. For
  23492. example, they might indicate that the condition code will be clobbered.
  23493. A specification for a 'length' attribute is handled specially. The way
  23494. to compute the length of an 'asm' insn is to multiply the length
  23495. specified in the expression 'define_asm_attributes' by the number of
  23496. machine instructions specified in the 'asm' statement, determined by
  23497. counting the number of semicolons and newlines in the string.
  23498. Therefore, the value of the 'length' attribute specified in a
  23499. 'define_asm_attributes' should be the maximum possible length of a
  23500. single machine instruction.
  23501. 
  23502. File: gccint.info, Node: Attr Example, Next: Insn Lengths, Prev: Tagging Insns, Up: Insn Attributes
  23503. 17.19.4 Example of Attribute Specifications
  23504. -------------------------------------------
  23505. The judicious use of defaulting is important in the efficient use of
  23506. insn attributes. Typically, insns are divided into "types" and an
  23507. attribute, customarily called 'type', is used to represent this value.
  23508. This attribute is normally used only to define the default value for
  23509. other attributes. An example will clarify this usage.
  23510. Assume we have a RISC machine with a condition code and in which only
  23511. full-word operations are performed in registers. Let us assume that we
  23512. can divide all insns into loads, stores, (integer) arithmetic
  23513. operations, floating point operations, and branches.
  23514. Here we will concern ourselves with determining the effect of an insn
  23515. on the condition code and will limit ourselves to the following possible
  23516. effects: The condition code can be set unpredictably (clobbered), not be
  23517. changed, be set to agree with the results of the operation, or only
  23518. changed if the item previously set into the condition code has been
  23519. modified.
  23520. Here is part of a sample 'md' file for such a machine:
  23521. (define_attr "type" "load,store,arith,fp,branch" (const_string "arith"))
  23522. (define_attr "cc" "clobber,unchanged,set,change0"
  23523. (cond [(eq_attr "type" "load")
  23524. (const_string "change0")
  23525. (eq_attr "type" "store,branch")
  23526. (const_string "unchanged")
  23527. (eq_attr "type" "arith")
  23528. (if_then_else (match_operand:SI 0 "" "")
  23529. (const_string "set")
  23530. (const_string "clobber"))]
  23531. (const_string "clobber")))
  23532. (define_insn ""
  23533. [(set (match_operand:SI 0 "general_operand" "=r,r,m")
  23534. (match_operand:SI 1 "general_operand" "r,m,r"))]
  23535. ""
  23536. "@
  23537. move %0,%1
  23538. load %0,%1
  23539. store %0,%1"
  23540. [(set_attr "type" "arith,load,store")])
  23541. Note that we assume in the above example that arithmetic operations
  23542. performed on quantities smaller than a machine word clobber the
  23543. condition code since they will set the condition code to a value
  23544. corresponding to the full-word result.
  23545. 
  23546. File: gccint.info, Node: Insn Lengths, Next: Constant Attributes, Prev: Attr Example, Up: Insn Attributes
  23547. 17.19.5 Computing the Length of an Insn
  23548. ---------------------------------------
  23549. For many machines, multiple types of branch instructions are provided,
  23550. each for different length branch displacements. In most cases, the
  23551. assembler will choose the correct instruction to use. However, when the
  23552. assembler cannot do so, GCC can when a special attribute, the 'length'
  23553. attribute, is defined. This attribute must be defined to have numeric
  23554. values by specifying a null string in its 'define_attr'.
  23555. In the case of the 'length' attribute, two additional forms of
  23556. arithmetic terms are allowed in test expressions:
  23557. '(match_dup N)'
  23558. This refers to the address of operand N of the current insn, which
  23559. must be a 'label_ref'.
  23560. '(pc)'
  23561. For non-branch instructions and backward branch instructions, this
  23562. refers to the address of the current insn. But for forward branch
  23563. instructions, this refers to the address of the next insn, because
  23564. the length of the current insn is to be computed.
  23565. For normal insns, the length will be determined by value of the
  23566. 'length' attribute. In the case of 'addr_vec' and 'addr_diff_vec' insn
  23567. patterns, the length is computed as the number of vectors multiplied by
  23568. the size of each vector.
  23569. Lengths are measured in addressable storage units (bytes).
  23570. Note that it is possible to call functions via the 'symbol_ref'
  23571. mechanism to compute the length of an insn. However, if you use this
  23572. mechanism you must provide dummy clauses to express the maximum length
  23573. without using the function call. You can an example of this in the 'pa'
  23574. machine description for the 'call_symref' pattern.
  23575. The following macros can be used to refine the length computation:
  23576. 'ADJUST_INSN_LENGTH (INSN, LENGTH)'
  23577. If defined, modifies the length assigned to instruction INSN as a
  23578. function of the context in which it is used. LENGTH is an lvalue
  23579. that contains the initially computed length of the insn and should
  23580. be updated with the correct length of the insn.
  23581. This macro will normally not be required. A case in which it is
  23582. required is the ROMP. On this machine, the size of an 'addr_vec'
  23583. insn must be increased by two to compensate for the fact that
  23584. alignment may be required.
  23585. The routine that returns 'get_attr_length' (the value of the 'length'
  23586. attribute) can be used by the output routine to determine the form of
  23587. the branch instruction to be written, as the example below illustrates.
  23588. As an example of the specification of variable-length branches,
  23589. consider the IBM 360. If we adopt the convention that a register will
  23590. be set to the starting address of a function, we can jump to labels
  23591. within 4k of the start using a four-byte instruction. Otherwise, we
  23592. need a six-byte sequence to load the address from memory and then branch
  23593. to it.
  23594. On such a machine, a pattern for a branch instruction might be
  23595. specified as follows:
  23596. (define_insn "jump"
  23597. [(set (pc)
  23598. (label_ref (match_operand 0 "" "")))]
  23599. ""
  23600. {
  23601. return (get_attr_length (insn) == 4
  23602. ? "b %l0" : "l r15,=a(%l0); br r15");
  23603. }
  23604. [(set (attr "length")
  23605. (if_then_else (lt (match_dup 0) (const_int 4096))
  23606. (const_int 4)
  23607. (const_int 6)))])
  23608. 
  23609. File: gccint.info, Node: Constant Attributes, Next: Mnemonic Attribute, Prev: Insn Lengths, Up: Insn Attributes
  23610. 17.19.6 Constant Attributes
  23611. ---------------------------
  23612. A special form of 'define_attr', where the expression for the default
  23613. value is a 'const' expression, indicates an attribute that is constant
  23614. for a given run of the compiler. Constant attributes may be used to
  23615. specify which variety of processor is used. For example,
  23616. (define_attr "cpu" "m88100,m88110,m88000"
  23617. (const
  23618. (cond [(symbol_ref "TARGET_88100") (const_string "m88100")
  23619. (symbol_ref "TARGET_88110") (const_string "m88110")]
  23620. (const_string "m88000"))))
  23621. (define_attr "memory" "fast,slow"
  23622. (const
  23623. (if_then_else (symbol_ref "TARGET_FAST_MEM")
  23624. (const_string "fast")
  23625. (const_string "slow"))))
  23626. The routine generated for constant attributes has no parameters as it
  23627. does not depend on any particular insn. RTL expressions used to define
  23628. the value of a constant attribute may use the 'symbol_ref' form, but may
  23629. not use either the 'match_operand' form or 'eq_attr' forms involving
  23630. insn attributes.
  23631. 
  23632. File: gccint.info, Node: Mnemonic Attribute, Next: Delay Slots, Prev: Constant Attributes, Up: Insn Attributes
  23633. 17.19.7 Mnemonic Attribute
  23634. --------------------------
  23635. The 'mnemonic' attribute is a string type attribute holding the
  23636. instruction mnemonic for an insn alternative. The attribute values will
  23637. automatically be generated by the machine description parser if there is
  23638. an attribute definition in the md file:
  23639. (define_attr "mnemonic" "unknown" (const_string "unknown"))
  23640. The default value can be freely chosen as long as it does not collide
  23641. with any of the instruction mnemonics. This value will be used whenever
  23642. the machine description parser is not able to determine the mnemonic
  23643. string. This might be the case for output templates containing more
  23644. than a single instruction as in '"mvcle\t%0,%1,0\;jo\t.-4"'.
  23645. The 'mnemonic' attribute set is not generated automatically if the
  23646. instruction string is generated via C code.
  23647. An existing 'mnemonic' attribute set in an insn definition will not be
  23648. overriden by the md file parser. That way it is possible to manually
  23649. set the instruction mnemonics for the cases where the md file parser
  23650. fails to determine it automatically.
  23651. The 'mnemonic' attribute is useful for dealing with instruction
  23652. specific properties in the pipeline description without defining
  23653. additional insn attributes.
  23654. (define_attr "ooo_expanded" ""
  23655. (cond [(eq_attr "mnemonic" "dlr,dsgr,d,dsgf,stam,dsgfr,dlgr")
  23656. (const_int 1)]
  23657. (const_int 0)))
  23658. 
  23659. File: gccint.info, Node: Delay Slots, Next: Processor pipeline description, Prev: Mnemonic Attribute, Up: Insn Attributes
  23660. 17.19.8 Delay Slot Scheduling
  23661. -----------------------------
  23662. The insn attribute mechanism can be used to specify the requirements for
  23663. delay slots, if any, on a target machine. An instruction is said to
  23664. require a "delay slot" if some instructions that are physically after
  23665. the instruction are executed as if they were located before it. Classic
  23666. examples are branch and call instructions, which often execute the
  23667. following instruction before the branch or call is performed.
  23668. On some machines, conditional branch instructions can optionally
  23669. "annul" instructions in the delay slot. This means that the instruction
  23670. will not be executed for certain branch outcomes. Both instructions
  23671. that annul if the branch is true and instructions that annul if the
  23672. branch is false are supported.
  23673. Delay slot scheduling differs from instruction scheduling in that
  23674. determining whether an instruction needs a delay slot is dependent only
  23675. on the type of instruction being generated, not on data flow between the
  23676. instructions. See the next section for a discussion of data-dependent
  23677. instruction scheduling.
  23678. The requirement of an insn needing one or more delay slots is indicated
  23679. via the 'define_delay' expression. It has the following form:
  23680. (define_delay TEST
  23681. [DELAY-1 ANNUL-TRUE-1 ANNUL-FALSE-1
  23682. DELAY-2 ANNUL-TRUE-2 ANNUL-FALSE-2
  23683. ...])
  23684. TEST is an attribute test that indicates whether this 'define_delay'
  23685. applies to a particular insn. If so, the number of required delay slots
  23686. is determined by the length of the vector specified as the second
  23687. argument. An insn placed in delay slot N must satisfy attribute test
  23688. DELAY-N. ANNUL-TRUE-N is an attribute test that specifies which insns
  23689. may be annulled if the branch is true. Similarly, ANNUL-FALSE-N
  23690. specifies which insns in the delay slot may be annulled if the branch is
  23691. false. If annulling is not supported for that delay slot, '(nil)'
  23692. should be coded.
  23693. For example, in the common case where branch and call insns require a
  23694. single delay slot, which may contain any insn other than a branch or
  23695. call, the following would be placed in the 'md' file:
  23696. (define_delay (eq_attr "type" "branch,call")
  23697. [(eq_attr "type" "!branch,call") (nil) (nil)])
  23698. Multiple 'define_delay' expressions may be specified. In this case,
  23699. each such expression specifies different delay slot requirements and
  23700. there must be no insn for which tests in two 'define_delay' expressions
  23701. are both true.
  23702. For example, if we have a machine that requires one delay slot for
  23703. branches but two for calls, no delay slot can contain a branch or call
  23704. insn, and any valid insn in the delay slot for the branch can be
  23705. annulled if the branch is true, we might represent this as follows:
  23706. (define_delay (eq_attr "type" "branch")
  23707. [(eq_attr "type" "!branch,call")
  23708. (eq_attr "type" "!branch,call")
  23709. (nil)])
  23710. (define_delay (eq_attr "type" "call")
  23711. [(eq_attr "type" "!branch,call") (nil) (nil)
  23712. (eq_attr "type" "!branch,call") (nil) (nil)])
  23713. 
  23714. File: gccint.info, Node: Processor pipeline description, Prev: Delay Slots, Up: Insn Attributes
  23715. 17.19.9 Specifying processor pipeline description
  23716. -------------------------------------------------
  23717. To achieve better performance, most modern processors (super-pipelined,
  23718. superscalar RISC, and VLIW processors) have many "functional units" on
  23719. which several instructions can be executed simultaneously. An
  23720. instruction starts execution if its issue conditions are satisfied. If
  23721. not, the instruction is stalled until its conditions are satisfied.
  23722. Such "interlock (pipeline) delay" causes interruption of the fetching of
  23723. successor instructions (or demands nop instructions, e.g. for some MIPS
  23724. processors).
  23725. There are two major kinds of interlock delays in modern processors.
  23726. The first one is a data dependence delay determining "instruction
  23727. latency time". The instruction execution is not started until all
  23728. source data have been evaluated by prior instructions (there are more
  23729. complex cases when the instruction execution starts even when the data
  23730. are not available but will be ready in given time after the instruction
  23731. execution start). Taking the data dependence delays into account is
  23732. simple. The data dependence (true, output, and anti-dependence) delay
  23733. between two instructions is given by a constant. In most cases this
  23734. approach is adequate. The second kind of interlock delays is a
  23735. reservation delay. The reservation delay means that two instructions
  23736. under execution will be in need of shared processors resources, i.e.
  23737. buses, internal registers, and/or functional units, which are reserved
  23738. for some time. Taking this kind of delay into account is complex
  23739. especially for modern RISC processors.
  23740. The task of exploiting more processor parallelism is solved by an
  23741. instruction scheduler. For a better solution to this problem, the
  23742. instruction scheduler has to have an adequate description of the
  23743. processor parallelism (or "pipeline description"). GCC machine
  23744. descriptions describe processor parallelism and functional unit
  23745. reservations for groups of instructions with the aid of "regular
  23746. expressions".
  23747. The GCC instruction scheduler uses a "pipeline hazard recognizer" to
  23748. figure out the possibility of the instruction issue by the processor on
  23749. a given simulated processor cycle. The pipeline hazard recognizer is
  23750. automatically generated from the processor pipeline description. The
  23751. pipeline hazard recognizer generated from the machine description is
  23752. based on a deterministic finite state automaton (DFA): the instruction
  23753. issue is possible if there is a transition from one automaton state to
  23754. another one. This algorithm is very fast, and furthermore, its speed is
  23755. not dependent on processor complexity(1).
  23756. The rest of this section describes the directives that constitute an
  23757. automaton-based processor pipeline description. The order of these
  23758. constructions within the machine description file is not important.
  23759. The following optional construction describes names of automata
  23760. generated and used for the pipeline hazards recognition. Sometimes the
  23761. generated finite state automaton used by the pipeline hazard recognizer
  23762. is large. If we use more than one automaton and bind functional units
  23763. to the automata, the total size of the automata is usually less than the
  23764. size of the single automaton. If there is no one such construction,
  23765. only one finite state automaton is generated.
  23766. (define_automaton AUTOMATA-NAMES)
  23767. AUTOMATA-NAMES is a string giving names of the automata. The names are
  23768. separated by commas. All the automata should have unique names. The
  23769. automaton name is used in the constructions 'define_cpu_unit' and
  23770. 'define_query_cpu_unit'.
  23771. Each processor functional unit used in the description of instruction
  23772. reservations should be described by the following construction.
  23773. (define_cpu_unit UNIT-NAMES [AUTOMATON-NAME])
  23774. UNIT-NAMES is a string giving the names of the functional units
  23775. separated by commas. Don't use name 'nothing', it is reserved for other
  23776. goals.
  23777. AUTOMATON-NAME is a string giving the name of the automaton with which
  23778. the unit is bound. The automaton should be described in construction
  23779. 'define_automaton'. You should give "automaton-name", if there is a
  23780. defined automaton.
  23781. The assignment of units to automata are constrained by the uses of the
  23782. units in insn reservations. The most important constraint is: if a unit
  23783. reservation is present on a particular cycle of an alternative for an
  23784. insn reservation, then some unit from the same automaton must be present
  23785. on the same cycle for the other alternatives of the insn reservation.
  23786. The rest of the constraints are mentioned in the description of the
  23787. subsequent constructions.
  23788. The following construction describes CPU functional units analogously
  23789. to 'define_cpu_unit'. The reservation of such units can be queried for
  23790. an automaton state. The instruction scheduler never queries reservation
  23791. of functional units for given automaton state. So as a rule, you don't
  23792. need this construction. This construction could be used for future code
  23793. generation goals (e.g. to generate VLIW insn templates).
  23794. (define_query_cpu_unit UNIT-NAMES [AUTOMATON-NAME])
  23795. UNIT-NAMES is a string giving names of the functional units separated
  23796. by commas.
  23797. AUTOMATON-NAME is a string giving the name of the automaton with which
  23798. the unit is bound.
  23799. The following construction is the major one to describe pipeline
  23800. characteristics of an instruction.
  23801. (define_insn_reservation INSN-NAME DEFAULT_LATENCY
  23802. CONDITION REGEXP)
  23803. DEFAULT_LATENCY is a number giving latency time of the instruction.
  23804. There is an important difference between the old description and the
  23805. automaton based pipeline description. The latency time is used for all
  23806. dependencies when we use the old description. In the automaton based
  23807. pipeline description, the given latency time is only used for true
  23808. dependencies. The cost of anti-dependencies is always zero and the cost
  23809. of output dependencies is the difference between latency times of the
  23810. producing and consuming insns (if the difference is negative, the cost
  23811. is considered to be zero). You can always change the default costs for
  23812. any description by using the target hook 'TARGET_SCHED_ADJUST_COST'
  23813. (*note Scheduling::).
  23814. INSN-NAME is a string giving the internal name of the insn. The
  23815. internal names are used in constructions 'define_bypass' and in the
  23816. automaton description file generated for debugging. The internal name
  23817. has nothing in common with the names in 'define_insn'. It is a good
  23818. practice to use insn classes described in the processor manual.
  23819. CONDITION defines what RTL insns are described by this construction.
  23820. You should remember that you will be in trouble if CONDITION for two or
  23821. more different 'define_insn_reservation' constructions is TRUE for an
  23822. insn. In this case what reservation will be used for the insn is not
  23823. defined. Such cases are not checked during generation of the pipeline
  23824. hazards recognizer because in general recognizing that two conditions
  23825. may have the same value is quite difficult (especially if the conditions
  23826. contain 'symbol_ref'). It is also not checked during the pipeline
  23827. hazard recognizer work because it would slow down the recognizer
  23828. considerably.
  23829. REGEXP is a string describing the reservation of the cpu's functional
  23830. units by the instruction. The reservations are described by a regular
  23831. expression according to the following syntax:
  23832. regexp = regexp "," oneof
  23833. | oneof
  23834. oneof = oneof "|" allof
  23835. | allof
  23836. allof = allof "+" repeat
  23837. | repeat
  23838. repeat = element "*" number
  23839. | element
  23840. element = cpu_function_unit_name
  23841. | reservation_name
  23842. | result_name
  23843. | "nothing"
  23844. | "(" regexp ")"
  23845. * ',' is used for describing the start of the next cycle in the
  23846. reservation.
  23847. * '|' is used for describing a reservation described by the first
  23848. regular expression *or* a reservation described by the second
  23849. regular expression *or* etc.
  23850. * '+' is used for describing a reservation described by the first
  23851. regular expression *and* a reservation described by the second
  23852. regular expression *and* etc.
  23853. * '*' is used for convenience and simply means a sequence in which
  23854. the regular expression are repeated NUMBER times with cycle
  23855. advancing (see ',').
  23856. * 'cpu_function_unit_name' denotes reservation of the named
  23857. functional unit.
  23858. * 'reservation_name' -- see description of construction
  23859. 'define_reservation'.
  23860. * 'nothing' denotes no unit reservations.
  23861. Sometimes unit reservations for different insns contain common parts.
  23862. In such case, you can simplify the pipeline description by describing
  23863. the common part by the following construction
  23864. (define_reservation RESERVATION-NAME REGEXP)
  23865. RESERVATION-NAME is a string giving name of REGEXP. Functional unit
  23866. names and reservation names are in the same name space. So the
  23867. reservation names should be different from the functional unit names and
  23868. cannot be the reserved name 'nothing'.
  23869. The following construction is used to describe exceptions in the
  23870. latency time for given instruction pair. This is so called bypasses.
  23871. (define_bypass NUMBER OUT_INSN_NAMES IN_INSN_NAMES
  23872. [GUARD])
  23873. NUMBER defines when the result generated by the instructions given in
  23874. string OUT_INSN_NAMES will be ready for the instructions given in string
  23875. IN_INSN_NAMES. Each of these strings is a comma-separated list of
  23876. filename-style globs and they refer to the names of
  23877. 'define_insn_reservation's. For example:
  23878. (define_bypass 1 "cpu1_load_*, cpu1_store_*" "cpu1_load_*")
  23879. defines a bypass between instructions that start with 'cpu1_load_' or
  23880. 'cpu1_store_' and those that start with 'cpu1_load_'.
  23881. GUARD is an optional string giving the name of a C function which
  23882. defines an additional guard for the bypass. The function will get the
  23883. two insns as parameters. If the function returns zero the bypass will
  23884. be ignored for this case. The additional guard is necessary to
  23885. recognize complicated bypasses, e.g. when the consumer is only an
  23886. address of insn 'store' (not a stored value).
  23887. If there are more one bypass with the same output and input insns, the
  23888. chosen bypass is the first bypass with a guard in description whose
  23889. guard function returns nonzero. If there is no such bypass, then bypass
  23890. without the guard function is chosen.
  23891. The following five constructions are usually used to describe VLIW
  23892. processors, or more precisely, to describe a placement of small
  23893. instructions into VLIW instruction slots. They can be used for RISC
  23894. processors, too.
  23895. (exclusion_set UNIT-NAMES UNIT-NAMES)
  23896. (presence_set UNIT-NAMES PATTERNS)
  23897. (final_presence_set UNIT-NAMES PATTERNS)
  23898. (absence_set UNIT-NAMES PATTERNS)
  23899. (final_absence_set UNIT-NAMES PATTERNS)
  23900. UNIT-NAMES is a string giving names of functional units separated by
  23901. commas.
  23902. PATTERNS is a string giving patterns of functional units separated by
  23903. comma. Currently pattern is one unit or units separated by
  23904. white-spaces.
  23905. The first construction ('exclusion_set') means that each functional
  23906. unit in the first string cannot be reserved simultaneously with a unit
  23907. whose name is in the second string and vice versa. For example, the
  23908. construction is useful for describing processors (e.g. some SPARC
  23909. processors) with a fully pipelined floating point functional unit which
  23910. can execute simultaneously only single floating point insns or only
  23911. double floating point insns.
  23912. The second construction ('presence_set') means that each functional
  23913. unit in the first string cannot be reserved unless at least one of
  23914. pattern of units whose names are in the second string is reserved. This
  23915. is an asymmetric relation. For example, it is useful for description
  23916. that VLIW 'slot1' is reserved after 'slot0' reservation. We could
  23917. describe it by the following construction
  23918. (presence_set "slot1" "slot0")
  23919. Or 'slot1' is reserved only after 'slot0' and unit 'b0' reservation.
  23920. In this case we could write
  23921. (presence_set "slot1" "slot0 b0")
  23922. The third construction ('final_presence_set') is analogous to
  23923. 'presence_set'. The difference between them is when checking is done.
  23924. When an instruction is issued in given automaton state reflecting all
  23925. current and planned unit reservations, the automaton state is changed.
  23926. The first state is a source state, the second one is a result state.
  23927. Checking for 'presence_set' is done on the source state reservation,
  23928. checking for 'final_presence_set' is done on the result reservation.
  23929. This construction is useful to describe a reservation which is actually
  23930. two subsequent reservations. For example, if we use
  23931. (presence_set "slot1" "slot0")
  23932. the following insn will be never issued (because 'slot1' requires
  23933. 'slot0' which is absent in the source state).
  23934. (define_reservation "insn_and_nop" "slot0 + slot1")
  23935. but it can be issued if we use analogous 'final_presence_set'.
  23936. The forth construction ('absence_set') means that each functional unit
  23937. in the first string can be reserved only if each pattern of units whose
  23938. names are in the second string is not reserved. This is an asymmetric
  23939. relation (actually 'exclusion_set' is analogous to this one but it is
  23940. symmetric). For example it might be useful in a VLIW description to say
  23941. that 'slot0' cannot be reserved after either 'slot1' or 'slot2' have
  23942. been reserved. This can be described as:
  23943. (absence_set "slot0" "slot1, slot2")
  23944. Or 'slot2' cannot be reserved if 'slot0' and unit 'b0' are reserved or
  23945. 'slot1' and unit 'b1' are reserved. In this case we could write
  23946. (absence_set "slot2" "slot0 b0, slot1 b1")
  23947. All functional units mentioned in a set should belong to the same
  23948. automaton.
  23949. The last construction ('final_absence_set') is analogous to
  23950. 'absence_set' but checking is done on the result (state) reservation.
  23951. See comments for 'final_presence_set'.
  23952. You can control the generator of the pipeline hazard recognizer with
  23953. the following construction.
  23954. (automata_option OPTIONS)
  23955. OPTIONS is a string giving options which affect the generated code.
  23956. Currently there are the following options:
  23957. * "no-minimization" makes no minimization of the automaton. This is
  23958. only worth to do when we are debugging the description and need to
  23959. look more accurately at reservations of states.
  23960. * "time" means printing time statistics about the generation of
  23961. automata.
  23962. * "stats" means printing statistics about the generated automata such
  23963. as the number of DFA states, NDFA states and arcs.
  23964. * "v" means a generation of the file describing the result automata.
  23965. The file has suffix '.dfa' and can be used for the description
  23966. verification and debugging.
  23967. * "w" means a generation of warning instead of error for non-critical
  23968. errors.
  23969. * "no-comb-vect" prevents the automaton generator from generating two
  23970. data structures and comparing them for space efficiency. Using a
  23971. comb vector to represent transitions may be better, but it can be
  23972. very expensive to construct. This option is useful if the build
  23973. process spends an unacceptably long time in genautomata.
  23974. * "ndfa" makes nondeterministic finite state automata. This affects
  23975. the treatment of operator '|' in the regular expressions. The
  23976. usual treatment of the operator is to try the first alternative
  23977. and, if the reservation is not possible, the second alternative.
  23978. The nondeterministic treatment means trying all alternatives, some
  23979. of them may be rejected by reservations in the subsequent insns.
  23980. * "collapse-ndfa" modifies the behavior of the generator when
  23981. producing an automaton. An additional state transition to collapse
  23982. a nondeterministic NDFA state to a deterministic DFA state is
  23983. generated. It can be triggered by passing 'const0_rtx' to
  23984. state_transition. In such an automaton, cycle advance transitions
  23985. are available only for these collapsed states. This option is
  23986. useful for ports that want to use the 'ndfa' option, but also want
  23987. to use 'define_query_cpu_unit' to assign units to insns issued in a
  23988. cycle.
  23989. * "progress" means output of a progress bar showing how many states
  23990. were generated so far for automaton being processed. This is
  23991. useful during debugging a DFA description. If you see too many
  23992. generated states, you could interrupt the generator of the pipeline
  23993. hazard recognizer and try to figure out a reason for generation of
  23994. the huge automaton.
  23995. As an example, consider a superscalar RISC machine which can issue
  23996. three insns (two integer insns and one floating point insn) on the cycle
  23997. but can finish only two insns. To describe this, we define the
  23998. following functional units.
  23999. (define_cpu_unit "i0_pipeline, i1_pipeline, f_pipeline")
  24000. (define_cpu_unit "port0, port1")
  24001. All simple integer insns can be executed in any integer pipeline and
  24002. their result is ready in two cycles. The simple integer insns are
  24003. issued into the first pipeline unless it is reserved, otherwise they are
  24004. issued into the second pipeline. Integer division and multiplication
  24005. insns can be executed only in the second integer pipeline and their
  24006. results are ready correspondingly in 9 and 4 cycles. The integer
  24007. division is not pipelined, i.e. the subsequent integer division insn
  24008. cannot be issued until the current division insn finished. Floating
  24009. point insns are fully pipelined and their results are ready in 3 cycles.
  24010. Where the result of a floating point insn is used by an integer insn, an
  24011. additional delay of one cycle is incurred. To describe all of this we
  24012. could specify
  24013. (define_cpu_unit "div")
  24014. (define_insn_reservation "simple" 2 (eq_attr "type" "int")
  24015. "(i0_pipeline | i1_pipeline), (port0 | port1)")
  24016. (define_insn_reservation "mult" 4 (eq_attr "type" "mult")
  24017. "i1_pipeline, nothing*2, (port0 | port1)")
  24018. (define_insn_reservation "div" 9 (eq_attr "type" "div")
  24019. "i1_pipeline, div*7, div + (port0 | port1)")
  24020. (define_insn_reservation "float" 3 (eq_attr "type" "float")
  24021. "f_pipeline, nothing, (port0 | port1))
  24022. (define_bypass 4 "float" "simple,mult,div")
  24023. To simplify the description we could describe the following reservation
  24024. (define_reservation "finish" "port0|port1")
  24025. and use it in all 'define_insn_reservation' as in the following
  24026. construction
  24027. (define_insn_reservation "simple" 2 (eq_attr "type" "int")
  24028. "(i0_pipeline | i1_pipeline), finish")
  24029. ---------- Footnotes ----------
  24030. (1) However, the size of the automaton depends on processor
  24031. complexity. To limit this effect, machine descriptions can split
  24032. orthogonal parts of the machine description among several automata: but
  24033. then, since each of these must be stepped independently, this does cause
  24034. a small decrease in the algorithm's performance.
  24035. 
  24036. File: gccint.info, Node: Conditional Execution, Next: Define Subst, Prev: Insn Attributes, Up: Machine Desc
  24037. 17.20 Conditional Execution
  24038. ===========================
  24039. A number of architectures provide for some form of conditional
  24040. execution, or predication. The hallmark of this feature is the ability
  24041. to nullify most of the instructions in the instruction set. When the
  24042. instruction set is large and not entirely symmetric, it can be quite
  24043. tedious to describe these forms directly in the '.md' file. An
  24044. alternative is the 'define_cond_exec' template.
  24045. (define_cond_exec
  24046. [PREDICATE-PATTERN]
  24047. "CONDITION"
  24048. "OUTPUT-TEMPLATE"
  24049. "OPTIONAL-INSN-ATTRIBUES")
  24050. PREDICATE-PATTERN is the condition that must be true for the insn to be
  24051. executed at runtime and should match a relational operator. One can use
  24052. 'match_operator' to match several relational operators at once. Any
  24053. 'match_operand' operands must have no more than one alternative.
  24054. CONDITION is a C expression that must be true for the generated pattern
  24055. to match.
  24056. OUTPUT-TEMPLATE is a string similar to the 'define_insn' output
  24057. template (*note Output Template::), except that the '*' and '@' special
  24058. cases do not apply. This is only useful if the assembly text for the
  24059. predicate is a simple prefix to the main insn. In order to handle the
  24060. general case, there is a global variable 'current_insn_predicate' that
  24061. will contain the entire predicate if the current insn is predicated, and
  24062. will otherwise be 'NULL'.
  24063. OPTIONAL-INSN-ATTRIBUTES is an optional vector of attributes that gets
  24064. appended to the insn attributes of the produced cond_exec rtx. It can
  24065. be used to add some distinguishing attribute to cond_exec rtxs produced
  24066. that way. An example usage would be to use this attribute in
  24067. conjunction with attributes on the main pattern to disable particular
  24068. alternatives under certain conditions.
  24069. When 'define_cond_exec' is used, an implicit reference to the
  24070. 'predicable' instruction attribute is made. *Note Insn Attributes::.
  24071. This attribute must be a boolean (i.e. have exactly two elements in its
  24072. LIST-OF-VALUES), with the possible values being 'no' and 'yes'. The
  24073. default and all uses in the insns must be a simple constant, not a
  24074. complex expressions. It may, however, depend on the alternative, by
  24075. using a comma-separated list of values. If that is the case, the port
  24076. should also define an 'enabled' attribute (*note Disable Insn
  24077. Alternatives::), which should also allow only 'no' and 'yes' as its
  24078. values.
  24079. For each 'define_insn' for which the 'predicable' attribute is true, a
  24080. new 'define_insn' pattern will be generated that matches a predicated
  24081. version of the instruction. For example,
  24082. (define_insn "addsi"
  24083. [(set (match_operand:SI 0 "register_operand" "r")
  24084. (plus:SI (match_operand:SI 1 "register_operand" "r")
  24085. (match_operand:SI 2 "register_operand" "r")))]
  24086. "TEST1"
  24087. "add %2,%1,%0")
  24088. (define_cond_exec
  24089. [(ne (match_operand:CC 0 "register_operand" "c")
  24090. (const_int 0))]
  24091. "TEST2"
  24092. "(%0)")
  24093. generates a new pattern
  24094. (define_insn ""
  24095. [(cond_exec
  24096. (ne (match_operand:CC 3 "register_operand" "c") (const_int 0))
  24097. (set (match_operand:SI 0 "register_operand" "r")
  24098. (plus:SI (match_operand:SI 1 "register_operand" "r")
  24099. (match_operand:SI 2 "register_operand" "r"))))]
  24100. "(TEST2) && (TEST1)"
  24101. "(%3) add %2,%1,%0")
  24102. 
  24103. File: gccint.info, Node: Define Subst, Next: Constant Definitions, Prev: Conditional Execution, Up: Machine Desc
  24104. 17.21 RTL Templates Transformations
  24105. ===================================
  24106. For some hardware architectures there are common cases when the RTL
  24107. templates for the instructions can be derived from the other RTL
  24108. templates using simple transformations. E.g., 'i386.md' contains an RTL
  24109. template for the ordinary 'sub' instruction-- '*subsi_1', and for the
  24110. 'sub' instruction with subsequent zero-extension--'*subsi_1_zext'. Such
  24111. cases can be easily implemented by a single meta-template capable of
  24112. generating a modified case based on the initial one:
  24113. (define_subst "NAME"
  24114. [INPUT-TEMPLATE]
  24115. "CONDITION"
  24116. [OUTPUT-TEMPLATE])
  24117. INPUT-TEMPLATE is a pattern describing the source RTL template, which
  24118. will be transformed.
  24119. CONDITION is a C expression that is conjunct with the condition from
  24120. the input-template to generate a condition to be used in the
  24121. output-template.
  24122. OUTPUT-TEMPLATE is a pattern that will be used in the resulting
  24123. template.
  24124. 'define_subst' mechanism is tightly coupled with the notion of the
  24125. subst attribute (*note Subst Iterators::). The use of 'define_subst' is
  24126. triggered by a reference to a subst attribute in the transforming RTL
  24127. template. This reference initiates duplication of the source RTL
  24128. template and substitution of the attributes with their values. The
  24129. source RTL template is left unchanged, while the copy is transformed by
  24130. 'define_subst'. This transformation can fail in the case when the
  24131. source RTL template is not matched against the input-template of the
  24132. 'define_subst'. In such case the copy is deleted.
  24133. 'define_subst' can be used only in 'define_insn' and 'define_expand',
  24134. it cannot be used in other expressions (e.g. in
  24135. 'define_insn_and_split').
  24136. * Menu:
  24137. * Define Subst Example:: Example of 'define_subst' work.
  24138. * Define Subst Pattern Matching:: Process of template comparison.
  24139. * Define Subst Output Template:: Generation of output template.
  24140. 
  24141. File: gccint.info, Node: Define Subst Example, Next: Define Subst Pattern Matching, Up: Define Subst
  24142. 17.21.1 'define_subst' Example
  24143. ------------------------------
  24144. To illustrate how 'define_subst' works, let us examine a simple template
  24145. transformation.
  24146. Suppose there are two kinds of instructions: one that touches flags and
  24147. the other that does not. The instructions of the second type could be
  24148. generated with the following 'define_subst':
  24149. (define_subst "add_clobber_subst"
  24150. [(set (match_operand:SI 0 "" "")
  24151. (match_operand:SI 1 "" ""))]
  24152. ""
  24153. [(set (match_dup 0)
  24154. (match_dup 1))
  24155. (clobber (reg:CC FLAGS_REG))])
  24156. This 'define_subst' can be applied to any RTL pattern containing 'set'
  24157. of mode SI and generates a copy with clobber when it is applied.
  24158. Assume there is an RTL template for a 'max' instruction to be used in
  24159. 'define_subst' mentioned above:
  24160. (define_insn "maxsi"
  24161. [(set (match_operand:SI 0 "register_operand" "=r")
  24162. (max:SI
  24163. (match_operand:SI 1 "register_operand" "r")
  24164. (match_operand:SI 2 "register_operand" "r")))]
  24165. ""
  24166. "max\t{%2, %1, %0|%0, %1, %2}"
  24167. [...])
  24168. To mark the RTL template for 'define_subst' application,
  24169. subst-attributes are used. They should be declared in advance:
  24170. (define_subst_attr "add_clobber_name" "add_clobber_subst" "_noclobber" "_clobber")
  24171. Here 'add_clobber_name' is the attribute name, 'add_clobber_subst' is
  24172. the name of the corresponding 'define_subst', the third argument
  24173. ('_noclobber') is the attribute value that would be substituted into the
  24174. unchanged version of the source RTL template, and the last argument
  24175. ('_clobber') is the value that would be substituted into the second,
  24176. transformed, version of the RTL template.
  24177. Once the subst-attribute has been defined, it should be used in RTL
  24178. templates which need to be processed by the 'define_subst'. So, the
  24179. original RTL template should be changed:
  24180. (define_insn "maxsi<add_clobber_name>"
  24181. [(set (match_operand:SI 0 "register_operand" "=r")
  24182. (max:SI
  24183. (match_operand:SI 1 "register_operand" "r")
  24184. (match_operand:SI 2 "register_operand" "r")))]
  24185. ""
  24186. "max\t{%2, %1, %0|%0, %1, %2}"
  24187. [...])
  24188. The result of the 'define_subst' usage would look like the following:
  24189. (define_insn "maxsi_noclobber"
  24190. [(set (match_operand:SI 0 "register_operand" "=r")
  24191. (max:SI
  24192. (match_operand:SI 1 "register_operand" "r")
  24193. (match_operand:SI 2 "register_operand" "r")))]
  24194. ""
  24195. "max\t{%2, %1, %0|%0, %1, %2}"
  24196. [...])
  24197. (define_insn "maxsi_clobber"
  24198. [(set (match_operand:SI 0 "register_operand" "=r")
  24199. (max:SI
  24200. (match_operand:SI 1 "register_operand" "r")
  24201. (match_operand:SI 2 "register_operand" "r")))
  24202. (clobber (reg:CC FLAGS_REG))]
  24203. ""
  24204. "max\t{%2, %1, %0|%0, %1, %2}"
  24205. [...])
  24206. 
  24207. File: gccint.info, Node: Define Subst Pattern Matching, Next: Define Subst Output Template, Prev: Define Subst Example, Up: Define Subst
  24208. 17.21.2 Pattern Matching in 'define_subst'
  24209. ------------------------------------------
  24210. All expressions, allowed in 'define_insn' or 'define_expand', are
  24211. allowed in the input-template of 'define_subst', except 'match_par_dup',
  24212. 'match_scratch', 'match_parallel'. The meanings of expressions in the
  24213. input-template were changed:
  24214. 'match_operand' matches any expression (possibly, a subtree in
  24215. RTL-template), if modes of the 'match_operand' and this expression are
  24216. the same, or mode of the 'match_operand' is 'VOIDmode', or this
  24217. expression is 'match_dup', 'match_op_dup'. If the expression is
  24218. 'match_operand' too, and predicate of 'match_operand' from the input
  24219. pattern is not empty, then the predicates are compared. That can be
  24220. used for more accurate filtering of accepted RTL-templates.
  24221. 'match_operator' matches common operators (like 'plus', 'minus'),
  24222. 'unspec', 'unspec_volatile' operators and 'match_operator's from the
  24223. original pattern if the modes match and 'match_operator' from the input
  24224. pattern has the same number of operands as the operator from the
  24225. original pattern.
  24226. 
  24227. File: gccint.info, Node: Define Subst Output Template, Prev: Define Subst Pattern Matching, Up: Define Subst
  24228. 17.21.3 Generation of output template in 'define_subst'
  24229. -------------------------------------------------------
  24230. If all necessary checks for 'define_subst' application pass, a new
  24231. RTL-pattern, based on the output-template, is created to replace the old
  24232. template. Like in input-patterns, meanings of some RTL expressions are
  24233. changed when they are used in output-patterns of a 'define_subst'.
  24234. Thus, 'match_dup' is used for copying the whole expression from the
  24235. original pattern, which matched corresponding 'match_operand' from the
  24236. input pattern.
  24237. 'match_dup N' is used in the output template to be replaced with the
  24238. expression from the original pattern, which matched 'match_operand N'
  24239. from the input pattern. As a consequence, 'match_dup' cannot be used to
  24240. point to 'match_operand's from the output pattern, it should always
  24241. refer to a 'match_operand' from the input pattern. If a 'match_dup N'
  24242. occurs more than once in the output template, its first occurrence is
  24243. replaced with the expression from the original pattern, and the
  24244. subsequent expressions are replaced with 'match_dup N', i.e., a
  24245. reference to the first expression.
  24246. In the output template one can refer to the expressions from the
  24247. original pattern and create new ones. For instance, some operands could
  24248. be added by means of standard 'match_operand'.
  24249. After replacing 'match_dup' with some RTL-subtree from the original
  24250. pattern, it could happen that several 'match_operand's in the output
  24251. pattern have the same indexes. It is unknown, how many and what indexes
  24252. would be used in the expression which would replace 'match_dup', so such
  24253. conflicts in indexes are inevitable. To overcome this issue,
  24254. 'match_operands' and 'match_operators', which were introduced into the
  24255. output pattern, are renumerated when all 'match_dup's are replaced.
  24256. Number of alternatives in 'match_operand's introduced into the output
  24257. template 'M' could differ from the number of alternatives in the
  24258. original pattern 'N', so in the resultant pattern there would be 'N*M'
  24259. alternatives. Thus, constraints from the original pattern would be
  24260. duplicated 'N' times, constraints from the output pattern would be
  24261. duplicated 'M' times, producing all possible combinations.
  24262. 
  24263. File: gccint.info, Node: Constant Definitions, Next: Iterators, Prev: Define Subst, Up: Machine Desc
  24264. 17.22 Constant Definitions
  24265. ==========================
  24266. Using literal constants inside instruction patterns reduces legibility
  24267. and can be a maintenance problem.
  24268. To overcome this problem, you may use the 'define_constants'
  24269. expression. It contains a vector of name-value pairs. From that point
  24270. on, wherever any of the names appears in the MD file, it is as if the
  24271. corresponding value had been written instead. You may use
  24272. 'define_constants' multiple times; each appearance adds more constants
  24273. to the table. It is an error to redefine a constant with a different
  24274. value.
  24275. To come back to the a29k load multiple example, instead of
  24276. (define_insn ""
  24277. [(match_parallel 0 "load_multiple_operation"
  24278. [(set (match_operand:SI 1 "gpc_reg_operand" "=r")
  24279. (match_operand:SI 2 "memory_operand" "m"))
  24280. (use (reg:SI 179))
  24281. (clobber (reg:SI 179))])]
  24282. ""
  24283. "loadm 0,0,%1,%2")
  24284. You could write:
  24285. (define_constants [
  24286. (R_BP 177)
  24287. (R_FC 178)
  24288. (R_CR 179)
  24289. (R_Q 180)
  24290. ])
  24291. (define_insn ""
  24292. [(match_parallel 0 "load_multiple_operation"
  24293. [(set (match_operand:SI 1 "gpc_reg_operand" "=r")
  24294. (match_operand:SI 2 "memory_operand" "m"))
  24295. (use (reg:SI R_CR))
  24296. (clobber (reg:SI R_CR))])]
  24297. ""
  24298. "loadm 0,0,%1,%2")
  24299. The constants that are defined with a define_constant are also output
  24300. in the insn-codes.h header file as #defines.
  24301. You can also use the machine description file to define enumerations.
  24302. Like the constants defined by 'define_constant', these enumerations are
  24303. visible to both the machine description file and the main C code.
  24304. The syntax is as follows:
  24305. (define_c_enum "NAME" [
  24306. VALUE0
  24307. VALUE1
  24308. ...
  24309. VALUEN
  24310. ])
  24311. This definition causes the equivalent of the following C code to appear
  24312. in 'insn-constants.h':
  24313. enum NAME {
  24314. VALUE0 = 0,
  24315. VALUE1 = 1,
  24316. ...
  24317. VALUEN = N
  24318. };
  24319. #define NUM_CNAME_VALUES (N + 1)
  24320. where CNAME is the capitalized form of NAME. It also makes each VALUEI
  24321. available in the machine description file, just as if it had been
  24322. declared with:
  24323. (define_constants [(VALUEI I)])
  24324. Each VALUEI is usually an upper-case identifier and usually begins with
  24325. CNAME.
  24326. You can split the enumeration definition into as many statements as you
  24327. like. The above example is directly equivalent to:
  24328. (define_c_enum "NAME" [VALUE0])
  24329. (define_c_enum "NAME" [VALUE1])
  24330. ...
  24331. (define_c_enum "NAME" [VALUEN])
  24332. Splitting the enumeration helps to improve the modularity of each
  24333. individual '.md' file. For example, if a port defines its
  24334. synchronization instructions in a separate 'sync.md' file, it is
  24335. convenient to define all synchronization-specific enumeration values in
  24336. 'sync.md' rather than in the main '.md' file.
  24337. Some enumeration names have special significance to GCC:
  24338. 'unspecv'
  24339. If an enumeration called 'unspecv' is defined, GCC will use it when
  24340. printing out 'unspec_volatile' expressions. For example:
  24341. (define_c_enum "unspecv" [
  24342. UNSPECV_BLOCKAGE
  24343. ])
  24344. causes GCC to print '(unspec_volatile ... 0)' as:
  24345. (unspec_volatile ... UNSPECV_BLOCKAGE)
  24346. 'unspec'
  24347. If an enumeration called 'unspec' is defined, GCC will use it when
  24348. printing out 'unspec' expressions. GCC will also use it when
  24349. printing out 'unspec_volatile' expressions unless an 'unspecv'
  24350. enumeration is also defined. You can therefore decide whether to
  24351. keep separate enumerations for volatile and non-volatile
  24352. expressions or whether to use the same enumeration for both.
  24353. Another way of defining an enumeration is to use 'define_enum':
  24354. (define_enum "NAME" [
  24355. VALUE0
  24356. VALUE1
  24357. ...
  24358. VALUEN
  24359. ])
  24360. This directive implies:
  24361. (define_c_enum "NAME" [
  24362. CNAME_CVALUE0
  24363. CNAME_CVALUE1
  24364. ...
  24365. CNAME_CVALUEN
  24366. ])
  24367. where CVALUEI is the capitalized form of VALUEI. However, unlike
  24368. 'define_c_enum', the enumerations defined by 'define_enum' can be used
  24369. in attribute specifications (*note define_enum_attr::).
  24370. 
  24371. File: gccint.info, Node: Iterators, Prev: Constant Definitions, Up: Machine Desc
  24372. 17.23 Iterators
  24373. ===============
  24374. Ports often need to define similar patterns for more than one machine
  24375. mode or for more than one rtx code. GCC provides some simple iterator
  24376. facilities to make this process easier.
  24377. * Menu:
  24378. * Mode Iterators:: Generating variations of patterns for different modes.
  24379. * Code Iterators:: Doing the same for codes.
  24380. * Int Iterators:: Doing the same for integers.
  24381. * Subst Iterators:: Generating variations of patterns for define_subst.
  24382. * Parameterized Names:: Specifying iterator values in C++ code.
  24383. 
  24384. File: gccint.info, Node: Mode Iterators, Next: Code Iterators, Up: Iterators
  24385. 17.23.1 Mode Iterators
  24386. ----------------------
  24387. Ports often need to define similar patterns for two or more different
  24388. modes. For example:
  24389. * If a processor has hardware support for both single and double
  24390. floating-point arithmetic, the 'SFmode' patterns tend to be very
  24391. similar to the 'DFmode' ones.
  24392. * If a port uses 'SImode' pointers in one configuration and 'DImode'
  24393. pointers in another, it will usually have very similar 'SImode' and
  24394. 'DImode' patterns for manipulating pointers.
  24395. Mode iterators allow several patterns to be instantiated from one '.md'
  24396. file template. They can be used with any type of rtx-based construct,
  24397. such as a 'define_insn', 'define_split', or 'define_peephole2'.
  24398. * Menu:
  24399. * Defining Mode Iterators:: Defining a new mode iterator.
  24400. * Substitutions:: Combining mode iterators with substitutions
  24401. * Examples:: Examples
  24402. 
  24403. File: gccint.info, Node: Defining Mode Iterators, Next: Substitutions, Up: Mode Iterators
  24404. 17.23.1.1 Defining Mode Iterators
  24405. .................................
  24406. The syntax for defining a mode iterator is:
  24407. (define_mode_iterator NAME [(MODE1 "COND1") ... (MODEN "CONDN")])
  24408. This allows subsequent '.md' file constructs to use the mode suffix
  24409. ':NAME'. Every construct that does so will be expanded N times, once
  24410. with every use of ':NAME' replaced by ':MODE1', once with every use
  24411. replaced by ':MODE2', and so on. In the expansion for a particular
  24412. MODEI, every C condition will also require that CONDI be true.
  24413. For example:
  24414. (define_mode_iterator P [(SI "Pmode == SImode") (DI "Pmode == DImode")])
  24415. defines a new mode suffix ':P'. Every construct that uses ':P' will be
  24416. expanded twice, once with every ':P' replaced by ':SI' and once with
  24417. every ':P' replaced by ':DI'. The ':SI' version will only apply if
  24418. 'Pmode == SImode' and the ':DI' version will only apply if 'Pmode ==
  24419. DImode'.
  24420. As with other '.md' conditions, an empty string is treated as "always
  24421. true". '(MODE "")' can also be abbreviated to 'MODE'. For example:
  24422. (define_mode_iterator GPR [SI (DI "TARGET_64BIT")])
  24423. means that the ':DI' expansion only applies if 'TARGET_64BIT' but that
  24424. the ':SI' expansion has no such constraint.
  24425. Iterators are applied in the order they are defined. This can be
  24426. significant if two iterators are used in a construct that requires
  24427. substitutions. *Note Substitutions::.
  24428. 
  24429. File: gccint.info, Node: Substitutions, Next: Examples, Prev: Defining Mode Iterators, Up: Mode Iterators
  24430. 17.23.1.2 Substitution in Mode Iterators
  24431. ........................................
  24432. If an '.md' file construct uses mode iterators, each version of the
  24433. construct will often need slightly different strings or modes. For
  24434. example:
  24435. * When a 'define_expand' defines several 'addM3' patterns (*note
  24436. Standard Names::), each expander will need to use the appropriate
  24437. mode name for M.
  24438. * When a 'define_insn' defines several instruction patterns, each
  24439. instruction will often use a different assembler mnemonic.
  24440. * When a 'define_insn' requires operands with different modes, using
  24441. an iterator for one of the operand modes usually requires a
  24442. specific mode for the other operand(s).
  24443. GCC supports such variations through a system of "mode attributes".
  24444. There are two standard attributes: 'mode', which is the name of the mode
  24445. in lower case, and 'MODE', which is the same thing in upper case. You
  24446. can define other attributes using:
  24447. (define_mode_attr NAME [(MODE1 "VALUE1") ... (MODEN "VALUEN")])
  24448. where NAME is the name of the attribute and VALUEI is the value
  24449. associated with MODEI.
  24450. When GCC replaces some :ITERATOR with :MODE, it will scan each string
  24451. and mode in the pattern for sequences of the form '<ITERATOR:ATTR>',
  24452. where ATTR is the name of a mode attribute. If the attribute is defined
  24453. for MODE, the whole '<...>' sequence will be replaced by the appropriate
  24454. attribute value.
  24455. For example, suppose an '.md' file has:
  24456. (define_mode_iterator P [(SI "Pmode == SImode") (DI "Pmode == DImode")])
  24457. (define_mode_attr load [(SI "lw") (DI "ld")])
  24458. If one of the patterns that uses ':P' contains the string
  24459. '"<P:load>\t%0,%1"', the 'SI' version of that pattern will use
  24460. '"lw\t%0,%1"' and the 'DI' version will use '"ld\t%0,%1"'.
  24461. Here is an example of using an attribute for a mode:
  24462. (define_mode_iterator LONG [SI DI])
  24463. (define_mode_attr SHORT [(SI "HI") (DI "SI")])
  24464. (define_insn ...
  24465. (sign_extend:LONG (match_operand:<LONG:SHORT> ...)) ...)
  24466. The 'ITERATOR:' prefix may be omitted, in which case the substitution
  24467. will be attempted for every iterator expansion.
  24468. 
  24469. File: gccint.info, Node: Examples, Prev: Substitutions, Up: Mode Iterators
  24470. 17.23.1.3 Mode Iterator Examples
  24471. ................................
  24472. Here is an example from the MIPS port. It defines the following modes
  24473. and attributes (among others):
  24474. (define_mode_iterator GPR [SI (DI "TARGET_64BIT")])
  24475. (define_mode_attr d [(SI "") (DI "d")])
  24476. and uses the following template to define both 'subsi3' and 'subdi3':
  24477. (define_insn "sub<mode>3"
  24478. [(set (match_operand:GPR 0 "register_operand" "=d")
  24479. (minus:GPR (match_operand:GPR 1 "register_operand" "d")
  24480. (match_operand:GPR 2 "register_operand" "d")))]
  24481. ""
  24482. "<d>subu\t%0,%1,%2"
  24483. [(set_attr "type" "arith")
  24484. (set_attr "mode" "<MODE>")])
  24485. This is exactly equivalent to:
  24486. (define_insn "subsi3"
  24487. [(set (match_operand:SI 0 "register_operand" "=d")
  24488. (minus:SI (match_operand:SI 1 "register_operand" "d")
  24489. (match_operand:SI 2 "register_operand" "d")))]
  24490. ""
  24491. "subu\t%0,%1,%2"
  24492. [(set_attr "type" "arith")
  24493. (set_attr "mode" "SI")])
  24494. (define_insn "subdi3"
  24495. [(set (match_operand:DI 0 "register_operand" "=d")
  24496. (minus:DI (match_operand:DI 1 "register_operand" "d")
  24497. (match_operand:DI 2 "register_operand" "d")))]
  24498. ""
  24499. "dsubu\t%0,%1,%2"
  24500. [(set_attr "type" "arith")
  24501. (set_attr "mode" "DI")])
  24502. 
  24503. File: gccint.info, Node: Code Iterators, Next: Int Iterators, Prev: Mode Iterators, Up: Iterators
  24504. 17.23.2 Code Iterators
  24505. ----------------------
  24506. Code iterators operate in a similar way to mode iterators. *Note Mode
  24507. Iterators::.
  24508. The construct:
  24509. (define_code_iterator NAME [(CODE1 "COND1") ... (CODEN "CONDN")])
  24510. defines a pseudo rtx code NAME that can be instantiated as CODEI if
  24511. condition CONDI is true. Each CODEI must have the same rtx format.
  24512. *Note RTL Classes::.
  24513. As with mode iterators, each pattern that uses NAME will be expanded N
  24514. times, once with all uses of NAME replaced by CODE1, once with all uses
  24515. replaced by CODE2, and so on. *Note Defining Mode Iterators::.
  24516. It is possible to define attributes for codes as well as for modes.
  24517. There are two standard code attributes: 'code', the name of the code in
  24518. lower case, and 'CODE', the name of the code in upper case. Other
  24519. attributes are defined using:
  24520. (define_code_attr NAME [(CODE1 "VALUE1") ... (CODEN "VALUEN")])
  24521. Instruction patterns can use code attributes as rtx codes, which can be
  24522. useful if two sets of codes act in tandem. For example, the following
  24523. 'define_insn' defines two patterns, one calculating a signed absolute
  24524. difference and another calculating an unsigned absolute difference:
  24525. (define_code_iterator any_max [smax umax])
  24526. (define_code_attr paired_min [(smax "smin") (umax "umin")])
  24527. (define_insn ...
  24528. [(set (match_operand:SI 0 ...)
  24529. (minus:SI (any_max:SI (match_operand:SI 1 ...)
  24530. (match_operand:SI 2 ...))
  24531. (<paired_min>:SI (match_dup 1) (match_dup 2))))]
  24532. ...)
  24533. The signed version of the instruction uses 'smax' and 'smin' while the
  24534. unsigned version uses 'umax' and 'umin'. There are no versions that
  24535. pair 'smax' with 'umin' or 'umax' with 'smin'.
  24536. Here's an example of code iterators in action, taken from the MIPS
  24537. port:
  24538. (define_code_iterator any_cond [unordered ordered unlt unge uneq ltgt unle ungt
  24539. eq ne gt ge lt le gtu geu ltu leu])
  24540. (define_expand "b<code>"
  24541. [(set (pc)
  24542. (if_then_else (any_cond:CC (cc0)
  24543. (const_int 0))
  24544. (label_ref (match_operand 0 ""))
  24545. (pc)))]
  24546. ""
  24547. {
  24548. gen_conditional_branch (operands, <CODE>);
  24549. DONE;
  24550. })
  24551. This is equivalent to:
  24552. (define_expand "bunordered"
  24553. [(set (pc)
  24554. (if_then_else (unordered:CC (cc0)
  24555. (const_int 0))
  24556. (label_ref (match_operand 0 ""))
  24557. (pc)))]
  24558. ""
  24559. {
  24560. gen_conditional_branch (operands, UNORDERED);
  24561. DONE;
  24562. })
  24563. (define_expand "bordered"
  24564. [(set (pc)
  24565. (if_then_else (ordered:CC (cc0)
  24566. (const_int 0))
  24567. (label_ref (match_operand 0 ""))
  24568. (pc)))]
  24569. ""
  24570. {
  24571. gen_conditional_branch (operands, ORDERED);
  24572. DONE;
  24573. })
  24574. ...
  24575. 
  24576. File: gccint.info, Node: Int Iterators, Next: Subst Iterators, Prev: Code Iterators, Up: Iterators
  24577. 17.23.3 Int Iterators
  24578. ---------------------
  24579. Int iterators operate in a similar way to code iterators. *Note Code
  24580. Iterators::.
  24581. The construct:
  24582. (define_int_iterator NAME [(INT1 "COND1") ... (INTN "CONDN")])
  24583. defines a pseudo integer constant NAME that can be instantiated as INTI
  24584. if condition CONDI is true. Each INT must have the same rtx format.
  24585. *Note RTL Classes::. Int iterators can appear in only those rtx fields
  24586. that have 'i' as the specifier. This means that each INT has to be a
  24587. constant defined using define_constant or define_c_enum.
  24588. As with mode and code iterators, each pattern that uses NAME will be
  24589. expanded N times, once with all uses of NAME replaced by INT1, once with
  24590. all uses replaced by INT2, and so on. *Note Defining Mode Iterators::.
  24591. It is possible to define attributes for ints as well as for codes and
  24592. modes. Attributes are defined using:
  24593. (define_int_attr NAME [(INT1 "VALUE1") ... (INTN "VALUEN")])
  24594. Here's an example of int iterators in action, taken from the ARM port:
  24595. (define_int_iterator QABSNEG [UNSPEC_VQABS UNSPEC_VQNEG])
  24596. (define_int_attr absneg [(UNSPEC_VQABS "abs") (UNSPEC_VQNEG "neg")])
  24597. (define_insn "neon_vq<absneg><mode>"
  24598. [(set (match_operand:VDQIW 0 "s_register_operand" "=w")
  24599. (unspec:VDQIW [(match_operand:VDQIW 1 "s_register_operand" "w")
  24600. (match_operand:SI 2 "immediate_operand" "i")]
  24601. QABSNEG))]
  24602. "TARGET_NEON"
  24603. "vq<absneg>.<V_s_elem>\t%<V_reg>0, %<V_reg>1"
  24604. [(set_attr "type" "neon_vqneg_vqabs")]
  24605. )
  24606. This is equivalent to:
  24607. (define_insn "neon_vqabs<mode>"
  24608. [(set (match_operand:VDQIW 0 "s_register_operand" "=w")
  24609. (unspec:VDQIW [(match_operand:VDQIW 1 "s_register_operand" "w")
  24610. (match_operand:SI 2 "immediate_operand" "i")]
  24611. UNSPEC_VQABS))]
  24612. "TARGET_NEON"
  24613. "vqabs.<V_s_elem>\t%<V_reg>0, %<V_reg>1"
  24614. [(set_attr "type" "neon_vqneg_vqabs")]
  24615. )
  24616. (define_insn "neon_vqneg<mode>"
  24617. [(set (match_operand:VDQIW 0 "s_register_operand" "=w")
  24618. (unspec:VDQIW [(match_operand:VDQIW 1 "s_register_operand" "w")
  24619. (match_operand:SI 2 "immediate_operand" "i")]
  24620. UNSPEC_VQNEG))]
  24621. "TARGET_NEON"
  24622. "vqneg.<V_s_elem>\t%<V_reg>0, %<V_reg>1"
  24623. [(set_attr "type" "neon_vqneg_vqabs")]
  24624. )
  24625. 
  24626. File: gccint.info, Node: Subst Iterators, Next: Parameterized Names, Prev: Int Iterators, Up: Iterators
  24627. 17.23.4 Subst Iterators
  24628. -----------------------
  24629. Subst iterators are special type of iterators with the following
  24630. restrictions: they could not be declared explicitly, they always have
  24631. only two values, and they do not have explicit dedicated name.
  24632. Subst-iterators are triggered only when corresponding subst-attribute is
  24633. used in RTL-pattern.
  24634. Subst iterators transform templates in the following way: the templates
  24635. are duplicated, the subst-attributes in these templates are replaced
  24636. with the corresponding values, and a new attribute is implicitly added
  24637. to the given 'define_insn'/'define_expand'. The name of the added
  24638. attribute matches the name of 'define_subst'. Such attributes are
  24639. declared implicitly, and it is not allowed to have a 'define_attr' named
  24640. as a 'define_subst'.
  24641. Each subst iterator is linked to a 'define_subst'. It is declared
  24642. implicitly by the first appearance of the corresponding
  24643. 'define_subst_attr', and it is not allowed to define it explicitly.
  24644. Declarations of subst-attributes have the following syntax:
  24645. (define_subst_attr "NAME"
  24646. "SUBST-NAME"
  24647. "NO-SUBST-VALUE"
  24648. "SUBST-APPLIED-VALUE")
  24649. NAME is a string with which the given subst-attribute could be referred
  24650. to.
  24651. SUBST-NAME shows which 'define_subst' should be applied to an
  24652. RTL-template if the given subst-attribute is present in the
  24653. RTL-template.
  24654. NO-SUBST-VALUE is a value with which subst-attribute would be replaced
  24655. in the first copy of the original RTL-template.
  24656. SUBST-APPLIED-VALUE is a value with which subst-attribute would be
  24657. replaced in the second copy of the original RTL-template.
  24658. 
  24659. File: gccint.info, Node: Parameterized Names, Prev: Subst Iterators, Up: Iterators
  24660. 17.23.5 Parameterized Names
  24661. ---------------------------
  24662. Ports sometimes need to apply iterators using C++ code, in order to get
  24663. the code or RTL pattern for a specific instruction. For example,
  24664. suppose we have the 'neon_vq<absneg><mode>' pattern given above:
  24665. (define_int_iterator QABSNEG [UNSPEC_VQABS UNSPEC_VQNEG])
  24666. (define_int_attr absneg [(UNSPEC_VQABS "abs") (UNSPEC_VQNEG "neg")])
  24667. (define_insn "neon_vq<absneg><mode>"
  24668. [(set (match_operand:VDQIW 0 "s_register_operand" "=w")
  24669. (unspec:VDQIW [(match_operand:VDQIW 1 "s_register_operand" "w")
  24670. (match_operand:SI 2 "immediate_operand" "i")]
  24671. QABSNEG))]
  24672. ...
  24673. )
  24674. A port might need to generate this pattern for a variable 'QABSNEG'
  24675. value and a variable 'VDQIW' mode. There are two ways of doing this.
  24676. The first is to build the rtx for the pattern directly from C++ code;
  24677. this is a valid technique and avoids any risk of combinatorial
  24678. explosion. The second is to prefix the instruction name with the
  24679. special character '@', which tells GCC to generate the four additional
  24680. functions below. In each case, NAME is the name of the instruction
  24681. without the leading '@' character, without the '<...>' placeholders, and
  24682. with any underscore before a '<...>' placeholder removed if keeping it
  24683. would lead to a double or trailing underscore.
  24684. 'insn_code maybe_code_for_NAME (I1, I2, ...)'
  24685. See whether replacing the first '<...>' placeholder with iterator
  24686. value I1, the second with iterator value I2, and so on, gives a
  24687. valid instruction. Return its code if so, otherwise return
  24688. 'CODE_FOR_nothing'.
  24689. 'insn_code code_for_NAME (I1, I2, ...)'
  24690. Same, but abort the compiler if the requested instruction does not
  24691. exist.
  24692. 'rtx maybe_gen_NAME (I1, I2, ..., OP0, OP1, ...)'
  24693. Check for a valid instruction in the same way as
  24694. 'maybe_code_for_NAME'. If the instruction exists, generate an
  24695. instance of it using the operand values given by OP0, OP1, and so
  24696. on, otherwise return null.
  24697. 'rtx gen_NAME (I1, I2, ..., OP0, OP1, ...)'
  24698. Same, but abort the compiler if the requested instruction does not
  24699. exist, or if the instruction generator invoked the 'FAIL' macro.
  24700. For example, changing the pattern above to:
  24701. (define_insn "@neon_vq<absneg><mode>"
  24702. [(set (match_operand:VDQIW 0 "s_register_operand" "=w")
  24703. (unspec:VDQIW [(match_operand:VDQIW 1 "s_register_operand" "w")
  24704. (match_operand:SI 2 "immediate_operand" "i")]
  24705. QABSNEG))]
  24706. ...
  24707. )
  24708. would define the same patterns as before, but in addition would
  24709. generate the four functions below:
  24710. insn_code maybe_code_for_neon_vq (int, machine_mode);
  24711. insn_code code_for_neon_vq (int, machine_mode);
  24712. rtx maybe_gen_neon_vq (int, machine_mode, rtx, rtx, rtx);
  24713. rtx gen_neon_vq (int, machine_mode, rtx, rtx, rtx);
  24714. Calling 'code_for_neon_vq (UNSPEC_VQABS, V8QImode)' would then give
  24715. 'CODE_FOR_neon_vqabsv8qi'.
  24716. It is possible to have multiple '@' patterns with the same name and
  24717. same types of iterator. For example:
  24718. (define_insn "@some_arithmetic_op<mode>"
  24719. [(set (match_operand:INTEGER_MODES 0 "register_operand") ...)]
  24720. ...
  24721. )
  24722. (define_insn "@some_arithmetic_op<mode>"
  24723. [(set (match_operand:FLOAT_MODES 0 "register_operand") ...)]
  24724. ...
  24725. )
  24726. would produce a single set of functions that handles both
  24727. 'INTEGER_MODES' and 'FLOAT_MODES'.
  24728. It is also possible for these '@' patterns to have different numbers of
  24729. operands from each other. For example, patterns with a binary rtl code
  24730. might take three operands (one output and two inputs) while patterns
  24731. with a ternary rtl code might take four operands (one output and three
  24732. inputs). This combination would produce separate 'maybe_gen_NAME' and
  24733. 'gen_NAME' functions for each operand count, but it would still produce
  24734. a single 'maybe_code_for_NAME' and a single 'code_for_NAME'.
  24735. 
  24736. File: gccint.info, Node: Target Macros, Next: Host Config, Prev: Machine Desc, Up: Top
  24737. 18 Target Description Macros and Functions
  24738. ******************************************
  24739. In addition to the file 'MACHINE.md', a machine description includes a C
  24740. header file conventionally given the name 'MACHINE.h' and a C source
  24741. file named 'MACHINE.c'. The header file defines numerous macros that
  24742. convey the information about the target machine that does not fit into
  24743. the scheme of the '.md' file. The file 'tm.h' should be a link to
  24744. 'MACHINE.h'. The header file 'config.h' includes 'tm.h' and most
  24745. compiler source files include 'config.h'. The source file defines a
  24746. variable 'targetm', which is a structure containing pointers to
  24747. functions and data relating to the target machine. 'MACHINE.c' should
  24748. also contain their definitions, if they are not defined elsewhere in
  24749. GCC, and other functions called through the macros defined in the '.h'
  24750. file.
  24751. * Menu:
  24752. * Target Structure:: The 'targetm' variable.
  24753. * Driver:: Controlling how the driver runs the compilation passes.
  24754. * Run-time Target:: Defining '-m' options like '-m68000' and '-m68020'.
  24755. * Per-Function Data:: Defining data structures for per-function information.
  24756. * Storage Layout:: Defining sizes and alignments of data.
  24757. * Type Layout:: Defining sizes and properties of basic user data types.
  24758. * Registers:: Naming and describing the hardware registers.
  24759. * Register Classes:: Defining the classes of hardware registers.
  24760. * Stack and Calling:: Defining which way the stack grows and by how much.
  24761. * Varargs:: Defining the varargs macros.
  24762. * Trampolines:: Code set up at run time to enter a nested function.
  24763. * Library Calls:: Controlling how library routines are implicitly called.
  24764. * Addressing Modes:: Defining addressing modes valid for memory operands.
  24765. * Anchored Addresses:: Defining how '-fsection-anchors' should work.
  24766. * Condition Code:: Defining how insns update the condition code.
  24767. * Costs:: Defining relative costs of different operations.
  24768. * Scheduling:: Adjusting the behavior of the instruction scheduler.
  24769. * Sections:: Dividing storage into text, data, and other sections.
  24770. * PIC:: Macros for position independent code.
  24771. * Assembler Format:: Defining how to write insns and pseudo-ops to output.
  24772. * Debugging Info:: Defining the format of debugging output.
  24773. * Floating Point:: Handling floating point for cross-compilers.
  24774. * Mode Switching:: Insertion of mode-switching instructions.
  24775. * Target Attributes:: Defining target-specific uses of '__attribute__'.
  24776. * Emulated TLS:: Emulated TLS support.
  24777. * MIPS Coprocessors:: MIPS coprocessor support and how to customize it.
  24778. * PCH Target:: Validity checking for precompiled headers.
  24779. * C++ ABI:: Controlling C++ ABI changes.
  24780. * D Language and ABI:: Controlling D ABI changes.
  24781. * Named Address Spaces:: Adding support for named address spaces
  24782. * Misc:: Everything else.
  24783. 
  24784. File: gccint.info, Node: Target Structure, Next: Driver, Up: Target Macros
  24785. 18.1 The Global 'targetm' Variable
  24786. ==================================
  24787. -- Variable: struct gcc_target targetm
  24788. The target '.c' file must define the global 'targetm' variable
  24789. which contains pointers to functions and data relating to the
  24790. target machine. The variable is declared in 'target.h';
  24791. 'target-def.h' defines the macro 'TARGET_INITIALIZER' which is used
  24792. to initialize the variable, and macros for the default initializers
  24793. for elements of the structure. The '.c' file should override those
  24794. macros for which the default definition is inappropriate. For
  24795. example:
  24796. #include "target.h"
  24797. #include "target-def.h"
  24798. /* Initialize the GCC target structure. */
  24799. #undef TARGET_COMP_TYPE_ATTRIBUTES
  24800. #define TARGET_COMP_TYPE_ATTRIBUTES MACHINE_comp_type_attributes
  24801. struct gcc_target targetm = TARGET_INITIALIZER;
  24802. Where a macro should be defined in the '.c' file in this manner to form
  24803. part of the 'targetm' structure, it is documented below as a "Target
  24804. Hook" with a prototype. Many macros will change in future from being
  24805. defined in the '.h' file to being part of the 'targetm' structure.
  24806. Similarly, there is a 'targetcm' variable for hooks that are specific
  24807. to front ends for C-family languages, documented as "C Target Hook".
  24808. This is declared in 'c-family/c-target.h', the initializer
  24809. 'TARGETCM_INITIALIZER' in 'c-family/c-target-def.h'. If targets
  24810. initialize 'targetcm' themselves, they should set
  24811. 'target_has_targetcm=yes' in 'config.gcc'; otherwise a default
  24812. definition is used.
  24813. Similarly, there is a 'targetm_common' variable for hooks that are
  24814. shared between the compiler driver and the compilers proper, documented
  24815. as "Common Target Hook". This is declared in 'common/common-target.h',
  24816. the initializer 'TARGETM_COMMON_INITIALIZER' in
  24817. 'common/common-target-def.h'. If targets initialize 'targetm_common'
  24818. themselves, they should set 'target_has_targetm_common=yes' in
  24819. 'config.gcc'; otherwise a default definition is used.
  24820. Similarly, there is a 'targetdm' variable for hooks that are specific
  24821. to the D language front end, documented as "D Target Hook". This is
  24822. declared in 'd/d-target.h', the initializer 'TARGETDM_INITIALIZER' in
  24823. 'd/d-target-def.h'. If targets initialize 'targetdm' themselves, they
  24824. should set 'target_has_targetdm=yes' in 'config.gcc'; otherwise a
  24825. default definition is used.
  24826. 
  24827. File: gccint.info, Node: Driver, Next: Run-time Target, Prev: Target Structure, Up: Target Macros
  24828. 18.2 Controlling the Compilation Driver, 'gcc'
  24829. ==============================================
  24830. You can control the compilation driver.
  24831. -- Macro: DRIVER_SELF_SPECS
  24832. A list of specs for the driver itself. It should be a suitable
  24833. initializer for an array of strings, with no surrounding braces.
  24834. The driver applies these specs to its own command line between
  24835. loading default 'specs' files (but not command-line specified ones)
  24836. and choosing the multilib directory or running any subcommands. It
  24837. applies them in the order given, so each spec can depend on the
  24838. options added by earlier ones. It is also possible to remove
  24839. options using '%<OPTION' in the usual way.
  24840. This macro can be useful when a port has several interdependent
  24841. target options. It provides a way of standardizing the command
  24842. line so that the other specs are easier to write.
  24843. Do not define this macro if it does not need to do anything.
  24844. -- Macro: OPTION_DEFAULT_SPECS
  24845. A list of specs used to support configure-time default options
  24846. (i.e. '--with' options) in the driver. It should be a suitable
  24847. initializer for an array of structures, each containing two
  24848. strings, without the outermost pair of surrounding braces.
  24849. The first item in the pair is the name of the default. This must
  24850. match the code in 'config.gcc' for the target. The second item is
  24851. a spec to apply if a default with this name was specified. The
  24852. string '%(VALUE)' in the spec will be replaced by the value of the
  24853. default everywhere it occurs.
  24854. The driver will apply these specs to its own command line between
  24855. loading default 'specs' files and processing 'DRIVER_SELF_SPECS',
  24856. using the same mechanism as 'DRIVER_SELF_SPECS'.
  24857. Do not define this macro if it does not need to do anything.
  24858. -- Macro: CPP_SPEC
  24859. A C string constant that tells the GCC driver program options to
  24860. pass to CPP. It can also specify how to translate options you give
  24861. to GCC into options for GCC to pass to the CPP.
  24862. Do not define this macro if it does not need to do anything.
  24863. -- Macro: CPLUSPLUS_CPP_SPEC
  24864. This macro is just like 'CPP_SPEC', but is used for C++, rather
  24865. than C. If you do not define this macro, then the value of
  24866. 'CPP_SPEC' (if any) will be used instead.
  24867. -- Macro: CC1_SPEC
  24868. A C string constant that tells the GCC driver program options to
  24869. pass to 'cc1', 'cc1plus', 'f771', and the other language front
  24870. ends. It can also specify how to translate options you give to GCC
  24871. into options for GCC to pass to front ends.
  24872. Do not define this macro if it does not need to do anything.
  24873. -- Macro: CC1PLUS_SPEC
  24874. A C string constant that tells the GCC driver program options to
  24875. pass to 'cc1plus'. It can also specify how to translate options
  24876. you give to GCC into options for GCC to pass to the 'cc1plus'.
  24877. Do not define this macro if it does not need to do anything. Note
  24878. that everything defined in CC1_SPEC is already passed to 'cc1plus'
  24879. so there is no need to duplicate the contents of CC1_SPEC in
  24880. CC1PLUS_SPEC.
  24881. -- Macro: ASM_SPEC
  24882. A C string constant that tells the GCC driver program options to
  24883. pass to the assembler. It can also specify how to translate
  24884. options you give to GCC into options for GCC to pass to the
  24885. assembler. See the file 'sun3.h' for an example of this.
  24886. Do not define this macro if it does not need to do anything.
  24887. -- Macro: ASM_FINAL_SPEC
  24888. A C string constant that tells the GCC driver program how to run
  24889. any programs which cleanup after the normal assembler. Normally,
  24890. this is not needed. See the file 'mips.h' for an example of this.
  24891. Do not define this macro if it does not need to do anything.
  24892. -- Macro: AS_NEEDS_DASH_FOR_PIPED_INPUT
  24893. Define this macro, with no value, if the driver should give the
  24894. assembler an argument consisting of a single dash, '-', to instruct
  24895. it to read from its standard input (which will be a pipe connected
  24896. to the output of the compiler proper). This argument is given
  24897. after any '-o' option specifying the name of the output file.
  24898. If you do not define this macro, the assembler is assumed to read
  24899. its standard input if given no non-option arguments. If your
  24900. assembler cannot read standard input at all, use a '%{pipe:%e}'
  24901. construct; see 'mips.h' for instance.
  24902. -- Macro: LINK_SPEC
  24903. A C string constant that tells the GCC driver program options to
  24904. pass to the linker. It can also specify how to translate options
  24905. you give to GCC into options for GCC to pass to the linker.
  24906. Do not define this macro if it does not need to do anything.
  24907. -- Macro: LIB_SPEC
  24908. Another C string constant used much like 'LINK_SPEC'. The
  24909. difference between the two is that 'LIB_SPEC' is used at the end of
  24910. the command given to the linker.
  24911. If this macro is not defined, a default is provided that loads the
  24912. standard C library from the usual place. See 'gcc.c'.
  24913. -- Macro: LIBGCC_SPEC
  24914. Another C string constant that tells the GCC driver program how and
  24915. when to place a reference to 'libgcc.a' into the linker command
  24916. line. This constant is placed both before and after the value of
  24917. 'LIB_SPEC'.
  24918. If this macro is not defined, the GCC driver provides a default
  24919. that passes the string '-lgcc' to the linker.
  24920. -- Macro: REAL_LIBGCC_SPEC
  24921. By default, if 'ENABLE_SHARED_LIBGCC' is defined, the 'LIBGCC_SPEC'
  24922. is not directly used by the driver program but is instead modified
  24923. to refer to different versions of 'libgcc.a' depending on the
  24924. values of the command line flags '-static', '-shared',
  24925. '-static-libgcc', and '-shared-libgcc'. On targets where these
  24926. modifications are inappropriate, define 'REAL_LIBGCC_SPEC' instead.
  24927. 'REAL_LIBGCC_SPEC' tells the driver how to place a reference to
  24928. 'libgcc' on the link command line, but, unlike 'LIBGCC_SPEC', it is
  24929. used unmodified.
  24930. -- Macro: USE_LD_AS_NEEDED
  24931. A macro that controls the modifications to 'LIBGCC_SPEC' mentioned
  24932. in 'REAL_LIBGCC_SPEC'. If nonzero, a spec will be generated that
  24933. uses '--as-needed' or equivalent options and the shared 'libgcc' in
  24934. place of the static exception handler library, when linking without
  24935. any of '-static', '-static-libgcc', or '-shared-libgcc'.
  24936. -- Macro: LINK_EH_SPEC
  24937. If defined, this C string constant is added to 'LINK_SPEC'. When
  24938. 'USE_LD_AS_NEEDED' is zero or undefined, it also affects the
  24939. modifications to 'LIBGCC_SPEC' mentioned in 'REAL_LIBGCC_SPEC'.
  24940. -- Macro: STARTFILE_SPEC
  24941. Another C string constant used much like 'LINK_SPEC'. The
  24942. difference between the two is that 'STARTFILE_SPEC' is used at the
  24943. very beginning of the command given to the linker.
  24944. If this macro is not defined, a default is provided that loads the
  24945. standard C startup file from the usual place. See 'gcc.c'.
  24946. -- Macro: ENDFILE_SPEC
  24947. Another C string constant used much like 'LINK_SPEC'. The
  24948. difference between the two is that 'ENDFILE_SPEC' is used at the
  24949. very end of the command given to the linker.
  24950. Do not define this macro if it does not need to do anything.
  24951. -- Macro: THREAD_MODEL_SPEC
  24952. GCC '-v' will print the thread model GCC was configured to use.
  24953. However, this doesn't work on platforms that are multilibbed on
  24954. thread models, such as AIX 4.3. On such platforms, define
  24955. 'THREAD_MODEL_SPEC' such that it evaluates to a string without
  24956. blanks that names one of the recognized thread models. '%*', the
  24957. default value of this macro, will expand to the value of
  24958. 'thread_file' set in 'config.gcc'.
  24959. -- Macro: SYSROOT_SUFFIX_SPEC
  24960. Define this macro to add a suffix to the target sysroot when GCC is
  24961. configured with a sysroot. This will cause GCC to search for
  24962. usr/lib, et al, within sysroot+suffix.
  24963. -- Macro: SYSROOT_HEADERS_SUFFIX_SPEC
  24964. Define this macro to add a headers_suffix to the target sysroot
  24965. when GCC is configured with a sysroot. This will cause GCC to pass
  24966. the updated sysroot+headers_suffix to CPP, causing it to search for
  24967. usr/include, et al, within sysroot+headers_suffix.
  24968. -- Macro: EXTRA_SPECS
  24969. Define this macro to provide additional specifications to put in
  24970. the 'specs' file that can be used in various specifications like
  24971. 'CC1_SPEC'.
  24972. The definition should be an initializer for an array of structures,
  24973. containing a string constant, that defines the specification name,
  24974. and a string constant that provides the specification.
  24975. Do not define this macro if it does not need to do anything.
  24976. 'EXTRA_SPECS' is useful when an architecture contains several
  24977. related targets, which have various '..._SPECS' which are similar
  24978. to each other, and the maintainer would like one central place to
  24979. keep these definitions.
  24980. For example, the PowerPC System V.4 targets use 'EXTRA_SPECS' to
  24981. define either '_CALL_SYSV' when the System V calling sequence is
  24982. used or '_CALL_AIX' when the older AIX-based calling sequence is
  24983. used.
  24984. The 'config/rs6000/rs6000.h' target file defines:
  24985. #define EXTRA_SPECS \
  24986. { "cpp_sysv_default", CPP_SYSV_DEFAULT },
  24987. #define CPP_SYS_DEFAULT ""
  24988. The 'config/rs6000/sysv.h' target file defines:
  24989. #undef CPP_SPEC
  24990. #define CPP_SPEC \
  24991. "%{posix: -D_POSIX_SOURCE } \
  24992. %{mcall-sysv: -D_CALL_SYSV } \
  24993. %{!mcall-sysv: %(cpp_sysv_default) } \
  24994. %{msoft-float: -D_SOFT_FLOAT} %{mcpu=403: -D_SOFT_FLOAT}"
  24995. #undef CPP_SYSV_DEFAULT
  24996. #define CPP_SYSV_DEFAULT "-D_CALL_SYSV"
  24997. while the 'config/rs6000/eabiaix.h' target file defines
  24998. 'CPP_SYSV_DEFAULT' as:
  24999. #undef CPP_SYSV_DEFAULT
  25000. #define CPP_SYSV_DEFAULT "-D_CALL_AIX"
  25001. -- Macro: LINK_LIBGCC_SPECIAL_1
  25002. Define this macro if the driver program should find the library
  25003. 'libgcc.a'. If you do not define this macro, the driver program
  25004. will pass the argument '-lgcc' to tell the linker to do the search.
  25005. -- Macro: LINK_GCC_C_SEQUENCE_SPEC
  25006. The sequence in which libgcc and libc are specified to the linker.
  25007. By default this is '%G %L %G'.
  25008. -- Macro: POST_LINK_SPEC
  25009. Define this macro to add additional steps to be executed after
  25010. linker. The default value of this macro is empty string.
  25011. -- Macro: LINK_COMMAND_SPEC
  25012. A C string constant giving the complete command line need to
  25013. execute the linker. When you do this, you will need to update your
  25014. port each time a change is made to the link command line within
  25015. 'gcc.c'. Therefore, define this macro only if you need to
  25016. completely redefine the command line for invoking the linker and
  25017. there is no other way to accomplish the effect you need.
  25018. Overriding this macro may be avoidable by overriding
  25019. 'LINK_GCC_C_SEQUENCE_SPEC' instead.
  25020. -- Common Target Hook: bool TARGET_ALWAYS_STRIP_DOTDOT
  25021. True if '..' components should always be removed from directory
  25022. names computed relative to GCC's internal directories, false
  25023. (default) if such components should be preserved and directory
  25024. names containing them passed to other tools such as the linker.
  25025. -- Macro: MULTILIB_DEFAULTS
  25026. Define this macro as a C expression for the initializer of an array
  25027. of string to tell the driver program which options are defaults for
  25028. this target and thus do not need to be handled specially when using
  25029. 'MULTILIB_OPTIONS'.
  25030. Do not define this macro if 'MULTILIB_OPTIONS' is not defined in
  25031. the target makefile fragment or if none of the options listed in
  25032. 'MULTILIB_OPTIONS' are set by default. *Note Target Fragment::.
  25033. -- Macro: RELATIVE_PREFIX_NOT_LINKDIR
  25034. Define this macro to tell 'gcc' that it should only translate a
  25035. '-B' prefix into a '-L' linker option if the prefix indicates an
  25036. absolute file name.
  25037. -- Macro: MD_EXEC_PREFIX
  25038. If defined, this macro is an additional prefix to try after
  25039. 'STANDARD_EXEC_PREFIX'. 'MD_EXEC_PREFIX' is not searched when the
  25040. compiler is built as a cross compiler. If you define
  25041. 'MD_EXEC_PREFIX', then be sure to add it to the list of directories
  25042. used to find the assembler in 'configure.ac'.
  25043. -- Macro: STANDARD_STARTFILE_PREFIX
  25044. Define this macro as a C string constant if you wish to override
  25045. the standard choice of 'libdir' as the default prefix to try when
  25046. searching for startup files such as 'crt0.o'.
  25047. 'STANDARD_STARTFILE_PREFIX' is not searched when the compiler is
  25048. built as a cross compiler.
  25049. -- Macro: STANDARD_STARTFILE_PREFIX_1
  25050. Define this macro as a C string constant if you wish to override
  25051. the standard choice of '/lib' as a prefix to try after the default
  25052. prefix when searching for startup files such as 'crt0.o'.
  25053. 'STANDARD_STARTFILE_PREFIX_1' is not searched when the compiler is
  25054. built as a cross compiler.
  25055. -- Macro: STANDARD_STARTFILE_PREFIX_2
  25056. Define this macro as a C string constant if you wish to override
  25057. the standard choice of '/lib' as yet another prefix to try after
  25058. the default prefix when searching for startup files such as
  25059. 'crt0.o'. 'STANDARD_STARTFILE_PREFIX_2' is not searched when the
  25060. compiler is built as a cross compiler.
  25061. -- Macro: MD_STARTFILE_PREFIX
  25062. If defined, this macro supplies an additional prefix to try after
  25063. the standard prefixes. 'MD_EXEC_PREFIX' is not searched when the
  25064. compiler is built as a cross compiler.
  25065. -- Macro: MD_STARTFILE_PREFIX_1
  25066. If defined, this macro supplies yet another prefix to try after the
  25067. standard prefixes. It is not searched when the compiler is built
  25068. as a cross compiler.
  25069. -- Macro: INIT_ENVIRONMENT
  25070. Define this macro as a C string constant if you wish to set
  25071. environment variables for programs called by the driver, such as
  25072. the assembler and loader. The driver passes the value of this
  25073. macro to 'putenv' to initialize the necessary environment
  25074. variables.
  25075. -- Macro: LOCAL_INCLUDE_DIR
  25076. Define this macro as a C string constant if you wish to override
  25077. the standard choice of '/usr/local/include' as the default prefix
  25078. to try when searching for local header files. 'LOCAL_INCLUDE_DIR'
  25079. comes before 'NATIVE_SYSTEM_HEADER_DIR' (set in 'config.gcc',
  25080. normally '/usr/include') in the search order.
  25081. Cross compilers do not search either '/usr/local/include' or its
  25082. replacement.
  25083. -- Macro: NATIVE_SYSTEM_HEADER_COMPONENT
  25084. The "component" corresponding to 'NATIVE_SYSTEM_HEADER_DIR'. See
  25085. 'INCLUDE_DEFAULTS', below, for the description of components. If
  25086. you do not define this macro, no component is used.
  25087. -- Macro: INCLUDE_DEFAULTS
  25088. Define this macro if you wish to override the entire default search
  25089. path for include files. For a native compiler, the default search
  25090. path usually consists of 'GCC_INCLUDE_DIR', 'LOCAL_INCLUDE_DIR',
  25091. 'GPLUSPLUS_INCLUDE_DIR', and 'NATIVE_SYSTEM_HEADER_DIR'. In
  25092. addition, 'GPLUSPLUS_INCLUDE_DIR' and 'GCC_INCLUDE_DIR' are defined
  25093. automatically by 'Makefile', and specify private search areas for
  25094. GCC. The directory 'GPLUSPLUS_INCLUDE_DIR' is used only for C++
  25095. programs.
  25096. The definition should be an initializer for an array of structures.
  25097. Each array element should have four elements: the directory name (a
  25098. string constant), the component name (also a string constant), a
  25099. flag for C++-only directories, and a flag showing that the includes
  25100. in the directory don't need to be wrapped in 'extern 'C'' when
  25101. compiling C++. Mark the end of the array with a null element.
  25102. The component name denotes what GNU package the include file is
  25103. part of, if any, in all uppercase letters. For example, it might
  25104. be 'GCC' or 'BINUTILS'. If the package is part of a
  25105. vendor-supplied operating system, code the component name as '0'.
  25106. For example, here is the definition used for VAX/VMS:
  25107. #define INCLUDE_DEFAULTS \
  25108. { \
  25109. { "GNU_GXX_INCLUDE:", "G++", 1, 1}, \
  25110. { "GNU_CC_INCLUDE:", "GCC", 0, 0}, \
  25111. { "SYS$SYSROOT:[SYSLIB.]", 0, 0, 0}, \
  25112. { ".", 0, 0, 0}, \
  25113. { 0, 0, 0, 0} \
  25114. }
  25115. Here is the order of prefixes tried for exec files:
  25116. 1. Any prefixes specified by the user with '-B'.
  25117. 2. The environment variable 'GCC_EXEC_PREFIX' or, if 'GCC_EXEC_PREFIX'
  25118. is not set and the compiler has not been installed in the
  25119. configure-time PREFIX, the location in which the compiler has
  25120. actually been installed.
  25121. 3. The directories specified by the environment variable
  25122. 'COMPILER_PATH'.
  25123. 4. The macro 'STANDARD_EXEC_PREFIX', if the compiler has been
  25124. installed in the configured-time PREFIX.
  25125. 5. The location '/usr/libexec/gcc/', but only if this is a native
  25126. compiler.
  25127. 6. The location '/usr/lib/gcc/', but only if this is a native
  25128. compiler.
  25129. 7. The macro 'MD_EXEC_PREFIX', if defined, but only if this is a
  25130. native compiler.
  25131. Here is the order of prefixes tried for startfiles:
  25132. 1. Any prefixes specified by the user with '-B'.
  25133. 2. The environment variable 'GCC_EXEC_PREFIX' or its automatically
  25134. determined value based on the installed toolchain location.
  25135. 3. The directories specified by the environment variable
  25136. 'LIBRARY_PATH' (or port-specific name; native only, cross compilers
  25137. do not use this).
  25138. 4. The macro 'STANDARD_EXEC_PREFIX', but only if the toolchain is
  25139. installed in the configured PREFIX or this is a native compiler.
  25140. 5. The location '/usr/lib/gcc/', but only if this is a native
  25141. compiler.
  25142. 6. The macro 'MD_EXEC_PREFIX', if defined, but only if this is a
  25143. native compiler.
  25144. 7. The macro 'MD_STARTFILE_PREFIX', if defined, but only if this is a
  25145. native compiler, or we have a target system root.
  25146. 8. The macro 'MD_STARTFILE_PREFIX_1', if defined, but only if this is
  25147. a native compiler, or we have a target system root.
  25148. 9. The macro 'STANDARD_STARTFILE_PREFIX', with any sysroot
  25149. modifications. If this path is relative it will be prefixed by
  25150. 'GCC_EXEC_PREFIX' and the machine suffix or 'STANDARD_EXEC_PREFIX'
  25151. and the machine suffix.
  25152. 10. The macro 'STANDARD_STARTFILE_PREFIX_1', but only if this is a
  25153. native compiler, or we have a target system root. The default for
  25154. this macro is '/lib/'.
  25155. 11. The macro 'STANDARD_STARTFILE_PREFIX_2', but only if this is a
  25156. native compiler, or we have a target system root. The default for
  25157. this macro is '/usr/lib/'.
  25158. 
  25159. File: gccint.info, Node: Run-time Target, Next: Per-Function Data, Prev: Driver, Up: Target Macros
  25160. 18.3 Run-time Target Specification
  25161. ==================================
  25162. Here are run-time target specifications.
  25163. -- Macro: TARGET_CPU_CPP_BUILTINS ()
  25164. This function-like macro expands to a block of code that defines
  25165. built-in preprocessor macros and assertions for the target CPU,
  25166. using the functions 'builtin_define', 'builtin_define_std' and
  25167. 'builtin_assert'. When the front end calls this macro it provides
  25168. a trailing semicolon, and since it has finished command line option
  25169. processing your code can use those results freely.
  25170. 'builtin_assert' takes a string in the form you pass to the
  25171. command-line option '-A', such as 'cpu=mips', and creates the
  25172. assertion. 'builtin_define' takes a string in the form accepted by
  25173. option '-D' and unconditionally defines the macro.
  25174. 'builtin_define_std' takes a string representing the name of an
  25175. object-like macro. If it doesn't lie in the user's namespace,
  25176. 'builtin_define_std' defines it unconditionally. Otherwise, it
  25177. defines a version with two leading underscores, and another version
  25178. with two leading and trailing underscores, and defines the original
  25179. only if an ISO standard was not requested on the command line. For
  25180. example, passing 'unix' defines '__unix', '__unix__' and possibly
  25181. 'unix'; passing '_mips' defines '__mips', '__mips__' and possibly
  25182. '_mips', and passing '_ABI64' defines only '_ABI64'.
  25183. You can also test for the C dialect being compiled. The variable
  25184. 'c_language' is set to one of 'clk_c', 'clk_cplusplus' or
  25185. 'clk_objective_c'. Note that if we are preprocessing assembler,
  25186. this variable will be 'clk_c' but the function-like macro
  25187. 'preprocessing_asm_p()' will return true, so you might want to
  25188. check for that first. If you need to check for strict ANSI, the
  25189. variable 'flag_iso' can be used. The function-like macro
  25190. 'preprocessing_trad_p()' can be used to check for traditional
  25191. preprocessing.
  25192. -- Macro: TARGET_OS_CPP_BUILTINS ()
  25193. Similarly to 'TARGET_CPU_CPP_BUILTINS' but this macro is optional
  25194. and is used for the target operating system instead.
  25195. -- Macro: TARGET_OBJFMT_CPP_BUILTINS ()
  25196. Similarly to 'TARGET_CPU_CPP_BUILTINS' but this macro is optional
  25197. and is used for the target object format. 'elfos.h' uses this
  25198. macro to define '__ELF__', so you probably do not need to define it
  25199. yourself.
  25200. -- Variable: extern int target_flags
  25201. This variable is declared in 'options.h', which is included before
  25202. any target-specific headers.
  25203. -- Common Target Hook: int TARGET_DEFAULT_TARGET_FLAGS
  25204. This variable specifies the initial value of 'target_flags'. Its
  25205. default setting is 0.
  25206. -- Common Target Hook: bool TARGET_HANDLE_OPTION (struct gcc_options
  25207. *OPTS, struct gcc_options *OPTS_SET, const struct
  25208. cl_decoded_option *DECODED, location_t LOC)
  25209. This hook is called whenever the user specifies one of the
  25210. target-specific options described by the '.opt' definition files
  25211. (*note Options::). It has the opportunity to do some
  25212. option-specific processing and should return true if the option is
  25213. valid. The default definition does nothing but return true.
  25214. DECODED specifies the option and its arguments. OPTS and OPTS_SET
  25215. are the 'gcc_options' structures to be used for storing option
  25216. state, and LOC is the location at which the option was passed
  25217. ('UNKNOWN_LOCATION' except for options passed via attributes).
  25218. -- C Target Hook: bool TARGET_HANDLE_C_OPTION (size_t CODE, const char
  25219. *ARG, int VALUE)
  25220. This target hook is called whenever the user specifies one of the
  25221. target-specific C language family options described by the '.opt'
  25222. definition files(*note Options::). It has the opportunity to do
  25223. some option-specific processing and should return true if the
  25224. option is valid. The arguments are like for
  25225. 'TARGET_HANDLE_OPTION'. The default definition does nothing but
  25226. return false.
  25227. In general, you should use 'TARGET_HANDLE_OPTION' to handle
  25228. options. However, if processing an option requires routines that
  25229. are only available in the C (and related language) front ends, then
  25230. you should use 'TARGET_HANDLE_C_OPTION' instead.
  25231. -- C Target Hook: tree TARGET_OBJC_CONSTRUCT_STRING_OBJECT (tree
  25232. STRING)
  25233. Targets may provide a string object type that can be used within
  25234. and between C, C++ and their respective Objective-C dialects. A
  25235. string object might, for example, embed encoding and length
  25236. information. These objects are considered opaque to the compiler
  25237. and handled as references. An ideal implementation makes the
  25238. composition of the string object match that of the Objective-C
  25239. 'NSString' ('NXString' for GNUStep), allowing efficient
  25240. interworking between C-only and Objective-C code. If a target
  25241. implements string objects then this hook should return a reference
  25242. to such an object constructed from the normal 'C' string
  25243. representation provided in STRING. At present, the hook is used by
  25244. Objective-C only, to obtain a common-format string object when the
  25245. target provides one.
  25246. -- C Target Hook: void TARGET_OBJC_DECLARE_UNRESOLVED_CLASS_REFERENCE
  25247. (const char *CLASSNAME)
  25248. Declare that Objective C class CLASSNAME is referenced by the
  25249. current TU.
  25250. -- C Target Hook: void TARGET_OBJC_DECLARE_CLASS_DEFINITION (const char
  25251. *CLASSNAME)
  25252. Declare that Objective C class CLASSNAME is defined by the current
  25253. TU.
  25254. -- C Target Hook: bool TARGET_STRING_OBJECT_REF_TYPE_P (const_tree
  25255. STRINGREF)
  25256. If a target implements string objects then this hook should return
  25257. 'true' if STRINGREF is a valid reference to such an object.
  25258. -- C Target Hook: void TARGET_CHECK_STRING_OBJECT_FORMAT_ARG (tree
  25259. FORMAT_ARG, tree ARGS_LIST)
  25260. If a target implements string objects then this hook should should
  25261. provide a facility to check the function arguments in ARGS_LIST
  25262. against the format specifiers in FORMAT_ARG where the type of
  25263. FORMAT_ARG is one recognized as a valid string reference type.
  25264. -- Target Hook: void TARGET_OVERRIDE_OPTIONS_AFTER_CHANGE (void)
  25265. This target function is similar to the hook
  25266. 'TARGET_OPTION_OVERRIDE' but is called when the optimize level is
  25267. changed via an attribute or pragma or when it is reset at the end
  25268. of the code affected by the attribute or pragma. It is not called
  25269. at the beginning of compilation when 'TARGET_OPTION_OVERRIDE' is
  25270. called so if you want to perform these actions then, you should
  25271. have 'TARGET_OPTION_OVERRIDE' call
  25272. 'TARGET_OVERRIDE_OPTIONS_AFTER_CHANGE'.
  25273. -- Macro: C_COMMON_OVERRIDE_OPTIONS
  25274. This is similar to the 'TARGET_OPTION_OVERRIDE' hook but is only
  25275. used in the C language frontends (C, Objective-C, C++,
  25276. Objective-C++) and so can be used to alter option flag variables
  25277. which only exist in those frontends.
  25278. -- Common Target Hook: const struct default_options *
  25279. TARGET_OPTION_OPTIMIZATION_TABLE
  25280. Some machines may desire to change what optimizations are performed
  25281. for various optimization levels. This variable, if defined,
  25282. describes options to enable at particular sets of optimization
  25283. levels. These options are processed once just after the
  25284. optimization level is determined and before the remainder of the
  25285. command options have been parsed, so may be overridden by other
  25286. options passed explicitly.
  25287. This processing is run once at program startup and when the
  25288. optimization options are changed via '#pragma GCC optimize' or by
  25289. using the 'optimize' attribute.
  25290. -- Common Target Hook: void TARGET_OPTION_INIT_STRUCT (struct
  25291. gcc_options *OPTS)
  25292. Set target-dependent initial values of fields in OPTS.
  25293. -- Macro: SWITCHABLE_TARGET
  25294. Some targets need to switch between substantially different
  25295. subtargets during compilation. For example, the MIPS target has
  25296. one subtarget for the traditional MIPS architecture and another for
  25297. MIPS16. Source code can switch between these two subarchitectures
  25298. using the 'mips16' and 'nomips16' attributes.
  25299. Such subtargets can differ in things like the set of available
  25300. registers, the set of available instructions, the costs of various
  25301. operations, and so on. GCC caches a lot of this type of
  25302. information in global variables, and recomputing them for each
  25303. subtarget takes a significant amount of time. The compiler
  25304. therefore provides a facility for maintaining several versions of
  25305. the global variables and quickly switching between them; see
  25306. 'target-globals.h' for details.
  25307. Define this macro to 1 if your target needs this facility. The
  25308. default is 0.
  25309. -- Target Hook: bool TARGET_FLOAT_EXCEPTIONS_ROUNDING_SUPPORTED_P
  25310. (void)
  25311. Returns true if the target supports IEEE 754 floating-point
  25312. exceptions and rounding modes, false otherwise. This is intended
  25313. to relate to the 'float' and 'double' types, but not necessarily
  25314. 'long double'. By default, returns true if the 'adddf3'
  25315. instruction pattern is available and false otherwise, on the
  25316. assumption that hardware floating point supports exceptions and
  25317. rounding modes but software floating point does not.
  25318. 
  25319. File: gccint.info, Node: Per-Function Data, Next: Storage Layout, Prev: Run-time Target, Up: Target Macros
  25320. 18.4 Defining data structures for per-function information.
  25321. ===========================================================
  25322. If the target needs to store information on a per-function basis, GCC
  25323. provides a macro and a couple of variables to allow this. Note, just
  25324. using statics to store the information is a bad idea, since GCC supports
  25325. nested functions, so you can be halfway through encoding one function
  25326. when another one comes along.
  25327. GCC defines a data structure called 'struct function' which contains
  25328. all of the data specific to an individual function. This structure
  25329. contains a field called 'machine' whose type is 'struct machine_function
  25330. *', which can be used by targets to point to their own specific data.
  25331. If a target needs per-function specific data it should define the type
  25332. 'struct machine_function' and also the macro 'INIT_EXPANDERS'. This
  25333. macro should be used to initialize the function pointer
  25334. 'init_machine_status'. This pointer is explained below.
  25335. One typical use of per-function, target specific data is to create an
  25336. RTX to hold the register containing the function's return address. This
  25337. RTX can then be used to implement the '__builtin_return_address'
  25338. function, for level 0.
  25339. Note--earlier implementations of GCC used a single data area to hold
  25340. all of the per-function information. Thus when processing of a nested
  25341. function began the old per-function data had to be pushed onto a stack,
  25342. and when the processing was finished, it had to be popped off the stack.
  25343. GCC used to provide function pointers called 'save_machine_status' and
  25344. 'restore_machine_status' to handle the saving and restoring of the
  25345. target specific information. Since the single data area approach is no
  25346. longer used, these pointers are no longer supported.
  25347. -- Macro: INIT_EXPANDERS
  25348. Macro called to initialize any target specific information. This
  25349. macro is called once per function, before generation of any RTL has
  25350. begun. The intention of this macro is to allow the initialization
  25351. of the function pointer 'init_machine_status'.
  25352. -- Variable: void (*)(struct function *) init_machine_status
  25353. If this function pointer is non-'NULL' it will be called once per
  25354. function, before function compilation starts, in order to allow the
  25355. target to perform any target specific initialization of the 'struct
  25356. function' structure. It is intended that this would be used to
  25357. initialize the 'machine' of that structure.
  25358. 'struct machine_function' structures are expected to be freed by
  25359. GC. Generally, any memory that they reference must be allocated by
  25360. using GC allocation, including the structure itself.
  25361. 
  25362. File: gccint.info, Node: Storage Layout, Next: Type Layout, Prev: Per-Function Data, Up: Target Macros
  25363. 18.5 Storage Layout
  25364. ===================
  25365. Note that the definitions of the macros in this table which are sizes or
  25366. alignments measured in bits do not need to be constant. They can be C
  25367. expressions that refer to static variables, such as the 'target_flags'.
  25368. *Note Run-time Target::.
  25369. -- Macro: BITS_BIG_ENDIAN
  25370. Define this macro to have the value 1 if the most significant bit
  25371. in a byte has the lowest number; otherwise define it to have the
  25372. value zero. This means that bit-field instructions count from the
  25373. most significant bit. If the machine has no bit-field
  25374. instructions, then this must still be defined, but it doesn't
  25375. matter which value it is defined to. This macro need not be a
  25376. constant.
  25377. This macro does not affect the way structure fields are packed into
  25378. bytes or words; that is controlled by 'BYTES_BIG_ENDIAN'.
  25379. -- Macro: BYTES_BIG_ENDIAN
  25380. Define this macro to have the value 1 if the most significant byte
  25381. in a word has the lowest number. This macro need not be a
  25382. constant.
  25383. -- Macro: WORDS_BIG_ENDIAN
  25384. Define this macro to have the value 1 if, in a multiword object,
  25385. the most significant word has the lowest number. This applies to
  25386. both memory locations and registers; see 'REG_WORDS_BIG_ENDIAN' if
  25387. the order of words in memory is not the same as the order in
  25388. registers. This macro need not be a constant.
  25389. -- Macro: REG_WORDS_BIG_ENDIAN
  25390. On some machines, the order of words in a multiword object differs
  25391. between registers in memory. In such a situation, define this
  25392. macro to describe the order of words in a register. The macro
  25393. 'WORDS_BIG_ENDIAN' controls the order of words in memory.
  25394. -- Macro: FLOAT_WORDS_BIG_ENDIAN
  25395. Define this macro to have the value 1 if 'DFmode', 'XFmode' or
  25396. 'TFmode' floating point numbers are stored in memory with the word
  25397. containing the sign bit at the lowest address; otherwise define it
  25398. to have the value 0. This macro need not be a constant.
  25399. You need not define this macro if the ordering is the same as for
  25400. multi-word integers.
  25401. -- Macro: BITS_PER_WORD
  25402. Number of bits in a word. If you do not define this macro, the
  25403. default is 'BITS_PER_UNIT * UNITS_PER_WORD'.
  25404. -- Macro: MAX_BITS_PER_WORD
  25405. Maximum number of bits in a word. If this is undefined, the
  25406. default is 'BITS_PER_WORD'. Otherwise, it is the constant value
  25407. that is the largest value that 'BITS_PER_WORD' can have at
  25408. run-time.
  25409. -- Macro: UNITS_PER_WORD
  25410. Number of storage units in a word; normally the size of a
  25411. general-purpose register, a power of two from 1 or 8.
  25412. -- Macro: MIN_UNITS_PER_WORD
  25413. Minimum number of units in a word. If this is undefined, the
  25414. default is 'UNITS_PER_WORD'. Otherwise, it is the constant value
  25415. that is the smallest value that 'UNITS_PER_WORD' can have at
  25416. run-time.
  25417. -- Macro: POINTER_SIZE
  25418. Width of a pointer, in bits. You must specify a value no wider
  25419. than the width of 'Pmode'. If it is not equal to the width of
  25420. 'Pmode', you must define 'POINTERS_EXTEND_UNSIGNED'. If you do not
  25421. specify a value the default is 'BITS_PER_WORD'.
  25422. -- Macro: POINTERS_EXTEND_UNSIGNED
  25423. A C expression that determines how pointers should be extended from
  25424. 'ptr_mode' to either 'Pmode' or 'word_mode'. It is greater than
  25425. zero if pointers should be zero-extended, zero if they should be
  25426. sign-extended, and negative if some other sort of conversion is
  25427. needed. In the last case, the extension is done by the target's
  25428. 'ptr_extend' instruction.
  25429. You need not define this macro if the 'ptr_mode', 'Pmode' and
  25430. 'word_mode' are all the same width.
  25431. -- Macro: PROMOTE_MODE (M, UNSIGNEDP, TYPE)
  25432. A macro to update M and UNSIGNEDP when an object whose type is TYPE
  25433. and which has the specified mode and signedness is to be stored in
  25434. a register. This macro is only called when TYPE is a scalar type.
  25435. On most RISC machines, which only have operations that operate on a
  25436. full register, define this macro to set M to 'word_mode' if M is an
  25437. integer mode narrower than 'BITS_PER_WORD'. In most cases, only
  25438. integer modes should be widened because wider-precision
  25439. floating-point operations are usually more expensive than their
  25440. narrower counterparts.
  25441. For most machines, the macro definition does not change UNSIGNEDP.
  25442. However, some machines, have instructions that preferentially
  25443. handle either signed or unsigned quantities of certain modes. For
  25444. example, on the DEC Alpha, 32-bit loads from memory and 32-bit add
  25445. instructions sign-extend the result to 64 bits. On such machines,
  25446. set UNSIGNEDP according to which kind of extension is more
  25447. efficient.
  25448. Do not define this macro if it would never modify M.
  25449. -- Target Hook: enum flt_eval_method TARGET_C_EXCESS_PRECISION (enum
  25450. excess_precision_type TYPE)
  25451. Return a value, with the same meaning as the C99 macro
  25452. 'FLT_EVAL_METHOD' that describes which excess precision should be
  25453. applied. TYPE is either 'EXCESS_PRECISION_TYPE_IMPLICIT',
  25454. 'EXCESS_PRECISION_TYPE_FAST', or 'EXCESS_PRECISION_TYPE_STANDARD'.
  25455. For 'EXCESS_PRECISION_TYPE_IMPLICIT', the target should return
  25456. which precision and range operations will be implictly evaluated in
  25457. regardless of the excess precision explicitly added. For
  25458. 'EXCESS_PRECISION_TYPE_STANDARD' and 'EXCESS_PRECISION_TYPE_FAST',
  25459. the target should return the explicit excess precision that should
  25460. be added depending on the value set for
  25461. '-fexcess-precision=[standard|fast]'. Note that unpredictable
  25462. explicit excess precision does not make sense, so a target should
  25463. never return 'FLT_EVAL_METHOD_UNPREDICTABLE' when TYPE is
  25464. 'EXCESS_PRECISION_TYPE_STANDARD' or 'EXCESS_PRECISION_TYPE_FAST'.
  25465. -- Target Hook: machine_mode TARGET_PROMOTE_FUNCTION_MODE (const_tree
  25466. TYPE, machine_mode MODE, int *PUNSIGNEDP, const_tree FUNTYPE,
  25467. int FOR_RETURN)
  25468. Like 'PROMOTE_MODE', but it is applied to outgoing function
  25469. arguments or function return values. The target hook should return
  25470. the new mode and possibly change '*PUNSIGNEDP' if the promotion
  25471. should change signedness. This function is called only for scalar
  25472. _or pointer_ types.
  25473. FOR_RETURN allows to distinguish the promotion of arguments and
  25474. return values. If it is '1', a return value is being promoted and
  25475. 'TARGET_FUNCTION_VALUE' must perform the same promotions done here.
  25476. If it is '2', the returned mode should be that of the register in
  25477. which an incoming parameter is copied, or the outgoing result is
  25478. computed; then the hook should return the same mode as
  25479. 'promote_mode', though the signedness may be different.
  25480. TYPE can be NULL when promoting function arguments of libcalls.
  25481. The default is to not promote arguments and return values. You can
  25482. also define the hook to
  25483. 'default_promote_function_mode_always_promote' if you would like to
  25484. apply the same rules given by 'PROMOTE_MODE'.
  25485. -- Macro: PARM_BOUNDARY
  25486. Normal alignment required for function parameters on the stack, in
  25487. bits. All stack parameters receive at least this much alignment
  25488. regardless of data type. On most machines, this is the same as the
  25489. size of an integer.
  25490. -- Macro: STACK_BOUNDARY
  25491. Define this macro to the minimum alignment enforced by hardware for
  25492. the stack pointer on this machine. The definition is a C
  25493. expression for the desired alignment (measured in bits). This
  25494. value is used as a default if 'PREFERRED_STACK_BOUNDARY' is not
  25495. defined. On most machines, this should be the same as
  25496. 'PARM_BOUNDARY'.
  25497. -- Macro: PREFERRED_STACK_BOUNDARY
  25498. Define this macro if you wish to preserve a certain alignment for
  25499. the stack pointer, greater than what the hardware enforces. The
  25500. definition is a C expression for the desired alignment (measured in
  25501. bits). This macro must evaluate to a value equal to or larger than
  25502. 'STACK_BOUNDARY'.
  25503. -- Macro: INCOMING_STACK_BOUNDARY
  25504. Define this macro if the incoming stack boundary may be different
  25505. from 'PREFERRED_STACK_BOUNDARY'. This macro must evaluate to a
  25506. value equal to or larger than 'STACK_BOUNDARY'.
  25507. -- Macro: FUNCTION_BOUNDARY
  25508. Alignment required for a function entry point, in bits.
  25509. -- Macro: BIGGEST_ALIGNMENT
  25510. Biggest alignment that any data type can require on this machine,
  25511. in bits. Note that this is not the biggest alignment that is
  25512. supported, just the biggest alignment that, when violated, may
  25513. cause a fault.
  25514. -- Target Hook: HOST_WIDE_INT TARGET_ABSOLUTE_BIGGEST_ALIGNMENT
  25515. If defined, this target hook specifies the absolute biggest
  25516. alignment that a type or variable can have on this machine,
  25517. otherwise, 'BIGGEST_ALIGNMENT' is used.
  25518. -- Macro: MALLOC_ABI_ALIGNMENT
  25519. Alignment, in bits, a C conformant malloc implementation has to
  25520. provide. If not defined, the default value is 'BITS_PER_WORD'.
  25521. -- Macro: ATTRIBUTE_ALIGNED_VALUE
  25522. Alignment used by the '__attribute__ ((aligned))' construct. If
  25523. not defined, the default value is 'BIGGEST_ALIGNMENT'.
  25524. -- Macro: MINIMUM_ATOMIC_ALIGNMENT
  25525. If defined, the smallest alignment, in bits, that can be given to
  25526. an object that can be referenced in one operation, without
  25527. disturbing any nearby object. Normally, this is 'BITS_PER_UNIT',
  25528. but may be larger on machines that don't have byte or half-word
  25529. store operations.
  25530. -- Macro: BIGGEST_FIELD_ALIGNMENT
  25531. Biggest alignment that any structure or union field can require on
  25532. this machine, in bits. If defined, this overrides
  25533. 'BIGGEST_ALIGNMENT' for structure and union fields only, unless the
  25534. field alignment has been set by the '__attribute__ ((aligned (N)))'
  25535. construct.
  25536. -- Macro: ADJUST_FIELD_ALIGN (FIELD, TYPE, COMPUTED)
  25537. An expression for the alignment of a structure field FIELD of type
  25538. TYPE if the alignment computed in the usual way (including applying
  25539. of 'BIGGEST_ALIGNMENT' and 'BIGGEST_FIELD_ALIGNMENT' to the
  25540. alignment) is COMPUTED. It overrides alignment only if the field
  25541. alignment has not been set by the '__attribute__ ((aligned (N)))'
  25542. construct. Note that FIELD may be 'NULL_TREE' in case we just
  25543. query for the minimum alignment of a field of type TYPE in
  25544. structure context.
  25545. -- Macro: MAX_STACK_ALIGNMENT
  25546. Biggest stack alignment guaranteed by the backend. Use this macro
  25547. to specify the maximum alignment of a variable on stack.
  25548. If not defined, the default value is 'STACK_BOUNDARY'.
  25549. -- Macro: MAX_OFILE_ALIGNMENT
  25550. Biggest alignment supported by the object file format of this
  25551. machine. Use this macro to limit the alignment which can be
  25552. specified using the '__attribute__ ((aligned (N)))' construct for
  25553. functions and objects with static storage duration. The alignment
  25554. of automatic objects may exceed the object file format maximum up
  25555. to the maximum supported by GCC. If not defined, the default value
  25556. is 'BIGGEST_ALIGNMENT'.
  25557. On systems that use ELF, the default (in 'config/elfos.h') is the
  25558. largest supported 32-bit ELF section alignment representable on a
  25559. 32-bit host e.g. '(((uint64_t) 1 << 28) * 8)'. On 32-bit ELF the
  25560. largest supported section alignment in bits is '(0x80000000 * 8)',
  25561. but this is not representable on 32-bit hosts.
  25562. -- Target Hook: HOST_WIDE_INT TARGET_STATIC_RTX_ALIGNMENT (machine_mode
  25563. MODE)
  25564. This hook returns the preferred alignment in bits for a
  25565. statically-allocated rtx, such as a constant pool entry. MODE is
  25566. the mode of the rtx. The default implementation returns
  25567. 'GET_MODE_ALIGNMENT (MODE)'.
  25568. -- Macro: DATA_ALIGNMENT (TYPE, BASIC-ALIGN)
  25569. If defined, a C expression to compute the alignment for a variable
  25570. in the static store. TYPE is the data type, and BASIC-ALIGN is the
  25571. alignment that the object would ordinarily have. The value of this
  25572. macro is used instead of that alignment to align the object.
  25573. If this macro is not defined, then BASIC-ALIGN is used.
  25574. One use of this macro is to increase alignment of medium-size data
  25575. to make it all fit in fewer cache lines. Another is to cause
  25576. character arrays to be word-aligned so that 'strcpy' calls that
  25577. copy constants to character arrays can be done inline.
  25578. -- Macro: DATA_ABI_ALIGNMENT (TYPE, BASIC-ALIGN)
  25579. Similar to 'DATA_ALIGNMENT', but for the cases where the ABI
  25580. mandates some alignment increase, instead of optimization only
  25581. purposes. E.g. AMD x86-64 psABI says that variables with array
  25582. type larger than 15 bytes must be aligned to 16 byte boundaries.
  25583. If this macro is not defined, then BASIC-ALIGN is used.
  25584. -- Target Hook: HOST_WIDE_INT TARGET_CONSTANT_ALIGNMENT (const_tree
  25585. CONSTANT, HOST_WIDE_INT BASIC_ALIGN)
  25586. This hook returns the alignment in bits of a constant that is being
  25587. placed in memory. CONSTANT is the constant and BASIC_ALIGN is the
  25588. alignment that the object would ordinarily have.
  25589. The default definition just returns BASIC_ALIGN.
  25590. The typical use of this hook is to increase alignment for string
  25591. constants to be word aligned so that 'strcpy' calls that copy
  25592. constants can be done inline. The function
  25593. 'constant_alignment_word_strings' provides such a definition.
  25594. -- Macro: LOCAL_ALIGNMENT (TYPE, BASIC-ALIGN)
  25595. If defined, a C expression to compute the alignment for a variable
  25596. in the local store. TYPE is the data type, and BASIC-ALIGN is the
  25597. alignment that the object would ordinarily have. The value of this
  25598. macro is used instead of that alignment to align the object.
  25599. If this macro is not defined, then BASIC-ALIGN is used.
  25600. One use of this macro is to increase alignment of medium-size data
  25601. to make it all fit in fewer cache lines.
  25602. If the value of this macro has a type, it should be an unsigned
  25603. type.
  25604. -- Target Hook: HOST_WIDE_INT TARGET_VECTOR_ALIGNMENT (const_tree TYPE)
  25605. This hook can be used to define the alignment for a vector of type
  25606. TYPE, in order to comply with a platform ABI. The default is to
  25607. require natural alignment for vector types. The alignment returned
  25608. by this hook must be a power-of-two multiple of the default
  25609. alignment of the vector element type.
  25610. -- Macro: STACK_SLOT_ALIGNMENT (TYPE, MODE, BASIC-ALIGN)
  25611. If defined, a C expression to compute the alignment for stack slot.
  25612. TYPE is the data type, MODE is the widest mode available, and
  25613. BASIC-ALIGN is the alignment that the slot would ordinarily have.
  25614. The value of this macro is used instead of that alignment to align
  25615. the slot.
  25616. If this macro is not defined, then BASIC-ALIGN is used when TYPE is
  25617. 'NULL'. Otherwise, 'LOCAL_ALIGNMENT' will be used.
  25618. This macro is to set alignment of stack slot to the maximum
  25619. alignment of all possible modes which the slot may have.
  25620. If the value of this macro has a type, it should be an unsigned
  25621. type.
  25622. -- Macro: LOCAL_DECL_ALIGNMENT (DECL)
  25623. If defined, a C expression to compute the alignment for a local
  25624. variable DECL.
  25625. If this macro is not defined, then 'LOCAL_ALIGNMENT (TREE_TYPE
  25626. (DECL), DECL_ALIGN (DECL))' is used.
  25627. One use of this macro is to increase alignment of medium-size data
  25628. to make it all fit in fewer cache lines.
  25629. If the value of this macro has a type, it should be an unsigned
  25630. type.
  25631. -- Macro: MINIMUM_ALIGNMENT (EXP, MODE, ALIGN)
  25632. If defined, a C expression to compute the minimum required
  25633. alignment for dynamic stack realignment purposes for EXP (a type or
  25634. decl), MODE, assuming normal alignment ALIGN.
  25635. If this macro is not defined, then ALIGN will be used.
  25636. -- Macro: EMPTY_FIELD_BOUNDARY
  25637. Alignment in bits to be given to a structure bit-field that follows
  25638. an empty field such as 'int : 0;'.
  25639. If 'PCC_BITFIELD_TYPE_MATTERS' is true, it overrides this macro.
  25640. -- Macro: STRUCTURE_SIZE_BOUNDARY
  25641. Number of bits which any structure or union's size must be a
  25642. multiple of. Each structure or union's size is rounded up to a
  25643. multiple of this.
  25644. If you do not define this macro, the default is the same as
  25645. 'BITS_PER_UNIT'.
  25646. -- Macro: STRICT_ALIGNMENT
  25647. Define this macro to be the value 1 if instructions will fail to
  25648. work if given data not on the nominal alignment. If instructions
  25649. will merely go slower in that case, define this macro as 0.
  25650. -- Macro: PCC_BITFIELD_TYPE_MATTERS
  25651. Define this if you wish to imitate the way many other C compilers
  25652. handle alignment of bit-fields and the structures that contain
  25653. them.
  25654. The behavior is that the type written for a named bit-field ('int',
  25655. 'short', or other integer type) imposes an alignment for the entire
  25656. structure, as if the structure really did contain an ordinary field
  25657. of that type. In addition, the bit-field is placed within the
  25658. structure so that it would fit within such a field, not crossing a
  25659. boundary for it.
  25660. Thus, on most machines, a named bit-field whose type is written as
  25661. 'int' would not cross a four-byte boundary, and would force
  25662. four-byte alignment for the whole structure. (The alignment used
  25663. may not be four bytes; it is controlled by the other alignment
  25664. parameters.)
  25665. An unnamed bit-field will not affect the alignment of the
  25666. containing structure.
  25667. If the macro is defined, its definition should be a C expression; a
  25668. nonzero value for the expression enables this behavior.
  25669. Note that if this macro is not defined, or its value is zero, some
  25670. bit-fields may cross more than one alignment boundary. The
  25671. compiler can support such references if there are 'insv', 'extv',
  25672. and 'extzv' insns that can directly reference memory.
  25673. The other known way of making bit-fields work is to define
  25674. 'STRUCTURE_SIZE_BOUNDARY' as large as 'BIGGEST_ALIGNMENT'. Then
  25675. every structure can be accessed with fullwords.
  25676. Unless the machine has bit-field instructions or you define
  25677. 'STRUCTURE_SIZE_BOUNDARY' that way, you must define
  25678. 'PCC_BITFIELD_TYPE_MATTERS' to have a nonzero value.
  25679. If your aim is to make GCC use the same conventions for laying out
  25680. bit-fields as are used by another compiler, here is how to
  25681. investigate what the other compiler does. Compile and run this
  25682. program:
  25683. struct foo1
  25684. {
  25685. char x;
  25686. char :0;
  25687. char y;
  25688. };
  25689. struct foo2
  25690. {
  25691. char x;
  25692. int :0;
  25693. char y;
  25694. };
  25695. main ()
  25696. {
  25697. printf ("Size of foo1 is %d\n",
  25698. sizeof (struct foo1));
  25699. printf ("Size of foo2 is %d\n",
  25700. sizeof (struct foo2));
  25701. exit (0);
  25702. }
  25703. If this prints 2 and 5, then the compiler's behavior is what you
  25704. would get from 'PCC_BITFIELD_TYPE_MATTERS'.
  25705. -- Macro: BITFIELD_NBYTES_LIMITED
  25706. Like 'PCC_BITFIELD_TYPE_MATTERS' except that its effect is limited
  25707. to aligning a bit-field within the structure.
  25708. -- Target Hook: bool TARGET_ALIGN_ANON_BITFIELD (void)
  25709. When 'PCC_BITFIELD_TYPE_MATTERS' is true this hook will determine
  25710. whether unnamed bitfields affect the alignment of the containing
  25711. structure. The hook should return true if the structure should
  25712. inherit the alignment requirements of an unnamed bitfield's type.
  25713. -- Target Hook: bool TARGET_NARROW_VOLATILE_BITFIELD (void)
  25714. This target hook should return 'true' if accesses to volatile
  25715. bitfields should use the narrowest mode possible. It should return
  25716. 'false' if these accesses should use the bitfield container type.
  25717. The default is 'false'.
  25718. -- Target Hook: bool TARGET_MEMBER_TYPE_FORCES_BLK (const_tree FIELD,
  25719. machine_mode MODE)
  25720. Return true if a structure, union or array containing FIELD should
  25721. be accessed using 'BLKMODE'.
  25722. If FIELD is the only field in the structure, MODE is its mode,
  25723. otherwise MODE is VOIDmode. MODE is provided in the case where
  25724. structures of one field would require the structure's mode to
  25725. retain the field's mode.
  25726. Normally, this is not needed.
  25727. -- Macro: ROUND_TYPE_ALIGN (TYPE, COMPUTED, SPECIFIED)
  25728. Define this macro as an expression for the alignment of a type
  25729. (given by TYPE as a tree node) if the alignment computed in the
  25730. usual way is COMPUTED and the alignment explicitly specified was
  25731. SPECIFIED.
  25732. The default is to use SPECIFIED if it is larger; otherwise, use the
  25733. smaller of COMPUTED and 'BIGGEST_ALIGNMENT'
  25734. -- Macro: MAX_FIXED_MODE_SIZE
  25735. An integer expression for the size in bits of the largest integer
  25736. machine mode that should actually be used. All integer machine
  25737. modes of this size or smaller can be used for structures and unions
  25738. with the appropriate sizes. If this macro is undefined,
  25739. 'GET_MODE_BITSIZE (DImode)' is assumed.
  25740. -- Macro: STACK_SAVEAREA_MODE (SAVE_LEVEL)
  25741. If defined, an expression of type 'machine_mode' that specifies the
  25742. mode of the save area operand of a 'save_stack_LEVEL' named pattern
  25743. (*note Standard Names::). SAVE_LEVEL is one of 'SAVE_BLOCK',
  25744. 'SAVE_FUNCTION', or 'SAVE_NONLOCAL' and selects which of the three
  25745. named patterns is having its mode specified.
  25746. You need not define this macro if it always returns 'Pmode'. You
  25747. would most commonly define this macro if the 'save_stack_LEVEL'
  25748. patterns need to support both a 32- and a 64-bit mode.
  25749. -- Macro: STACK_SIZE_MODE
  25750. If defined, an expression of type 'machine_mode' that specifies the
  25751. mode of the size increment operand of an 'allocate_stack' named
  25752. pattern (*note Standard Names::).
  25753. You need not define this macro if it always returns 'word_mode'.
  25754. You would most commonly define this macro if the 'allocate_stack'
  25755. pattern needs to support both a 32- and a 64-bit mode.
  25756. -- Target Hook: scalar_int_mode TARGET_LIBGCC_CMP_RETURN_MODE (void)
  25757. This target hook should return the mode to be used for the return
  25758. value of compare instructions expanded to libgcc calls. If not
  25759. defined 'word_mode' is returned which is the right choice for a
  25760. majority of targets.
  25761. -- Target Hook: scalar_int_mode TARGET_LIBGCC_SHIFT_COUNT_MODE (void)
  25762. This target hook should return the mode to be used for the shift
  25763. count operand of shift instructions expanded to libgcc calls. If
  25764. not defined 'word_mode' is returned which is the right choice for a
  25765. majority of targets.
  25766. -- Target Hook: scalar_int_mode TARGET_UNWIND_WORD_MODE (void)
  25767. Return machine mode to be used for '_Unwind_Word' type. The
  25768. default is to use 'word_mode'.
  25769. -- Target Hook: bool TARGET_MS_BITFIELD_LAYOUT_P (const_tree
  25770. RECORD_TYPE)
  25771. This target hook returns 'true' if bit-fields in the given
  25772. RECORD_TYPE are to be laid out following the rules of Microsoft
  25773. Visual C/C++, namely: (i) a bit-field won't share the same storage
  25774. unit with the previous bit-field if their underlying types have
  25775. different sizes, and the bit-field will be aligned to the highest
  25776. alignment of the underlying types of itself and of the previous
  25777. bit-field; (ii) a zero-sized bit-field will affect the alignment of
  25778. the whole enclosing structure, even if it is unnamed; except that
  25779. (iii) a zero-sized bit-field will be disregarded unless it follows
  25780. another bit-field of nonzero size. If this hook returns 'true',
  25781. other macros that control bit-field layout are ignored.
  25782. When a bit-field is inserted into a packed record, the whole size
  25783. of the underlying type is used by one or more same-size adjacent
  25784. bit-fields (that is, if its long:3, 32 bits is used in the record,
  25785. and any additional adjacent long bit-fields are packed into the
  25786. same chunk of 32 bits. However, if the size changes, a new field
  25787. of that size is allocated). In an unpacked record, this is the
  25788. same as using alignment, but not equivalent when packing.
  25789. If both MS bit-fields and '__attribute__((packed))' are used, the
  25790. latter will take precedence. If '__attribute__((packed))' is used
  25791. on a single field when MS bit-fields are in use, it will take
  25792. precedence for that field, but the alignment of the rest of the
  25793. structure may affect its placement.
  25794. -- Target Hook: bool TARGET_DECIMAL_FLOAT_SUPPORTED_P (void)
  25795. Returns true if the target supports decimal floating point.
  25796. -- Target Hook: bool TARGET_FIXED_POINT_SUPPORTED_P (void)
  25797. Returns true if the target supports fixed-point arithmetic.
  25798. -- Target Hook: void TARGET_EXPAND_TO_RTL_HOOK (void)
  25799. This hook is called just before expansion into rtl, allowing the
  25800. target to perform additional initializations or analysis before the
  25801. expansion. For example, the rs6000 port uses it to allocate a
  25802. scratch stack slot for use in copying SDmode values between memory
  25803. and floating point registers whenever the function being expanded
  25804. has any SDmode usage.
  25805. -- Target Hook: void TARGET_INSTANTIATE_DECLS (void)
  25806. This hook allows the backend to perform additional instantiations
  25807. on rtl that are not actually in any insns yet, but will be later.
  25808. -- Target Hook: const char * TARGET_MANGLE_TYPE (const_tree TYPE)
  25809. If your target defines any fundamental types, or any types your
  25810. target uses should be mangled differently from the default, define
  25811. this hook to return the appropriate encoding for these types as
  25812. part of a C++ mangled name. The TYPE argument is the tree
  25813. structure representing the type to be mangled. The hook may be
  25814. applied to trees which are not target-specific fundamental types;
  25815. it should return 'NULL' for all such types, as well as arguments it
  25816. does not recognize. If the return value is not 'NULL', it must
  25817. point to a statically-allocated string constant.
  25818. Target-specific fundamental types might be new fundamental types or
  25819. qualified versions of ordinary fundamental types. Encode new
  25820. fundamental types as 'u N NAME', where NAME is the name used for
  25821. the type in source code, and N is the length of NAME in decimal.
  25822. Encode qualified versions of ordinary types as 'U N NAME CODE',
  25823. where NAME is the name used for the type qualifier in source code,
  25824. N is the length of NAME as above, and CODE is the code used to
  25825. represent the unqualified version of this type. (See
  25826. 'write_builtin_type' in 'cp/mangle.c' for the list of codes.) In
  25827. both cases the spaces are for clarity; do not include any spaces in
  25828. your string.
  25829. This hook is applied to types prior to typedef resolution. If the
  25830. mangled name for a particular type depends only on that type's main
  25831. variant, you can perform typedef resolution yourself using
  25832. 'TYPE_MAIN_VARIANT' before mangling.
  25833. The default version of this hook always returns 'NULL', which is
  25834. appropriate for a target that does not define any new fundamental
  25835. types.
  25836. 
  25837. File: gccint.info, Node: Type Layout, Next: Registers, Prev: Storage Layout, Up: Target Macros
  25838. 18.6 Layout of Source Language Data Types
  25839. =========================================
  25840. These macros define the sizes and other characteristics of the standard
  25841. basic data types used in programs being compiled. Unlike the macros in
  25842. the previous section, these apply to specific features of C and related
  25843. languages, rather than to fundamental aspects of storage layout.
  25844. -- Macro: INT_TYPE_SIZE
  25845. A C expression for the size in bits of the type 'int' on the target
  25846. machine. If you don't define this, the default is one word.
  25847. -- Macro: SHORT_TYPE_SIZE
  25848. A C expression for the size in bits of the type 'short' on the
  25849. target machine. If you don't define this, the default is half a
  25850. word. (If this would be less than one storage unit, it is rounded
  25851. up to one unit.)
  25852. -- Macro: LONG_TYPE_SIZE
  25853. A C expression for the size in bits of the type 'long' on the
  25854. target machine. If you don't define this, the default is one word.
  25855. -- Macro: ADA_LONG_TYPE_SIZE
  25856. On some machines, the size used for the Ada equivalent of the type
  25857. 'long' by a native Ada compiler differs from that used by C. In
  25858. that situation, define this macro to be a C expression to be used
  25859. for the size of that type. If you don't define this, the default
  25860. is the value of 'LONG_TYPE_SIZE'.
  25861. -- Macro: LONG_LONG_TYPE_SIZE
  25862. A C expression for the size in bits of the type 'long long' on the
  25863. target machine. If you don't define this, the default is two
  25864. words. If you want to support GNU Ada on your machine, the value
  25865. of this macro must be at least 64.
  25866. -- Macro: CHAR_TYPE_SIZE
  25867. A C expression for the size in bits of the type 'char' on the
  25868. target machine. If you don't define this, the default is
  25869. 'BITS_PER_UNIT'.
  25870. -- Macro: BOOL_TYPE_SIZE
  25871. A C expression for the size in bits of the C++ type 'bool' and C99
  25872. type '_Bool' on the target machine. If you don't define this, and
  25873. you probably shouldn't, the default is 'CHAR_TYPE_SIZE'.
  25874. -- Macro: FLOAT_TYPE_SIZE
  25875. A C expression for the size in bits of the type 'float' on the
  25876. target machine. If you don't define this, the default is one word.
  25877. -- Macro: DOUBLE_TYPE_SIZE
  25878. A C expression for the size in bits of the type 'double' on the
  25879. target machine. If you don't define this, the default is two
  25880. words.
  25881. -- Macro: LONG_DOUBLE_TYPE_SIZE
  25882. A C expression for the size in bits of the type 'long double' on
  25883. the target machine. If you don't define this, the default is two
  25884. words.
  25885. -- Macro: SHORT_FRACT_TYPE_SIZE
  25886. A C expression for the size in bits of the type 'short _Fract' on
  25887. the target machine. If you don't define this, the default is
  25888. 'BITS_PER_UNIT'.
  25889. -- Macro: FRACT_TYPE_SIZE
  25890. A C expression for the size in bits of the type '_Fract' on the
  25891. target machine. If you don't define this, the default is
  25892. 'BITS_PER_UNIT * 2'.
  25893. -- Macro: LONG_FRACT_TYPE_SIZE
  25894. A C expression for the size in bits of the type 'long _Fract' on
  25895. the target machine. If you don't define this, the default is
  25896. 'BITS_PER_UNIT * 4'.
  25897. -- Macro: LONG_LONG_FRACT_TYPE_SIZE
  25898. A C expression for the size in bits of the type 'long long _Fract'
  25899. on the target machine. If you don't define this, the default is
  25900. 'BITS_PER_UNIT * 8'.
  25901. -- Macro: SHORT_ACCUM_TYPE_SIZE
  25902. A C expression for the size in bits of the type 'short _Accum' on
  25903. the target machine. If you don't define this, the default is
  25904. 'BITS_PER_UNIT * 2'.
  25905. -- Macro: ACCUM_TYPE_SIZE
  25906. A C expression for the size in bits of the type '_Accum' on the
  25907. target machine. If you don't define this, the default is
  25908. 'BITS_PER_UNIT * 4'.
  25909. -- Macro: LONG_ACCUM_TYPE_SIZE
  25910. A C expression for the size in bits of the type 'long _Accum' on
  25911. the target machine. If you don't define this, the default is
  25912. 'BITS_PER_UNIT * 8'.
  25913. -- Macro: LONG_LONG_ACCUM_TYPE_SIZE
  25914. A C expression for the size in bits of the type 'long long _Accum'
  25915. on the target machine. If you don't define this, the default is
  25916. 'BITS_PER_UNIT * 16'.
  25917. -- Macro: LIBGCC2_GNU_PREFIX
  25918. This macro corresponds to the 'TARGET_LIBFUNC_GNU_PREFIX' target
  25919. hook and should be defined if that hook is overriden to be true.
  25920. It causes function names in libgcc to be changed to use a '__gnu_'
  25921. prefix for their name rather than the default '__'. A port which
  25922. uses this macro should also arrange to use 't-gnu-prefix' in the
  25923. libgcc 'config.host'.
  25924. -- Macro: WIDEST_HARDWARE_FP_SIZE
  25925. A C expression for the size in bits of the widest floating-point
  25926. format supported by the hardware. If you define this macro, you
  25927. must specify a value less than or equal to the value of
  25928. 'LONG_DOUBLE_TYPE_SIZE'. If you do not define this macro, the
  25929. value of 'LONG_DOUBLE_TYPE_SIZE' is the default.
  25930. -- Macro: DEFAULT_SIGNED_CHAR
  25931. An expression whose value is 1 or 0, according to whether the type
  25932. 'char' should be signed or unsigned by default. The user can
  25933. always override this default with the options '-fsigned-char' and
  25934. '-funsigned-char'.
  25935. -- Target Hook: bool TARGET_DEFAULT_SHORT_ENUMS (void)
  25936. This target hook should return true if the compiler should give an
  25937. 'enum' type only as many bytes as it takes to represent the range
  25938. of possible values of that type. It should return false if all
  25939. 'enum' types should be allocated like 'int'.
  25940. The default is to return false.
  25941. -- Macro: SIZE_TYPE
  25942. A C expression for a string describing the name of the data type to
  25943. use for size values. The typedef name 'size_t' is defined using
  25944. the contents of the string.
  25945. The string can contain more than one keyword. If so, separate them
  25946. with spaces, and write first any length keyword, then 'unsigned' if
  25947. appropriate, and finally 'int'. The string must exactly match one
  25948. of the data type names defined in the function
  25949. 'c_common_nodes_and_builtins' in the file 'c-family/c-common.c'.
  25950. You may not omit 'int' or change the order--that would cause the
  25951. compiler to crash on startup.
  25952. If you don't define this macro, the default is '"long unsigned
  25953. int"'.
  25954. -- Macro: SIZETYPE
  25955. GCC defines internal types ('sizetype', 'ssizetype', 'bitsizetype'
  25956. and 'sbitsizetype') for expressions dealing with size. This macro
  25957. is a C expression for a string describing the name of the data type
  25958. from which the precision of 'sizetype' is extracted.
  25959. The string has the same restrictions as 'SIZE_TYPE' string.
  25960. If you don't define this macro, the default is 'SIZE_TYPE'.
  25961. -- Macro: PTRDIFF_TYPE
  25962. A C expression for a string describing the name of the data type to
  25963. use for the result of subtracting two pointers. The typedef name
  25964. 'ptrdiff_t' is defined using the contents of the string. See
  25965. 'SIZE_TYPE' above for more information.
  25966. If you don't define this macro, the default is '"long int"'.
  25967. -- Macro: WCHAR_TYPE
  25968. A C expression for a string describing the name of the data type to
  25969. use for wide characters. The typedef name 'wchar_t' is defined
  25970. using the contents of the string. See 'SIZE_TYPE' above for more
  25971. information.
  25972. If you don't define this macro, the default is '"int"'.
  25973. -- Macro: WCHAR_TYPE_SIZE
  25974. A C expression for the size in bits of the data type for wide
  25975. characters. This is used in 'cpp', which cannot make use of
  25976. 'WCHAR_TYPE'.
  25977. -- Macro: WINT_TYPE
  25978. A C expression for a string describing the name of the data type to
  25979. use for wide characters passed to 'printf' and returned from
  25980. 'getwc'. The typedef name 'wint_t' is defined using the contents
  25981. of the string. See 'SIZE_TYPE' above for more information.
  25982. If you don't define this macro, the default is '"unsigned int"'.
  25983. -- Macro: INTMAX_TYPE
  25984. A C expression for a string describing the name of the data type
  25985. that can represent any value of any standard or extended signed
  25986. integer type. The typedef name 'intmax_t' is defined using the
  25987. contents of the string. See 'SIZE_TYPE' above for more
  25988. information.
  25989. If you don't define this macro, the default is the first of
  25990. '"int"', '"long int"', or '"long long int"' that has as much
  25991. precision as 'long long int'.
  25992. -- Macro: UINTMAX_TYPE
  25993. A C expression for a string describing the name of the data type
  25994. that can represent any value of any standard or extended unsigned
  25995. integer type. The typedef name 'uintmax_t' is defined using the
  25996. contents of the string. See 'SIZE_TYPE' above for more
  25997. information.
  25998. If you don't define this macro, the default is the first of
  25999. '"unsigned int"', '"long unsigned int"', or '"long long unsigned
  26000. int"' that has as much precision as 'long long unsigned int'.
  26001. -- Macro: SIG_ATOMIC_TYPE
  26002. -- Macro: INT8_TYPE
  26003. -- Macro: INT16_TYPE
  26004. -- Macro: INT32_TYPE
  26005. -- Macro: INT64_TYPE
  26006. -- Macro: UINT8_TYPE
  26007. -- Macro: UINT16_TYPE
  26008. -- Macro: UINT32_TYPE
  26009. -- Macro: UINT64_TYPE
  26010. -- Macro: INT_LEAST8_TYPE
  26011. -- Macro: INT_LEAST16_TYPE
  26012. -- Macro: INT_LEAST32_TYPE
  26013. -- Macro: INT_LEAST64_TYPE
  26014. -- Macro: UINT_LEAST8_TYPE
  26015. -- Macro: UINT_LEAST16_TYPE
  26016. -- Macro: UINT_LEAST32_TYPE
  26017. -- Macro: UINT_LEAST64_TYPE
  26018. -- Macro: INT_FAST8_TYPE
  26019. -- Macro: INT_FAST16_TYPE
  26020. -- Macro: INT_FAST32_TYPE
  26021. -- Macro: INT_FAST64_TYPE
  26022. -- Macro: UINT_FAST8_TYPE
  26023. -- Macro: UINT_FAST16_TYPE
  26024. -- Macro: UINT_FAST32_TYPE
  26025. -- Macro: UINT_FAST64_TYPE
  26026. -- Macro: INTPTR_TYPE
  26027. -- Macro: UINTPTR_TYPE
  26028. C expressions for the standard types 'sig_atomic_t', 'int8_t',
  26029. 'int16_t', 'int32_t', 'int64_t', 'uint8_t', 'uint16_t', 'uint32_t',
  26030. 'uint64_t', 'int_least8_t', 'int_least16_t', 'int_least32_t',
  26031. 'int_least64_t', 'uint_least8_t', 'uint_least16_t',
  26032. 'uint_least32_t', 'uint_least64_t', 'int_fast8_t', 'int_fast16_t',
  26033. 'int_fast32_t', 'int_fast64_t', 'uint_fast8_t', 'uint_fast16_t',
  26034. 'uint_fast32_t', 'uint_fast64_t', 'intptr_t', and 'uintptr_t'. See
  26035. 'SIZE_TYPE' above for more information.
  26036. If any of these macros evaluates to a null pointer, the
  26037. corresponding type is not supported; if GCC is configured to
  26038. provide '<stdint.h>' in such a case, the header provided may not
  26039. conform to C99, depending on the type in question. The defaults
  26040. for all of these macros are null pointers.
  26041. -- Macro: TARGET_PTRMEMFUNC_VBIT_LOCATION
  26042. The C++ compiler represents a pointer-to-member-function with a
  26043. struct that looks like:
  26044. struct {
  26045. union {
  26046. void (*fn)();
  26047. ptrdiff_t vtable_index;
  26048. };
  26049. ptrdiff_t delta;
  26050. };
  26051. The C++ compiler must use one bit to indicate whether the function
  26052. that will be called through a pointer-to-member-function is
  26053. virtual. Normally, we assume that the low-order bit of a function
  26054. pointer must always be zero. Then, by ensuring that the
  26055. vtable_index is odd, we can distinguish which variant of the union
  26056. is in use. But, on some platforms function pointers can be odd,
  26057. and so this doesn't work. In that case, we use the low-order bit
  26058. of the 'delta' field, and shift the remainder of the 'delta' field
  26059. to the left.
  26060. GCC will automatically make the right selection about where to
  26061. store this bit using the 'FUNCTION_BOUNDARY' setting for your
  26062. platform. However, some platforms such as ARM/Thumb have
  26063. 'FUNCTION_BOUNDARY' set such that functions always start at even
  26064. addresses, but the lowest bit of pointers to functions indicate
  26065. whether the function at that address is in ARM or Thumb mode. If
  26066. this is the case of your architecture, you should define this macro
  26067. to 'ptrmemfunc_vbit_in_delta'.
  26068. In general, you should not have to define this macro. On
  26069. architectures in which function addresses are always even,
  26070. according to 'FUNCTION_BOUNDARY', GCC will automatically define
  26071. this macro to 'ptrmemfunc_vbit_in_pfn'.
  26072. -- Macro: TARGET_VTABLE_USES_DESCRIPTORS
  26073. Normally, the C++ compiler uses function pointers in vtables. This
  26074. macro allows the target to change to use "function descriptors"
  26075. instead. Function descriptors are found on targets for whom a
  26076. function pointer is actually a small data structure. Normally the
  26077. data structure consists of the actual code address plus a data
  26078. pointer to which the function's data is relative.
  26079. If vtables are used, the value of this macro should be the number
  26080. of words that the function descriptor occupies.
  26081. -- Macro: TARGET_VTABLE_ENTRY_ALIGN
  26082. By default, the vtable entries are void pointers, the so the
  26083. alignment is the same as pointer alignment. The value of this
  26084. macro specifies the alignment of the vtable entry in bits. It
  26085. should be defined only when special alignment is necessary. */
  26086. -- Macro: TARGET_VTABLE_DATA_ENTRY_DISTANCE
  26087. There are a few non-descriptor entries in the vtable at offsets
  26088. below zero. If these entries must be padded (say, to preserve the
  26089. alignment specified by 'TARGET_VTABLE_ENTRY_ALIGN'), set this to
  26090. the number of words in each data entry.
  26091. 
  26092. File: gccint.info, Node: Registers, Next: Register Classes, Prev: Type Layout, Up: Target Macros
  26093. 18.7 Register Usage
  26094. ===================
  26095. This section explains how to describe what registers the target machine
  26096. has, and how (in general) they can be used.
  26097. The description of which registers a specific instruction can use is
  26098. done with register classes; see *note Register Classes::. For
  26099. information on using registers to access a stack frame, see *note Frame
  26100. Registers::. For passing values in registers, see *note Register
  26101. Arguments::. For returning values in registers, see *note Scalar
  26102. Return::.
  26103. * Menu:
  26104. * Register Basics:: Number and kinds of registers.
  26105. * Allocation Order:: Order in which registers are allocated.
  26106. * Values in Registers:: What kinds of values each reg can hold.
  26107. * Leaf Functions:: Renumbering registers for leaf functions.
  26108. * Stack Registers:: Handling a register stack such as 80387.
  26109. 
  26110. File: gccint.info, Node: Register Basics, Next: Allocation Order, Up: Registers
  26111. 18.7.1 Basic Characteristics of Registers
  26112. -----------------------------------------
  26113. Registers have various characteristics.
  26114. -- Macro: FIRST_PSEUDO_REGISTER
  26115. Number of hardware registers known to the compiler. They receive
  26116. numbers 0 through 'FIRST_PSEUDO_REGISTER-1'; thus, the first pseudo
  26117. register's number really is assigned the number
  26118. 'FIRST_PSEUDO_REGISTER'.
  26119. -- Macro: FIXED_REGISTERS
  26120. An initializer that says which registers are used for fixed
  26121. purposes all throughout the compiled code and are therefore not
  26122. available for general allocation. These would include the stack
  26123. pointer, the frame pointer (except on machines where that can be
  26124. used as a general register when no frame pointer is needed), the
  26125. program counter on machines where that is considered one of the
  26126. addressable registers, and any other numbered register with a
  26127. standard use.
  26128. This information is expressed as a sequence of numbers, separated
  26129. by commas and surrounded by braces. The Nth number is 1 if
  26130. register N is fixed, 0 otherwise.
  26131. The table initialized from this macro, and the table initialized by
  26132. the following one, may be overridden at run time either
  26133. automatically, by the actions of the macro
  26134. 'CONDITIONAL_REGISTER_USAGE', or by the user with the command
  26135. options '-ffixed-REG', '-fcall-used-REG' and '-fcall-saved-REG'.
  26136. -- Macro: CALL_USED_REGISTERS
  26137. Like 'FIXED_REGISTERS' but has 1 for each register that is
  26138. clobbered (in general) by function calls as well as for fixed
  26139. registers. This macro therefore identifies the registers that are
  26140. not available for general allocation of values that must live
  26141. across function calls.
  26142. If a register has 0 in 'CALL_USED_REGISTERS', the compiler
  26143. automatically saves it on function entry and restores it on
  26144. function exit, if the register is used within the function.
  26145. Exactly one of 'CALL_USED_REGISTERS' and
  26146. 'CALL_REALLY_USED_REGISTERS' must be defined. Modern ports should
  26147. define 'CALL_REALLY_USED_REGISTERS'.
  26148. -- Macro: CALL_REALLY_USED_REGISTERS
  26149. Like 'CALL_USED_REGISTERS' except this macro doesn't require that
  26150. the entire set of 'FIXED_REGISTERS' be included.
  26151. ('CALL_USED_REGISTERS' must be a superset of 'FIXED_REGISTERS').
  26152. Exactly one of 'CALL_USED_REGISTERS' and
  26153. 'CALL_REALLY_USED_REGISTERS' must be defined. Modern ports should
  26154. define 'CALL_REALLY_USED_REGISTERS'.
  26155. -- Target Hook: const predefined_function_abi & TARGET_FNTYPE_ABI
  26156. (const_tree TYPE)
  26157. Return the ABI used by a function with type TYPE; see the
  26158. definition of 'predefined_function_abi' for details of the ABI
  26159. descriptor. Targets only need to define this hook if they support
  26160. interoperability between several ABIs in the same translation unit.
  26161. -- Target Hook: const predefined_function_abi & TARGET_INSN_CALLEE_ABI
  26162. (const rtx_insn *INSN)
  26163. This hook returns a description of the ABI used by the target of
  26164. call instruction INSN; see the definition of
  26165. 'predefined_function_abi' for details of the ABI descriptor. Only
  26166. the global function 'insn_callee_abi' should call this hook
  26167. directly.
  26168. Targets only need to define this hook if they support
  26169. interoperability between several ABIs in the same translation unit.
  26170. -- Target Hook: bool TARGET_HARD_REGNO_CALL_PART_CLOBBERED (unsigned
  26171. int ABI_ID, unsigned int REGNO, machine_mode MODE)
  26172. ABIs usually specify that calls must preserve the full contents of
  26173. a particular register, or that calls can alter any part of a
  26174. particular register. This information is captured by the target
  26175. macro 'CALL_REALLY_USED_REGISTERS'. However, some ABIs specify
  26176. that calls must preserve certain bits of a particular register but
  26177. can alter others. This hook should return true if this applies to
  26178. at least one of the registers in '(reg:MODE REGNO)', and if as a
  26179. result the call would alter part of the MODE value. For example,
  26180. if a call preserves the low 32 bits of a 64-bit hard register REGNO
  26181. but can clobber the upper 32 bits, this hook should return true for
  26182. a 64-bit mode but false for a 32-bit mode.
  26183. The value of ABI_ID comes from the 'predefined_function_abi'
  26184. structure that describes the ABI of the call; see the definition of
  26185. the structure for more details. If (as is usual) the target uses
  26186. the same ABI for all functions in a translation unit, ABI_ID is
  26187. always 0.
  26188. The default implementation returns false, which is correct for
  26189. targets that don't have partly call-clobbered registers.
  26190. -- Target Hook: const char * TARGET_GET_MULTILIB_ABI_NAME (void)
  26191. This hook returns name of multilib ABI name.
  26192. -- Target Hook: void TARGET_CONDITIONAL_REGISTER_USAGE (void)
  26193. This hook may conditionally modify five variables 'fixed_regs',
  26194. 'call_used_regs', 'global_regs', 'reg_names', and
  26195. 'reg_class_contents', to take into account any dependence of these
  26196. register sets on target flags. The first three of these are of
  26197. type 'char []' (interpreted as boolean vectors). 'global_regs' is
  26198. a 'const char *[]', and 'reg_class_contents' is a 'HARD_REG_SET'.
  26199. Before the macro is called, 'fixed_regs', 'call_used_regs',
  26200. 'reg_class_contents', and 'reg_names' have been initialized from
  26201. 'FIXED_REGISTERS', 'CALL_USED_REGISTERS', 'REG_CLASS_CONTENTS', and
  26202. 'REGISTER_NAMES', respectively. 'global_regs' has been cleared,
  26203. and any '-ffixed-REG', '-fcall-used-REG' and '-fcall-saved-REG'
  26204. command options have been applied.
  26205. If the usage of an entire class of registers depends on the target
  26206. flags, you may indicate this to GCC by using this macro to modify
  26207. 'fixed_regs' and 'call_used_regs' to 1 for each of the registers in
  26208. the classes which should not be used by GCC. Also make
  26209. 'define_register_constraint's return 'NO_REGS' for constraints that
  26210. shouldn't be used.
  26211. (However, if this class is not included in 'GENERAL_REGS' and all
  26212. of the insn patterns whose constraints permit this class are
  26213. controlled by target switches, then GCC will automatically avoid
  26214. using these registers when the target switches are opposed to
  26215. them.)
  26216. -- Macro: INCOMING_REGNO (OUT)
  26217. Define this macro if the target machine has register windows. This
  26218. C expression returns the register number as seen by the called
  26219. function corresponding to the register number OUT as seen by the
  26220. calling function. Return OUT if register number OUT is not an
  26221. outbound register.
  26222. -- Macro: OUTGOING_REGNO (IN)
  26223. Define this macro if the target machine has register windows. This
  26224. C expression returns the register number as seen by the calling
  26225. function corresponding to the register number IN as seen by the
  26226. called function. Return IN if register number IN is not an inbound
  26227. register.
  26228. -- Macro: LOCAL_REGNO (REGNO)
  26229. Define this macro if the target machine has register windows. This
  26230. C expression returns true if the register is call-saved but is in
  26231. the register window. Unlike most call-saved registers, such
  26232. registers need not be explicitly restored on function exit or
  26233. during non-local gotos.
  26234. -- Macro: PC_REGNUM
  26235. If the program counter has a register number, define this as that
  26236. register number. Otherwise, do not define it.
  26237. 
  26238. File: gccint.info, Node: Allocation Order, Next: Values in Registers, Prev: Register Basics, Up: Registers
  26239. 18.7.2 Order of Allocation of Registers
  26240. ---------------------------------------
  26241. Registers are allocated in order.
  26242. -- Macro: REG_ALLOC_ORDER
  26243. If defined, an initializer for a vector of integers, containing the
  26244. numbers of hard registers in the order in which GCC should prefer
  26245. to use them (from most preferred to least).
  26246. If this macro is not defined, registers are used lowest numbered
  26247. first (all else being equal).
  26248. One use of this macro is on machines where the highest numbered
  26249. registers must always be saved and the save-multiple-registers
  26250. instruction supports only sequences of consecutive registers. On
  26251. such machines, define 'REG_ALLOC_ORDER' to be an initializer that
  26252. lists the highest numbered allocable register first.
  26253. -- Macro: ADJUST_REG_ALLOC_ORDER
  26254. A C statement (sans semicolon) to choose the order in which to
  26255. allocate hard registers for pseudo-registers local to a basic
  26256. block.
  26257. Store the desired register order in the array 'reg_alloc_order'.
  26258. Element 0 should be the register to allocate first; element 1, the
  26259. next register; and so on.
  26260. The macro body should not assume anything about the contents of
  26261. 'reg_alloc_order' before execution of the macro.
  26262. On most machines, it is not necessary to define this macro.
  26263. -- Macro: HONOR_REG_ALLOC_ORDER
  26264. Normally, IRA tries to estimate the costs for saving a register in
  26265. the prologue and restoring it in the epilogue. This discourages it
  26266. from using call-saved registers. If a machine wants to ensure that
  26267. IRA allocates registers in the order given by REG_ALLOC_ORDER even
  26268. if some call-saved registers appear earlier than call-used ones,
  26269. then define this macro as a C expression to nonzero. Default is 0.
  26270. -- Macro: IRA_HARD_REGNO_ADD_COST_MULTIPLIER (REGNO)
  26271. In some case register allocation order is not enough for the
  26272. Integrated Register Allocator (IRA) to generate a good code. If
  26273. this macro is defined, it should return a floating point value
  26274. based on REGNO. The cost of using REGNO for a pseudo will be
  26275. increased by approximately the pseudo's usage frequency times the
  26276. value returned by this macro. Not defining this macro is
  26277. equivalent to having it always return '0.0'.
  26278. On most machines, it is not necessary to define this macro.
  26279. 
  26280. File: gccint.info, Node: Values in Registers, Next: Leaf Functions, Prev: Allocation Order, Up: Registers
  26281. 18.7.3 How Values Fit in Registers
  26282. ----------------------------------
  26283. This section discusses the macros that describe which kinds of values
  26284. (specifically, which machine modes) each register can hold, and how many
  26285. consecutive registers are needed for a given mode.
  26286. -- Target Hook: unsigned int TARGET_HARD_REGNO_NREGS (unsigned int
  26287. REGNO, machine_mode MODE)
  26288. This hook returns the number of consecutive hard registers,
  26289. starting at register number REGNO, required to hold a value of mode
  26290. MODE. This hook must never return zero, even if a register cannot
  26291. hold the requested mode - indicate that with
  26292. 'TARGET_HARD_REGNO_MODE_OK' and/or 'TARGET_CAN_CHANGE_MODE_CLASS'
  26293. instead.
  26294. The default definition returns the number of words in MODE.
  26295. -- Macro: HARD_REGNO_NREGS_HAS_PADDING (REGNO, MODE)
  26296. A C expression that is nonzero if a value of mode MODE, stored in
  26297. memory, ends with padding that causes it to take up more space than
  26298. in registers starting at register number REGNO (as determined by
  26299. multiplying GCC's notion of the size of the register when
  26300. containing this mode by the number of registers returned by
  26301. 'TARGET_HARD_REGNO_NREGS'). By default this is zero.
  26302. For example, if a floating-point value is stored in three 32-bit
  26303. registers but takes up 128 bits in memory, then this would be
  26304. nonzero.
  26305. This macros only needs to be defined if there are cases where
  26306. 'subreg_get_info' would otherwise wrongly determine that a 'subreg'
  26307. can be represented by an offset to the register number, when in
  26308. fact such a 'subreg' would contain some of the padding not stored
  26309. in registers and so not be representable.
  26310. -- Macro: HARD_REGNO_NREGS_WITH_PADDING (REGNO, MODE)
  26311. For values of REGNO and MODE for which
  26312. 'HARD_REGNO_NREGS_HAS_PADDING' returns nonzero, a C expression
  26313. returning the greater number of registers required to hold the
  26314. value including any padding. In the example above, the value would
  26315. be four.
  26316. -- Macro: REGMODE_NATURAL_SIZE (MODE)
  26317. Define this macro if the natural size of registers that hold values
  26318. of mode MODE is not the word size. It is a C expression that
  26319. should give the natural size in bytes for the specified mode. It
  26320. is used by the register allocator to try to optimize its results.
  26321. This happens for example on SPARC 64-bit where the natural size of
  26322. floating-point registers is still 32-bit.
  26323. -- Target Hook: bool TARGET_HARD_REGNO_MODE_OK (unsigned int REGNO,
  26324. machine_mode MODE)
  26325. This hook returns true if it is permissible to store a value of
  26326. mode MODE in hard register number REGNO (or in several registers
  26327. starting with that one). The default definition returns true
  26328. unconditionally.
  26329. You need not include code to check for the numbers of fixed
  26330. registers, because the allocation mechanism considers them to be
  26331. always occupied.
  26332. On some machines, double-precision values must be kept in even/odd
  26333. register pairs. You can implement that by defining this hook to
  26334. reject odd register numbers for such modes.
  26335. The minimum requirement for a mode to be OK in a register is that
  26336. the 'movMODE' instruction pattern support moves between the
  26337. register and other hard register in the same class and that moving
  26338. a value into the register and back out not alter it.
  26339. Since the same instruction used to move 'word_mode' will work for
  26340. all narrower integer modes, it is not necessary on any machine for
  26341. this hook to distinguish between these modes, provided you define
  26342. patterns 'movhi', etc., to take advantage of this. This is useful
  26343. because of the interaction between 'TARGET_HARD_REGNO_MODE_OK' and
  26344. 'TARGET_MODES_TIEABLE_P'; it is very desirable for all integer
  26345. modes to be tieable.
  26346. Many machines have special registers for floating point arithmetic.
  26347. Often people assume that floating point machine modes are allowed
  26348. only in floating point registers. This is not true. Any registers
  26349. that can hold integers can safely _hold_ a floating point machine
  26350. mode, whether or not floating arithmetic can be done on it in those
  26351. registers. Integer move instructions can be used to move the
  26352. values.
  26353. On some machines, though, the converse is true: fixed-point machine
  26354. modes may not go in floating registers. This is true if the
  26355. floating registers normalize any value stored in them, because
  26356. storing a non-floating value there would garble it. In this case,
  26357. 'TARGET_HARD_REGNO_MODE_OK' should reject fixed-point machine modes
  26358. in floating registers. But if the floating registers do not
  26359. automatically normalize, if you can store any bit pattern in one
  26360. and retrieve it unchanged without a trap, then any machine mode may
  26361. go in a floating register, so you can define this hook to say so.
  26362. The primary significance of special floating registers is rather
  26363. that they are the registers acceptable in floating point arithmetic
  26364. instructions. However, this is of no concern to
  26365. 'TARGET_HARD_REGNO_MODE_OK'. You handle it by writing the proper
  26366. constraints for those instructions.
  26367. On some machines, the floating registers are especially slow to
  26368. access, so that it is better to store a value in a stack frame than
  26369. in such a register if floating point arithmetic is not being done.
  26370. As long as the floating registers are not in class 'GENERAL_REGS',
  26371. they will not be used unless some pattern's constraint asks for
  26372. one.
  26373. -- Macro: HARD_REGNO_RENAME_OK (FROM, TO)
  26374. A C expression that is nonzero if it is OK to rename a hard
  26375. register FROM to another hard register TO.
  26376. One common use of this macro is to prevent renaming of a register
  26377. to another register that is not saved by a prologue in an interrupt
  26378. handler.
  26379. The default is always nonzero.
  26380. -- Target Hook: bool TARGET_MODES_TIEABLE_P (machine_mode MODE1,
  26381. machine_mode MODE2)
  26382. This hook returns true if a value of mode MODE1 is accessible in
  26383. mode MODE2 without copying.
  26384. If 'TARGET_HARD_REGNO_MODE_OK (R, MODE1)' and
  26385. 'TARGET_HARD_REGNO_MODE_OK (R, MODE2)' are always the same for any
  26386. R, then 'TARGET_MODES_TIEABLE_P (MODE1, MODE2)' should be true. If
  26387. they differ for any R, you should define this hook to return false
  26388. unless some other mechanism ensures the accessibility of the value
  26389. in a narrower mode.
  26390. You should define this hook to return true in as many cases as
  26391. possible since doing so will allow GCC to perform better register
  26392. allocation. The default definition returns true unconditionally.
  26393. -- Target Hook: bool TARGET_HARD_REGNO_SCRATCH_OK (unsigned int REGNO)
  26394. This target hook should return 'true' if it is OK to use a hard
  26395. register REGNO as scratch reg in peephole2.
  26396. One common use of this macro is to prevent using of a register that
  26397. is not saved by a prologue in an interrupt handler.
  26398. The default version of this hook always returns 'true'.
  26399. -- Macro: AVOID_CCMODE_COPIES
  26400. Define this macro if the compiler should avoid copies to/from
  26401. 'CCmode' registers. You should only define this macro if support
  26402. for copying to/from 'CCmode' is incomplete.
  26403. 
  26404. File: gccint.info, Node: Leaf Functions, Next: Stack Registers, Prev: Values in Registers, Up: Registers
  26405. 18.7.4 Handling Leaf Functions
  26406. ------------------------------
  26407. On some machines, a leaf function (i.e., one which makes no calls) can
  26408. run more efficiently if it does not make its own register window. Often
  26409. this means it is required to receive its arguments in the registers
  26410. where they are passed by the caller, instead of the registers where they
  26411. would normally arrive.
  26412. The special treatment for leaf functions generally applies only when
  26413. other conditions are met; for example, often they may use only those
  26414. registers for its own variables and temporaries. We use the term "leaf
  26415. function" to mean a function that is suitable for this special handling,
  26416. so that functions with no calls are not necessarily "leaf functions".
  26417. GCC assigns register numbers before it knows whether the function is
  26418. suitable for leaf function treatment. So it needs to renumber the
  26419. registers in order to output a leaf function. The following macros
  26420. accomplish this.
  26421. -- Macro: LEAF_REGISTERS
  26422. Name of a char vector, indexed by hard register number, which
  26423. contains 1 for a register that is allowable in a candidate for leaf
  26424. function treatment.
  26425. If leaf function treatment involves renumbering the registers, then
  26426. the registers marked here should be the ones before
  26427. renumbering--those that GCC would ordinarily allocate. The
  26428. registers which will actually be used in the assembler code, after
  26429. renumbering, should not be marked with 1 in this vector.
  26430. Define this macro only if the target machine offers a way to
  26431. optimize the treatment of leaf functions.
  26432. -- Macro: LEAF_REG_REMAP (REGNO)
  26433. A C expression whose value is the register number to which REGNO
  26434. should be renumbered, when a function is treated as a leaf
  26435. function.
  26436. If REGNO is a register number which should not appear in a leaf
  26437. function before renumbering, then the expression should yield -1,
  26438. which will cause the compiler to abort.
  26439. Define this macro only if the target machine offers a way to
  26440. optimize the treatment of leaf functions, and registers need to be
  26441. renumbered to do this.
  26442. 'TARGET_ASM_FUNCTION_PROLOGUE' and 'TARGET_ASM_FUNCTION_EPILOGUE' must
  26443. usually treat leaf functions specially. They can test the C variable
  26444. 'current_function_is_leaf' which is nonzero for leaf functions.
  26445. 'current_function_is_leaf' is set prior to local register allocation and
  26446. is valid for the remaining compiler passes. They can also test the C
  26447. variable 'current_function_uses_only_leaf_regs' which is nonzero for
  26448. leaf functions which only use leaf registers.
  26449. 'current_function_uses_only_leaf_regs' is valid after all passes that
  26450. modify the instructions have been run and is only useful if
  26451. 'LEAF_REGISTERS' is defined.
  26452. 
  26453. File: gccint.info, Node: Stack Registers, Prev: Leaf Functions, Up: Registers
  26454. 18.7.5 Registers That Form a Stack
  26455. ----------------------------------
  26456. There are special features to handle computers where some of the
  26457. "registers" form a stack. Stack registers are normally written by
  26458. pushing onto the stack, and are numbered relative to the top of the
  26459. stack.
  26460. Currently, GCC can only handle one group of stack-like registers, and
  26461. they must be consecutively numbered. Furthermore, the existing support
  26462. for stack-like registers is specific to the 80387 floating point
  26463. coprocessor. If you have a new architecture that uses stack-like
  26464. registers, you will need to do substantial work on 'reg-stack.c' and
  26465. write your machine description to cooperate with it, as well as defining
  26466. these macros.
  26467. -- Macro: STACK_REGS
  26468. Define this if the machine has any stack-like registers.
  26469. -- Macro: STACK_REG_COVER_CLASS
  26470. This is a cover class containing the stack registers. Define this
  26471. if the machine has any stack-like registers.
  26472. -- Macro: FIRST_STACK_REG
  26473. The number of the first stack-like register. This one is the top
  26474. of the stack.
  26475. -- Macro: LAST_STACK_REG
  26476. The number of the last stack-like register. This one is the bottom
  26477. of the stack.
  26478. 
  26479. File: gccint.info, Node: Register Classes, Next: Stack and Calling, Prev: Registers, Up: Target Macros
  26480. 18.8 Register Classes
  26481. =====================
  26482. On many machines, the numbered registers are not all equivalent. For
  26483. example, certain registers may not be allowed for indexed addressing;
  26484. certain registers may not be allowed in some instructions. These
  26485. machine restrictions are described to the compiler using "register
  26486. classes".
  26487. You define a number of register classes, giving each one a name and
  26488. saying which of the registers belong to it. Then you can specify
  26489. register classes that are allowed as operands to particular instruction
  26490. patterns.
  26491. In general, each register will belong to several classes. In fact, one
  26492. class must be named 'ALL_REGS' and contain all the registers. Another
  26493. class must be named 'NO_REGS' and contain no registers. Often the union
  26494. of two classes will be another class; however, this is not required.
  26495. One of the classes must be named 'GENERAL_REGS'. There is nothing
  26496. terribly special about the name, but the operand constraint letters 'r'
  26497. and 'g' specify this class. If 'GENERAL_REGS' is the same as
  26498. 'ALL_REGS', just define it as a macro which expands to 'ALL_REGS'.
  26499. Order the classes so that if class X is contained in class Y then X has
  26500. a lower class number than Y.
  26501. The way classes other than 'GENERAL_REGS' are specified in operand
  26502. constraints is through machine-dependent operand constraint letters.
  26503. You can define such letters to correspond to various classes, then use
  26504. them in operand constraints.
  26505. You must define the narrowest register classes for allocatable
  26506. registers, so that each class either has no subclasses, or that for some
  26507. mode, the move cost between registers within the class is cheaper than
  26508. moving a register in the class to or from memory (*note Costs::).
  26509. You should define a class for the union of two classes whenever some
  26510. instruction allows both classes. For example, if an instruction allows
  26511. either a floating point (coprocessor) register or a general register for
  26512. a certain operand, you should define a class 'FLOAT_OR_GENERAL_REGS'
  26513. which includes both of them. Otherwise you will get suboptimal code, or
  26514. even internal compiler errors when reload cannot find a register in the
  26515. class computed via 'reg_class_subunion'.
  26516. You must also specify certain redundant information about the register
  26517. classes: for each class, which classes contain it and which ones are
  26518. contained in it; for each pair of classes, the largest class contained
  26519. in their union.
  26520. When a value occupying several consecutive registers is expected in a
  26521. certain class, all the registers used must belong to that class.
  26522. Therefore, register classes cannot be used to enforce a requirement for
  26523. a register pair to start with an even-numbered register. The way to
  26524. specify this requirement is with 'TARGET_HARD_REGNO_MODE_OK'.
  26525. Register classes used for input-operands of bitwise-and or shift
  26526. instructions have a special requirement: each such class must have, for
  26527. each fixed-point machine mode, a subclass whose registers can transfer
  26528. that mode to or from memory. For example, on some machines, the
  26529. operations for single-byte values ('QImode') are limited to certain
  26530. registers. When this is so, each register class that is used in a
  26531. bitwise-and or shift instruction must have a subclass consisting of
  26532. registers from which single-byte values can be loaded or stored. This
  26533. is so that 'PREFERRED_RELOAD_CLASS' can always have a possible value to
  26534. return.
  26535. -- Data type: enum reg_class
  26536. An enumerated type that must be defined with all the register class
  26537. names as enumerated values. 'NO_REGS' must be first. 'ALL_REGS'
  26538. must be the last register class, followed by one more enumerated
  26539. value, 'LIM_REG_CLASSES', which is not a register class but rather
  26540. tells how many classes there are.
  26541. Each register class has a number, which is the value of casting the
  26542. class name to type 'int'. The number serves as an index in many of
  26543. the tables described below.
  26544. -- Macro: N_REG_CLASSES
  26545. The number of distinct register classes, defined as follows:
  26546. #define N_REG_CLASSES (int) LIM_REG_CLASSES
  26547. -- Macro: REG_CLASS_NAMES
  26548. An initializer containing the names of the register classes as C
  26549. string constants. These names are used in writing some of the
  26550. debugging dumps.
  26551. -- Macro: REG_CLASS_CONTENTS
  26552. An initializer containing the contents of the register classes, as
  26553. integers which are bit masks. The Nth integer specifies the
  26554. contents of class N. The way the integer MASK is interpreted is
  26555. that register R is in the class if 'MASK & (1 << R)' is 1.
  26556. When the machine has more than 32 registers, an integer does not
  26557. suffice. Then the integers are replaced by sub-initializers,
  26558. braced groupings containing several integers. Each sub-initializer
  26559. must be suitable as an initializer for the type 'HARD_REG_SET'
  26560. which is defined in 'hard-reg-set.h'. In this situation, the first
  26561. integer in each sub-initializer corresponds to registers 0 through
  26562. 31, the second integer to registers 32 through 63, and so on.
  26563. -- Macro: REGNO_REG_CLASS (REGNO)
  26564. A C expression whose value is a register class containing hard
  26565. register REGNO. In general there is more than one such class;
  26566. choose a class which is "minimal", meaning that no smaller class
  26567. also contains the register.
  26568. -- Macro: BASE_REG_CLASS
  26569. A macro whose definition is the name of the class to which a valid
  26570. base register must belong. A base register is one used in an
  26571. address which is the register value plus a displacement.
  26572. -- Macro: MODE_BASE_REG_CLASS (MODE)
  26573. This is a variation of the 'BASE_REG_CLASS' macro which allows the
  26574. selection of a base register in a mode dependent manner. If MODE
  26575. is VOIDmode then it should return the same value as
  26576. 'BASE_REG_CLASS'.
  26577. -- Macro: MODE_BASE_REG_REG_CLASS (MODE)
  26578. A C expression whose value is the register class to which a valid
  26579. base register must belong in order to be used in a base plus index
  26580. register address. You should define this macro if base plus index
  26581. addresses have different requirements than other base register
  26582. uses.
  26583. -- Macro: MODE_CODE_BASE_REG_CLASS (MODE, ADDRESS_SPACE, OUTER_CODE,
  26584. INDEX_CODE)
  26585. A C expression whose value is the register class to which a valid
  26586. base register for a memory reference in mode MODE to address space
  26587. ADDRESS_SPACE must belong. OUTER_CODE and INDEX_CODE define the
  26588. context in which the base register occurs. OUTER_CODE is the code
  26589. of the immediately enclosing expression ('MEM' for the top level of
  26590. an address, 'ADDRESS' for something that occurs in an
  26591. 'address_operand'). INDEX_CODE is the code of the corresponding
  26592. index expression if OUTER_CODE is 'PLUS'; 'SCRATCH' otherwise.
  26593. -- Macro: INDEX_REG_CLASS
  26594. A macro whose definition is the name of the class to which a valid
  26595. index register must belong. An index register is one used in an
  26596. address where its value is either multiplied by a scale factor or
  26597. added to another register (as well as added to a displacement).
  26598. -- Macro: REGNO_OK_FOR_BASE_P (NUM)
  26599. A C expression which is nonzero if register number NUM is suitable
  26600. for use as a base register in operand addresses.
  26601. -- Macro: REGNO_MODE_OK_FOR_BASE_P (NUM, MODE)
  26602. A C expression that is just like 'REGNO_OK_FOR_BASE_P', except that
  26603. that expression may examine the mode of the memory reference in
  26604. MODE. You should define this macro if the mode of the memory
  26605. reference affects whether a register may be used as a base
  26606. register. If you define this macro, the compiler will use it
  26607. instead of 'REGNO_OK_FOR_BASE_P'. The mode may be 'VOIDmode' for
  26608. addresses that appear outside a 'MEM', i.e., as an
  26609. 'address_operand'.
  26610. -- Macro: REGNO_MODE_OK_FOR_REG_BASE_P (NUM, MODE)
  26611. A C expression which is nonzero if register number NUM is suitable
  26612. for use as a base register in base plus index operand addresses,
  26613. accessing memory in mode MODE. It may be either a suitable hard
  26614. register or a pseudo register that has been allocated such a hard
  26615. register. You should define this macro if base plus index
  26616. addresses have different requirements than other base register
  26617. uses.
  26618. Use of this macro is deprecated; please use the more general
  26619. 'REGNO_MODE_CODE_OK_FOR_BASE_P'.
  26620. -- Macro: REGNO_MODE_CODE_OK_FOR_BASE_P (NUM, MODE, ADDRESS_SPACE,
  26621. OUTER_CODE, INDEX_CODE)
  26622. A C expression which is nonzero if register number NUM is suitable
  26623. for use as a base register in operand addresses, accessing memory
  26624. in mode MODE in address space ADDRESS_SPACE. This is similar to
  26625. 'REGNO_MODE_OK_FOR_BASE_P', except that that expression may examine
  26626. the context in which the register appears in the memory reference.
  26627. OUTER_CODE is the code of the immediately enclosing expression
  26628. ('MEM' if at the top level of the address, 'ADDRESS' for something
  26629. that occurs in an 'address_operand'). INDEX_CODE is the code of
  26630. the corresponding index expression if OUTER_CODE is 'PLUS';
  26631. 'SCRATCH' otherwise. The mode may be 'VOIDmode' for addresses that
  26632. appear outside a 'MEM', i.e., as an 'address_operand'.
  26633. -- Macro: REGNO_OK_FOR_INDEX_P (NUM)
  26634. A C expression which is nonzero if register number NUM is suitable
  26635. for use as an index register in operand addresses. It may be
  26636. either a suitable hard register or a pseudo register that has been
  26637. allocated such a hard register.
  26638. The difference between an index register and a base register is
  26639. that the index register may be scaled. If an address involves the
  26640. sum of two registers, neither one of them scaled, then either one
  26641. may be labeled the "base" and the other the "index"; but whichever
  26642. labeling is used must fit the machine's constraints of which
  26643. registers may serve in each capacity. The compiler will try both
  26644. labelings, looking for one that is valid, and will reload one or
  26645. both registers only if neither labeling works.
  26646. -- Target Hook: reg_class_t TARGET_PREFERRED_RENAME_CLASS (reg_class_t
  26647. RCLASS)
  26648. A target hook that places additional preference on the register
  26649. class to use when it is necessary to rename a register in class
  26650. RCLASS to another class, or perhaps NO_REGS, if no preferred
  26651. register class is found or hook 'preferred_rename_class' is not
  26652. implemented. Sometimes returning a more restrictive class makes
  26653. better code. For example, on ARM, thumb-2 instructions using
  26654. 'LO_REGS' may be smaller than instructions using 'GENERIC_REGS'.
  26655. By returning 'LO_REGS' from 'preferred_rename_class', code size can
  26656. be reduced.
  26657. -- Target Hook: reg_class_t TARGET_PREFERRED_RELOAD_CLASS (rtx X,
  26658. reg_class_t RCLASS)
  26659. A target hook that places additional restrictions on the register
  26660. class to use when it is necessary to copy value X into a register
  26661. in class RCLASS. The value is a register class; perhaps RCLASS, or
  26662. perhaps another, smaller class.
  26663. The default version of this hook always returns value of 'rclass'
  26664. argument.
  26665. Sometimes returning a more restrictive class makes better code.
  26666. For example, on the 68000, when X is an integer constant that is in
  26667. range for a 'moveq' instruction, the value of this macro is always
  26668. 'DATA_REGS' as long as RCLASS includes the data registers.
  26669. Requiring a data register guarantees that a 'moveq' will be used.
  26670. One case where 'TARGET_PREFERRED_RELOAD_CLASS' must not return
  26671. RCLASS is if X is a legitimate constant which cannot be loaded into
  26672. some register class. By returning 'NO_REGS' you can force X into a
  26673. memory location. For example, rs6000 can load immediate values
  26674. into general-purpose registers, but does not have an instruction
  26675. for loading an immediate value into a floating-point register, so
  26676. 'TARGET_PREFERRED_RELOAD_CLASS' returns 'NO_REGS' when X is a
  26677. floating-point constant. If the constant can't be loaded into any
  26678. kind of register, code generation will be better if
  26679. 'TARGET_LEGITIMATE_CONSTANT_P' makes the constant illegitimate
  26680. instead of using 'TARGET_PREFERRED_RELOAD_CLASS'.
  26681. If an insn has pseudos in it after register allocation, reload will
  26682. go through the alternatives and call repeatedly
  26683. 'TARGET_PREFERRED_RELOAD_CLASS' to find the best one. Returning
  26684. 'NO_REGS', in this case, makes reload add a '!' in front of the
  26685. constraint: the x86 back-end uses this feature to discourage usage
  26686. of 387 registers when math is done in the SSE registers (and vice
  26687. versa).
  26688. -- Macro: PREFERRED_RELOAD_CLASS (X, CLASS)
  26689. A C expression that places additional restrictions on the register
  26690. class to use when it is necessary to copy value X into a register
  26691. in class CLASS. The value is a register class; perhaps CLASS, or
  26692. perhaps another, smaller class. On many machines, the following
  26693. definition is safe:
  26694. #define PREFERRED_RELOAD_CLASS(X,CLASS) CLASS
  26695. Sometimes returning a more restrictive class makes better code.
  26696. For example, on the 68000, when X is an integer constant that is in
  26697. range for a 'moveq' instruction, the value of this macro is always
  26698. 'DATA_REGS' as long as CLASS includes the data registers.
  26699. Requiring a data register guarantees that a 'moveq' will be used.
  26700. One case where 'PREFERRED_RELOAD_CLASS' must not return CLASS is if
  26701. X is a legitimate constant which cannot be loaded into some
  26702. register class. By returning 'NO_REGS' you can force X into a
  26703. memory location. For example, rs6000 can load immediate values
  26704. into general-purpose registers, but does not have an instruction
  26705. for loading an immediate value into a floating-point register, so
  26706. 'PREFERRED_RELOAD_CLASS' returns 'NO_REGS' when X is a
  26707. floating-point constant. If the constant cannot be loaded into any
  26708. kind of register, code generation will be better if
  26709. 'TARGET_LEGITIMATE_CONSTANT_P' makes the constant illegitimate
  26710. instead of using 'TARGET_PREFERRED_RELOAD_CLASS'.
  26711. If an insn has pseudos in it after register allocation, reload will
  26712. go through the alternatives and call repeatedly
  26713. 'PREFERRED_RELOAD_CLASS' to find the best one. Returning
  26714. 'NO_REGS', in this case, makes reload add a '!' in front of the
  26715. constraint: the x86 back-end uses this feature to discourage usage
  26716. of 387 registers when math is done in the SSE registers (and vice
  26717. versa).
  26718. -- Target Hook: reg_class_t TARGET_PREFERRED_OUTPUT_RELOAD_CLASS (rtx
  26719. X, reg_class_t RCLASS)
  26720. Like 'TARGET_PREFERRED_RELOAD_CLASS', but for output reloads
  26721. instead of input reloads.
  26722. The default version of this hook always returns value of 'rclass'
  26723. argument.
  26724. You can also use 'TARGET_PREFERRED_OUTPUT_RELOAD_CLASS' to
  26725. discourage reload from using some alternatives, like
  26726. 'TARGET_PREFERRED_RELOAD_CLASS'.
  26727. -- Macro: LIMIT_RELOAD_CLASS (MODE, CLASS)
  26728. A C expression that places additional restrictions on the register
  26729. class to use when it is necessary to be able to hold a value of
  26730. mode MODE in a reload register for which class CLASS would
  26731. ordinarily be used.
  26732. Unlike 'PREFERRED_RELOAD_CLASS', this macro should be used when
  26733. there are certain modes that simply cannot go in certain reload
  26734. classes.
  26735. The value is a register class; perhaps CLASS, or perhaps another,
  26736. smaller class.
  26737. Don't define this macro unless the target machine has limitations
  26738. which require the macro to do something nontrivial.
  26739. -- Target Hook: reg_class_t TARGET_SECONDARY_RELOAD (bool IN_P, rtx X,
  26740. reg_class_t RELOAD_CLASS, machine_mode RELOAD_MODE,
  26741. secondary_reload_info *SRI)
  26742. Many machines have some registers that cannot be copied directly to
  26743. or from memory or even from other types of registers. An example
  26744. is the 'MQ' register, which on most machines, can only be copied to
  26745. or from general registers, but not memory. Below, we shall be
  26746. using the term 'intermediate register' when a move operation cannot
  26747. be performed directly, but has to be done by copying the source
  26748. into the intermediate register first, and then copying the
  26749. intermediate register to the destination. An intermediate register
  26750. always has the same mode as source and destination. Since it holds
  26751. the actual value being copied, reload might apply optimizations to
  26752. re-use an intermediate register and eliding the copy from the
  26753. source when it can determine that the intermediate register still
  26754. holds the required value.
  26755. Another kind of secondary reload is required on some machines which
  26756. allow copying all registers to and from memory, but require a
  26757. scratch register for stores to some memory locations (e.g., those
  26758. with symbolic address on the RT, and those with certain symbolic
  26759. address on the SPARC when compiling PIC). Scratch registers need
  26760. not have the same mode as the value being copied, and usually hold
  26761. a different value than that being copied. Special patterns in the
  26762. md file are needed to describe how the copy is performed with the
  26763. help of the scratch register; these patterns also describe the
  26764. number, register class(es) and mode(s) of the scratch register(s).
  26765. In some cases, both an intermediate and a scratch register are
  26766. required.
  26767. For input reloads, this target hook is called with nonzero IN_P,
  26768. and X is an rtx that needs to be copied to a register of class
  26769. RELOAD_CLASS in RELOAD_MODE. For output reloads, this target hook
  26770. is called with zero IN_P, and a register of class RELOAD_CLASS
  26771. needs to be copied to rtx X in RELOAD_MODE.
  26772. If copying a register of RELOAD_CLASS from/to X requires an
  26773. intermediate register, the hook 'secondary_reload' should return
  26774. the register class required for this intermediate register. If no
  26775. intermediate register is required, it should return NO_REGS. If
  26776. more than one intermediate register is required, describe the one
  26777. that is closest in the copy chain to the reload register.
  26778. If scratch registers are needed, you also have to describe how to
  26779. perform the copy from/to the reload register to/from this closest
  26780. intermediate register. Or if no intermediate register is required,
  26781. but still a scratch register is needed, describe the copy from/to
  26782. the reload register to/from the reload operand X.
  26783. You do this by setting 'sri->icode' to the instruction code of a
  26784. pattern in the md file which performs the move. Operands 0 and 1
  26785. are the output and input of this copy, respectively. Operands from
  26786. operand 2 onward are for scratch operands. These scratch operands
  26787. must have a mode, and a single-register-class output constraint.
  26788. When an intermediate register is used, the 'secondary_reload' hook
  26789. will be called again to determine how to copy the intermediate
  26790. register to/from the reload operand X, so your hook must also have
  26791. code to handle the register class of the intermediate operand.
  26792. X might be a pseudo-register or a 'subreg' of a pseudo-register,
  26793. which could either be in a hard register or in memory. Use
  26794. 'true_regnum' to find out; it will return -1 if the pseudo is in
  26795. memory and the hard register number if it is in a register.
  26796. Scratch operands in memory (constraint '"=m"' / '"=&m"') are
  26797. currently not supported. For the time being, you will have to
  26798. continue to use 'TARGET_SECONDARY_MEMORY_NEEDED' for that purpose.
  26799. 'copy_cost' also uses this target hook to find out how values are
  26800. copied. If you want it to include some extra cost for the need to
  26801. allocate (a) scratch register(s), set 'sri->extra_cost' to the
  26802. additional cost. Or if two dependent moves are supposed to have a
  26803. lower cost than the sum of the individual moves due to expected
  26804. fortuitous scheduling and/or special forwarding logic, you can set
  26805. 'sri->extra_cost' to a negative amount.
  26806. -- Macro: SECONDARY_RELOAD_CLASS (CLASS, MODE, X)
  26807. -- Macro: SECONDARY_INPUT_RELOAD_CLASS (CLASS, MODE, X)
  26808. -- Macro: SECONDARY_OUTPUT_RELOAD_CLASS (CLASS, MODE, X)
  26809. These macros are obsolete, new ports should use the target hook
  26810. 'TARGET_SECONDARY_RELOAD' instead.
  26811. These are obsolete macros, replaced by the
  26812. 'TARGET_SECONDARY_RELOAD' target hook. Older ports still define
  26813. these macros to indicate to the reload phase that it may need to
  26814. allocate at least one register for a reload in addition to the
  26815. register to contain the data. Specifically, if copying X to a
  26816. register CLASS in MODE requires an intermediate register, you were
  26817. supposed to define 'SECONDARY_INPUT_RELOAD_CLASS' to return the
  26818. largest register class all of whose registers can be used as
  26819. intermediate registers or scratch registers.
  26820. If copying a register CLASS in MODE to X requires an intermediate
  26821. or scratch register, 'SECONDARY_OUTPUT_RELOAD_CLASS' was supposed
  26822. to be defined be defined to return the largest register class
  26823. required. If the requirements for input and output reloads were
  26824. the same, the macro 'SECONDARY_RELOAD_CLASS' should have been used
  26825. instead of defining both macros identically.
  26826. The values returned by these macros are often 'GENERAL_REGS'.
  26827. Return 'NO_REGS' if no spare register is needed; i.e., if X can be
  26828. directly copied to or from a register of CLASS in MODE without
  26829. requiring a scratch register. Do not define this macro if it would
  26830. always return 'NO_REGS'.
  26831. If a scratch register is required (either with or without an
  26832. intermediate register), you were supposed to define patterns for
  26833. 'reload_inM' or 'reload_outM', as required (*note Standard Names::.
  26834. These patterns, which were normally implemented with a
  26835. 'define_expand', should be similar to the 'movM' patterns, except
  26836. that operand 2 is the scratch register.
  26837. These patterns need constraints for the reload register and scratch
  26838. register that contain a single register class. If the original
  26839. reload register (whose class is CLASS) can meet the constraint
  26840. given in the pattern, the value returned by these macros is used
  26841. for the class of the scratch register. Otherwise, two additional
  26842. reload registers are required. Their classes are obtained from the
  26843. constraints in the insn pattern.
  26844. X might be a pseudo-register or a 'subreg' of a pseudo-register,
  26845. which could either be in a hard register or in memory. Use
  26846. 'true_regnum' to find out; it will return -1 if the pseudo is in
  26847. memory and the hard register number if it is in a register.
  26848. These macros should not be used in the case where a particular
  26849. class of registers can only be copied to memory and not to another
  26850. class of registers. In that case, secondary reload registers are
  26851. not needed and would not be helpful. Instead, a stack location
  26852. must be used to perform the copy and the 'movM' pattern should use
  26853. memory as an intermediate storage. This case often occurs between
  26854. floating-point and general registers.
  26855. -- Target Hook: bool TARGET_SECONDARY_MEMORY_NEEDED (machine_mode MODE,
  26856. reg_class_t CLASS1, reg_class_t CLASS2)
  26857. Certain machines have the property that some registers cannot be
  26858. copied to some other registers without using memory. Define this
  26859. hook on those machines to return true if objects of mode M in
  26860. registers of CLASS1 can only be copied to registers of class CLASS2
  26861. by storing a register of CLASS1 into memory and loading that memory
  26862. location into a register of CLASS2. The default definition returns
  26863. false for all inputs.
  26864. -- Macro: SECONDARY_MEMORY_NEEDED_RTX (MODE)
  26865. Normally when 'TARGET_SECONDARY_MEMORY_NEEDED' is defined, the
  26866. compiler allocates a stack slot for a memory location needed for
  26867. register copies. If this macro is defined, the compiler instead
  26868. uses the memory location defined by this macro.
  26869. Do not define this macro if you do not define
  26870. 'TARGET_SECONDARY_MEMORY_NEEDED'.
  26871. -- Target Hook: machine_mode TARGET_SECONDARY_MEMORY_NEEDED_MODE
  26872. (machine_mode MODE)
  26873. If 'TARGET_SECONDARY_MEMORY_NEEDED' tells the compiler to use
  26874. memory when moving between two particular registers of mode MODE,
  26875. this hook specifies the mode that the memory should have.
  26876. The default depends on 'TARGET_LRA_P'. Without LRA, the default is
  26877. to use a word-sized mode for integral modes that are smaller than a
  26878. a word. This is right thing to do on most machines because it
  26879. ensures that all bits of the register are copied and prevents
  26880. accesses to the registers in a narrower mode, which some machines
  26881. prohibit for floating-point registers.
  26882. However, this default behavior is not correct on some machines,
  26883. such as the DEC Alpha, that store short integers in floating-point
  26884. registers differently than in integer registers. On those
  26885. machines, the default widening will not work correctly and you must
  26886. define this hook to suppress that widening in some cases. See the
  26887. file 'alpha.c' for details.
  26888. With LRA, the default is to use MODE unmodified.
  26889. -- Target Hook: void TARGET_SELECT_EARLY_REMAT_MODES (sbitmap MODES)
  26890. On some targets, certain modes cannot be held in registers around a
  26891. standard ABI call and are relatively expensive to spill to the
  26892. stack. The early rematerialization pass can help in such cases by
  26893. aggressively recomputing values after calls, so that they don't
  26894. need to be spilled.
  26895. This hook returns the set of such modes by setting the associated
  26896. bits in MODES. The default implementation selects no modes, which
  26897. has the effect of disabling the early rematerialization pass.
  26898. -- Target Hook: bool TARGET_CLASS_LIKELY_SPILLED_P (reg_class_t RCLASS)
  26899. A target hook which returns 'true' if pseudos that have been
  26900. assigned to registers of class RCLASS would likely be spilled
  26901. because registers of RCLASS are needed for spill registers.
  26902. The default version of this target hook returns 'true' if RCLASS
  26903. has exactly one register and 'false' otherwise. On most machines,
  26904. this default should be used. For generally register-starved
  26905. machines, such as i386, or machines with right register
  26906. constraints, such as SH, this hook can be used to avoid excessive
  26907. spilling.
  26908. This hook is also used by some of the global intra-procedural code
  26909. transformations to throtle code motion, to avoid increasing
  26910. register pressure.
  26911. -- Target Hook: unsigned char TARGET_CLASS_MAX_NREGS (reg_class_t
  26912. RCLASS, machine_mode MODE)
  26913. A target hook returns the maximum number of consecutive registers
  26914. of class RCLASS needed to hold a value of mode MODE.
  26915. This is closely related to the macro 'TARGET_HARD_REGNO_NREGS'. In
  26916. fact, the value returned by 'TARGET_CLASS_MAX_NREGS (RCLASS, MODE)'
  26917. target hook should be the maximum value of 'TARGET_HARD_REGNO_NREGS
  26918. (REGNO, MODE)' for all REGNO values in the class RCLASS.
  26919. This target hook helps control the handling of multiple-word values
  26920. in the reload pass.
  26921. The default version of this target hook returns the size of MODE in
  26922. words.
  26923. -- Macro: CLASS_MAX_NREGS (CLASS, MODE)
  26924. A C expression for the maximum number of consecutive registers of
  26925. class CLASS needed to hold a value of mode MODE.
  26926. This is closely related to the macro 'TARGET_HARD_REGNO_NREGS'. In
  26927. fact, the value of the macro 'CLASS_MAX_NREGS (CLASS, MODE)' should
  26928. be the maximum value of 'TARGET_HARD_REGNO_NREGS (REGNO, MODE)' for
  26929. all REGNO values in the class CLASS.
  26930. This macro helps control the handling of multiple-word values in
  26931. the reload pass.
  26932. -- Target Hook: bool TARGET_CAN_CHANGE_MODE_CLASS (machine_mode FROM,
  26933. machine_mode TO, reg_class_t RCLASS)
  26934. This hook returns true if it is possible to bitcast values held in
  26935. registers of class RCLASS from mode FROM to mode TO and if doing so
  26936. preserves the low-order bits that are common to both modes. The
  26937. result is only meaningful if RCLASS has registers that can hold
  26938. both 'from' and 'to'. The default implementation returns true.
  26939. As an example of when such bitcasting is invalid, loading 32-bit
  26940. integer or floating-point objects into floating-point registers on
  26941. Alpha extends them to 64 bits. Therefore loading a 64-bit object
  26942. and then storing it as a 32-bit object does not store the low-order
  26943. 32 bits, as would be the case for a normal register. Therefore,
  26944. 'alpha.h' defines 'TARGET_CAN_CHANGE_MODE_CLASS' to return:
  26945. (GET_MODE_SIZE (from) == GET_MODE_SIZE (to)
  26946. || !reg_classes_intersect_p (FLOAT_REGS, rclass))
  26947. Even if storing from a register in mode TO would be valid, if both
  26948. FROM and 'raw_reg_mode' for RCLASS are wider than 'word_mode', then
  26949. we must prevent TO narrowing the mode. This happens when the
  26950. middle-end assumes that it can load or store pieces of an N-word
  26951. pseudo, and that the pseudo will eventually be allocated to N
  26952. 'word_mode' hard registers. Failure to prevent this kind of mode
  26953. change will result in the entire 'raw_reg_mode' being modified
  26954. instead of the partial value that the middle-end intended.
  26955. -- Target Hook: reg_class_t TARGET_IRA_CHANGE_PSEUDO_ALLOCNO_CLASS
  26956. (int, REG_CLASS_T, REG_CLASS_T)
  26957. A target hook which can change allocno class for given pseudo from
  26958. allocno and best class calculated by IRA.
  26959. The default version of this target hook always returns given class.
  26960. -- Target Hook: bool TARGET_LRA_P (void)
  26961. A target hook which returns true if we use LRA instead of reload
  26962. pass. The default version of this target hook returns true. New
  26963. ports should use LRA, and existing ports are encouraged to convert.
  26964. -- Target Hook: int TARGET_REGISTER_PRIORITY (int)
  26965. A target hook which returns the register priority number to which
  26966. the register HARD_REGNO belongs to. The bigger the number, the
  26967. more preferable the hard register usage (when all other conditions
  26968. are the same). This hook can be used to prefer some hard register
  26969. over others in LRA. For example, some x86-64 register usage needs
  26970. additional prefix which makes instructions longer. The hook can
  26971. return lower priority number for such registers make them less
  26972. favorable and as result making the generated code smaller. The
  26973. default version of this target hook returns always zero.
  26974. -- Target Hook: bool TARGET_REGISTER_USAGE_LEVELING_P (void)
  26975. A target hook which returns true if we need register usage
  26976. leveling. That means if a few hard registers are equally good for
  26977. the assignment, we choose the least used hard register. The
  26978. register usage leveling may be profitable for some targets. Don't
  26979. use the usage leveling for targets with conditional execution or
  26980. targets with big register files as it hurts if-conversion and
  26981. cross-jumping optimizations. The default version of this target
  26982. hook returns always false.
  26983. -- Target Hook: bool TARGET_DIFFERENT_ADDR_DISPLACEMENT_P (void)
  26984. A target hook which returns true if an address with the same
  26985. structure can have different maximal legitimate displacement. For
  26986. example, the displacement can depend on memory mode or on operand
  26987. combinations in the insn. The default version of this target hook
  26988. returns always false.
  26989. -- Target Hook: bool TARGET_CANNOT_SUBSTITUTE_MEM_EQUIV_P (rtx SUBST)
  26990. A target hook which returns 'true' if SUBST can't substitute safely
  26991. pseudos with equivalent memory values during register allocation.
  26992. The default version of this target hook returns 'false'. On most
  26993. machines, this default should be used. For generally machines with
  26994. non orthogonal register usage for addressing, such as SH, this hook
  26995. can be used to avoid excessive spilling.
  26996. -- Target Hook: bool TARGET_LEGITIMIZE_ADDRESS_DISPLACEMENT (rtx
  26997. *OFFSET1, rtx *OFFSET2, poly_int64 ORIG_OFFSET, machine_mode
  26998. MODE)
  26999. This hook tries to split address offset ORIG_OFFSET into two parts:
  27000. one that should be added to the base address to create a local
  27001. anchor point, and an additional offset that can be applied to the
  27002. anchor to address a value of mode MODE. The idea is that the local
  27003. anchor could be shared by other accesses to nearby locations.
  27004. The hook returns true if it succeeds, storing the offset of the
  27005. anchor from the base in OFFSET1 and the offset of the final address
  27006. from the anchor in OFFSET2. The default implementation returns
  27007. false.
  27008. -- Target Hook: reg_class_t TARGET_SPILL_CLASS (reg_class_t,
  27009. MACHINE_MODE)
  27010. This hook defines a class of registers which could be used for
  27011. spilling pseudos of the given mode and class, or 'NO_REGS' if only
  27012. memory should be used. Not defining this hook is equivalent to
  27013. returning 'NO_REGS' for all inputs.
  27014. -- Target Hook: bool TARGET_ADDITIONAL_ALLOCNO_CLASS_P (reg_class_t)
  27015. This hook should return 'true' if given class of registers should
  27016. be an allocno class in any way. Usually RA uses only one register
  27017. class from all classes containing the same register set. In some
  27018. complicated cases, you need to have two or more such classes as
  27019. allocno ones for RA correct work. Not defining this hook is
  27020. equivalent to returning 'false' for all inputs.
  27021. -- Target Hook: scalar_int_mode TARGET_CSTORE_MODE (enum insn_code
  27022. ICODE)
  27023. This hook defines the machine mode to use for the boolean result of
  27024. conditional store patterns. The ICODE argument is the instruction
  27025. code for the cstore being performed. Not definiting this hook is
  27026. the same as accepting the mode encoded into operand 0 of the cstore
  27027. expander patterns.
  27028. -- Target Hook: int TARGET_COMPUTE_PRESSURE_CLASSES (enum reg_class
  27029. *PRESSURE_CLASSES)
  27030. A target hook which lets a backend compute the set of pressure
  27031. classes to be used by those optimization passes which take register
  27032. pressure into account, as opposed to letting IRA compute them. It
  27033. returns the number of register classes stored in the array
  27034. PRESSURE_CLASSES.
  27035. 
  27036. File: gccint.info, Node: Stack and Calling, Next: Varargs, Prev: Register Classes, Up: Target Macros
  27037. 18.9 Stack Layout and Calling Conventions
  27038. =========================================
  27039. This describes the stack layout and calling conventions.
  27040. * Menu:
  27041. * Frame Layout::
  27042. * Exception Handling::
  27043. * Stack Checking::
  27044. * Frame Registers::
  27045. * Elimination::
  27046. * Stack Arguments::
  27047. * Register Arguments::
  27048. * Scalar Return::
  27049. * Aggregate Return::
  27050. * Caller Saves::
  27051. * Function Entry::
  27052. * Profiling::
  27053. * Tail Calls::
  27054. * Shrink-wrapping separate components::
  27055. * Stack Smashing Protection::
  27056. * Miscellaneous Register Hooks::
  27057. 
  27058. File: gccint.info, Node: Frame Layout, Next: Exception Handling, Up: Stack and Calling
  27059. 18.9.1 Basic Stack Layout
  27060. -------------------------
  27061. Here is the basic stack layout.
  27062. -- Macro: STACK_GROWS_DOWNWARD
  27063. Define this macro to be true if pushing a word onto the stack moves
  27064. the stack pointer to a smaller address, and false otherwise.
  27065. -- Macro: STACK_PUSH_CODE
  27066. This macro defines the operation used when something is pushed on
  27067. the stack. In RTL, a push operation will be '(set (mem
  27068. (STACK_PUSH_CODE (reg sp))) ...)'
  27069. The choices are 'PRE_DEC', 'POST_DEC', 'PRE_INC', and 'POST_INC'.
  27070. Which of these is correct depends on the stack direction and on
  27071. whether the stack pointer points to the last item on the stack or
  27072. whether it points to the space for the next item on the stack.
  27073. The default is 'PRE_DEC' when 'STACK_GROWS_DOWNWARD' is true, which
  27074. is almost always right, and 'PRE_INC' otherwise, which is often
  27075. wrong.
  27076. -- Macro: FRAME_GROWS_DOWNWARD
  27077. Define this macro to nonzero value if the addresses of local
  27078. variable slots are at negative offsets from the frame pointer.
  27079. -- Macro: ARGS_GROW_DOWNWARD
  27080. Define this macro if successive arguments to a function occupy
  27081. decreasing addresses on the stack.
  27082. -- Target Hook: HOST_WIDE_INT TARGET_STARTING_FRAME_OFFSET (void)
  27083. This hook returns the offset from the frame pointer to the first
  27084. local variable slot to be allocated. If 'FRAME_GROWS_DOWNWARD', it
  27085. is the offset to _end_ of the first slot allocated, otherwise it is
  27086. the offset to _beginning_ of the first slot allocated. The default
  27087. implementation returns 0.
  27088. -- Macro: STACK_ALIGNMENT_NEEDED
  27089. Define to zero to disable final alignment of the stack during
  27090. reload. The nonzero default for this macro is suitable for most
  27091. ports.
  27092. On ports where 'TARGET_STARTING_FRAME_OFFSET' is nonzero or where
  27093. there is a register save block following the local block that
  27094. doesn't require alignment to 'STACK_BOUNDARY', it may be beneficial
  27095. to disable stack alignment and do it in the backend.
  27096. -- Macro: STACK_POINTER_OFFSET
  27097. Offset from the stack pointer register to the first location at
  27098. which outgoing arguments are placed. If not specified, the default
  27099. value of zero is used. This is the proper value for most machines.
  27100. If 'ARGS_GROW_DOWNWARD', this is the offset to the location above
  27101. the first location at which outgoing arguments are placed.
  27102. -- Macro: FIRST_PARM_OFFSET (FUNDECL)
  27103. Offset from the argument pointer register to the first argument's
  27104. address. On some machines it may depend on the data type of the
  27105. function.
  27106. If 'ARGS_GROW_DOWNWARD', this is the offset to the location above
  27107. the first argument's address.
  27108. -- Macro: STACK_DYNAMIC_OFFSET (FUNDECL)
  27109. Offset from the stack pointer register to an item dynamically
  27110. allocated on the stack, e.g., by 'alloca'.
  27111. The default value for this macro is 'STACK_POINTER_OFFSET' plus the
  27112. length of the outgoing arguments. The default is correct for most
  27113. machines. See 'function.c' for details.
  27114. -- Macro: INITIAL_FRAME_ADDRESS_RTX
  27115. A C expression whose value is RTL representing the address of the
  27116. initial stack frame. This address is passed to 'RETURN_ADDR_RTX'
  27117. and 'DYNAMIC_CHAIN_ADDRESS'. If you don't define this macro, a
  27118. reasonable default value will be used. Define this macro in order
  27119. to make frame pointer elimination work in the presence of
  27120. '__builtin_frame_address (count)' and '__builtin_return_address
  27121. (count)' for 'count' not equal to zero.
  27122. -- Macro: DYNAMIC_CHAIN_ADDRESS (FRAMEADDR)
  27123. A C expression whose value is RTL representing the address in a
  27124. stack frame where the pointer to the caller's frame is stored.
  27125. Assume that FRAMEADDR is an RTL expression for the address of the
  27126. stack frame itself.
  27127. If you don't define this macro, the default is to return the value
  27128. of FRAMEADDR--that is, the stack frame address is also the address
  27129. of the stack word that points to the previous frame.
  27130. -- Macro: SETUP_FRAME_ADDRESSES
  27131. A C expression that produces the machine-specific code to setup the
  27132. stack so that arbitrary frames can be accessed. For example, on
  27133. the SPARC, we must flush all of the register windows to the stack
  27134. before we can access arbitrary stack frames. You will seldom need
  27135. to define this macro. The default is to do nothing.
  27136. -- Target Hook: rtx TARGET_BUILTIN_SETJMP_FRAME_VALUE (void)
  27137. This target hook should return an rtx that is used to store the
  27138. address of the current frame into the built in 'setjmp' buffer.
  27139. The default value, 'virtual_stack_vars_rtx', is correct for most
  27140. machines. One reason you may need to define this target hook is if
  27141. 'hard_frame_pointer_rtx' is the appropriate value on your machine.
  27142. -- Macro: FRAME_ADDR_RTX (FRAMEADDR)
  27143. A C expression whose value is RTL representing the value of the
  27144. frame address for the current frame. FRAMEADDR is the frame
  27145. pointer of the current frame. This is used for
  27146. __builtin_frame_address. You need only define this macro if the
  27147. frame address is not the same as the frame pointer. Most machines
  27148. do not need to define it.
  27149. -- Macro: RETURN_ADDR_RTX (COUNT, FRAMEADDR)
  27150. A C expression whose value is RTL representing the value of the
  27151. return address for the frame COUNT steps up from the current frame,
  27152. after the prologue. FRAMEADDR is the frame pointer of the COUNT
  27153. frame, or the frame pointer of the COUNT - 1 frame if
  27154. 'RETURN_ADDR_IN_PREVIOUS_FRAME' is nonzero.
  27155. The value of the expression must always be the correct address when
  27156. COUNT is zero, but may be 'NULL_RTX' if there is no way to
  27157. determine the return address of other frames.
  27158. -- Macro: RETURN_ADDR_IN_PREVIOUS_FRAME
  27159. Define this macro to nonzero value if the return address of a
  27160. particular stack frame is accessed from the frame pointer of the
  27161. previous stack frame. The zero default for this macro is suitable
  27162. for most ports.
  27163. -- Macro: INCOMING_RETURN_ADDR_RTX
  27164. A C expression whose value is RTL representing the location of the
  27165. incoming return address at the beginning of any function, before
  27166. the prologue. This RTL is either a 'REG', indicating that the
  27167. return value is saved in 'REG', or a 'MEM' representing a location
  27168. in the stack.
  27169. You only need to define this macro if you want to support call
  27170. frame debugging information like that provided by DWARF 2.
  27171. If this RTL is a 'REG', you should also define
  27172. 'DWARF_FRAME_RETURN_COLUMN' to 'DWARF_FRAME_REGNUM (REGNO)'.
  27173. -- Macro: DWARF_ALT_FRAME_RETURN_COLUMN
  27174. A C expression whose value is an integer giving a DWARF 2 column
  27175. number that may be used as an alternative return column. The
  27176. column must not correspond to any gcc hard register (that is, it
  27177. must not be in the range of 'DWARF_FRAME_REGNUM').
  27178. This macro can be useful if 'DWARF_FRAME_RETURN_COLUMN' is set to a
  27179. general register, but an alternative column needs to be used for
  27180. signal frames. Some targets have also used different frame return
  27181. columns over time.
  27182. -- Macro: DWARF_ZERO_REG
  27183. A C expression whose value is an integer giving a DWARF 2 register
  27184. number that is considered to always have the value zero. This
  27185. should only be defined if the target has an architected zero
  27186. register, and someone decided it was a good idea to use that
  27187. register number to terminate the stack backtrace. New ports should
  27188. avoid this.
  27189. -- Target Hook: void TARGET_DWARF_HANDLE_FRAME_UNSPEC (const char
  27190. *LABEL, rtx PATTERN, int INDEX)
  27191. This target hook allows the backend to emit frame-related insns
  27192. that contain UNSPECs or UNSPEC_VOLATILEs. The DWARF 2 call frame
  27193. debugging info engine will invoke it on insns of the form
  27194. (set (reg) (unspec [...] UNSPEC_INDEX))
  27195. and
  27196. (set (reg) (unspec_volatile [...] UNSPECV_INDEX)).
  27197. to let the backend emit the call frame instructions. LABEL is the
  27198. CFI label attached to the insn, PATTERN is the pattern of the insn
  27199. and INDEX is 'UNSPEC_INDEX' or 'UNSPECV_INDEX'.
  27200. -- Target Hook: unsigned int TARGET_DWARF_POLY_INDETERMINATE_VALUE
  27201. (unsigned int I, unsigned int *FACTOR, int *OFFSET)
  27202. Express the value of 'poly_int' indeterminate I as a DWARF
  27203. expression, with I counting from 1. Return the number of a DWARF
  27204. register R and set '*FACTOR' and '*OFFSET' such that the value of
  27205. the indeterminate is:
  27206. value_of(R) / FACTOR - OFFSET
  27207. A target only needs to define this hook if it sets
  27208. 'NUM_POLY_INT_COEFFS' to a value greater than 1.
  27209. -- Macro: INCOMING_FRAME_SP_OFFSET
  27210. A C expression whose value is an integer giving the offset, in
  27211. bytes, from the value of the stack pointer register to the top of
  27212. the stack frame at the beginning of any function, before the
  27213. prologue. The top of the frame is defined to be the value of the
  27214. stack pointer in the previous frame, just before the call
  27215. instruction.
  27216. You only need to define this macro if you want to support call
  27217. frame debugging information like that provided by DWARF 2.
  27218. -- Macro: DEFAULT_INCOMING_FRAME_SP_OFFSET
  27219. Like 'INCOMING_FRAME_SP_OFFSET', but must be the same for all
  27220. functions of the same ABI, and when using GAS '.cfi_*' directives
  27221. must also agree with the default CFI GAS emits. Define this macro
  27222. only if 'INCOMING_FRAME_SP_OFFSET' can have different values
  27223. between different functions of the same ABI or when
  27224. 'INCOMING_FRAME_SP_OFFSET' does not agree with GAS default CFI.
  27225. -- Macro: ARG_POINTER_CFA_OFFSET (FUNDECL)
  27226. A C expression whose value is an integer giving the offset, in
  27227. bytes, from the argument pointer to the canonical frame address
  27228. (cfa). The final value should coincide with that calculated by
  27229. 'INCOMING_FRAME_SP_OFFSET'. Which is unfortunately not usable
  27230. during virtual register instantiation.
  27231. The default value for this macro is 'FIRST_PARM_OFFSET (fundecl) +
  27232. crtl->args.pretend_args_size', which is correct for most machines;
  27233. in general, the arguments are found immediately before the stack
  27234. frame. Note that this is not the case on some targets that save
  27235. registers into the caller's frame, such as SPARC and rs6000, and so
  27236. such targets need to define this macro.
  27237. You only need to define this macro if the default is incorrect, and
  27238. you want to support call frame debugging information like that
  27239. provided by DWARF 2.
  27240. -- Macro: FRAME_POINTER_CFA_OFFSET (FUNDECL)
  27241. If defined, a C expression whose value is an integer giving the
  27242. offset in bytes from the frame pointer to the canonical frame
  27243. address (cfa). The final value should coincide with that
  27244. calculated by 'INCOMING_FRAME_SP_OFFSET'.
  27245. Normally the CFA is calculated as an offset from the argument
  27246. pointer, via 'ARG_POINTER_CFA_OFFSET', but if the argument pointer
  27247. is variable due to the ABI, this may not be possible. If this
  27248. macro is defined, it implies that the virtual register
  27249. instantiation should be based on the frame pointer instead of the
  27250. argument pointer. Only one of 'FRAME_POINTER_CFA_OFFSET' and
  27251. 'ARG_POINTER_CFA_OFFSET' should be defined.
  27252. -- Macro: CFA_FRAME_BASE_OFFSET (FUNDECL)
  27253. If defined, a C expression whose value is an integer giving the
  27254. offset in bytes from the canonical frame address (cfa) to the frame
  27255. base used in DWARF 2 debug information. The default is zero. A
  27256. different value may reduce the size of debug information on some
  27257. ports.
  27258. 
  27259. File: gccint.info, Node: Exception Handling, Next: Stack Checking, Prev: Frame Layout, Up: Stack and Calling
  27260. 18.9.2 Exception Handling Support
  27261. ---------------------------------
  27262. -- Macro: EH_RETURN_DATA_REGNO (N)
  27263. A C expression whose value is the Nth register number used for data
  27264. by exception handlers, or 'INVALID_REGNUM' if fewer than N
  27265. registers are usable.
  27266. The exception handling library routines communicate with the
  27267. exception handlers via a set of agreed upon registers. Ideally
  27268. these registers should be call-clobbered; it is possible to use
  27269. call-saved registers, but may negatively impact code size. The
  27270. target must support at least 2 data registers, but should define 4
  27271. if there are enough free registers.
  27272. You must define this macro if you want to support call frame
  27273. exception handling like that provided by DWARF 2.
  27274. -- Macro: EH_RETURN_STACKADJ_RTX
  27275. A C expression whose value is RTL representing a location in which
  27276. to store a stack adjustment to be applied before function return.
  27277. This is used to unwind the stack to an exception handler's call
  27278. frame. It will be assigned zero on code paths that return
  27279. normally.
  27280. Typically this is a call-clobbered hard register that is otherwise
  27281. untouched by the epilogue, but could also be a stack slot.
  27282. Do not define this macro if the stack pointer is saved and restored
  27283. by the regular prolog and epilog code in the call frame itself; in
  27284. this case, the exception handling library routines will update the
  27285. stack location to be restored in place. Otherwise, you must define
  27286. this macro if you want to support call frame exception handling
  27287. like that provided by DWARF 2.
  27288. -- Macro: EH_RETURN_HANDLER_RTX
  27289. A C expression whose value is RTL representing a location in which
  27290. to store the address of an exception handler to which we should
  27291. return. It will not be assigned on code paths that return
  27292. normally.
  27293. Typically this is the location in the call frame at which the
  27294. normal return address is stored. For targets that return by
  27295. popping an address off the stack, this might be a memory address
  27296. just below the _target_ call frame rather than inside the current
  27297. call frame. If defined, 'EH_RETURN_STACKADJ_RTX' will have already
  27298. been assigned, so it may be used to calculate the location of the
  27299. target call frame.
  27300. Some targets have more complex requirements than storing to an
  27301. address calculable during initial code generation. In that case
  27302. the 'eh_return' instruction pattern should be used instead.
  27303. If you want to support call frame exception handling, you must
  27304. define either this macro or the 'eh_return' instruction pattern.
  27305. -- Macro: RETURN_ADDR_OFFSET
  27306. If defined, an integer-valued C expression for which rtl will be
  27307. generated to add it to the exception handler address before it is
  27308. searched in the exception handling tables, and to subtract it again
  27309. from the address before using it to return to the exception
  27310. handler.
  27311. -- Macro: ASM_PREFERRED_EH_DATA_FORMAT (CODE, GLOBAL)
  27312. This macro chooses the encoding of pointers embedded in the
  27313. exception handling sections. If at all possible, this should be
  27314. defined such that the exception handling section will not require
  27315. dynamic relocations, and so may be read-only.
  27316. CODE is 0 for data, 1 for code labels, 2 for function pointers.
  27317. GLOBAL is true if the symbol may be affected by dynamic
  27318. relocations. The macro should return a combination of the
  27319. 'DW_EH_PE_*' defines as found in 'dwarf2.h'.
  27320. If this macro is not defined, pointers will not be encoded but
  27321. represented directly.
  27322. -- Macro: ASM_MAYBE_OUTPUT_ENCODED_ADDR_RTX (FILE, ENCODING, SIZE,
  27323. ADDR, DONE)
  27324. This macro allows the target to emit whatever special magic is
  27325. required to represent the encoding chosen by
  27326. 'ASM_PREFERRED_EH_DATA_FORMAT'. Generic code takes care of
  27327. pc-relative and indirect encodings; this must be defined if the
  27328. target uses text-relative or data-relative encodings.
  27329. This is a C statement that branches to DONE if the format was
  27330. handled. ENCODING is the format chosen, SIZE is the number of
  27331. bytes that the format occupies, ADDR is the 'SYMBOL_REF' to be
  27332. emitted.
  27333. -- Macro: MD_FALLBACK_FRAME_STATE_FOR (CONTEXT, FS)
  27334. This macro allows the target to add CPU and operating system
  27335. specific code to the call-frame unwinder for use when there is no
  27336. unwind data available. The most common reason to implement this
  27337. macro is to unwind through signal frames.
  27338. This macro is called from 'uw_frame_state_for' in 'unwind-dw2.c',
  27339. 'unwind-dw2-xtensa.c' and 'unwind-ia64.c'. CONTEXT is an
  27340. '_Unwind_Context'; FS is an '_Unwind_FrameState'. Examine
  27341. 'context->ra' for the address of the code being executed and
  27342. 'context->cfa' for the stack pointer value. If the frame can be
  27343. decoded, the register save addresses should be updated in FS and
  27344. the macro should evaluate to '_URC_NO_REASON'. If the frame cannot
  27345. be decoded, the macro should evaluate to '_URC_END_OF_STACK'.
  27346. For proper signal handling in Java this macro is accompanied by
  27347. 'MAKE_THROW_FRAME', defined in 'libjava/include/*-signal.h'
  27348. headers.
  27349. -- Macro: MD_HANDLE_UNWABI (CONTEXT, FS)
  27350. This macro allows the target to add operating system specific code
  27351. to the call-frame unwinder to handle the IA-64 '.unwabi' unwinding
  27352. directive, usually used for signal or interrupt frames.
  27353. This macro is called from 'uw_update_context' in libgcc's
  27354. 'unwind-ia64.c'. CONTEXT is an '_Unwind_Context'; FS is an
  27355. '_Unwind_FrameState'. Examine 'fs->unwabi' for the abi and context
  27356. in the '.unwabi' directive. If the '.unwabi' directive can be
  27357. handled, the register save addresses should be updated in FS.
  27358. -- Macro: TARGET_USES_WEAK_UNWIND_INFO
  27359. A C expression that evaluates to true if the target requires unwind
  27360. info to be given comdat linkage. Define it to be '1' if comdat
  27361. linkage is necessary. The default is '0'.
  27362. 
  27363. File: gccint.info, Node: Stack Checking, Next: Frame Registers, Prev: Exception Handling, Up: Stack and Calling
  27364. 18.9.3 Specifying How Stack Checking is Done
  27365. --------------------------------------------
  27366. GCC will check that stack references are within the boundaries of the
  27367. stack, if the option '-fstack-check' is specified, in one of three ways:
  27368. 1. If the value of the 'STACK_CHECK_BUILTIN' macro is nonzero, GCC
  27369. will assume that you have arranged for full stack checking to be
  27370. done at appropriate places in the configuration files. GCC will
  27371. not do other special processing.
  27372. 2. If 'STACK_CHECK_BUILTIN' is zero and the value of the
  27373. 'STACK_CHECK_STATIC_BUILTIN' macro is nonzero, GCC will assume that
  27374. you have arranged for static stack checking (checking of the static
  27375. stack frame of functions) to be done at appropriate places in the
  27376. configuration files. GCC will only emit code to do dynamic stack
  27377. checking (checking on dynamic stack allocations) using the third
  27378. approach below.
  27379. 3. If neither of the above are true, GCC will generate code to
  27380. periodically "probe" the stack pointer using the values of the
  27381. macros defined below.
  27382. If neither STACK_CHECK_BUILTIN nor STACK_CHECK_STATIC_BUILTIN is
  27383. defined, GCC will change its allocation strategy for large objects if
  27384. the option '-fstack-check' is specified: they will always be allocated
  27385. dynamically if their size exceeds 'STACK_CHECK_MAX_VAR_SIZE' bytes.
  27386. -- Macro: STACK_CHECK_BUILTIN
  27387. A nonzero value if stack checking is done by the configuration
  27388. files in a machine-dependent manner. You should define this macro
  27389. if stack checking is required by the ABI of your machine or if you
  27390. would like to do stack checking in some more efficient way than the
  27391. generic approach. The default value of this macro is zero.
  27392. -- Macro: STACK_CHECK_STATIC_BUILTIN
  27393. A nonzero value if static stack checking is done by the
  27394. configuration files in a machine-dependent manner. You should
  27395. define this macro if you would like to do static stack checking in
  27396. some more efficient way than the generic approach. The default
  27397. value of this macro is zero.
  27398. -- Macro: STACK_CHECK_PROBE_INTERVAL_EXP
  27399. An integer specifying the interval at which GCC must generate stack
  27400. probe instructions, defined as 2 raised to this integer. You will
  27401. normally define this macro so that the interval be no larger than
  27402. the size of the "guard pages" at the end of a stack area. The
  27403. default value of 12 (4096-byte interval) is suitable for most
  27404. systems.
  27405. -- Macro: STACK_CHECK_MOVING_SP
  27406. An integer which is nonzero if GCC should move the stack pointer
  27407. page by page when doing probes. This can be necessary on systems
  27408. where the stack pointer contains the bottom address of the memory
  27409. area accessible to the executing thread at any point in time. In
  27410. this situation an alternate signal stack is required in order to be
  27411. able to recover from a stack overflow. The default value of this
  27412. macro is zero.
  27413. -- Macro: STACK_CHECK_PROTECT
  27414. The number of bytes of stack needed to recover from a stack
  27415. overflow, for languages where such a recovery is supported. The
  27416. default value of 4KB/8KB with the 'setjmp'/'longjmp'-based
  27417. exception handling mechanism and 8KB/12KB with other exception
  27418. handling mechanisms should be adequate for most architectures and
  27419. operating systems.
  27420. The following macros are relevant only if neither STACK_CHECK_BUILTIN
  27421. nor STACK_CHECK_STATIC_BUILTIN is defined; you can omit them altogether
  27422. in the opposite case.
  27423. -- Macro: STACK_CHECK_MAX_FRAME_SIZE
  27424. The maximum size of a stack frame, in bytes. GCC will generate
  27425. probe instructions in non-leaf functions to ensure at least this
  27426. many bytes of stack are available. If a stack frame is larger than
  27427. this size, stack checking will not be reliable and GCC will issue a
  27428. warning. The default is chosen so that GCC only generates one
  27429. instruction on most systems. You should normally not change the
  27430. default value of this macro.
  27431. -- Macro: STACK_CHECK_FIXED_FRAME_SIZE
  27432. GCC uses this value to generate the above warning message. It
  27433. represents the amount of fixed frame used by a function, not
  27434. including space for any callee-saved registers, temporaries and
  27435. user variables. You need only specify an upper bound for this
  27436. amount and will normally use the default of four words.
  27437. -- Macro: STACK_CHECK_MAX_VAR_SIZE
  27438. The maximum size, in bytes, of an object that GCC will place in the
  27439. fixed area of the stack frame when the user specifies
  27440. '-fstack-check'. GCC computed the default from the values of the
  27441. above macros and you will normally not need to override that
  27442. default.
  27443. -- Target Hook: HOST_WIDE_INT
  27444. TARGET_STACK_CLASH_PROTECTION_ALLOCA_PROBE_RANGE (void)
  27445. Some targets have an ABI defined interval for which no probing
  27446. needs to be done. When a probe does need to be done this same
  27447. interval is used as the probe distance up when doing stack clash
  27448. protection for alloca. On such targets this value can be set to
  27449. override the default probing up interval. Define this variable to
  27450. return nonzero if such a probe range is required or zero otherwise.
  27451. Defining this hook also requires your functions which make use of
  27452. alloca to have at least 8 byesof outgoing arguments. If this is
  27453. not the case the stack will be corrupted. You need not define this
  27454. macro if it would always have the value zero.
  27455. 
  27456. File: gccint.info, Node: Frame Registers, Next: Elimination, Prev: Stack Checking, Up: Stack and Calling
  27457. 18.9.4 Registers That Address the Stack Frame
  27458. ---------------------------------------------
  27459. This discusses registers that address the stack frame.
  27460. -- Macro: STACK_POINTER_REGNUM
  27461. The register number of the stack pointer register, which must also
  27462. be a fixed register according to 'FIXED_REGISTERS'. On most
  27463. machines, the hardware determines which register this is.
  27464. -- Macro: FRAME_POINTER_REGNUM
  27465. The register number of the frame pointer register, which is used to
  27466. access automatic variables in the stack frame. On some machines,
  27467. the hardware determines which register this is. On other machines,
  27468. you can choose any register you wish for this purpose.
  27469. -- Macro: HARD_FRAME_POINTER_REGNUM
  27470. On some machines the offset between the frame pointer and starting
  27471. offset of the automatic variables is not known until after register
  27472. allocation has been done (for example, because the saved registers
  27473. are between these two locations). On those machines, define
  27474. 'FRAME_POINTER_REGNUM' the number of a special, fixed register to
  27475. be used internally until the offset is known, and define
  27476. 'HARD_FRAME_POINTER_REGNUM' to be the actual hard register number
  27477. used for the frame pointer.
  27478. You should define this macro only in the very rare circumstances
  27479. when it is not possible to calculate the offset between the frame
  27480. pointer and the automatic variables until after register allocation
  27481. has been completed. When this macro is defined, you must also
  27482. indicate in your definition of 'ELIMINABLE_REGS' how to eliminate
  27483. 'FRAME_POINTER_REGNUM' into either 'HARD_FRAME_POINTER_REGNUM' or
  27484. 'STACK_POINTER_REGNUM'.
  27485. Do not define this macro if it would be the same as
  27486. 'FRAME_POINTER_REGNUM'.
  27487. -- Macro: ARG_POINTER_REGNUM
  27488. The register number of the arg pointer register, which is used to
  27489. access the function's argument list. On some machines, this is the
  27490. same as the frame pointer register. On some machines, the hardware
  27491. determines which register this is. On other machines, you can
  27492. choose any register you wish for this purpose. If this is not the
  27493. same register as the frame pointer register, then you must mark it
  27494. as a fixed register according to 'FIXED_REGISTERS', or arrange to
  27495. be able to eliminate it (*note Elimination::).
  27496. -- Macro: HARD_FRAME_POINTER_IS_FRAME_POINTER
  27497. Define this to a preprocessor constant that is nonzero if
  27498. 'hard_frame_pointer_rtx' and 'frame_pointer_rtx' should be the
  27499. same. The default definition is '(HARD_FRAME_POINTER_REGNUM ==
  27500. FRAME_POINTER_REGNUM)'; you only need to define this macro if that
  27501. definition is not suitable for use in preprocessor conditionals.
  27502. -- Macro: HARD_FRAME_POINTER_IS_ARG_POINTER
  27503. Define this to a preprocessor constant that is nonzero if
  27504. 'hard_frame_pointer_rtx' and 'arg_pointer_rtx' should be the same.
  27505. The default definition is '(HARD_FRAME_POINTER_REGNUM ==
  27506. ARG_POINTER_REGNUM)'; you only need to define this macro if that
  27507. definition is not suitable for use in preprocessor conditionals.
  27508. -- Macro: RETURN_ADDRESS_POINTER_REGNUM
  27509. The register number of the return address pointer register, which
  27510. is used to access the current function's return address from the
  27511. stack. On some machines, the return address is not at a fixed
  27512. offset from the frame pointer or stack pointer or argument pointer.
  27513. This register can be defined to point to the return address on the
  27514. stack, and then be converted by 'ELIMINABLE_REGS' into either the
  27515. frame pointer or stack pointer.
  27516. Do not define this macro unless there is no other way to get the
  27517. return address from the stack.
  27518. -- Macro: STATIC_CHAIN_REGNUM
  27519. -- Macro: STATIC_CHAIN_INCOMING_REGNUM
  27520. Register numbers used for passing a function's static chain
  27521. pointer. If register windows are used, the register number as seen
  27522. by the called function is 'STATIC_CHAIN_INCOMING_REGNUM', while the
  27523. register number as seen by the calling function is
  27524. 'STATIC_CHAIN_REGNUM'. If these registers are the same,
  27525. 'STATIC_CHAIN_INCOMING_REGNUM' need not be defined.
  27526. The static chain register need not be a fixed register.
  27527. If the static chain is passed in memory, these macros should not be
  27528. defined; instead, the 'TARGET_STATIC_CHAIN' hook should be used.
  27529. -- Target Hook: rtx TARGET_STATIC_CHAIN (const_tree FNDECL_OR_TYPE,
  27530. bool INCOMING_P)
  27531. This hook replaces the use of 'STATIC_CHAIN_REGNUM' et al for
  27532. targets that may use different static chain locations for different
  27533. nested functions. This may be required if the target has function
  27534. attributes that affect the calling conventions of the function and
  27535. those calling conventions use different static chain locations.
  27536. The default version of this hook uses 'STATIC_CHAIN_REGNUM' et al.
  27537. If the static chain is passed in memory, this hook should be used
  27538. to provide rtx giving 'mem' expressions that denote where they are
  27539. stored. Often the 'mem' expression as seen by the caller will be
  27540. at an offset from the stack pointer and the 'mem' expression as
  27541. seen by the callee will be at an offset from the frame pointer.
  27542. The variables 'stack_pointer_rtx', 'frame_pointer_rtx', and
  27543. 'arg_pointer_rtx' will have been initialized and should be used to
  27544. refer to those items.
  27545. -- Macro: DWARF_FRAME_REGISTERS
  27546. This macro specifies the maximum number of hard registers that can
  27547. be saved in a call frame. This is used to size data structures
  27548. used in DWARF2 exception handling.
  27549. Prior to GCC 3.0, this macro was needed in order to establish a
  27550. stable exception handling ABI in the face of adding new hard
  27551. registers for ISA extensions. In GCC 3.0 and later, the EH ABI is
  27552. insulated from changes in the number of hard registers.
  27553. Nevertheless, this macro can still be used to reduce the runtime
  27554. memory requirements of the exception handling routines, which can
  27555. be substantial if the ISA contains a lot of registers that are not
  27556. call-saved.
  27557. If this macro is not defined, it defaults to
  27558. 'FIRST_PSEUDO_REGISTER'.
  27559. -- Macro: PRE_GCC3_DWARF_FRAME_REGISTERS
  27560. This macro is similar to 'DWARF_FRAME_REGISTERS', but is provided
  27561. for backward compatibility in pre GCC 3.0 compiled code.
  27562. If this macro is not defined, it defaults to
  27563. 'DWARF_FRAME_REGISTERS'.
  27564. -- Macro: DWARF_REG_TO_UNWIND_COLUMN (REGNO)
  27565. Define this macro if the target's representation for dwarf
  27566. registers is different than the internal representation for unwind
  27567. column. Given a dwarf register, this macro should return the
  27568. internal unwind column number to use instead.
  27569. -- Macro: DWARF_FRAME_REGNUM (REGNO)
  27570. Define this macro if the target's representation for dwarf
  27571. registers used in .eh_frame or .debug_frame is different from that
  27572. used in other debug info sections. Given a GCC hard register
  27573. number, this macro should return the .eh_frame register number.
  27574. The default is 'DBX_REGISTER_NUMBER (REGNO)'.
  27575. -- Macro: DWARF2_FRAME_REG_OUT (REGNO, FOR_EH)
  27576. Define this macro to map register numbers held in the call frame
  27577. info that GCC has collected using 'DWARF_FRAME_REGNUM' to those
  27578. that should be output in .debug_frame ('FOR_EH' is zero) and
  27579. .eh_frame ('FOR_EH' is nonzero). The default is to return 'REGNO'.
  27580. -- Macro: REG_VALUE_IN_UNWIND_CONTEXT
  27581. Define this macro if the target stores register values as
  27582. '_Unwind_Word' type in unwind context. It should be defined if
  27583. target register size is larger than the size of 'void *'. The
  27584. default is to store register values as 'void *' type.
  27585. -- Macro: ASSUME_EXTENDED_UNWIND_CONTEXT
  27586. Define this macro to be 1 if the target always uses extended unwind
  27587. context with version, args_size and by_value fields. If it is
  27588. undefined, it will be defined to 1 when
  27589. 'REG_VALUE_IN_UNWIND_CONTEXT' is defined and 0 otherwise.
  27590. -- Macro: DWARF_LAZY_REGISTER_VALUE (REGNO, VALUE)
  27591. Define this macro if the target has pseudo DWARF registers whose
  27592. values need to be computed lazily on demand by the unwinder (such
  27593. as when referenced in a CFA expression). The macro returns true if
  27594. REGNO is such a register and stores its value in '*VALUE' if so.
  27595. 
  27596. File: gccint.info, Node: Elimination, Next: Stack Arguments, Prev: Frame Registers, Up: Stack and Calling
  27597. 18.9.5 Eliminating Frame Pointer and Arg Pointer
  27598. ------------------------------------------------
  27599. This is about eliminating the frame pointer and arg pointer.
  27600. -- Target Hook: bool TARGET_FRAME_POINTER_REQUIRED (void)
  27601. This target hook should return 'true' if a function must have and
  27602. use a frame pointer. This target hook is called in the reload
  27603. pass. If its return value is 'true' the function will have a frame
  27604. pointer.
  27605. This target hook can in principle examine the current function and
  27606. decide according to the facts, but on most machines the constant
  27607. 'false' or the constant 'true' suffices. Use 'false' when the
  27608. machine allows code to be generated with no frame pointer, and
  27609. doing so saves some time or space. Use 'true' when there is no
  27610. possible advantage to avoiding a frame pointer.
  27611. In certain cases, the compiler does not know how to produce valid
  27612. code without a frame pointer. The compiler recognizes those cases
  27613. and automatically gives the function a frame pointer regardless of
  27614. what 'targetm.frame_pointer_required' returns. You don't need to
  27615. worry about them.
  27616. In a function that does not require a frame pointer, the frame
  27617. pointer register can be allocated for ordinary usage, unless you
  27618. mark it as a fixed register. See 'FIXED_REGISTERS' for more
  27619. information.
  27620. Default return value is 'false'.
  27621. -- Macro: ELIMINABLE_REGS
  27622. This macro specifies a table of register pairs used to eliminate
  27623. unneeded registers that point into the stack frame.
  27624. The definition of this macro is a list of structure
  27625. initializations, each of which specifies an original and
  27626. replacement register.
  27627. On some machines, the position of the argument pointer is not known
  27628. until the compilation is completed. In such a case, a separate
  27629. hard register must be used for the argument pointer. This register
  27630. can be eliminated by replacing it with either the frame pointer or
  27631. the argument pointer, depending on whether or not the frame pointer
  27632. has been eliminated.
  27633. In this case, you might specify:
  27634. #define ELIMINABLE_REGS \
  27635. {{ARG_POINTER_REGNUM, STACK_POINTER_REGNUM}, \
  27636. {ARG_POINTER_REGNUM, FRAME_POINTER_REGNUM}, \
  27637. {FRAME_POINTER_REGNUM, STACK_POINTER_REGNUM}}
  27638. Note that the elimination of the argument pointer with the stack
  27639. pointer is specified first since that is the preferred elimination.
  27640. -- Target Hook: bool TARGET_CAN_ELIMINATE (const int FROM_REG, const
  27641. int TO_REG)
  27642. This target hook should return 'true' if the compiler is allowed to
  27643. try to replace register number FROM_REG with register number
  27644. TO_REG. This target hook will usually be 'true', since most of the
  27645. cases preventing register elimination are things that the compiler
  27646. already knows about.
  27647. Default return value is 'true'.
  27648. -- Macro: INITIAL_ELIMINATION_OFFSET (FROM-REG, TO-REG, OFFSET-VAR)
  27649. This macro returns the initial difference between the specified
  27650. pair of registers. The value would be computed from information
  27651. such as the result of 'get_frame_size ()' and the tables of
  27652. registers 'df_regs_ever_live_p' and 'call_used_regs'.
  27653. -- Target Hook: void TARGET_COMPUTE_FRAME_LAYOUT (void)
  27654. This target hook is called once each time the frame layout needs to
  27655. be recalculated. The calculations can be cached by the target and
  27656. can then be used by 'INITIAL_ELIMINATION_OFFSET' instead of
  27657. re-computing the layout on every invocation of that hook. This is
  27658. particularly useful for targets that have an expensive frame layout
  27659. function. Implementing this callback is optional.
  27660. 
  27661. File: gccint.info, Node: Stack Arguments, Next: Register Arguments, Prev: Elimination, Up: Stack and Calling
  27662. 18.9.6 Passing Function Arguments on the Stack
  27663. ----------------------------------------------
  27664. The macros in this section control how arguments are passed on the
  27665. stack. See the following section for other macros that control passing
  27666. certain arguments in registers.
  27667. -- Target Hook: bool TARGET_PROMOTE_PROTOTYPES (const_tree FNTYPE)
  27668. This target hook returns 'true' if an argument declared in a
  27669. prototype as an integral type smaller than 'int' should actually be
  27670. passed as an 'int'. In addition to avoiding errors in certain
  27671. cases of mismatch, it also makes for better code on certain
  27672. machines. The default is to not promote prototypes.
  27673. -- Macro: PUSH_ARGS
  27674. A C expression. If nonzero, push insns will be used to pass
  27675. outgoing arguments. If the target machine does not have a push
  27676. instruction, set it to zero. That directs GCC to use an alternate
  27677. strategy: to allocate the entire argument block and then store the
  27678. arguments into it. When 'PUSH_ARGS' is nonzero, 'PUSH_ROUNDING'
  27679. must be defined too.
  27680. -- Macro: PUSH_ARGS_REVERSED
  27681. A C expression. If nonzero, function arguments will be evaluated
  27682. from last to first, rather than from first to last. If this macro
  27683. is not defined, it defaults to 'PUSH_ARGS' on targets where the
  27684. stack and args grow in opposite directions, and 0 otherwise.
  27685. -- Macro: PUSH_ROUNDING (NPUSHED)
  27686. A C expression that is the number of bytes actually pushed onto the
  27687. stack when an instruction attempts to push NPUSHED bytes.
  27688. On some machines, the definition
  27689. #define PUSH_ROUNDING(BYTES) (BYTES)
  27690. will suffice. But on other machines, instructions that appear to
  27691. push one byte actually push two bytes in an attempt to maintain
  27692. alignment. Then the definition should be
  27693. #define PUSH_ROUNDING(BYTES) (((BYTES) + 1) & ~1)
  27694. If the value of this macro has a type, it should be an unsigned
  27695. type.
  27696. -- Macro: ACCUMULATE_OUTGOING_ARGS
  27697. A C expression. If nonzero, the maximum amount of space required
  27698. for outgoing arguments will be computed and placed into
  27699. 'crtl->outgoing_args_size'. No space will be pushed onto the stack
  27700. for each call; instead, the function prologue should increase the
  27701. stack frame size by this amount.
  27702. Setting both 'PUSH_ARGS' and 'ACCUMULATE_OUTGOING_ARGS' is not
  27703. proper.
  27704. -- Macro: REG_PARM_STACK_SPACE (FNDECL)
  27705. Define this macro if functions should assume that stack space has
  27706. been allocated for arguments even when their values are passed in
  27707. registers.
  27708. The value of this macro is the size, in bytes, of the area reserved
  27709. for arguments passed in registers for the function represented by
  27710. FNDECL, which can be zero if GCC is calling a library function.
  27711. The argument FNDECL can be the FUNCTION_DECL, or the type itself of
  27712. the function.
  27713. This space can be allocated by the caller, or be a part of the
  27714. machine-dependent stack frame: 'OUTGOING_REG_PARM_STACK_SPACE' says
  27715. which.
  27716. -- Macro: INCOMING_REG_PARM_STACK_SPACE (FNDECL)
  27717. Like 'REG_PARM_STACK_SPACE', but for incoming register arguments.
  27718. Define this macro if space guaranteed when compiling a function
  27719. body is different to space required when making a call, a situation
  27720. that can arise with K&R style function definitions.
  27721. -- Macro: OUTGOING_REG_PARM_STACK_SPACE (FNTYPE)
  27722. Define this to a nonzero value if it is the responsibility of the
  27723. caller to allocate the area reserved for arguments passed in
  27724. registers when calling a function of FNTYPE. FNTYPE may be NULL if
  27725. the function called is a library function.
  27726. If 'ACCUMULATE_OUTGOING_ARGS' is defined, this macro controls
  27727. whether the space for these arguments counts in the value of
  27728. 'crtl->outgoing_args_size'.
  27729. -- Macro: STACK_PARMS_IN_REG_PARM_AREA
  27730. Define this macro if 'REG_PARM_STACK_SPACE' is defined, but the
  27731. stack parameters don't skip the area specified by it.
  27732. Normally, when a parameter is not passed in registers, it is placed
  27733. on the stack beyond the 'REG_PARM_STACK_SPACE' area. Defining this
  27734. macro suppresses this behavior and causes the parameter to be
  27735. passed on the stack in its natural location.
  27736. -- Target Hook: poly_int64 TARGET_RETURN_POPS_ARGS (tree FUNDECL, tree
  27737. FUNTYPE, poly_int64 SIZE)
  27738. This target hook returns the number of bytes of its own arguments
  27739. that a function pops on returning, or 0 if the function pops no
  27740. arguments and the caller must therefore pop them all after the
  27741. function returns.
  27742. FUNDECL is a C variable whose value is a tree node that describes
  27743. the function in question. Normally it is a node of type
  27744. 'FUNCTION_DECL' that describes the declaration of the function.
  27745. From this you can obtain the 'DECL_ATTRIBUTES' of the function.
  27746. FUNTYPE is a C variable whose value is a tree node that describes
  27747. the function in question. Normally it is a node of type
  27748. 'FUNCTION_TYPE' that describes the data type of the function. From
  27749. this it is possible to obtain the data types of the value and
  27750. arguments (if known).
  27751. When a call to a library function is being considered, FUNDECL will
  27752. contain an identifier node for the library function. Thus, if you
  27753. need to distinguish among various library functions, you can do so
  27754. by their names. Note that "library function" in this context means
  27755. a function used to perform arithmetic, whose name is known
  27756. specially in the compiler and was not mentioned in the C code being
  27757. compiled.
  27758. SIZE is the number of bytes of arguments passed on the stack. If a
  27759. variable number of bytes is passed, it is zero, and argument
  27760. popping will always be the responsibility of the calling function.
  27761. On the VAX, all functions always pop their arguments, so the
  27762. definition of this macro is SIZE. On the 68000, using the standard
  27763. calling convention, no functions pop their arguments, so the value
  27764. of the macro is always 0 in this case. But an alternative calling
  27765. convention is available in which functions that take a fixed number
  27766. of arguments pop them but other functions (such as 'printf') pop
  27767. nothing (the caller pops all). When this convention is in use,
  27768. FUNTYPE is examined to determine whether a function takes a fixed
  27769. number of arguments.
  27770. -- Macro: CALL_POPS_ARGS (CUM)
  27771. A C expression that should indicate the number of bytes a call
  27772. sequence pops off the stack. It is added to the value of
  27773. 'RETURN_POPS_ARGS' when compiling a function call.
  27774. CUM is the variable in which all arguments to the called function
  27775. have been accumulated.
  27776. On certain architectures, such as the SH5, a call trampoline is
  27777. used that pops certain registers off the stack, depending on the
  27778. arguments that have been passed to the function. Since this is a
  27779. property of the call site, not of the called function,
  27780. 'RETURN_POPS_ARGS' is not appropriate.
  27781. 
  27782. File: gccint.info, Node: Register Arguments, Next: Scalar Return, Prev: Stack Arguments, Up: Stack and Calling
  27783. 18.9.7 Passing Arguments in Registers
  27784. -------------------------------------
  27785. This section describes the macros which let you control how various
  27786. types of arguments are passed in registers or how they are arranged in
  27787. the stack.
  27788. -- Target Hook: rtx TARGET_FUNCTION_ARG (cumulative_args_t CA, const
  27789. function_arg_info &ARG)
  27790. Return an RTX indicating whether function argument ARG is passed in
  27791. a register and if so, which register. Argument CA summarizes all
  27792. the previous arguments.
  27793. The return value is usually either a 'reg' RTX for the hard
  27794. register in which to pass the argument, or zero to pass the
  27795. argument on the stack.
  27796. The return value can be a 'const_int' which means argument is
  27797. passed in a target specific slot with specified number. Target
  27798. hooks should be used to store or load argument in such case. See
  27799. 'TARGET_STORE_BOUNDS_FOR_ARG' and 'TARGET_LOAD_BOUNDS_FOR_ARG' for
  27800. more information.
  27801. The value of the expression can also be a 'parallel' RTX. This is
  27802. used when an argument is passed in multiple locations. The mode of
  27803. the 'parallel' should be the mode of the entire argument. The
  27804. 'parallel' holds any number of 'expr_list' pairs; each one
  27805. describes where part of the argument is passed. In each
  27806. 'expr_list' the first operand must be a 'reg' RTX for the hard
  27807. register in which to pass this part of the argument, and the mode
  27808. of the register RTX indicates how large this part of the argument
  27809. is. The second operand of the 'expr_list' is a 'const_int' which
  27810. gives the offset in bytes into the entire argument of where this
  27811. part starts. As a special exception the first 'expr_list' in the
  27812. 'parallel' RTX may have a first operand of zero. This indicates
  27813. that the entire argument is also stored on the stack.
  27814. The last time this hook is called, it is called with 'MODE ==
  27815. VOIDmode', and its result is passed to the 'call' or 'call_value'
  27816. pattern as operands 2 and 3 respectively.
  27817. The usual way to make the ISO library 'stdarg.h' work on a machine
  27818. where some arguments are usually passed in registers, is to cause
  27819. nameless arguments to be passed on the stack instead. This is done
  27820. by making 'TARGET_FUNCTION_ARG' return 0 whenever NAMED is 'false'.
  27821. You may use the hook 'targetm.calls.must_pass_in_stack' in the
  27822. definition of this macro to determine if this argument is of a type
  27823. that must be passed in the stack. If 'REG_PARM_STACK_SPACE' is not
  27824. defined and 'TARGET_FUNCTION_ARG' returns nonzero for such an
  27825. argument, the compiler will abort. If 'REG_PARM_STACK_SPACE' is
  27826. defined, the argument will be computed in the stack and then loaded
  27827. into a register.
  27828. -- Target Hook: bool TARGET_MUST_PASS_IN_STACK (const function_arg_info
  27829. &ARG)
  27830. This target hook should return 'true' if we should not pass ARG
  27831. solely in registers. The file 'expr.h' defines a definition that
  27832. is usually appropriate, refer to 'expr.h' for additional
  27833. documentation.
  27834. -- Target Hook: rtx TARGET_FUNCTION_INCOMING_ARG (cumulative_args_t CA,
  27835. const function_arg_info &ARG)
  27836. Define this hook if the caller and callee on the target have
  27837. different views of where arguments are passed. Also define this
  27838. hook if there are functions that are never directly called, but are
  27839. invoked by the hardware and which have nonstandard calling
  27840. conventions.
  27841. In this case 'TARGET_FUNCTION_ARG' computes the register in which
  27842. the caller passes the value, and 'TARGET_FUNCTION_INCOMING_ARG'
  27843. should be defined in a similar fashion to tell the function being
  27844. called where the arguments will arrive.
  27845. 'TARGET_FUNCTION_INCOMING_ARG' can also return arbitrary address
  27846. computation using hard register, which can be forced into a
  27847. register, so that it can be used to pass special arguments.
  27848. If 'TARGET_FUNCTION_INCOMING_ARG' is not defined,
  27849. 'TARGET_FUNCTION_ARG' serves both purposes.
  27850. -- Target Hook: bool TARGET_USE_PSEUDO_PIC_REG (void)
  27851. This hook should return 1 in case pseudo register should be created
  27852. for pic_offset_table_rtx during function expand.
  27853. -- Target Hook: void TARGET_INIT_PIC_REG (void)
  27854. Perform a target dependent initialization of pic_offset_table_rtx.
  27855. This hook is called at the start of register allocation.
  27856. -- Target Hook: int TARGET_ARG_PARTIAL_BYTES (cumulative_args_t CUM,
  27857. const function_arg_info &ARG)
  27858. This target hook returns the number of bytes at the beginning of an
  27859. argument that must be put in registers. The value must be zero for
  27860. arguments that are passed entirely in registers or that are
  27861. entirely pushed on the stack.
  27862. On some machines, certain arguments must be passed partially in
  27863. registers and partially in memory. On these machines, typically
  27864. the first few words of arguments are passed in registers, and the
  27865. rest on the stack. If a multi-word argument (a 'double' or a
  27866. structure) crosses that boundary, its first few words must be
  27867. passed in registers and the rest must be pushed. This macro tells
  27868. the compiler when this occurs, and how many bytes should go in
  27869. registers.
  27870. 'TARGET_FUNCTION_ARG' for these arguments should return the first
  27871. register to be used by the caller for this argument; likewise
  27872. 'TARGET_FUNCTION_INCOMING_ARG', for the called function.
  27873. -- Target Hook: bool TARGET_PASS_BY_REFERENCE (cumulative_args_t CUM,
  27874. const function_arg_info &ARG)
  27875. This target hook should return 'true' if argument ARG at the
  27876. position indicated by CUM should be passed by reference. This
  27877. predicate is queried after target independent reasons for being
  27878. passed by reference, such as 'TREE_ADDRESSABLE (ARG.type)'.
  27879. If the hook returns true, a copy of that argument is made in memory
  27880. and a pointer to the argument is passed instead of the argument
  27881. itself. The pointer is passed in whatever way is appropriate for
  27882. passing a pointer to that type.
  27883. -- Target Hook: bool TARGET_CALLEE_COPIES (cumulative_args_t CUM, const
  27884. function_arg_info &ARG)
  27885. The function argument described by the parameters to this hook is
  27886. known to be passed by reference. The hook should return true if
  27887. the function argument should be copied by the callee instead of
  27888. copied by the caller.
  27889. For any argument for which the hook returns true, if it can be
  27890. determined that the argument is not modified, then a copy need not
  27891. be generated.
  27892. The default version of this hook always returns false.
  27893. -- Macro: CUMULATIVE_ARGS
  27894. A C type for declaring a variable that is used as the first
  27895. argument of 'TARGET_FUNCTION_ARG' and other related values. For
  27896. some target machines, the type 'int' suffices and can hold the
  27897. number of bytes of argument so far.
  27898. There is no need to record in 'CUMULATIVE_ARGS' anything about the
  27899. arguments that have been passed on the stack. The compiler has
  27900. other variables to keep track of that. For target machines on
  27901. which all arguments are passed on the stack, there is no need to
  27902. store anything in 'CUMULATIVE_ARGS'; however, the data structure
  27903. must exist and should not be empty, so use 'int'.
  27904. -- Macro: OVERRIDE_ABI_FORMAT (FNDECL)
  27905. If defined, this macro is called before generating any code for a
  27906. function, but after the CFUN descriptor for the function has been
  27907. created. The back end may use this macro to update CFUN to reflect
  27908. an ABI other than that which would normally be used by default. If
  27909. the compiler is generating code for a compiler-generated function,
  27910. FNDECL may be 'NULL'.
  27911. -- Macro: INIT_CUMULATIVE_ARGS (CUM, FNTYPE, LIBNAME, FNDECL,
  27912. N_NAMED_ARGS)
  27913. A C statement (sans semicolon) for initializing the variable CUM
  27914. for the state at the beginning of the argument list. The variable
  27915. has type 'CUMULATIVE_ARGS'. The value of FNTYPE is the tree node
  27916. for the data type of the function which will receive the args, or 0
  27917. if the args are to a compiler support library function. For direct
  27918. calls that are not libcalls, FNDECL contain the declaration node of
  27919. the function. FNDECL is also set when 'INIT_CUMULATIVE_ARGS' is
  27920. used to find arguments for the function being compiled.
  27921. N_NAMED_ARGS is set to the number of named arguments, including a
  27922. structure return address if it is passed as a parameter, when
  27923. making a call. When processing incoming arguments, N_NAMED_ARGS is
  27924. set to -1.
  27925. When processing a call to a compiler support library function,
  27926. LIBNAME identifies which one. It is a 'symbol_ref' rtx which
  27927. contains the name of the function, as a string. LIBNAME is 0 when
  27928. an ordinary C function call is being processed. Thus, each time
  27929. this macro is called, either LIBNAME or FNTYPE is nonzero, but
  27930. never both of them at once.
  27931. -- Macro: INIT_CUMULATIVE_LIBCALL_ARGS (CUM, MODE, LIBNAME)
  27932. Like 'INIT_CUMULATIVE_ARGS' but only used for outgoing libcalls, it
  27933. gets a 'MODE' argument instead of FNTYPE, that would be 'NULL'.
  27934. INDIRECT would always be zero, too. If this macro is not defined,
  27935. 'INIT_CUMULATIVE_ARGS (cum, NULL_RTX, libname, 0)' is used instead.
  27936. -- Macro: INIT_CUMULATIVE_INCOMING_ARGS (CUM, FNTYPE, LIBNAME)
  27937. Like 'INIT_CUMULATIVE_ARGS' but overrides it for the purposes of
  27938. finding the arguments for the function being compiled. If this
  27939. macro is undefined, 'INIT_CUMULATIVE_ARGS' is used instead.
  27940. The value passed for LIBNAME is always 0, since library routines
  27941. with special calling conventions are never compiled with GCC. The
  27942. argument LIBNAME exists for symmetry with 'INIT_CUMULATIVE_ARGS'.
  27943. -- Target Hook: void TARGET_FUNCTION_ARG_ADVANCE (cumulative_args_t CA,
  27944. const function_arg_info &ARG)
  27945. This hook updates the summarizer variable pointed to by CA to
  27946. advance past argument ARG in the argument list. Once this is done,
  27947. the variable CUM is suitable for analyzing the _following_ argument
  27948. with 'TARGET_FUNCTION_ARG', etc.
  27949. This hook need not do anything if the argument in question was
  27950. passed on the stack. The compiler knows how to track the amount of
  27951. stack space used for arguments without any special help.
  27952. -- Target Hook: HOST_WIDE_INT TARGET_FUNCTION_ARG_OFFSET (machine_mode
  27953. MODE, const_tree TYPE)
  27954. This hook returns the number of bytes to add to the offset of an
  27955. argument of type TYPE and mode MODE when passed in memory. This is
  27956. needed for the SPU, which passes 'char' and 'short' arguments in
  27957. the preferred slot that is in the middle of the quad word instead
  27958. of starting at the top. The default implementation returns 0.
  27959. -- Target Hook: pad_direction TARGET_FUNCTION_ARG_PADDING (machine_mode
  27960. MODE, const_tree TYPE)
  27961. This hook determines whether, and in which direction, to pad out an
  27962. argument of mode MODE and type TYPE. It returns 'PAD_UPWARD' to
  27963. insert padding above the argument, 'PAD_DOWNWARD' to insert padding
  27964. below the argument, or 'PAD_NONE' to inhibit padding.
  27965. The _amount_ of padding is not controlled by this hook, but by
  27966. 'TARGET_FUNCTION_ARG_ROUND_BOUNDARY'. It is always just enough to
  27967. reach the next multiple of that boundary.
  27968. This hook has a default definition that is right for most systems.
  27969. For little-endian machines, the default is to pad upward. For
  27970. big-endian machines, the default is to pad downward for an argument
  27971. of constant size shorter than an 'int', and upward otherwise.
  27972. -- Macro: PAD_VARARGS_DOWN
  27973. If defined, a C expression which determines whether the default
  27974. implementation of va_arg will attempt to pad down before reading
  27975. the next argument, if that argument is smaller than its aligned
  27976. space as controlled by 'PARM_BOUNDARY'. If this macro is not
  27977. defined, all such arguments are padded down if 'BYTES_BIG_ENDIAN'
  27978. is true.
  27979. -- Macro: BLOCK_REG_PADDING (MODE, TYPE, FIRST)
  27980. Specify padding for the last element of a block move between
  27981. registers and memory. FIRST is nonzero if this is the only
  27982. element. Defining this macro allows better control of register
  27983. function parameters on big-endian machines, without using
  27984. 'PARALLEL' rtl. In particular, 'MUST_PASS_IN_STACK' need not test
  27985. padding and mode of types in registers, as there is no longer a
  27986. "wrong" part of a register; For example, a three byte aggregate may
  27987. be passed in the high part of a register if so required.
  27988. -- Target Hook: unsigned int TARGET_FUNCTION_ARG_BOUNDARY (machine_mode
  27989. MODE, const_tree TYPE)
  27990. This hook returns the alignment boundary, in bits, of an argument
  27991. with the specified mode and type. The default hook returns
  27992. 'PARM_BOUNDARY' for all arguments.
  27993. -- Target Hook: unsigned int TARGET_FUNCTION_ARG_ROUND_BOUNDARY
  27994. (machine_mode MODE, const_tree TYPE)
  27995. Normally, the size of an argument is rounded up to 'PARM_BOUNDARY',
  27996. which is the default value for this hook. You can define this hook
  27997. to return a different value if an argument size must be rounded to
  27998. a larger value.
  27999. -- Macro: FUNCTION_ARG_REGNO_P (REGNO)
  28000. A C expression that is nonzero if REGNO is the number of a hard
  28001. register in which function arguments are sometimes passed. This
  28002. does _not_ include implicit arguments such as the static chain and
  28003. the structure-value address. On many machines, no registers can be
  28004. used for this purpose since all function arguments are pushed on
  28005. the stack.
  28006. -- Target Hook: bool TARGET_SPLIT_COMPLEX_ARG (const_tree TYPE)
  28007. This hook should return true if parameter of type TYPE are passed
  28008. as two scalar parameters. By default, GCC will attempt to pack
  28009. complex arguments into the target's word size. Some ABIs require
  28010. complex arguments to be split and treated as their individual
  28011. components. For example, on AIX64, complex floats should be passed
  28012. in a pair of floating point registers, even though a complex float
  28013. would fit in one 64-bit floating point register.
  28014. The default value of this hook is 'NULL', which is treated as
  28015. always false.
  28016. -- Target Hook: tree TARGET_BUILD_BUILTIN_VA_LIST (void)
  28017. This hook returns a type node for 'va_list' for the target. The
  28018. default version of the hook returns 'void*'.
  28019. -- Target Hook: int TARGET_ENUM_VA_LIST_P (int IDX, const char **PNAME,
  28020. tree *PTREE)
  28021. This target hook is used in function 'c_common_nodes_and_builtins'
  28022. to iterate through the target specific builtin types for va_list.
  28023. The variable IDX is used as iterator. PNAME has to be a pointer to
  28024. a 'const char *' and PTREE a pointer to a 'tree' typed variable.
  28025. The arguments PNAME and PTREE are used to store the result of this
  28026. macro and are set to the name of the va_list builtin type and its
  28027. internal type. If the return value of this macro is zero, then
  28028. there is no more element. Otherwise the IDX should be increased
  28029. for the next call of this macro to iterate through all types.
  28030. -- Target Hook: tree TARGET_FN_ABI_VA_LIST (tree FNDECL)
  28031. This hook returns the va_list type of the calling convention
  28032. specified by FNDECL. The default version of this hook returns
  28033. 'va_list_type_node'.
  28034. -- Target Hook: tree TARGET_CANONICAL_VA_LIST_TYPE (tree TYPE)
  28035. This hook returns the va_list type of the calling convention
  28036. specified by the type of TYPE. If TYPE is not a valid va_list
  28037. type, it returns 'NULL_TREE'.
  28038. -- Target Hook: tree TARGET_GIMPLIFY_VA_ARG_EXPR (tree VALIST, tree
  28039. TYPE, gimple_seq *PRE_P, gimple_seq *POST_P)
  28040. This hook performs target-specific gimplification of 'VA_ARG_EXPR'.
  28041. The first two parameters correspond to the arguments to 'va_arg';
  28042. the latter two are as in 'gimplify.c:gimplify_expr'.
  28043. -- Target Hook: bool TARGET_VALID_POINTER_MODE (scalar_int_mode MODE)
  28044. Define this to return nonzero if the port can handle pointers with
  28045. machine mode MODE. The default version of this hook returns true
  28046. for both 'ptr_mode' and 'Pmode'.
  28047. -- Target Hook: bool TARGET_REF_MAY_ALIAS_ERRNO (ao_ref *REF)
  28048. Define this to return nonzero if the memory reference REF may alias
  28049. with the system C library errno location. The default version of
  28050. this hook assumes the system C library errno location is either a
  28051. declaration of type int or accessed by dereferencing a pointer to
  28052. int.
  28053. -- Target Hook: machine_mode TARGET_TRANSLATE_MODE_ATTRIBUTE
  28054. (machine_mode MODE)
  28055. Define this hook if during mode attribute processing, the port
  28056. should translate machine_mode MODE to another mode. For example,
  28057. rs6000's 'KFmode', when it is the same as 'TFmode'.
  28058. The default version of the hook returns that mode that was passed
  28059. in.
  28060. -- Target Hook: bool TARGET_SCALAR_MODE_SUPPORTED_P (scalar_mode MODE)
  28061. Define this to return nonzero if the port is prepared to handle
  28062. insns involving scalar mode MODE. For a scalar mode to be
  28063. considered supported, all the basic arithmetic and comparisons must
  28064. work.
  28065. The default version of this hook returns true for any mode required
  28066. to handle the basic C types (as defined by the port). Included
  28067. here are the double-word arithmetic supported by the code in
  28068. 'optabs.c'.
  28069. -- Target Hook: bool TARGET_VECTOR_MODE_SUPPORTED_P (machine_mode MODE)
  28070. Define this to return nonzero if the port is prepared to handle
  28071. insns involving vector mode MODE. At the very least, it must have
  28072. move patterns for this mode.
  28073. -- Target Hook: bool TARGET_COMPATIBLE_VECTOR_TYPES_P (const_tree
  28074. TYPE1, const_tree TYPE2)
  28075. Return true if there is no target-specific reason for treating
  28076. vector types TYPE1 and TYPE2 as distinct types. The caller has
  28077. already checked for target-independent reasons, meaning that the
  28078. types are known to have the same mode, to have the same number of
  28079. elements, and to have what the caller considers to be compatible
  28080. element types.
  28081. The main reason for defining this hook is to reject pairs of types
  28082. that are handled differently by the target's calling convention.
  28083. For example, when a new N-bit vector architecture is added to a
  28084. target, the target may want to handle normal N-bit 'VECTOR_TYPE'
  28085. arguments and return values in the same way as before, to maintain
  28086. backwards compatibility. However, it may also provide new,
  28087. architecture-specific 'VECTOR_TYPE's that are passed and returned
  28088. in a more efficient way. It is then important to maintain a
  28089. distinction between the "normal" 'VECTOR_TYPE's and the new
  28090. architecture-specific ones.
  28091. The default implementation returns true, which is correct for most
  28092. targets.
  28093. -- Target Hook: opt_machine_mode TARGET_ARRAY_MODE (machine_mode MODE,
  28094. unsigned HOST_WIDE_INT NELEMS)
  28095. Return the mode that GCC should use for an array that has NELEMS
  28096. elements, with each element having mode MODE. Return no mode if
  28097. the target has no special requirements. In the latter case, GCC
  28098. looks for an integer mode of the appropriate size if available and
  28099. uses BLKmode otherwise. Usually the search for the integer mode is
  28100. limited to 'MAX_FIXED_MODE_SIZE', but the
  28101. 'TARGET_ARRAY_MODE_SUPPORTED_P' hook allows a larger mode to be
  28102. used in specific cases.
  28103. The main use of this hook is to specify that an array of vectors
  28104. should also have a vector mode. The default implementation returns
  28105. no mode.
  28106. -- Target Hook: bool TARGET_ARRAY_MODE_SUPPORTED_P (machine_mode MODE,
  28107. unsigned HOST_WIDE_INT NELEMS)
  28108. Return true if GCC should try to use a scalar mode to store an
  28109. array of NELEMS elements, given that each element has mode MODE.
  28110. Returning true here overrides the usual 'MAX_FIXED_MODE' limit and
  28111. allows GCC to use any defined integer mode.
  28112. One use of this hook is to support vector load and store operations
  28113. that operate on several homogeneous vectors. For example, ARM NEON
  28114. has operations like:
  28115. int8x8x3_t vld3_s8 (const int8_t *)
  28116. where the return type is defined as:
  28117. typedef struct int8x8x3_t
  28118. {
  28119. int8x8_t val[3];
  28120. } int8x8x3_t;
  28121. If this hook allows 'val' to have a scalar mode, then 'int8x8x3_t'
  28122. can have the same mode. GCC can then store 'int8x8x3_t's in
  28123. registers rather than forcing them onto the stack.
  28124. -- Target Hook: bool TARGET_LIBGCC_FLOATING_MODE_SUPPORTED_P
  28125. (scalar_float_mode MODE)
  28126. Define this to return nonzero if libgcc provides support for the
  28127. floating-point mode MODE, which is known to pass
  28128. 'TARGET_SCALAR_MODE_SUPPORTED_P'. The default version of this hook
  28129. returns true for all of 'SFmode', 'DFmode', 'XFmode' and 'TFmode',
  28130. if such modes exist.
  28131. -- Target Hook: opt_scalar_float_mode TARGET_FLOATN_MODE (int N, bool
  28132. EXTENDED)
  28133. Define this to return the machine mode to use for the type
  28134. '_FloatN', if EXTENDED is false, or the type '_FloatNx', if
  28135. EXTENDED is true. If such a type is not supported, return
  28136. 'opt_scalar_float_mode ()'. The default version of this hook
  28137. returns 'SFmode' for '_Float32', 'DFmode' for '_Float64' and
  28138. '_Float32x' and 'TFmode' for '_Float128', if those modes exist and
  28139. satisfy the requirements for those types and pass
  28140. 'TARGET_SCALAR_MODE_SUPPORTED_P' and
  28141. 'TARGET_LIBGCC_FLOATING_MODE_SUPPORTED_P'; for '_Float64x', it
  28142. returns the first of 'XFmode' and 'TFmode' that exists and
  28143. satisfies the same requirements; for other types, it returns
  28144. 'opt_scalar_float_mode ()'. The hook is only called for values of
  28145. N and EXTENDED that are valid according to ISO/IEC TS 18661-3:2015;
  28146. that is, N is one of 32, 64, 128, or, if EXTENDED is false, 16 or
  28147. greater than 128 and a multiple of 32.
  28148. -- Target Hook: bool TARGET_FLOATN_BUILTIN_P (int FUNC)
  28149. Define this to return true if the '_FloatN' and '_FloatNx' built-in
  28150. functions should implicitly enable the built-in function without
  28151. the '__builtin_' prefix in addition to the normal built-in function
  28152. with the '__builtin_' prefix. The default is to only enable
  28153. built-in functions without the '__builtin_' prefix for the GNU C
  28154. langauge. In strict ANSI/ISO mode, the built-in function without
  28155. the '__builtin_' prefix is not enabled. The argument 'FUNC' is the
  28156. 'enum built_in_function' id of the function to be enabled.
  28157. -- Target Hook: bool TARGET_SMALL_REGISTER_CLASSES_FOR_MODE_P
  28158. (machine_mode MODE)
  28159. Define this to return nonzero for machine modes for which the port
  28160. has small register classes. If this target hook returns nonzero
  28161. for a given MODE, the compiler will try to minimize the lifetime of
  28162. registers in MODE. The hook may be called with 'VOIDmode' as
  28163. argument. In this case, the hook is expected to return nonzero if
  28164. it returns nonzero for any mode.
  28165. On some machines, it is risky to let hard registers live across
  28166. arbitrary insns. Typically, these machines have instructions that
  28167. require values to be in specific registers (like an accumulator),
  28168. and reload will fail if the required hard register is used for
  28169. another purpose across such an insn.
  28170. Passes before reload do not know which hard registers will be used
  28171. in an instruction, but the machine modes of the registers set or
  28172. used in the instruction are already known. And for some machines,
  28173. register classes are small for, say, integer registers but not for
  28174. floating point registers. For example, the AMD x86-64 architecture
  28175. requires specific registers for the legacy x86 integer
  28176. instructions, but there are many SSE registers for floating point
  28177. operations. On such targets, a good strategy may be to return
  28178. nonzero from this hook for 'INTEGRAL_MODE_P' machine modes but zero
  28179. for the SSE register classes.
  28180. The default version of this hook returns false for any mode. It is
  28181. always safe to redefine this hook to return with a nonzero value.
  28182. But if you unnecessarily define it, you will reduce the amount of
  28183. optimizations that can be performed in some cases. If you do not
  28184. define this hook to return a nonzero value when it is required, the
  28185. compiler will run out of spill registers and print a fatal error
  28186. message.
  28187. 
  28188. File: gccint.info, Node: Scalar Return, Next: Aggregate Return, Prev: Register Arguments, Up: Stack and Calling
  28189. 18.9.8 How Scalar Function Values Are Returned
  28190. ----------------------------------------------
  28191. This section discusses the macros that control returning scalars as
  28192. values--values that can fit in registers.
  28193. -- Target Hook: rtx TARGET_FUNCTION_VALUE (const_tree RET_TYPE,
  28194. const_tree FN_DECL_OR_TYPE, bool OUTGOING)
  28195. Define this to return an RTX representing the place where a
  28196. function returns or receives a value of data type RET_TYPE, a tree
  28197. node representing a data type. FN_DECL_OR_TYPE is a tree node
  28198. representing 'FUNCTION_DECL' or 'FUNCTION_TYPE' of a function being
  28199. called. If OUTGOING is false, the hook should compute the register
  28200. in which the caller will see the return value. Otherwise, the hook
  28201. should return an RTX representing the place where a function
  28202. returns a value.
  28203. On many machines, only 'TYPE_MODE (RET_TYPE)' is relevant.
  28204. (Actually, on most machines, scalar values are returned in the same
  28205. place regardless of mode.) The value of the expression is usually
  28206. a 'reg' RTX for the hard register where the return value is stored.
  28207. The value can also be a 'parallel' RTX, if the return value is in
  28208. multiple places. See 'TARGET_FUNCTION_ARG' for an explanation of
  28209. the 'parallel' form. Note that the callee will populate every
  28210. location specified in the 'parallel', but if the first element of
  28211. the 'parallel' contains the whole return value, callers will use
  28212. that element as the canonical location and ignore the others. The
  28213. m68k port uses this type of 'parallel' to return pointers in both
  28214. '%a0' (the canonical location) and '%d0'.
  28215. If 'TARGET_PROMOTE_FUNCTION_RETURN' returns true, you must apply
  28216. the same promotion rules specified in 'PROMOTE_MODE' if VALTYPE is
  28217. a scalar type.
  28218. If the precise function being called is known, FUNC is a tree node
  28219. ('FUNCTION_DECL') for it; otherwise, FUNC is a null pointer. This
  28220. makes it possible to use a different value-returning convention for
  28221. specific functions when all their calls are known.
  28222. Some target machines have "register windows" so that the register
  28223. in which a function returns its value is not the same as the one in
  28224. which the caller sees the value. For such machines, you should
  28225. return different RTX depending on OUTGOING.
  28226. 'TARGET_FUNCTION_VALUE' is not used for return values with
  28227. aggregate data types, because these are returned in another way.
  28228. See 'TARGET_STRUCT_VALUE_RTX' and related macros, below.
  28229. -- Macro: FUNCTION_VALUE (VALTYPE, FUNC)
  28230. This macro has been deprecated. Use 'TARGET_FUNCTION_VALUE' for a
  28231. new target instead.
  28232. -- Macro: LIBCALL_VALUE (MODE)
  28233. A C expression to create an RTX representing the place where a
  28234. library function returns a value of mode MODE.
  28235. Note that "library function" in this context means a compiler
  28236. support routine, used to perform arithmetic, whose name is known
  28237. specially by the compiler and was not mentioned in the C code being
  28238. compiled.
  28239. -- Target Hook: rtx TARGET_LIBCALL_VALUE (machine_mode MODE, const_rtx
  28240. FUN)
  28241. Define this hook if the back-end needs to know the name of the
  28242. libcall function in order to determine where the result should be
  28243. returned.
  28244. The mode of the result is given by MODE and the name of the called
  28245. library function is given by FUN. The hook should return an RTX
  28246. representing the place where the library function result will be
  28247. returned.
  28248. If this hook is not defined, then LIBCALL_VALUE will be used.
  28249. -- Macro: FUNCTION_VALUE_REGNO_P (REGNO)
  28250. A C expression that is nonzero if REGNO is the number of a hard
  28251. register in which the values of called function may come back.
  28252. A register whose use for returning values is limited to serving as
  28253. the second of a pair (for a value of type 'double', say) need not
  28254. be recognized by this macro. So for most machines, this definition
  28255. suffices:
  28256. #define FUNCTION_VALUE_REGNO_P(N) ((N) == 0)
  28257. If the machine has register windows, so that the caller and the
  28258. called function use different registers for the return value, this
  28259. macro should recognize only the caller's register numbers.
  28260. This macro has been deprecated. Use
  28261. 'TARGET_FUNCTION_VALUE_REGNO_P' for a new target instead.
  28262. -- Target Hook: bool TARGET_FUNCTION_VALUE_REGNO_P (const unsigned int
  28263. REGNO)
  28264. A target hook that return 'true' if REGNO is the number of a hard
  28265. register in which the values of called function may come back.
  28266. A register whose use for returning values is limited to serving as
  28267. the second of a pair (for a value of type 'double', say) need not
  28268. be recognized by this target hook.
  28269. If the machine has register windows, so that the caller and the
  28270. called function use different registers for the return value, this
  28271. target hook should recognize only the caller's register numbers.
  28272. If this hook is not defined, then FUNCTION_VALUE_REGNO_P will be
  28273. used.
  28274. -- Macro: APPLY_RESULT_SIZE
  28275. Define this macro if 'untyped_call' and 'untyped_return' need more
  28276. space than is implied by 'FUNCTION_VALUE_REGNO_P' for saving and
  28277. restoring an arbitrary return value.
  28278. -- Target Hook: bool TARGET_OMIT_STRUCT_RETURN_REG
  28279. Normally, when a function returns a structure by memory, the
  28280. address is passed as an invisible pointer argument, but the
  28281. compiler also arranges to return the address from the function like
  28282. it would a normal pointer return value. Define this to true if
  28283. that behavior is undesirable on your target.
  28284. -- Target Hook: bool TARGET_RETURN_IN_MSB (const_tree TYPE)
  28285. This hook should return true if values of type TYPE are returned at
  28286. the most significant end of a register (in other words, if they are
  28287. padded at the least significant end). You can assume that TYPE is
  28288. returned in a register; the caller is required to check this.
  28289. Note that the register provided by 'TARGET_FUNCTION_VALUE' must be
  28290. able to hold the complete return value. For example, if a 1-, 2-
  28291. or 3-byte structure is returned at the most significant end of a
  28292. 4-byte register, 'TARGET_FUNCTION_VALUE' should provide an 'SImode'
  28293. rtx.
  28294. 
  28295. File: gccint.info, Node: Aggregate Return, Next: Caller Saves, Prev: Scalar Return, Up: Stack and Calling
  28296. 18.9.9 How Large Values Are Returned
  28297. ------------------------------------
  28298. When a function value's mode is 'BLKmode' (and in some other cases), the
  28299. value is not returned according to 'TARGET_FUNCTION_VALUE' (*note Scalar
  28300. Return::). Instead, the caller passes the address of a block of memory
  28301. in which the value should be stored. This address is called the
  28302. "structure value address".
  28303. This section describes how to control returning structure values in
  28304. memory.
  28305. -- Target Hook: bool TARGET_RETURN_IN_MEMORY (const_tree TYPE,
  28306. const_tree FNTYPE)
  28307. This target hook should return a nonzero value to say to return the
  28308. function value in memory, just as large structures are always
  28309. returned. Here TYPE will be the data type of the value, and FNTYPE
  28310. will be the type of the function doing the returning, or 'NULL' for
  28311. libcalls.
  28312. Note that values of mode 'BLKmode' must be explicitly handled by
  28313. this function. Also, the option '-fpcc-struct-return' takes effect
  28314. regardless of this macro. On most systems, it is possible to leave
  28315. the hook undefined; this causes a default definition to be used,
  28316. whose value is the constant 1 for 'BLKmode' values, and 0
  28317. otherwise.
  28318. Do not use this hook to indicate that structures and unions should
  28319. always be returned in memory. You should instead use
  28320. 'DEFAULT_PCC_STRUCT_RETURN' to indicate this.
  28321. -- Macro: DEFAULT_PCC_STRUCT_RETURN
  28322. Define this macro to be 1 if all structure and union return values
  28323. must be in memory. Since this results in slower code, this should
  28324. be defined only if needed for compatibility with other compilers or
  28325. with an ABI. If you define this macro to be 0, then the
  28326. conventions used for structure and union return values are decided
  28327. by the 'TARGET_RETURN_IN_MEMORY' target hook.
  28328. If not defined, this defaults to the value 1.
  28329. -- Target Hook: rtx TARGET_STRUCT_VALUE_RTX (tree FNDECL, int INCOMING)
  28330. This target hook should return the location of the structure value
  28331. address (normally a 'mem' or 'reg'), or 0 if the address is passed
  28332. as an "invisible" first argument. Note that FNDECL may be 'NULL',
  28333. for libcalls. You do not need to define this target hook if the
  28334. address is always passed as an "invisible" first argument.
  28335. On some architectures the place where the structure value address
  28336. is found by the called function is not the same place that the
  28337. caller put it. This can be due to register windows, or it could be
  28338. because the function prologue moves it to a different place.
  28339. INCOMING is '1' or '2' when the location is needed in the context
  28340. of the called function, and '0' in the context of the caller.
  28341. If INCOMING is nonzero and the address is to be found on the stack,
  28342. return a 'mem' which refers to the frame pointer. If INCOMING is
  28343. '2', the result is being used to fetch the structure value address
  28344. at the beginning of a function. If you need to emit adjusting
  28345. code, you should do it at this point.
  28346. -- Macro: PCC_STATIC_STRUCT_RETURN
  28347. Define this macro if the usual system convention on the target
  28348. machine for returning structures and unions is for the called
  28349. function to return the address of a static variable containing the
  28350. value.
  28351. Do not define this if the usual system convention is for the caller
  28352. to pass an address to the subroutine.
  28353. This macro has effect in '-fpcc-struct-return' mode, but it does
  28354. nothing when you use '-freg-struct-return' mode.
  28355. -- Target Hook: fixed_size_mode TARGET_GET_RAW_RESULT_MODE (int REGNO)
  28356. This target hook returns the mode to be used when accessing raw
  28357. return registers in '__builtin_return'. Define this macro if the
  28358. value in REG_RAW_MODE is not correct.
  28359. -- Target Hook: fixed_size_mode TARGET_GET_RAW_ARG_MODE (int REGNO)
  28360. This target hook returns the mode to be used when accessing raw
  28361. argument registers in '__builtin_apply_args'. Define this macro if
  28362. the value in REG_RAW_MODE is not correct.
  28363. -- Target Hook: bool TARGET_EMPTY_RECORD_P (const_tree TYPE)
  28364. This target hook returns true if the type is an empty record. The
  28365. default is to return 'false'.
  28366. -- Target Hook: void TARGET_WARN_PARAMETER_PASSING_ABI
  28367. (cumulative_args_t CA, tree TYPE)
  28368. This target hook warns about the change in empty class parameter
  28369. passing ABI.
  28370. 
  28371. File: gccint.info, Node: Caller Saves, Next: Function Entry, Prev: Aggregate Return, Up: Stack and Calling
  28372. 18.9.10 Caller-Saves Register Allocation
  28373. ----------------------------------------
  28374. If you enable it, GCC can save registers around function calls. This
  28375. makes it possible to use call-clobbered registers to hold variables that
  28376. must live across calls.
  28377. -- Macro: HARD_REGNO_CALLER_SAVE_MODE (REGNO, NREGS)
  28378. A C expression specifying which mode is required for saving NREGS
  28379. of a pseudo-register in call-clobbered hard register REGNO. If
  28380. REGNO is unsuitable for caller save, 'VOIDmode' should be returned.
  28381. For most machines this macro need not be defined since GCC will
  28382. select the smallest suitable mode.
  28383. 
  28384. File: gccint.info, Node: Function Entry, Next: Profiling, Prev: Caller Saves, Up: Stack and Calling
  28385. 18.9.11 Function Entry and Exit
  28386. -------------------------------
  28387. This section describes the macros that output function entry
  28388. ("prologue") and exit ("epilogue") code.
  28389. -- Target Hook: void TARGET_ASM_PRINT_PATCHABLE_FUNCTION_ENTRY (FILE
  28390. *FILE, unsigned HOST_WIDE_INT PATCH_AREA_SIZE, bool RECORD_P)
  28391. Generate a patchable area at the function start, consisting of
  28392. PATCH_AREA_SIZE NOP instructions. If the target supports named
  28393. sections and if RECORD_P is true, insert a pointer to the current
  28394. location in the table of patchable functions. The default
  28395. implementation of the hook places the table of pointers in the
  28396. special section named '__patchable_function_entries'.
  28397. -- Target Hook: void TARGET_ASM_FUNCTION_PROLOGUE (FILE *FILE)
  28398. If defined, a function that outputs the assembler code for entry to
  28399. a function. The prologue is responsible for setting up the stack
  28400. frame, initializing the frame pointer register, saving registers
  28401. that must be saved, and allocating SIZE additional bytes of storage
  28402. for the local variables. FILE is a stdio stream to which the
  28403. assembler code should be output.
  28404. The label for the beginning of the function need not be output by
  28405. this macro. That has already been done when the macro is run.
  28406. To determine which registers to save, the macro can refer to the
  28407. array 'regs_ever_live': element R is nonzero if hard register R is
  28408. used anywhere within the function. This implies the function
  28409. prologue should save register R, provided it is not one of the
  28410. call-used registers. ('TARGET_ASM_FUNCTION_EPILOGUE' must likewise
  28411. use 'regs_ever_live'.)
  28412. On machines that have "register windows", the function entry code
  28413. does not save on the stack the registers that are in the windows,
  28414. even if they are supposed to be preserved by function calls;
  28415. instead it takes appropriate steps to "push" the register stack, if
  28416. any non-call-used registers are used in the function.
  28417. On machines where functions may or may not have frame-pointers, the
  28418. function entry code must vary accordingly; it must set up the frame
  28419. pointer if one is wanted, and not otherwise. To determine whether
  28420. a frame pointer is in wanted, the macro can refer to the variable
  28421. 'frame_pointer_needed'. The variable's value will be 1 at run time
  28422. in a function that needs a frame pointer. *Note Elimination::.
  28423. The function entry code is responsible for allocating any stack
  28424. space required for the function. This stack space consists of the
  28425. regions listed below. In most cases, these regions are allocated
  28426. in the order listed, with the last listed region closest to the top
  28427. of the stack (the lowest address if 'STACK_GROWS_DOWNWARD' is
  28428. defined, and the highest address if it is not defined). You can
  28429. use a different order for a machine if doing so is more convenient
  28430. or required for compatibility reasons. Except in cases where
  28431. required by standard or by a debugger, there is no reason why the
  28432. stack layout used by GCC need agree with that used by other
  28433. compilers for a machine.
  28434. -- Target Hook: void TARGET_ASM_FUNCTION_END_PROLOGUE (FILE *FILE)
  28435. If defined, a function that outputs assembler code at the end of a
  28436. prologue. This should be used when the function prologue is being
  28437. emitted as RTL, and you have some extra assembler that needs to be
  28438. emitted. *Note prologue instruction pattern::.
  28439. -- Target Hook: void TARGET_ASM_FUNCTION_BEGIN_EPILOGUE (FILE *FILE)
  28440. If defined, a function that outputs assembler code at the start of
  28441. an epilogue. This should be used when the function epilogue is
  28442. being emitted as RTL, and you have some extra assembler that needs
  28443. to be emitted. *Note epilogue instruction pattern::.
  28444. -- Target Hook: void TARGET_ASM_FUNCTION_EPILOGUE (FILE *FILE)
  28445. If defined, a function that outputs the assembler code for exit
  28446. from a function. The epilogue is responsible for restoring the
  28447. saved registers and stack pointer to their values when the function
  28448. was called, and returning control to the caller. This macro takes
  28449. the same argument as the macro 'TARGET_ASM_FUNCTION_PROLOGUE', and
  28450. the registers to restore are determined from 'regs_ever_live' and
  28451. 'CALL_USED_REGISTERS' in the same way.
  28452. On some machines, there is a single instruction that does all the
  28453. work of returning from the function. On these machines, give that
  28454. instruction the name 'return' and do not define the macro
  28455. 'TARGET_ASM_FUNCTION_EPILOGUE' at all.
  28456. Do not define a pattern named 'return' if you want the
  28457. 'TARGET_ASM_FUNCTION_EPILOGUE' to be used. If you want the target
  28458. switches to control whether return instructions or epilogues are
  28459. used, define a 'return' pattern with a validity condition that
  28460. tests the target switches appropriately. If the 'return' pattern's
  28461. validity condition is false, epilogues will be used.
  28462. On machines where functions may or may not have frame-pointers, the
  28463. function exit code must vary accordingly. Sometimes the code for
  28464. these two cases is completely different. To determine whether a
  28465. frame pointer is wanted, the macro can refer to the variable
  28466. 'frame_pointer_needed'. The variable's value will be 1 when
  28467. compiling a function that needs a frame pointer.
  28468. Normally, 'TARGET_ASM_FUNCTION_PROLOGUE' and
  28469. 'TARGET_ASM_FUNCTION_EPILOGUE' must treat leaf functions specially.
  28470. The C variable 'current_function_is_leaf' is nonzero for such a
  28471. function. *Note Leaf Functions::.
  28472. On some machines, some functions pop their arguments on exit while
  28473. others leave that for the caller to do. For example, the 68020
  28474. when given '-mrtd' pops arguments in functions that take a fixed
  28475. number of arguments.
  28476. Your definition of the macro 'RETURN_POPS_ARGS' decides which
  28477. functions pop their own arguments. 'TARGET_ASM_FUNCTION_EPILOGUE'
  28478. needs to know what was decided. The number of bytes of the current
  28479. function's arguments that this function should pop is available in
  28480. 'crtl->args.pops_args'. *Note Scalar Return::.
  28481. * A region of 'crtl->args.pretend_args_size' bytes of uninitialized
  28482. space just underneath the first argument arriving on the stack.
  28483. (This may not be at the very start of the allocated stack region if
  28484. the calling sequence has pushed anything else since pushing the
  28485. stack arguments. But usually, on such machines, nothing else has
  28486. been pushed yet, because the function prologue itself does all the
  28487. pushing.) This region is used on machines where an argument may be
  28488. passed partly in registers and partly in memory, and, in some cases
  28489. to support the features in '<stdarg.h>'.
  28490. * An area of memory used to save certain registers used by the
  28491. function. The size of this area, which may also include space for
  28492. such things as the return address and pointers to previous stack
  28493. frames, is machine-specific and usually depends on which registers
  28494. have been used in the function. Machines with register windows
  28495. often do not require a save area.
  28496. * A region of at least SIZE bytes, possibly rounded up to an
  28497. allocation boundary, to contain the local variables of the
  28498. function. On some machines, this region and the save area may
  28499. occur in the opposite order, with the save area closer to the top
  28500. of the stack.
  28501. * Optionally, when 'ACCUMULATE_OUTGOING_ARGS' is defined, a region of
  28502. 'crtl->outgoing_args_size' bytes to be used for outgoing argument
  28503. lists of the function. *Note Stack Arguments::.
  28504. -- Macro: EXIT_IGNORE_STACK
  28505. Define this macro as a C expression that is nonzero if the return
  28506. instruction or the function epilogue ignores the value of the stack
  28507. pointer; in other words, if it is safe to delete an instruction to
  28508. adjust the stack pointer before a return from the function. The
  28509. default is 0.
  28510. Note that this macro's value is relevant only for functions for
  28511. which frame pointers are maintained. It is never safe to delete a
  28512. final stack adjustment in a function that has no frame pointer, and
  28513. the compiler knows this regardless of 'EXIT_IGNORE_STACK'.
  28514. -- Macro: EPILOGUE_USES (REGNO)
  28515. Define this macro as a C expression that is nonzero for registers
  28516. that are used by the epilogue or the 'return' pattern. The stack
  28517. and frame pointer registers are already assumed to be used as
  28518. needed.
  28519. -- Macro: EH_USES (REGNO)
  28520. Define this macro as a C expression that is nonzero for registers
  28521. that are used by the exception handling mechanism, and so should be
  28522. considered live on entry to an exception edge.
  28523. -- Target Hook: void TARGET_ASM_OUTPUT_MI_THUNK (FILE *FILE, tree
  28524. THUNK_FNDECL, HOST_WIDE_INT DELTA, HOST_WIDE_INT VCALL_OFFSET,
  28525. tree FUNCTION)
  28526. A function that outputs the assembler code for a thunk function,
  28527. used to implement C++ virtual function calls with multiple
  28528. inheritance. The thunk acts as a wrapper around a virtual
  28529. function, adjusting the implicit object parameter before handing
  28530. control off to the real function.
  28531. First, emit code to add the integer DELTA to the location that
  28532. contains the incoming first argument. Assume that this argument
  28533. contains a pointer, and is the one used to pass the 'this' pointer
  28534. in C++. This is the incoming argument _before_ the function
  28535. prologue, e.g. '%o0' on a sparc. The addition must preserve the
  28536. values of all other incoming arguments.
  28537. Then, if VCALL_OFFSET is nonzero, an additional adjustment should
  28538. be made after adding 'delta'. In particular, if P is the adjusted
  28539. pointer, the following adjustment should be made:
  28540. p += (*((ptrdiff_t **)p))[vcall_offset/sizeof(ptrdiff_t)]
  28541. After the additions, emit code to jump to FUNCTION, which is a
  28542. 'FUNCTION_DECL'. This is a direct pure jump, not a call, and does
  28543. not touch the return address. Hence returning from FUNCTION will
  28544. return to whoever called the current 'thunk'.
  28545. The effect must be as if FUNCTION had been called directly with the
  28546. adjusted first argument. This macro is responsible for emitting
  28547. all of the code for a thunk function;
  28548. 'TARGET_ASM_FUNCTION_PROLOGUE' and 'TARGET_ASM_FUNCTION_EPILOGUE'
  28549. are not invoked.
  28550. The THUNK_FNDECL is redundant. (DELTA and FUNCTION have already
  28551. been extracted from it.) It might possibly be useful on some
  28552. targets, but probably not.
  28553. If you do not define this macro, the target-independent code in the
  28554. C++ front end will generate a less efficient heavyweight thunk that
  28555. calls FUNCTION instead of jumping to it. The generic approach does
  28556. not support varargs.
  28557. -- Target Hook: bool TARGET_ASM_CAN_OUTPUT_MI_THUNK (const_tree
  28558. THUNK_FNDECL, HOST_WIDE_INT DELTA, HOST_WIDE_INT VCALL_OFFSET,
  28559. const_tree FUNCTION)
  28560. A function that returns true if TARGET_ASM_OUTPUT_MI_THUNK would be
  28561. able to output the assembler code for the thunk function specified
  28562. by the arguments it is passed, and false otherwise. In the latter
  28563. case, the generic approach will be used by the C++ front end, with
  28564. the limitations previously exposed.
  28565. 
  28566. File: gccint.info, Node: Profiling, Next: Tail Calls, Prev: Function Entry, Up: Stack and Calling
  28567. 18.9.12 Generating Code for Profiling
  28568. -------------------------------------
  28569. These macros will help you generate code for profiling.
  28570. -- Macro: FUNCTION_PROFILER (FILE, LABELNO)
  28571. A C statement or compound statement to output to FILE some
  28572. assembler code to call the profiling subroutine 'mcount'.
  28573. The details of how 'mcount' expects to be called are determined by
  28574. your operating system environment, not by GCC. To figure them out,
  28575. compile a small program for profiling using the system's installed
  28576. C compiler and look at the assembler code that results.
  28577. Older implementations of 'mcount' expect the address of a counter
  28578. variable to be loaded into some register. The name of this
  28579. variable is 'LP' followed by the number LABELNO, so you would
  28580. generate the name using 'LP%d' in a 'fprintf'.
  28581. -- Macro: PROFILE_HOOK
  28582. A C statement or compound statement to output to FILE some assembly
  28583. code to call the profiling subroutine 'mcount' even the target does
  28584. not support profiling.
  28585. -- Macro: NO_PROFILE_COUNTERS
  28586. Define this macro to be an expression with a nonzero value if the
  28587. 'mcount' subroutine on your system does not need a counter variable
  28588. allocated for each function. This is true for almost all modern
  28589. implementations. If you define this macro, you must not use the
  28590. LABELNO argument to 'FUNCTION_PROFILER'.
  28591. -- Macro: PROFILE_BEFORE_PROLOGUE
  28592. Define this macro if the code for function profiling should come
  28593. before the function prologue. Normally, the profiling code comes
  28594. after.
  28595. -- Target Hook: bool TARGET_KEEP_LEAF_WHEN_PROFILED (void)
  28596. This target hook returns true if the target wants the leaf flag for
  28597. the current function to stay true even if it calls mcount. This
  28598. might make sense for targets using the leaf flag only to determine
  28599. whether a stack frame needs to be generated or not and for which
  28600. the call to mcount is generated before the function prologue.
  28601. 
  28602. File: gccint.info, Node: Tail Calls, Next: Shrink-wrapping separate components, Prev: Profiling, Up: Stack and Calling
  28603. 18.9.13 Permitting tail calls
  28604. -----------------------------
  28605. -- Target Hook: bool TARGET_FUNCTION_OK_FOR_SIBCALL (tree DECL, tree
  28606. EXP)
  28607. True if it is OK to do sibling call optimization for the specified
  28608. call expression EXP. DECL will be the called function, or 'NULL'
  28609. if this is an indirect call.
  28610. It is not uncommon for limitations of calling conventions to
  28611. prevent tail calls to functions outside the current unit of
  28612. translation, or during PIC compilation. The hook is used to
  28613. enforce these restrictions, as the 'sibcall' md pattern cannot
  28614. fail, or fall over to a "normal" call. The criteria for successful
  28615. sibling call optimization may vary greatly between different
  28616. architectures.
  28617. -- Target Hook: void TARGET_EXTRA_LIVE_ON_ENTRY (bitmap REGS)
  28618. Add any hard registers to REGS that are live on entry to the
  28619. function. This hook only needs to be defined to provide registers
  28620. that cannot be found by examination of FUNCTION_ARG_REGNO_P, the
  28621. callee saved registers, STATIC_CHAIN_INCOMING_REGNUM,
  28622. STATIC_CHAIN_REGNUM, TARGET_STRUCT_VALUE_RTX, FRAME_POINTER_REGNUM,
  28623. EH_USES, FRAME_POINTER_REGNUM, ARG_POINTER_REGNUM, and the
  28624. PIC_OFFSET_TABLE_REGNUM.
  28625. -- Target Hook: void TARGET_SET_UP_BY_PROLOGUE (struct
  28626. hard_reg_set_container *)
  28627. This hook should add additional registers that are computed by the
  28628. prologue to the hard regset for shrink-wrapping optimization
  28629. purposes.
  28630. -- Target Hook: bool TARGET_WARN_FUNC_RETURN (tree)
  28631. True if a function's return statements should be checked for
  28632. matching the function's return type. This includes checking for
  28633. falling off the end of a non-void function. Return false if no
  28634. such check should be made.
  28635. 
  28636. File: gccint.info, Node: Shrink-wrapping separate components, Next: Stack Smashing Protection, Prev: Tail Calls, Up: Stack and Calling
  28637. 18.9.14 Shrink-wrapping separate components
  28638. -------------------------------------------
  28639. The prologue may perform a variety of target dependent tasks such as
  28640. saving callee-saved registers, saving the return address, aligning the
  28641. stack, creating a stack frame, initializing the PIC register, setting up
  28642. the static chain, etc.
  28643. On some targets some of these tasks may be independent of others and
  28644. thus may be shrink-wrapped separately. These independent tasks are
  28645. referred to as components and are handled generically by the target
  28646. independent parts of GCC.
  28647. Using the following hooks those prologue or epilogue components can be
  28648. shrink-wrapped separately, so that the initialization (and possibly
  28649. teardown) those components do is not done as frequently on execution
  28650. paths where this would unnecessary.
  28651. What exactly those components are is up to the target code; the generic
  28652. code treats them abstractly, as a bit in an 'sbitmap'. These 'sbitmap's
  28653. are allocated by the 'shrink_wrap.get_separate_components' and
  28654. 'shrink_wrap.components_for_bb' hooks, and deallocated by the generic
  28655. code.
  28656. -- Target Hook: sbitmap TARGET_SHRINK_WRAP_GET_SEPARATE_COMPONENTS
  28657. (void)
  28658. This hook should return an 'sbitmap' with the bits set for those
  28659. components that can be separately shrink-wrapped in the current
  28660. function. Return 'NULL' if the current function should not get any
  28661. separate shrink-wrapping. Don't define this hook if it would
  28662. always return 'NULL'. If it is defined, the other hooks in this
  28663. group have to be defined as well.
  28664. -- Target Hook: sbitmap TARGET_SHRINK_WRAP_COMPONENTS_FOR_BB
  28665. (basic_block)
  28666. This hook should return an 'sbitmap' with the bits set for those
  28667. components where either the prologue component has to be executed
  28668. before the 'basic_block', or the epilogue component after it, or
  28669. both.
  28670. -- Target Hook: void TARGET_SHRINK_WRAP_DISQUALIFY_COMPONENTS (sbitmap
  28671. COMPONENTS, edge E, sbitmap EDGE_COMPONENTS, bool IS_PROLOGUE)
  28672. This hook should clear the bits in the COMPONENTS bitmap for those
  28673. components in EDGE_COMPONENTS that the target cannot handle on edge
  28674. E, where IS_PROLOGUE says if this is for a prologue or an epilogue
  28675. instead.
  28676. -- Target Hook: void TARGET_SHRINK_WRAP_EMIT_PROLOGUE_COMPONENTS
  28677. (sbitmap)
  28678. Emit prologue insns for the components indicated by the parameter.
  28679. -- Target Hook: void TARGET_SHRINK_WRAP_EMIT_EPILOGUE_COMPONENTS
  28680. (sbitmap)
  28681. Emit epilogue insns for the components indicated by the parameter.
  28682. -- Target Hook: void TARGET_SHRINK_WRAP_SET_HANDLED_COMPONENTS
  28683. (sbitmap)
  28684. Mark the components in the parameter as handled, so that the
  28685. 'prologue' and 'epilogue' named patterns know to ignore those
  28686. components. The target code should not hang on to the 'sbitmap',
  28687. it will be deleted after this call.
  28688. 
  28689. File: gccint.info, Node: Stack Smashing Protection, Next: Miscellaneous Register Hooks, Prev: Shrink-wrapping separate components, Up: Stack and Calling
  28690. 18.9.15 Stack smashing protection
  28691. ---------------------------------
  28692. -- Target Hook: tree TARGET_STACK_PROTECT_GUARD (void)
  28693. This hook returns a 'DECL' node for the external variable to use
  28694. for the stack protection guard. This variable is initialized by
  28695. the runtime to some random value and is used to initialize the
  28696. guard value that is placed at the top of the local stack frame.
  28697. The type of this variable must be 'ptr_type_node'.
  28698. The default version of this hook creates a variable called
  28699. '__stack_chk_guard', which is normally defined in 'libgcc2.c'.
  28700. -- Target Hook: tree TARGET_STACK_PROTECT_FAIL (void)
  28701. This hook returns a 'CALL_EXPR' that alerts the runtime that the
  28702. stack protect guard variable has been modified. This expression
  28703. should involve a call to a 'noreturn' function.
  28704. The default version of this hook invokes a function called
  28705. '__stack_chk_fail', taking no arguments. This function is normally
  28706. defined in 'libgcc2.c'.
  28707. -- Target Hook: bool TARGET_STACK_PROTECT_RUNTIME_ENABLED_P (void)
  28708. Returns true if the target wants GCC's default stack protect
  28709. runtime support, otherwise return false. The default
  28710. implementation always returns true.
  28711. -- Common Target Hook: bool TARGET_SUPPORTS_SPLIT_STACK (bool REPORT,
  28712. struct gcc_options *OPTS)
  28713. Whether this target supports splitting the stack when the options
  28714. described in OPTS have been passed. This is called after options
  28715. have been parsed, so the target may reject splitting the stack in
  28716. some configurations. The default version of this hook returns
  28717. false. If REPORT is true, this function may issue a warning or
  28718. error; if REPORT is false, it must simply return a value
  28719. -- Common Target Hook: vec<const char *> TARGET_GET_VALID_OPTION_VALUES
  28720. (int OPTION_CODE, const char *PREFIX)
  28721. The hook is used for options that have a non-trivial list of
  28722. possible option values. OPTION_CODE is option code of opt_code
  28723. enum type. PREFIX is used for bash completion and allows an
  28724. implementation to return more specific completion based on the
  28725. prefix. All string values should be allocated from heap memory and
  28726. consumers should release them. The result will be pruned to cases
  28727. with PREFIX if not NULL.
  28728. 
  28729. File: gccint.info, Node: Miscellaneous Register Hooks, Prev: Stack Smashing Protection, Up: Stack and Calling
  28730. 18.9.16 Miscellaneous register hooks
  28731. ------------------------------------
  28732. -- Target Hook: bool TARGET_CALL_FUSAGE_CONTAINS_NON_CALLEE_CLOBBERS
  28733. Set to true if each call that binds to a local definition
  28734. explicitly clobbers or sets all non-fixed registers modified by
  28735. performing the call. That is, by the call pattern itself, or by
  28736. code that might be inserted by the linker (e.g. stubs, veneers,
  28737. branch islands), but not including those modifiable by the callee.
  28738. The affected registers may be mentioned explicitly in the call
  28739. pattern, or included as clobbers in CALL_INSN_FUNCTION_USAGE. The
  28740. default version of this hook is set to false. The purpose of this
  28741. hook is to enable the fipa-ra optimization.
  28742. 
  28743. File: gccint.info, Node: Varargs, Next: Trampolines, Prev: Stack and Calling, Up: Target Macros
  28744. 18.10 Implementing the Varargs Macros
  28745. =====================================
  28746. GCC comes with an implementation of '<varargs.h>' and '<stdarg.h>' that
  28747. work without change on machines that pass arguments on the stack. Other
  28748. machines require their own implementations of varargs, and the two
  28749. machine independent header files must have conditionals to include it.
  28750. ISO '<stdarg.h>' differs from traditional '<varargs.h>' mainly in the
  28751. calling convention for 'va_start'. The traditional implementation takes
  28752. just one argument, which is the variable in which to store the argument
  28753. pointer. The ISO implementation of 'va_start' takes an additional
  28754. second argument. The user is supposed to write the last named argument
  28755. of the function here.
  28756. However, 'va_start' should not use this argument. The way to find the
  28757. end of the named arguments is with the built-in functions described
  28758. below.
  28759. -- Macro: __builtin_saveregs ()
  28760. Use this built-in function to save the argument registers in memory
  28761. so that the varargs mechanism can access them. Both ISO and
  28762. traditional versions of 'va_start' must use '__builtin_saveregs',
  28763. unless you use 'TARGET_SETUP_INCOMING_VARARGS' (see below) instead.
  28764. On some machines, '__builtin_saveregs' is open-coded under the
  28765. control of the target hook 'TARGET_EXPAND_BUILTIN_SAVEREGS'. On
  28766. other machines, it calls a routine written in assembler language,
  28767. found in 'libgcc2.c'.
  28768. Code generated for the call to '__builtin_saveregs' appears at the
  28769. beginning of the function, as opposed to where the call to
  28770. '__builtin_saveregs' is written, regardless of what the code is.
  28771. This is because the registers must be saved before the function
  28772. starts to use them for its own purposes.
  28773. -- Macro: __builtin_next_arg (LASTARG)
  28774. This builtin returns the address of the first anonymous stack
  28775. argument, as type 'void *'. If 'ARGS_GROW_DOWNWARD', it returns
  28776. the address of the location above the first anonymous stack
  28777. argument. Use it in 'va_start' to initialize the pointer for
  28778. fetching arguments from the stack. Also use it in 'va_start' to
  28779. verify that the second parameter LASTARG is the last named argument
  28780. of the current function.
  28781. -- Macro: __builtin_classify_type (OBJECT)
  28782. Since each machine has its own conventions for which data types are
  28783. passed in which kind of register, your implementation of 'va_arg'
  28784. has to embody these conventions. The easiest way to categorize the
  28785. specified data type is to use '__builtin_classify_type' together
  28786. with 'sizeof' and '__alignof__'.
  28787. '__builtin_classify_type' ignores the value of OBJECT, considering
  28788. only its data type. It returns an integer describing what kind of
  28789. type that is--integer, floating, pointer, structure, and so on.
  28790. The file 'typeclass.h' defines an enumeration that you can use to
  28791. interpret the values of '__builtin_classify_type'.
  28792. These machine description macros help implement varargs:
  28793. -- Target Hook: rtx TARGET_EXPAND_BUILTIN_SAVEREGS (void)
  28794. If defined, this hook produces the machine-specific code for a call
  28795. to '__builtin_saveregs'. This code will be moved to the very
  28796. beginning of the function, before any parameter access are made.
  28797. The return value of this function should be an RTX that contains
  28798. the value to use as the return of '__builtin_saveregs'.
  28799. -- Target Hook: void TARGET_SETUP_INCOMING_VARARGS (cumulative_args_t
  28800. ARGS_SO_FAR, const function_arg_info &ARG, int
  28801. *PRETEND_ARGS_SIZE, int SECOND_TIME)
  28802. This target hook offers an alternative to using
  28803. '__builtin_saveregs' and defining the hook
  28804. 'TARGET_EXPAND_BUILTIN_SAVEREGS'. Use it to store the anonymous
  28805. register arguments into the stack so that all the arguments appear
  28806. to have been passed consecutively on the stack. Once this is done,
  28807. you can use the standard implementation of varargs that works for
  28808. machines that pass all their arguments on the stack.
  28809. The argument ARGS_SO_FAR points to the 'CUMULATIVE_ARGS' data
  28810. structure, containing the values that are obtained after processing
  28811. the named arguments. The argument ARG describes the last of these
  28812. named arguments.
  28813. The target hook should do two things: first, push onto the stack
  28814. all the argument registers _not_ used for the named arguments, and
  28815. second, store the size of the data thus pushed into the
  28816. 'int'-valued variable pointed to by PRETEND_ARGS_SIZE. The value
  28817. that you store here will serve as additional offset for setting up
  28818. the stack frame.
  28819. Because you must generate code to push the anonymous arguments at
  28820. compile time without knowing their data types,
  28821. 'TARGET_SETUP_INCOMING_VARARGS' is only useful on machines that
  28822. have just a single category of argument register and use it
  28823. uniformly for all data types.
  28824. If the argument SECOND_TIME is nonzero, it means that the arguments
  28825. of the function are being analyzed for the second time. This
  28826. happens for an inline function, which is not actually compiled
  28827. until the end of the source file. The hook
  28828. 'TARGET_SETUP_INCOMING_VARARGS' should not generate any
  28829. instructions in this case.
  28830. -- Target Hook: bool TARGET_STRICT_ARGUMENT_NAMING (cumulative_args_t
  28831. CA)
  28832. Define this hook to return 'true' if the location where a function
  28833. argument is passed depends on whether or not it is a named
  28834. argument.
  28835. This hook controls how the NAMED argument to 'TARGET_FUNCTION_ARG'
  28836. is set for varargs and stdarg functions. If this hook returns
  28837. 'true', the NAMED argument is always true for named arguments, and
  28838. false for unnamed arguments. If it returns 'false', but
  28839. 'TARGET_PRETEND_OUTGOING_VARARGS_NAMED' returns 'true', then all
  28840. arguments are treated as named. Otherwise, all named arguments
  28841. except the last are treated as named.
  28842. You need not define this hook if it always returns 'false'.
  28843. -- Target Hook: void TARGET_CALL_ARGS (rtx, TREE)
  28844. While generating RTL for a function call, this target hook is
  28845. invoked once for each argument passed to the function, either a
  28846. register returned by 'TARGET_FUNCTION_ARG' or a memory location.
  28847. It is called just before the point where argument registers are
  28848. stored. The type of the function to be called is also passed as
  28849. the second argument; it is 'NULL_TREE' for libcalls. The
  28850. 'TARGET_END_CALL_ARGS' hook is invoked just after the code to copy
  28851. the return reg has been emitted. This functionality can be used to
  28852. perform special setup of call argument registers if a target needs
  28853. it. For functions without arguments, the hook is called once with
  28854. 'pc_rtx' passed instead of an argument register. Most ports do not
  28855. need to implement anything for this hook.
  28856. -- Target Hook: void TARGET_END_CALL_ARGS (void)
  28857. This target hook is invoked while generating RTL for a function
  28858. call, just after the point where the return reg is copied into a
  28859. pseudo. It signals that all the call argument and return registers
  28860. for the just emitted call are now no longer in use. Most ports do
  28861. not need to implement anything for this hook.
  28862. -- Target Hook: bool TARGET_PRETEND_OUTGOING_VARARGS_NAMED
  28863. (cumulative_args_t CA)
  28864. If you need to conditionally change ABIs so that one works with
  28865. 'TARGET_SETUP_INCOMING_VARARGS', but the other works like neither
  28866. 'TARGET_SETUP_INCOMING_VARARGS' nor 'TARGET_STRICT_ARGUMENT_NAMING'
  28867. was defined, then define this hook to return 'true' if
  28868. 'TARGET_SETUP_INCOMING_VARARGS' is used, 'false' otherwise.
  28869. Otherwise, you should not define this hook.
  28870. -- Target Hook: rtx TARGET_LOAD_BOUNDS_FOR_ARG (rtx SLOT, rtx ARG, rtx
  28871. SLOT_NO)
  28872. This hook is used by expand pass to emit insn to load bounds of ARG
  28873. passed in SLOT. Expand pass uses this hook in case bounds of ARG
  28874. are not passed in register. If SLOT is a memory, then bounds are
  28875. loaded as for regular pointer loaded from memory. If SLOT is not a
  28876. memory then SLOT_NO is an integer constant holding number of the
  28877. target dependent special slot which should be used to obtain
  28878. bounds. Hook returns RTX holding loaded bounds.
  28879. -- Target Hook: void TARGET_STORE_BOUNDS_FOR_ARG (rtx ARG, rtx SLOT,
  28880. rtx BOUNDS, rtx SLOT_NO)
  28881. This hook is used by expand pass to emit insns to store BOUNDS of
  28882. ARG passed in SLOT. Expand pass uses this hook in case BOUNDS of
  28883. ARG are not passed in register. If SLOT is a memory, then BOUNDS
  28884. are stored as for regular pointer stored in memory. If SLOT is not
  28885. a memory then SLOT_NO is an integer constant holding number of the
  28886. target dependent special slot which should be used to store BOUNDS.
  28887. -- Target Hook: rtx TARGET_LOAD_RETURNED_BOUNDS (rtx SLOT)
  28888. This hook is used by expand pass to emit insn to load bounds
  28889. returned by function call in SLOT. Hook returns RTX holding loaded
  28890. bounds.
  28891. -- Target Hook: void TARGET_STORE_RETURNED_BOUNDS (rtx SLOT, rtx
  28892. BOUNDS)
  28893. This hook is used by expand pass to emit insn to store BOUNDS
  28894. returned by function call into SLOT.
  28895. 
  28896. File: gccint.info, Node: Trampolines, Next: Library Calls, Prev: Varargs, Up: Target Macros
  28897. 18.11 Support for Nested Functions
  28898. ==================================
  28899. Taking the address of a nested function requires special compiler
  28900. handling to ensure that the static chain register is loaded when the
  28901. function is invoked via an indirect call.
  28902. GCC has traditionally supported nested functions by creating an
  28903. executable "trampoline" at run time when the address of a nested
  28904. function is taken. This is a small piece of code which normally resides
  28905. on the stack, in the stack frame of the containing function. The
  28906. trampoline loads the static chain register and then jumps to the real
  28907. address of the nested function.
  28908. The use of trampolines requires an executable stack, which is a
  28909. security risk. To avoid this problem, GCC also supports another
  28910. strategy: using descriptors for nested functions. Under this model,
  28911. taking the address of a nested function results in a pointer to a
  28912. non-executable function descriptor object. Initializing the static
  28913. chain from the descriptor is handled at indirect call sites.
  28914. On some targets, including HPPA and IA-64, function descriptors may be
  28915. mandated by the ABI or be otherwise handled in a target-specific way by
  28916. the back end in its code generation strategy for indirect calls. GCC
  28917. also provides its own generic descriptor implementation to support the
  28918. '-fno-trampolines' option. In this case runtime detection of function
  28919. descriptors at indirect call sites relies on descriptor pointers being
  28920. tagged with a bit that is never set in bare function addresses. Since
  28921. GCC's generic function descriptors are not ABI-compliant, this option is
  28922. typically used only on a per-language basis (notably by Ada) or when it
  28923. can otherwise be applied to the whole program.
  28924. Define the following hook if your backend either implements
  28925. ABI-specified descriptor support, or can use GCC's generic descriptor
  28926. implementation for nested functions.
  28927. -- Target Hook: int TARGET_CUSTOM_FUNCTION_DESCRIPTORS
  28928. If the target can use GCC's generic descriptor mechanism for nested
  28929. functions, define this hook to a power of 2 representing an unused
  28930. bit in function pointers which can be used to differentiate
  28931. descriptors at run time. This value gives the number of bytes by
  28932. which descriptor pointers are misaligned compared to function
  28933. pointers. For example, on targets that require functions to be
  28934. aligned to a 4-byte boundary, a value of either 1 or 2 is
  28935. appropriate unless the architecture already reserves the bit for
  28936. another purpose, such as on ARM.
  28937. Define this hook to 0 if the target implements ABI support for
  28938. function descriptors in its standard calling sequence, like for
  28939. example HPPA or IA-64.
  28940. Using descriptors for nested functions eliminates the need for
  28941. trampolines that reside on the stack and require it to be made
  28942. executable.
  28943. The following macros tell GCC how to generate code to allocate and
  28944. initialize an executable trampoline. You can also use this interface if
  28945. your back end needs to create ABI-specified non-executable descriptors;
  28946. in this case the "trampoline" created is the descriptor containing data
  28947. only.
  28948. The instructions in an executable trampoline must do two things: load a
  28949. constant address into the static chain register, and jump to the real
  28950. address of the nested function. On CISC machines such as the m68k, this
  28951. requires two instructions, a move immediate and a jump. Then the two
  28952. addresses exist in the trampoline as word-long immediate operands. On
  28953. RISC machines, it is often necessary to load each address into a
  28954. register in two parts. Then pieces of each address form separate
  28955. immediate operands.
  28956. The code generated to initialize the trampoline must store the variable
  28957. parts--the static chain value and the function address--into the
  28958. immediate operands of the instructions. On a CISC machine, this is
  28959. simply a matter of copying each address to a memory reference at the
  28960. proper offset from the start of the trampoline. On a RISC machine, it
  28961. may be necessary to take out pieces of the address and store them
  28962. separately.
  28963. -- Target Hook: void TARGET_ASM_TRAMPOLINE_TEMPLATE (FILE *F)
  28964. This hook is called by 'assemble_trampoline_template' to output, on
  28965. the stream F, assembler code for a block of data that contains the
  28966. constant parts of a trampoline. This code should not include a
  28967. label--the label is taken care of automatically.
  28968. If you do not define this hook, it means no template is needed for
  28969. the target. Do not define this hook on systems where the block
  28970. move code to copy the trampoline into place would be larger than
  28971. the code to generate it on the spot.
  28972. -- Macro: TRAMPOLINE_SECTION
  28973. Return the section into which the trampoline template is to be
  28974. placed (*note Sections::). The default value is
  28975. 'readonly_data_section'.
  28976. -- Macro: TRAMPOLINE_SIZE
  28977. A C expression for the size in bytes of the trampoline, as an
  28978. integer.
  28979. -- Macro: TRAMPOLINE_ALIGNMENT
  28980. Alignment required for trampolines, in bits.
  28981. If you don't define this macro, the value of 'FUNCTION_ALIGNMENT'
  28982. is used for aligning trampolines.
  28983. -- Target Hook: void TARGET_TRAMPOLINE_INIT (rtx M_TRAMP, tree FNDECL,
  28984. rtx STATIC_CHAIN)
  28985. This hook is called to initialize a trampoline. M_TRAMP is an RTX
  28986. for the memory block for the trampoline; FNDECL is the
  28987. 'FUNCTION_DECL' for the nested function; STATIC_CHAIN is an RTX for
  28988. the static chain value that should be passed to the function when
  28989. it is called.
  28990. If the target defines 'TARGET_ASM_TRAMPOLINE_TEMPLATE', then the
  28991. first thing this hook should do is emit a block move into M_TRAMP
  28992. from the memory block returned by 'assemble_trampoline_template'.
  28993. Note that the block move need only cover the constant parts of the
  28994. trampoline. If the target isolates the variable parts of the
  28995. trampoline to the end, not all 'TRAMPOLINE_SIZE' bytes need be
  28996. copied.
  28997. If the target requires any other actions, such as flushing caches
  28998. or enabling stack execution, these actions should be performed
  28999. after initializing the trampoline proper.
  29000. -- Target Hook: rtx TARGET_TRAMPOLINE_ADJUST_ADDRESS (rtx ADDR)
  29001. This hook should perform any machine-specific adjustment in the
  29002. address of the trampoline. Its argument contains the address of
  29003. the memory block that was passed to 'TARGET_TRAMPOLINE_INIT'. In
  29004. case the address to be used for a function call should be different
  29005. from the address at which the template was stored, the different
  29006. address should be returned; otherwise ADDR should be returned
  29007. unchanged. If this hook is not defined, ADDR will be used for
  29008. function calls.
  29009. Implementing trampolines is difficult on many machines because they
  29010. have separate instruction and data caches. Writing into a stack
  29011. location fails to clear the memory in the instruction cache, so when the
  29012. program jumps to that location, it executes the old contents.
  29013. Here are two possible solutions. One is to clear the relevant parts of
  29014. the instruction cache whenever a trampoline is set up. The other is to
  29015. make all trampolines identical, by having them jump to a standard
  29016. subroutine. The former technique makes trampoline execution faster; the
  29017. latter makes initialization faster.
  29018. To clear the instruction cache when a trampoline is initialized, define
  29019. the following macro.
  29020. -- Macro: CLEAR_INSN_CACHE (BEG, END)
  29021. If defined, expands to a C expression clearing the _instruction
  29022. cache_ in the specified interval. The definition of this macro
  29023. would typically be a series of 'asm' statements. Both BEG and END
  29024. are both pointer expressions.
  29025. To use a standard subroutine, define the following macro. In addition,
  29026. you must make sure that the instructions in a trampoline fill an entire
  29027. cache line with identical instructions, or else ensure that the
  29028. beginning of the trampoline code is always aligned at the same point in
  29029. its cache line. Look in 'm68k.h' as a guide.
  29030. -- Macro: TRANSFER_FROM_TRAMPOLINE
  29031. Define this macro if trampolines need a special subroutine to do
  29032. their work. The macro should expand to a series of 'asm'
  29033. statements which will be compiled with GCC. They go in a library
  29034. function named '__transfer_from_trampoline'.
  29035. If you need to avoid executing the ordinary prologue code of a
  29036. compiled C function when you jump to the subroutine, you can do so
  29037. by placing a special label of your own in the assembler code. Use
  29038. one 'asm' statement to generate an assembler label, and another to
  29039. make the label global. Then trampolines can use that label to jump
  29040. directly to your special assembler code.
  29041. 
  29042. File: gccint.info, Node: Library Calls, Next: Addressing Modes, Prev: Trampolines, Up: Target Macros
  29043. 18.12 Implicit Calls to Library Routines
  29044. ========================================
  29045. Here is an explanation of implicit calls to library routines.
  29046. -- Macro: DECLARE_LIBRARY_RENAMES
  29047. This macro, if defined, should expand to a piece of C code that
  29048. will get expanded when compiling functions for libgcc.a. It can be
  29049. used to provide alternate names for GCC's internal library
  29050. functions if there are ABI-mandated names that the compiler should
  29051. provide.
  29052. -- Target Hook: void TARGET_INIT_LIBFUNCS (void)
  29053. This hook should declare additional library routines or rename
  29054. existing ones, using the functions 'set_optab_libfunc' and
  29055. 'init_one_libfunc' defined in 'optabs.c'. 'init_optabs' calls this
  29056. macro after initializing all the normal library routines.
  29057. The default is to do nothing. Most ports don't need to define this
  29058. hook.
  29059. -- Target Hook: bool TARGET_LIBFUNC_GNU_PREFIX
  29060. If false (the default), internal library routines start with two
  29061. underscores. If set to true, these routines start with '__gnu_'
  29062. instead. E.g., '__muldi3' changes to '__gnu_muldi3'. This
  29063. currently only affects functions defined in 'libgcc2.c'. If this
  29064. is set to true, the 'tm.h' file must also '#define
  29065. LIBGCC2_GNU_PREFIX'.
  29066. -- Macro: FLOAT_LIB_COMPARE_RETURNS_BOOL (MODE, COMPARISON)
  29067. This macro should return 'true' if the library routine that
  29068. implements the floating point comparison operator COMPARISON in
  29069. mode MODE will return a boolean, and FALSE if it will return a
  29070. tristate.
  29071. GCC's own floating point libraries return tristates from the
  29072. comparison operators, so the default returns false always. Most
  29073. ports don't need to define this macro.
  29074. -- Macro: TARGET_LIB_INT_CMP_BIASED
  29075. This macro should evaluate to 'true' if the integer comparison
  29076. functions (like '__cmpdi2') return 0 to indicate that the first
  29077. operand is smaller than the second, 1 to indicate that they are
  29078. equal, and 2 to indicate that the first operand is greater than the
  29079. second. If this macro evaluates to 'false' the comparison
  29080. functions return -1, 0, and 1 instead of 0, 1, and 2. If the
  29081. target uses the routines in 'libgcc.a', you do not need to define
  29082. this macro.
  29083. -- Macro: TARGET_HAS_NO_HW_DIVIDE
  29084. This macro should be defined if the target has no hardware divide
  29085. instructions. If this macro is defined, GCC will use an algorithm
  29086. which make use of simple logical and arithmetic operations for
  29087. 64-bit division. If the macro is not defined, GCC will use an
  29088. algorithm which make use of a 64-bit by 32-bit divide primitive.
  29089. -- Macro: TARGET_EDOM
  29090. The value of 'EDOM' on the target machine, as a C integer constant
  29091. expression. If you don't define this macro, GCC does not attempt
  29092. to deposit the value of 'EDOM' into 'errno' directly. Look in
  29093. '/usr/include/errno.h' to find the value of 'EDOM' on your system.
  29094. If you do not define 'TARGET_EDOM', then compiled code reports
  29095. domain errors by calling the library function and letting it report
  29096. the error. If mathematical functions on your system use 'matherr'
  29097. when there is an error, then you should leave 'TARGET_EDOM'
  29098. undefined so that 'matherr' is used normally.
  29099. -- Macro: GEN_ERRNO_RTX
  29100. Define this macro as a C expression to create an rtl expression
  29101. that refers to the global "variable" 'errno'. (On certain systems,
  29102. 'errno' may not actually be a variable.) If you don't define this
  29103. macro, a reasonable default is used.
  29104. -- Target Hook: bool TARGET_LIBC_HAS_FUNCTION (enum function_class
  29105. FN_CLASS)
  29106. This hook determines whether a function from a class of functions
  29107. FN_CLASS is present in the target C library.
  29108. -- Target Hook: bool TARGET_LIBC_HAS_FAST_FUNCTION (int FCODE)
  29109. This hook determines whether a function from a class of functions
  29110. '(enum function_class)'FCODE has a fast implementation.
  29111. -- Macro: NEXT_OBJC_RUNTIME
  29112. Set this macro to 1 to use the "NeXT" Objective-C message sending
  29113. conventions by default. This calling convention involves passing
  29114. the object, the selector and the method arguments all at once to
  29115. the method-lookup library function. This is the usual setting when
  29116. targeting Darwin/Mac OS X systems, which have the NeXT runtime
  29117. installed.
  29118. If the macro is set to 0, the "GNU" Objective-C message sending
  29119. convention will be used by default. This convention passes just
  29120. the object and the selector to the method-lookup function, which
  29121. returns a pointer to the method.
  29122. In either case, it remains possible to select code-generation for
  29123. the alternate scheme, by means of compiler command line switches.
  29124. 
  29125. File: gccint.info, Node: Addressing Modes, Next: Anchored Addresses, Prev: Library Calls, Up: Target Macros
  29126. 18.13 Addressing Modes
  29127. ======================
  29128. This is about addressing modes.
  29129. -- Macro: HAVE_PRE_INCREMENT
  29130. -- Macro: HAVE_PRE_DECREMENT
  29131. -- Macro: HAVE_POST_INCREMENT
  29132. -- Macro: HAVE_POST_DECREMENT
  29133. A C expression that is nonzero if the machine supports
  29134. pre-increment, pre-decrement, post-increment, or post-decrement
  29135. addressing respectively.
  29136. -- Macro: HAVE_PRE_MODIFY_DISP
  29137. -- Macro: HAVE_POST_MODIFY_DISP
  29138. A C expression that is nonzero if the machine supports pre- or
  29139. post-address side-effect generation involving constants other than
  29140. the size of the memory operand.
  29141. -- Macro: HAVE_PRE_MODIFY_REG
  29142. -- Macro: HAVE_POST_MODIFY_REG
  29143. A C expression that is nonzero if the machine supports pre- or
  29144. post-address side-effect generation involving a register
  29145. displacement.
  29146. -- Macro: CONSTANT_ADDRESS_P (X)
  29147. A C expression that is 1 if the RTX X is a constant which is a
  29148. valid address. On most machines the default definition of
  29149. '(CONSTANT_P (X) && GET_CODE (X) != CONST_DOUBLE)' is acceptable,
  29150. but a few machines are more restrictive as to which constant
  29151. addresses are supported.
  29152. -- Macro: CONSTANT_P (X)
  29153. 'CONSTANT_P', which is defined by target-independent code, accepts
  29154. integer-values expressions whose values are not explicitly known,
  29155. such as 'symbol_ref', 'label_ref', and 'high' expressions and
  29156. 'const' arithmetic expressions, in addition to 'const_int' and
  29157. 'const_double' expressions.
  29158. -- Macro: MAX_REGS_PER_ADDRESS
  29159. A number, the maximum number of registers that can appear in a
  29160. valid memory address. Note that it is up to you to specify a value
  29161. equal to the maximum number that 'TARGET_LEGITIMATE_ADDRESS_P'
  29162. would ever accept.
  29163. -- Target Hook: bool TARGET_LEGITIMATE_ADDRESS_P (machine_mode MODE,
  29164. rtx X, bool STRICT)
  29165. A function that returns whether X (an RTX) is a legitimate memory
  29166. address on the target machine for a memory operand of mode MODE.
  29167. Legitimate addresses are defined in two variants: a strict variant
  29168. and a non-strict one. The STRICT parameter chooses which variant
  29169. is desired by the caller.
  29170. The strict variant is used in the reload pass. It must be defined
  29171. so that any pseudo-register that has not been allocated a hard
  29172. register is considered a memory reference. This is because in
  29173. contexts where some kind of register is required, a pseudo-register
  29174. with no hard register must be rejected. For non-hard registers,
  29175. the strict variant should look up the 'reg_renumber' array; it
  29176. should then proceed using the hard register number in the array, or
  29177. treat the pseudo as a memory reference if the array holds '-1'.
  29178. The non-strict variant is used in other passes. It must be defined
  29179. to accept all pseudo-registers in every context where some kind of
  29180. register is required.
  29181. Normally, constant addresses which are the sum of a 'symbol_ref'
  29182. and an integer are stored inside a 'const' RTX to mark them as
  29183. constant. Therefore, there is no need to recognize such sums
  29184. specifically as legitimate addresses. Normally you would simply
  29185. recognize any 'const' as legitimate.
  29186. Usually 'PRINT_OPERAND_ADDRESS' is not prepared to handle constant
  29187. sums that are not marked with 'const'. It assumes that a naked
  29188. 'plus' indicates indexing. If so, then you _must_ reject such
  29189. naked constant sums as illegitimate addresses, so that none of them
  29190. will be given to 'PRINT_OPERAND_ADDRESS'.
  29191. On some machines, whether a symbolic address is legitimate depends
  29192. on the section that the address refers to. On these machines,
  29193. define the target hook 'TARGET_ENCODE_SECTION_INFO' to store the
  29194. information into the 'symbol_ref', and then check for it here.
  29195. When you see a 'const', you will have to look inside it to find the
  29196. 'symbol_ref' in order to determine the section. *Note Assembler
  29197. Format::.
  29198. Some ports are still using a deprecated legacy substitute for this
  29199. hook, the 'GO_IF_LEGITIMATE_ADDRESS' macro. This macro has this
  29200. syntax:
  29201. #define GO_IF_LEGITIMATE_ADDRESS (MODE, X, LABEL)
  29202. and should 'goto LABEL' if the address X is a valid address on the
  29203. target machine for a memory operand of mode MODE.
  29204. Compiler source files that want to use the strict variant of this
  29205. macro define the macro 'REG_OK_STRICT'. You should use an '#ifdef
  29206. REG_OK_STRICT' conditional to define the strict variant in that
  29207. case and the non-strict variant otherwise.
  29208. Using the hook is usually simpler because it limits the number of
  29209. files that are recompiled when changes are made.
  29210. -- Macro: TARGET_MEM_CONSTRAINT
  29211. A single character to be used instead of the default ''m''
  29212. character for general memory addresses. This defines the
  29213. constraint letter which matches the memory addresses accepted by
  29214. 'TARGET_LEGITIMATE_ADDRESS_P'. Define this macro if you want to
  29215. support new address formats in your back end without changing the
  29216. semantics of the ''m'' constraint. This is necessary in order to
  29217. preserve functionality of inline assembly constructs using the
  29218. ''m'' constraint.
  29219. -- Macro: FIND_BASE_TERM (X)
  29220. A C expression to determine the base term of address X, or to
  29221. provide a simplified version of X from which 'alias.c' can easily
  29222. find the base term. This macro is used in only two places:
  29223. 'find_base_value' and 'find_base_term' in 'alias.c'.
  29224. It is always safe for this macro to not be defined. It exists so
  29225. that alias analysis can understand machine-dependent addresses.
  29226. The typical use of this macro is to handle addresses containing a
  29227. label_ref or symbol_ref within an UNSPEC.
  29228. -- Target Hook: rtx TARGET_LEGITIMIZE_ADDRESS (rtx X, rtx OLDX,
  29229. machine_mode MODE)
  29230. This hook is given an invalid memory address X for an operand of
  29231. mode MODE and should try to return a valid memory address.
  29232. X will always be the result of a call to 'break_out_memory_refs',
  29233. and OLDX will be the operand that was given to that function to
  29234. produce X.
  29235. The code of the hook should not alter the substructure of X. If it
  29236. transforms X into a more legitimate form, it should return the new
  29237. X.
  29238. It is not necessary for this hook to come up with a legitimate
  29239. address, with the exception of native TLS addresses (*note Emulated
  29240. TLS::). The compiler has standard ways of doing so in all cases.
  29241. In fact, if the target supports only emulated TLS, it is safe to
  29242. omit this hook or make it return X if it cannot find a valid way to
  29243. legitimize the address. But often a machine-dependent strategy can
  29244. generate better code.
  29245. -- Macro: LEGITIMIZE_RELOAD_ADDRESS (X, MODE, OPNUM, TYPE, IND_LEVELS,
  29246. WIN)
  29247. A C compound statement that attempts to replace X, which is an
  29248. address that needs reloading, with a valid memory address for an
  29249. operand of mode MODE. WIN will be a C statement label elsewhere in
  29250. the code. It is not necessary to define this macro, but it might
  29251. be useful for performance reasons.
  29252. For example, on the i386, it is sometimes possible to use a single
  29253. reload register instead of two by reloading a sum of two pseudo
  29254. registers into a register. On the other hand, for number of RISC
  29255. processors offsets are limited so that often an intermediate
  29256. address needs to be generated in order to address a stack slot. By
  29257. defining 'LEGITIMIZE_RELOAD_ADDRESS' appropriately, the
  29258. intermediate addresses generated for adjacent some stack slots can
  29259. be made identical, and thus be shared.
  29260. _Note_: This macro should be used with caution. It is necessary to
  29261. know something of how reload works in order to effectively use
  29262. this, and it is quite easy to produce macros that build in too much
  29263. knowledge of reload internals.
  29264. _Note_: This macro must be able to reload an address created by a
  29265. previous invocation of this macro. If it fails to handle such
  29266. addresses then the compiler may generate incorrect code or abort.
  29267. The macro definition should use 'push_reload' to indicate parts
  29268. that need reloading; OPNUM, TYPE and IND_LEVELS are usually
  29269. suitable to be passed unaltered to 'push_reload'.
  29270. The code generated by this macro must not alter the substructure of
  29271. X. If it transforms X into a more legitimate form, it should
  29272. assign X (which will always be a C variable) a new value. This
  29273. also applies to parts that you change indirectly by calling
  29274. 'push_reload'.
  29275. The macro definition may use 'strict_memory_address_p' to test if
  29276. the address has become legitimate.
  29277. If you want to change only a part of X, one standard way of doing
  29278. this is to use 'copy_rtx'. Note, however, that it unshares only a
  29279. single level of rtl. Thus, if the part to be changed is not at the
  29280. top level, you'll need to replace first the top level. It is not
  29281. necessary for this macro to come up with a legitimate address; but
  29282. often a machine-dependent strategy can generate better code.
  29283. -- Target Hook: bool TARGET_MODE_DEPENDENT_ADDRESS_P (const_rtx ADDR,
  29284. addr_space_t ADDRSPACE)
  29285. This hook returns 'true' if memory address ADDR in address space
  29286. ADDRSPACE can have different meanings depending on the machine mode
  29287. of the memory reference it is used for or if the address is valid
  29288. for some modes but not others.
  29289. Autoincrement and autodecrement addresses typically have
  29290. mode-dependent effects because the amount of the increment or
  29291. decrement is the size of the operand being addressed. Some
  29292. machines have other mode-dependent addresses. Many RISC machines
  29293. have no mode-dependent addresses.
  29294. You may assume that ADDR is a valid address for the machine.
  29295. The default version of this hook returns 'false'.
  29296. -- Target Hook: bool TARGET_LEGITIMATE_CONSTANT_P (machine_mode MODE,
  29297. rtx X)
  29298. This hook returns true if X is a legitimate constant for a
  29299. MODE-mode immediate operand on the target machine. You can assume
  29300. that X satisfies 'CONSTANT_P', so you need not check this.
  29301. The default definition returns true.
  29302. -- Target Hook: rtx TARGET_DELEGITIMIZE_ADDRESS (rtx X)
  29303. This hook is used to undo the possibly obfuscating effects of the
  29304. 'LEGITIMIZE_ADDRESS' and 'LEGITIMIZE_RELOAD_ADDRESS' target macros.
  29305. Some backend implementations of these macros wrap symbol references
  29306. inside an 'UNSPEC' rtx to represent PIC or similar addressing
  29307. modes. This target hook allows GCC's optimizers to understand the
  29308. semantics of these opaque 'UNSPEC's by converting them back into
  29309. their original form.
  29310. -- Target Hook: bool TARGET_CONST_NOT_OK_FOR_DEBUG_P (rtx X)
  29311. This hook should return true if X should not be emitted into debug
  29312. sections.
  29313. -- Target Hook: bool TARGET_CANNOT_FORCE_CONST_MEM (machine_mode MODE,
  29314. rtx X)
  29315. This hook should return true if X is of a form that cannot (or
  29316. should not) be spilled to the constant pool. MODE is the mode of
  29317. X.
  29318. The default version of this hook returns false.
  29319. The primary reason to define this hook is to prevent reload from
  29320. deciding that a non-legitimate constant would be better reloaded
  29321. from the constant pool instead of spilling and reloading a register
  29322. holding the constant. This restriction is often true of addresses
  29323. of TLS symbols for various targets.
  29324. -- Target Hook: bool TARGET_USE_BLOCKS_FOR_CONSTANT_P (machine_mode
  29325. MODE, const_rtx X)
  29326. This hook should return true if pool entries for constant X can be
  29327. placed in an 'object_block' structure. MODE is the mode of X.
  29328. The default version returns false for all constants.
  29329. -- Target Hook: bool TARGET_USE_BLOCKS_FOR_DECL_P (const_tree DECL)
  29330. This hook should return true if pool entries for DECL should be
  29331. placed in an 'object_block' structure.
  29332. The default version returns true for all decls.
  29333. -- Target Hook: tree TARGET_BUILTIN_RECIPROCAL (tree FNDECL)
  29334. This hook should return the DECL of a function that implements the
  29335. reciprocal of the machine-specific builtin function FNDECL, or
  29336. 'NULL_TREE' if such a function is not available.
  29337. -- Target Hook: tree TARGET_VECTORIZE_BUILTIN_MASK_FOR_LOAD (void)
  29338. This hook should return the DECL of a function F that given an
  29339. address ADDR as an argument returns a mask M that can be used to
  29340. extract from two vectors the relevant data that resides in ADDR in
  29341. case ADDR is not properly aligned.
  29342. The autovectorizer, when vectorizing a load operation from an
  29343. address ADDR that may be unaligned, will generate two vector loads
  29344. from the two aligned addresses around ADDR. It then generates a
  29345. 'REALIGN_LOAD' operation to extract the relevant data from the two
  29346. loaded vectors. The first two arguments to 'REALIGN_LOAD', V1 and
  29347. V2, are the two vectors, each of size VS, and the third argument,
  29348. OFF, defines how the data will be extracted from these two vectors:
  29349. if OFF is 0, then the returned vector is V2; otherwise, the
  29350. returned vector is composed from the last VS-OFF elements of V1
  29351. concatenated to the first OFF elements of V2.
  29352. If this hook is defined, the autovectorizer will generate a call to
  29353. F (using the DECL tree that this hook returns) and will use the
  29354. return value of F as the argument OFF to 'REALIGN_LOAD'.
  29355. Therefore, the mask M returned by F should comply with the
  29356. semantics expected by 'REALIGN_LOAD' described above. If this hook
  29357. is not defined, then ADDR will be used as the argument OFF to
  29358. 'REALIGN_LOAD', in which case the low log2(VS) - 1 bits of ADDR
  29359. will be considered.
  29360. -- Target Hook: int TARGET_VECTORIZE_BUILTIN_VECTORIZATION_COST (enum
  29361. vect_cost_for_stmt TYPE_OF_COST, tree VECTYPE, int MISALIGN)
  29362. Returns cost of different scalar or vector statements for
  29363. vectorization cost model. For vector memory operations the cost
  29364. may depend on type (VECTYPE) and misalignment value (MISALIGN).
  29365. -- Target Hook: poly_uint64 TARGET_VECTORIZE_PREFERRED_VECTOR_ALIGNMENT
  29366. (const_tree TYPE)
  29367. This hook returns the preferred alignment in bits for accesses to
  29368. vectors of type TYPE in vectorized code. This might be less than
  29369. or greater than the ABI-defined value returned by
  29370. 'TARGET_VECTOR_ALIGNMENT'. It can be equal to the alignment of a
  29371. single element, in which case the vectorizer will not try to
  29372. optimize for alignment.
  29373. The default hook returns 'TYPE_ALIGN (TYPE)', which is correct for
  29374. most targets.
  29375. -- Target Hook: bool TARGET_VECTORIZE_VECTOR_ALIGNMENT_REACHABLE
  29376. (const_tree TYPE, bool IS_PACKED)
  29377. Return true if vector alignment is reachable (by peeling N
  29378. iterations) for the given scalar type TYPE. IS_PACKED is false if
  29379. the scalar access using TYPE is known to be naturally aligned.
  29380. -- Target Hook: bool TARGET_VECTORIZE_VEC_PERM_CONST (machine_mode
  29381. MODE, rtx OUTPUT, rtx IN0, rtx IN1, const vec_perm_indices
  29382. &SEL)
  29383. This hook is used to test whether the target can permute up to two
  29384. vectors of mode MODE using the permutation vector 'sel', and also
  29385. to emit such a permutation. In the former case IN0, IN1 and OUT
  29386. are all null. In the latter case IN0 and IN1 are the source
  29387. vectors and OUT is the destination vector; all three are registers
  29388. of mode MODE. IN1 is the same as IN0 if SEL describes a
  29389. permutation on one vector instead of two.
  29390. Return true if the operation is possible, emitting instructions for
  29391. it if rtxes are provided.
  29392. If the hook returns false for a mode with multibyte elements, GCC
  29393. will try the equivalent byte operation. If that also fails, it
  29394. will try forcing the selector into a register and using the
  29395. VEC_PERMMODE instruction pattern. There is no need for the hook to
  29396. handle these two implementation approaches itself.
  29397. -- Target Hook: tree TARGET_VECTORIZE_BUILTIN_VECTORIZED_FUNCTION
  29398. (unsigned CODE, tree VEC_TYPE_OUT, tree VEC_TYPE_IN)
  29399. This hook should return the decl of a function that implements the
  29400. vectorized variant of the function with the 'combined_fn' code CODE
  29401. or 'NULL_TREE' if such a function is not available. The return
  29402. type of the vectorized function shall be of vector type
  29403. VEC_TYPE_OUT and the argument types should be VEC_TYPE_IN.
  29404. -- Target Hook: tree TARGET_VECTORIZE_BUILTIN_MD_VECTORIZED_FUNCTION
  29405. (tree FNDECL, tree VEC_TYPE_OUT, tree VEC_TYPE_IN)
  29406. This hook should return the decl of a function that implements the
  29407. vectorized variant of target built-in function 'fndecl'. The
  29408. return type of the vectorized function shall be of vector type
  29409. VEC_TYPE_OUT and the argument types should be VEC_TYPE_IN.
  29410. -- Target Hook: bool TARGET_VECTORIZE_SUPPORT_VECTOR_MISALIGNMENT
  29411. (machine_mode MODE, const_tree TYPE, int MISALIGNMENT, bool
  29412. IS_PACKED)
  29413. This hook should return true if the target supports misaligned
  29414. vector store/load of a specific factor denoted in the MISALIGNMENT
  29415. parameter. The vector store/load should be of machine mode MODE
  29416. and the elements in the vectors should be of type TYPE. IS_PACKED
  29417. parameter is true if the memory access is defined in a packed
  29418. struct.
  29419. -- Target Hook: machine_mode TARGET_VECTORIZE_PREFERRED_SIMD_MODE
  29420. (scalar_mode MODE)
  29421. This hook should return the preferred mode for vectorizing scalar
  29422. mode MODE. The default is equal to 'word_mode', because the
  29423. vectorizer can do some transformations even in absence of
  29424. specialized SIMD hardware.
  29425. -- Target Hook: machine_mode TARGET_VECTORIZE_SPLIT_REDUCTION
  29426. (machine_mode)
  29427. This hook should return the preferred mode to split the final
  29428. reduction step on MODE to. The reduction is then carried out
  29429. reducing upper against lower halves of vectors recursively until
  29430. the specified mode is reached. The default is MODE which means no
  29431. splitting.
  29432. -- Target Hook: unsigned int
  29433. TARGET_VECTORIZE_AUTOVECTORIZE_VECTOR_MODES (vector_modes
  29434. *MODES, bool ALL)
  29435. If using the mode returned by
  29436. 'TARGET_VECTORIZE_PREFERRED_SIMD_MODE' is not the only approach
  29437. worth considering, this hook should add one mode to MODES for each
  29438. useful alternative approach. These modes are then passed to
  29439. 'TARGET_VECTORIZE_RELATED_MODE' to obtain the vector mode for a
  29440. given element mode.
  29441. The modes returned in MODES should use the smallest element mode
  29442. possible for the vectorization approach that they represent,
  29443. preferring integer modes over floating-poing modes in the event of
  29444. a tie. The first mode should be the
  29445. 'TARGET_VECTORIZE_PREFERRED_SIMD_MODE' for its element mode.
  29446. If ALL is true, add suitable vector modes even when they are
  29447. generally not expected to be worthwhile.
  29448. The hook returns a bitmask of flags that control how the modes in
  29449. MODES are used. The flags are:
  29450. 'VECT_COMPARE_COSTS'
  29451. Tells the loop vectorizer to try all the provided modes and
  29452. pick the one with the lowest cost. By default the vectorizer
  29453. will choose the first mode that works.
  29454. The hook does not need to do anything if the vector returned by
  29455. 'TARGET_VECTORIZE_PREFERRED_SIMD_MODE' is the only one relevant for
  29456. autovectorization. The default implementation adds no modes and
  29457. returns 0.
  29458. -- Target Hook: opt_machine_mode TARGET_VECTORIZE_RELATED_MODE
  29459. (machine_mode VECTOR_MODE, scalar_mode ELEMENT_MODE,
  29460. poly_uint64 NUNITS)
  29461. If a piece of code is using vector mode VECTOR_MODE and also wants
  29462. to operate on elements of mode ELEMENT_MODE, return the vector mode
  29463. it should use for those elements. If NUNITS is nonzero, ensure
  29464. that the mode has exactly NUNITS elements, otherwise pick whichever
  29465. vector size pairs the most naturally with VECTOR_MODE. Return an
  29466. empty 'opt_machine_mode' if there is no supported vector mode with
  29467. the required properties.
  29468. There is no prescribed way of handling the case in which NUNITS is
  29469. zero. One common choice is to pick a vector mode with the same
  29470. size as VECTOR_MODE; this is the natural choice if the target has a
  29471. fixed vector size. Another option is to choose a vector mode with
  29472. the same number of elements as VECTOR_MODE; this is the natural
  29473. choice if the target has a fixed number of elements.
  29474. Alternatively, the hook might choose a middle ground, such as
  29475. trying to keep the number of elements as similar as possible while
  29476. applying maximum and minimum vector sizes.
  29477. The default implementation uses 'mode_for_vector' to find the
  29478. requested mode, returning a mode with the same size as VECTOR_MODE
  29479. when NUNITS is zero. This is the correct behavior for most
  29480. targets.
  29481. -- Target Hook: opt_machine_mode TARGET_VECTORIZE_GET_MASK_MODE
  29482. (machine_mode MODE)
  29483. Return the mode to use for a vector mask that holds one boolean
  29484. result for each element of vector mode MODE. The returned mask
  29485. mode can be a vector of integers (class 'MODE_VECTOR_INT'), a
  29486. vector of booleans (class 'MODE_VECTOR_BOOL') or a scalar integer
  29487. (class 'MODE_INT'). Return an empty 'opt_machine_mode' if no such
  29488. mask mode exists.
  29489. The default implementation returns a 'MODE_VECTOR_INT' with the
  29490. same size and number of elements as MODE, if such a mode exists.
  29491. -- Target Hook: bool TARGET_VECTORIZE_EMPTY_MASK_IS_EXPENSIVE (unsigned
  29492. IFN)
  29493. This hook returns true if masked internal function IFN (really of
  29494. type 'internal_fn') should be considered expensive when the mask is
  29495. all zeros. GCC can then try to branch around the instruction
  29496. instead.
  29497. -- Target Hook: void * TARGET_VECTORIZE_INIT_COST (class loop
  29498. *LOOP_INFO)
  29499. This hook should initialize target-specific data structures in
  29500. preparation for modeling the costs of vectorizing a loop or basic
  29501. block. The default allocates three unsigned integers for
  29502. accumulating costs for the prologue, body, and epilogue of the loop
  29503. or basic block. If LOOP_INFO is non-NULL, it identifies the loop
  29504. being vectorized; otherwise a single block is being vectorized.
  29505. -- Target Hook: unsigned TARGET_VECTORIZE_ADD_STMT_COST (void *DATA,
  29506. int COUNT, enum vect_cost_for_stmt KIND, class _stmt_vec_info
  29507. *STMT_INFO, int MISALIGN, enum vect_cost_model_location WHERE)
  29508. This hook should update the target-specific DATA in response to
  29509. adding COUNT copies of the given KIND of statement to a loop or
  29510. basic block. The default adds the builtin vectorizer cost for the
  29511. copies of the statement to the accumulator specified by WHERE, (the
  29512. prologue, body, or epilogue) and returns the amount added. The
  29513. return value should be viewed as a tentative cost that may later be
  29514. revised.
  29515. -- Target Hook: void TARGET_VECTORIZE_FINISH_COST (void *DATA, unsigned
  29516. *PROLOGUE_COST, unsigned *BODY_COST, unsigned *EPILOGUE_COST)
  29517. This hook should complete calculations of the cost of vectorizing a
  29518. loop or basic block based on DATA, and return the prologue, body,
  29519. and epilogue costs as unsigned integers. The default returns the
  29520. value of the three accumulators.
  29521. -- Target Hook: void TARGET_VECTORIZE_DESTROY_COST_DATA (void *DATA)
  29522. This hook should release DATA and any related data structures
  29523. allocated by TARGET_VECTORIZE_INIT_COST. The default releases the
  29524. accumulator.
  29525. -- Target Hook: tree TARGET_VECTORIZE_BUILTIN_GATHER (const_tree
  29526. MEM_VECTYPE, const_tree INDEX_TYPE, int SCALE)
  29527. Target builtin that implements vector gather operation.
  29528. MEM_VECTYPE is the vector type of the load and INDEX_TYPE is scalar
  29529. type of the index, scaled by SCALE. The default is 'NULL_TREE'
  29530. which means to not vectorize gather loads.
  29531. -- Target Hook: tree TARGET_VECTORIZE_BUILTIN_SCATTER (const_tree
  29532. VECTYPE, const_tree INDEX_TYPE, int SCALE)
  29533. Target builtin that implements vector scatter operation. VECTYPE
  29534. is the vector type of the store and INDEX_TYPE is scalar type of
  29535. the index, scaled by SCALE. The default is 'NULL_TREE' which means
  29536. to not vectorize scatter stores.
  29537. -- Target Hook: int TARGET_SIMD_CLONE_COMPUTE_VECSIZE_AND_SIMDLEN
  29538. (struct cgraph_node *, struct cgraph_simd_clone *, TREE, INT)
  29539. This hook should set VECSIZE_MANGLE, VECSIZE_INT, VECSIZE_FLOAT
  29540. fields in SIMD_CLONE structure pointed by CLONE_INFO argument and
  29541. also SIMDLEN field if it was previously 0. The hook should return
  29542. 0 if SIMD clones shouldn't be emitted, or number of VECSIZE_MANGLE
  29543. variants that should be emitted.
  29544. -- Target Hook: void TARGET_SIMD_CLONE_ADJUST (struct cgraph_node *)
  29545. This hook should add implicit 'attribute(target("..."))' attribute
  29546. to SIMD clone NODE if needed.
  29547. -- Target Hook: int TARGET_SIMD_CLONE_USABLE (struct cgraph_node *)
  29548. This hook should return -1 if SIMD clone NODE shouldn't be used in
  29549. vectorized loops in current function, or non-negative number if it
  29550. is usable. In that case, the smaller the number is, the more
  29551. desirable it is to use it.
  29552. -- Target Hook: int TARGET_SIMT_VF (void)
  29553. Return number of threads in SIMT thread group on the target.
  29554. -- Target Hook: int TARGET_OMP_DEVICE_KIND_ARCH_ISA (enum
  29555. omp_device_kind_arch_isa TRAIT, const char *NAME)
  29556. Return 1 if TRAIT NAME is present in the OpenMP context's device
  29557. trait set, return 0 if not present in any OpenMP context in the
  29558. whole translation unit, or -1 if not present in the current OpenMP
  29559. context but might be present in another OpenMP context in the same
  29560. TU.
  29561. -- Target Hook: bool TARGET_GOACC_VALIDATE_DIMS (tree DECL, int *DIMS,
  29562. int FN_LEVEL, unsigned USED)
  29563. This hook should check the launch dimensions provided for an
  29564. OpenACC compute region, or routine. Defaulted values are
  29565. represented as -1 and non-constant values as 0. The FN_LEVEL is
  29566. negative for the function corresponding to the compute region. For
  29567. a routine it is the outermost level at which partitioned execution
  29568. may be spawned. The hook should verify non-default values. If
  29569. DECL is NULL, global defaults are being validated and unspecified
  29570. defaults should be filled in. Diagnostics should be issued as
  29571. appropriate. Return true, if changes have been made. You must
  29572. override this hook to provide dimensions larger than 1.
  29573. -- Target Hook: int TARGET_GOACC_DIM_LIMIT (int AXIS)
  29574. This hook should return the maximum size of a particular dimension,
  29575. or zero if unbounded.
  29576. -- Target Hook: bool TARGET_GOACC_FORK_JOIN (gcall *CALL, const int
  29577. *DIMS, bool IS_FORK)
  29578. This hook can be used to convert IFN_GOACC_FORK and IFN_GOACC_JOIN
  29579. function calls to target-specific gimple, or indicate whether they
  29580. should be retained. It is executed during the oacc_device_lower
  29581. pass. It should return true, if the call should be retained. It
  29582. should return false, if it is to be deleted (either because
  29583. target-specific gimple has been inserted before it, or there is no
  29584. need for it). The default hook returns false, if there are no RTL
  29585. expanders for them.
  29586. -- Target Hook: void TARGET_GOACC_REDUCTION (gcall *CALL)
  29587. This hook is used by the oacc_transform pass to expand calls to the
  29588. GOACC_REDUCTION internal function, into a sequence of gimple
  29589. instructions. CALL is gimple statement containing the call to the
  29590. function. This hook removes statement CALL after the expanded
  29591. sequence has been inserted. This hook is also responsible for
  29592. allocating any storage for reductions when necessary.
  29593. -- Target Hook: tree TARGET_PREFERRED_ELSE_VALUE (unsigned IFN, tree
  29594. TYPE, unsigned NOPS, tree *OPS)
  29595. This hook returns the target's preferred final argument for a call
  29596. to conditional internal function IFN (really of type
  29597. 'internal_fn'). TYPE specifies the return type of the function and
  29598. OPS are the operands to the conditional operation, of which there
  29599. are NOPS.
  29600. For example, if IFN is 'IFN_COND_ADD', the hook returns a value of
  29601. type TYPE that should be used when 'OPS[0]' and 'OPS[1]' are
  29602. conditionally added together.
  29603. This hook is only relevant if the target supports conditional
  29604. patterns like 'cond_addM'. The default implementation returns a
  29605. zero constant of type TYPE.
  29606. 
  29607. File: gccint.info, Node: Anchored Addresses, Next: Condition Code, Prev: Addressing Modes, Up: Target Macros
  29608. 18.14 Anchored Addresses
  29609. ========================
  29610. GCC usually addresses every static object as a separate entity. For
  29611. example, if we have:
  29612. static int a, b, c;
  29613. int foo (void) { return a + b + c; }
  29614. the code for 'foo' will usually calculate three separate symbolic
  29615. addresses: those of 'a', 'b' and 'c'. On some targets, it would be
  29616. better to calculate just one symbolic address and access the three
  29617. variables relative to it. The equivalent pseudocode would be something
  29618. like:
  29619. int foo (void)
  29620. {
  29621. register int *xr = &x;
  29622. return xr[&a - &x] + xr[&b - &x] + xr[&c - &x];
  29623. }
  29624. (which isn't valid C). We refer to shared addresses like 'x' as
  29625. "section anchors". Their use is controlled by '-fsection-anchors'.
  29626. The hooks below describe the target properties that GCC needs to know
  29627. in order to make effective use of section anchors. It won't use section
  29628. anchors at all unless either 'TARGET_MIN_ANCHOR_OFFSET' or
  29629. 'TARGET_MAX_ANCHOR_OFFSET' is set to a nonzero value.
  29630. -- Target Hook: HOST_WIDE_INT TARGET_MIN_ANCHOR_OFFSET
  29631. The minimum offset that should be applied to a section anchor. On
  29632. most targets, it should be the smallest offset that can be applied
  29633. to a base register while still giving a legitimate address for
  29634. every mode. The default value is 0.
  29635. -- Target Hook: HOST_WIDE_INT TARGET_MAX_ANCHOR_OFFSET
  29636. Like 'TARGET_MIN_ANCHOR_OFFSET', but the maximum (inclusive) offset
  29637. that should be applied to section anchors. The default value is 0.
  29638. -- Target Hook: void TARGET_ASM_OUTPUT_ANCHOR (rtx X)
  29639. Write the assembly code to define section anchor X, which is a
  29640. 'SYMBOL_REF' for which 'SYMBOL_REF_ANCHOR_P (X)' is true. The hook
  29641. is called with the assembly output position set to the beginning of
  29642. 'SYMBOL_REF_BLOCK (X)'.
  29643. If 'ASM_OUTPUT_DEF' is available, the hook's default definition
  29644. uses it to define the symbol as '. + SYMBOL_REF_BLOCK_OFFSET (X)'.
  29645. If 'ASM_OUTPUT_DEF' is not available, the hook's default definition
  29646. is 'NULL', which disables the use of section anchors altogether.
  29647. -- Target Hook: bool TARGET_USE_ANCHORS_FOR_SYMBOL_P (const_rtx X)
  29648. Return true if GCC should attempt to use anchors to access
  29649. 'SYMBOL_REF' X. You can assume 'SYMBOL_REF_HAS_BLOCK_INFO_P (X)'
  29650. and '!SYMBOL_REF_ANCHOR_P (X)'.
  29651. The default version is correct for most targets, but you might need
  29652. to intercept this hook to handle things like target-specific
  29653. attributes or target-specific sections.
  29654. 
  29655. File: gccint.info, Node: Condition Code, Next: Costs, Prev: Anchored Addresses, Up: Target Macros
  29656. 18.15 Condition Code Status
  29657. ===========================
  29658. The macros in this section can be split in two families, according to
  29659. the two ways of representing condition codes in GCC.
  29660. The first representation is the so called '(cc0)' representation (*note
  29661. Jump Patterns::), where all instructions can have an implicit clobber of
  29662. the condition codes. The second is the condition code register
  29663. representation, which provides better schedulability for architectures
  29664. that do have a condition code register, but on which most instructions
  29665. do not affect it. The latter category includes most RISC machines.
  29666. The implicit clobbering poses a strong restriction on the placement of
  29667. the definition and use of the condition code. In the past the
  29668. definition and use were always adjacent. However, recent changes to
  29669. support trapping arithmatic may result in the definition and user being
  29670. in different blocks. Thus, there may be a 'NOTE_INSN_BASIC_BLOCK'
  29671. between them. Additionally, the definition may be the source of
  29672. exception handling edges.
  29673. These restrictions can prevent important optimizations on some
  29674. machines. For example, on the IBM RS/6000, there is a delay for taken
  29675. branches unless the condition code register is set three instructions
  29676. earlier than the conditional branch. The instruction scheduler cannot
  29677. perform this optimization if it is not permitted to separate the
  29678. definition and use of the condition code register.
  29679. For this reason, it is possible and suggested to use a register to
  29680. represent the condition code for new ports. If there is a specific
  29681. condition code register in the machine, use a hard register. If the
  29682. condition code or comparison result can be placed in any general
  29683. register, or if there are multiple condition registers, use a pseudo
  29684. register. Registers used to store the condition code value will usually
  29685. have a mode that is in class 'MODE_CC'.
  29686. Alternatively, you can use 'BImode' if the comparison operator is
  29687. specified already in the compare instruction. In this case, you are not
  29688. interested in most macros in this section.
  29689. * Menu:
  29690. * CC0 Condition Codes:: Old style representation of condition codes.
  29691. * MODE_CC Condition Codes:: Modern representation of condition codes.
  29692. 
  29693. File: gccint.info, Node: CC0 Condition Codes, Next: MODE_CC Condition Codes, Up: Condition Code
  29694. 18.15.1 Representation of condition codes using '(cc0)'
  29695. -------------------------------------------------------
  29696. The file 'conditions.h' defines a variable 'cc_status' to describe how
  29697. the condition code was computed (in case the interpretation of the
  29698. condition code depends on the instruction that it was set by). This
  29699. variable contains the RTL expressions on which the condition code is
  29700. currently based, and several standard flags.
  29701. Sometimes additional machine-specific flags must be defined in the
  29702. machine description header file. It can also add additional
  29703. machine-specific information by defining 'CC_STATUS_MDEP'.
  29704. -- Macro: CC_STATUS_MDEP
  29705. C code for a data type which is used for declaring the 'mdep'
  29706. component of 'cc_status'. It defaults to 'int'.
  29707. This macro is not used on machines that do not use 'cc0'.
  29708. -- Macro: CC_STATUS_MDEP_INIT
  29709. A C expression to initialize the 'mdep' field to "empty". The
  29710. default definition does nothing, since most machines don't use the
  29711. field anyway. If you want to use the field, you should probably
  29712. define this macro to initialize it.
  29713. This macro is not used on machines that do not use 'cc0'.
  29714. -- Macro: NOTICE_UPDATE_CC (EXP, INSN)
  29715. A C compound statement to set the components of 'cc_status'
  29716. appropriately for an insn INSN whose body is EXP. It is this
  29717. macro's responsibility to recognize insns that set the condition
  29718. code as a byproduct of other activity as well as those that
  29719. explicitly set '(cc0)'.
  29720. This macro is not used on machines that do not use 'cc0'.
  29721. If there are insns that do not set the condition code but do alter
  29722. other machine registers, this macro must check to see whether they
  29723. invalidate the expressions that the condition code is recorded as
  29724. reflecting. For example, on the 68000, insns that store in address
  29725. registers do not set the condition code, which means that usually
  29726. 'NOTICE_UPDATE_CC' can leave 'cc_status' unaltered for such insns.
  29727. But suppose that the previous insn set the condition code based on
  29728. location 'a4@(102)' and the current insn stores a new value in
  29729. 'a4'. Although the condition code is not changed by this, it will
  29730. no longer be true that it reflects the contents of 'a4@(102)'.
  29731. Therefore, 'NOTICE_UPDATE_CC' must alter 'cc_status' in this case
  29732. to say that nothing is known about the condition code value.
  29733. The definition of 'NOTICE_UPDATE_CC' must be prepared to deal with
  29734. the results of peephole optimization: insns whose patterns are
  29735. 'parallel' RTXs containing various 'reg', 'mem' or constants which
  29736. are just the operands. The RTL structure of these insns is not
  29737. sufficient to indicate what the insns actually do. What
  29738. 'NOTICE_UPDATE_CC' should do when it sees one is just to run
  29739. 'CC_STATUS_INIT'.
  29740. A possible definition of 'NOTICE_UPDATE_CC' is to call a function
  29741. that looks at an attribute (*note Insn Attributes::) named, for
  29742. example, 'cc'. This avoids having detailed information about
  29743. patterns in two places, the 'md' file and in 'NOTICE_UPDATE_CC'.
  29744. 
  29745. File: gccint.info, Node: MODE_CC Condition Codes, Prev: CC0 Condition Codes, Up: Condition Code
  29746. 18.15.2 Representation of condition codes using registers
  29747. ---------------------------------------------------------
  29748. -- Macro: SELECT_CC_MODE (OP, X, Y)
  29749. On many machines, the condition code may be produced by other
  29750. instructions than compares, for example the branch can use directly
  29751. the condition code set by a subtract instruction. However, on some
  29752. machines when the condition code is set this way some bits (such as
  29753. the overflow bit) are not set in the same way as a test
  29754. instruction, so that a different branch instruction must be used
  29755. for some conditional branches. When this happens, use the machine
  29756. mode of the condition code register to record different formats of
  29757. the condition code register. Modes can also be used to record
  29758. which compare instruction (e.g. a signed or an unsigned comparison)
  29759. produced the condition codes.
  29760. If other modes than 'CCmode' are required, add them to
  29761. 'MACHINE-modes.def' and define 'SELECT_CC_MODE' to choose a mode
  29762. given an operand of a compare. This is needed because the modes
  29763. have to be chosen not only during RTL generation but also, for
  29764. example, by instruction combination. The result of
  29765. 'SELECT_CC_MODE' should be consistent with the mode used in the
  29766. patterns; for example to support the case of the add on the SPARC
  29767. discussed above, we have the pattern
  29768. (define_insn ""
  29769. [(set (reg:CCNZ 0)
  29770. (compare:CCNZ
  29771. (plus:SI (match_operand:SI 0 "register_operand" "%r")
  29772. (match_operand:SI 1 "arith_operand" "rI"))
  29773. (const_int 0)))]
  29774. ""
  29775. "...")
  29776. together with a 'SELECT_CC_MODE' that returns 'CCNZmode' for
  29777. comparisons whose argument is a 'plus':
  29778. #define SELECT_CC_MODE(OP,X,Y) \
  29779. (GET_MODE_CLASS (GET_MODE (X)) == MODE_FLOAT \
  29780. ? ((OP == LT || OP == LE || OP == GT || OP == GE) \
  29781. ? CCFPEmode : CCFPmode) \
  29782. : ((GET_CODE (X) == PLUS || GET_CODE (X) == MINUS \
  29783. || GET_CODE (X) == NEG || GET_CODE (x) == ASHIFT) \
  29784. ? CCNZmode : CCmode))
  29785. Another reason to use modes is to retain information on which
  29786. operands were used by the comparison; see 'REVERSIBLE_CC_MODE'
  29787. later in this section.
  29788. You should define this macro if and only if you define extra CC
  29789. modes in 'MACHINE-modes.def'.
  29790. -- Target Hook: void TARGET_CANONICALIZE_COMPARISON (int *CODE, rtx
  29791. *OP0, rtx *OP1, bool OP0_PRESERVE_VALUE)
  29792. On some machines not all possible comparisons are defined, but you
  29793. can convert an invalid comparison into a valid one. For example,
  29794. the Alpha does not have a 'GT' comparison, but you can use an 'LT'
  29795. comparison instead and swap the order of the operands.
  29796. On such machines, implement this hook to do any required
  29797. conversions. CODE is the initial comparison code and OP0 and OP1
  29798. are the left and right operands of the comparison, respectively.
  29799. If OP0_PRESERVE_VALUE is 'true' the implementation is not allowed
  29800. to change the value of OP0 since the value might be used in RTXs
  29801. which aren't comparisons. E.g. the implementation is not allowed
  29802. to swap operands in that case.
  29803. GCC will not assume that the comparison resulting from this macro
  29804. is valid but will see if the resulting insn matches a pattern in
  29805. the 'md' file.
  29806. You need not to implement this hook if it would never change the
  29807. comparison code or operands.
  29808. -- Macro: REVERSIBLE_CC_MODE (MODE)
  29809. A C expression whose value is one if it is always safe to reverse a
  29810. comparison whose mode is MODE. If 'SELECT_CC_MODE' can ever return
  29811. MODE for a floating-point inequality comparison, then
  29812. 'REVERSIBLE_CC_MODE (MODE)' must be zero.
  29813. You need not define this macro if it would always returns zero or
  29814. if the floating-point format is anything other than
  29815. 'IEEE_FLOAT_FORMAT'. For example, here is the definition used on
  29816. the SPARC, where floating-point inequality comparisons are given
  29817. either 'CCFPEmode' or 'CCFPmode':
  29818. #define REVERSIBLE_CC_MODE(MODE) \
  29819. ((MODE) != CCFPEmode && (MODE) != CCFPmode)
  29820. -- Macro: REVERSE_CONDITION (CODE, MODE)
  29821. A C expression whose value is reversed condition code of the CODE
  29822. for comparison done in CC_MODE MODE. The macro is used only in
  29823. case 'REVERSIBLE_CC_MODE (MODE)' is nonzero. Define this macro in
  29824. case machine has some non-standard way how to reverse certain
  29825. conditionals. For instance in case all floating point conditions
  29826. are non-trapping, compiler may freely convert unordered compares to
  29827. ordered ones. Then definition may look like:
  29828. #define REVERSE_CONDITION(CODE, MODE) \
  29829. ((MODE) != CCFPmode ? reverse_condition (CODE) \
  29830. : reverse_condition_maybe_unordered (CODE))
  29831. -- Target Hook: bool TARGET_FIXED_CONDITION_CODE_REGS (unsigned int
  29832. *P1, unsigned int *P2)
  29833. On targets which do not use '(cc0)', and which use a hard register
  29834. rather than a pseudo-register to hold condition codes, the regular
  29835. CSE passes are often not able to identify cases in which the hard
  29836. register is set to a common value. Use this hook to enable a small
  29837. pass which optimizes such cases. This hook should return true to
  29838. enable this pass, and it should set the integers to which its
  29839. arguments point to the hard register numbers used for condition
  29840. codes. When there is only one such register, as is true on most
  29841. systems, the integer pointed to by P2 should be set to
  29842. 'INVALID_REGNUM'.
  29843. The default version of this hook returns false.
  29844. -- Target Hook: machine_mode TARGET_CC_MODES_COMPATIBLE (machine_mode
  29845. M1, machine_mode M2)
  29846. On targets which use multiple condition code modes in class
  29847. 'MODE_CC', it is sometimes the case that a comparison can be
  29848. validly done in more than one mode. On such a system, define this
  29849. target hook to take two mode arguments and to return a mode in
  29850. which both comparisons may be validly done. If there is no such
  29851. mode, return 'VOIDmode'.
  29852. The default version of this hook checks whether the modes are the
  29853. same. If they are, it returns that mode. If they are different,
  29854. it returns 'VOIDmode'.
  29855. -- Target Hook: unsigned int TARGET_FLAGS_REGNUM
  29856. If the target has a dedicated flags register, and it needs to use
  29857. the post-reload comparison elimination pass, or the delay slot
  29858. filler pass, then this value should be set appropriately.
  29859. 
  29860. File: gccint.info, Node: Costs, Next: Scheduling, Prev: Condition Code, Up: Target Macros
  29861. 18.16 Describing Relative Costs of Operations
  29862. =============================================
  29863. These macros let you describe the relative speed of various operations
  29864. on the target machine.
  29865. -- Macro: REGISTER_MOVE_COST (MODE, FROM, TO)
  29866. A C expression for the cost of moving data of mode MODE from a
  29867. register in class FROM to one in class TO. The classes are
  29868. expressed using the enumeration values such as 'GENERAL_REGS'. A
  29869. value of 2 is the default; other values are interpreted relative to
  29870. that.
  29871. It is not required that the cost always equal 2 when FROM is the
  29872. same as TO; on some machines it is expensive to move between
  29873. registers if they are not general registers.
  29874. If reload sees an insn consisting of a single 'set' between two
  29875. hard registers, and if 'REGISTER_MOVE_COST' applied to their
  29876. classes returns a value of 2, reload does not check to ensure that
  29877. the constraints of the insn are met. Setting a cost of other than
  29878. 2 will allow reload to verify that the constraints are met. You
  29879. should do this if the 'movM' pattern's constraints do not allow
  29880. such copying.
  29881. These macros are obsolete, new ports should use the target hook
  29882. 'TARGET_REGISTER_MOVE_COST' instead.
  29883. -- Target Hook: int TARGET_REGISTER_MOVE_COST (machine_mode MODE,
  29884. reg_class_t FROM, reg_class_t TO)
  29885. This target hook should return the cost of moving data of mode MODE
  29886. from a register in class FROM to one in class TO. The classes are
  29887. expressed using the enumeration values such as 'GENERAL_REGS'. A
  29888. value of 2 is the default; other values are interpreted relative to
  29889. that.
  29890. It is not required that the cost always equal 2 when FROM is the
  29891. same as TO; on some machines it is expensive to move between
  29892. registers if they are not general registers.
  29893. If reload sees an insn consisting of a single 'set' between two
  29894. hard registers, and if 'TARGET_REGISTER_MOVE_COST' applied to their
  29895. classes returns a value of 2, reload does not check to ensure that
  29896. the constraints of the insn are met. Setting a cost of other than
  29897. 2 will allow reload to verify that the constraints are met. You
  29898. should do this if the 'movM' pattern's constraints do not allow
  29899. such copying.
  29900. The default version of this function returns 2.
  29901. -- Macro: MEMORY_MOVE_COST (MODE, CLASS, IN)
  29902. A C expression for the cost of moving data of mode MODE between a
  29903. register of class CLASS and memory; IN is zero if the value is to
  29904. be written to memory, nonzero if it is to be read in. This cost is
  29905. relative to those in 'REGISTER_MOVE_COST'. If moving between
  29906. registers and memory is more expensive than between two registers,
  29907. you should define this macro to express the relative cost.
  29908. If you do not define this macro, GCC uses a default cost of 4 plus
  29909. the cost of copying via a secondary reload register, if one is
  29910. needed. If your machine requires a secondary reload register to
  29911. copy between memory and a register of CLASS but the reload
  29912. mechanism is more complex than copying via an intermediate, define
  29913. this macro to reflect the actual cost of the move.
  29914. GCC defines the function 'memory_move_secondary_cost' if secondary
  29915. reloads are needed. It computes the costs due to copying via a
  29916. secondary register. If your machine copies from memory using a
  29917. secondary register in the conventional way but the default base
  29918. value of 4 is not correct for your machine, define this macro to
  29919. add some other value to the result of that function. The arguments
  29920. to that function are the same as to this macro.
  29921. These macros are obsolete, new ports should use the target hook
  29922. 'TARGET_MEMORY_MOVE_COST' instead.
  29923. -- Target Hook: int TARGET_MEMORY_MOVE_COST (machine_mode MODE,
  29924. reg_class_t RCLASS, bool IN)
  29925. This target hook should return the cost of moving data of mode MODE
  29926. between a register of class RCLASS and memory; IN is 'false' if the
  29927. value is to be written to memory, 'true' if it is to be read in.
  29928. This cost is relative to those in 'TARGET_REGISTER_MOVE_COST'. If
  29929. moving between registers and memory is more expensive than between
  29930. two registers, you should add this target hook to express the
  29931. relative cost.
  29932. If you do not add this target hook, GCC uses a default cost of 4
  29933. plus the cost of copying via a secondary reload register, if one is
  29934. needed. If your machine requires a secondary reload register to
  29935. copy between memory and a register of RCLASS but the reload
  29936. mechanism is more complex than copying via an intermediate, use
  29937. this target hook to reflect the actual cost of the move.
  29938. GCC defines the function 'memory_move_secondary_cost' if secondary
  29939. reloads are needed. It computes the costs due to copying via a
  29940. secondary register. If your machine copies from memory using a
  29941. secondary register in the conventional way but the default base
  29942. value of 4 is not correct for your machine, use this target hook to
  29943. add some other value to the result of that function. The arguments
  29944. to that function are the same as to this target hook.
  29945. -- Macro: BRANCH_COST (SPEED_P, PREDICTABLE_P)
  29946. A C expression for the cost of a branch instruction. A value of 1
  29947. is the default; other values are interpreted relative to that.
  29948. Parameter SPEED_P is true when the branch in question should be
  29949. optimized for speed. When it is false, 'BRANCH_COST' should return
  29950. a value optimal for code size rather than performance.
  29951. PREDICTABLE_P is true for well-predicted branches. On many
  29952. architectures the 'BRANCH_COST' can be reduced then.
  29953. Here are additional macros which do not specify precise relative costs,
  29954. but only that certain actions are more expensive than GCC would
  29955. ordinarily expect.
  29956. -- Macro: SLOW_BYTE_ACCESS
  29957. Define this macro as a C expression which is nonzero if accessing
  29958. less than a word of memory (i.e. a 'char' or a 'short') is no
  29959. faster than accessing a word of memory, i.e., if such access
  29960. require more than one instruction or if there is no difference in
  29961. cost between byte and (aligned) word loads.
  29962. When this macro is not defined, the compiler will access a field by
  29963. finding the smallest containing object; when it is defined, a
  29964. fullword load will be used if alignment permits. Unless bytes
  29965. accesses are faster than word accesses, using word accesses is
  29966. preferable since it may eliminate subsequent memory access if
  29967. subsequent accesses occur to other fields in the same word of the
  29968. structure, but to different bytes.
  29969. -- Target Hook: bool TARGET_SLOW_UNALIGNED_ACCESS (machine_mode MODE,
  29970. unsigned int ALIGN)
  29971. This hook returns true if memory accesses described by the MODE and
  29972. ALIGNMENT parameters have a cost many times greater than aligned
  29973. accesses, for example if they are emulated in a trap handler. This
  29974. hook is invoked only for unaligned accesses, i.e. when 'ALIGNMENT <
  29975. GET_MODE_ALIGNMENT (MODE)'.
  29976. When this hook returns true, the compiler will act as if
  29977. 'STRICT_ALIGNMENT' were true when generating code for block moves.
  29978. This can cause significantly more instructions to be produced.
  29979. Therefore, do not make this hook return true if unaligned accesses
  29980. only add a cycle or two to the time for a memory access.
  29981. The hook must return true whenever 'STRICT_ALIGNMENT' is true. The
  29982. default implementation returns 'STRICT_ALIGNMENT'.
  29983. -- Macro: MOVE_RATIO (SPEED)
  29984. The threshold of number of scalar memory-to-memory move insns,
  29985. _below_ which a sequence of insns should be generated instead of a
  29986. string move insn or a library call. Increasing the value will
  29987. always make code faster, but eventually incurs high cost in
  29988. increased code size.
  29989. Note that on machines where the corresponding move insn is a
  29990. 'define_expand' that emits a sequence of insns, this macro counts
  29991. the number of such sequences.
  29992. The parameter SPEED is true if the code is currently being
  29993. optimized for speed rather than size.
  29994. If you don't define this, a reasonable default is used.
  29995. -- Target Hook: bool TARGET_USE_BY_PIECES_INFRASTRUCTURE_P (unsigned
  29996. HOST_WIDE_INT SIZE, unsigned int ALIGNMENT, enum
  29997. by_pieces_operation OP, bool SPEED_P)
  29998. GCC will attempt several strategies when asked to copy between two
  29999. areas of memory, or to set, clear or store to memory, for example
  30000. when copying a 'struct'. The 'by_pieces' infrastructure implements
  30001. such memory operations as a sequence of load, store or move insns.
  30002. Alternate strategies are to expand the 'cpymem' or 'setmem' optabs,
  30003. to emit a library call, or to emit unit-by-unit, loop-based
  30004. operations.
  30005. This target hook should return true if, for a memory operation with
  30006. a given SIZE and ALIGNMENT, using the 'by_pieces' infrastructure is
  30007. expected to result in better code generation. Both SIZE and
  30008. ALIGNMENT are measured in terms of storage units.
  30009. The parameter OP is one of: 'CLEAR_BY_PIECES', 'MOVE_BY_PIECES',
  30010. 'SET_BY_PIECES', 'STORE_BY_PIECES' or 'COMPARE_BY_PIECES'. These
  30011. describe the type of memory operation under consideration.
  30012. The parameter SPEED_P is true if the code is currently being
  30013. optimized for speed rather than size.
  30014. Returning true for higher values of SIZE can improve code
  30015. generation for speed if the target does not provide an
  30016. implementation of the 'cpymem' or 'setmem' standard names, if the
  30017. 'cpymem' or 'setmem' implementation would be more expensive than a
  30018. sequence of insns, or if the overhead of a library call would
  30019. dominate that of the body of the memory operation.
  30020. Returning true for higher values of 'size' may also cause an
  30021. increase in code size, for example where the number of insns
  30022. emitted to perform a move would be greater than that of a library
  30023. call.
  30024. -- Target Hook: int TARGET_COMPARE_BY_PIECES_BRANCH_RATIO (machine_mode
  30025. MODE)
  30026. When expanding a block comparison in MODE, gcc can try to reduce
  30027. the number of branches at the expense of more memory operations.
  30028. This hook allows the target to override the default choice. It
  30029. should return the factor by which branches should be reduced over
  30030. the plain expansion with one comparison per MODE-sized piece. A
  30031. port can also prevent a particular mode from being used for block
  30032. comparisons by returning a negative number from this hook.
  30033. -- Macro: MOVE_MAX_PIECES
  30034. A C expression used by 'move_by_pieces' to determine the largest
  30035. unit a load or store used to copy memory is. Defaults to
  30036. 'MOVE_MAX'.
  30037. -- Macro: STORE_MAX_PIECES
  30038. A C expression used by 'store_by_pieces' to determine the largest
  30039. unit a store used to memory is. Defaults to 'MOVE_MAX_PIECES', or
  30040. two times the size of 'HOST_WIDE_INT', whichever is smaller.
  30041. -- Macro: COMPARE_MAX_PIECES
  30042. A C expression used by 'compare_by_pieces' to determine the largest
  30043. unit a load or store used to compare memory is. Defaults to
  30044. 'MOVE_MAX_PIECES'.
  30045. -- Macro: CLEAR_RATIO (SPEED)
  30046. The threshold of number of scalar move insns, _below_ which a
  30047. sequence of insns should be generated to clear memory instead of a
  30048. string clear insn or a library call. Increasing the value will
  30049. always make code faster, but eventually incurs high cost in
  30050. increased code size.
  30051. The parameter SPEED is true if the code is currently being
  30052. optimized for speed rather than size.
  30053. If you don't define this, a reasonable default is used.
  30054. -- Macro: SET_RATIO (SPEED)
  30055. The threshold of number of scalar move insns, _below_ which a
  30056. sequence of insns should be generated to set memory to a constant
  30057. value, instead of a block set insn or a library call. Increasing
  30058. the value will always make code faster, but eventually incurs high
  30059. cost in increased code size.
  30060. The parameter SPEED is true if the code is currently being
  30061. optimized for speed rather than size.
  30062. If you don't define this, it defaults to the value of 'MOVE_RATIO'.
  30063. -- Macro: USE_LOAD_POST_INCREMENT (MODE)
  30064. A C expression used to determine whether a load postincrement is a
  30065. good thing to use for a given mode. Defaults to the value of
  30066. 'HAVE_POST_INCREMENT'.
  30067. -- Macro: USE_LOAD_POST_DECREMENT (MODE)
  30068. A C expression used to determine whether a load postdecrement is a
  30069. good thing to use for a given mode. Defaults to the value of
  30070. 'HAVE_POST_DECREMENT'.
  30071. -- Macro: USE_LOAD_PRE_INCREMENT (MODE)
  30072. A C expression used to determine whether a load preincrement is a
  30073. good thing to use for a given mode. Defaults to the value of
  30074. 'HAVE_PRE_INCREMENT'.
  30075. -- Macro: USE_LOAD_PRE_DECREMENT (MODE)
  30076. A C expression used to determine whether a load predecrement is a
  30077. good thing to use for a given mode. Defaults to the value of
  30078. 'HAVE_PRE_DECREMENT'.
  30079. -- Macro: USE_STORE_POST_INCREMENT (MODE)
  30080. A C expression used to determine whether a store postincrement is a
  30081. good thing to use for a given mode. Defaults to the value of
  30082. 'HAVE_POST_INCREMENT'.
  30083. -- Macro: USE_STORE_POST_DECREMENT (MODE)
  30084. A C expression used to determine whether a store postdecrement is a
  30085. good thing to use for a given mode. Defaults to the value of
  30086. 'HAVE_POST_DECREMENT'.
  30087. -- Macro: USE_STORE_PRE_INCREMENT (MODE)
  30088. This macro is used to determine whether a store preincrement is a
  30089. good thing to use for a given mode. Defaults to the value of
  30090. 'HAVE_PRE_INCREMENT'.
  30091. -- Macro: USE_STORE_PRE_DECREMENT (MODE)
  30092. This macro is used to determine whether a store predecrement is a
  30093. good thing to use for a given mode. Defaults to the value of
  30094. 'HAVE_PRE_DECREMENT'.
  30095. -- Macro: NO_FUNCTION_CSE
  30096. Define this macro to be true if it is as good or better to call a
  30097. constant function address than to call an address kept in a
  30098. register.
  30099. -- Macro: LOGICAL_OP_NON_SHORT_CIRCUIT
  30100. Define this macro if a non-short-circuit operation produced by
  30101. 'fold_range_test ()' is optimal. This macro defaults to true if
  30102. 'BRANCH_COST' is greater than or equal to the value 2.
  30103. -- Target Hook: bool TARGET_OPTAB_SUPPORTED_P (int OP, machine_mode
  30104. MODE1, machine_mode MODE2, optimization_type OPT_TYPE)
  30105. Return true if the optimizers should use optab OP with modes MODE1
  30106. and MODE2 for optimization type OPT_TYPE. The optab is known to
  30107. have an associated '.md' instruction whose C condition is true.
  30108. MODE2 is only meaningful for conversion optabs; for direct optabs
  30109. it is a copy of MODE1.
  30110. For example, when called with OP equal to 'rint_optab' and MODE1
  30111. equal to 'DFmode', the hook should say whether the optimizers
  30112. should use optab 'rintdf2'.
  30113. The default hook returns true for all inputs.
  30114. -- Target Hook: bool TARGET_RTX_COSTS (rtx X, machine_mode MODE, int
  30115. OUTER_CODE, int OPNO, int *TOTAL, bool SPEED)
  30116. This target hook describes the relative costs of RTL expressions.
  30117. The cost may depend on the precise form of the expression, which is
  30118. available for examination in X, and the fact that X appears as
  30119. operand OPNO of an expression with rtx code OUTER_CODE. That is,
  30120. the hook can assume that there is some rtx Y such that 'GET_CODE
  30121. (Y) == OUTER_CODE' and such that either (a) 'XEXP (Y, OPNO) == X'
  30122. or (b) 'XVEC (Y, OPNO)' contains X.
  30123. MODE is X's machine mode, or for cases like 'const_int' that do not
  30124. have a mode, the mode in which X is used.
  30125. In implementing this hook, you can use the construct 'COSTS_N_INSNS
  30126. (N)' to specify a cost equal to N fast instructions.
  30127. On entry to the hook, '*TOTAL' contains a default estimate for the
  30128. cost of the expression. The hook should modify this value as
  30129. necessary. Traditionally, the default costs are 'COSTS_N_INSNS
  30130. (5)' for multiplications, 'COSTS_N_INSNS (7)' for division and
  30131. modulus operations, and 'COSTS_N_INSNS (1)' for all other
  30132. operations.
  30133. When optimizing for code size, i.e. when 'speed' is false, this
  30134. target hook should be used to estimate the relative size cost of an
  30135. expression, again relative to 'COSTS_N_INSNS'.
  30136. The hook returns true when all subexpressions of X have been
  30137. processed, and false when 'rtx_cost' should recurse.
  30138. -- Target Hook: int TARGET_ADDRESS_COST (rtx ADDRESS, machine_mode
  30139. MODE, addr_space_t AS, bool SPEED)
  30140. This hook computes the cost of an addressing mode that contains
  30141. ADDRESS. If not defined, the cost is computed from the ADDRESS
  30142. expression and the 'TARGET_RTX_COST' hook.
  30143. For most CISC machines, the default cost is a good approximation of
  30144. the true cost of the addressing mode. However, on RISC machines,
  30145. all instructions normally have the same length and execution time.
  30146. Hence all addresses will have equal costs.
  30147. In cases where more than one form of an address is known, the form
  30148. with the lowest cost will be used. If multiple forms have the
  30149. same, lowest, cost, the one that is the most complex will be used.
  30150. For example, suppose an address that is equal to the sum of a
  30151. register and a constant is used twice in the same basic block.
  30152. When this macro is not defined, the address will be computed in a
  30153. register and memory references will be indirect through that
  30154. register. On machines where the cost of the addressing mode
  30155. containing the sum is no higher than that of a simple indirect
  30156. reference, this will produce an additional instruction and possibly
  30157. require an additional register. Proper specification of this macro
  30158. eliminates this overhead for such machines.
  30159. This hook is never called with an invalid address.
  30160. On machines where an address involving more than one register is as
  30161. cheap as an address computation involving only one register,
  30162. defining 'TARGET_ADDRESS_COST' to reflect this can cause two
  30163. registers to be live over a region of code where only one would
  30164. have been if 'TARGET_ADDRESS_COST' were not defined in that manner.
  30165. This effect should be considered in the definition of this macro.
  30166. Equivalent costs should probably only be given to addresses with
  30167. different numbers of registers on machines with lots of registers.
  30168. -- Target Hook: int TARGET_INSN_COST (rtx_insn *INSN, bool SPEED)
  30169. This target hook describes the relative costs of RTL instructions.
  30170. In implementing this hook, you can use the construct 'COSTS_N_INSNS
  30171. (N)' to specify a cost equal to N fast instructions.
  30172. When optimizing for code size, i.e. when 'speed' is false, this
  30173. target hook should be used to estimate the relative size cost of an
  30174. expression, again relative to 'COSTS_N_INSNS'.
  30175. -- Target Hook: unsigned int TARGET_MAX_NOCE_IFCVT_SEQ_COST (edge E)
  30176. This hook returns a value in the same units as 'TARGET_RTX_COSTS',
  30177. giving the maximum acceptable cost for a sequence generated by the
  30178. RTL if-conversion pass when conditional execution is not available.
  30179. The RTL if-conversion pass attempts to convert conditional
  30180. operations that would require a branch to a series of unconditional
  30181. operations and 'movMODEcc' insns. This hook returns the maximum
  30182. cost of the unconditional instructions and the 'movMODEcc' insns.
  30183. RTL if-conversion is cancelled if the cost of the converted
  30184. sequence is greater than the value returned by this hook.
  30185. 'e' is the edge between the basic block containing the conditional
  30186. branch to the basic block which would be executed if the condition
  30187. were true.
  30188. The default implementation of this hook uses the
  30189. 'max-rtl-if-conversion-[un]predictable' parameters if they are set,
  30190. and uses a multiple of 'BRANCH_COST' otherwise.
  30191. -- Target Hook: bool TARGET_NOCE_CONVERSION_PROFITABLE_P (rtx_insn
  30192. *SEQ, struct noce_if_info *IF_INFO)
  30193. This hook returns true if the instruction sequence 'seq' is a good
  30194. candidate as a replacement for the if-convertible sequence
  30195. described in 'if_info'.
  30196. -- Target Hook: bool TARGET_NO_SPECULATION_IN_DELAY_SLOTS_P (void)
  30197. This predicate controls the use of the eager delay slot filler to
  30198. disallow speculatively executed instructions being placed in delay
  30199. slots. Targets such as certain MIPS architectures possess both
  30200. branches with and without delay slots. As the eager delay slot
  30201. filler can decrease performance, disabling it is beneficial when
  30202. ordinary branches are available. Use of delay slot branches filled
  30203. using the basic filler is often still desirable as the delay slot
  30204. can hide a pipeline bubble.
  30205. -- Target Hook: HOST_WIDE_INT TARGET_ESTIMATED_POLY_VALUE (poly_int64
  30206. VAL)
  30207. Return an estimate of the runtime value of VAL, for use in things
  30208. like cost calculations or profiling frequencies. The default
  30209. implementation returns the lowest possible value of VAL.
  30210. 
  30211. File: gccint.info, Node: Scheduling, Next: Sections, Prev: Costs, Up: Target Macros
  30212. 18.17 Adjusting the Instruction Scheduler
  30213. =========================================
  30214. The instruction scheduler may need a fair amount of machine-specific
  30215. adjustment in order to produce good code. GCC provides several target
  30216. hooks for this purpose. It is usually enough to define just a few of
  30217. them: try the first ones in this list first.
  30218. -- Target Hook: int TARGET_SCHED_ISSUE_RATE (void)
  30219. This hook returns the maximum number of instructions that can ever
  30220. issue at the same time on the target machine. The default is one.
  30221. Although the insn scheduler can define itself the possibility of
  30222. issue an insn on the same cycle, the value can serve as an
  30223. additional constraint to issue insns on the same simulated
  30224. processor cycle (see hooks 'TARGET_SCHED_REORDER' and
  30225. 'TARGET_SCHED_REORDER2'). This value must be constant over the
  30226. entire compilation. If you need it to vary depending on what the
  30227. instructions are, you must use 'TARGET_SCHED_VARIABLE_ISSUE'.
  30228. -- Target Hook: int TARGET_SCHED_VARIABLE_ISSUE (FILE *FILE, int
  30229. VERBOSE, rtx_insn *INSN, int MORE)
  30230. This hook is executed by the scheduler after it has scheduled an
  30231. insn from the ready list. It should return the number of insns
  30232. which can still be issued in the current cycle. The default is
  30233. 'MORE - 1' for insns other than 'CLOBBER' and 'USE', which normally
  30234. are not counted against the issue rate. You should define this
  30235. hook if some insns take more machine resources than others, so that
  30236. fewer insns can follow them in the same cycle. FILE is either a
  30237. null pointer, or a stdio stream to write any debug output to.
  30238. VERBOSE is the verbose level provided by '-fsched-verbose-N'. INSN
  30239. is the instruction that was scheduled.
  30240. -- Target Hook: int TARGET_SCHED_ADJUST_COST (rtx_insn *INSN, int
  30241. DEP_TYPE1, rtx_insn *DEP_INSN, int COST, unsigned int DW)
  30242. This function corrects the value of COST based on the relationship
  30243. between INSN and DEP_INSN through a dependence of type dep_type,
  30244. and strength DW. It should return the new value. The default is
  30245. to make no adjustment to COST. This can be used for example to
  30246. specify to the scheduler using the traditional pipeline description
  30247. that an output- or anti-dependence does not incur the same cost as
  30248. a data-dependence. If the scheduler using the automaton based
  30249. pipeline description, the cost of anti-dependence is zero and the
  30250. cost of output-dependence is maximum of one and the difference of
  30251. latency times of the first and the second insns. If these values
  30252. are not acceptable, you could use the hook to modify them too. See
  30253. also *note Processor pipeline description::.
  30254. -- Target Hook: int TARGET_SCHED_ADJUST_PRIORITY (rtx_insn *INSN, int
  30255. PRIORITY)
  30256. This hook adjusts the integer scheduling priority PRIORITY of INSN.
  30257. It should return the new priority. Increase the priority to
  30258. execute INSN earlier, reduce the priority to execute INSN later.
  30259. Do not define this hook if you do not need to adjust the scheduling
  30260. priorities of insns.
  30261. -- Target Hook: int TARGET_SCHED_REORDER (FILE *FILE, int VERBOSE,
  30262. rtx_insn **READY, int *N_READYP, int CLOCK)
  30263. This hook is executed by the scheduler after it has scheduled the
  30264. ready list, to allow the machine description to reorder it (for
  30265. example to combine two small instructions together on 'VLIW'
  30266. machines). FILE is either a null pointer, or a stdio stream to
  30267. write any debug output to. VERBOSE is the verbose level provided
  30268. by '-fsched-verbose-N'. READY is a pointer to the ready list of
  30269. instructions that are ready to be scheduled. N_READYP is a pointer
  30270. to the number of elements in the ready list. The scheduler reads
  30271. the ready list in reverse order, starting with READY[*N_READYP - 1]
  30272. and going to READY[0]. CLOCK is the timer tick of the scheduler.
  30273. You may modify the ready list and the number of ready insns. The
  30274. return value is the number of insns that can issue this cycle;
  30275. normally this is just 'issue_rate'. See also
  30276. 'TARGET_SCHED_REORDER2'.
  30277. -- Target Hook: int TARGET_SCHED_REORDER2 (FILE *FILE, int VERBOSE,
  30278. rtx_insn **READY, int *N_READYP, int CLOCK)
  30279. Like 'TARGET_SCHED_REORDER', but called at a different time. That
  30280. function is called whenever the scheduler starts a new cycle. This
  30281. one is called once per iteration over a cycle, immediately after
  30282. 'TARGET_SCHED_VARIABLE_ISSUE'; it can reorder the ready list and
  30283. return the number of insns to be scheduled in the same cycle.
  30284. Defining this hook can be useful if there are frequent situations
  30285. where scheduling one insn causes other insns to become ready in the
  30286. same cycle. These other insns can then be taken into account
  30287. properly.
  30288. -- Target Hook: bool TARGET_SCHED_MACRO_FUSION_P (void)
  30289. This hook is used to check whether target platform supports macro
  30290. fusion.
  30291. -- Target Hook: bool TARGET_SCHED_MACRO_FUSION_PAIR_P (rtx_insn *PREV,
  30292. rtx_insn *CURR)
  30293. This hook is used to check whether two insns should be macro fused
  30294. for a target microarchitecture. If this hook returns true for the
  30295. given insn pair (PREV and CURR), the scheduler will put them into a
  30296. sched group, and they will not be scheduled apart. The two insns
  30297. will be either two SET insns or a compare and a conditional jump
  30298. and this hook should validate any dependencies needed to fuse the
  30299. two insns together.
  30300. -- Target Hook: void TARGET_SCHED_DEPENDENCIES_EVALUATION_HOOK
  30301. (rtx_insn *HEAD, rtx_insn *TAIL)
  30302. This hook is called after evaluation forward dependencies of insns
  30303. in chain given by two parameter values (HEAD and TAIL
  30304. correspondingly) but before insns scheduling of the insn chain.
  30305. For example, it can be used for better insn classification if it
  30306. requires analysis of dependencies. This hook can use backward and
  30307. forward dependencies of the insn scheduler because they are already
  30308. calculated.
  30309. -- Target Hook: void TARGET_SCHED_INIT (FILE *FILE, int VERBOSE, int
  30310. MAX_READY)
  30311. This hook is executed by the scheduler at the beginning of each
  30312. block of instructions that are to be scheduled. FILE is either a
  30313. null pointer, or a stdio stream to write any debug output to.
  30314. VERBOSE is the verbose level provided by '-fsched-verbose-N'.
  30315. MAX_READY is the maximum number of insns in the current scheduling
  30316. region that can be live at the same time. This can be used to
  30317. allocate scratch space if it is needed, e.g. by
  30318. 'TARGET_SCHED_REORDER'.
  30319. -- Target Hook: void TARGET_SCHED_FINISH (FILE *FILE, int VERBOSE)
  30320. This hook is executed by the scheduler at the end of each block of
  30321. instructions that are to be scheduled. It can be used to perform
  30322. cleanup of any actions done by the other scheduling hooks. FILE is
  30323. either a null pointer, or a stdio stream to write any debug output
  30324. to. VERBOSE is the verbose level provided by '-fsched-verbose-N'.
  30325. -- Target Hook: void TARGET_SCHED_INIT_GLOBAL (FILE *FILE, int VERBOSE,
  30326. int OLD_MAX_UID)
  30327. This hook is executed by the scheduler after function level
  30328. initializations. FILE is either a null pointer, or a stdio stream
  30329. to write any debug output to. VERBOSE is the verbose level
  30330. provided by '-fsched-verbose-N'. OLD_MAX_UID is the maximum insn
  30331. uid when scheduling begins.
  30332. -- Target Hook: void TARGET_SCHED_FINISH_GLOBAL (FILE *FILE, int
  30333. VERBOSE)
  30334. This is the cleanup hook corresponding to
  30335. 'TARGET_SCHED_INIT_GLOBAL'. FILE is either a null pointer, or a
  30336. stdio stream to write any debug output to. VERBOSE is the verbose
  30337. level provided by '-fsched-verbose-N'.
  30338. -- Target Hook: rtx TARGET_SCHED_DFA_PRE_CYCLE_INSN (void)
  30339. The hook returns an RTL insn. The automaton state used in the
  30340. pipeline hazard recognizer is changed as if the insn were scheduled
  30341. when the new simulated processor cycle starts. Usage of the hook
  30342. may simplify the automaton pipeline description for some VLIW
  30343. processors. If the hook is defined, it is used only for the
  30344. automaton based pipeline description. The default is not to change
  30345. the state when the new simulated processor cycle starts.
  30346. -- Target Hook: void TARGET_SCHED_INIT_DFA_PRE_CYCLE_INSN (void)
  30347. The hook can be used to initialize data used by the previous hook.
  30348. -- Target Hook: rtx_insn * TARGET_SCHED_DFA_POST_CYCLE_INSN (void)
  30349. The hook is analogous to 'TARGET_SCHED_DFA_PRE_CYCLE_INSN' but used
  30350. to changed the state as if the insn were scheduled when the new
  30351. simulated processor cycle finishes.
  30352. -- Target Hook: void TARGET_SCHED_INIT_DFA_POST_CYCLE_INSN (void)
  30353. The hook is analogous to 'TARGET_SCHED_INIT_DFA_PRE_CYCLE_INSN' but
  30354. used to initialize data used by the previous hook.
  30355. -- Target Hook: void TARGET_SCHED_DFA_PRE_ADVANCE_CYCLE (void)
  30356. The hook to notify target that the current simulated cycle is about
  30357. to finish. The hook is analogous to
  30358. 'TARGET_SCHED_DFA_PRE_CYCLE_INSN' but used to change the state in
  30359. more complicated situations - e.g., when advancing state on a
  30360. single insn is not enough.
  30361. -- Target Hook: void TARGET_SCHED_DFA_POST_ADVANCE_CYCLE (void)
  30362. The hook to notify target that new simulated cycle has just
  30363. started. The hook is analogous to
  30364. 'TARGET_SCHED_DFA_POST_CYCLE_INSN' but used to change the state in
  30365. more complicated situations - e.g., when advancing state on a
  30366. single insn is not enough.
  30367. -- Target Hook: int TARGET_SCHED_FIRST_CYCLE_MULTIPASS_DFA_LOOKAHEAD
  30368. (void)
  30369. This hook controls better choosing an insn from the ready insn
  30370. queue for the DFA-based insn scheduler. Usually the scheduler
  30371. chooses the first insn from the queue. If the hook returns a
  30372. positive value, an additional scheduler code tries all permutations
  30373. of 'TARGET_SCHED_FIRST_CYCLE_MULTIPASS_DFA_LOOKAHEAD ()' subsequent
  30374. ready insns to choose an insn whose issue will result in maximal
  30375. number of issued insns on the same cycle. For the VLIW processor,
  30376. the code could actually solve the problem of packing simple insns
  30377. into the VLIW insn. Of course, if the rules of VLIW packing are
  30378. described in the automaton.
  30379. This code also could be used for superscalar RISC processors. Let
  30380. us consider a superscalar RISC processor with 3 pipelines. Some
  30381. insns can be executed in pipelines A or B, some insns can be
  30382. executed only in pipelines B or C, and one insn can be executed in
  30383. pipeline B. The processor may issue the 1st insn into A and the
  30384. 2nd one into B. In this case, the 3rd insn will wait for freeing B
  30385. until the next cycle. If the scheduler issues the 3rd insn the
  30386. first, the processor could issue all 3 insns per cycle.
  30387. Actually this code demonstrates advantages of the automaton based
  30388. pipeline hazard recognizer. We try quickly and easy many insn
  30389. schedules to choose the best one.
  30390. The default is no multipass scheduling.
  30391. -- Target Hook: int
  30392. TARGET_SCHED_FIRST_CYCLE_MULTIPASS_DFA_LOOKAHEAD_GUARD
  30393. (rtx_insn *INSN, int READY_INDEX)
  30394. This hook controls what insns from the ready insn queue will be
  30395. considered for the multipass insn scheduling. If the hook returns
  30396. zero for INSN, the insn will be considered in multipass scheduling.
  30397. Positive return values will remove INSN from consideration on the
  30398. current round of multipass scheduling. Negative return values will
  30399. remove INSN from consideration for given number of cycles.
  30400. Backends should be careful about returning non-zero for highest
  30401. priority instruction at position 0 in the ready list. READY_INDEX
  30402. is passed to allow backends make correct judgements.
  30403. The default is that any ready insns can be chosen to be issued.
  30404. -- Target Hook: void TARGET_SCHED_FIRST_CYCLE_MULTIPASS_BEGIN (void
  30405. *DATA, signed char *READY_TRY, int N_READY, bool
  30406. FIRST_CYCLE_INSN_P)
  30407. This hook prepares the target backend for a new round of multipass
  30408. scheduling.
  30409. -- Target Hook: void TARGET_SCHED_FIRST_CYCLE_MULTIPASS_ISSUE (void
  30410. *DATA, signed char *READY_TRY, int N_READY, rtx_insn *INSN,
  30411. const void *PREV_DATA)
  30412. This hook is called when multipass scheduling evaluates instruction
  30413. INSN.
  30414. -- Target Hook: void TARGET_SCHED_FIRST_CYCLE_MULTIPASS_BACKTRACK
  30415. (const void *DATA, signed char *READY_TRY, int N_READY)
  30416. This is called when multipass scheduling backtracks from evaluation
  30417. of an instruction.
  30418. -- Target Hook: void TARGET_SCHED_FIRST_CYCLE_MULTIPASS_END (const void
  30419. *DATA)
  30420. This hook notifies the target about the result of the concluded
  30421. current round of multipass scheduling.
  30422. -- Target Hook: void TARGET_SCHED_FIRST_CYCLE_MULTIPASS_INIT (void
  30423. *DATA)
  30424. This hook initializes target-specific data used in multipass
  30425. scheduling.
  30426. -- Target Hook: void TARGET_SCHED_FIRST_CYCLE_MULTIPASS_FINI (void
  30427. *DATA)
  30428. This hook finalizes target-specific data used in multipass
  30429. scheduling.
  30430. -- Target Hook: int TARGET_SCHED_DFA_NEW_CYCLE (FILE *DUMP, int
  30431. VERBOSE, rtx_insn *INSN, int LAST_CLOCK, int CLOCK, int
  30432. *SORT_P)
  30433. This hook is called by the insn scheduler before issuing INSN on
  30434. cycle CLOCK. If the hook returns nonzero, INSN is not issued on
  30435. this processor cycle. Instead, the processor cycle is advanced.
  30436. If *SORT_P is zero, the insn ready queue is not sorted on the new
  30437. cycle start as usually. DUMP and VERBOSE specify the file and
  30438. verbosity level to use for debugging output. LAST_CLOCK and CLOCK
  30439. are, respectively, the processor cycle on which the previous insn
  30440. has been issued, and the current processor cycle.
  30441. -- Target Hook: bool TARGET_SCHED_IS_COSTLY_DEPENDENCE (struct _dep
  30442. *_DEP, int COST, int DISTANCE)
  30443. This hook is used to define which dependences are considered costly
  30444. by the target, so costly that it is not advisable to schedule the
  30445. insns that are involved in the dependence too close to one another.
  30446. The parameters to this hook are as follows: The first parameter
  30447. _DEP is the dependence being evaluated. The second parameter COST
  30448. is the cost of the dependence as estimated by the scheduler, and
  30449. the third parameter DISTANCE is the distance in cycles between the
  30450. two insns. The hook returns 'true' if considering the distance
  30451. between the two insns the dependence between them is considered
  30452. costly by the target, and 'false' otherwise.
  30453. Defining this hook can be useful in multiple-issue out-of-order
  30454. machines, where (a) it's practically hopeless to predict the actual
  30455. data/resource delays, however: (b) there's a better chance to
  30456. predict the actual grouping that will be formed, and (c) correctly
  30457. emulating the grouping can be very important. In such targets one
  30458. may want to allow issuing dependent insns closer to one
  30459. another--i.e., closer than the dependence distance; however, not in
  30460. cases of "costly dependences", which this hooks allows to define.
  30461. -- Target Hook: void TARGET_SCHED_H_I_D_EXTENDED (void)
  30462. This hook is called by the insn scheduler after emitting a new
  30463. instruction to the instruction stream. The hook notifies a target
  30464. backend to extend its per instruction data structures.
  30465. -- Target Hook: void * TARGET_SCHED_ALLOC_SCHED_CONTEXT (void)
  30466. Return a pointer to a store large enough to hold target scheduling
  30467. context.
  30468. -- Target Hook: void TARGET_SCHED_INIT_SCHED_CONTEXT (void *TC, bool
  30469. CLEAN_P)
  30470. Initialize store pointed to by TC to hold target scheduling
  30471. context. It CLEAN_P is true then initialize TC as if scheduler is
  30472. at the beginning of the block. Otherwise, copy the current context
  30473. into TC.
  30474. -- Target Hook: void TARGET_SCHED_SET_SCHED_CONTEXT (void *TC)
  30475. Copy target scheduling context pointed to by TC to the current
  30476. context.
  30477. -- Target Hook: void TARGET_SCHED_CLEAR_SCHED_CONTEXT (void *TC)
  30478. Deallocate internal data in target scheduling context pointed to by
  30479. TC.
  30480. -- Target Hook: void TARGET_SCHED_FREE_SCHED_CONTEXT (void *TC)
  30481. Deallocate a store for target scheduling context pointed to by TC.
  30482. -- Target Hook: int TARGET_SCHED_SPECULATE_INSN (rtx_insn *INSN,
  30483. unsigned int DEP_STATUS, rtx *NEW_PAT)
  30484. This hook is called by the insn scheduler when INSN has only
  30485. speculative dependencies and therefore can be scheduled
  30486. speculatively. The hook is used to check if the pattern of INSN
  30487. has a speculative version and, in case of successful check, to
  30488. generate that speculative pattern. The hook should return 1, if
  30489. the instruction has a speculative form, or -1, if it doesn't.
  30490. REQUEST describes the type of requested speculation. If the return
  30491. value equals 1 then NEW_PAT is assigned the generated speculative
  30492. pattern.
  30493. -- Target Hook: bool TARGET_SCHED_NEEDS_BLOCK_P (unsigned int
  30494. DEP_STATUS)
  30495. This hook is called by the insn scheduler during generation of
  30496. recovery code for INSN. It should return 'true', if the
  30497. corresponding check instruction should branch to recovery code, or
  30498. 'false' otherwise.
  30499. -- Target Hook: rtx TARGET_SCHED_GEN_SPEC_CHECK (rtx_insn *INSN,
  30500. rtx_insn *LABEL, unsigned int DS)
  30501. This hook is called by the insn scheduler to generate a pattern for
  30502. recovery check instruction. If MUTATE_P is zero, then INSN is a
  30503. speculative instruction for which the check should be generated.
  30504. LABEL is either a label of a basic block, where recovery code
  30505. should be emitted, or a null pointer, when requested check doesn't
  30506. branch to recovery code (a simple check). If MUTATE_P is nonzero,
  30507. then a pattern for a branchy check corresponding to a simple check
  30508. denoted by INSN should be generated. In this case LABEL can't be
  30509. null.
  30510. -- Target Hook: void TARGET_SCHED_SET_SCHED_FLAGS (struct spec_info_def
  30511. *SPEC_INFO)
  30512. This hook is used by the insn scheduler to find out what features
  30513. should be enabled/used. The structure *SPEC_INFO should be filled
  30514. in by the target. The structure describes speculation types that
  30515. can be used in the scheduler.
  30516. -- Target Hook: bool TARGET_SCHED_CAN_SPECULATE_INSN (rtx_insn *INSN)
  30517. Some instructions should never be speculated by the schedulers,
  30518. usually because the instruction is too expensive to get this wrong.
  30519. Often such instructions have long latency, and often they are not
  30520. fully modeled in the pipeline descriptions. This hook should
  30521. return 'false' if INSN should not be speculated.
  30522. -- Target Hook: int TARGET_SCHED_SMS_RES_MII (struct ddg *G)
  30523. This hook is called by the swing modulo scheduler to calculate a
  30524. resource-based lower bound which is based on the resources
  30525. available in the machine and the resources required by each
  30526. instruction. The target backend can use G to calculate such bound.
  30527. A very simple lower bound will be used in case this hook is not
  30528. implemented: the total number of instructions divided by the issue
  30529. rate.
  30530. -- Target Hook: bool TARGET_SCHED_DISPATCH (rtx_insn *INSN, int X)
  30531. This hook is called by Haifa Scheduler. It returns true if
  30532. dispatch scheduling is supported in hardware and the condition
  30533. specified in the parameter is true.
  30534. -- Target Hook: void TARGET_SCHED_DISPATCH_DO (rtx_insn *INSN, int X)
  30535. This hook is called by Haifa Scheduler. It performs the operation
  30536. specified in its second parameter.
  30537. -- Target Hook: bool TARGET_SCHED_EXPOSED_PIPELINE
  30538. True if the processor has an exposed pipeline, which means that not
  30539. just the order of instructions is important for correctness when
  30540. scheduling, but also the latencies of operations.
  30541. -- Target Hook: int TARGET_SCHED_REASSOCIATION_WIDTH (unsigned int OPC,
  30542. machine_mode MODE)
  30543. This hook is called by tree reassociator to determine a level of
  30544. parallelism required in output calculations chain.
  30545. -- Target Hook: void TARGET_SCHED_FUSION_PRIORITY (rtx_insn *INSN, int
  30546. MAX_PRI, int *FUSION_PRI, int *PRI)
  30547. This hook is called by scheduling fusion pass. It calculates
  30548. fusion priorities for each instruction passed in by parameter. The
  30549. priorities are returned via pointer parameters.
  30550. INSN is the instruction whose priorities need to be calculated.
  30551. MAX_PRI is the maximum priority can be returned in any cases.
  30552. FUSION_PRI is the pointer parameter through which INSN's fusion
  30553. priority should be calculated and returned. PRI is the pointer
  30554. parameter through which INSN's priority should be calculated and
  30555. returned.
  30556. Same FUSION_PRI should be returned for instructions which should be
  30557. scheduled together. Different PRI should be returned for
  30558. instructions with same FUSION_PRI. FUSION_PRI is the major sort
  30559. key, PRI is the minor sort key. All instructions will be scheduled
  30560. according to the two priorities. All priorities calculated should
  30561. be between 0 (exclusive) and MAX_PRI (inclusive). To avoid false
  30562. dependencies, FUSION_PRI of instructions which need to be scheduled
  30563. together should be smaller than FUSION_PRI of irrelevant
  30564. instructions.
  30565. Given below example:
  30566. ldr r10, [r1, 4]
  30567. add r4, r4, r10
  30568. ldr r15, [r2, 8]
  30569. sub r5, r5, r15
  30570. ldr r11, [r1, 0]
  30571. add r4, r4, r11
  30572. ldr r16, [r2, 12]
  30573. sub r5, r5, r16
  30574. On targets like ARM/AArch64, the two pairs of consecutive loads
  30575. should be merged. Since peephole2 pass can't help in this case
  30576. unless consecutive loads are actually next to each other in
  30577. instruction flow. That's where this scheduling fusion pass works.
  30578. This hook calculates priority for each instruction based on its
  30579. fustion type, like:
  30580. ldr r10, [r1, 4] ; fusion_pri=99, pri=96
  30581. add r4, r4, r10 ; fusion_pri=100, pri=100
  30582. ldr r15, [r2, 8] ; fusion_pri=98, pri=92
  30583. sub r5, r5, r15 ; fusion_pri=100, pri=100
  30584. ldr r11, [r1, 0] ; fusion_pri=99, pri=100
  30585. add r4, r4, r11 ; fusion_pri=100, pri=100
  30586. ldr r16, [r2, 12] ; fusion_pri=98, pri=88
  30587. sub r5, r5, r16 ; fusion_pri=100, pri=100
  30588. Scheduling fusion pass then sorts all ready to issue instructions
  30589. according to the priorities. As a result, instructions of same
  30590. fusion type will be pushed together in instruction flow, like:
  30591. ldr r11, [r1, 0]
  30592. ldr r10, [r1, 4]
  30593. ldr r15, [r2, 8]
  30594. ldr r16, [r2, 12]
  30595. add r4, r4, r10
  30596. sub r5, r5, r15
  30597. add r4, r4, r11
  30598. sub r5, r5, r16
  30599. Now peephole2 pass can simply merge the two pairs of loads.
  30600. Since scheduling fusion pass relies on peephole2 to do real fusion
  30601. work, it is only enabled by default when peephole2 is in effect.
  30602. This is firstly introduced on ARM/AArch64 targets, please refer to
  30603. the hook implementation for how different fusion types are
  30604. supported.
  30605. -- Target Hook: void TARGET_EXPAND_DIVMOD_LIBFUNC (rtx LIBFUNC,
  30606. machine_mode MODE, rtx OP0, rtx OP1, rtx *QUOT, rtx *REM)
  30607. Define this hook for enabling divmod transform if the port does not
  30608. have hardware divmod insn but defines target-specific divmod
  30609. libfuncs.
  30610. 
  30611. File: gccint.info, Node: Sections, Next: PIC, Prev: Scheduling, Up: Target Macros
  30612. 18.18 Dividing the Output into Sections (Texts, Data, ...)
  30613. ==========================================================
  30614. An object file is divided into sections containing different types of
  30615. data. In the most common case, there are three sections: the "text
  30616. section", which holds instructions and read-only data; the "data
  30617. section", which holds initialized writable data; and the "bss section",
  30618. which holds uninitialized data. Some systems have other kinds of
  30619. sections.
  30620. 'varasm.c' provides several well-known sections, such as
  30621. 'text_section', 'data_section' and 'bss_section'. The normal way of
  30622. controlling a 'FOO_section' variable is to define the associated
  30623. 'FOO_SECTION_ASM_OP' macro, as described below. The macros are only
  30624. read once, when 'varasm.c' initializes itself, so their values must be
  30625. run-time constants. They may however depend on command-line flags.
  30626. _Note:_ Some run-time files, such 'crtstuff.c', also make use of the
  30627. 'FOO_SECTION_ASM_OP' macros, and expect them to be string literals.
  30628. Some assemblers require a different string to be written every time a
  30629. section is selected. If your assembler falls into this category, you
  30630. should define the 'TARGET_ASM_INIT_SECTIONS' hook and use
  30631. 'get_unnamed_section' to set up the sections.
  30632. You must always create a 'text_section', either by defining
  30633. 'TEXT_SECTION_ASM_OP' or by initializing 'text_section' in
  30634. 'TARGET_ASM_INIT_SECTIONS'. The same is true of 'data_section' and
  30635. 'DATA_SECTION_ASM_OP'. If you do not create a distinct
  30636. 'readonly_data_section', the default is to reuse 'text_section'.
  30637. All the other 'varasm.c' sections are optional, and are null if the
  30638. target does not provide them.
  30639. -- Macro: TEXT_SECTION_ASM_OP
  30640. A C expression whose value is a string, including spacing,
  30641. containing the assembler operation that should precede instructions
  30642. and read-only data. Normally '"\t.text"' is right.
  30643. -- Macro: HOT_TEXT_SECTION_NAME
  30644. If defined, a C string constant for the name of the section
  30645. containing most frequently executed functions of the program. If
  30646. not defined, GCC will provide a default definition if the target
  30647. supports named sections.
  30648. -- Macro: UNLIKELY_EXECUTED_TEXT_SECTION_NAME
  30649. If defined, a C string constant for the name of the section
  30650. containing unlikely executed functions in the program.
  30651. -- Macro: DATA_SECTION_ASM_OP
  30652. A C expression whose value is a string, including spacing,
  30653. containing the assembler operation to identify the following data
  30654. as writable initialized data. Normally '"\t.data"' is right.
  30655. -- Macro: SDATA_SECTION_ASM_OP
  30656. If defined, a C expression whose value is a string, including
  30657. spacing, containing the assembler operation to identify the
  30658. following data as initialized, writable small data.
  30659. -- Macro: READONLY_DATA_SECTION_ASM_OP
  30660. A C expression whose value is a string, including spacing,
  30661. containing the assembler operation to identify the following data
  30662. as read-only initialized data.
  30663. -- Macro: BSS_SECTION_ASM_OP
  30664. If defined, a C expression whose value is a string, including
  30665. spacing, containing the assembler operation to identify the
  30666. following data as uninitialized global data. If not defined, and
  30667. 'ASM_OUTPUT_ALIGNED_BSS' not defined, uninitialized global data
  30668. will be output in the data section if '-fno-common' is passed,
  30669. otherwise 'ASM_OUTPUT_COMMON' will be used.
  30670. -- Macro: SBSS_SECTION_ASM_OP
  30671. If defined, a C expression whose value is a string, including
  30672. spacing, containing the assembler operation to identify the
  30673. following data as uninitialized, writable small data.
  30674. -- Macro: TLS_COMMON_ASM_OP
  30675. If defined, a C expression whose value is a string containing the
  30676. assembler operation to identify the following data as thread-local
  30677. common data. The default is '".tls_common"'.
  30678. -- Macro: TLS_SECTION_ASM_FLAG
  30679. If defined, a C expression whose value is a character constant
  30680. containing the flag used to mark a section as a TLS section. The
  30681. default is ''T''.
  30682. -- Macro: INIT_SECTION_ASM_OP
  30683. If defined, a C expression whose value is a string, including
  30684. spacing, containing the assembler operation to identify the
  30685. following data as initialization code. If not defined, GCC will
  30686. assume such a section does not exist. This section has no
  30687. corresponding 'init_section' variable; it is used entirely in
  30688. runtime code.
  30689. -- Macro: FINI_SECTION_ASM_OP
  30690. If defined, a C expression whose value is a string, including
  30691. spacing, containing the assembler operation to identify the
  30692. following data as finalization code. If not defined, GCC will
  30693. assume such a section does not exist. This section has no
  30694. corresponding 'fini_section' variable; it is used entirely in
  30695. runtime code.
  30696. -- Macro: INIT_ARRAY_SECTION_ASM_OP
  30697. If defined, a C expression whose value is a string, including
  30698. spacing, containing the assembler operation to identify the
  30699. following data as part of the '.init_array' (or equivalent)
  30700. section. If not defined, GCC will assume such a section does not
  30701. exist. Do not define both this macro and 'INIT_SECTION_ASM_OP'.
  30702. -- Macro: FINI_ARRAY_SECTION_ASM_OP
  30703. If defined, a C expression whose value is a string, including
  30704. spacing, containing the assembler operation to identify the
  30705. following data as part of the '.fini_array' (or equivalent)
  30706. section. If not defined, GCC will assume such a section does not
  30707. exist. Do not define both this macro and 'FINI_SECTION_ASM_OP'.
  30708. -- Macro: MACH_DEP_SECTION_ASM_FLAG
  30709. If defined, a C expression whose value is a character constant
  30710. containing the flag used to mark a machine-dependent section. This
  30711. corresponds to the 'SECTION_MACH_DEP' section flag.
  30712. -- Macro: CRT_CALL_STATIC_FUNCTION (SECTION_OP, FUNCTION)
  30713. If defined, an ASM statement that switches to a different section
  30714. via SECTION_OP, calls FUNCTION, and switches back to the text
  30715. section. This is used in 'crtstuff.c' if 'INIT_SECTION_ASM_OP' or
  30716. 'FINI_SECTION_ASM_OP' to calls to initialization and finalization
  30717. functions from the init and fini sections. By default, this macro
  30718. uses a simple function call. Some ports need hand-crafted assembly
  30719. code to avoid dependencies on registers initialized in the function
  30720. prologue or to ensure that constant pools don't end up too far way
  30721. in the text section.
  30722. -- Macro: TARGET_LIBGCC_SDATA_SECTION
  30723. If defined, a string which names the section into which small
  30724. variables defined in crtstuff and libgcc should go. This is useful
  30725. when the target has options for optimizing access to small data,
  30726. and you want the crtstuff and libgcc routines to be conservative in
  30727. what they expect of your application yet liberal in what your
  30728. application expects. For example, for targets with a '.sdata'
  30729. section (like MIPS), you could compile crtstuff with '-G 0' so that
  30730. it doesn't require small data support from your application, but
  30731. use this macro to put small data into '.sdata' so that your
  30732. application can access these variables whether it uses small data
  30733. or not.
  30734. -- Macro: FORCE_CODE_SECTION_ALIGN
  30735. If defined, an ASM statement that aligns a code section to some
  30736. arbitrary boundary. This is used to force all fragments of the
  30737. '.init' and '.fini' sections to have to same alignment and thus
  30738. prevent the linker from having to add any padding.
  30739. -- Macro: JUMP_TABLES_IN_TEXT_SECTION
  30740. Define this macro to be an expression with a nonzero value if jump
  30741. tables (for 'tablejump' insns) should be output in the text
  30742. section, along with the assembler instructions. Otherwise, the
  30743. readonly data section is used.
  30744. This macro is irrelevant if there is no separate readonly data
  30745. section.
  30746. -- Target Hook: void TARGET_ASM_INIT_SECTIONS (void)
  30747. Define this hook if you need to do something special to set up the
  30748. 'varasm.c' sections, or if your target has some special sections of
  30749. its own that you need to create.
  30750. GCC calls this hook after processing the command line, but before
  30751. writing any assembly code, and before calling any of the
  30752. section-returning hooks described below.
  30753. -- Target Hook: int TARGET_ASM_RELOC_RW_MASK (void)
  30754. Return a mask describing how relocations should be treated when
  30755. selecting sections. Bit 1 should be set if global relocations
  30756. should be placed in a read-write section; bit 0 should be set if
  30757. local relocations should be placed in a read-write section.
  30758. The default version of this function returns 3 when '-fpic' is in
  30759. effect, and 0 otherwise. The hook is typically redefined when the
  30760. target cannot support (some kinds of) dynamic relocations in
  30761. read-only sections even in executables.
  30762. -- Target Hook: bool TARGET_ASM_GENERATE_PIC_ADDR_DIFF_VEC (void)
  30763. Return true to generate ADDR_DIF_VEC table or false to generate
  30764. ADDR_VEC table for jumps in case of -fPIC.
  30765. The default version of this function returns true if flag_pic
  30766. equals true and false otherwise
  30767. -- Target Hook: section * TARGET_ASM_SELECT_SECTION (tree EXP, int
  30768. RELOC, unsigned HOST_WIDE_INT ALIGN)
  30769. Return the section into which EXP should be placed. You can assume
  30770. that EXP is either a 'VAR_DECL' node or a constant of some sort.
  30771. RELOC indicates whether the initial value of EXP requires link-time
  30772. relocations. Bit 0 is set when variable contains local relocations
  30773. only, while bit 1 is set for global relocations. ALIGN is the
  30774. constant alignment in bits.
  30775. The default version of this function takes care of putting
  30776. read-only variables in 'readonly_data_section'.
  30777. See also USE_SELECT_SECTION_FOR_FUNCTIONS.
  30778. -- Macro: USE_SELECT_SECTION_FOR_FUNCTIONS
  30779. Define this macro if you wish TARGET_ASM_SELECT_SECTION to be
  30780. called for 'FUNCTION_DECL's as well as for variables and constants.
  30781. In the case of a 'FUNCTION_DECL', RELOC will be zero if the
  30782. function has been determined to be likely to be called, and nonzero
  30783. if it is unlikely to be called.
  30784. -- Target Hook: void TARGET_ASM_UNIQUE_SECTION (tree DECL, int RELOC)
  30785. Build up a unique section name, expressed as a 'STRING_CST' node,
  30786. and assign it to 'DECL_SECTION_NAME (DECL)'. As with
  30787. 'TARGET_ASM_SELECT_SECTION', RELOC indicates whether the initial
  30788. value of EXP requires link-time relocations.
  30789. The default version of this function appends the symbol name to the
  30790. ELF section name that would normally be used for the symbol. For
  30791. example, the function 'foo' would be placed in '.text.foo'.
  30792. Whatever the actual target object format, this is often good
  30793. enough.
  30794. -- Target Hook: section * TARGET_ASM_FUNCTION_RODATA_SECTION (tree
  30795. DECL)
  30796. Return the readonly data section associated with 'DECL_SECTION_NAME
  30797. (DECL)'. The default version of this function selects
  30798. '.gnu.linkonce.r.name' if the function's section is
  30799. '.gnu.linkonce.t.name', '.rodata.name' if function is in
  30800. '.text.name', and the normal readonly-data section otherwise.
  30801. -- Target Hook: const char * TARGET_ASM_MERGEABLE_RODATA_PREFIX
  30802. Usually, the compiler uses the prefix '".rodata"' to construct
  30803. section names for mergeable constant data. Define this macro to
  30804. override the string if a different section name should be used.
  30805. -- Target Hook: section * TARGET_ASM_TM_CLONE_TABLE_SECTION (void)
  30806. Return the section that should be used for transactional memory
  30807. clone tables.
  30808. -- Target Hook: section * TARGET_ASM_SELECT_RTX_SECTION (machine_mode
  30809. MODE, rtx X, unsigned HOST_WIDE_INT ALIGN)
  30810. Return the section into which a constant X, of mode MODE, should be
  30811. placed. You can assume that X is some kind of constant in RTL.
  30812. The argument MODE is redundant except in the case of a 'const_int'
  30813. rtx. ALIGN is the constant alignment in bits.
  30814. The default version of this function takes care of putting symbolic
  30815. constants in 'flag_pic' mode in 'data_section' and everything else
  30816. in 'readonly_data_section'.
  30817. -- Target Hook: tree TARGET_MANGLE_DECL_ASSEMBLER_NAME (tree DECL, tree
  30818. ID)
  30819. Define this hook if you need to postprocess the assembler name
  30820. generated by target-independent code. The ID provided to this hook
  30821. will be the computed name (e.g., the macro 'DECL_NAME' of the DECL
  30822. in C, or the mangled name of the DECL in C++). The return value of
  30823. the hook is an 'IDENTIFIER_NODE' for the appropriate mangled name
  30824. on your target system. The default implementation of this hook
  30825. just returns the ID provided.
  30826. -- Target Hook: void TARGET_ENCODE_SECTION_INFO (tree DECL, rtx RTL,
  30827. int NEW_DECL_P)
  30828. Define this hook if references to a symbol or a constant must be
  30829. treated differently depending on something about the variable or
  30830. function named by the symbol (such as what section it is in).
  30831. The hook is executed immediately after rtl has been created for
  30832. DECL, which may be a variable or function declaration or an entry
  30833. in the constant pool. In either case, RTL is the rtl in question.
  30834. Do _not_ use 'DECL_RTL (DECL)' in this hook; that field may not
  30835. have been initialized yet.
  30836. In the case of a constant, it is safe to assume that the rtl is a
  30837. 'mem' whose address is a 'symbol_ref'. Most decls will also have
  30838. this form, but that is not guaranteed. Global register variables,
  30839. for instance, will have a 'reg' for their rtl. (Normally the right
  30840. thing to do with such unusual rtl is leave it alone.)
  30841. The NEW_DECL_P argument will be true if this is the first time that
  30842. 'TARGET_ENCODE_SECTION_INFO' has been invoked on this decl. It
  30843. will be false for subsequent invocations, which will happen for
  30844. duplicate declarations. Whether or not anything must be done for
  30845. the duplicate declaration depends on whether the hook examines
  30846. 'DECL_ATTRIBUTES'. NEW_DECL_P is always true when the hook is
  30847. called for a constant.
  30848. The usual thing for this hook to do is to record flags in the
  30849. 'symbol_ref', using 'SYMBOL_REF_FLAG' or 'SYMBOL_REF_FLAGS'.
  30850. Historically, the name string was modified if it was necessary to
  30851. encode more than one bit of information, but this practice is now
  30852. discouraged; use 'SYMBOL_REF_FLAGS'.
  30853. The default definition of this hook, 'default_encode_section_info'
  30854. in 'varasm.c', sets a number of commonly-useful bits in
  30855. 'SYMBOL_REF_FLAGS'. Check whether the default does what you need
  30856. before overriding it.
  30857. -- Target Hook: const char * TARGET_STRIP_NAME_ENCODING (const char
  30858. *NAME)
  30859. Decode NAME and return the real name part, sans the characters that
  30860. 'TARGET_ENCODE_SECTION_INFO' may have added.
  30861. -- Target Hook: bool TARGET_IN_SMALL_DATA_P (const_tree EXP)
  30862. Returns true if EXP should be placed into a "small data" section.
  30863. The default version of this hook always returns false.
  30864. -- Target Hook: bool TARGET_HAVE_SRODATA_SECTION
  30865. Contains the value true if the target places read-only "small data"
  30866. into a separate section. The default value is false.
  30867. -- Target Hook: bool TARGET_PROFILE_BEFORE_PROLOGUE (void)
  30868. It returns true if target wants profile code emitted before
  30869. prologue.
  30870. The default version of this hook use the target macro
  30871. 'PROFILE_BEFORE_PROLOGUE'.
  30872. -- Target Hook: bool TARGET_BINDS_LOCAL_P (const_tree EXP)
  30873. Returns true if EXP names an object for which name resolution rules
  30874. must resolve to the current "module" (dynamic shared library or
  30875. executable image).
  30876. The default version of this hook implements the name resolution
  30877. rules for ELF, which has a looser model of global name binding than
  30878. other currently supported object file formats.
  30879. -- Target Hook: bool TARGET_HAVE_TLS
  30880. Contains the value true if the target supports thread-local
  30881. storage. The default value is false.
  30882. 
  30883. File: gccint.info, Node: PIC, Next: Assembler Format, Prev: Sections, Up: Target Macros
  30884. 18.19 Position Independent Code
  30885. ===============================
  30886. This section describes macros that help implement generation of position
  30887. independent code. Simply defining these macros is not enough to
  30888. generate valid PIC; you must also add support to the hook
  30889. 'TARGET_LEGITIMATE_ADDRESS_P' and to the macro 'PRINT_OPERAND_ADDRESS',
  30890. as well as 'LEGITIMIZE_ADDRESS'. You must modify the definition of
  30891. 'movsi' to do something appropriate when the source operand contains a
  30892. symbolic address. You may also need to alter the handling of switch
  30893. statements so that they use relative addresses.
  30894. -- Macro: PIC_OFFSET_TABLE_REGNUM
  30895. The register number of the register used to address a table of
  30896. static data addresses in memory. In some cases this register is
  30897. defined by a processor's "application binary interface" (ABI).
  30898. When this macro is defined, RTL is generated for this register
  30899. once, as with the stack pointer and frame pointer registers. If
  30900. this macro is not defined, it is up to the machine-dependent files
  30901. to allocate such a register (if necessary). Note that this
  30902. register must be fixed when in use (e.g. when 'flag_pic' is true).
  30903. -- Macro: PIC_OFFSET_TABLE_REG_CALL_CLOBBERED
  30904. A C expression that is nonzero if the register defined by
  30905. 'PIC_OFFSET_TABLE_REGNUM' is clobbered by calls. If not defined,
  30906. the default is zero. Do not define this macro if
  30907. 'PIC_OFFSET_TABLE_REGNUM' is not defined.
  30908. -- Macro: LEGITIMATE_PIC_OPERAND_P (X)
  30909. A C expression that is nonzero if X is a legitimate immediate
  30910. operand on the target machine when generating position independent
  30911. code. You can assume that X satisfies 'CONSTANT_P', so you need
  30912. not check this. You can also assume FLAG_PIC is true, so you need
  30913. not check it either. You need not define this macro if all
  30914. constants (including 'SYMBOL_REF') can be immediate operands when
  30915. generating position independent code.
  30916. 
  30917. File: gccint.info, Node: Assembler Format, Next: Debugging Info, Prev: PIC, Up: Target Macros
  30918. 18.20 Defining the Output Assembler Language
  30919. ============================================
  30920. This section describes macros whose principal purpose is to describe how
  30921. to write instructions in assembler language--rather than what the
  30922. instructions do.
  30923. * Menu:
  30924. * File Framework:: Structural information for the assembler file.
  30925. * Data Output:: Output of constants (numbers, strings, addresses).
  30926. * Uninitialized Data:: Output of uninitialized variables.
  30927. * Label Output:: Output and generation of labels.
  30928. * Initialization:: General principles of initialization
  30929. and termination routines.
  30930. * Macros for Initialization::
  30931. Specific macros that control the handling of
  30932. initialization and termination routines.
  30933. * Instruction Output:: Output of actual instructions.
  30934. * Dispatch Tables:: Output of jump tables.
  30935. * Exception Region Output:: Output of exception region code.
  30936. * Alignment Output:: Pseudo ops for alignment and skipping data.
  30937. 
  30938. File: gccint.info, Node: File Framework, Next: Data Output, Up: Assembler Format
  30939. 18.20.1 The Overall Framework of an Assembler File
  30940. --------------------------------------------------
  30941. This describes the overall framework of an assembly file.
  30942. -- Target Hook: void TARGET_ASM_FILE_START (void)
  30943. Output to 'asm_out_file' any text which the assembler expects to
  30944. find at the beginning of a file. The default behavior is
  30945. controlled by two flags, documented below. Unless your target's
  30946. assembler is quite unusual, if you override the default, you should
  30947. call 'default_file_start' at some point in your target hook. This
  30948. lets other target files rely on these variables.
  30949. -- Target Hook: bool TARGET_ASM_FILE_START_APP_OFF
  30950. If this flag is true, the text of the macro 'ASM_APP_OFF' will be
  30951. printed as the very first line in the assembly file, unless
  30952. '-fverbose-asm' is in effect. (If that macro has been defined to
  30953. the empty string, this variable has no effect.) With the normal
  30954. definition of 'ASM_APP_OFF', the effect is to notify the GNU
  30955. assembler that it need not bother stripping comments or extra
  30956. whitespace from its input. This allows it to work a bit faster.
  30957. The default is false. You should not set it to true unless you
  30958. have verified that your port does not generate any extra whitespace
  30959. or comments that will cause GAS to issue errors in NO_APP mode.
  30960. -- Target Hook: bool TARGET_ASM_FILE_START_FILE_DIRECTIVE
  30961. If this flag is true, 'output_file_directive' will be called for
  30962. the primary source file, immediately after printing 'ASM_APP_OFF'
  30963. (if that is enabled). Most ELF assemblers expect this to be done.
  30964. The default is false.
  30965. -- Target Hook: void TARGET_ASM_FILE_END (void)
  30966. Output to 'asm_out_file' any text which the assembler expects to
  30967. find at the end of a file. The default is to output nothing.
  30968. -- Function: void file_end_indicate_exec_stack ()
  30969. Some systems use a common convention, the '.note.GNU-stack' special
  30970. section, to indicate whether or not an object file relies on the
  30971. stack being executable. If your system uses this convention, you
  30972. should define 'TARGET_ASM_FILE_END' to this function. If you need
  30973. to do other things in that hook, have your hook function call this
  30974. function.
  30975. -- Target Hook: void TARGET_ASM_LTO_START (void)
  30976. Output to 'asm_out_file' any text which the assembler expects to
  30977. find at the start of an LTO section. The default is to output
  30978. nothing.
  30979. -- Target Hook: void TARGET_ASM_LTO_END (void)
  30980. Output to 'asm_out_file' any text which the assembler expects to
  30981. find at the end of an LTO section. The default is to output
  30982. nothing.
  30983. -- Target Hook: void TARGET_ASM_CODE_END (void)
  30984. Output to 'asm_out_file' any text which is needed before emitting
  30985. unwind info and debug info at the end of a file. Some targets emit
  30986. here PIC setup thunks that cannot be emitted at the end of file,
  30987. because they couldn't have unwind info then. The default is to
  30988. output nothing.
  30989. -- Macro: ASM_COMMENT_START
  30990. A C string constant describing how to begin a comment in the target
  30991. assembler language. The compiler assumes that the comment will end
  30992. at the end of the line.
  30993. -- Macro: ASM_APP_ON
  30994. A C string constant for text to be output before each 'asm'
  30995. statement or group of consecutive ones. Normally this is '"#APP"',
  30996. which is a comment that has no effect on most assemblers but tells
  30997. the GNU assembler that it must check the lines that follow for all
  30998. valid assembler constructs.
  30999. -- Macro: ASM_APP_OFF
  31000. A C string constant for text to be output after each 'asm'
  31001. statement or group of consecutive ones. Normally this is
  31002. '"#NO_APP"', which tells the GNU assembler to resume making the
  31003. time-saving assumptions that are valid for ordinary compiler
  31004. output.
  31005. -- Macro: ASM_OUTPUT_SOURCE_FILENAME (STREAM, NAME)
  31006. A C statement to output COFF information or DWARF debugging
  31007. information which indicates that filename NAME is the current
  31008. source file to the stdio stream STREAM.
  31009. This macro need not be defined if the standard form of output for
  31010. the file format in use is appropriate.
  31011. -- Target Hook: void TARGET_ASM_OUTPUT_SOURCE_FILENAME (FILE *FILE,
  31012. const char *NAME)
  31013. Output DWARF debugging information which indicates that filename
  31014. NAME is the current source file to the stdio stream FILE.
  31015. This target hook need not be defined if the standard form of output
  31016. for the file format in use is appropriate.
  31017. -- Target Hook: void TARGET_ASM_OUTPUT_IDENT (const char *NAME)
  31018. Output a string based on NAME, suitable for the '#ident' directive,
  31019. or the equivalent directive or pragma in non-C-family languages.
  31020. If this hook is not defined, nothing is output for the '#ident'
  31021. directive.
  31022. -- Macro: OUTPUT_QUOTED_STRING (STREAM, STRING)
  31023. A C statement to output the string STRING to the stdio stream
  31024. STREAM. If you do not call the function 'output_quoted_string' in
  31025. your config files, GCC will only call it to output filenames to the
  31026. assembler source. So you can use it to canonicalize the format of
  31027. the filename using this macro.
  31028. -- Target Hook: void TARGET_ASM_NAMED_SECTION (const char *NAME,
  31029. unsigned int FLAGS, tree DECL)
  31030. Output assembly directives to switch to section NAME. The section
  31031. should have attributes as specified by FLAGS, which is a bit mask
  31032. of the 'SECTION_*' flags defined in 'output.h'. If DECL is
  31033. non-NULL, it is the 'VAR_DECL' or 'FUNCTION_DECL' with which this
  31034. section is associated.
  31035. -- Target Hook: bool TARGET_ASM_ELF_FLAGS_NUMERIC (unsigned int FLAGS,
  31036. unsigned int *NUM)
  31037. This hook can be used to encode ELF section flags for which no
  31038. letter code has been defined in the assembler. It is called by
  31039. 'default_asm_named_section' whenever the section flags need to be
  31040. emitted in the assembler output. If the hook returns true, then
  31041. the numerical value for ELF section flags should be calculated from
  31042. FLAGS and saved in *NUM; the value is printed out instead of the
  31043. normal sequence of letter codes. If the hook is not defined, or if
  31044. it returns false, then NUM is ignored and the traditional letter
  31045. sequence is emitted.
  31046. -- Target Hook: section * TARGET_ASM_FUNCTION_SECTION (tree DECL, enum
  31047. node_frequency FREQ, bool STARTUP, bool EXIT)
  31048. Return preferred text (sub)section for function DECL. Main purpose
  31049. of this function is to separate cold, normal and hot functions.
  31050. STARTUP is true when function is known to be used only at startup
  31051. (from static constructors or it is 'main()'). EXIT is true when
  31052. function is known to be used only at exit (from static
  31053. destructors). Return NULL if function should go to default text
  31054. section.
  31055. -- Target Hook: void TARGET_ASM_FUNCTION_SWITCHED_TEXT_SECTIONS (FILE
  31056. *FILE, tree DECL, bool NEW_IS_COLD)
  31057. Used by the target to emit any assembler directives or additional
  31058. labels needed when a function is partitioned between different
  31059. sections. Output should be written to FILE. The function decl is
  31060. available as DECL and the new section is 'cold' if NEW_IS_COLD is
  31061. 'true'.
  31062. -- Common Target Hook: bool TARGET_HAVE_NAMED_SECTIONS
  31063. This flag is true if the target supports
  31064. 'TARGET_ASM_NAMED_SECTION'. It must not be modified by
  31065. command-line option processing.
  31066. -- Target Hook: bool TARGET_HAVE_SWITCHABLE_BSS_SECTIONS
  31067. This flag is true if we can create zeroed data by switching to a
  31068. BSS section and then using 'ASM_OUTPUT_SKIP' to allocate the space.
  31069. This is true on most ELF targets.
  31070. -- Target Hook: unsigned int TARGET_SECTION_TYPE_FLAGS (tree DECL,
  31071. const char *NAME, int RELOC)
  31072. Choose a set of section attributes for use by
  31073. 'TARGET_ASM_NAMED_SECTION' based on a variable or function decl, a
  31074. section name, and whether or not the declaration's initializer may
  31075. contain runtime relocations. DECL may be null, in which case
  31076. read-write data should be assumed.
  31077. The default version of this function handles choosing code vs data,
  31078. read-only vs read-write data, and 'flag_pic'. You should only need
  31079. to override this if your target has special flags that might be set
  31080. via '__attribute__'.
  31081. -- Target Hook: int TARGET_ASM_RECORD_GCC_SWITCHES (print_switch_type
  31082. TYPE, const char *TEXT)
  31083. Provides the target with the ability to record the gcc command line
  31084. switches that have been passed to the compiler, and options that
  31085. are enabled. The TYPE argument specifies what is being recorded.
  31086. It can take the following values:
  31087. 'SWITCH_TYPE_PASSED'
  31088. TEXT is a command line switch that has been set by the user.
  31089. 'SWITCH_TYPE_ENABLED'
  31090. TEXT is an option which has been enabled. This might be as a
  31091. direct result of a command line switch, or because it is
  31092. enabled by default or because it has been enabled as a side
  31093. effect of a different command line switch. For example, the
  31094. '-O2' switch enables various different individual optimization
  31095. passes.
  31096. 'SWITCH_TYPE_DESCRIPTIVE'
  31097. TEXT is either NULL or some descriptive text which should be
  31098. ignored. If TEXT is NULL then it is being used to warn the
  31099. target hook that either recording is starting or ending. The
  31100. first time TYPE is SWITCH_TYPE_DESCRIPTIVE and TEXT is NULL,
  31101. the warning is for start up and the second time the warning is
  31102. for wind down. This feature is to allow the target hook to
  31103. make any necessary preparations before it starts to record
  31104. switches and to perform any necessary tidying up after it has
  31105. finished recording switches.
  31106. 'SWITCH_TYPE_LINE_START'
  31107. This option can be ignored by this target hook.
  31108. 'SWITCH_TYPE_LINE_END'
  31109. This option can be ignored by this target hook.
  31110. The hook's return value must be zero. Other return values may be
  31111. supported in the future.
  31112. By default this hook is set to NULL, but an example implementation
  31113. is provided for ELF based targets. Called ELF_RECORD_GCC_SWITCHES,
  31114. it records the switches as ASCII text inside a new, string
  31115. mergeable section in the assembler output file. The name of the
  31116. new section is provided by the
  31117. 'TARGET_ASM_RECORD_GCC_SWITCHES_SECTION' target hook.
  31118. -- Target Hook: const char * TARGET_ASM_RECORD_GCC_SWITCHES_SECTION
  31119. This is the name of the section that will be created by the example
  31120. ELF implementation of the 'TARGET_ASM_RECORD_GCC_SWITCHES' target
  31121. hook.
  31122. 
  31123. File: gccint.info, Node: Data Output, Next: Uninitialized Data, Prev: File Framework, Up: Assembler Format
  31124. 18.20.2 Output of Data
  31125. ----------------------
  31126. -- Target Hook: const char * TARGET_ASM_BYTE_OP
  31127. -- Target Hook: const char * TARGET_ASM_ALIGNED_HI_OP
  31128. -- Target Hook: const char * TARGET_ASM_ALIGNED_PSI_OP
  31129. -- Target Hook: const char * TARGET_ASM_ALIGNED_SI_OP
  31130. -- Target Hook: const char * TARGET_ASM_ALIGNED_PDI_OP
  31131. -- Target Hook: const char * TARGET_ASM_ALIGNED_DI_OP
  31132. -- Target Hook: const char * TARGET_ASM_ALIGNED_PTI_OP
  31133. -- Target Hook: const char * TARGET_ASM_ALIGNED_TI_OP
  31134. -- Target Hook: const char * TARGET_ASM_UNALIGNED_HI_OP
  31135. -- Target Hook: const char * TARGET_ASM_UNALIGNED_PSI_OP
  31136. -- Target Hook: const char * TARGET_ASM_UNALIGNED_SI_OP
  31137. -- Target Hook: const char * TARGET_ASM_UNALIGNED_PDI_OP
  31138. -- Target Hook: const char * TARGET_ASM_UNALIGNED_DI_OP
  31139. -- Target Hook: const char * TARGET_ASM_UNALIGNED_PTI_OP
  31140. -- Target Hook: const char * TARGET_ASM_UNALIGNED_TI_OP
  31141. These hooks specify assembly directives for creating certain kinds
  31142. of integer object. The 'TARGET_ASM_BYTE_OP' directive creates a
  31143. byte-sized object, the 'TARGET_ASM_ALIGNED_HI_OP' one creates an
  31144. aligned two-byte object, and so on. Any of the hooks may be
  31145. 'NULL', indicating that no suitable directive is available.
  31146. The compiler will print these strings at the start of a new line,
  31147. followed immediately by the object's initial value. In most cases,
  31148. the string should contain a tab, a pseudo-op, and then another tab.
  31149. -- Target Hook: bool TARGET_ASM_INTEGER (rtx X, unsigned int SIZE, int
  31150. ALIGNED_P)
  31151. The 'assemble_integer' function uses this hook to output an integer
  31152. object. X is the object's value, SIZE is its size in bytes and
  31153. ALIGNED_P indicates whether it is aligned. The function should
  31154. return 'true' if it was able to output the object. If it returns
  31155. false, 'assemble_integer' will try to split the object into smaller
  31156. parts.
  31157. The default implementation of this hook will use the
  31158. 'TARGET_ASM_BYTE_OP' family of strings, returning 'false' when the
  31159. relevant string is 'NULL'.
  31160. -- Target Hook: void TARGET_ASM_DECL_END (void)
  31161. Define this hook if the target assembler requires a special marker
  31162. to terminate an initialized variable declaration.
  31163. -- Target Hook: bool TARGET_ASM_OUTPUT_ADDR_CONST_EXTRA (FILE *FILE,
  31164. rtx X)
  31165. A target hook to recognize RTX patterns that 'output_addr_const'
  31166. can't deal with, and output assembly code to FILE corresponding to
  31167. the pattern X. This may be used to allow machine-dependent
  31168. 'UNSPEC's to appear within constants.
  31169. If target hook fails to recognize a pattern, it must return
  31170. 'false', so that a standard error message is printed. If it prints
  31171. an error message itself, by calling, for example,
  31172. 'output_operand_lossage', it may just return 'true'.
  31173. -- Macro: ASM_OUTPUT_ASCII (STREAM, PTR, LEN)
  31174. A C statement to output to the stdio stream STREAM an assembler
  31175. instruction to assemble a string constant containing the LEN bytes
  31176. at PTR. PTR will be a C expression of type 'char *' and LEN a C
  31177. expression of type 'int'.
  31178. If the assembler has a '.ascii' pseudo-op as found in the Berkeley
  31179. Unix assembler, do not define the macro 'ASM_OUTPUT_ASCII'.
  31180. -- Macro: ASM_OUTPUT_FDESC (STREAM, DECL, N)
  31181. A C statement to output word N of a function descriptor for DECL.
  31182. This must be defined if 'TARGET_VTABLE_USES_DESCRIPTORS' is
  31183. defined, and is otherwise unused.
  31184. -- Macro: CONSTANT_POOL_BEFORE_FUNCTION
  31185. You may define this macro as a C expression. You should define the
  31186. expression to have a nonzero value if GCC should output the
  31187. constant pool for a function before the code for the function, or a
  31188. zero value if GCC should output the constant pool after the
  31189. function. If you do not define this macro, the usual case, GCC
  31190. will output the constant pool before the function.
  31191. -- Macro: ASM_OUTPUT_POOL_PROLOGUE (FILE, FUNNAME, FUNDECL, SIZE)
  31192. A C statement to output assembler commands to define the start of
  31193. the constant pool for a function. FUNNAME is a string giving the
  31194. name of the function. Should the return type of the function be
  31195. required, it can be obtained via FUNDECL. SIZE is the size, in
  31196. bytes, of the constant pool that will be written immediately after
  31197. this call.
  31198. If no constant-pool prefix is required, the usual case, this macro
  31199. need not be defined.
  31200. -- Macro: ASM_OUTPUT_SPECIAL_POOL_ENTRY (FILE, X, MODE, ALIGN, LABELNO,
  31201. JUMPTO)
  31202. A C statement (with or without semicolon) to output a constant in
  31203. the constant pool, if it needs special treatment. (This macro need
  31204. not do anything for RTL expressions that can be output normally.)
  31205. The argument FILE is the standard I/O stream to output the
  31206. assembler code on. X is the RTL expression for the constant to
  31207. output, and MODE is the machine mode (in case X is a 'const_int').
  31208. ALIGN is the required alignment for the value X; you should output
  31209. an assembler directive to force this much alignment.
  31210. The argument LABELNO is a number to use in an internal label for
  31211. the address of this pool entry. The definition of this macro is
  31212. responsible for outputting the label definition at the proper
  31213. place. Here is how to do this:
  31214. (*targetm.asm_out.internal_label) (FILE, "LC", LABELNO);
  31215. When you output a pool entry specially, you should end with a
  31216. 'goto' to the label JUMPTO. This will prevent the same pool entry
  31217. from being output a second time in the usual manner.
  31218. You need not define this macro if it would do nothing.
  31219. -- Macro: ASM_OUTPUT_POOL_EPILOGUE (FILE FUNNAME FUNDECL SIZE)
  31220. A C statement to output assembler commands to at the end of the
  31221. constant pool for a function. FUNNAME is a string giving the name
  31222. of the function. Should the return type of the function be
  31223. required, you can obtain it via FUNDECL. SIZE is the size, in
  31224. bytes, of the constant pool that GCC wrote immediately before this
  31225. call.
  31226. If no constant-pool epilogue is required, the usual case, you need
  31227. not define this macro.
  31228. -- Macro: IS_ASM_LOGICAL_LINE_SEPARATOR (C, STR)
  31229. Define this macro as a C expression which is nonzero if C is used
  31230. as a logical line separator by the assembler. STR points to the
  31231. position in the string where C was found; this can be used if a
  31232. line separator uses multiple characters.
  31233. If you do not define this macro, the default is that only the
  31234. character ';' is treated as a logical line separator.
  31235. -- Target Hook: const char * TARGET_ASM_OPEN_PAREN
  31236. -- Target Hook: const char * TARGET_ASM_CLOSE_PAREN
  31237. These target hooks are C string constants, describing the syntax in
  31238. the assembler for grouping arithmetic expressions. If not
  31239. overridden, they default to normal parentheses, which is correct
  31240. for most assemblers.
  31241. These macros are provided by 'real.h' for writing the definitions of
  31242. 'ASM_OUTPUT_DOUBLE' and the like:
  31243. -- Macro: REAL_VALUE_TO_TARGET_SINGLE (X, L)
  31244. -- Macro: REAL_VALUE_TO_TARGET_DOUBLE (X, L)
  31245. -- Macro: REAL_VALUE_TO_TARGET_LONG_DOUBLE (X, L)
  31246. -- Macro: REAL_VALUE_TO_TARGET_DECIMAL32 (X, L)
  31247. -- Macro: REAL_VALUE_TO_TARGET_DECIMAL64 (X, L)
  31248. -- Macro: REAL_VALUE_TO_TARGET_DECIMAL128 (X, L)
  31249. These translate X, of type 'REAL_VALUE_TYPE', to the target's
  31250. floating point representation, and store its bit pattern in the
  31251. variable L. For 'REAL_VALUE_TO_TARGET_SINGLE' and
  31252. 'REAL_VALUE_TO_TARGET_DECIMAL32', this variable should be a simple
  31253. 'long int'. For the others, it should be an array of 'long int'.
  31254. The number of elements in this array is determined by the size of
  31255. the desired target floating point data type: 32 bits of it go in
  31256. each 'long int' array element. Each array element holds 32 bits of
  31257. the result, even if 'long int' is wider than 32 bits on the host
  31258. machine.
  31259. The array element values are designed so that you can print them
  31260. out using 'fprintf' in the order they should appear in the target
  31261. machine's memory.
  31262. 
  31263. File: gccint.info, Node: Uninitialized Data, Next: Label Output, Prev: Data Output, Up: Assembler Format
  31264. 18.20.3 Output of Uninitialized Variables
  31265. -----------------------------------------
  31266. Each of the macros in this section is used to do the whole job of
  31267. outputting a single uninitialized variable.
  31268. -- Macro: ASM_OUTPUT_COMMON (STREAM, NAME, SIZE, ROUNDED)
  31269. A C statement (sans semicolon) to output to the stdio stream STREAM
  31270. the assembler definition of a common-label named NAME whose size is
  31271. SIZE bytes. The variable ROUNDED is the size rounded up to
  31272. whatever alignment the caller wants. It is possible that SIZE may
  31273. be zero, for instance if a struct with no other member than a
  31274. zero-length array is defined. In this case, the backend must
  31275. output a symbol definition that allocates at least one byte, both
  31276. so that the address of the resulting object does not compare equal
  31277. to any other, and because some object formats cannot even express
  31278. the concept of a zero-sized common symbol, as that is how they
  31279. represent an ordinary undefined external.
  31280. Use the expression 'assemble_name (STREAM, NAME)' to output the
  31281. name itself; before and after that, output the additional assembler
  31282. syntax for defining the name, and a newline.
  31283. This macro controls how the assembler definitions of uninitialized
  31284. common global variables are output.
  31285. -- Macro: ASM_OUTPUT_ALIGNED_COMMON (STREAM, NAME, SIZE, ALIGNMENT)
  31286. Like 'ASM_OUTPUT_COMMON' except takes the required alignment as a
  31287. separate, explicit argument. If you define this macro, it is used
  31288. in place of 'ASM_OUTPUT_COMMON', and gives you more flexibility in
  31289. handling the required alignment of the variable. The alignment is
  31290. specified as the number of bits.
  31291. -- Macro: ASM_OUTPUT_ALIGNED_DECL_COMMON (STREAM, DECL, NAME, SIZE,
  31292. ALIGNMENT)
  31293. Like 'ASM_OUTPUT_ALIGNED_COMMON' except that DECL of the variable
  31294. to be output, if there is one, or 'NULL_TREE' if there is no
  31295. corresponding variable. If you define this macro, GCC will use it
  31296. in place of both 'ASM_OUTPUT_COMMON' and
  31297. 'ASM_OUTPUT_ALIGNED_COMMON'. Define this macro when you need to
  31298. see the variable's decl in order to chose what to output.
  31299. -- Macro: ASM_OUTPUT_ALIGNED_BSS (STREAM, DECL, NAME, SIZE, ALIGNMENT)
  31300. A C statement (sans semicolon) to output to the stdio stream STREAM
  31301. the assembler definition of uninitialized global DECL named NAME
  31302. whose size is SIZE bytes. The variable ALIGNMENT is the alignment
  31303. specified as the number of bits.
  31304. Try to use function 'asm_output_aligned_bss' defined in file
  31305. 'varasm.c' when defining this macro. If unable, use the expression
  31306. 'assemble_name (STREAM, NAME)' to output the name itself; before
  31307. and after that, output the additional assembler syntax for defining
  31308. the name, and a newline.
  31309. There are two ways of handling global BSS. One is to define this
  31310. macro. The other is to have 'TARGET_ASM_SELECT_SECTION' return a
  31311. switchable BSS section (*note
  31312. TARGET_HAVE_SWITCHABLE_BSS_SECTIONS::). You do not need to do
  31313. both.
  31314. Some languages do not have 'common' data, and require a non-common
  31315. form of global BSS in order to handle uninitialized globals
  31316. efficiently. C++ is one example of this. However, if the target
  31317. does not support global BSS, the front end may choose to make
  31318. globals common in order to save space in the object file.
  31319. -- Macro: ASM_OUTPUT_LOCAL (STREAM, NAME, SIZE, ROUNDED)
  31320. A C statement (sans semicolon) to output to the stdio stream STREAM
  31321. the assembler definition of a local-common-label named NAME whose
  31322. size is SIZE bytes. The variable ROUNDED is the size rounded up to
  31323. whatever alignment the caller wants.
  31324. Use the expression 'assemble_name (STREAM, NAME)' to output the
  31325. name itself; before and after that, output the additional assembler
  31326. syntax for defining the name, and a newline.
  31327. This macro controls how the assembler definitions of uninitialized
  31328. static variables are output.
  31329. -- Macro: ASM_OUTPUT_ALIGNED_LOCAL (STREAM, NAME, SIZE, ALIGNMENT)
  31330. Like 'ASM_OUTPUT_LOCAL' except takes the required alignment as a
  31331. separate, explicit argument. If you define this macro, it is used
  31332. in place of 'ASM_OUTPUT_LOCAL', and gives you more flexibility in
  31333. handling the required alignment of the variable. The alignment is
  31334. specified as the number of bits.
  31335. -- Macro: ASM_OUTPUT_ALIGNED_DECL_LOCAL (STREAM, DECL, NAME, SIZE,
  31336. ALIGNMENT)
  31337. Like 'ASM_OUTPUT_ALIGNED_LOCAL' except that DECL of the variable to
  31338. be output, if there is one, or 'NULL_TREE' if there is no
  31339. corresponding variable. If you define this macro, GCC will use it
  31340. in place of both 'ASM_OUTPUT_LOCAL' and 'ASM_OUTPUT_ALIGNED_LOCAL'.
  31341. Define this macro when you need to see the variable's decl in order
  31342. to chose what to output.
  31343. 
  31344. File: gccint.info, Node: Label Output, Next: Initialization, Prev: Uninitialized Data, Up: Assembler Format
  31345. 18.20.4 Output and Generation of Labels
  31346. ---------------------------------------
  31347. This is about outputting labels.
  31348. -- Macro: ASM_OUTPUT_LABEL (STREAM, NAME)
  31349. A C statement (sans semicolon) to output to the stdio stream STREAM
  31350. the assembler definition of a label named NAME. Use the expression
  31351. 'assemble_name (STREAM, NAME)' to output the name itself; before
  31352. and after that, output the additional assembler syntax for defining
  31353. the name, and a newline. A default definition of this macro is
  31354. provided which is correct for most systems.
  31355. -- Macro: ASM_OUTPUT_FUNCTION_LABEL (STREAM, NAME, DECL)
  31356. A C statement (sans semicolon) to output to the stdio stream STREAM
  31357. the assembler definition of a label named NAME of a function. Use
  31358. the expression 'assemble_name (STREAM, NAME)' to output the name
  31359. itself; before and after that, output the additional assembler
  31360. syntax for defining the name, and a newline. A default definition
  31361. of this macro is provided which is correct for most systems.
  31362. If this macro is not defined, then the function name is defined in
  31363. the usual manner as a label (by means of 'ASM_OUTPUT_LABEL').
  31364. -- Macro: ASM_OUTPUT_INTERNAL_LABEL (STREAM, NAME)
  31365. Identical to 'ASM_OUTPUT_LABEL', except that NAME is known to refer
  31366. to a compiler-generated label. The default definition uses
  31367. 'assemble_name_raw', which is like 'assemble_name' except that it
  31368. is more efficient.
  31369. -- Macro: SIZE_ASM_OP
  31370. A C string containing the appropriate assembler directive to
  31371. specify the size of a symbol, without any arguments. On systems
  31372. that use ELF, the default (in 'config/elfos.h') is '"\t.size\t"';
  31373. on other systems, the default is not to define this macro.
  31374. Define this macro only if it is correct to use the default
  31375. definitions of 'ASM_OUTPUT_SIZE_DIRECTIVE' and
  31376. 'ASM_OUTPUT_MEASURED_SIZE' for your system. If you need your own
  31377. custom definitions of those macros, or if you do not need explicit
  31378. symbol sizes at all, do not define this macro.
  31379. -- Macro: ASM_OUTPUT_SIZE_DIRECTIVE (STREAM, NAME, SIZE)
  31380. A C statement (sans semicolon) to output to the stdio stream STREAM
  31381. a directive telling the assembler that the size of the symbol NAME
  31382. is SIZE. SIZE is a 'HOST_WIDE_INT'. If you define 'SIZE_ASM_OP',
  31383. a default definition of this macro is provided.
  31384. -- Macro: ASM_OUTPUT_MEASURED_SIZE (STREAM, NAME)
  31385. A C statement (sans semicolon) to output to the stdio stream STREAM
  31386. a directive telling the assembler to calculate the size of the
  31387. symbol NAME by subtracting its address from the current address.
  31388. If you define 'SIZE_ASM_OP', a default definition of this macro is
  31389. provided. The default assumes that the assembler recognizes a
  31390. special '.' symbol as referring to the current address, and can
  31391. calculate the difference between this and another symbol. If your
  31392. assembler does not recognize '.' or cannot do calculations with it,
  31393. you will need to redefine 'ASM_OUTPUT_MEASURED_SIZE' to use some
  31394. other technique.
  31395. -- Macro: NO_DOLLAR_IN_LABEL
  31396. Define this macro if the assembler does not accept the character
  31397. '$' in label names. By default constructors and destructors in G++
  31398. have '$' in the identifiers. If this macro is defined, '.' is used
  31399. instead.
  31400. -- Macro: NO_DOT_IN_LABEL
  31401. Define this macro if the assembler does not accept the character
  31402. '.' in label names. By default constructors and destructors in G++
  31403. have names that use '.'. If this macro is defined, these names are
  31404. rewritten to avoid '.'.
  31405. -- Macro: TYPE_ASM_OP
  31406. A C string containing the appropriate assembler directive to
  31407. specify the type of a symbol, without any arguments. On systems
  31408. that use ELF, the default (in 'config/elfos.h') is '"\t.type\t"';
  31409. on other systems, the default is not to define this macro.
  31410. Define this macro only if it is correct to use the default
  31411. definition of 'ASM_OUTPUT_TYPE_DIRECTIVE' for your system. If you
  31412. need your own custom definition of this macro, or if you do not
  31413. need explicit symbol types at all, do not define this macro.
  31414. -- Macro: TYPE_OPERAND_FMT
  31415. A C string which specifies (using 'printf' syntax) the format of
  31416. the second operand to 'TYPE_ASM_OP'. On systems that use ELF, the
  31417. default (in 'config/elfos.h') is '"@%s"'; on other systems, the
  31418. default is not to define this macro.
  31419. Define this macro only if it is correct to use the default
  31420. definition of 'ASM_OUTPUT_TYPE_DIRECTIVE' for your system. If you
  31421. need your own custom definition of this macro, or if you do not
  31422. need explicit symbol types at all, do not define this macro.
  31423. -- Macro: ASM_OUTPUT_TYPE_DIRECTIVE (STREAM, TYPE)
  31424. A C statement (sans semicolon) to output to the stdio stream STREAM
  31425. a directive telling the assembler that the type of the symbol NAME
  31426. is TYPE. TYPE is a C string; currently, that string is always
  31427. either '"function"' or '"object"', but you should not count on
  31428. this.
  31429. If you define 'TYPE_ASM_OP' and 'TYPE_OPERAND_FMT', a default
  31430. definition of this macro is provided.
  31431. -- Macro: ASM_DECLARE_FUNCTION_NAME (STREAM, NAME, DECL)
  31432. A C statement (sans semicolon) to output to the stdio stream STREAM
  31433. any text necessary for declaring the name NAME of a function which
  31434. is being defined. This macro is responsible for outputting the
  31435. label definition (perhaps using 'ASM_OUTPUT_FUNCTION_LABEL'). The
  31436. argument DECL is the 'FUNCTION_DECL' tree node representing the
  31437. function.
  31438. If this macro is not defined, then the function name is defined in
  31439. the usual manner as a label (by means of
  31440. 'ASM_OUTPUT_FUNCTION_LABEL').
  31441. You may wish to use 'ASM_OUTPUT_TYPE_DIRECTIVE' in the definition
  31442. of this macro.
  31443. -- Macro: ASM_DECLARE_FUNCTION_SIZE (STREAM, NAME, DECL)
  31444. A C statement (sans semicolon) to output to the stdio stream STREAM
  31445. any text necessary for declaring the size of a function which is
  31446. being defined. The argument NAME is the name of the function. The
  31447. argument DECL is the 'FUNCTION_DECL' tree node representing the
  31448. function.
  31449. If this macro is not defined, then the function size is not
  31450. defined.
  31451. You may wish to use 'ASM_OUTPUT_MEASURED_SIZE' in the definition of
  31452. this macro.
  31453. -- Macro: ASM_DECLARE_COLD_FUNCTION_NAME (STREAM, NAME, DECL)
  31454. A C statement (sans semicolon) to output to the stdio stream STREAM
  31455. any text necessary for declaring the name NAME of a cold function
  31456. partition which is being defined. This macro is responsible for
  31457. outputting the label definition (perhaps using
  31458. 'ASM_OUTPUT_FUNCTION_LABEL'). The argument DECL is the
  31459. 'FUNCTION_DECL' tree node representing the function.
  31460. If this macro is not defined, then the cold partition name is
  31461. defined in the usual manner as a label (by means of
  31462. 'ASM_OUTPUT_LABEL').
  31463. You may wish to use 'ASM_OUTPUT_TYPE_DIRECTIVE' in the definition
  31464. of this macro.
  31465. -- Macro: ASM_DECLARE_COLD_FUNCTION_SIZE (STREAM, NAME, DECL)
  31466. A C statement (sans semicolon) to output to the stdio stream STREAM
  31467. any text necessary for declaring the size of a cold function
  31468. partition which is being defined. The argument NAME is the name of
  31469. the cold partition of the function. The argument DECL is the
  31470. 'FUNCTION_DECL' tree node representing the function.
  31471. If this macro is not defined, then the partition size is not
  31472. defined.
  31473. You may wish to use 'ASM_OUTPUT_MEASURED_SIZE' in the definition of
  31474. this macro.
  31475. -- Macro: ASM_DECLARE_OBJECT_NAME (STREAM, NAME, DECL)
  31476. A C statement (sans semicolon) to output to the stdio stream STREAM
  31477. any text necessary for declaring the name NAME of an initialized
  31478. variable which is being defined. This macro must output the label
  31479. definition (perhaps using 'ASM_OUTPUT_LABEL'). The argument DECL
  31480. is the 'VAR_DECL' tree node representing the variable.
  31481. If this macro is not defined, then the variable name is defined in
  31482. the usual manner as a label (by means of 'ASM_OUTPUT_LABEL').
  31483. You may wish to use 'ASM_OUTPUT_TYPE_DIRECTIVE' and/or
  31484. 'ASM_OUTPUT_SIZE_DIRECTIVE' in the definition of this macro.
  31485. -- Target Hook: void TARGET_ASM_DECLARE_CONSTANT_NAME (FILE *FILE,
  31486. const char *NAME, const_tree EXPR, HOST_WIDE_INT SIZE)
  31487. A target hook to output to the stdio stream FILE any text necessary
  31488. for declaring the name NAME of a constant which is being defined.
  31489. This target hook is responsible for outputting the label definition
  31490. (perhaps using 'assemble_label'). The argument EXP is the value of
  31491. the constant, and SIZE is the size of the constant in bytes. The
  31492. NAME will be an internal label.
  31493. The default version of this target hook, define the NAME in the
  31494. usual manner as a label (by means of 'assemble_label').
  31495. You may wish to use 'ASM_OUTPUT_TYPE_DIRECTIVE' in this target
  31496. hook.
  31497. -- Macro: ASM_DECLARE_REGISTER_GLOBAL (STREAM, DECL, REGNO, NAME)
  31498. A C statement (sans semicolon) to output to the stdio stream STREAM
  31499. any text necessary for claiming a register REGNO for a global
  31500. variable DECL with name NAME.
  31501. If you don't define this macro, that is equivalent to defining it
  31502. to do nothing.
  31503. -- Macro: ASM_FINISH_DECLARE_OBJECT (STREAM, DECL, TOPLEVEL, ATEND)
  31504. A C statement (sans semicolon) to finish up declaring a variable
  31505. name once the compiler has processed its initializer fully and thus
  31506. has had a chance to determine the size of an array when controlled
  31507. by an initializer. This is used on systems where it's necessary to
  31508. declare something about the size of the object.
  31509. If you don't define this macro, that is equivalent to defining it
  31510. to do nothing.
  31511. You may wish to use 'ASM_OUTPUT_SIZE_DIRECTIVE' and/or
  31512. 'ASM_OUTPUT_MEASURED_SIZE' in the definition of this macro.
  31513. -- Target Hook: void TARGET_ASM_GLOBALIZE_LABEL (FILE *STREAM, const
  31514. char *NAME)
  31515. This target hook is a function to output to the stdio stream STREAM
  31516. some commands that will make the label NAME global; that is,
  31517. available for reference from other files.
  31518. The default implementation relies on a proper definition of
  31519. 'GLOBAL_ASM_OP'.
  31520. -- Target Hook: void TARGET_ASM_GLOBALIZE_DECL_NAME (FILE *STREAM, tree
  31521. DECL)
  31522. This target hook is a function to output to the stdio stream STREAM
  31523. some commands that will make the name associated with DECL global;
  31524. that is, available for reference from other files.
  31525. The default implementation uses the TARGET_ASM_GLOBALIZE_LABEL
  31526. target hook.
  31527. -- Target Hook: void TARGET_ASM_ASSEMBLE_UNDEFINED_DECL (FILE *STREAM,
  31528. const char *NAME, const_tree DECL)
  31529. This target hook is a function to output to the stdio stream STREAM
  31530. some commands that will declare the name associated with DECL which
  31531. is not defined in the current translation unit. Most assemblers do
  31532. not require anything to be output in this case.
  31533. -- Macro: ASM_WEAKEN_LABEL (STREAM, NAME)
  31534. A C statement (sans semicolon) to output to the stdio stream STREAM
  31535. some commands that will make the label NAME weak; that is,
  31536. available for reference from other files but only used if no other
  31537. definition is available. Use the expression 'assemble_name
  31538. (STREAM, NAME)' to output the name itself; before and after that,
  31539. output the additional assembler syntax for making that name weak,
  31540. and a newline.
  31541. If you don't define this macro or 'ASM_WEAKEN_DECL', GCC will not
  31542. support weak symbols and you should not define the 'SUPPORTS_WEAK'
  31543. macro.
  31544. -- Macro: ASM_WEAKEN_DECL (STREAM, DECL, NAME, VALUE)
  31545. Combines (and replaces) the function of 'ASM_WEAKEN_LABEL' and
  31546. 'ASM_OUTPUT_WEAK_ALIAS', allowing access to the associated function
  31547. or variable decl. If VALUE is not 'NULL', this C statement should
  31548. output to the stdio stream STREAM assembler code which defines
  31549. (equates) the weak symbol NAME to have the value VALUE. If VALUE
  31550. is 'NULL', it should output commands to make NAME weak.
  31551. -- Macro: ASM_OUTPUT_WEAKREF (STREAM, DECL, NAME, VALUE)
  31552. Outputs a directive that enables NAME to be used to refer to symbol
  31553. VALUE with weak-symbol semantics. 'decl' is the declaration of
  31554. 'name'.
  31555. -- Macro: SUPPORTS_WEAK
  31556. A preprocessor constant expression which evaluates to true if the
  31557. target supports weak symbols.
  31558. If you don't define this macro, 'defaults.h' provides a default
  31559. definition. If either 'ASM_WEAKEN_LABEL' or 'ASM_WEAKEN_DECL' is
  31560. defined, the default definition is '1'; otherwise, it is '0'.
  31561. -- Macro: TARGET_SUPPORTS_WEAK
  31562. A C expression which evaluates to true if the target supports weak
  31563. symbols.
  31564. If you don't define this macro, 'defaults.h' provides a default
  31565. definition. The default definition is '(SUPPORTS_WEAK)'. Define
  31566. this macro if you want to control weak symbol support with a
  31567. compiler flag such as '-melf'.
  31568. -- Macro: MAKE_DECL_ONE_ONLY (DECL)
  31569. A C statement (sans semicolon) to mark DECL to be emitted as a
  31570. public symbol such that extra copies in multiple translation units
  31571. will be discarded by the linker. Define this macro if your object
  31572. file format provides support for this concept, such as the 'COMDAT'
  31573. section flags in the Microsoft Windows PE/COFF format, and this
  31574. support requires changes to DECL, such as putting it in a separate
  31575. section.
  31576. -- Macro: SUPPORTS_ONE_ONLY
  31577. A C expression which evaluates to true if the target supports
  31578. one-only semantics.
  31579. If you don't define this macro, 'varasm.c' provides a default
  31580. definition. If 'MAKE_DECL_ONE_ONLY' is defined, the default
  31581. definition is '1'; otherwise, it is '0'. Define this macro if you
  31582. want to control one-only symbol support with a compiler flag, or if
  31583. setting the 'DECL_ONE_ONLY' flag is enough to mark a declaration to
  31584. be emitted as one-only.
  31585. -- Target Hook: void TARGET_ASM_ASSEMBLE_VISIBILITY (tree DECL, int
  31586. VISIBILITY)
  31587. This target hook is a function to output to ASM_OUT_FILE some
  31588. commands that will make the symbol(s) associated with DECL have
  31589. hidden, protected or internal visibility as specified by
  31590. VISIBILITY.
  31591. -- Macro: TARGET_WEAK_NOT_IN_ARCHIVE_TOC
  31592. A C expression that evaluates to true if the target's linker
  31593. expects that weak symbols do not appear in a static archive's table
  31594. of contents. The default is '0'.
  31595. Leaving weak symbols out of an archive's table of contents means
  31596. that, if a symbol will only have a definition in one translation
  31597. unit and will have undefined references from other translation
  31598. units, that symbol should not be weak. Defining this macro to be
  31599. nonzero will thus have the effect that certain symbols that would
  31600. normally be weak (explicit template instantiations, and vtables for
  31601. polymorphic classes with noninline key methods) will instead be
  31602. nonweak.
  31603. The C++ ABI requires this macro to be zero. Define this macro for
  31604. targets where full C++ ABI compliance is impossible and where
  31605. linker restrictions require weak symbols to be left out of a static
  31606. archive's table of contents.
  31607. -- Macro: ASM_OUTPUT_EXTERNAL (STREAM, DECL, NAME)
  31608. A C statement (sans semicolon) to output to the stdio stream STREAM
  31609. any text necessary for declaring the name of an external symbol
  31610. named NAME which is referenced in this compilation but not defined.
  31611. The value of DECL is the tree node for the declaration.
  31612. This macro need not be defined if it does not need to output
  31613. anything. The GNU assembler and most Unix assemblers don't require
  31614. anything.
  31615. -- Target Hook: void TARGET_ASM_EXTERNAL_LIBCALL (rtx SYMREF)
  31616. This target hook is a function to output to ASM_OUT_FILE an
  31617. assembler pseudo-op to declare a library function name external.
  31618. The name of the library function is given by SYMREF, which is a
  31619. 'symbol_ref'.
  31620. -- Target Hook: void TARGET_ASM_MARK_DECL_PRESERVED (const char
  31621. *SYMBOL)
  31622. This target hook is a function to output to ASM_OUT_FILE an
  31623. assembler directive to annotate SYMBOL as used. The Darwin target
  31624. uses the .no_dead_code_strip directive.
  31625. -- Macro: ASM_OUTPUT_LABELREF (STREAM, NAME)
  31626. A C statement (sans semicolon) to output to the stdio stream STREAM
  31627. a reference in assembler syntax to a label named NAME. This should
  31628. add '_' to the front of the name, if that is customary on your
  31629. operating system, as it is in most Berkeley Unix systems. This
  31630. macro is used in 'assemble_name'.
  31631. -- Target Hook: tree TARGET_MANGLE_ASSEMBLER_NAME (const char *NAME)
  31632. Given a symbol NAME, perform same mangling as 'varasm.c''s
  31633. 'assemble_name', but in memory rather than to a file stream,
  31634. returning result as an 'IDENTIFIER_NODE'. Required for correct LTO
  31635. symtabs. The default implementation calls the
  31636. 'TARGET_STRIP_NAME_ENCODING' hook and then prepends the
  31637. 'USER_LABEL_PREFIX', if any.
  31638. -- Macro: ASM_OUTPUT_SYMBOL_REF (STREAM, SYM)
  31639. A C statement (sans semicolon) to output a reference to
  31640. 'SYMBOL_REF' SYM. If not defined, 'assemble_name' will be used to
  31641. output the name of the symbol. This macro may be used to modify
  31642. the way a symbol is referenced depending on information encoded by
  31643. 'TARGET_ENCODE_SECTION_INFO'.
  31644. -- Macro: ASM_OUTPUT_LABEL_REF (STREAM, BUF)
  31645. A C statement (sans semicolon) to output a reference to BUF, the
  31646. result of 'ASM_GENERATE_INTERNAL_LABEL'. If not defined,
  31647. 'assemble_name' will be used to output the name of the symbol.
  31648. This macro is not used by 'output_asm_label', or the '%l' specifier
  31649. that calls it; the intention is that this macro should be set when
  31650. it is necessary to output a label differently when its address is
  31651. being taken.
  31652. -- Target Hook: void TARGET_ASM_INTERNAL_LABEL (FILE *STREAM, const
  31653. char *PREFIX, unsigned long LABELNO)
  31654. A function to output to the stdio stream STREAM a label whose name
  31655. is made from the string PREFIX and the number LABELNO.
  31656. It is absolutely essential that these labels be distinct from the
  31657. labels used for user-level functions and variables. Otherwise,
  31658. certain programs will have name conflicts with internal labels.
  31659. It is desirable to exclude internal labels from the symbol table of
  31660. the object file. Most assemblers have a naming convention for
  31661. labels that should be excluded; on many systems, the letter 'L' at
  31662. the beginning of a label has this effect. You should find out what
  31663. convention your system uses, and follow it.
  31664. The default version of this function utilizes
  31665. 'ASM_GENERATE_INTERNAL_LABEL'.
  31666. -- Macro: ASM_OUTPUT_DEBUG_LABEL (STREAM, PREFIX, NUM)
  31667. A C statement to output to the stdio stream STREAM a debug info
  31668. label whose name is made from the string PREFIX and the number NUM.
  31669. This is useful for VLIW targets, where debug info labels may need
  31670. to be treated differently than branch target labels. On some
  31671. systems, branch target labels must be at the beginning of
  31672. instruction bundles, but debug info labels can occur in the middle
  31673. of instruction bundles.
  31674. If this macro is not defined, then
  31675. '(*targetm.asm_out.internal_label)' will be used.
  31676. -- Macro: ASM_GENERATE_INTERNAL_LABEL (STRING, PREFIX, NUM)
  31677. A C statement to store into the string STRING a label whose name is
  31678. made from the string PREFIX and the number NUM.
  31679. This string, when output subsequently by 'assemble_name', should
  31680. produce the output that '(*targetm.asm_out.internal_label)' would
  31681. produce with the same PREFIX and NUM.
  31682. If the string begins with '*', then 'assemble_name' will output the
  31683. rest of the string unchanged. It is often convenient for
  31684. 'ASM_GENERATE_INTERNAL_LABEL' to use '*' in this way. If the
  31685. string doesn't start with '*', then 'ASM_OUTPUT_LABELREF' gets to
  31686. output the string, and may change it. (Of course,
  31687. 'ASM_OUTPUT_LABELREF' is also part of your machine description, so
  31688. you should know what it does on your machine.)
  31689. -- Macro: ASM_FORMAT_PRIVATE_NAME (OUTVAR, NAME, NUMBER)
  31690. A C expression to assign to OUTVAR (which is a variable of type
  31691. 'char *') a newly allocated string made from the string NAME and
  31692. the number NUMBER, with some suitable punctuation added. Use
  31693. 'alloca' to get space for the string.
  31694. The string will be used as an argument to 'ASM_OUTPUT_LABELREF' to
  31695. produce an assembler label for an internal static variable whose
  31696. name is NAME. Therefore, the string must be such as to result in
  31697. valid assembler code. The argument NUMBER is different each time
  31698. this macro is executed; it prevents conflicts between
  31699. similarly-named internal static variables in different scopes.
  31700. Ideally this string should not be a valid C identifier, to prevent
  31701. any conflict with the user's own symbols. Most assemblers allow
  31702. periods or percent signs in assembler symbols; putting at least one
  31703. of these between the name and the number will suffice.
  31704. If this macro is not defined, a default definition will be provided
  31705. which is correct for most systems.
  31706. -- Macro: ASM_OUTPUT_DEF (STREAM, NAME, VALUE)
  31707. A C statement to output to the stdio stream STREAM assembler code
  31708. which defines (equates) the symbol NAME to have the value VALUE.
  31709. If 'SET_ASM_OP' is defined, a default definition is provided which
  31710. is correct for most systems.
  31711. -- Macro: ASM_OUTPUT_DEF_FROM_DECLS (STREAM, DECL_OF_NAME,
  31712. DECL_OF_VALUE)
  31713. A C statement to output to the stdio stream STREAM assembler code
  31714. which defines (equates) the symbol whose tree node is DECL_OF_NAME
  31715. to have the value of the tree node DECL_OF_VALUE. This macro will
  31716. be used in preference to 'ASM_OUTPUT_DEF' if it is defined and if
  31717. the tree nodes are available.
  31718. If 'SET_ASM_OP' is defined, a default definition is provided which
  31719. is correct for most systems.
  31720. -- Macro: TARGET_DEFERRED_OUTPUT_DEFS (DECL_OF_NAME, DECL_OF_VALUE)
  31721. A C statement that evaluates to true if the assembler code which
  31722. defines (equates) the symbol whose tree node is DECL_OF_NAME to
  31723. have the value of the tree node DECL_OF_VALUE should be emitted
  31724. near the end of the current compilation unit. The default is to
  31725. not defer output of defines. This macro affects defines output by
  31726. 'ASM_OUTPUT_DEF' and 'ASM_OUTPUT_DEF_FROM_DECLS'.
  31727. -- Macro: ASM_OUTPUT_WEAK_ALIAS (STREAM, NAME, VALUE)
  31728. A C statement to output to the stdio stream STREAM assembler code
  31729. which defines (equates) the weak symbol NAME to have the value
  31730. VALUE. If VALUE is 'NULL', it defines NAME as an undefined weak
  31731. symbol.
  31732. Define this macro if the target only supports weak aliases; define
  31733. 'ASM_OUTPUT_DEF' instead if possible.
  31734. -- Macro: OBJC_GEN_METHOD_LABEL (BUF, IS_INST, CLASS_NAME, CAT_NAME,
  31735. SEL_NAME)
  31736. Define this macro to override the default assembler names used for
  31737. Objective-C methods.
  31738. The default name is a unique method number followed by the name of
  31739. the class (e.g. '_1_Foo'). For methods in categories, the name of
  31740. the category is also included in the assembler name (e.g.
  31741. '_1_Foo_Bar').
  31742. These names are safe on most systems, but make debugging difficult
  31743. since the method's selector is not present in the name. Therefore,
  31744. particular systems define other ways of computing names.
  31745. BUF is an expression of type 'char *' which gives you a buffer in
  31746. which to store the name; its length is as long as CLASS_NAME,
  31747. CAT_NAME and SEL_NAME put together, plus 50 characters extra.
  31748. The argument IS_INST specifies whether the method is an instance
  31749. method or a class method; CLASS_NAME is the name of the class;
  31750. CAT_NAME is the name of the category (or 'NULL' if the method is
  31751. not in a category); and SEL_NAME is the name of the selector.
  31752. On systems where the assembler can handle quoted names, you can use
  31753. this macro to provide more human-readable names.
  31754. 
  31755. File: gccint.info, Node: Initialization, Next: Macros for Initialization, Prev: Label Output, Up: Assembler Format
  31756. 18.20.5 How Initialization Functions Are Handled
  31757. ------------------------------------------------
  31758. The compiled code for certain languages includes "constructors" (also
  31759. called "initialization routines")--functions to initialize data in the
  31760. program when the program is started. These functions need to be called
  31761. before the program is "started"--that is to say, before 'main' is
  31762. called.
  31763. Compiling some languages generates "destructors" (also called
  31764. "termination routines") that should be called when the program
  31765. terminates.
  31766. To make the initialization and termination functions work, the compiler
  31767. must output something in the assembler code to cause those functions to
  31768. be called at the appropriate time. When you port the compiler to a new
  31769. system, you need to specify how to do this.
  31770. There are two major ways that GCC currently supports the execution of
  31771. initialization and termination functions. Each way has two variants.
  31772. Much of the structure is common to all four variations.
  31773. The linker must build two lists of these functions--a list of
  31774. initialization functions, called '__CTOR_LIST__', and a list of
  31775. termination functions, called '__DTOR_LIST__'.
  31776. Each list always begins with an ignored function pointer (which may
  31777. hold 0, -1, or a count of the function pointers after it, depending on
  31778. the environment). This is followed by a series of zero or more function
  31779. pointers to constructors (or destructors), followed by a function
  31780. pointer containing zero.
  31781. Depending on the operating system and its executable file format,
  31782. either 'crtstuff.c' or 'libgcc2.c' traverses these lists at startup time
  31783. and exit time. Constructors are called in reverse order of the list;
  31784. destructors in forward order.
  31785. The best way to handle static constructors works only for object file
  31786. formats which provide arbitrarily-named sections. A section is set
  31787. aside for a list of constructors, and another for a list of destructors.
  31788. Traditionally these are called '.ctors' and '.dtors'. Each object file
  31789. that defines an initialization function also puts a word in the
  31790. constructor section to point to that function. The linker accumulates
  31791. all these words into one contiguous '.ctors' section. Termination
  31792. functions are handled similarly.
  31793. This method will be chosen as the default by 'target-def.h' if
  31794. 'TARGET_ASM_NAMED_SECTION' is defined. A target that does not support
  31795. arbitrary sections, but does support special designated constructor and
  31796. destructor sections may define 'CTORS_SECTION_ASM_OP' and
  31797. 'DTORS_SECTION_ASM_OP' to achieve the same effect.
  31798. When arbitrary sections are available, there are two variants,
  31799. depending upon how the code in 'crtstuff.c' is called. On systems that
  31800. support a ".init" section which is executed at program startup, parts of
  31801. 'crtstuff.c' are compiled into that section. The program is linked by
  31802. the 'gcc' driver like this:
  31803. ld -o OUTPUT_FILE crti.o crtbegin.o ... -lgcc crtend.o crtn.o
  31804. The prologue of a function ('__init') appears in the '.init' section of
  31805. 'crti.o'; the epilogue appears in 'crtn.o'. Likewise for the function
  31806. '__fini' in the ".fini" section. Normally these files are provided by
  31807. the operating system or by the GNU C library, but are provided by GCC
  31808. for a few targets.
  31809. The objects 'crtbegin.o' and 'crtend.o' are (for most targets) compiled
  31810. from 'crtstuff.c'. They contain, among other things, code fragments
  31811. within the '.init' and '.fini' sections that branch to routines in the
  31812. '.text' section. The linker will pull all parts of a section together,
  31813. which results in a complete '__init' function that invokes the routines
  31814. we need at startup.
  31815. To use this variant, you must define the 'INIT_SECTION_ASM_OP' macro
  31816. properly.
  31817. If no init section is available, when GCC compiles any function called
  31818. 'main' (or more accurately, any function designated as a program entry
  31819. point by the language front end calling 'expand_main_function'), it
  31820. inserts a procedure call to '__main' as the first executable code after
  31821. the function prologue. The '__main' function is defined in 'libgcc2.c'
  31822. and runs the global constructors.
  31823. In file formats that don't support arbitrary sections, there are again
  31824. two variants. In the simplest variant, the GNU linker (GNU 'ld') and an
  31825. 'a.out' format must be used. In this case, 'TARGET_ASM_CONSTRUCTOR' is
  31826. defined to produce a '.stabs' entry of type 'N_SETT', referencing the
  31827. name '__CTOR_LIST__', and with the address of the void function
  31828. containing the initialization code as its value. The GNU linker
  31829. recognizes this as a request to add the value to a "set"; the values are
  31830. accumulated, and are eventually placed in the executable as a vector in
  31831. the format described above, with a leading (ignored) count and a
  31832. trailing zero element. 'TARGET_ASM_DESTRUCTOR' is handled similarly.
  31833. Since no init section is available, the absence of 'INIT_SECTION_ASM_OP'
  31834. causes the compilation of 'main' to call '__main' as above, starting the
  31835. initialization process.
  31836. The last variant uses neither arbitrary sections nor the GNU linker.
  31837. This is preferable when you want to do dynamic linking and when using
  31838. file formats which the GNU linker does not support, such as 'ECOFF'. In
  31839. this case, 'TARGET_HAVE_CTORS_DTORS' is false, initialization and
  31840. termination functions are recognized simply by their names. This
  31841. requires an extra program in the linkage step, called 'collect2'. This
  31842. program pretends to be the linker, for use with GCC; it does its job by
  31843. running the ordinary linker, but also arranges to include the vectors of
  31844. initialization and termination functions. These functions are called
  31845. via '__main' as described above. In order to use this method,
  31846. 'use_collect2' must be defined in the target in 'config.gcc'.
  31847. The following section describes the specific macros that control and
  31848. customize the handling of initialization and termination functions.
  31849. 
  31850. File: gccint.info, Node: Macros for Initialization, Next: Instruction Output, Prev: Initialization, Up: Assembler Format
  31851. 18.20.6 Macros Controlling Initialization Routines
  31852. --------------------------------------------------
  31853. Here are the macros that control how the compiler handles initialization
  31854. and termination functions:
  31855. -- Macro: INIT_SECTION_ASM_OP
  31856. If defined, a C string constant, including spacing, for the
  31857. assembler operation to identify the following data as
  31858. initialization code. If not defined, GCC will assume such a
  31859. section does not exist. When you are using special sections for
  31860. initialization and termination functions, this macro also controls
  31861. how 'crtstuff.c' and 'libgcc2.c' arrange to run the initialization
  31862. functions.
  31863. -- Macro: HAS_INIT_SECTION
  31864. If defined, 'main' will not call '__main' as described above. This
  31865. macro should be defined for systems that control start-up code on a
  31866. symbol-by-symbol basis, such as OSF/1, and should not be defined
  31867. explicitly for systems that support 'INIT_SECTION_ASM_OP'.
  31868. -- Macro: LD_INIT_SWITCH
  31869. If defined, a C string constant for a switch that tells the linker
  31870. that the following symbol is an initialization routine.
  31871. -- Macro: LD_FINI_SWITCH
  31872. If defined, a C string constant for a switch that tells the linker
  31873. that the following symbol is a finalization routine.
  31874. -- Macro: COLLECT_SHARED_INIT_FUNC (STREAM, FUNC)
  31875. If defined, a C statement that will write a function that can be
  31876. automatically called when a shared library is loaded. The function
  31877. should call FUNC, which takes no arguments. If not defined, and
  31878. the object format requires an explicit initialization function,
  31879. then a function called '_GLOBAL__DI' will be generated.
  31880. This function and the following one are used by collect2 when
  31881. linking a shared library that needs constructors or destructors, or
  31882. has DWARF2 exception tables embedded in the code.
  31883. -- Macro: COLLECT_SHARED_FINI_FUNC (STREAM, FUNC)
  31884. If defined, a C statement that will write a function that can be
  31885. automatically called when a shared library is unloaded. The
  31886. function should call FUNC, which takes no arguments. If not
  31887. defined, and the object format requires an explicit finalization
  31888. function, then a function called '_GLOBAL__DD' will be generated.
  31889. -- Macro: INVOKE__main
  31890. If defined, 'main' will call '__main' despite the presence of
  31891. 'INIT_SECTION_ASM_OP'. This macro should be defined for systems
  31892. where the init section is not actually run automatically, but is
  31893. still useful for collecting the lists of constructors and
  31894. destructors.
  31895. -- Macro: SUPPORTS_INIT_PRIORITY
  31896. If nonzero, the C++ 'init_priority' attribute is supported and the
  31897. compiler should emit instructions to control the order of
  31898. initialization of objects. If zero, the compiler will issue an
  31899. error message upon encountering an 'init_priority' attribute.
  31900. -- Target Hook: bool TARGET_HAVE_CTORS_DTORS
  31901. This value is true if the target supports some "native" method of
  31902. collecting constructors and destructors to be run at startup and
  31903. exit. It is false if we must use 'collect2'.
  31904. -- Target Hook: void TARGET_ASM_CONSTRUCTOR (rtx SYMBOL, int PRIORITY)
  31905. If defined, a function that outputs assembler code to arrange to
  31906. call the function referenced by SYMBOL at initialization time.
  31907. Assume that SYMBOL is a 'SYMBOL_REF' for a function taking no
  31908. arguments and with no return value. If the target supports
  31909. initialization priorities, PRIORITY is a value between 0 and
  31910. 'MAX_INIT_PRIORITY'; otherwise it must be 'DEFAULT_INIT_PRIORITY'.
  31911. If this macro is not defined by the target, a suitable default will
  31912. be chosen if (1) the target supports arbitrary section names, (2)
  31913. the target defines 'CTORS_SECTION_ASM_OP', or (3) 'USE_COLLECT2' is
  31914. not defined.
  31915. -- Target Hook: void TARGET_ASM_DESTRUCTOR (rtx SYMBOL, int PRIORITY)
  31916. This is like 'TARGET_ASM_CONSTRUCTOR' but used for termination
  31917. functions rather than initialization functions.
  31918. If 'TARGET_HAVE_CTORS_DTORS' is true, the initialization routine
  31919. generated for the generated object file will have static linkage.
  31920. If your system uses 'collect2' as the means of processing constructors,
  31921. then that program normally uses 'nm' to scan an object file for
  31922. constructor functions to be called.
  31923. On certain kinds of systems, you can define this macro to make
  31924. 'collect2' work faster (and, in some cases, make it work at all):
  31925. -- Macro: OBJECT_FORMAT_COFF
  31926. Define this macro if the system uses COFF (Common Object File
  31927. Format) object files, so that 'collect2' can assume this format and
  31928. scan object files directly for dynamic constructor/destructor
  31929. functions.
  31930. This macro is effective only in a native compiler; 'collect2' as
  31931. part of a cross compiler always uses 'nm' for the target machine.
  31932. -- Macro: REAL_NM_FILE_NAME
  31933. Define this macro as a C string constant containing the file name
  31934. to use to execute 'nm'. The default is to search the path normally
  31935. for 'nm'.
  31936. -- Macro: NM_FLAGS
  31937. 'collect2' calls 'nm' to scan object files for static constructors
  31938. and destructors and LTO info. By default, '-n' is passed. Define
  31939. 'NM_FLAGS' to a C string constant if other options are needed to
  31940. get the same output format as GNU 'nm -n' produces.
  31941. If your system supports shared libraries and has a program to list the
  31942. dynamic dependencies of a given library or executable, you can define
  31943. these macros to enable support for running initialization and
  31944. termination functions in shared libraries:
  31945. -- Macro: LDD_SUFFIX
  31946. Define this macro to a C string constant containing the name of the
  31947. program which lists dynamic dependencies, like 'ldd' under SunOS 4.
  31948. -- Macro: PARSE_LDD_OUTPUT (PTR)
  31949. Define this macro to be C code that extracts filenames from the
  31950. output of the program denoted by 'LDD_SUFFIX'. PTR is a variable
  31951. of type 'char *' that points to the beginning of a line of output
  31952. from 'LDD_SUFFIX'. If the line lists a dynamic dependency, the
  31953. code must advance PTR to the beginning of the filename on that
  31954. line. Otherwise, it must set PTR to 'NULL'.
  31955. -- Macro: SHLIB_SUFFIX
  31956. Define this macro to a C string constant containing the default
  31957. shared library extension of the target (e.g., '".so"'). 'collect2'
  31958. strips version information after this suffix when generating global
  31959. constructor and destructor names. This define is only needed on
  31960. targets that use 'collect2' to process constructors and
  31961. destructors.
  31962. 
  31963. File: gccint.info, Node: Instruction Output, Next: Dispatch Tables, Prev: Macros for Initialization, Up: Assembler Format
  31964. 18.20.7 Output of Assembler Instructions
  31965. ----------------------------------------
  31966. This describes assembler instruction output.
  31967. -- Macro: REGISTER_NAMES
  31968. A C initializer containing the assembler's names for the machine
  31969. registers, each one as a C string constant. This is what
  31970. translates register numbers in the compiler into assembler
  31971. language.
  31972. -- Macro: ADDITIONAL_REGISTER_NAMES
  31973. If defined, a C initializer for an array of structures containing a
  31974. name and a register number. This macro defines additional names
  31975. for hard registers, thus allowing the 'asm' option in declarations
  31976. to refer to registers using alternate names.
  31977. -- Macro: OVERLAPPING_REGISTER_NAMES
  31978. If defined, a C initializer for an array of structures containing a
  31979. name, a register number and a count of the number of consecutive
  31980. machine registers the name overlaps. This macro defines additional
  31981. names for hard registers, thus allowing the 'asm' option in
  31982. declarations to refer to registers using alternate names. Unlike
  31983. 'ADDITIONAL_REGISTER_NAMES', this macro should be used when the
  31984. register name implies multiple underlying registers.
  31985. This macro should be used when it is important that a clobber in an
  31986. 'asm' statement clobbers all the underlying values implied by the
  31987. register name. For example, on ARM, clobbering the
  31988. double-precision VFP register "d0" implies clobbering both
  31989. single-precision registers "s0" and "s1".
  31990. -- Macro: ASM_OUTPUT_OPCODE (STREAM, PTR)
  31991. Define this macro if you are using an unusual assembler that
  31992. requires different names for the machine instructions.
  31993. The definition is a C statement or statements which output an
  31994. assembler instruction opcode to the stdio stream STREAM. The
  31995. macro-operand PTR is a variable of type 'char *' which points to
  31996. the opcode name in its "internal" form--the form that is written in
  31997. the machine description. The definition should output the opcode
  31998. name to STREAM, performing any translation you desire, and
  31999. increment the variable PTR to point at the end of the opcode so
  32000. that it will not be output twice.
  32001. In fact, your macro definition may process less than the entire
  32002. opcode name, or more than the opcode name; but if you want to
  32003. process text that includes '%'-sequences to substitute operands,
  32004. you must take care of the substitution yourself. Just be sure to
  32005. increment PTR over whatever text should not be output normally.
  32006. If you need to look at the operand values, they can be found as the
  32007. elements of 'recog_data.operand'.
  32008. If the macro definition does nothing, the instruction is output in
  32009. the usual way.
  32010. -- Macro: FINAL_PRESCAN_INSN (INSN, OPVEC, NOPERANDS)
  32011. If defined, a C statement to be executed just prior to the output
  32012. of assembler code for INSN, to modify the extracted operands so
  32013. they will be output differently.
  32014. Here the argument OPVEC is the vector containing the operands
  32015. extracted from INSN, and NOPERANDS is the number of elements of the
  32016. vector which contain meaningful data for this insn. The contents
  32017. of this vector are what will be used to convert the insn template
  32018. into assembler code, so you can change the assembler output by
  32019. changing the contents of the vector.
  32020. This macro is useful when various assembler syntaxes share a single
  32021. file of instruction patterns; by defining this macro differently,
  32022. you can cause a large class of instructions to be output
  32023. differently (such as with rearranged operands). Naturally,
  32024. variations in assembler syntax affecting individual insn patterns
  32025. ought to be handled by writing conditional output routines in those
  32026. patterns.
  32027. If this macro is not defined, it is equivalent to a null statement.
  32028. -- Target Hook: void TARGET_ASM_FINAL_POSTSCAN_INSN (FILE *FILE,
  32029. rtx_insn *INSN, rtx *OPVEC, int NOPERANDS)
  32030. If defined, this target hook is a function which is executed just
  32031. after the output of assembler code for INSN, to change the mode of
  32032. the assembler if necessary.
  32033. Here the argument OPVEC is the vector containing the operands
  32034. extracted from INSN, and NOPERANDS is the number of elements of the
  32035. vector which contain meaningful data for this insn. The contents
  32036. of this vector are what was used to convert the insn template into
  32037. assembler code, so you can change the assembler mode by checking
  32038. the contents of the vector.
  32039. -- Macro: PRINT_OPERAND (STREAM, X, CODE)
  32040. A C compound statement to output to stdio stream STREAM the
  32041. assembler syntax for an instruction operand X. X is an RTL
  32042. expression.
  32043. CODE is a value that can be used to specify one of several ways of
  32044. printing the operand. It is used when identical operands must be
  32045. printed differently depending on the context. CODE comes from the
  32046. '%' specification that was used to request printing of the operand.
  32047. If the specification was just '%DIGIT' then CODE is 0; if the
  32048. specification was '%LTR DIGIT' then CODE is the ASCII code for LTR.
  32049. If X is a register, this macro should print the register's name.
  32050. The names can be found in an array 'reg_names' whose type is 'char
  32051. *[]'. 'reg_names' is initialized from 'REGISTER_NAMES'.
  32052. When the machine description has a specification '%PUNCT' (a '%'
  32053. followed by a punctuation character), this macro is called with a
  32054. null pointer for X and the punctuation character for CODE.
  32055. -- Macro: PRINT_OPERAND_PUNCT_VALID_P (CODE)
  32056. A C expression which evaluates to true if CODE is a valid
  32057. punctuation character for use in the 'PRINT_OPERAND' macro. If
  32058. 'PRINT_OPERAND_PUNCT_VALID_P' is not defined, it means that no
  32059. punctuation characters (except for the standard one, '%') are used
  32060. in this way.
  32061. -- Macro: PRINT_OPERAND_ADDRESS (STREAM, X)
  32062. A C compound statement to output to stdio stream STREAM the
  32063. assembler syntax for an instruction operand that is a memory
  32064. reference whose address is X. X is an RTL expression.
  32065. On some machines, the syntax for a symbolic address depends on the
  32066. section that the address refers to. On these machines, define the
  32067. hook 'TARGET_ENCODE_SECTION_INFO' to store the information into the
  32068. 'symbol_ref', and then check for it here. *Note Assembler
  32069. Format::.
  32070. -- Macro: DBR_OUTPUT_SEQEND (FILE)
  32071. A C statement, to be executed after all slot-filler instructions
  32072. have been output. If necessary, call 'dbr_sequence_length' to
  32073. determine the number of slots filled in a sequence (zero if not
  32074. currently outputting a sequence), to decide how many no-ops to
  32075. output, or whatever.
  32076. Don't define this macro if it has nothing to do, but it is helpful
  32077. in reading assembly output if the extent of the delay sequence is
  32078. made explicit (e.g. with white space).
  32079. Note that output routines for instructions with delay slots must be
  32080. prepared to deal with not being output as part of a sequence (i.e. when
  32081. the scheduling pass is not run, or when no slot fillers could be found.)
  32082. The variable 'final_sequence' is null when not processing a sequence,
  32083. otherwise it contains the 'sequence' rtx being output.
  32084. -- Macro: REGISTER_PREFIX
  32085. -- Macro: LOCAL_LABEL_PREFIX
  32086. -- Macro: USER_LABEL_PREFIX
  32087. -- Macro: IMMEDIATE_PREFIX
  32088. If defined, C string expressions to be used for the '%R', '%L',
  32089. '%U', and '%I' options of 'asm_fprintf' (see 'final.c'). These are
  32090. useful when a single 'md' file must support multiple assembler
  32091. formats. In that case, the various 'tm.h' files can define these
  32092. macros differently.
  32093. -- Macro: ASM_FPRINTF_EXTENSIONS (FILE, ARGPTR, FORMAT)
  32094. If defined this macro should expand to a series of 'case'
  32095. statements which will be parsed inside the 'switch' statement of
  32096. the 'asm_fprintf' function. This allows targets to define extra
  32097. printf formats which may useful when generating their assembler
  32098. statements. Note that uppercase letters are reserved for future
  32099. generic extensions to asm_fprintf, and so are not available to
  32100. target specific code. The output file is given by the parameter
  32101. FILE. The varargs input pointer is ARGPTR and the rest of the
  32102. format string, starting the character after the one that is being
  32103. switched upon, is pointed to by FORMAT.
  32104. -- Macro: ASSEMBLER_DIALECT
  32105. If your target supports multiple dialects of assembler language
  32106. (such as different opcodes), define this macro as a C expression
  32107. that gives the numeric index of the assembler language dialect to
  32108. use, with zero as the first variant.
  32109. If this macro is defined, you may use constructs of the form
  32110. '{option0|option1|option2...}'
  32111. in the output templates of patterns (*note Output Template::) or in
  32112. the first argument of 'asm_fprintf'. This construct outputs
  32113. 'option0', 'option1', 'option2', etc., if the value of
  32114. 'ASSEMBLER_DIALECT' is zero, one, two, etc. Any special characters
  32115. within these strings retain their usual meaning. If there are
  32116. fewer alternatives within the braces than the value of
  32117. 'ASSEMBLER_DIALECT', the construct outputs nothing. If it's needed
  32118. to print curly braces or '|' character in assembler output
  32119. directly, '%{', '%}' and '%|' can be used.
  32120. If you do not define this macro, the characters '{', '|' and '}' do
  32121. not have any special meaning when used in templates or operands to
  32122. 'asm_fprintf'.
  32123. Define the macros 'REGISTER_PREFIX', 'LOCAL_LABEL_PREFIX',
  32124. 'USER_LABEL_PREFIX' and 'IMMEDIATE_PREFIX' if you can express the
  32125. variations in assembler language syntax with that mechanism.
  32126. Define 'ASSEMBLER_DIALECT' and use the '{option0|option1}' syntax
  32127. if the syntax variant are larger and involve such things as
  32128. different opcodes or operand order.
  32129. -- Macro: ASM_OUTPUT_REG_PUSH (STREAM, REGNO)
  32130. A C expression to output to STREAM some assembler code which will
  32131. push hard register number REGNO onto the stack. The code need not
  32132. be optimal, since this macro is used only when profiling.
  32133. -- Macro: ASM_OUTPUT_REG_POP (STREAM, REGNO)
  32134. A C expression to output to STREAM some assembler code which will
  32135. pop hard register number REGNO off of the stack. The code need not
  32136. be optimal, since this macro is used only when profiling.
  32137. 
  32138. File: gccint.info, Node: Dispatch Tables, Next: Exception Region Output, Prev: Instruction Output, Up: Assembler Format
  32139. 18.20.8 Output of Dispatch Tables
  32140. ---------------------------------
  32141. This concerns dispatch tables.
  32142. -- Macro: ASM_OUTPUT_ADDR_DIFF_ELT (STREAM, BODY, VALUE, REL)
  32143. A C statement to output to the stdio stream STREAM an assembler
  32144. pseudo-instruction to generate a difference between two labels.
  32145. VALUE and REL are the numbers of two internal labels. The
  32146. definitions of these labels are output using
  32147. '(*targetm.asm_out.internal_label)', and they must be printed in
  32148. the same way here. For example,
  32149. fprintf (STREAM, "\t.word L%d-L%d\n",
  32150. VALUE, REL)
  32151. You must provide this macro on machines where the addresses in a
  32152. dispatch table are relative to the table's own address. If
  32153. defined, GCC will also use this macro on all machines when
  32154. producing PIC. BODY is the body of the 'ADDR_DIFF_VEC'; it is
  32155. provided so that the mode and flags can be read.
  32156. -- Macro: ASM_OUTPUT_ADDR_VEC_ELT (STREAM, VALUE)
  32157. This macro should be provided on machines where the addresses in a
  32158. dispatch table are absolute.
  32159. The definition should be a C statement to output to the stdio
  32160. stream STREAM an assembler pseudo-instruction to generate a
  32161. reference to a label. VALUE is the number of an internal label
  32162. whose definition is output using
  32163. '(*targetm.asm_out.internal_label)'. For example,
  32164. fprintf (STREAM, "\t.word L%d\n", VALUE)
  32165. -- Macro: ASM_OUTPUT_CASE_LABEL (STREAM, PREFIX, NUM, TABLE)
  32166. Define this if the label before a jump-table needs to be output
  32167. specially. The first three arguments are the same as for
  32168. '(*targetm.asm_out.internal_label)'; the fourth argument is the
  32169. jump-table which follows (a 'jump_table_data' containing an
  32170. 'addr_vec' or 'addr_diff_vec').
  32171. This feature is used on system V to output a 'swbeg' statement for
  32172. the table.
  32173. If this macro is not defined, these labels are output with
  32174. '(*targetm.asm_out.internal_label)'.
  32175. -- Macro: ASM_OUTPUT_CASE_END (STREAM, NUM, TABLE)
  32176. Define this if something special must be output at the end of a
  32177. jump-table. The definition should be a C statement to be executed
  32178. after the assembler code for the table is written. It should write
  32179. the appropriate code to stdio stream STREAM. The argument TABLE is
  32180. the jump-table insn, and NUM is the label-number of the preceding
  32181. label.
  32182. If this macro is not defined, nothing special is output at the end
  32183. of the jump-table.
  32184. -- Target Hook: void TARGET_ASM_POST_CFI_STARTPROC (FILE *, TREE)
  32185. This target hook is used to emit assembly strings required by the
  32186. target after the .cfi_startproc directive. The first argument is
  32187. the file stream to write the strings to and the second argument is
  32188. the function's declaration. The expected use is to add more .cfi_*
  32189. directives.
  32190. The default is to not output any assembly strings.
  32191. -- Target Hook: void TARGET_ASM_EMIT_UNWIND_LABEL (FILE *STREAM, tree
  32192. DECL, int FOR_EH, int EMPTY)
  32193. This target hook emits a label at the beginning of each FDE. It
  32194. should be defined on targets where FDEs need special labels, and it
  32195. should write the appropriate label, for the FDE associated with the
  32196. function declaration DECL, to the stdio stream STREAM. The third
  32197. argument, FOR_EH, is a boolean: true if this is for an exception
  32198. table. The fourth argument, EMPTY, is a boolean: true if this is a
  32199. placeholder label for an omitted FDE.
  32200. The default is that FDEs are not given nonlocal labels.
  32201. -- Target Hook: void TARGET_ASM_EMIT_EXCEPT_TABLE_LABEL (FILE *STREAM)
  32202. This target hook emits a label at the beginning of the exception
  32203. table. It should be defined on targets where it is desirable for
  32204. the table to be broken up according to function.
  32205. The default is that no label is emitted.
  32206. -- Target Hook: void TARGET_ASM_EMIT_EXCEPT_PERSONALITY (rtx
  32207. PERSONALITY)
  32208. If the target implements 'TARGET_ASM_UNWIND_EMIT', this hook may be
  32209. used to emit a directive to install a personality hook into the
  32210. unwind info. This hook should not be used if dwarf2 unwind info is
  32211. used.
  32212. -- Target Hook: void TARGET_ASM_UNWIND_EMIT (FILE *STREAM, rtx_insn
  32213. *INSN)
  32214. This target hook emits assembly directives required to unwind the
  32215. given instruction. This is only used when
  32216. 'TARGET_EXCEPT_UNWIND_INFO' returns 'UI_TARGET'.
  32217. -- Target Hook: bool TARGET_ASM_UNWIND_EMIT_BEFORE_INSN
  32218. True if the 'TARGET_ASM_UNWIND_EMIT' hook should be called before
  32219. the assembly for INSN has been emitted, false if the hook should be
  32220. called afterward.
  32221. 
  32222. File: gccint.info, Node: Exception Region Output, Next: Alignment Output, Prev: Dispatch Tables, Up: Assembler Format
  32223. 18.20.9 Assembler Commands for Exception Regions
  32224. ------------------------------------------------
  32225. This describes commands marking the start and the end of an exception
  32226. region.
  32227. -- Macro: EH_FRAME_SECTION_NAME
  32228. If defined, a C string constant for the name of the section
  32229. containing exception handling frame unwind information. If not
  32230. defined, GCC will provide a default definition if the target
  32231. supports named sections. 'crtstuff.c' uses this macro to switch to
  32232. the appropriate section.
  32233. You should define this symbol if your target supports DWARF 2 frame
  32234. unwind information and the default definition does not work.
  32235. -- Macro: EH_FRAME_THROUGH_COLLECT2
  32236. If defined, DWARF 2 frame unwind information will identified by
  32237. specially named labels. The collect2 process will locate these
  32238. labels and generate code to register the frames.
  32239. This might be necessary, for instance, if the system linker will
  32240. not place the eh_frames in-between the sentinals from 'crtstuff.c',
  32241. or if the system linker does garbage collection and sections cannot
  32242. be marked as not to be collected.
  32243. -- Macro: EH_TABLES_CAN_BE_READ_ONLY
  32244. Define this macro to 1 if your target is such that no frame unwind
  32245. information encoding used with non-PIC code will ever require a
  32246. runtime relocation, but the linker may not support merging
  32247. read-only and read-write sections into a single read-write section.
  32248. -- Macro: MASK_RETURN_ADDR
  32249. An rtx used to mask the return address found via 'RETURN_ADDR_RTX',
  32250. so that it does not contain any extraneous set bits in it.
  32251. -- Macro: DWARF2_UNWIND_INFO
  32252. Define this macro to 0 if your target supports DWARF 2 frame unwind
  32253. information, but it does not yet work with exception handling.
  32254. Otherwise, if your target supports this information (if it defines
  32255. 'INCOMING_RETURN_ADDR_RTX' and 'OBJECT_FORMAT_ELF'), GCC will
  32256. provide a default definition of 1.
  32257. -- Common Target Hook: enum unwind_info_type TARGET_EXCEPT_UNWIND_INFO
  32258. (struct gcc_options *OPTS)
  32259. This hook defines the mechanism that will be used for exception
  32260. handling by the target. If the target has ABI specified unwind
  32261. tables, the hook should return 'UI_TARGET'. If the target is to
  32262. use the 'setjmp'/'longjmp'-based exception handling scheme, the
  32263. hook should return 'UI_SJLJ'. If the target supports DWARF 2 frame
  32264. unwind information, the hook should return 'UI_DWARF2'.
  32265. A target may, if exceptions are disabled, choose to return
  32266. 'UI_NONE'. This may end up simplifying other parts of
  32267. target-specific code. The default implementation of this hook
  32268. never returns 'UI_NONE'.
  32269. Note that the value returned by this hook should be constant. It
  32270. should not depend on anything except the command-line switches
  32271. described by OPTS. In particular, the setting 'UI_SJLJ' must be
  32272. fixed at compiler start-up as C pre-processor macros and builtin
  32273. functions related to exception handling are set up depending on
  32274. this setting.
  32275. The default implementation of the hook first honors the
  32276. '--enable-sjlj-exceptions' configure option, then
  32277. 'DWARF2_UNWIND_INFO', and finally defaults to 'UI_SJLJ'. If
  32278. 'DWARF2_UNWIND_INFO' depends on command-line options, the target
  32279. must define this hook so that OPTS is used correctly.
  32280. -- Common Target Hook: bool TARGET_UNWIND_TABLES_DEFAULT
  32281. This variable should be set to 'true' if the target ABI requires
  32282. unwinding tables even when exceptions are not used. It must not be
  32283. modified by command-line option processing.
  32284. -- Macro: DONT_USE_BUILTIN_SETJMP
  32285. Define this macro to 1 if the 'setjmp'/'longjmp'-based scheme
  32286. should use the 'setjmp'/'longjmp' functions from the C library
  32287. instead of the '__builtin_setjmp'/'__builtin_longjmp' machinery.
  32288. -- Macro: JMP_BUF_SIZE
  32289. This macro has no effect unless 'DONT_USE_BUILTIN_SETJMP' is also
  32290. defined. Define this macro if the default size of 'jmp_buf' buffer
  32291. for the 'setjmp'/'longjmp'-based exception handling mechanism is
  32292. not large enough, or if it is much too large. The default size is
  32293. 'FIRST_PSEUDO_REGISTER * sizeof(void *)'.
  32294. -- Macro: DWARF_CIE_DATA_ALIGNMENT
  32295. This macro need only be defined if the target might save registers
  32296. in the function prologue at an offset to the stack pointer that is
  32297. not aligned to 'UNITS_PER_WORD'. The definition should be the
  32298. negative minimum alignment if 'STACK_GROWS_DOWNWARD' is true, and
  32299. the positive minimum alignment otherwise. *Note DWARF::. Only
  32300. applicable if the target supports DWARF 2 frame unwind information.
  32301. -- Target Hook: bool TARGET_TERMINATE_DW2_EH_FRAME_INFO
  32302. Contains the value true if the target should add a zero word onto
  32303. the end of a Dwarf-2 frame info section when used for exception
  32304. handling. Default value is false if 'EH_FRAME_SECTION_NAME' is
  32305. defined, and true otherwise.
  32306. -- Target Hook: rtx TARGET_DWARF_REGISTER_SPAN (rtx REG)
  32307. Given a register, this hook should return a parallel of registers
  32308. to represent where to find the register pieces. Define this hook
  32309. if the register and its mode are represented in Dwarf in
  32310. non-contiguous locations, or if the register should be represented
  32311. in more than one register in Dwarf. Otherwise, this hook should
  32312. return 'NULL_RTX'. If not defined, the default is to return
  32313. 'NULL_RTX'.
  32314. -- Target Hook: machine_mode TARGET_DWARF_FRAME_REG_MODE (int REGNO)
  32315. Given a register, this hook should return the mode which the
  32316. corresponding Dwarf frame register should have. This is normally
  32317. used to return a smaller mode than the raw mode to prevent call
  32318. clobbered parts of a register altering the frame register size
  32319. -- Target Hook: void TARGET_INIT_DWARF_REG_SIZES_EXTRA (tree ADDRESS)
  32320. If some registers are represented in Dwarf-2 unwind information in
  32321. multiple pieces, define this hook to fill in information about the
  32322. sizes of those pieces in the table used by the unwinder at runtime.
  32323. It will be called by 'expand_builtin_init_dwarf_reg_sizes' after
  32324. filling in a single size corresponding to each hard register;
  32325. ADDRESS is the address of the table.
  32326. -- Target Hook: bool TARGET_ASM_TTYPE (rtx SYM)
  32327. This hook is used to output a reference from a frame unwinding
  32328. table to the type_info object identified by SYM. It should return
  32329. 'true' if the reference was output. Returning 'false' will cause
  32330. the reference to be output using the normal Dwarf2 routines.
  32331. -- Target Hook: bool TARGET_ARM_EABI_UNWINDER
  32332. This flag should be set to 'true' on targets that use an ARM EABI
  32333. based unwinding library, and 'false' on other targets. This
  32334. effects the format of unwinding tables, and how the unwinder in
  32335. entered after running a cleanup. The default is 'false'.
  32336. 
  32337. File: gccint.info, Node: Alignment Output, Prev: Exception Region Output, Up: Assembler Format
  32338. 18.20.10 Assembler Commands for Alignment
  32339. -----------------------------------------
  32340. This describes commands for alignment.
  32341. -- Macro: JUMP_ALIGN (LABEL)
  32342. The alignment (log base 2) to put in front of LABEL, which is a
  32343. common destination of jumps and has no fallthru incoming edge.
  32344. This macro need not be defined if you don't want any special
  32345. alignment to be done at such a time. Most machine descriptions do
  32346. not currently define the macro.
  32347. Unless it's necessary to inspect the LABEL parameter, it is better
  32348. to set the variable ALIGN_JUMPS in the target's
  32349. 'TARGET_OPTION_OVERRIDE'. Otherwise, you should try to honor the
  32350. user's selection in ALIGN_JUMPS in a 'JUMP_ALIGN' implementation.
  32351. -- Macro: LABEL_ALIGN_AFTER_BARRIER (LABEL)
  32352. The alignment (log base 2) to put in front of LABEL, which follows
  32353. a 'BARRIER'.
  32354. This macro need not be defined if you don't want any special
  32355. alignment to be done at such a time. Most machine descriptions do
  32356. not currently define the macro.
  32357. -- Macro: LOOP_ALIGN (LABEL)
  32358. The alignment (log base 2) to put in front of LABEL that heads a
  32359. frequently executed basic block (usually the header of a loop).
  32360. This macro need not be defined if you don't want any special
  32361. alignment to be done at such a time. Most machine descriptions do
  32362. not currently define the macro.
  32363. Unless it's necessary to inspect the LABEL parameter, it is better
  32364. to set the variable 'align_loops' in the target's
  32365. 'TARGET_OPTION_OVERRIDE'. Otherwise, you should try to honor the
  32366. user's selection in 'align_loops' in a 'LOOP_ALIGN' implementation.
  32367. -- Macro: LABEL_ALIGN (LABEL)
  32368. The alignment (log base 2) to put in front of LABEL. If
  32369. 'LABEL_ALIGN_AFTER_BARRIER' / 'LOOP_ALIGN' specify a different
  32370. alignment, the maximum of the specified values is used.
  32371. Unless it's necessary to inspect the LABEL parameter, it is better
  32372. to set the variable 'align_labels' in the target's
  32373. 'TARGET_OPTION_OVERRIDE'. Otherwise, you should try to honor the
  32374. user's selection in 'align_labels' in a 'LABEL_ALIGN'
  32375. implementation.
  32376. -- Macro: ASM_OUTPUT_SKIP (STREAM, NBYTES)
  32377. A C statement to output to the stdio stream STREAM an assembler
  32378. instruction to advance the location counter by NBYTES bytes. Those
  32379. bytes should be zero when loaded. NBYTES will be a C expression of
  32380. type 'unsigned HOST_WIDE_INT'.
  32381. -- Macro: ASM_NO_SKIP_IN_TEXT
  32382. Define this macro if 'ASM_OUTPUT_SKIP' should not be used in the
  32383. text section because it fails to put zeros in the bytes that are
  32384. skipped. This is true on many Unix systems, where the pseudo-op to
  32385. skip bytes produces no-op instructions rather than zeros when used
  32386. in the text section.
  32387. -- Macro: ASM_OUTPUT_ALIGN (STREAM, POWER)
  32388. A C statement to output to the stdio stream STREAM an assembler
  32389. command to advance the location counter to a multiple of 2 to the
  32390. POWER bytes. POWER will be a C expression of type 'int'.
  32391. -- Macro: ASM_OUTPUT_ALIGN_WITH_NOP (STREAM, POWER)
  32392. Like 'ASM_OUTPUT_ALIGN', except that the "nop" instruction is used
  32393. for padding, if necessary.
  32394. -- Macro: ASM_OUTPUT_MAX_SKIP_ALIGN (STREAM, POWER, MAX_SKIP)
  32395. A C statement to output to the stdio stream STREAM an assembler
  32396. command to advance the location counter to a multiple of 2 to the
  32397. POWER bytes, but only if MAX_SKIP or fewer bytes are needed to
  32398. satisfy the alignment request. POWER and MAX_SKIP will be a C
  32399. expression of type 'int'.
  32400. 
  32401. File: gccint.info, Node: Debugging Info, Next: Floating Point, Prev: Assembler Format, Up: Target Macros
  32402. 18.21 Controlling Debugging Information Format
  32403. ==============================================
  32404. This describes how to specify debugging information.
  32405. * Menu:
  32406. * All Debuggers:: Macros that affect all debugging formats uniformly.
  32407. * DBX Options:: Macros enabling specific options in DBX format.
  32408. * DBX Hooks:: Hook macros for varying DBX format.
  32409. * File Names and DBX:: Macros controlling output of file names in DBX format.
  32410. * DWARF:: Macros for DWARF format.
  32411. * VMS Debug:: Macros for VMS debug format.
  32412. 
  32413. File: gccint.info, Node: All Debuggers, Next: DBX Options, Up: Debugging Info
  32414. 18.21.1 Macros Affecting All Debugging Formats
  32415. ----------------------------------------------
  32416. These macros affect all debugging formats.
  32417. -- Macro: DBX_REGISTER_NUMBER (REGNO)
  32418. A C expression that returns the DBX register number for the
  32419. compiler register number REGNO. In the default macro provided, the
  32420. value of this expression will be REGNO itself. But sometimes there
  32421. are some registers that the compiler knows about and DBX does not,
  32422. or vice versa. In such cases, some register may need to have one
  32423. number in the compiler and another for DBX.
  32424. If two registers have consecutive numbers inside GCC, and they can
  32425. be used as a pair to hold a multiword value, then they _must_ have
  32426. consecutive numbers after renumbering with 'DBX_REGISTER_NUMBER'.
  32427. Otherwise, debuggers will be unable to access such a pair, because
  32428. they expect register pairs to be consecutive in their own numbering
  32429. scheme.
  32430. If you find yourself defining 'DBX_REGISTER_NUMBER' in way that
  32431. does not preserve register pairs, then what you must do instead is
  32432. redefine the actual register numbering scheme.
  32433. -- Macro: DEBUGGER_AUTO_OFFSET (X)
  32434. A C expression that returns the integer offset value for an
  32435. automatic variable having address X (an RTL expression). The
  32436. default computation assumes that X is based on the frame-pointer
  32437. and gives the offset from the frame-pointer. This is required for
  32438. targets that produce debugging output for DBX and allow the
  32439. frame-pointer to be eliminated when the '-g' option is used.
  32440. -- Macro: DEBUGGER_ARG_OFFSET (OFFSET, X)
  32441. A C expression that returns the integer offset value for an
  32442. argument having address X (an RTL expression). The nominal offset
  32443. is OFFSET.
  32444. -- Macro: PREFERRED_DEBUGGING_TYPE
  32445. A C expression that returns the type of debugging output GCC should
  32446. produce when the user specifies just '-g'. Define this if you have
  32447. arranged for GCC to support more than one format of debugging
  32448. output. Currently, the allowable values are 'DBX_DEBUG',
  32449. 'DWARF2_DEBUG', 'XCOFF_DEBUG', 'VMS_DEBUG', and
  32450. 'VMS_AND_DWARF2_DEBUG'.
  32451. When the user specifies '-ggdb', GCC normally also uses the value
  32452. of this macro to select the debugging output format, but with two
  32453. exceptions. If 'DWARF2_DEBUGGING_INFO' is defined, GCC uses the
  32454. value 'DWARF2_DEBUG'. Otherwise, if 'DBX_DEBUGGING_INFO' is
  32455. defined, GCC uses 'DBX_DEBUG'.
  32456. The value of this macro only affects the default debugging output;
  32457. the user can always get a specific type of output by using
  32458. '-gstabs', '-gdwarf-2', '-gxcoff', or '-gvms'.
  32459. 
  32460. File: gccint.info, Node: DBX Options, Next: DBX Hooks, Prev: All Debuggers, Up: Debugging Info
  32461. 18.21.2 Specific Options for DBX Output
  32462. ---------------------------------------
  32463. These are specific options for DBX output.
  32464. -- Macro: DBX_DEBUGGING_INFO
  32465. Define this macro if GCC should produce debugging output for DBX in
  32466. response to the '-g' option.
  32467. -- Macro: XCOFF_DEBUGGING_INFO
  32468. Define this macro if GCC should produce XCOFF format debugging
  32469. output in response to the '-g' option. This is a variant of DBX
  32470. format.
  32471. -- Macro: DEFAULT_GDB_EXTENSIONS
  32472. Define this macro to control whether GCC should by default generate
  32473. GDB's extended version of DBX debugging information (assuming
  32474. DBX-format debugging information is enabled at all). If you don't
  32475. define the macro, the default is 1: always generate the extended
  32476. information if there is any occasion to.
  32477. -- Macro: DEBUG_SYMS_TEXT
  32478. Define this macro if all '.stabs' commands should be output while
  32479. in the text section.
  32480. -- Macro: ASM_STABS_OP
  32481. A C string constant, including spacing, naming the assembler pseudo
  32482. op to use instead of '"\t.stabs\t"' to define an ordinary debugging
  32483. symbol. If you don't define this macro, '"\t.stabs\t"' is used.
  32484. This macro applies only to DBX debugging information format.
  32485. -- Macro: ASM_STABD_OP
  32486. A C string constant, including spacing, naming the assembler pseudo
  32487. op to use instead of '"\t.stabd\t"' to define a debugging symbol
  32488. whose value is the current location. If you don't define this
  32489. macro, '"\t.stabd\t"' is used. This macro applies only to DBX
  32490. debugging information format.
  32491. -- Macro: ASM_STABN_OP
  32492. A C string constant, including spacing, naming the assembler pseudo
  32493. op to use instead of '"\t.stabn\t"' to define a debugging symbol
  32494. with no name. If you don't define this macro, '"\t.stabn\t"' is
  32495. used. This macro applies only to DBX debugging information format.
  32496. -- Macro: DBX_NO_XREFS
  32497. Define this macro if DBX on your system does not support the
  32498. construct 'xsTAGNAME'. On some systems, this construct is used to
  32499. describe a forward reference to a structure named TAGNAME. On
  32500. other systems, this construct is not supported at all.
  32501. -- Macro: DBX_CONTIN_LENGTH
  32502. A symbol name in DBX-format debugging information is normally
  32503. continued (split into two separate '.stabs' directives) when it
  32504. exceeds a certain length (by default, 80 characters). On some
  32505. operating systems, DBX requires this splitting; on others,
  32506. splitting must not be done. You can inhibit splitting by defining
  32507. this macro with the value zero. You can override the default
  32508. splitting-length by defining this macro as an expression for the
  32509. length you desire.
  32510. -- Macro: DBX_CONTIN_CHAR
  32511. Normally continuation is indicated by adding a '\' character to the
  32512. end of a '.stabs' string when a continuation follows. To use a
  32513. different character instead, define this macro as a character
  32514. constant for the character you want to use. Do not define this
  32515. macro if backslash is correct for your system.
  32516. -- Macro: DBX_STATIC_STAB_DATA_SECTION
  32517. Define this macro if it is necessary to go to the data section
  32518. before outputting the '.stabs' pseudo-op for a non-global static
  32519. variable.
  32520. -- Macro: DBX_TYPE_DECL_STABS_CODE
  32521. The value to use in the "code" field of the '.stabs' directive for
  32522. a typedef. The default is 'N_LSYM'.
  32523. -- Macro: DBX_STATIC_CONST_VAR_CODE
  32524. The value to use in the "code" field of the '.stabs' directive for
  32525. a static variable located in the text section. DBX format does not
  32526. provide any "right" way to do this. The default is 'N_FUN'.
  32527. -- Macro: DBX_REGPARM_STABS_CODE
  32528. The value to use in the "code" field of the '.stabs' directive for
  32529. a parameter passed in registers. DBX format does not provide any
  32530. "right" way to do this. The default is 'N_RSYM'.
  32531. -- Macro: DBX_REGPARM_STABS_LETTER
  32532. The letter to use in DBX symbol data to identify a symbol as a
  32533. parameter passed in registers. DBX format does not customarily
  32534. provide any way to do this. The default is ''P''.
  32535. -- Macro: DBX_FUNCTION_FIRST
  32536. Define this macro if the DBX information for a function and its
  32537. arguments should precede the assembler code for the function.
  32538. Normally, in DBX format, the debugging information entirely follows
  32539. the assembler code.
  32540. -- Macro: DBX_BLOCKS_FUNCTION_RELATIVE
  32541. Define this macro, with value 1, if the value of a symbol
  32542. describing the scope of a block ('N_LBRAC' or 'N_RBRAC') should be
  32543. relative to the start of the enclosing function. Normally, GCC
  32544. uses an absolute address.
  32545. -- Macro: DBX_LINES_FUNCTION_RELATIVE
  32546. Define this macro, with value 1, if the value of a symbol
  32547. indicating the current line number ('N_SLINE') should be relative
  32548. to the start of the enclosing function. Normally, GCC uses an
  32549. absolute address.
  32550. -- Macro: DBX_USE_BINCL
  32551. Define this macro if GCC should generate 'N_BINCL' and 'N_EINCL'
  32552. stabs for included header files, as on Sun systems. This macro
  32553. also directs GCC to output a type number as a pair of a file number
  32554. and a type number within the file. Normally, GCC does not generate
  32555. 'N_BINCL' or 'N_EINCL' stabs, and it outputs a single number for a
  32556. type number.
  32557. 
  32558. File: gccint.info, Node: DBX Hooks, Next: File Names and DBX, Prev: DBX Options, Up: Debugging Info
  32559. 18.21.3 Open-Ended Hooks for DBX Format
  32560. ---------------------------------------
  32561. These are hooks for DBX format.
  32562. -- Macro: DBX_OUTPUT_SOURCE_LINE (STREAM, LINE, COUNTER)
  32563. A C statement to output DBX debugging information before code for
  32564. line number LINE of the current source file to the stdio stream
  32565. STREAM. COUNTER is the number of time the macro was invoked,
  32566. including the current invocation; it is intended to generate unique
  32567. labels in the assembly output.
  32568. This macro should not be defined if the default output is correct,
  32569. or if it can be made correct by defining
  32570. 'DBX_LINES_FUNCTION_RELATIVE'.
  32571. -- Macro: NO_DBX_FUNCTION_END
  32572. Some stabs encapsulation formats (in particular ECOFF), cannot
  32573. handle the '.stabs "",N_FUN,,0,0,Lscope-function-1' gdb dbx
  32574. extension construct. On those machines, define this macro to turn
  32575. this feature off without disturbing the rest of the gdb extensions.
  32576. -- Macro: NO_DBX_BNSYM_ENSYM
  32577. Some assemblers cannot handle the '.stabd BNSYM/ENSYM,0,0' gdb dbx
  32578. extension construct. On those machines, define this macro to turn
  32579. this feature off without disturbing the rest of the gdb extensions.
  32580. 
  32581. File: gccint.info, Node: File Names and DBX, Next: DWARF, Prev: DBX Hooks, Up: Debugging Info
  32582. 18.21.4 File Names in DBX Format
  32583. --------------------------------
  32584. This describes file names in DBX format.
  32585. -- Macro: DBX_OUTPUT_MAIN_SOURCE_FILENAME (STREAM, NAME)
  32586. A C statement to output DBX debugging information to the stdio
  32587. stream STREAM, which indicates that file NAME is the main source
  32588. file--the file specified as the input file for compilation. This
  32589. macro is called only once, at the beginning of compilation.
  32590. This macro need not be defined if the standard form of output for
  32591. DBX debugging information is appropriate.
  32592. It may be necessary to refer to a label equal to the beginning of
  32593. the text section. You can use 'assemble_name (stream,
  32594. ltext_label_name)' to do so. If you do this, you must also set the
  32595. variable USED_LTEXT_LABEL_NAME to 'true'.
  32596. -- Macro: NO_DBX_MAIN_SOURCE_DIRECTORY
  32597. Define this macro, with value 1, if GCC should not emit an
  32598. indication of the current directory for compilation and current
  32599. source language at the beginning of the file.
  32600. -- Macro: NO_DBX_GCC_MARKER
  32601. Define this macro, with value 1, if GCC should not emit an
  32602. indication that this object file was compiled by GCC. The default
  32603. is to emit an 'N_OPT' stab at the beginning of every source file,
  32604. with 'gcc2_compiled.' for the string and value 0.
  32605. -- Macro: DBX_OUTPUT_MAIN_SOURCE_FILE_END (STREAM, NAME)
  32606. A C statement to output DBX debugging information at the end of
  32607. compilation of the main source file NAME. Output should be written
  32608. to the stdio stream STREAM.
  32609. If you don't define this macro, nothing special is output at the
  32610. end of compilation, which is correct for most machines.
  32611. -- Macro: DBX_OUTPUT_NULL_N_SO_AT_MAIN_SOURCE_FILE_END
  32612. Define this macro _instead of_ defining
  32613. 'DBX_OUTPUT_MAIN_SOURCE_FILE_END', if what needs to be output at
  32614. the end of compilation is an 'N_SO' stab with an empty string,
  32615. whose value is the highest absolute text address in the file.
  32616. 
  32617. File: gccint.info, Node: DWARF, Next: VMS Debug, Prev: File Names and DBX, Up: Debugging Info
  32618. 18.21.5 Macros for DWARF Output
  32619. -------------------------------
  32620. Here are macros for DWARF output.
  32621. -- Macro: DWARF2_DEBUGGING_INFO
  32622. Define this macro if GCC should produce dwarf version 2 format
  32623. debugging output in response to the '-g' option.
  32624. -- Target Hook: int TARGET_DWARF_CALLING_CONVENTION (const_tree
  32625. FUNCTION)
  32626. Define this to enable the dwarf attribute
  32627. 'DW_AT_calling_convention' to be emitted for each function.
  32628. Instead of an integer return the enum value for the 'DW_CC_'
  32629. tag.
  32630. To support optional call frame debugging information, you must also
  32631. define 'INCOMING_RETURN_ADDR_RTX' and either set
  32632. 'RTX_FRAME_RELATED_P' on the prologue insns if you use RTL for the
  32633. prologue, or call 'dwarf2out_def_cfa' and 'dwarf2out_reg_save' as
  32634. appropriate from 'TARGET_ASM_FUNCTION_PROLOGUE' if you don't.
  32635. -- Macro: DWARF2_FRAME_INFO
  32636. Define this macro to a nonzero value if GCC should always output
  32637. Dwarf 2 frame information. If 'TARGET_EXCEPT_UNWIND_INFO' (*note
  32638. Exception Region Output::) returns 'UI_DWARF2', and exceptions are
  32639. enabled, GCC will output this information not matter how you define
  32640. 'DWARF2_FRAME_INFO'.
  32641. -- Target Hook: enum unwind_info_type TARGET_DEBUG_UNWIND_INFO (void)
  32642. This hook defines the mechanism that will be used for describing
  32643. frame unwind information to the debugger. Normally the hook will
  32644. return 'UI_DWARF2' if DWARF 2 debug information is enabled, and
  32645. return 'UI_NONE' otherwise.
  32646. A target may return 'UI_DWARF2' even when DWARF 2 debug information
  32647. is disabled in order to always output DWARF 2 frame information.
  32648. A target may return 'UI_TARGET' if it has ABI specified unwind
  32649. tables. This will suppress generation of the normal debug frame
  32650. unwind information.
  32651. -- Macro: DWARF2_ASM_LINE_DEBUG_INFO
  32652. Define this macro to be a nonzero value if the assembler can
  32653. generate Dwarf 2 line debug info sections. This will result in
  32654. much more compact line number tables, and hence is desirable if it
  32655. works.
  32656. -- Macro: DWARF2_ASM_VIEW_DEBUG_INFO
  32657. Define this macro to be a nonzero value if the assembler supports
  32658. view assignment and verification in '.loc'. If it does not, but
  32659. the user enables location views, the compiler may have to fallback
  32660. to internal line number tables.
  32661. -- Target Hook: int TARGET_RESET_LOCATION_VIEW (rtx_insn *)
  32662. This hook, if defined, enables -ginternal-reset-location-views, and
  32663. uses its result to override cases in which the estimated min insn
  32664. length might be nonzero even when a PC advance (i.e., a view reset)
  32665. cannot be taken for granted.
  32666. If the hook is defined, it must return a positive value to indicate
  32667. the insn definitely advances the PC, and so the view number can be
  32668. safely assumed to be reset; a negative value to mean the insn
  32669. definitely does not advance the PC, and os the view number must not
  32670. be reset; or zero to decide based on the estimated insn length.
  32671. If insn length is to be regarded as reliable, set the hook to
  32672. 'hook_int_rtx_insn_0'.
  32673. -- Target Hook: bool TARGET_WANT_DEBUG_PUB_SECTIONS
  32674. True if the '.debug_pubtypes' and '.debug_pubnames' sections should
  32675. be emitted. These sections are not used on most platforms, and in
  32676. particular GDB does not use them.
  32677. -- Target Hook: bool TARGET_DELAY_SCHED2
  32678. True if sched2 is not to be run at its normal place. This usually
  32679. means it will be run as part of machine-specific reorg.
  32680. -- Target Hook: bool TARGET_DELAY_VARTRACK
  32681. True if vartrack is not to be run at its normal place. This
  32682. usually means it will be run as part of machine-specific reorg.
  32683. -- Target Hook: bool TARGET_NO_REGISTER_ALLOCATION
  32684. True if register allocation and the passes following it should not
  32685. be run. Usually true only for virtual assembler targets.
  32686. -- Macro: ASM_OUTPUT_DWARF_DELTA (STREAM, SIZE, LABEL1, LABEL2)
  32687. A C statement to issue assembly directives that create a difference
  32688. LAB1 minus LAB2, using an integer of the given SIZE.
  32689. -- Macro: ASM_OUTPUT_DWARF_VMS_DELTA (STREAM, SIZE, LABEL1, LABEL2)
  32690. A C statement to issue assembly directives that create a difference
  32691. between the two given labels in system defined units, e.g.
  32692. instruction slots on IA64 VMS, using an integer of the given size.
  32693. -- Macro: ASM_OUTPUT_DWARF_OFFSET (STREAM, SIZE, LABEL, OFFSET,
  32694. SECTION)
  32695. A C statement to issue assembly directives that create a
  32696. section-relative reference to the given LABEL plus OFFSET, using an
  32697. integer of the given SIZE. The label is known to be defined in the
  32698. given SECTION.
  32699. -- Macro: ASM_OUTPUT_DWARF_PCREL (STREAM, SIZE, LABEL)
  32700. A C statement to issue assembly directives that create a
  32701. self-relative reference to the given LABEL, using an integer of the
  32702. given SIZE.
  32703. -- Macro: ASM_OUTPUT_DWARF_DATAREL (STREAM, SIZE, LABEL)
  32704. A C statement to issue assembly directives that create a reference
  32705. to the given LABEL relative to the dbase, using an integer of the
  32706. given SIZE.
  32707. -- Macro: ASM_OUTPUT_DWARF_TABLE_REF (LABEL)
  32708. A C statement to issue assembly directives that create a reference
  32709. to the DWARF table identifier LABEL from the current section. This
  32710. is used on some systems to avoid garbage collecting a DWARF table
  32711. which is referenced by a function.
  32712. -- Target Hook: void TARGET_ASM_OUTPUT_DWARF_DTPREL (FILE *FILE, int
  32713. SIZE, rtx X)
  32714. If defined, this target hook is a function which outputs a
  32715. DTP-relative reference to the given TLS symbol of the specified
  32716. size.
  32717. 
  32718. File: gccint.info, Node: VMS Debug, Prev: DWARF, Up: Debugging Info
  32719. 18.21.6 Macros for VMS Debug Format
  32720. -----------------------------------
  32721. Here are macros for VMS debug format.
  32722. -- Macro: VMS_DEBUGGING_INFO
  32723. Define this macro if GCC should produce debugging output for VMS in
  32724. response to the '-g' option. The default behavior for VMS is to
  32725. generate minimal debug info for a traceback in the absence of '-g'
  32726. unless explicitly overridden with '-g0'. This behavior is
  32727. controlled by 'TARGET_OPTION_OPTIMIZATION' and
  32728. 'TARGET_OPTION_OVERRIDE'.
  32729. 
  32730. File: gccint.info, Node: Floating Point, Next: Mode Switching, Prev: Debugging Info, Up: Target Macros
  32731. 18.22 Cross Compilation and Floating Point
  32732. ==========================================
  32733. While all modern machines use twos-complement representation for
  32734. integers, there are a variety of representations for floating point
  32735. numbers. This means that in a cross-compiler the representation of
  32736. floating point numbers in the compiled program may be different from
  32737. that used in the machine doing the compilation.
  32738. Because different representation systems may offer different amounts of
  32739. range and precision, all floating point constants must be represented in
  32740. the target machine's format. Therefore, the cross compiler cannot
  32741. safely use the host machine's floating point arithmetic; it must emulate
  32742. the target's arithmetic. To ensure consistency, GCC always uses
  32743. emulation to work with floating point values, even when the host and
  32744. target floating point formats are identical.
  32745. The following macros are provided by 'real.h' for the compiler to use.
  32746. All parts of the compiler which generate or optimize floating-point
  32747. calculations must use these macros. They may evaluate their operands
  32748. more than once, so operands must not have side effects.
  32749. -- Macro: REAL_VALUE_TYPE
  32750. The C data type to be used to hold a floating point value in the
  32751. target machine's format. Typically this is a 'struct' containing
  32752. an array of 'HOST_WIDE_INT', but all code should treat it as an
  32753. opaque quantity.
  32754. -- Macro: HOST_WIDE_INT REAL_VALUE_FIX (REAL_VALUE_TYPE X)
  32755. Truncates X to a signed integer, rounding toward zero.
  32756. -- Macro: unsigned HOST_WIDE_INT REAL_VALUE_UNSIGNED_FIX
  32757. (REAL_VALUE_TYPE X)
  32758. Truncates X to an unsigned integer, rounding toward zero. If X is
  32759. negative, returns zero.
  32760. -- Macro: REAL_VALUE_TYPE REAL_VALUE_ATOF (const char *STRING,
  32761. machine_mode MODE)
  32762. Converts STRING into a floating point number in the target
  32763. machine's representation for mode MODE. This routine can handle
  32764. both decimal and hexadecimal floating point constants, using the
  32765. syntax defined by the C language for both.
  32766. -- Macro: int REAL_VALUE_NEGATIVE (REAL_VALUE_TYPE X)
  32767. Returns 1 if X is negative (including negative zero), 0 otherwise.
  32768. -- Macro: int REAL_VALUE_ISINF (REAL_VALUE_TYPE X)
  32769. Determines whether X represents infinity (positive or negative).
  32770. -- Macro: int REAL_VALUE_ISNAN (REAL_VALUE_TYPE X)
  32771. Determines whether X represents a "NaN" (not-a-number).
  32772. -- Macro: REAL_VALUE_TYPE REAL_VALUE_NEGATE (REAL_VALUE_TYPE X)
  32773. Returns the negative of the floating point value X.
  32774. -- Macro: REAL_VALUE_TYPE REAL_VALUE_ABS (REAL_VALUE_TYPE X)
  32775. Returns the absolute value of X.
  32776. 
  32777. File: gccint.info, Node: Mode Switching, Next: Target Attributes, Prev: Floating Point, Up: Target Macros
  32778. 18.23 Mode Switching Instructions
  32779. =================================
  32780. The following macros control mode switching optimizations:
  32781. -- Macro: OPTIMIZE_MODE_SWITCHING (ENTITY)
  32782. Define this macro if the port needs extra instructions inserted for
  32783. mode switching in an optimizing compilation.
  32784. For an example, the SH4 can perform both single and double
  32785. precision floating point operations, but to perform a single
  32786. precision operation, the FPSCR PR bit has to be cleared, while for
  32787. a double precision operation, this bit has to be set. Changing the
  32788. PR bit requires a general purpose register as a scratch register,
  32789. hence these FPSCR sets have to be inserted before reload, i.e. you
  32790. cannot put this into instruction emitting or
  32791. 'TARGET_MACHINE_DEPENDENT_REORG'.
  32792. You can have multiple entities that are mode-switched, and select
  32793. at run time which entities actually need it.
  32794. 'OPTIMIZE_MODE_SWITCHING' should return nonzero for any ENTITY that
  32795. needs mode-switching. If you define this macro, you also have to
  32796. define 'NUM_MODES_FOR_MODE_SWITCHING', 'TARGET_MODE_NEEDED',
  32797. 'TARGET_MODE_PRIORITY' and 'TARGET_MODE_EMIT'.
  32798. 'TARGET_MODE_AFTER', 'TARGET_MODE_ENTRY', and 'TARGET_MODE_EXIT'
  32799. are optional.
  32800. -- Macro: NUM_MODES_FOR_MODE_SWITCHING
  32801. If you define 'OPTIMIZE_MODE_SWITCHING', you have to define this as
  32802. initializer for an array of integers. Each initializer element N
  32803. refers to an entity that needs mode switching, and specifies the
  32804. number of different modes that might need to be set for this
  32805. entity. The position of the initializer in the
  32806. initializer--starting counting at zero--determines the integer that
  32807. is used to refer to the mode-switched entity in question. In
  32808. macros that take mode arguments / yield a mode result, modes are
  32809. represented as numbers 0 ... N - 1. N is used to specify that no
  32810. mode switch is needed / supplied.
  32811. -- Target Hook: void TARGET_MODE_EMIT (int ENTITY, int MODE, int
  32812. PREV_MODE, HARD_REG_SET REGS_LIVE)
  32813. Generate one or more insns to set ENTITY to MODE. HARD_REG_LIVE is
  32814. the set of hard registers live at the point where the insn(s) are
  32815. to be inserted. PREV_MOXDE indicates the mode to switch from.
  32816. Sets of a lower numbered entity will be emitted before sets of a
  32817. higher numbered entity to a mode of the same or lower priority.
  32818. -- Target Hook: int TARGET_MODE_NEEDED (int ENTITY, rtx_insn *INSN)
  32819. ENTITY is an integer specifying a mode-switched entity. If
  32820. 'OPTIMIZE_MODE_SWITCHING' is defined, you must define this macro to
  32821. return an integer value not larger than the corresponding element
  32822. in 'NUM_MODES_FOR_MODE_SWITCHING', to denote the mode that ENTITY
  32823. must be switched into prior to the execution of INSN.
  32824. -- Target Hook: int TARGET_MODE_AFTER (int ENTITY, int MODE, rtx_insn
  32825. *INSN)
  32826. ENTITY is an integer specifying a mode-switched entity. If this
  32827. macro is defined, it is evaluated for every INSN during mode
  32828. switching. It determines the mode that an insn results in (if
  32829. different from the incoming mode).
  32830. -- Target Hook: int TARGET_MODE_ENTRY (int ENTITY)
  32831. If this macro is defined, it is evaluated for every ENTITY that
  32832. needs mode switching. It should evaluate to an integer, which is a
  32833. mode that ENTITY is assumed to be switched to at function entry.
  32834. If 'TARGET_MODE_ENTRY' is defined then 'TARGET_MODE_EXIT' must be
  32835. defined.
  32836. -- Target Hook: int TARGET_MODE_EXIT (int ENTITY)
  32837. If this macro is defined, it is evaluated for every ENTITY that
  32838. needs mode switching. It should evaluate to an integer, which is a
  32839. mode that ENTITY is assumed to be switched to at function exit. If
  32840. 'TARGET_MODE_EXIT' is defined then 'TARGET_MODE_ENTRY' must be
  32841. defined.
  32842. -- Target Hook: int TARGET_MODE_PRIORITY (int ENTITY, int N)
  32843. This macro specifies the order in which modes for ENTITY are
  32844. processed. 0 is the highest priority,
  32845. 'NUM_MODES_FOR_MODE_SWITCHING[ENTITY] - 1' the lowest. The value
  32846. of the macro should be an integer designating a mode for ENTITY.
  32847. For any fixed ENTITY, 'mode_priority' (ENTITY, N) shall be a
  32848. bijection in 0 ... 'num_modes_for_mode_switching[ENTITY] - 1'.
  32849. 
  32850. File: gccint.info, Node: Target Attributes, Next: Emulated TLS, Prev: Mode Switching, Up: Target Macros
  32851. 18.24 Defining target-specific uses of '__attribute__'
  32852. ======================================================
  32853. Target-specific attributes may be defined for functions, data and types.
  32854. These are described using the following target hooks; they also need to
  32855. be documented in 'extend.texi'.
  32856. -- Target Hook: const struct attribute_spec * TARGET_ATTRIBUTE_TABLE
  32857. If defined, this target hook points to an array of 'struct
  32858. attribute_spec' (defined in 'tree-core.h') specifying the machine
  32859. specific attributes for this target and some of the restrictions on
  32860. the entities to which these attributes are applied and the
  32861. arguments they take.
  32862. -- Target Hook: bool TARGET_ATTRIBUTE_TAKES_IDENTIFIER_P (const_tree
  32863. NAME)
  32864. If defined, this target hook is a function which returns true if
  32865. the machine-specific attribute named NAME expects an identifier
  32866. given as its first argument to be passed on as a plain identifier,
  32867. not subjected to name lookup. If this is not defined, the default
  32868. is false for all machine-specific attributes.
  32869. -- Target Hook: int TARGET_COMP_TYPE_ATTRIBUTES (const_tree TYPE1,
  32870. const_tree TYPE2)
  32871. If defined, this target hook is a function which returns zero if
  32872. the attributes on TYPE1 and TYPE2 are incompatible, one if they are
  32873. compatible, and two if they are nearly compatible (which causes a
  32874. warning to be generated). If this is not defined, machine-specific
  32875. attributes are supposed always to be compatible.
  32876. -- Target Hook: void TARGET_SET_DEFAULT_TYPE_ATTRIBUTES (tree TYPE)
  32877. If defined, this target hook is a function which assigns default
  32878. attributes to the newly defined TYPE.
  32879. -- Target Hook: tree TARGET_MERGE_TYPE_ATTRIBUTES (tree TYPE1, tree
  32880. TYPE2)
  32881. Define this target hook if the merging of type attributes needs
  32882. special handling. If defined, the result is a list of the combined
  32883. 'TYPE_ATTRIBUTES' of TYPE1 and TYPE2. It is assumed that
  32884. 'comptypes' has already been called and returned 1. This function
  32885. may call 'merge_attributes' to handle machine-independent merging.
  32886. -- Target Hook: tree TARGET_MERGE_DECL_ATTRIBUTES (tree OLDDECL, tree
  32887. NEWDECL)
  32888. Define this target hook if the merging of decl attributes needs
  32889. special handling. If defined, the result is a list of the combined
  32890. 'DECL_ATTRIBUTES' of OLDDECL and NEWDECL. NEWDECL is a duplicate
  32891. declaration of OLDDECL. Examples of when this is needed are when
  32892. one attribute overrides another, or when an attribute is nullified
  32893. by a subsequent definition. This function may call
  32894. 'merge_attributes' to handle machine-independent merging.
  32895. If the only target-specific handling you require is 'dllimport' for
  32896. Microsoft Windows targets, you should define the macro
  32897. 'TARGET_DLLIMPORT_DECL_ATTRIBUTES' to '1'. The compiler will then
  32898. define a function called 'merge_dllimport_decl_attributes' which
  32899. can then be defined as the expansion of
  32900. 'TARGET_MERGE_DECL_ATTRIBUTES'. You can also add
  32901. 'handle_dll_attribute' in the attribute table for your port to
  32902. perform initial processing of the 'dllimport' and 'dllexport'
  32903. attributes. This is done in 'i386/cygwin.h' and 'i386/i386.c', for
  32904. example.
  32905. -- Target Hook: bool TARGET_VALID_DLLIMPORT_ATTRIBUTE_P (const_tree
  32906. DECL)
  32907. DECL is a variable or function with '__attribute__((dllimport))'
  32908. specified. Use this hook if the target needs to add extra
  32909. validation checks to 'handle_dll_attribute'.
  32910. -- Macro: TARGET_DECLSPEC
  32911. Define this macro to a nonzero value if you want to treat
  32912. '__declspec(X)' as equivalent to '__attribute((X))'. By default,
  32913. this behavior is enabled only for targets that define
  32914. 'TARGET_DLLIMPORT_DECL_ATTRIBUTES'. The current implementation of
  32915. '__declspec' is via a built-in macro, but you should not rely on
  32916. this implementation detail.
  32917. -- Target Hook: void TARGET_INSERT_ATTRIBUTES (tree NODE, tree
  32918. *ATTR_PTR)
  32919. Define this target hook if you want to be able to add attributes to
  32920. a decl when it is being created. This is normally useful for back
  32921. ends which wish to implement a pragma by using the attributes which
  32922. correspond to the pragma's effect. The NODE argument is the decl
  32923. which is being created. The ATTR_PTR argument is a pointer to the
  32924. attribute list for this decl. The list itself should not be
  32925. modified, since it may be shared with other decls, but attributes
  32926. may be chained on the head of the list and '*ATTR_PTR' modified to
  32927. point to the new attributes, or a copy of the list may be made if
  32928. further changes are needed.
  32929. -- Target Hook: tree TARGET_HANDLE_GENERIC_ATTRIBUTE (tree *NODE, tree
  32930. NAME, tree ARGS, int FLAGS, bool *NO_ADD_ATTRS)
  32931. Define this target hook if you want to be able to perform
  32932. additional target-specific processing of an attribute which is
  32933. handled generically by a front end. The arguments are the same as
  32934. those which are passed to attribute handlers. So far this only
  32935. affects the NOINIT and SECTION attribute.
  32936. -- Target Hook: bool TARGET_FUNCTION_ATTRIBUTE_INLINABLE_P (const_tree
  32937. FNDECL)
  32938. This target hook returns 'true' if it is OK to inline FNDECL into
  32939. the current function, despite its having target-specific
  32940. attributes, 'false' otherwise. By default, if a function has a
  32941. target specific attribute attached to it, it will not be inlined.
  32942. -- Target Hook: bool TARGET_OPTION_VALID_ATTRIBUTE_P (tree FNDECL, tree
  32943. NAME, tree ARGS, int FLAGS)
  32944. This hook is called to parse 'attribute(target("..."))', which
  32945. allows setting target-specific options on individual functions.
  32946. These function-specific options may differ from the options
  32947. specified on the command line. The hook should return 'true' if
  32948. the options are valid.
  32949. The hook should set the 'DECL_FUNCTION_SPECIFIC_TARGET' field in
  32950. the function declaration to hold a pointer to a target-specific
  32951. 'struct cl_target_option' structure.
  32952. -- Target Hook: void TARGET_OPTION_SAVE (struct cl_target_option *PTR,
  32953. struct gcc_options *OPTS)
  32954. This hook is called to save any additional target-specific
  32955. information in the 'struct cl_target_option' structure for
  32956. function-specific options from the 'struct gcc_options' structure.
  32957. *Note Option file format::.
  32958. -- Target Hook: void TARGET_OPTION_RESTORE (struct gcc_options *OPTS,
  32959. struct cl_target_option *PTR)
  32960. This hook is called to restore any additional target-specific
  32961. information in the 'struct cl_target_option' structure for
  32962. function-specific options to the 'struct gcc_options' structure.
  32963. -- Target Hook: void TARGET_OPTION_POST_STREAM_IN (struct
  32964. cl_target_option *PTR)
  32965. This hook is called to update target-specific information in the
  32966. 'struct cl_target_option' structure after it is streamed in from
  32967. LTO bytecode.
  32968. -- Target Hook: void TARGET_OPTION_PRINT (FILE *FILE, int INDENT,
  32969. struct cl_target_option *PTR)
  32970. This hook is called to print any additional target-specific
  32971. information in the 'struct cl_target_option' structure for
  32972. function-specific options.
  32973. -- Target Hook: bool TARGET_OPTION_PRAGMA_PARSE (tree ARGS, tree
  32974. POP_TARGET)
  32975. This target hook parses the options for '#pragma GCC target', which
  32976. sets the target-specific options for functions that occur later in
  32977. the input stream. The options accepted should be the same as those
  32978. handled by the 'TARGET_OPTION_VALID_ATTRIBUTE_P' hook.
  32979. -- Target Hook: void TARGET_OPTION_OVERRIDE (void)
  32980. Sometimes certain combinations of command options do not make sense
  32981. on a particular target machine. You can override the hook
  32982. 'TARGET_OPTION_OVERRIDE' to take account of this. This hooks is
  32983. called once just after all the command options have been parsed.
  32984. Don't use this hook to turn on various extra optimizations for
  32985. '-O'. That is what 'TARGET_OPTION_OPTIMIZATION' is for.
  32986. If you need to do something whenever the optimization level is
  32987. changed via the optimize attribute or pragma, see
  32988. 'TARGET_OVERRIDE_OPTIONS_AFTER_CHANGE'
  32989. -- Target Hook: bool TARGET_OPTION_FUNCTION_VERSIONS (tree DECL1, tree
  32990. DECL2)
  32991. This target hook returns 'true' if DECL1 and DECL2 are versions of
  32992. the same function. DECL1 and DECL2 are function versions if and
  32993. only if they have the same function signature and different target
  32994. specific attributes, that is, they are compiled for different
  32995. target machines.
  32996. -- Target Hook: bool TARGET_CAN_INLINE_P (tree CALLER, tree CALLEE)
  32997. This target hook returns 'false' if the CALLER function cannot
  32998. inline CALLEE, based on target specific information. By default,
  32999. inlining is not allowed if the callee function has function
  33000. specific target options and the caller does not use the same
  33001. options.
  33002. -- Target Hook: void TARGET_RELAYOUT_FUNCTION (tree FNDECL)
  33003. This target hook fixes function FNDECL after attributes are
  33004. processed. Default does nothing. On ARM, the default function's
  33005. alignment is updated with the attribute target.
  33006. 
  33007. File: gccint.info, Node: Emulated TLS, Next: MIPS Coprocessors, Prev: Target Attributes, Up: Target Macros
  33008. 18.25 Emulating TLS
  33009. ===================
  33010. For targets whose psABI does not provide Thread Local Storage via
  33011. specific relocations and instruction sequences, an emulation layer is
  33012. used. A set of target hooks allows this emulation layer to be
  33013. configured for the requirements of a particular target. For instance
  33014. the psABI may in fact specify TLS support in terms of an emulation
  33015. layer.
  33016. The emulation layer works by creating a control object for every TLS
  33017. object. To access the TLS object, a lookup function is provided which,
  33018. when given the address of the control object, will return the address of
  33019. the current thread's instance of the TLS object.
  33020. -- Target Hook: const char * TARGET_EMUTLS_GET_ADDRESS
  33021. Contains the name of the helper function that uses a TLS control
  33022. object to locate a TLS instance. The default causes libgcc's
  33023. emulated TLS helper function to be used.
  33024. -- Target Hook: const char * TARGET_EMUTLS_REGISTER_COMMON
  33025. Contains the name of the helper function that should be used at
  33026. program startup to register TLS objects that are implicitly
  33027. initialized to zero. If this is 'NULL', all TLS objects will have
  33028. explicit initializers. The default causes libgcc's emulated TLS
  33029. registration function to be used.
  33030. -- Target Hook: const char * TARGET_EMUTLS_VAR_SECTION
  33031. Contains the name of the section in which TLS control variables
  33032. should be placed. The default of 'NULL' allows these to be placed
  33033. in any section.
  33034. -- Target Hook: const char * TARGET_EMUTLS_TMPL_SECTION
  33035. Contains the name of the section in which TLS initializers should
  33036. be placed. The default of 'NULL' allows these to be placed in any
  33037. section.
  33038. -- Target Hook: const char * TARGET_EMUTLS_VAR_PREFIX
  33039. Contains the prefix to be prepended to TLS control variable names.
  33040. The default of 'NULL' uses a target-specific prefix.
  33041. -- Target Hook: const char * TARGET_EMUTLS_TMPL_PREFIX
  33042. Contains the prefix to be prepended to TLS initializer objects.
  33043. The default of 'NULL' uses a target-specific prefix.
  33044. -- Target Hook: tree TARGET_EMUTLS_VAR_FIELDS (tree TYPE, tree *NAME)
  33045. Specifies a function that generates the FIELD_DECLs for a TLS
  33046. control object type. TYPE is the RECORD_TYPE the fields are for
  33047. and NAME should be filled with the structure tag, if the default of
  33048. '__emutls_object' is unsuitable. The default creates a type
  33049. suitable for libgcc's emulated TLS function.
  33050. -- Target Hook: tree TARGET_EMUTLS_VAR_INIT (tree VAR, tree DECL, tree
  33051. TMPL_ADDR)
  33052. Specifies a function that generates the CONSTRUCTOR to initialize a
  33053. TLS control object. VAR is the TLS control object, DECL is the TLS
  33054. object and TMPL_ADDR is the address of the initializer. The
  33055. default initializes libgcc's emulated TLS control object.
  33056. -- Target Hook: bool TARGET_EMUTLS_VAR_ALIGN_FIXED
  33057. Specifies whether the alignment of TLS control variable objects is
  33058. fixed and should not be increased as some backends may do to
  33059. optimize single objects. The default is false.
  33060. -- Target Hook: bool TARGET_EMUTLS_DEBUG_FORM_TLS_ADDRESS
  33061. Specifies whether a DWARF 'DW_OP_form_tls_address' location
  33062. descriptor may be used to describe emulated TLS control objects.
  33063. 
  33064. File: gccint.info, Node: MIPS Coprocessors, Next: PCH Target, Prev: Emulated TLS, Up: Target Macros
  33065. 18.26 Defining coprocessor specifics for MIPS targets.
  33066. ======================================================
  33067. The MIPS specification allows MIPS implementations to have as many as 4
  33068. coprocessors, each with as many as 32 private registers. GCC supports
  33069. accessing these registers and transferring values between the registers
  33070. and memory using asm-ized variables. For example:
  33071. register unsigned int cp0count asm ("c0r1");
  33072. unsigned int d;
  33073. d = cp0count + 3;
  33074. ("c0r1" is the default name of register 1 in coprocessor 0; alternate
  33075. names may be added as described below, or the default names may be
  33076. overridden entirely in 'SUBTARGET_CONDITIONAL_REGISTER_USAGE'.)
  33077. Coprocessor registers are assumed to be epilogue-used; sets to them
  33078. will be preserved even if it does not appear that the register is used
  33079. again later in the function.
  33080. Another note: according to the MIPS spec, coprocessor 1 (if present) is
  33081. the FPU. One accesses COP1 registers through standard mips
  33082. floating-point support; they are not included in this mechanism.
  33083. 
  33084. File: gccint.info, Node: PCH Target, Next: C++ ABI, Prev: MIPS Coprocessors, Up: Target Macros
  33085. 18.27 Parameters for Precompiled Header Validity Checking
  33086. =========================================================
  33087. -- Target Hook: void * TARGET_GET_PCH_VALIDITY (size_t *SZ)
  33088. This hook returns a pointer to the data needed by
  33089. 'TARGET_PCH_VALID_P' and sets '*SZ' to the size of the data in
  33090. bytes.
  33091. -- Target Hook: const char * TARGET_PCH_VALID_P (const void *DATA,
  33092. size_t SZ)
  33093. This hook checks whether the options used to create a PCH file are
  33094. compatible with the current settings. It returns 'NULL' if so and
  33095. a suitable error message if not. Error messages will be presented
  33096. to the user and must be localized using '_(MSG)'.
  33097. DATA is the data that was returned by 'TARGET_GET_PCH_VALIDITY'
  33098. when the PCH file was created and SZ is the size of that data in
  33099. bytes. It's safe to assume that the data was created by the same
  33100. version of the compiler, so no format checking is needed.
  33101. The default definition of 'default_pch_valid_p' should be suitable
  33102. for most targets.
  33103. -- Target Hook: const char * TARGET_CHECK_PCH_TARGET_FLAGS (int
  33104. PCH_FLAGS)
  33105. If this hook is nonnull, the default implementation of
  33106. 'TARGET_PCH_VALID_P' will use it to check for compatible values of
  33107. 'target_flags'. PCH_FLAGS specifies the value that 'target_flags'
  33108. had when the PCH file was created. The return value is the same as
  33109. for 'TARGET_PCH_VALID_P'.
  33110. -- Target Hook: void TARGET_PREPARE_PCH_SAVE (void)
  33111. Called before writing out a PCH file. If the target has some
  33112. garbage-collected data that needs to be in a particular state on
  33113. PCH loads, it can use this hook to enforce that state. Very few
  33114. targets need to do anything here.
  33115. 
  33116. File: gccint.info, Node: C++ ABI, Next: D Language and ABI, Prev: PCH Target, Up: Target Macros
  33117. 18.28 C++ ABI parameters
  33118. ========================
  33119. -- Target Hook: tree TARGET_CXX_GUARD_TYPE (void)
  33120. Define this hook to override the integer type used for guard
  33121. variables. These are used to implement one-time construction of
  33122. static objects. The default is long_long_integer_type_node.
  33123. -- Target Hook: bool TARGET_CXX_GUARD_MASK_BIT (void)
  33124. This hook determines how guard variables are used. It should
  33125. return 'false' (the default) if the first byte should be used. A
  33126. return value of 'true' indicates that only the least significant
  33127. bit should be used.
  33128. -- Target Hook: tree TARGET_CXX_GET_COOKIE_SIZE (tree TYPE)
  33129. This hook returns the size of the cookie to use when allocating an
  33130. array whose elements have the indicated TYPE. Assumes that it is
  33131. already known that a cookie is needed. The default is 'max(sizeof
  33132. (size_t), alignof(type))', as defined in section 2.7 of the
  33133. IA64/Generic C++ ABI.
  33134. -- Target Hook: bool TARGET_CXX_COOKIE_HAS_SIZE (void)
  33135. This hook should return 'true' if the element size should be stored
  33136. in array cookies. The default is to return 'false'.
  33137. -- Target Hook: int TARGET_CXX_IMPORT_EXPORT_CLASS (tree TYPE, int
  33138. IMPORT_EXPORT)
  33139. If defined by a backend this hook allows the decision made to
  33140. export class TYPE to be overruled. Upon entry IMPORT_EXPORT will
  33141. contain 1 if the class is going to be exported, -1 if it is going
  33142. to be imported and 0 otherwise. This function should return the
  33143. modified value and perform any other actions necessary to support
  33144. the backend's targeted operating system.
  33145. -- Target Hook: bool TARGET_CXX_CDTOR_RETURNS_THIS (void)
  33146. This hook should return 'true' if constructors and destructors
  33147. return the address of the object created/destroyed. The default is
  33148. to return 'false'.
  33149. -- Target Hook: bool TARGET_CXX_KEY_METHOD_MAY_BE_INLINE (void)
  33150. This hook returns true if the key method for a class (i.e., the
  33151. method which, if defined in the current translation unit, causes
  33152. the virtual table to be emitted) may be an inline function. Under
  33153. the standard Itanium C++ ABI the key method may be an inline
  33154. function so long as the function is not declared inline in the
  33155. class definition. Under some variants of the ABI, an inline
  33156. function can never be the key method. The default is to return
  33157. 'true'.
  33158. -- Target Hook: void TARGET_CXX_DETERMINE_CLASS_DATA_VISIBILITY (tree
  33159. DECL)
  33160. DECL is a virtual table, virtual table table, typeinfo object, or
  33161. other similar implicit class data object that will be emitted with
  33162. external linkage in this translation unit. No ELF visibility has
  33163. been explicitly specified. If the target needs to specify a
  33164. visibility other than that of the containing class, use this hook
  33165. to set 'DECL_VISIBILITY' and 'DECL_VISIBILITY_SPECIFIED'.
  33166. -- Target Hook: bool TARGET_CXX_CLASS_DATA_ALWAYS_COMDAT (void)
  33167. This hook returns true (the default) if virtual tables and other
  33168. similar implicit class data objects are always COMDAT if they have
  33169. external linkage. If this hook returns false, then class data for
  33170. classes whose virtual table will be emitted in only one translation
  33171. unit will not be COMDAT.
  33172. -- Target Hook: bool TARGET_CXX_LIBRARY_RTTI_COMDAT (void)
  33173. This hook returns true (the default) if the RTTI information for
  33174. the basic types which is defined in the C++ runtime should always
  33175. be COMDAT, false if it should not be COMDAT.
  33176. -- Target Hook: bool TARGET_CXX_USE_AEABI_ATEXIT (void)
  33177. This hook returns true if '__aeabi_atexit' (as defined by the ARM
  33178. EABI) should be used to register static destructors when
  33179. '-fuse-cxa-atexit' is in effect. The default is to return false to
  33180. use '__cxa_atexit'.
  33181. -- Target Hook: bool TARGET_CXX_USE_ATEXIT_FOR_CXA_ATEXIT (void)
  33182. This hook returns true if the target 'atexit' function can be used
  33183. in the same manner as '__cxa_atexit' to register C++ static
  33184. destructors. This requires that 'atexit'-registered functions in
  33185. shared libraries are run in the correct order when the libraries
  33186. are unloaded. The default is to return false.
  33187. -- Target Hook: void TARGET_CXX_ADJUST_CLASS_AT_DEFINITION (tree TYPE)
  33188. TYPE is a C++ class (i.e., RECORD_TYPE or UNION_TYPE) that has just
  33189. been defined. Use this hook to make adjustments to the class (eg,
  33190. tweak visibility or perform any other required target
  33191. modifications).
  33192. -- Target Hook: tree TARGET_CXX_DECL_MANGLING_CONTEXT (const_tree DECL)
  33193. Return target-specific mangling context of DECL or 'NULL_TREE'.
  33194. 
  33195. File: gccint.info, Node: D Language and ABI, Next: Named Address Spaces, Prev: C++ ABI, Up: Target Macros
  33196. 18.29 D ABI parameters
  33197. ======================
  33198. -- D Target Hook: void TARGET_D_CPU_VERSIONS (void)
  33199. Declare all environmental version identifiers relating to the
  33200. target CPU using the function 'builtin_version', which takes a
  33201. string representing the name of the version. Version identifiers
  33202. predefined by this hook apply to all modules that are being
  33203. compiled and imported.
  33204. -- D Target Hook: void TARGET_D_OS_VERSIONS (void)
  33205. Similarly to 'TARGET_D_CPU_VERSIONS', but is used for versions
  33206. relating to the target operating system.
  33207. -- D Target Hook: unsigned TARGET_D_CRITSEC_SIZE (void)
  33208. Returns the size of the data structure used by the target operating
  33209. system for critical sections and monitors. For example, on
  33210. Microsoft Windows this would return the 'sizeof(CRITICAL_SECTION)',
  33211. while other platforms that implement pthreads would return
  33212. 'sizeof(pthread_mutex_t)'.
  33213. 
  33214. File: gccint.info, Node: Named Address Spaces, Next: Misc, Prev: D Language and ABI, Up: Target Macros
  33215. 18.30 Adding support for named address spaces
  33216. =============================================
  33217. The draft technical report of the ISO/IEC JTC1 S22 WG14 N1275 standards
  33218. committee, 'Programming Languages - C - Extensions to support embedded
  33219. processors', specifies a syntax for embedded processors to specify
  33220. alternate address spaces. You can configure a GCC port to support
  33221. section 5.1 of the draft report to add support for address spaces other
  33222. than the default address space. These address spaces are new keywords
  33223. that are similar to the 'volatile' and 'const' type attributes.
  33224. Pointers to named address spaces can have a different size than
  33225. pointers to the generic address space.
  33226. For example, the SPU port uses the '__ea' address space to refer to
  33227. memory in the host processor, rather than memory local to the SPU
  33228. processor. Access to memory in the '__ea' address space involves
  33229. issuing DMA operations to move data between the host processor and the
  33230. local processor memory address space. Pointers in the '__ea' address
  33231. space are either 32 bits or 64 bits based on the '-mea32' or '-mea64'
  33232. switches (native SPU pointers are always 32 bits).
  33233. Internally, address spaces are represented as a small integer in the
  33234. range 0 to 15 with address space 0 being reserved for the generic
  33235. address space.
  33236. To register a named address space qualifier keyword with the C front
  33237. end, the target may call the 'c_register_addr_space' routine. For
  33238. example, the SPU port uses the following to declare '__ea' as the
  33239. keyword for named address space #1:
  33240. #define ADDR_SPACE_EA 1
  33241. c_register_addr_space ("__ea", ADDR_SPACE_EA);
  33242. -- Target Hook: scalar_int_mode TARGET_ADDR_SPACE_POINTER_MODE
  33243. (addr_space_t ADDRESS_SPACE)
  33244. Define this to return the machine mode to use for pointers to
  33245. ADDRESS_SPACE if the target supports named address spaces. The
  33246. default version of this hook returns 'ptr_mode'.
  33247. -- Target Hook: scalar_int_mode TARGET_ADDR_SPACE_ADDRESS_MODE
  33248. (addr_space_t ADDRESS_SPACE)
  33249. Define this to return the machine mode to use for addresses in
  33250. ADDRESS_SPACE if the target supports named address spaces. The
  33251. default version of this hook returns 'Pmode'.
  33252. -- Target Hook: bool TARGET_ADDR_SPACE_VALID_POINTER_MODE
  33253. (scalar_int_mode MODE, addr_space_t AS)
  33254. Define this to return nonzero if the port can handle pointers with
  33255. machine mode MODE to address space AS. This target hook is the
  33256. same as the 'TARGET_VALID_POINTER_MODE' target hook, except that it
  33257. includes explicit named address space support. The default version
  33258. of this hook returns true for the modes returned by either the
  33259. 'TARGET_ADDR_SPACE_POINTER_MODE' or
  33260. 'TARGET_ADDR_SPACE_ADDRESS_MODE' target hooks for the given address
  33261. space.
  33262. -- Target Hook: bool TARGET_ADDR_SPACE_LEGITIMATE_ADDRESS_P
  33263. (machine_mode MODE, rtx EXP, bool STRICT, addr_space_t AS)
  33264. Define this to return true if EXP is a valid address for mode MODE
  33265. in the named address space AS. The STRICT parameter says whether
  33266. strict addressing is in effect after reload has finished. This
  33267. target hook is the same as the 'TARGET_LEGITIMATE_ADDRESS_P' target
  33268. hook, except that it includes explicit named address space support.
  33269. -- Target Hook: rtx TARGET_ADDR_SPACE_LEGITIMIZE_ADDRESS (rtx X, rtx
  33270. OLDX, machine_mode MODE, addr_space_t AS)
  33271. Define this to modify an invalid address X to be a valid address
  33272. with mode MODE in the named address space AS. This target hook is
  33273. the same as the 'TARGET_LEGITIMIZE_ADDRESS' target hook, except
  33274. that it includes explicit named address space support.
  33275. -- Target Hook: bool TARGET_ADDR_SPACE_SUBSET_P (addr_space_t SUBSET,
  33276. addr_space_t SUPERSET)
  33277. Define this to return whether the SUBSET named address space is
  33278. contained within the SUPERSET named address space. Pointers to a
  33279. named address space that is a subset of another named address space
  33280. will be converted automatically without a cast if used together in
  33281. arithmetic operations. Pointers to a superset address space can be
  33282. converted to pointers to a subset address space via explicit casts.
  33283. -- Target Hook: bool TARGET_ADDR_SPACE_ZERO_ADDRESS_VALID (addr_space_t
  33284. AS)
  33285. Define this to modify the default handling of address 0 for the
  33286. address space. Return true if 0 should be considered a valid
  33287. address.
  33288. -- Target Hook: rtx TARGET_ADDR_SPACE_CONVERT (rtx OP, tree FROM_TYPE,
  33289. tree TO_TYPE)
  33290. Define this to convert the pointer expression represented by the
  33291. RTL OP with type FROM_TYPE that points to a named address space to
  33292. a new pointer expression with type TO_TYPE that points to a
  33293. different named address space. When this hook it called, it is
  33294. guaranteed that one of the two address spaces is a subset of the
  33295. other, as determined by the 'TARGET_ADDR_SPACE_SUBSET_P' target
  33296. hook.
  33297. -- Target Hook: int TARGET_ADDR_SPACE_DEBUG (addr_space_t AS)
  33298. Define this to define how the address space is encoded in dwarf.
  33299. The result is the value to be used with 'DW_AT_address_class'.
  33300. -- Target Hook: void TARGET_ADDR_SPACE_DIAGNOSE_USAGE (addr_space_t AS,
  33301. location_t LOC)
  33302. Define this hook if the availability of an address space depends on
  33303. command line options and some diagnostics should be printed when
  33304. the address space is used. This hook is called during parsing and
  33305. allows to emit a better diagnostic compared to the case where the
  33306. address space was not registered with 'c_register_addr_space'. AS
  33307. is the address space as registered with 'c_register_addr_space'.
  33308. LOC is the location of the address space qualifier token. The
  33309. default implementation does nothing.
  33310. 
  33311. File: gccint.info, Node: Misc, Prev: Named Address Spaces, Up: Target Macros
  33312. 18.31 Miscellaneous Parameters
  33313. ==============================
  33314. Here are several miscellaneous parameters.
  33315. -- Macro: HAS_LONG_COND_BRANCH
  33316. Define this boolean macro to indicate whether or not your
  33317. architecture has conditional branches that can span all of memory.
  33318. It is used in conjunction with an optimization that partitions hot
  33319. and cold basic blocks into separate sections of the executable. If
  33320. this macro is set to false, gcc will convert any conditional
  33321. branches that attempt to cross between sections into unconditional
  33322. branches or indirect jumps.
  33323. -- Macro: HAS_LONG_UNCOND_BRANCH
  33324. Define this boolean macro to indicate whether or not your
  33325. architecture has unconditional branches that can span all of
  33326. memory. It is used in conjunction with an optimization that
  33327. partitions hot and cold basic blocks into separate sections of the
  33328. executable. If this macro is set to false, gcc will convert any
  33329. unconditional branches that attempt to cross between sections into
  33330. indirect jumps.
  33331. -- Macro: CASE_VECTOR_MODE
  33332. An alias for a machine mode name. This is the machine mode that
  33333. elements of a jump-table should have.
  33334. -- Macro: CASE_VECTOR_SHORTEN_MODE (MIN_OFFSET, MAX_OFFSET, BODY)
  33335. Optional: return the preferred mode for an 'addr_diff_vec' when the
  33336. minimum and maximum offset are known. If you define this, it
  33337. enables extra code in branch shortening to deal with
  33338. 'addr_diff_vec'. To make this work, you also have to define
  33339. 'INSN_ALIGN' and make the alignment for 'addr_diff_vec' explicit.
  33340. The BODY argument is provided so that the offset_unsigned and scale
  33341. flags can be updated.
  33342. -- Macro: CASE_VECTOR_PC_RELATIVE
  33343. Define this macro to be a C expression to indicate when jump-tables
  33344. should contain relative addresses. You need not define this macro
  33345. if jump-tables never contain relative addresses, or jump-tables
  33346. should contain relative addresses only when '-fPIC' or '-fPIC' is
  33347. in effect.
  33348. -- Target Hook: unsigned int TARGET_CASE_VALUES_THRESHOLD (void)
  33349. This function return the smallest number of different values for
  33350. which it is best to use a jump-table instead of a tree of
  33351. conditional branches. The default is four for machines with a
  33352. 'casesi' instruction and five otherwise. This is best for most
  33353. machines.
  33354. -- Macro: WORD_REGISTER_OPERATIONS
  33355. Define this macro to 1 if operations between registers with
  33356. integral mode smaller than a word are always performed on the
  33357. entire register. To be more explicit, if you start with a pair of
  33358. 'word_mode' registers with known values and you do a subword, for
  33359. example 'QImode', addition on the low part of the registers, then
  33360. the compiler may consider that the result has a known value in
  33361. 'word_mode' too if the macro is defined to 1. Most RISC machines
  33362. have this property and most CISC machines do not.
  33363. -- Target Hook: unsigned int TARGET_MIN_ARITHMETIC_PRECISION (void)
  33364. On some RISC architectures with 64-bit registers, the processor
  33365. also maintains 32-bit condition codes that make it possible to do
  33366. real 32-bit arithmetic, although the operations are performed on
  33367. the full registers.
  33368. On such architectures, defining this hook to 32 tells the compiler
  33369. to try using 32-bit arithmetical operations setting the condition
  33370. codes instead of doing full 64-bit arithmetic.
  33371. More generally, define this hook on RISC architectures if you want
  33372. the compiler to try using arithmetical operations setting the
  33373. condition codes with a precision lower than the word precision.
  33374. You need not define this hook if 'WORD_REGISTER_OPERATIONS' is not
  33375. defined to 1.
  33376. -- Macro: LOAD_EXTEND_OP (MEM_MODE)
  33377. Define this macro to be a C expression indicating when insns that
  33378. read memory in MEM_MODE, an integral mode narrower than a word, set
  33379. the bits outside of MEM_MODE to be either the sign-extension or the
  33380. zero-extension of the data read. Return 'SIGN_EXTEND' for values
  33381. of MEM_MODE for which the insn sign-extends, 'ZERO_EXTEND' for
  33382. which it zero-extends, and 'UNKNOWN' for other modes.
  33383. This macro is not called with MEM_MODE non-integral or with a width
  33384. greater than or equal to 'BITS_PER_WORD', so you may return any
  33385. value in this case. Do not define this macro if it would always
  33386. return 'UNKNOWN'. On machines where this macro is defined, you
  33387. will normally define it as the constant 'SIGN_EXTEND' or
  33388. 'ZERO_EXTEND'.
  33389. You may return a non-'UNKNOWN' value even if for some hard
  33390. registers the sign extension is not performed, if for the
  33391. 'REGNO_REG_CLASS' of these hard registers
  33392. 'TARGET_CAN_CHANGE_MODE_CLASS' returns false when the FROM mode is
  33393. MEM_MODE and the TO mode is any integral mode larger than this but
  33394. not larger than 'word_mode'.
  33395. You must return 'UNKNOWN' if for some hard registers that allow
  33396. this mode, 'TARGET_CAN_CHANGE_MODE_CLASS' says that they cannot
  33397. change to 'word_mode', but that they can change to another integral
  33398. mode that is larger then MEM_MODE but still smaller than
  33399. 'word_mode'.
  33400. -- Macro: SHORT_IMMEDIATES_SIGN_EXTEND
  33401. Define this macro to 1 if loading short immediate values into
  33402. registers sign extends.
  33403. -- Target Hook: unsigned int TARGET_MIN_DIVISIONS_FOR_RECIP_MUL
  33404. (machine_mode MODE)
  33405. When '-ffast-math' is in effect, GCC tries to optimize divisions by
  33406. the same divisor, by turning them into multiplications by the
  33407. reciprocal. This target hook specifies the minimum number of
  33408. divisions that should be there for GCC to perform the optimization
  33409. for a variable of mode MODE. The default implementation returns 3
  33410. if the machine has an instruction for the division, and 2 if it
  33411. does not.
  33412. -- Macro: MOVE_MAX
  33413. The maximum number of bytes that a single instruction can move
  33414. quickly between memory and registers or between two memory
  33415. locations.
  33416. -- Macro: MAX_MOVE_MAX
  33417. The maximum number of bytes that a single instruction can move
  33418. quickly between memory and registers or between two memory
  33419. locations. If this is undefined, the default is 'MOVE_MAX'.
  33420. Otherwise, it is the constant value that is the largest value that
  33421. 'MOVE_MAX' can have at run-time.
  33422. -- Macro: SHIFT_COUNT_TRUNCATED
  33423. A C expression that is nonzero if on this machine the number of
  33424. bits actually used for the count of a shift operation is equal to
  33425. the number of bits needed to represent the size of the object being
  33426. shifted. When this macro is nonzero, the compiler will assume that
  33427. it is safe to omit a sign-extend, zero-extend, and certain bitwise
  33428. 'and' instructions that truncates the count of a shift operation.
  33429. On machines that have instructions that act on bit-fields at
  33430. variable positions, which may include 'bit test' instructions, a
  33431. nonzero 'SHIFT_COUNT_TRUNCATED' also enables deletion of
  33432. truncations of the values that serve as arguments to bit-field
  33433. instructions.
  33434. If both types of instructions truncate the count (for shifts) and
  33435. position (for bit-field operations), or if no variable-position
  33436. bit-field instructions exist, you should define this macro.
  33437. However, on some machines, such as the 80386 and the 680x0,
  33438. truncation only applies to shift operations and not the (real or
  33439. pretended) bit-field operations. Define 'SHIFT_COUNT_TRUNCATED' to
  33440. be zero on such machines. Instead, add patterns to the 'md' file
  33441. that include the implied truncation of the shift instructions.
  33442. You need not define this macro if it would always have the value of
  33443. zero.
  33444. -- Target Hook: unsigned HOST_WIDE_INT TARGET_SHIFT_TRUNCATION_MASK
  33445. (machine_mode MODE)
  33446. This function describes how the standard shift patterns for MODE
  33447. deal with shifts by negative amounts or by more than the width of
  33448. the mode. *Note shift patterns::.
  33449. On many machines, the shift patterns will apply a mask M to the
  33450. shift count, meaning that a fixed-width shift of X by Y is
  33451. equivalent to an arbitrary-width shift of X by Y & M. If this is
  33452. true for mode MODE, the function should return M, otherwise it
  33453. should return 0. A return value of 0 indicates that no particular
  33454. behavior is guaranteed.
  33455. Note that, unlike 'SHIFT_COUNT_TRUNCATED', this function does _not_
  33456. apply to general shift rtxes; it applies only to instructions that
  33457. are generated by the named shift patterns.
  33458. The default implementation of this function returns
  33459. 'GET_MODE_BITSIZE (MODE) - 1' if 'SHIFT_COUNT_TRUNCATED' and 0
  33460. otherwise. This definition is always safe, but if
  33461. 'SHIFT_COUNT_TRUNCATED' is false, and some shift patterns
  33462. nevertheless truncate the shift count, you may get better code by
  33463. overriding it.
  33464. -- Target Hook: bool TARGET_TRULY_NOOP_TRUNCATION (poly_uint64 OUTPREC,
  33465. poly_uint64 INPREC)
  33466. This hook returns true if it is safe to "convert" a value of INPREC
  33467. bits to one of OUTPREC bits (where OUTPREC is smaller than INPREC)
  33468. by merely operating on it as if it had only OUTPREC bits. The
  33469. default returns true unconditionally, which is correct for most
  33470. machines.
  33471. If 'TARGET_MODES_TIEABLE_P' returns false for a pair of modes,
  33472. suboptimal code can result if this hook returns true for the
  33473. corresponding mode sizes. Making this hook return false in such
  33474. cases may improve things.
  33475. -- Target Hook: int TARGET_MODE_REP_EXTENDED (scalar_int_mode MODE,
  33476. scalar_int_mode REP_MODE)
  33477. The representation of an integral mode can be such that the values
  33478. are always extended to a wider integral mode. Return 'SIGN_EXTEND'
  33479. if values of MODE are represented in sign-extended form to
  33480. REP_MODE. Return 'UNKNOWN' otherwise. (Currently, none of the
  33481. targets use zero-extended representation this way so unlike
  33482. 'LOAD_EXTEND_OP', 'TARGET_MODE_REP_EXTENDED' is expected to return
  33483. either 'SIGN_EXTEND' or 'UNKNOWN'. Also no target extends MODE to
  33484. REP_MODE so that REP_MODE is not the next widest integral mode and
  33485. currently we take advantage of this fact.)
  33486. Similarly to 'LOAD_EXTEND_OP' you may return a non-'UNKNOWN' value
  33487. even if the extension is not performed on certain hard registers as
  33488. long as for the 'REGNO_REG_CLASS' of these hard registers
  33489. 'TARGET_CAN_CHANGE_MODE_CLASS' returns false.
  33490. Note that 'TARGET_MODE_REP_EXTENDED' and 'LOAD_EXTEND_OP' describe
  33491. two related properties. If you define 'TARGET_MODE_REP_EXTENDED
  33492. (mode, word_mode)' you probably also want to define 'LOAD_EXTEND_OP
  33493. (mode)' to return the same type of extension.
  33494. In order to enforce the representation of 'mode',
  33495. 'TARGET_TRULY_NOOP_TRUNCATION' should return false when truncating
  33496. to 'mode'.
  33497. -- Target Hook: bool TARGET_SETJMP_PRESERVES_NONVOLATILE_REGS_P (void)
  33498. On some targets, it is assumed that the compiler will spill all
  33499. pseudos that are live across a call to 'setjmp', while other
  33500. targets treat 'setjmp' calls as normal function calls.
  33501. This hook returns false if 'setjmp' calls do not preserve all
  33502. non-volatile registers so that gcc that must spill all pseudos that
  33503. are live across 'setjmp' calls. Define this to return true if the
  33504. target does not need to spill all pseudos live across 'setjmp'
  33505. calls. The default implementation conservatively assumes all
  33506. pseudos must be spilled across 'setjmp' calls.
  33507. -- Macro: STORE_FLAG_VALUE
  33508. A C expression describing the value returned by a comparison
  33509. operator with an integral mode and stored by a store-flag
  33510. instruction ('cstoreMODE4') when the condition is true. This
  33511. description must apply to _all_ the 'cstoreMODE4' patterns and all
  33512. the comparison operators whose results have a 'MODE_INT' mode.
  33513. A value of 1 or -1 means that the instruction implementing the
  33514. comparison operator returns exactly 1 or -1 when the comparison is
  33515. true and 0 when the comparison is false. Otherwise, the value
  33516. indicates which bits of the result are guaranteed to be 1 when the
  33517. comparison is true. This value is interpreted in the mode of the
  33518. comparison operation, which is given by the mode of the first
  33519. operand in the 'cstoreMODE4' pattern. Either the low bit or the
  33520. sign bit of 'STORE_FLAG_VALUE' be on. Presently, only those bits
  33521. are used by the compiler.
  33522. If 'STORE_FLAG_VALUE' is neither 1 or -1, the compiler will
  33523. generate code that depends only on the specified bits. It can also
  33524. replace comparison operators with equivalent operations if they
  33525. cause the required bits to be set, even if the remaining bits are
  33526. undefined. For example, on a machine whose comparison operators
  33527. return an 'SImode' value and where 'STORE_FLAG_VALUE' is defined as
  33528. '0x80000000', saying that just the sign bit is relevant, the
  33529. expression
  33530. (ne:SI (and:SI X (const_int POWER-OF-2)) (const_int 0))
  33531. can be converted to
  33532. (ashift:SI X (const_int N))
  33533. where N is the appropriate shift count to move the bit being tested
  33534. into the sign bit.
  33535. There is no way to describe a machine that always sets the
  33536. low-order bit for a true value, but does not guarantee the value of
  33537. any other bits, but we do not know of any machine that has such an
  33538. instruction. If you are trying to port GCC to such a machine,
  33539. include an instruction to perform a logical-and of the result with
  33540. 1 in the pattern for the comparison operators and let us know at
  33541. <gcc@gcc.gnu.org>.
  33542. Often, a machine will have multiple instructions that obtain a
  33543. value from a comparison (or the condition codes). Here are rules
  33544. to guide the choice of value for 'STORE_FLAG_VALUE', and hence the
  33545. instructions to be used:
  33546. * Use the shortest sequence that yields a valid definition for
  33547. 'STORE_FLAG_VALUE'. It is more efficient for the compiler to
  33548. "normalize" the value (convert it to, e.g., 1 or 0) than for
  33549. the comparison operators to do so because there may be
  33550. opportunities to combine the normalization with other
  33551. operations.
  33552. * For equal-length sequences, use a value of 1 or -1, with -1
  33553. being slightly preferred on machines with expensive jumps and
  33554. 1 preferred on other machines.
  33555. * As a second choice, choose a value of '0x80000001' if
  33556. instructions exist that set both the sign and low-order bits
  33557. but do not define the others.
  33558. * Otherwise, use a value of '0x80000000'.
  33559. Many machines can produce both the value chosen for
  33560. 'STORE_FLAG_VALUE' and its negation in the same number of
  33561. instructions. On those machines, you should also define a pattern
  33562. for those cases, e.g., one matching
  33563. (set A (neg:M (ne:M B C)))
  33564. Some machines can also perform 'and' or 'plus' operations on
  33565. condition code values with less instructions than the corresponding
  33566. 'cstoreMODE4' insn followed by 'and' or 'plus'. On those machines,
  33567. define the appropriate patterns. Use the names 'incscc' and
  33568. 'decscc', respectively, for the patterns which perform 'plus' or
  33569. 'minus' operations on condition code values. See 'rs6000.md' for
  33570. some examples. The GNU Superoptimizer can be used to find such
  33571. instruction sequences on other machines.
  33572. If this macro is not defined, the default value, 1, is used. You
  33573. need not define 'STORE_FLAG_VALUE' if the machine has no store-flag
  33574. instructions, or if the value generated by these instructions is 1.
  33575. -- Macro: FLOAT_STORE_FLAG_VALUE (MODE)
  33576. A C expression that gives a nonzero 'REAL_VALUE_TYPE' value that is
  33577. returned when comparison operators with floating-point results are
  33578. true. Define this macro on machines that have comparison
  33579. operations that return floating-point values. If there are no such
  33580. operations, do not define this macro.
  33581. -- Macro: VECTOR_STORE_FLAG_VALUE (MODE)
  33582. A C expression that gives a rtx representing the nonzero true
  33583. element for vector comparisons. The returned rtx should be valid
  33584. for the inner mode of MODE which is guaranteed to be a vector mode.
  33585. Define this macro on machines that have vector comparison
  33586. operations that return a vector result. If there are no such
  33587. operations, do not define this macro. Typically, this macro is
  33588. defined as 'const1_rtx' or 'constm1_rtx'. This macro may return
  33589. 'NULL_RTX' to prevent the compiler optimizing such vector
  33590. comparison operations for the given mode.
  33591. -- Macro: CLZ_DEFINED_VALUE_AT_ZERO (MODE, VALUE)
  33592. -- Macro: CTZ_DEFINED_VALUE_AT_ZERO (MODE, VALUE)
  33593. A C expression that indicates whether the architecture defines a
  33594. value for 'clz' or 'ctz' with a zero operand. A result of '0'
  33595. indicates the value is undefined. If the value is defined for only
  33596. the RTL expression, the macro should evaluate to '1'; if the value
  33597. applies also to the corresponding optab entry (which is normally
  33598. the case if it expands directly into the corresponding RTL), then
  33599. the macro should evaluate to '2'. In the cases where the value is
  33600. defined, VALUE should be set to this value.
  33601. If this macro is not defined, the value of 'clz' or 'ctz' at zero
  33602. is assumed to be undefined.
  33603. This macro must be defined if the target's expansion for 'ffs'
  33604. relies on a particular value to get correct results. Otherwise it
  33605. is not necessary, though it may be used to optimize some corner
  33606. cases, and to provide a default expansion for the 'ffs' optab.
  33607. Note that regardless of this macro the "definedness" of 'clz' and
  33608. 'ctz' at zero do _not_ extend to the builtin functions visible to
  33609. the user. Thus one may be free to adjust the value at will to
  33610. match the target expansion of these operations without fear of
  33611. breaking the API.
  33612. -- Macro: Pmode
  33613. An alias for the machine mode for pointers. On most machines,
  33614. define this to be the integer mode corresponding to the width of a
  33615. hardware pointer; 'SImode' on 32-bit machine or 'DImode' on 64-bit
  33616. machines. On some machines you must define this to be one of the
  33617. partial integer modes, such as 'PSImode'.
  33618. The width of 'Pmode' must be at least as large as the value of
  33619. 'POINTER_SIZE'. If it is not equal, you must define the macro
  33620. 'POINTERS_EXTEND_UNSIGNED' to specify how pointers are extended to
  33621. 'Pmode'.
  33622. -- Macro: FUNCTION_MODE
  33623. An alias for the machine mode used for memory references to
  33624. functions being called, in 'call' RTL expressions. On most CISC
  33625. machines, where an instruction can begin at any byte address, this
  33626. should be 'QImode'. On most RISC machines, where all instructions
  33627. have fixed size and alignment, this should be a mode with the same
  33628. size and alignment as the machine instruction words - typically
  33629. 'SImode' or 'HImode'.
  33630. -- Macro: STDC_0_IN_SYSTEM_HEADERS
  33631. In normal operation, the preprocessor expands '__STDC__' to the
  33632. constant 1, to signify that GCC conforms to ISO Standard C. On
  33633. some hosts, like Solaris, the system compiler uses a different
  33634. convention, where '__STDC__' is normally 0, but is 1 if the user
  33635. specifies strict conformance to the C Standard.
  33636. Defining 'STDC_0_IN_SYSTEM_HEADERS' makes GNU CPP follows the host
  33637. convention when processing system header files, but when processing
  33638. user files '__STDC__' will always expand to 1.
  33639. -- C Target Hook: const char * TARGET_C_PREINCLUDE (void)
  33640. Define this hook to return the name of a header file to be included
  33641. at the start of all compilations, as if it had been included with
  33642. '#include <FILE>'. If this hook returns 'NULL', or is not defined,
  33643. or the header is not found, or if the user specifies
  33644. '-ffreestanding' or '-nostdinc', no header is included.
  33645. This hook can be used together with a header provided by the system
  33646. C library to implement ISO C requirements for certain macros to be
  33647. predefined that describe properties of the whole implementation
  33648. rather than just the compiler.
  33649. -- C Target Hook: bool TARGET_CXX_IMPLICIT_EXTERN_C (const char*)
  33650. Define this hook to add target-specific C++ implicit extern C
  33651. functions. If this function returns true for the name of a
  33652. file-scope function, that function implicitly gets extern "C"
  33653. linkage rather than whatever language linkage the declaration would
  33654. normally have. An example of such function is WinMain on Win32
  33655. targets.
  33656. -- Macro: SYSTEM_IMPLICIT_EXTERN_C
  33657. Define this macro if the system header files do not support C++.
  33658. This macro handles system header files by pretending that system
  33659. header files are enclosed in 'extern "C" {...}'.
  33660. -- Macro: REGISTER_TARGET_PRAGMAS ()
  33661. Define this macro if you want to implement any target-specific
  33662. pragmas. If defined, it is a C expression which makes a series of
  33663. calls to 'c_register_pragma' or 'c_register_pragma_with_expansion'
  33664. for each pragma. The macro may also do any setup required for the
  33665. pragmas.
  33666. The primary reason to define this macro is to provide compatibility
  33667. with other compilers for the same target. In general, we
  33668. discourage definition of target-specific pragmas for GCC.
  33669. If the pragma can be implemented by attributes then you should
  33670. consider defining the target hook 'TARGET_INSERT_ATTRIBUTES' as
  33671. well.
  33672. Preprocessor macros that appear on pragma lines are not expanded.
  33673. All '#pragma' directives that do not match any registered pragma
  33674. are silently ignored, unless the user specifies
  33675. '-Wunknown-pragmas'.
  33676. -- Function: void c_register_pragma (const char *SPACE, const char
  33677. *NAME, void (*CALLBACK) (struct cpp_reader *))
  33678. -- Function: void c_register_pragma_with_expansion (const char *SPACE,
  33679. const char *NAME, void (*CALLBACK) (struct cpp_reader *))
  33680. Each call to 'c_register_pragma' or
  33681. 'c_register_pragma_with_expansion' establishes one pragma. The
  33682. CALLBACK routine will be called when the preprocessor encounters a
  33683. pragma of the form
  33684. #pragma [SPACE] NAME ...
  33685. SPACE is the case-sensitive namespace of the pragma, or 'NULL' to
  33686. put the pragma in the global namespace. The callback routine
  33687. receives PFILE as its first argument, which can be passed on to
  33688. cpplib's functions if necessary. You can lex tokens after the NAME
  33689. by calling 'pragma_lex'. Tokens that are not read by the callback
  33690. will be silently ignored. The end of the line is indicated by a
  33691. token of type 'CPP_EOF'. Macro expansion occurs on the arguments
  33692. of pragmas registered with 'c_register_pragma_with_expansion' but
  33693. not on the arguments of pragmas registered with
  33694. 'c_register_pragma'.
  33695. Note that the use of 'pragma_lex' is specific to the C and C++
  33696. compilers. It will not work in the Java or Fortran compilers, or
  33697. any other language compilers for that matter. Thus if 'pragma_lex'
  33698. is going to be called from target-specific code, it must only be
  33699. done so when building the C and C++ compilers. This can be done by
  33700. defining the variables 'c_target_objs' and 'cxx_target_objs' in the
  33701. target entry in the 'config.gcc' file. These variables should name
  33702. the target-specific, language-specific object file which contains
  33703. the code that uses 'pragma_lex'. Note it will also be necessary to
  33704. add a rule to the makefile fragment pointed to by 'tmake_file' that
  33705. shows how to build this object file.
  33706. -- Macro: HANDLE_PRAGMA_PACK_WITH_EXPANSION
  33707. Define this macro if macros should be expanded in the arguments of
  33708. '#pragma pack'.
  33709. -- Macro: TARGET_DEFAULT_PACK_STRUCT
  33710. If your target requires a structure packing default other than 0
  33711. (meaning the machine default), define this macro to the necessary
  33712. value (in bytes). This must be a value that would also be valid to
  33713. use with '#pragma pack()' (that is, a small power of two).
  33714. -- Macro: DOLLARS_IN_IDENTIFIERS
  33715. Define this macro to control use of the character '$' in identifier
  33716. names for the C family of languages. 0 means '$' is not allowed by
  33717. default; 1 means it is allowed. 1 is the default; there is no need
  33718. to define this macro in that case.
  33719. -- Macro: INSN_SETS_ARE_DELAYED (INSN)
  33720. Define this macro as a C expression that is nonzero if it is safe
  33721. for the delay slot scheduler to place instructions in the delay
  33722. slot of INSN, even if they appear to use a resource set or
  33723. clobbered in INSN. INSN is always a 'jump_insn' or an 'insn'; GCC
  33724. knows that every 'call_insn' has this behavior. On machines where
  33725. some 'insn' or 'jump_insn' is really a function call and hence has
  33726. this behavior, you should define this macro.
  33727. You need not define this macro if it would always return zero.
  33728. -- Macro: INSN_REFERENCES_ARE_DELAYED (INSN)
  33729. Define this macro as a C expression that is nonzero if it is safe
  33730. for the delay slot scheduler to place instructions in the delay
  33731. slot of INSN, even if they appear to set or clobber a resource
  33732. referenced in INSN. INSN is always a 'jump_insn' or an 'insn'. On
  33733. machines where some 'insn' or 'jump_insn' is really a function call
  33734. and its operands are registers whose use is actually in the
  33735. subroutine it calls, you should define this macro. Doing so allows
  33736. the delay slot scheduler to move instructions which copy arguments
  33737. into the argument registers into the delay slot of INSN.
  33738. You need not define this macro if it would always return zero.
  33739. -- Macro: MULTIPLE_SYMBOL_SPACES
  33740. Define this macro as a C expression that is nonzero if, in some
  33741. cases, global symbols from one translation unit may not be bound to
  33742. undefined symbols in another translation unit without user
  33743. intervention. For instance, under Microsoft Windows symbols must
  33744. be explicitly imported from shared libraries (DLLs).
  33745. You need not define this macro if it would always evaluate to zero.
  33746. -- Target Hook: rtx_insn * TARGET_MD_ASM_ADJUST (vec<rtx>& OUTPUTS,
  33747. vec<rtx>& INPUTS, vec<const char *>& CONSTRAINTS, vec<rtx>&
  33748. CLOBBERS, HARD_REG_SET& CLOBBERED_REGS)
  33749. This target hook may add "clobbers" to CLOBBERS and CLOBBERED_REGS
  33750. for any hard regs the port wishes to automatically clobber for an
  33751. asm. The OUTPUTS and INPUTS may be inspected to avoid clobbering a
  33752. register that is already used by the asm.
  33753. It may modify the OUTPUTS, INPUTS, and CONSTRAINTS as necessary for
  33754. other pre-processing. In this case the return value is a sequence
  33755. of insns to emit after the asm.
  33756. -- Macro: MATH_LIBRARY
  33757. Define this macro as a C string constant for the linker argument to
  33758. link in the system math library, minus the initial '"-l"', or '""'
  33759. if the target does not have a separate math library.
  33760. You need only define this macro if the default of '"m"' is wrong.
  33761. -- Macro: LIBRARY_PATH_ENV
  33762. Define this macro as a C string constant for the environment
  33763. variable that specifies where the linker should look for libraries.
  33764. You need only define this macro if the default of '"LIBRARY_PATH"'
  33765. is wrong.
  33766. -- Macro: TARGET_POSIX_IO
  33767. Define this macro if the target supports the following POSIX file
  33768. functions, access, mkdir and file locking with fcntl / F_SETLKW.
  33769. Defining 'TARGET_POSIX_IO' will enable the test coverage code to
  33770. use file locking when exiting a program, which avoids race
  33771. conditions if the program has forked. It will also create
  33772. directories at run-time for cross-profiling.
  33773. -- Macro: MAX_CONDITIONAL_EXECUTE
  33774. A C expression for the maximum number of instructions to execute
  33775. via conditional execution instructions instead of a branch. A
  33776. value of 'BRANCH_COST'+1 is the default if the machine does not use
  33777. cc0, and 1 if it does use cc0.
  33778. -- Macro: IFCVT_MODIFY_TESTS (CE_INFO, TRUE_EXPR, FALSE_EXPR)
  33779. Used if the target needs to perform machine-dependent modifications
  33780. on the conditionals used for turning basic blocks into
  33781. conditionally executed code. CE_INFO points to a data structure,
  33782. 'struct ce_if_block', which contains information about the
  33783. currently processed blocks. TRUE_EXPR and FALSE_EXPR are the tests
  33784. that are used for converting the then-block and the else-block,
  33785. respectively. Set either TRUE_EXPR or FALSE_EXPR to a null pointer
  33786. if the tests cannot be converted.
  33787. -- Macro: IFCVT_MODIFY_MULTIPLE_TESTS (CE_INFO, BB, TRUE_EXPR,
  33788. FALSE_EXPR)
  33789. Like 'IFCVT_MODIFY_TESTS', but used when converting more
  33790. complicated if-statements into conditions combined by 'and' and
  33791. 'or' operations. BB contains the basic block that contains the
  33792. test that is currently being processed and about to be turned into
  33793. a condition.
  33794. -- Macro: IFCVT_MODIFY_INSN (CE_INFO, PATTERN, INSN)
  33795. A C expression to modify the PATTERN of an INSN that is to be
  33796. converted to conditional execution format. CE_INFO points to a
  33797. data structure, 'struct ce_if_block', which contains information
  33798. about the currently processed blocks.
  33799. -- Macro: IFCVT_MODIFY_FINAL (CE_INFO)
  33800. A C expression to perform any final machine dependent modifications
  33801. in converting code to conditional execution. The involved basic
  33802. blocks can be found in the 'struct ce_if_block' structure that is
  33803. pointed to by CE_INFO.
  33804. -- Macro: IFCVT_MODIFY_CANCEL (CE_INFO)
  33805. A C expression to cancel any machine dependent modifications in
  33806. converting code to conditional execution. The involved basic
  33807. blocks can be found in the 'struct ce_if_block' structure that is
  33808. pointed to by CE_INFO.
  33809. -- Macro: IFCVT_MACHDEP_INIT (CE_INFO)
  33810. A C expression to initialize any machine specific data for
  33811. if-conversion of the if-block in the 'struct ce_if_block' structure
  33812. that is pointed to by CE_INFO.
  33813. -- Target Hook: void TARGET_MACHINE_DEPENDENT_REORG (void)
  33814. If non-null, this hook performs a target-specific pass over the
  33815. instruction stream. The compiler will run it at all optimization
  33816. levels, just before the point at which it normally does
  33817. delayed-branch scheduling.
  33818. The exact purpose of the hook varies from target to target. Some
  33819. use it to do transformations that are necessary for correctness,
  33820. such as laying out in-function constant pools or avoiding hardware
  33821. hazards. Others use it as an opportunity to do some
  33822. machine-dependent optimizations.
  33823. You need not implement the hook if it has nothing to do. The
  33824. default definition is null.
  33825. -- Target Hook: void TARGET_INIT_BUILTINS (void)
  33826. Define this hook if you have any machine-specific built-in
  33827. functions that need to be defined. It should be a function that
  33828. performs the necessary setup.
  33829. Machine specific built-in functions can be useful to expand special
  33830. machine instructions that would otherwise not normally be generated
  33831. because they have no equivalent in the source language (for
  33832. example, SIMD vector instructions or prefetch instructions).
  33833. To create a built-in function, call the function
  33834. 'lang_hooks.builtin_function' which is defined by the language
  33835. front end. You can use any type nodes set up by
  33836. 'build_common_tree_nodes'; only language front ends that use those
  33837. two functions will call 'TARGET_INIT_BUILTINS'.
  33838. -- Target Hook: tree TARGET_BUILTIN_DECL (unsigned CODE, bool
  33839. INITIALIZE_P)
  33840. Define this hook if you have any machine-specific built-in
  33841. functions that need to be defined. It should be a function that
  33842. returns the builtin function declaration for the builtin function
  33843. code CODE. If there is no such builtin and it cannot be
  33844. initialized at this time if INITIALIZE_P is true the function
  33845. should return 'NULL_TREE'. If CODE is out of range the function
  33846. should return 'error_mark_node'.
  33847. -- Target Hook: rtx TARGET_EXPAND_BUILTIN (tree EXP, rtx TARGET, rtx
  33848. SUBTARGET, machine_mode MODE, int IGNORE)
  33849. Expand a call to a machine specific built-in function that was set
  33850. up by 'TARGET_INIT_BUILTINS'. EXP is the expression for the
  33851. function call; the result should go to TARGET if that is
  33852. convenient, and have mode MODE if that is convenient. SUBTARGET
  33853. may be used as the target for computing one of EXP's operands.
  33854. IGNORE is nonzero if the value is to be ignored. This function
  33855. should return the result of the call to the built-in function.
  33856. -- Target Hook: tree TARGET_RESOLVE_OVERLOADED_BUILTIN (unsigned int
  33857. LOC, tree FNDECL, void *ARGLIST)
  33858. Select a replacement for a machine specific built-in function that
  33859. was set up by 'TARGET_INIT_BUILTINS'. This is done _before_
  33860. regular type checking, and so allows the target to implement a
  33861. crude form of function overloading. FNDECL is the declaration of
  33862. the built-in function. ARGLIST is the list of arguments passed to
  33863. the built-in function. The result is a complete expression that
  33864. implements the operation, usually another 'CALL_EXPR'. ARGLIST
  33865. really has type 'VEC(tree,gc)*'
  33866. -- Target Hook: bool TARGET_CHECK_BUILTIN_CALL (location_t LOC,
  33867. vec<location_t> ARG_LOC, tree FNDECL, tree ORIG_FNDECL,
  33868. unsigned int NARGS, tree *ARGS)
  33869. Perform semantic checking on a call to a machine-specific built-in
  33870. function after its arguments have been constrained to the function
  33871. signature. Return true if the call is valid, otherwise report an
  33872. error and return false.
  33873. This hook is called after 'TARGET_RESOLVE_OVERLOADED_BUILTIN'. The
  33874. call was originally to built-in function ORIG_FNDECL, but after the
  33875. optional 'TARGET_RESOLVE_OVERLOADED_BUILTIN' step is now to
  33876. built-in function FNDECL. LOC is the location of the call and ARGS
  33877. is an array of function arguments, of which there are NARGS.
  33878. ARG_LOC specifies the location of each argument.
  33879. -- Target Hook: tree TARGET_FOLD_BUILTIN (tree FNDECL, int N_ARGS, tree
  33880. *ARGP, bool IGNORE)
  33881. Fold a call to a machine specific built-in function that was set up
  33882. by 'TARGET_INIT_BUILTINS'. FNDECL is the declaration of the
  33883. built-in function. N_ARGS is the number of arguments passed to the
  33884. function; the arguments themselves are pointed to by ARGP. The
  33885. result is another tree, valid for both GIMPLE and GENERIC,
  33886. containing a simplified expression for the call's result. If
  33887. IGNORE is true the value will be ignored.
  33888. -- Target Hook: bool TARGET_GIMPLE_FOLD_BUILTIN (gimple_stmt_iterator
  33889. *GSI)
  33890. Fold a call to a machine specific built-in function that was set up
  33891. by 'TARGET_INIT_BUILTINS'. GSI points to the gimple statement
  33892. holding the function call. Returns true if any change was made to
  33893. the GIMPLE stream.
  33894. -- Target Hook: int TARGET_COMPARE_VERSION_PRIORITY (tree DECL1, tree
  33895. DECL2)
  33896. This hook is used to compare the target attributes in two functions
  33897. to determine which function's features get higher priority. This
  33898. is used during function multi-versioning to figure out the order in
  33899. which two versions must be dispatched. A function version with a
  33900. higher priority is checked for dispatching earlier. DECL1 and
  33901. DECL2 are the two function decls that will be compared.
  33902. -- Target Hook: tree TARGET_GET_FUNCTION_VERSIONS_DISPATCHER (void
  33903. *DECL)
  33904. This hook is used to get the dispatcher function for a set of
  33905. function versions. The dispatcher function is called to invoke the
  33906. right function version at run-time. DECL is one version from a set
  33907. of semantically identical versions.
  33908. -- Target Hook: tree TARGET_GENERATE_VERSION_DISPATCHER_BODY (void
  33909. *ARG)
  33910. This hook is used to generate the dispatcher logic to invoke the
  33911. right function version at run-time for a given set of function
  33912. versions. ARG points to the callgraph node of the dispatcher
  33913. function whose body must be generated.
  33914. -- Target Hook: bool TARGET_PREDICT_DOLOOP_P (class loop *LOOP)
  33915. Return true if we can predict it is possible to use a low-overhead
  33916. loop for a particular loop. The parameter LOOP is a pointer to the
  33917. loop. This target hook is required only when the target supports
  33918. low-overhead loops, and will help ivopts to make some decisions.
  33919. The default version of this hook returns false.
  33920. -- Target Hook: bool TARGET_HAVE_COUNT_REG_DECR_P
  33921. Return true if the target supports hardware count register for
  33922. decrement and branch. The default value is false.
  33923. -- Target Hook: int64_t TARGET_DOLOOP_COST_FOR_GENERIC
  33924. One IV candidate dedicated for doloop is introduced in IVOPTs, we
  33925. can calculate the computation cost of adopting it to any generic IV
  33926. use by function get_computation_cost as before. But for targets
  33927. which have hardware count register support for decrement and
  33928. branch, it may have to move IV value from hardware count register
  33929. to general purpose register while doloop IV candidate is used for
  33930. generic IV uses. It probably takes expensive penalty. This hook
  33931. allows target owners to define the cost for this especially for
  33932. generic IV uses. The default value is zero.
  33933. -- Target Hook: int64_t TARGET_DOLOOP_COST_FOR_ADDRESS
  33934. One IV candidate dedicated for doloop is introduced in IVOPTs, we
  33935. can calculate the computation cost of adopting it to any address IV
  33936. use by function get_computation_cost as before. But for targets
  33937. which have hardware count register support for decrement and
  33938. branch, it may have to move IV value from hardware count register
  33939. to general purpose register while doloop IV candidate is used for
  33940. address IV uses. It probably takes expensive penalty. This hook
  33941. allows target owners to define the cost for this escpecially for
  33942. address IV uses. The default value is zero.
  33943. -- Target Hook: bool TARGET_CAN_USE_DOLOOP_P (const widest_int
  33944. &ITERATIONS, const widest_int &ITERATIONS_MAX, unsigned int
  33945. LOOP_DEPTH, bool ENTERED_AT_TOP)
  33946. Return true if it is possible to use low-overhead loops
  33947. ('doloop_end' and 'doloop_begin') for a particular loop.
  33948. ITERATIONS gives the exact number of iterations, or 0 if not known.
  33949. ITERATIONS_MAX gives the maximum number of iterations, or 0 if not
  33950. known. LOOP_DEPTH is the nesting depth of the loop, with 1 for
  33951. innermost loops, 2 for loops that contain innermost loops, and so
  33952. on. ENTERED_AT_TOP is true if the loop is only entered from the
  33953. top.
  33954. This hook is only used if 'doloop_end' is available. The default
  33955. implementation returns true. You can use
  33956. 'can_use_doloop_if_innermost' if the loop must be the innermost,
  33957. and if there are no other restrictions.
  33958. -- Target Hook: const char * TARGET_INVALID_WITHIN_DOLOOP (const
  33959. rtx_insn *INSN)
  33960. Take an instruction in INSN and return NULL if it is valid within a
  33961. low-overhead loop, otherwise return a string explaining why doloop
  33962. could not be applied.
  33963. Many targets use special registers for low-overhead looping. For
  33964. any instruction that clobbers these this function should return a
  33965. string indicating the reason why the doloop could not be applied.
  33966. By default, the RTL loop optimizer does not use a present doloop
  33967. pattern for loops containing function calls or branch on table
  33968. instructions.
  33969. -- Target Hook: bool TARGET_LEGITIMATE_COMBINED_INSN (rtx_insn *INSN)
  33970. Take an instruction in INSN and return 'false' if the instruction
  33971. is not appropriate as a combination of two or more instructions.
  33972. The default is to accept all instructions.
  33973. -- Target Hook: bool TARGET_CAN_FOLLOW_JUMP (const rtx_insn *FOLLOWER,
  33974. const rtx_insn *FOLLOWEE)
  33975. FOLLOWER and FOLLOWEE are JUMP_INSN instructions; return true if
  33976. FOLLOWER may be modified to follow FOLLOWEE; false, if it can't.
  33977. For example, on some targets, certain kinds of branches can't be
  33978. made to follow through a hot/cold partitioning.
  33979. -- Target Hook: bool TARGET_COMMUTATIVE_P (const_rtx X, int OUTER_CODE)
  33980. This target hook returns 'true' if X is considered to be
  33981. commutative. Usually, this is just COMMUTATIVE_P (X), but the HP
  33982. PA doesn't consider PLUS to be commutative inside a MEM.
  33983. OUTER_CODE is the rtx code of the enclosing rtl, if known,
  33984. otherwise it is UNKNOWN.
  33985. -- Target Hook: rtx TARGET_ALLOCATE_INITIAL_VALUE (rtx HARD_REG)
  33986. When the initial value of a hard register has been copied in a
  33987. pseudo register, it is often not necessary to actually allocate
  33988. another register to this pseudo register, because the original hard
  33989. register or a stack slot it has been saved into can be used.
  33990. 'TARGET_ALLOCATE_INITIAL_VALUE' is called at the start of register
  33991. allocation once for each hard register that had its initial value
  33992. copied by using 'get_func_hard_reg_initial_val' or
  33993. 'get_hard_reg_initial_val'. Possible values are 'NULL_RTX', if you
  33994. don't want to do any special allocation, a 'REG' rtx--that would
  33995. typically be the hard register itself, if it is known not to be
  33996. clobbered--or a 'MEM'. If you are returning a 'MEM', this is only
  33997. a hint for the allocator; it might decide to use another register
  33998. anyways. You may use 'current_function_is_leaf' or 'REG_N_SETS' in
  33999. the hook to determine if the hard register in question will not be
  34000. clobbered. The default value of this hook is 'NULL', which
  34001. disables any special allocation.
  34002. -- Target Hook: int TARGET_UNSPEC_MAY_TRAP_P (const_rtx X, unsigned
  34003. FLAGS)
  34004. This target hook returns nonzero if X, an 'unspec' or
  34005. 'unspec_volatile' operation, might cause a trap. Targets can use
  34006. this hook to enhance precision of analysis for 'unspec' and
  34007. 'unspec_volatile' operations. You may call 'may_trap_p_1' to
  34008. analyze inner elements of X in which case FLAGS should be passed
  34009. along.
  34010. -- Target Hook: void TARGET_SET_CURRENT_FUNCTION (tree DECL)
  34011. The compiler invokes this hook whenever it changes its current
  34012. function context ('cfun'). You can define this function if the
  34013. back end needs to perform any initialization or reset actions on a
  34014. per-function basis. For example, it may be used to implement
  34015. function attributes that affect register usage or code generation
  34016. patterns. The argument DECL is the declaration for the new
  34017. function context, and may be null to indicate that the compiler has
  34018. left a function context and is returning to processing at the top
  34019. level. The default hook function does nothing.
  34020. GCC sets 'cfun' to a dummy function context during initialization
  34021. of some parts of the back end. The hook function is not invoked in
  34022. this situation; you need not worry about the hook being invoked
  34023. recursively, or when the back end is in a partially-initialized
  34024. state. 'cfun' might be 'NULL' to indicate processing at top level,
  34025. outside of any function scope.
  34026. -- Macro: TARGET_OBJECT_SUFFIX
  34027. Define this macro to be a C string representing the suffix for
  34028. object files on your target machine. If you do not define this
  34029. macro, GCC will use '.o' as the suffix for object files.
  34030. -- Macro: TARGET_EXECUTABLE_SUFFIX
  34031. Define this macro to be a C string representing the suffix to be
  34032. automatically added to executable files on your target machine. If
  34033. you do not define this macro, GCC will use the null string as the
  34034. suffix for executable files.
  34035. -- Macro: COLLECT_EXPORT_LIST
  34036. If defined, 'collect2' will scan the individual object files
  34037. specified on its command line and create an export list for the
  34038. linker. Define this macro for systems like AIX, where the linker
  34039. discards object files that are not referenced from 'main' and uses
  34040. export lists.
  34041. -- Target Hook: bool TARGET_CANNOT_MODIFY_JUMPS_P (void)
  34042. This target hook returns 'true' past the point in which new jump
  34043. instructions could be created. On machines that require a register
  34044. for every jump such as the SHmedia ISA of SH5, this point would
  34045. typically be reload, so this target hook should be defined to a
  34046. function such as:
  34047. static bool
  34048. cannot_modify_jumps_past_reload_p ()
  34049. {
  34050. return (reload_completed || reload_in_progress);
  34051. }
  34052. -- Target Hook: bool TARGET_HAVE_CONDITIONAL_EXECUTION (void)
  34053. This target hook returns true if the target supports conditional
  34054. execution. This target hook is required only when the target has
  34055. several different modes and they have different conditional
  34056. execution capability, such as ARM.
  34057. -- Target Hook: rtx TARGET_GEN_CCMP_FIRST (rtx_insn **PREP_SEQ,
  34058. rtx_insn **GEN_SEQ, int CODE, tree OP0, tree OP1)
  34059. This function prepares to emit a comparison insn for the first
  34060. compare in a sequence of conditional comparisions. It returns an
  34061. appropriate comparison with 'CC' for passing to 'gen_ccmp_next' or
  34062. 'cbranch_optab'. The insns to prepare the compare are saved in
  34063. PREP_SEQ and the compare insns are saved in GEN_SEQ. They will be
  34064. emitted when all the compares in the conditional comparision are
  34065. generated without error. CODE is the 'rtx_code' of the compare for
  34066. OP0 and OP1.
  34067. -- Target Hook: rtx TARGET_GEN_CCMP_NEXT (rtx_insn **PREP_SEQ, rtx_insn
  34068. **GEN_SEQ, rtx PREV, int CMP_CODE, tree OP0, tree OP1, int
  34069. BIT_CODE)
  34070. This function prepares to emit a conditional comparison within a
  34071. sequence of conditional comparisons. It returns an appropriate
  34072. comparison with 'CC' for passing to 'gen_ccmp_next' or
  34073. 'cbranch_optab'. The insns to prepare the compare are saved in
  34074. PREP_SEQ and the compare insns are saved in GEN_SEQ. They will be
  34075. emitted when all the compares in the conditional comparision are
  34076. generated without error. The PREV expression is the result of a
  34077. prior call to 'gen_ccmp_first' or 'gen_ccmp_next'. It may return
  34078. 'NULL' if the combination of PREV and this comparison is not
  34079. supported, otherwise the result must be appropriate for passing to
  34080. 'gen_ccmp_next' or 'cbranch_optab'. CODE is the 'rtx_code' of the
  34081. compare for OP0 and OP1. BIT_CODE is 'AND' or 'IOR', which is the
  34082. op on the compares.
  34083. -- Target Hook: unsigned TARGET_LOOP_UNROLL_ADJUST (unsigned NUNROLL,
  34084. class loop *LOOP)
  34085. This target hook returns a new value for the number of times LOOP
  34086. should be unrolled. The parameter NUNROLL is the number of times
  34087. the loop is to be unrolled. The parameter LOOP is a pointer to the
  34088. loop, which is going to be checked for unrolling. This target hook
  34089. is required only when the target has special constraints like
  34090. maximum number of memory accesses.
  34091. -- Macro: POWI_MAX_MULTS
  34092. If defined, this macro is interpreted as a signed integer C
  34093. expression that specifies the maximum number of floating point
  34094. multiplications that should be emitted when expanding
  34095. exponentiation by an integer constant inline. When this value is
  34096. defined, exponentiation requiring more than this number of
  34097. multiplications is implemented by calling the system library's
  34098. 'pow', 'powf' or 'powl' routines. The default value places no
  34099. upper bound on the multiplication count.
  34100. -- Macro: void TARGET_EXTRA_INCLUDES (const char *SYSROOT, const char
  34101. *IPREFIX, int STDINC)
  34102. This target hook should register any extra include files for the
  34103. target. The parameter STDINC indicates if normal include files are
  34104. present. The parameter SYSROOT is the system root directory. The
  34105. parameter IPREFIX is the prefix for the gcc directory.
  34106. -- Macro: void TARGET_EXTRA_PRE_INCLUDES (const char *SYSROOT, const
  34107. char *IPREFIX, int STDINC)
  34108. This target hook should register any extra include files for the
  34109. target before any standard headers. The parameter STDINC indicates
  34110. if normal include files are present. The parameter SYSROOT is the
  34111. system root directory. The parameter IPREFIX is the prefix for the
  34112. gcc directory.
  34113. -- Macro: void TARGET_OPTF (char *PATH)
  34114. This target hook should register special include paths for the
  34115. target. The parameter PATH is the include to register. On Darwin
  34116. systems, this is used for Framework includes, which have semantics
  34117. that are different from '-I'.
  34118. -- Macro: bool TARGET_USE_LOCAL_THUNK_ALIAS_P (tree FNDECL)
  34119. This target macro returns 'true' if it is safe to use a local alias
  34120. for a virtual function FNDECL when constructing thunks, 'false'
  34121. otherwise. By default, the macro returns 'true' for all functions,
  34122. if a target supports aliases (i.e. defines 'ASM_OUTPUT_DEF'),
  34123. 'false' otherwise,
  34124. -- Macro: TARGET_FORMAT_TYPES
  34125. If defined, this macro is the name of a global variable containing
  34126. target-specific format checking information for the '-Wformat'
  34127. option. The default is to have no target-specific format checks.
  34128. -- Macro: TARGET_N_FORMAT_TYPES
  34129. If defined, this macro is the number of entries in
  34130. 'TARGET_FORMAT_TYPES'.
  34131. -- Macro: TARGET_OVERRIDES_FORMAT_ATTRIBUTES
  34132. If defined, this macro is the name of a global variable containing
  34133. target-specific format overrides for the '-Wformat' option. The
  34134. default is to have no target-specific format overrides. If
  34135. defined, 'TARGET_FORMAT_TYPES' must be defined, too.
  34136. -- Macro: TARGET_OVERRIDES_FORMAT_ATTRIBUTES_COUNT
  34137. If defined, this macro specifies the number of entries in
  34138. 'TARGET_OVERRIDES_FORMAT_ATTRIBUTES'.
  34139. -- Macro: TARGET_OVERRIDES_FORMAT_INIT
  34140. If defined, this macro specifies the optional initialization
  34141. routine for target specific customizations of the system printf and
  34142. scanf formatter settings.
  34143. -- Target Hook: const char * TARGET_INVALID_ARG_FOR_UNPROTOTYPED_FN
  34144. (const_tree TYPELIST, const_tree FUNCDECL, const_tree VAL)
  34145. If defined, this macro returns the diagnostic message when it is
  34146. illegal to pass argument VAL to function FUNCDECL with prototype
  34147. TYPELIST.
  34148. -- Target Hook: const char * TARGET_INVALID_CONVERSION (const_tree
  34149. FROMTYPE, const_tree TOTYPE)
  34150. If defined, this macro returns the diagnostic message when it is
  34151. invalid to convert from FROMTYPE to TOTYPE, or 'NULL' if validity
  34152. should be determined by the front end.
  34153. -- Target Hook: const char * TARGET_INVALID_UNARY_OP (int OP,
  34154. const_tree TYPE)
  34155. If defined, this macro returns the diagnostic message when it is
  34156. invalid to apply operation OP (where unary plus is denoted by
  34157. 'CONVERT_EXPR') to an operand of type TYPE, or 'NULL' if validity
  34158. should be determined by the front end.
  34159. -- Target Hook: const char * TARGET_INVALID_BINARY_OP (int OP,
  34160. const_tree TYPE1, const_tree TYPE2)
  34161. If defined, this macro returns the diagnostic message when it is
  34162. invalid to apply operation OP to operands of types TYPE1 and TYPE2,
  34163. or 'NULL' if validity should be determined by the front end.
  34164. -- Target Hook: tree TARGET_PROMOTED_TYPE (const_tree TYPE)
  34165. If defined, this target hook returns the type to which values of
  34166. TYPE should be promoted when they appear in expressions, analogous
  34167. to the integer promotions, or 'NULL_TREE' to use the front end's
  34168. normal promotion rules. This hook is useful when there are
  34169. target-specific types with special promotion rules. This is
  34170. currently used only by the C and C++ front ends.
  34171. -- Target Hook: tree TARGET_CONVERT_TO_TYPE (tree TYPE, tree EXPR)
  34172. If defined, this hook returns the result of converting EXPR to
  34173. TYPE. It should return the converted expression, or 'NULL_TREE' to
  34174. apply the front end's normal conversion rules. This hook is useful
  34175. when there are target-specific types with special conversion rules.
  34176. This is currently used only by the C and C++ front ends.
  34177. -- Target Hook: bool TARGET_VERIFY_TYPE_CONTEXT (location_t LOC,
  34178. type_context_kind CONTEXT, const_tree TYPE, bool SILENT_P)
  34179. If defined, this hook returns false if there is a target-specific
  34180. reason why type TYPE cannot be used in the source language context
  34181. described by CONTEXT. When SILENT_P is false, the hook also
  34182. reports an error against LOC for invalid uses of TYPE.
  34183. Calls to this hook should be made through the global function
  34184. 'verify_type_context', which makes the SILENT_P parameter default
  34185. to false and also handles 'error_mark_node'.
  34186. The default implementation always returns true.
  34187. -- Macro: OBJC_JBLEN
  34188. This macro determines the size of the objective C jump buffer for
  34189. the NeXT runtime. By default, OBJC_JBLEN is defined to an
  34190. innocuous value.
  34191. -- Macro: LIBGCC2_UNWIND_ATTRIBUTE
  34192. Define this macro if any target-specific attributes need to be
  34193. attached to the functions in 'libgcc' that provide low-level
  34194. support for call stack unwinding. It is used in declarations in
  34195. 'unwind-generic.h' and the associated definitions of those
  34196. functions.
  34197. -- Target Hook: void TARGET_UPDATE_STACK_BOUNDARY (void)
  34198. Define this macro to update the current function stack boundary if
  34199. necessary.
  34200. -- Target Hook: rtx TARGET_GET_DRAP_RTX (void)
  34201. This hook should return an rtx for Dynamic Realign Argument Pointer
  34202. (DRAP) if a different argument pointer register is needed to access
  34203. the function's argument list due to stack realignment. Return
  34204. 'NULL' if no DRAP is needed.
  34205. -- Target Hook: bool TARGET_ALLOCATE_STACK_SLOTS_FOR_ARGS (void)
  34206. When optimization is disabled, this hook indicates whether or not
  34207. arguments should be allocated to stack slots. Normally, GCC
  34208. allocates stacks slots for arguments when not optimizing in order
  34209. to make debugging easier. However, when a function is declared
  34210. with '__attribute__((naked))', there is no stack frame, and the
  34211. compiler cannot safely move arguments from the registers in which
  34212. they are passed to the stack. Therefore, this hook should return
  34213. true in general, but false for naked functions. The default
  34214. implementation always returns true.
  34215. -- Target Hook: unsigned HOST_WIDE_INT TARGET_CONST_ANCHOR
  34216. On some architectures it can take multiple instructions to
  34217. synthesize a constant. If there is another constant already in a
  34218. register that is close enough in value then it is preferable that
  34219. the new constant is computed from this register using immediate
  34220. addition or subtraction. We accomplish this through CSE. Besides
  34221. the value of the constant we also add a lower and an upper constant
  34222. anchor to the available expressions. These are then queried when
  34223. encountering new constants. The anchors are computed by rounding
  34224. the constant up and down to a multiple of the value of
  34225. 'TARGET_CONST_ANCHOR'. 'TARGET_CONST_ANCHOR' should be the maximum
  34226. positive value accepted by immediate-add plus one. We currently
  34227. assume that the value of 'TARGET_CONST_ANCHOR' is a power of 2.
  34228. For example, on MIPS, where add-immediate takes a 16-bit signed
  34229. value, 'TARGET_CONST_ANCHOR' is set to '0x8000'. The default value
  34230. is zero, which disables this optimization.
  34231. -- Target Hook: unsigned HOST_WIDE_INT TARGET_ASAN_SHADOW_OFFSET (void)
  34232. Return the offset bitwise ored into shifted address to get
  34233. corresponding Address Sanitizer shadow memory address. NULL if
  34234. Address Sanitizer is not supported by the target.
  34235. -- Target Hook: unsigned HOST_WIDE_INT TARGET_MEMMODEL_CHECK (unsigned
  34236. HOST_WIDE_INT VAL)
  34237. Validate target specific memory model mask bits. When NULL no
  34238. target specific memory model bits are allowed.
  34239. -- Target Hook: unsigned char TARGET_ATOMIC_TEST_AND_SET_TRUEVAL
  34240. This value should be set if the result written by
  34241. 'atomic_test_and_set' is not exactly 1, i.e. the 'bool' 'true'.
  34242. -- Target Hook: bool TARGET_HAS_IFUNC_P (void)
  34243. It returns true if the target supports GNU indirect functions. The
  34244. support includes the assembler, linker and dynamic linker. The
  34245. default value of this hook is based on target's libc.
  34246. -- Target Hook: unsigned int TARGET_ATOMIC_ALIGN_FOR_MODE (machine_mode
  34247. MODE)
  34248. If defined, this function returns an appropriate alignment in bits
  34249. for an atomic object of machine_mode MODE. If 0 is returned then
  34250. the default alignment for the specified mode is used.
  34251. -- Target Hook: void TARGET_ATOMIC_ASSIGN_EXPAND_FENV (tree *HOLD, tree
  34252. *CLEAR, tree *UPDATE)
  34253. ISO C11 requires atomic compound assignments that may raise
  34254. floating-point exceptions to raise exceptions corresponding to the
  34255. arithmetic operation whose result was successfully stored in a
  34256. compare-and-exchange sequence. This requires code equivalent to
  34257. calls to 'feholdexcept', 'feclearexcept' and 'feupdateenv' to be
  34258. generated at appropriate points in the compare-and-exchange
  34259. sequence. This hook should set '*HOLD' to an expression equivalent
  34260. to the call to 'feholdexcept', '*CLEAR' to an expression equivalent
  34261. to the call to 'feclearexcept' and '*UPDATE' to an expression
  34262. equivalent to the call to 'feupdateenv'. The three expressions are
  34263. 'NULL_TREE' on entry to the hook and may be left as 'NULL_TREE' if
  34264. no code is required in a particular place. The default
  34265. implementation leaves all three expressions as 'NULL_TREE'. The
  34266. '__atomic_feraiseexcept' function from 'libatomic' may be of use as
  34267. part of the code generated in '*UPDATE'.
  34268. -- Target Hook: void TARGET_RECORD_OFFLOAD_SYMBOL (tree)
  34269. Used when offloaded functions are seen in the compilation unit and
  34270. no named sections are available. It is called once for each symbol
  34271. that must be recorded in the offload function and variable table.
  34272. -- Target Hook: char * TARGET_OFFLOAD_OPTIONS (void)
  34273. Used when writing out the list of options into an LTO file. It
  34274. should translate any relevant target-specific options (such as the
  34275. ABI in use) into one of the '-foffload' options that exist as a
  34276. common interface to express such options. It should return a
  34277. string containing these options, separated by spaces, which the
  34278. caller will free.
  34279. -- Macro: TARGET_SUPPORTS_WIDE_INT
  34280. On older ports, large integers are stored in 'CONST_DOUBLE' rtl
  34281. objects. Newer ports define 'TARGET_SUPPORTS_WIDE_INT' to be
  34282. nonzero to indicate that large integers are stored in
  34283. 'CONST_WIDE_INT' rtl objects. The 'CONST_WIDE_INT' allows very
  34284. large integer constants to be represented. 'CONST_DOUBLE' is
  34285. limited to twice the size of the host's 'HOST_WIDE_INT'
  34286. representation.
  34287. Converting a port mostly requires looking for the places where
  34288. 'CONST_DOUBLE's are used with 'VOIDmode' and replacing that code
  34289. with code that accesses 'CONST_WIDE_INT's. '"grep -i
  34290. const_double"' at the port level gets you to 95% of the changes
  34291. that need to be made. There are a few places that require a deeper
  34292. look.
  34293. * There is no equivalent to 'hval' and 'lval' for
  34294. 'CONST_WIDE_INT's. This would be difficult to express in the
  34295. md language since there are a variable number of elements.
  34296. Most ports only check that 'hval' is either 0 or -1 to see if
  34297. the value is small. As mentioned above, this will no longer
  34298. be necessary since small constants are always 'CONST_INT'. Of
  34299. course there are still a few exceptions, the alpha's
  34300. constraint used by the zap instruction certainly requires
  34301. careful examination by C code. However, all the current code
  34302. does is pass the hval and lval to C code, so evolving the c
  34303. code to look at the 'CONST_WIDE_INT' is not really a large
  34304. change.
  34305. * Because there is no standard template that ports use to
  34306. materialize constants, there is likely to be some futzing that
  34307. is unique to each port in this code.
  34308. * The rtx costs may have to be adjusted to properly account for
  34309. larger constants that are represented as 'CONST_WIDE_INT'.
  34310. All and all it does not take long to convert ports that the
  34311. maintainer is familiar with.
  34312. -- Target Hook: bool TARGET_HAVE_SPECULATION_SAFE_VALUE (bool ACTIVE)
  34313. This hook is used to determine the level of target support for
  34314. '__builtin_speculation_safe_value'. If called with an argument of
  34315. false, it returns true if the target has been modified to support
  34316. this builtin. If called with an argument of true, it returns true
  34317. if the target requires active mitigation execution might be
  34318. speculative.
  34319. The default implementation returns false if the target does not
  34320. define a pattern named 'speculation_barrier'. Else it returns true
  34321. for the first case and whether the pattern is enabled for the
  34322. current compilation for the second case.
  34323. For targets that have no processors that can execute instructions
  34324. speculatively an alternative implemenation of this hook is
  34325. available: simply redefine this hook to
  34326. 'speculation_safe_value_not_needed' along with your other target
  34327. hooks.
  34328. -- Target Hook: rtx TARGET_SPECULATION_SAFE_VALUE (machine_mode MODE,
  34329. rtx RESULT, rtx VAL, rtx FAILVAL)
  34330. This target hook can be used to generate a target-specific code
  34331. sequence that implements the '__builtin_speculation_safe_value'
  34332. built-in function. The function must always return VAL in RESULT
  34333. in mode MODE when the cpu is not executing speculatively, but must
  34334. never return that when speculating until it is known that the
  34335. speculation will not be unwound. The hook supports two primary
  34336. mechanisms for implementing the requirements. The first is to emit
  34337. a speculation barrier which forces the processor to wait until all
  34338. prior speculative operations have been resolved; the second is to
  34339. use a target-specific mechanism that can track the speculation
  34340. state and to return FAILVAL if it can determine that speculation
  34341. must be unwound at a later time.
  34342. The default implementation simply copies VAL to RESULT and emits a
  34343. 'speculation_barrier' instruction if that is defined.
  34344. -- Target Hook: void TARGET_RUN_TARGET_SELFTESTS (void)
  34345. If selftests are enabled, run any selftests for this target.
  34346. 
  34347. File: gccint.info, Node: Host Config, Next: Fragments, Prev: Target Macros, Up: Top
  34348. 19 Host Configuration
  34349. *********************
  34350. Most details about the machine and system on which the compiler is
  34351. actually running are detected by the 'configure' script. Some things
  34352. are impossible for 'configure' to detect; these are described in two
  34353. ways, either by macros defined in a file named 'xm-MACHINE.h' or by hook
  34354. functions in the file specified by the OUT_HOST_HOOK_OBJ variable in
  34355. 'config.gcc'. (The intention is that very few hosts will need a header
  34356. file but nearly every fully supported host will need to override some
  34357. hooks.)
  34358. If you need to define only a few macros, and they have simple
  34359. definitions, consider using the 'xm_defines' variable in your
  34360. 'config.gcc' entry instead of creating a host configuration header.
  34361. *Note System Config::.
  34362. * Menu:
  34363. * Host Common:: Things every host probably needs implemented.
  34364. * Filesystem:: Your host cannot have the letter 'a' in filenames?
  34365. * Host Misc:: Rare configuration options for hosts.
  34366. 
  34367. File: gccint.info, Node: Host Common, Next: Filesystem, Up: Host Config
  34368. 19.1 Host Common
  34369. ================
  34370. Some things are just not portable, even between similar operating
  34371. systems, and are too difficult for autoconf to detect. They get
  34372. implemented using hook functions in the file specified by the
  34373. HOST_HOOK_OBJ variable in 'config.gcc'.
  34374. -- Host Hook: void HOST_HOOKS_EXTRA_SIGNALS (void)
  34375. This host hook is used to set up handling for extra signals. The
  34376. most common thing to do in this hook is to detect stack overflow.
  34377. -- Host Hook: void * HOST_HOOKS_GT_PCH_GET_ADDRESS (size_t SIZE, int
  34378. FD)
  34379. This host hook returns the address of some space that is likely to
  34380. be free in some subsequent invocation of the compiler. We intend
  34381. to load the PCH data at this address such that the data need not be
  34382. relocated. The area should be able to hold SIZE bytes. If the
  34383. host uses 'mmap', FD is an open file descriptor that can be used
  34384. for probing.
  34385. -- Host Hook: int HOST_HOOKS_GT_PCH_USE_ADDRESS (void * ADDRESS, size_t
  34386. SIZE, int FD, size_t OFFSET)
  34387. This host hook is called when a PCH file is about to be loaded. We
  34388. want to load SIZE bytes from FD at OFFSET into memory at ADDRESS.
  34389. The given address will be the result of a previous invocation of
  34390. 'HOST_HOOKS_GT_PCH_GET_ADDRESS'. Return -1 if we couldn't allocate
  34391. SIZE bytes at ADDRESS. Return 0 if the memory is allocated but the
  34392. data is not loaded. Return 1 if the hook has performed everything.
  34393. If the implementation uses reserved address space, free any
  34394. reserved space beyond SIZE, regardless of the return value. If no
  34395. PCH will be loaded, this hook may be called with SIZE zero, in
  34396. which case all reserved address space should be freed.
  34397. Do not try to handle values of ADDRESS that could not have been
  34398. returned by this executable; just return -1. Such values usually
  34399. indicate an out-of-date PCH file (built by some other GCC
  34400. executable), and such a PCH file won't work.
  34401. -- Host Hook: size_t HOST_HOOKS_GT_PCH_ALLOC_GRANULARITY (void);
  34402. This host hook returns the alignment required for allocating
  34403. virtual memory. Usually this is the same as getpagesize, but on
  34404. some hosts the alignment for reserving memory differs from the
  34405. pagesize for committing memory.
  34406. 
  34407. File: gccint.info, Node: Filesystem, Next: Host Misc, Prev: Host Common, Up: Host Config
  34408. 19.2 Host Filesystem
  34409. ====================
  34410. GCC needs to know a number of things about the semantics of the host
  34411. machine's filesystem. Filesystems with Unix and MS-DOS semantics are
  34412. automatically detected. For other systems, you can define the following
  34413. macros in 'xm-MACHINE.h'.
  34414. 'HAVE_DOS_BASED_FILE_SYSTEM'
  34415. This macro is automatically defined by 'system.h' if the host file
  34416. system obeys the semantics defined by MS-DOS instead of Unix. DOS
  34417. file systems are case insensitive, file specifications may begin
  34418. with a drive letter, and both forward slash and backslash ('/' and
  34419. '\') are directory separators.
  34420. 'DIR_SEPARATOR'
  34421. 'DIR_SEPARATOR_2'
  34422. If defined, these macros expand to character constants specifying
  34423. separators for directory names within a file specification.
  34424. 'system.h' will automatically give them appropriate values on Unix
  34425. and MS-DOS file systems. If your file system is neither of these,
  34426. define one or both appropriately in 'xm-MACHINE.h'.
  34427. However, operating systems like VMS, where constructing a pathname
  34428. is more complicated than just stringing together directory names
  34429. separated by a special character, should not define either of these
  34430. macros.
  34431. 'PATH_SEPARATOR'
  34432. If defined, this macro should expand to a character constant
  34433. specifying the separator for elements of search paths. The default
  34434. value is a colon (':'). DOS-based systems usually, but not always,
  34435. use semicolon (';').
  34436. 'VMS'
  34437. Define this macro if the host system is VMS.
  34438. 'HOST_OBJECT_SUFFIX'
  34439. Define this macro to be a C string representing the suffix for
  34440. object files on your host machine. If you do not define this
  34441. macro, GCC will use '.o' as the suffix for object files.
  34442. 'HOST_EXECUTABLE_SUFFIX'
  34443. Define this macro to be a C string representing the suffix for
  34444. executable files on your host machine. If you do not define this
  34445. macro, GCC will use the null string as the suffix for executable
  34446. files.
  34447. 'HOST_BIT_BUCKET'
  34448. A pathname defined by the host operating system, which can be
  34449. opened as a file and written to, but all the information written is
  34450. discarded. This is commonly known as a "bit bucket" or "null
  34451. device". If you do not define this macro, GCC will use '/dev/null'
  34452. as the bit bucket. If the host does not support a bit bucket,
  34453. define this macro to an invalid filename.
  34454. 'UPDATE_PATH_HOST_CANONICALIZE (PATH)'
  34455. If defined, a C statement (sans semicolon) that performs
  34456. host-dependent canonicalization when a path used in a compilation
  34457. driver or preprocessor is canonicalized. PATH is a malloc-ed path
  34458. to be canonicalized. If the C statement does canonicalize PATH
  34459. into a different buffer, the old path should be freed and the new
  34460. buffer should have been allocated with malloc.
  34461. 'DUMPFILE_FORMAT'
  34462. Define this macro to be a C string representing the format to use
  34463. for constructing the index part of debugging dump file names. The
  34464. resultant string must fit in fifteen bytes. The full filename will
  34465. be the concatenation of: the prefix of the assembler file name, the
  34466. string resulting from applying this format to an index number, and
  34467. a string unique to each dump file kind, e.g. 'rtl'.
  34468. If you do not define this macro, GCC will use '.%02d.'. You should
  34469. define this macro if using the default will create an invalid file
  34470. name.
  34471. 'DELETE_IF_ORDINARY'
  34472. Define this macro to be a C statement (sans semicolon) that
  34473. performs host-dependent removal of ordinary temp files in the
  34474. compilation driver.
  34475. If you do not define this macro, GCC will use the default version.
  34476. You should define this macro if the default version does not
  34477. reliably remove the temp file as, for example, on VMS which allows
  34478. multiple versions of a file.
  34479. 'HOST_LACKS_INODE_NUMBERS'
  34480. Define this macro if the host filesystem does not report meaningful
  34481. inode numbers in struct stat.
  34482. 
  34483. File: gccint.info, Node: Host Misc, Prev: Filesystem, Up: Host Config
  34484. 19.3 Host Misc
  34485. ==============
  34486. 'FATAL_EXIT_CODE'
  34487. A C expression for the status code to be returned when the compiler
  34488. exits after serious errors. The default is the system-provided
  34489. macro 'EXIT_FAILURE', or '1' if the system doesn't define that
  34490. macro. Define this macro only if these defaults are incorrect.
  34491. 'SUCCESS_EXIT_CODE'
  34492. A C expression for the status code to be returned when the compiler
  34493. exits without serious errors. (Warnings are not serious errors.)
  34494. The default is the system-provided macro 'EXIT_SUCCESS', or '0' if
  34495. the system doesn't define that macro. Define this macro only if
  34496. these defaults are incorrect.
  34497. 'USE_C_ALLOCA'
  34498. Define this macro if GCC should use the C implementation of
  34499. 'alloca' provided by 'libiberty.a'. This only affects how some
  34500. parts of the compiler itself allocate memory. It does not change
  34501. code generation.
  34502. When GCC is built with a compiler other than itself, the C 'alloca'
  34503. is always used. This is because most other implementations have
  34504. serious bugs. You should define this macro only on a system where
  34505. no stack-based 'alloca' can possibly work. For instance, if a
  34506. system has a small limit on the size of the stack, GCC's builtin
  34507. 'alloca' will not work reliably.
  34508. 'COLLECT2_HOST_INITIALIZATION'
  34509. If defined, a C statement (sans semicolon) that performs
  34510. host-dependent initialization when 'collect2' is being initialized.
  34511. 'GCC_DRIVER_HOST_INITIALIZATION'
  34512. If defined, a C statement (sans semicolon) that performs
  34513. host-dependent initialization when a compilation driver is being
  34514. initialized.
  34515. 'HOST_LONG_LONG_FORMAT'
  34516. If defined, the string used to indicate an argument of type 'long
  34517. long' to functions like 'printf'. The default value is '"ll"'.
  34518. 'HOST_LONG_FORMAT'
  34519. If defined, the string used to indicate an argument of type 'long'
  34520. to functions like 'printf'. The default value is '"l"'.
  34521. 'HOST_PTR_PRINTF'
  34522. If defined, the string used to indicate an argument of type 'void
  34523. *' to functions like 'printf'. The default value is '"%p"'.
  34524. In addition, if 'configure' generates an incorrect definition of any of
  34525. the macros in 'auto-host.h', you can override that definition in a host
  34526. configuration header. If you need to do this, first see if it is
  34527. possible to fix 'configure'.
  34528. 
  34529. File: gccint.info, Node: Fragments, Next: Collect2, Prev: Host Config, Up: Top
  34530. 20 Makefile Fragments
  34531. *********************
  34532. When you configure GCC using the 'configure' script, it will construct
  34533. the file 'Makefile' from the template file 'Makefile.in'. When it does
  34534. this, it can incorporate makefile fragments from the 'config' directory.
  34535. These are used to set Makefile parameters that are not amenable to being
  34536. calculated by autoconf. The list of fragments to incorporate is set by
  34537. 'config.gcc' (and occasionally 'config.build' and 'config.host'); *Note
  34538. System Config::.
  34539. Fragments are named either 't-TARGET' or 'x-HOST', depending on whether
  34540. they are relevant to configuring GCC to produce code for a particular
  34541. target, or to configuring GCC to run on a particular host. Here TARGET
  34542. and HOST are mnemonics which usually have some relationship to the
  34543. canonical system name, but no formal connection.
  34544. If these files do not exist, it means nothing needs to be added for a
  34545. given target or host. Most targets need a few 't-TARGET' fragments, but
  34546. needing 'x-HOST' fragments is rare.
  34547. * Menu:
  34548. * Target Fragment:: Writing 't-TARGET' files.
  34549. * Host Fragment:: Writing 'x-HOST' files.
  34550. 
  34551. File: gccint.info, Node: Target Fragment, Next: Host Fragment, Up: Fragments
  34552. 20.1 Target Makefile Fragments
  34553. ==============================
  34554. Target makefile fragments can set these Makefile variables.
  34555. 'LIBGCC2_CFLAGS'
  34556. Compiler flags to use when compiling 'libgcc2.c'.
  34557. 'LIB2FUNCS_EXTRA'
  34558. A list of source file names to be compiled or assembled and
  34559. inserted into 'libgcc.a'.
  34560. 'CRTSTUFF_T_CFLAGS'
  34561. Special flags used when compiling 'crtstuff.c'. *Note
  34562. Initialization::.
  34563. 'CRTSTUFF_T_CFLAGS_S'
  34564. Special flags used when compiling 'crtstuff.c' for shared linking.
  34565. Used if you use 'crtbeginS.o' and 'crtendS.o' in 'EXTRA-PARTS'.
  34566. *Note Initialization::.
  34567. 'MULTILIB_OPTIONS'
  34568. For some targets, invoking GCC in different ways produces objects
  34569. that cannot be linked together. For example, for some targets GCC
  34570. produces both big and little endian code. For these targets, you
  34571. must arrange for multiple versions of 'libgcc.a' to be compiled,
  34572. one for each set of incompatible options. When GCC invokes the
  34573. linker, it arranges to link in the right version of 'libgcc.a',
  34574. based on the command line options used.
  34575. The 'MULTILIB_OPTIONS' macro lists the set of options for which
  34576. special versions of 'libgcc.a' must be built. Write options that
  34577. are mutually incompatible side by side, separated by a slash.
  34578. Write options that may be used together separated by a space. The
  34579. build procedure will build all combinations of compatible options.
  34580. For example, if you set 'MULTILIB_OPTIONS' to 'm68000/m68020
  34581. msoft-float', 'Makefile' will build special versions of 'libgcc.a'
  34582. using the following sets of options: '-m68000', '-m68020',
  34583. '-msoft-float', '-m68000 -msoft-float', and '-m68020 -msoft-float'.
  34584. 'MULTILIB_DIRNAMES'
  34585. If 'MULTILIB_OPTIONS' is used, this variable specifies the
  34586. directory names that should be used to hold the various libraries.
  34587. Write one element in 'MULTILIB_DIRNAMES' for each element in
  34588. 'MULTILIB_OPTIONS'. If 'MULTILIB_DIRNAMES' is not used, the
  34589. default value will be 'MULTILIB_OPTIONS', with all slashes treated
  34590. as spaces.
  34591. 'MULTILIB_DIRNAMES' describes the multilib directories using GCC
  34592. conventions and is applied to directories that are part of the GCC
  34593. installation. When multilib-enabled, the compiler will add a
  34594. subdirectory of the form PREFIX/MULTILIB before each directory in
  34595. the search path for libraries and crt files.
  34596. For example, if 'MULTILIB_OPTIONS' is set to 'm68000/m68020
  34597. msoft-float', then the default value of 'MULTILIB_DIRNAMES' is
  34598. 'm68000 m68020 msoft-float'. You may specify a different value if
  34599. you desire a different set of directory names.
  34600. 'MULTILIB_MATCHES'
  34601. Sometimes the same option may be written in two different ways. If
  34602. an option is listed in 'MULTILIB_OPTIONS', GCC needs to know about
  34603. any synonyms. In that case, set 'MULTILIB_MATCHES' to a list of
  34604. items of the form 'option=option' to describe all relevant
  34605. synonyms. For example, 'm68000=mc68000 m68020=mc68020'.
  34606. 'MULTILIB_EXCEPTIONS'
  34607. Sometimes when there are multiple sets of 'MULTILIB_OPTIONS' being
  34608. specified, there are combinations that should not be built. In
  34609. that case, set 'MULTILIB_EXCEPTIONS' to be all of the switch
  34610. exceptions in shell case syntax that should not be built.
  34611. For example the ARM processor cannot execute both hardware floating
  34612. point instructions and the reduced size THUMB instructions at the
  34613. same time, so there is no need to build libraries with both of
  34614. these options enabled. Therefore 'MULTILIB_EXCEPTIONS' is set to:
  34615. *mthumb/*mhard-float*
  34616. 'MULTILIB_REQUIRED'
  34617. Sometimes when there are only a few combinations are required, it
  34618. would be a big effort to come up with a 'MULTILIB_EXCEPTIONS' list
  34619. to cover all undesired ones. In such a case, just listing all the
  34620. required combinations in 'MULTILIB_REQUIRED' would be more
  34621. straightforward.
  34622. The way to specify the entries in 'MULTILIB_REQUIRED' is same with
  34623. the way used for 'MULTILIB_EXCEPTIONS', only this time what are
  34624. required will be specified. Suppose there are multiple sets of
  34625. 'MULTILIB_OPTIONS' and only two combinations are required, one for
  34626. ARMv7-M and one for ARMv7-R with hard floating-point ABI and FPU,
  34627. the 'MULTILIB_REQUIRED' can be set to:
  34628. MULTILIB_REQUIRED = mthumb/march=armv7-m
  34629. MULTILIB_REQUIRED += march=armv7-r/mfloat-abi=hard/mfpu=vfpv3-d16
  34630. The 'MULTILIB_REQUIRED' can be used together with
  34631. 'MULTILIB_EXCEPTIONS'. The option combinations generated from
  34632. 'MULTILIB_OPTIONS' will be filtered by 'MULTILIB_EXCEPTIONS' and
  34633. then by 'MULTILIB_REQUIRED'.
  34634. 'MULTILIB_REUSE'
  34635. Sometimes it is desirable to reuse one existing multilib for
  34636. different sets of options. Such kind of reuse can minimize the
  34637. number of multilib variants. And for some targets it is better to
  34638. reuse an existing multilib than to fall back to default multilib
  34639. when there is no corresponding multilib. This can be done by
  34640. adding reuse rules to 'MULTILIB_REUSE'.
  34641. A reuse rule is comprised of two parts connected by equality sign.
  34642. The left part is the option set used to build multilib and the
  34643. right part is the option set that will reuse this multilib. Both
  34644. parts should only use options specified in 'MULTILIB_OPTIONS' and
  34645. the equality signs found in options name should be replaced with
  34646. periods. An explicit period in the rule can be escaped by
  34647. preceding it with a backslash. The order of options in the left
  34648. part matters and should be same with those specified in
  34649. 'MULTILIB_REQUIRED' or aligned with the order in
  34650. 'MULTILIB_OPTIONS'. There is no such limitation for options in the
  34651. right part as we don't build multilib from them.
  34652. 'MULTILIB_REUSE' is different from 'MULTILIB_MATCHES' in that it
  34653. sets up relations between two option sets rather than two options.
  34654. Here is an example to demo how we reuse libraries built in Thumb
  34655. mode for applications built in ARM mode:
  34656. MULTILIB_REUSE = mthumb/march.armv7-r=marm/march.armv7-r
  34657. Before the advent of 'MULTILIB_REUSE', GCC select multilib by
  34658. comparing command line options with options used to build multilib.
  34659. The 'MULTILIB_REUSE' is complementary to that way. Only when the
  34660. original comparison matches nothing it will work to see if it is OK
  34661. to reuse some existing multilib.
  34662. 'MULTILIB_EXTRA_OPTS'
  34663. Sometimes it is desirable that when building multiple versions of
  34664. 'libgcc.a' certain options should always be passed on to the
  34665. compiler. In that case, set 'MULTILIB_EXTRA_OPTS' to be the list
  34666. of options to be used for all builds. If you set this, you should
  34667. probably set 'CRTSTUFF_T_CFLAGS' to a dash followed by it.
  34668. 'MULTILIB_OSDIRNAMES'
  34669. If 'MULTILIB_OPTIONS' is used, this variable specifies a list of
  34670. subdirectory names, that are used to modify the search path
  34671. depending on the chosen multilib. Unlike 'MULTILIB_DIRNAMES',
  34672. 'MULTILIB_OSDIRNAMES' describes the multilib directories using
  34673. operating systems conventions, and is applied to the directories
  34674. such as 'lib' or those in the 'LIBRARY_PATH' environment variable.
  34675. The format is either the same as of 'MULTILIB_DIRNAMES', or a set
  34676. of mappings. When it is the same as 'MULTILIB_DIRNAMES', it
  34677. describes the multilib directories using operating system
  34678. conventions, rather than GCC conventions. When it is a set of
  34679. mappings of the form GCCDIR=OSDIR, the left side gives the GCC
  34680. convention and the right gives the equivalent OS defined location.
  34681. If the OSDIR part begins with a '!', GCC will not search in the
  34682. non-multilib directory and use exclusively the multilib directory.
  34683. Otherwise, the compiler will examine the search path for libraries
  34684. and crt files twice; the first time it will add MULTILIB to each
  34685. directory in the search path, the second it will not.
  34686. For configurations that support both multilib and multiarch,
  34687. 'MULTILIB_OSDIRNAMES' also encodes the multiarch name, thus
  34688. subsuming 'MULTIARCH_DIRNAME'. The multiarch name is appended to
  34689. each directory name, separated by a colon (e.g.
  34690. '../lib32:i386-linux-gnu').
  34691. Each multiarch subdirectory will be searched before the
  34692. corresponding OS multilib directory, for example
  34693. '/lib/i386-linux-gnu' before '/lib/../lib32'. The multiarch name
  34694. will also be used to modify the system header search path, as
  34695. explained for 'MULTIARCH_DIRNAME'.
  34696. 'MULTIARCH_DIRNAME'
  34697. This variable specifies the multiarch name for configurations that
  34698. are multiarch-enabled but not multilibbed configurations.
  34699. The multiarch name is used to augment the search path for
  34700. libraries, crt files and system header files with additional
  34701. locations. The compiler will add a multiarch subdirectory of the
  34702. form PREFIX/MULTIARCH before each directory in the library and crt
  34703. search path. It will also add two directories
  34704. 'LOCAL_INCLUDE_DIR'/MULTIARCH and
  34705. 'NATIVE_SYSTEM_HEADER_DIR'/MULTIARCH) to the system header search
  34706. path, respectively before 'LOCAL_INCLUDE_DIR' and
  34707. 'NATIVE_SYSTEM_HEADER_DIR'.
  34708. 'MULTIARCH_DIRNAME' is not used for configurations that support
  34709. both multilib and multiarch. In that case, multiarch names are
  34710. encoded in 'MULTILIB_OSDIRNAMES' instead.
  34711. More documentation about multiarch can be found at
  34712. <https://wiki.debian.org/Multiarch>.
  34713. 'SPECS'
  34714. Unfortunately, setting 'MULTILIB_EXTRA_OPTS' is not enough, since
  34715. it does not affect the build of target libraries, at least not the
  34716. build of the default multilib. One possible work-around is to use
  34717. 'DRIVER_SELF_SPECS' to bring options from the 'specs' file as if
  34718. they had been passed in the compiler driver command line. However,
  34719. you don't want to be adding these options after the toolchain is
  34720. installed, so you can instead tweak the 'specs' file that will be
  34721. used during the toolchain build, while you still install the
  34722. original, built-in 'specs'. The trick is to set 'SPECS' to some
  34723. other filename (say 'specs.install'), that will then be created out
  34724. of the built-in specs, and introduce a 'Makefile' rule to generate
  34725. the 'specs' file that's going to be used at build time out of your
  34726. 'specs.install'.
  34727. 'T_CFLAGS'
  34728. These are extra flags to pass to the C compiler. They are used
  34729. both when building GCC, and when compiling things with the
  34730. just-built GCC. This variable is deprecated and should not be
  34731. used.
  34732. 
  34733. File: gccint.info, Node: Host Fragment, Prev: Target Fragment, Up: Fragments
  34734. 20.2 Host Makefile Fragments
  34735. ============================
  34736. The use of 'x-HOST' fragments is discouraged. You should only use it
  34737. for makefile dependencies.
  34738. 
  34739. File: gccint.info, Node: Collect2, Next: Header Dirs, Prev: Fragments, Up: Top
  34740. 21 'collect2'
  34741. *************
  34742. GCC uses a utility called 'collect2' on nearly all systems to arrange to
  34743. call various initialization functions at start time.
  34744. The program 'collect2' works by linking the program once and looking
  34745. through the linker output file for symbols with particular names
  34746. indicating they are constructor functions. If it finds any, it creates
  34747. a new temporary '.c' file containing a table of them, compiles it, and
  34748. links the program a second time including that file.
  34749. The actual calls to the constructors are carried out by a subroutine
  34750. called '__main', which is called (automatically) at the beginning of the
  34751. body of 'main' (provided 'main' was compiled with GNU CC). Calling
  34752. '__main' is necessary, even when compiling C code, to allow linking C
  34753. and C++ object code together. (If you use '-nostdlib', you get an
  34754. unresolved reference to '__main', since it's defined in the standard GCC
  34755. library. Include '-lgcc' at the end of your compiler command line to
  34756. resolve this reference.)
  34757. The program 'collect2' is installed as 'ld' in the directory where the
  34758. passes of the compiler are installed. When 'collect2' needs to find the
  34759. _real_ 'ld', it tries the following file names:
  34760. * a hard coded linker file name, if GCC was configured with the
  34761. '--with-ld' option.
  34762. * 'real-ld' in the directories listed in the compiler's search
  34763. directories.
  34764. * 'real-ld' in the directories listed in the environment variable
  34765. 'PATH'.
  34766. * The file specified in the 'REAL_LD_FILE_NAME' configuration macro,
  34767. if specified.
  34768. * 'ld' in the compiler's search directories, except that 'collect2'
  34769. will not execute itself recursively.
  34770. * 'ld' in 'PATH'.
  34771. "The compiler's search directories" means all the directories where
  34772. 'gcc' searches for passes of the compiler. This includes directories
  34773. that you specify with '-B'.
  34774. Cross-compilers search a little differently:
  34775. * 'real-ld' in the compiler's search directories.
  34776. * 'TARGET-real-ld' in 'PATH'.
  34777. * The file specified in the 'REAL_LD_FILE_NAME' configuration macro,
  34778. if specified.
  34779. * 'ld' in the compiler's search directories.
  34780. * 'TARGET-ld' in 'PATH'.
  34781. 'collect2' explicitly avoids running 'ld' using the file name under
  34782. which 'collect2' itself was invoked. In fact, it remembers up a list of
  34783. such names--in case one copy of 'collect2' finds another copy (or
  34784. version) of 'collect2' installed as 'ld' in a second place in the search
  34785. path.
  34786. 'collect2' searches for the utilities 'nm' and 'strip' using the same
  34787. algorithm as above for 'ld'.
  34788. 
  34789. File: gccint.info, Node: Header Dirs, Next: Type Information, Prev: Collect2, Up: Top
  34790. 22 Standard Header File Directories
  34791. ***********************************
  34792. 'GCC_INCLUDE_DIR' means the same thing for native and cross. It is
  34793. where GCC stores its private include files, and also where GCC stores
  34794. the fixed include files. A cross compiled GCC runs 'fixincludes' on the
  34795. header files in '$(tooldir)/include'. (If the cross compilation header
  34796. files need to be fixed, they must be installed before GCC is built. If
  34797. the cross compilation header files are already suitable for GCC, nothing
  34798. special need be done).
  34799. 'GPLUSPLUS_INCLUDE_DIR' means the same thing for native and cross. It
  34800. is where 'g++' looks first for header files. The C++ library installs
  34801. only target independent header files in that directory.
  34802. 'LOCAL_INCLUDE_DIR' is used only by native compilers. GCC doesn't
  34803. install anything there. It is normally '/usr/local/include'. This is
  34804. where local additions to a packaged system should place header files.
  34805. 'CROSS_INCLUDE_DIR' is used only by cross compilers. GCC doesn't
  34806. install anything there.
  34807. 'TOOL_INCLUDE_DIR' is used for both native and cross compilers. It is
  34808. the place for other packages to install header files that GCC will use.
  34809. For a cross-compiler, this is the equivalent of '/usr/include'. When
  34810. you build a cross-compiler, 'fixincludes' processes any header files in
  34811. this directory.
  34812. 
  34813. File: gccint.info, Node: Type Information, Next: Plugins, Prev: Header Dirs, Up: Top
  34814. 23 Memory Management and Type Information
  34815. *****************************************
  34816. GCC uses some fairly sophisticated memory management techniques, which
  34817. involve determining information about GCC's data structures from GCC's
  34818. source code and using this information to perform garbage collection and
  34819. implement precompiled headers.
  34820. A full C++ parser would be too complicated for this task, so a limited
  34821. subset of C++ is interpreted and special markers are used to determine
  34822. what parts of the source to look at. All 'struct', 'union' and
  34823. 'template' structure declarations that define data structures that are
  34824. allocated under control of the garbage collector must be marked. All
  34825. global variables that hold pointers to garbage-collected memory must
  34826. also be marked. Finally, all global variables that need to be saved and
  34827. restored by a precompiled header must be marked. (The precompiled
  34828. header mechanism can only save static variables if they're scalar.
  34829. Complex data structures must be allocated in garbage-collected memory to
  34830. be saved in a precompiled header.)
  34831. The full format of a marker is
  34832. GTY (([OPTION] [(PARAM)], [OPTION] [(PARAM)] ...))
  34833. but in most cases no options are needed. The outer double parentheses
  34834. are still necessary, though: 'GTY(())'. Markers can appear:
  34835. * In a structure definition, before the open brace;
  34836. * In a global variable declaration, after the keyword 'static' or
  34837. 'extern'; and
  34838. * In a structure field definition, before the name of the field.
  34839. Here are some examples of marking simple data structures and globals.
  34840. struct GTY(()) TAG
  34841. {
  34842. FIELDS...
  34843. };
  34844. typedef struct GTY(()) TAG
  34845. {
  34846. FIELDS...
  34847. } *TYPENAME;
  34848. static GTY(()) struct TAG *LIST; /* points to GC memory */
  34849. static GTY(()) int COUNTER; /* save counter in a PCH */
  34850. The parser understands simple typedefs such as 'typedef struct TAG
  34851. *NAME;' and 'typedef int NAME;'. These don't need to be marked.
  34852. Since 'gengtype''s understanding of C++ is limited, there are several
  34853. constructs and declarations that are not supported inside
  34854. classes/structures marked for automatic GC code generation. The
  34855. following C++ constructs produce a 'gengtype' error on
  34856. structures/classes marked for automatic GC code generation:
  34857. * Type definitions inside classes/structures are not supported.
  34858. * Enumerations inside classes/structures are not supported.
  34859. If you have a class or structure using any of the above constructs, you
  34860. need to mark that class as 'GTY ((user))' and provide your own marking
  34861. routines (see section *note User GC:: for details).
  34862. It is always valid to include function definitions inside classes.
  34863. Those are always ignored by 'gengtype', as it only cares about data
  34864. members.
  34865. * Menu:
  34866. * GTY Options:: What goes inside a 'GTY(())'.
  34867. * Inheritance and GTY:: Adding GTY to a class hierarchy.
  34868. * User GC:: Adding user-provided GC marking routines.
  34869. * GGC Roots:: Making global variables GGC roots.
  34870. * Files:: How the generated files work.
  34871. * Invoking the garbage collector:: How to invoke the garbage collector.
  34872. * Troubleshooting:: When something does not work as expected.
  34873. 
  34874. File: gccint.info, Node: GTY Options, Next: Inheritance and GTY, Up: Type Information
  34875. 23.1 The Inside of a 'GTY(())'
  34876. ==============================
  34877. Sometimes the C code is not enough to fully describe the type structure.
  34878. Extra information can be provided with 'GTY' options and additional
  34879. markers. Some options take a parameter, which may be either a string or
  34880. a type name, depending on the parameter. If an option takes no
  34881. parameter, it is acceptable either to omit the parameter entirely, or to
  34882. provide an empty string as a parameter. For example, 'GTY ((skip))' and
  34883. 'GTY ((skip ("")))' are equivalent.
  34884. When the parameter is a string, often it is a fragment of C code. Four
  34885. special escapes may be used in these strings, to refer to pieces of the
  34886. data structure being marked:
  34887. '%h'
  34888. The current structure.
  34889. '%1'
  34890. The structure that immediately contains the current structure.
  34891. '%0'
  34892. The outermost structure that contains the current structure.
  34893. '%a'
  34894. A partial expression of the form '[i1][i2]...' that indexes the
  34895. array item currently being marked.
  34896. For instance, suppose that you have a structure of the form
  34897. struct A {
  34898. ...
  34899. };
  34900. struct B {
  34901. struct A foo[12];
  34902. };
  34903. and 'b' is a variable of type 'struct B'. When marking 'b.foo[11]',
  34904. '%h' would expand to 'b.foo[11]', '%0' and '%1' would both expand to
  34905. 'b', and '%a' would expand to '[11]'.
  34906. As in ordinary C, adjacent strings will be concatenated; this is
  34907. helpful when you have a complicated expression.
  34908. GTY ((chain_next ("TREE_CODE (&%h.generic) == INTEGER_TYPE"
  34909. " ? TYPE_NEXT_VARIANT (&%h.generic)"
  34910. " : TREE_CHAIN (&%h.generic)")))
  34911. The available options are:
  34912. 'length ("EXPRESSION")'
  34913. There are two places the type machinery will need to be explicitly
  34914. told the length of an array of non-atomic objects. The first case
  34915. is when a structure ends in a variable-length array, like this:
  34916. struct GTY(()) rtvec_def {
  34917. int num_elem; /* number of elements */
  34918. rtx GTY ((length ("%h.num_elem"))) elem[1];
  34919. };
  34920. In this case, the 'length' option is used to override the specified
  34921. array length (which should usually be '1'). The parameter of the
  34922. option is a fragment of C code that calculates the length.
  34923. The second case is when a structure or a global variable contains a
  34924. pointer to an array, like this:
  34925. struct gimple_omp_for_iter * GTY((length ("%h.collapse"))) iter;
  34926. In this case, 'iter' has been allocated by writing something like
  34927. x->iter = ggc_alloc_cleared_vec_gimple_omp_for_iter (collapse);
  34928. and the 'collapse' provides the length of the field.
  34929. This second use of 'length' also works on global variables, like:
  34930. static GTY((length("reg_known_value_size"))) rtx *reg_known_value;
  34931. Note that the 'length' option is only meant for use with arrays of
  34932. non-atomic objects, that is, objects that contain pointers pointing
  34933. to other GTY-managed objects. For other GC-allocated arrays and
  34934. strings you should use 'atomic'.
  34935. 'skip'
  34936. If 'skip' is applied to a field, the type machinery will ignore it.
  34937. This is somewhat dangerous; the only safe use is in a union when
  34938. one field really isn't ever used.
  34939. 'for_user'
  34940. Use this to mark types that need to be marked by user gc routines,
  34941. but are not refered to in a template argument. So if you have some
  34942. user gc type T1 and a non user gc type T2 you can give T2 the
  34943. for_user option so that the marking functions for T1 can call non
  34944. mangled functions to mark T2.
  34945. 'desc ("EXPRESSION")'
  34946. 'tag ("CONSTANT")'
  34947. 'default'
  34948. The type machinery needs to be told which field of a 'union' is
  34949. currently active. This is done by giving each field a constant
  34950. 'tag' value, and then specifying a discriminator using 'desc'. The
  34951. value of the expression given by 'desc' is compared against each
  34952. 'tag' value, each of which should be different. If no 'tag' is
  34953. matched, the field marked with 'default' is used if there is one,
  34954. otherwise no field in the union will be marked.
  34955. In the 'desc' option, the "current structure" is the union that it
  34956. discriminates. Use '%1' to mean the structure containing it.
  34957. There are no escapes available to the 'tag' option, since it is a
  34958. constant.
  34959. For example,
  34960. struct GTY(()) tree_binding
  34961. {
  34962. struct tree_common common;
  34963. union tree_binding_u {
  34964. tree GTY ((tag ("0"))) scope;
  34965. struct cp_binding_level * GTY ((tag ("1"))) level;
  34966. } GTY ((desc ("BINDING_HAS_LEVEL_P ((tree)&%0)"))) xscope;
  34967. tree value;
  34968. };
  34969. In this example, the value of BINDING_HAS_LEVEL_P when applied to a
  34970. 'struct tree_binding *' is presumed to be 0 or 1. If 1, the type
  34971. mechanism will treat the field 'level' as being present and if 0,
  34972. will treat the field 'scope' as being present.
  34973. The 'desc' and 'tag' options can also be used for inheritance to
  34974. denote which subclass an instance is. See *note Inheritance and
  34975. GTY:: for more information.
  34976. 'cache'
  34977. When the 'cache' option is applied to a global variable
  34978. gt_clear_cache is called on that variable between the mark and
  34979. sweep phases of garbage collection. The gt_clear_cache function is
  34980. free to mark blocks as used, or to clear pointers in the variable.
  34981. 'deletable'
  34982. 'deletable', when applied to a global variable, indicates that when
  34983. garbage collection runs, there's no need to mark anything pointed
  34984. to by this variable, it can just be set to 'NULL' instead. This is
  34985. used to keep a list of free structures around for re-use.
  34986. 'maybe_undef'
  34987. When applied to a field, 'maybe_undef' indicates that it's OK if
  34988. the structure that this fields points to is never defined, so long
  34989. as this field is always 'NULL'. This is used to avoid requiring
  34990. backends to define certain optional structures. It doesn't work
  34991. with language frontends.
  34992. 'nested_ptr (TYPE, "TO EXPRESSION", "FROM EXPRESSION")'
  34993. The type machinery expects all pointers to point to the start of an
  34994. object. Sometimes for abstraction purposes it's convenient to have
  34995. a pointer which points inside an object. So long as it's possible
  34996. to convert the original object to and from the pointer, such
  34997. pointers can still be used. TYPE is the type of the original
  34998. object, the TO EXPRESSION returns the pointer given the original
  34999. object, and the FROM EXPRESSION returns the original object given
  35000. the pointer. The pointer will be available using the '%h' escape.
  35001. 'chain_next ("EXPRESSION")'
  35002. 'chain_prev ("EXPRESSION")'
  35003. 'chain_circular ("EXPRESSION")'
  35004. It's helpful for the type machinery to know if objects are often
  35005. chained together in long lists; this lets it generate code that
  35006. uses less stack space by iterating along the list instead of
  35007. recursing down it. 'chain_next' is an expression for the next item
  35008. in the list, 'chain_prev' is an expression for the previous item.
  35009. For singly linked lists, use only 'chain_next'; for doubly linked
  35010. lists, use both. The machinery requires that taking the next item
  35011. of the previous item gives the original item. 'chain_circular' is
  35012. similar to 'chain_next', but can be used for circular single linked
  35013. lists.
  35014. 'reorder ("FUNCTION NAME")'
  35015. Some data structures depend on the relative ordering of pointers.
  35016. If the precompiled header machinery needs to change that ordering,
  35017. it will call the function referenced by the 'reorder' option,
  35018. before changing the pointers in the object that's pointed to by the
  35019. field the option applies to. The function must take four
  35020. arguments, with the signature
  35021. 'void *, void *, gt_pointer_operator, void *'. The first parameter
  35022. is a pointer to the structure that contains the object being
  35023. updated, or the object itself if there is no containing structure.
  35024. The second parameter is a cookie that should be ignored. The third
  35025. parameter is a routine that, given a pointer, will update it to its
  35026. correct new value. The fourth parameter is a cookie that must be
  35027. passed to the second parameter.
  35028. PCH cannot handle data structures that depend on the absolute
  35029. values of pointers. 'reorder' functions can be expensive. When
  35030. possible, it is better to depend on properties of the data, like an
  35031. ID number or the hash of a string instead.
  35032. 'atomic'
  35033. The 'atomic' option can only be used with pointers. It informs the
  35034. GC machinery that the memory that the pointer points to does not
  35035. contain any pointers, and hence it should be treated by the GC and
  35036. PCH machinery as an "atomic" block of memory that does not need to
  35037. be examined when scanning memory for pointers. In particular, the
  35038. machinery will not scan that memory for pointers to mark them as
  35039. reachable (when marking pointers for GC) or to relocate them (when
  35040. writing a PCH file).
  35041. The 'atomic' option differs from the 'skip' option. 'atomic' keeps
  35042. the memory under Garbage Collection, but makes the GC ignore the
  35043. contents of the memory. 'skip' is more drastic in that it causes
  35044. the pointer and the memory to be completely ignored by the Garbage
  35045. Collector. So, memory marked as 'atomic' is automatically freed
  35046. when no longer reachable, while memory marked as 'skip' is not.
  35047. The 'atomic' option must be used with great care, because all sorts
  35048. of problem can occur if used incorrectly, that is, if the memory
  35049. the pointer points to does actually contain a pointer.
  35050. Here is an example of how to use it:
  35051. struct GTY(()) my_struct {
  35052. int number_of_elements;
  35053. unsigned int * GTY ((atomic)) elements;
  35054. };
  35055. In this case, 'elements' is a pointer under GC, and the memory it
  35056. points to needs to be allocated using the Garbage Collector, and
  35057. will be freed automatically by the Garbage Collector when it is no
  35058. longer referenced. But the memory that the pointer points to is an
  35059. array of 'unsigned int' elements, and the GC must not try to scan
  35060. it to find pointers to mark or relocate, which is why it is marked
  35061. with the 'atomic' option.
  35062. Note that, currently, global variables cannot be marked with
  35063. 'atomic'; only fields of a struct can. This is a known limitation.
  35064. It would be useful to be able to mark global pointers with 'atomic'
  35065. to make the PCH machinery aware of them so that they are saved and
  35066. restored correctly to PCH files.
  35067. 'special ("NAME")'
  35068. The 'special' option is used to mark types that have to be dealt
  35069. with by special case machinery. The parameter is the name of the
  35070. special case. See 'gengtype.c' for further details. Avoid adding
  35071. new special cases unless there is no other alternative.
  35072. 'user'
  35073. The 'user' option indicates that the code to mark structure fields
  35074. is completely handled by user-provided routines. See section *note
  35075. User GC:: for details on what functions need to be provided.
  35076. 
  35077. File: gccint.info, Node: Inheritance and GTY, Next: User GC, Prev: GTY Options, Up: Type Information
  35078. 23.2 Support for inheritance
  35079. ============================
  35080. gengtype has some support for simple class hierarchies. You can use
  35081. this to have gengtype autogenerate marking routines, provided:
  35082. * There must be a concrete base class, with a discriminator
  35083. expression that can be used to identify which subclass an instance
  35084. is.
  35085. * Only single inheritance is used.
  35086. * None of the classes within the hierarchy are templates.
  35087. If your class hierarchy does not fit in this pattern, you must use
  35088. *note User GC:: instead.
  35089. The base class and its discriminator must be identified using the
  35090. "desc" option. Each concrete subclass must use the "tag" option to
  35091. identify which value of the discriminator it corresponds to.
  35092. Every class in the hierarchy must have a 'GTY(())' marker, as gengtype
  35093. will only attempt to parse classes that have such a marker (1).
  35094. class GTY((desc("%h.kind"), tag("0"))) example_base
  35095. {
  35096. public:
  35097. int kind;
  35098. tree a;
  35099. };
  35100. class GTY((tag("1"))) some_subclass : public example_base
  35101. {
  35102. public:
  35103. tree b;
  35104. };
  35105. class GTY((tag("2"))) some_other_subclass : public example_base
  35106. {
  35107. public:
  35108. tree c;
  35109. };
  35110. The generated marking routines for the above will contain a "switch" on
  35111. "kind", visiting all appropriate fields. For example, if kind is 2, it
  35112. will cast to "some_other_subclass" and visit fields a, b, and c.
  35113. ---------- Footnotes ----------
  35114. (1) Classes lacking such a marker will not be identified as being
  35115. part of the hierarchy, and so the marking routines will not handle them,
  35116. leading to a assertion failure within the marking routines due to an
  35117. unknown tag value (assuming that assertions are enabled).
  35118. 
  35119. File: gccint.info, Node: User GC, Next: GGC Roots, Prev: Inheritance and GTY, Up: Type Information
  35120. 23.3 Support for user-provided GC marking routines
  35121. ==================================================
  35122. The garbage collector supports types for which no automatic marking code
  35123. is generated. For these types, the user is required to provide three
  35124. functions: one to act as a marker for garbage collection, and two
  35125. functions to act as marker and pointer walker for pre-compiled headers.
  35126. Given a structure 'struct GTY((user)) my_struct', the following
  35127. functions should be defined to mark 'my_struct':
  35128. void gt_ggc_mx (my_struct *p)
  35129. {
  35130. /* This marks field 'fld'. */
  35131. gt_ggc_mx (p->fld);
  35132. }
  35133. void gt_pch_nx (my_struct *p)
  35134. {
  35135. /* This marks field 'fld'. */
  35136. gt_pch_nx (tp->fld);
  35137. }
  35138. void gt_pch_nx (my_struct *p, gt_pointer_operator op, void *cookie)
  35139. {
  35140. /* For every field 'fld', call the given pointer operator. */
  35141. op (&(tp->fld), cookie);
  35142. }
  35143. In general, each marker 'M' should call 'M' for every pointer field in
  35144. the structure. Fields that are not allocated in GC or are not pointers
  35145. must be ignored.
  35146. For embedded lists (e.g., structures with a 'next' or 'prev' pointer),
  35147. the marker must follow the chain and mark every element in it.
  35148. Note that the rules for the pointer walker 'gt_pch_nx (my_struct *,
  35149. gt_pointer_operator, void *)' are slightly different. In this case, the
  35150. operation 'op' must be applied to the _address_ of every pointer field.
  35151. 23.3.1 User-provided marking routines for template types
  35152. --------------------------------------------------------
  35153. When a template type 'TP' is marked with 'GTY', all instances of that
  35154. type are considered user-provided types. This means that the individual
  35155. instances of 'TP' do not need to be marked with 'GTY'. The user needs
  35156. to provide template functions to mark all the fields of the type.
  35157. The following code snippets represent all the functions that need to be
  35158. provided. Note that type 'TP' may reference to more than one type. In
  35159. these snippets, there is only one type 'T', but there could be more.
  35160. template<typename T>
  35161. void gt_ggc_mx (TP<T> *tp)
  35162. {
  35163. extern void gt_ggc_mx (T&);
  35164. /* This marks field 'fld' of type 'T'. */
  35165. gt_ggc_mx (tp->fld);
  35166. }
  35167. template<typename T>
  35168. void gt_pch_nx (TP<T> *tp)
  35169. {
  35170. extern void gt_pch_nx (T&);
  35171. /* This marks field 'fld' of type 'T'. */
  35172. gt_pch_nx (tp->fld);
  35173. }
  35174. template<typename T>
  35175. void gt_pch_nx (TP<T *> *tp, gt_pointer_operator op, void *cookie)
  35176. {
  35177. /* For every field 'fld' of 'tp' with type 'T *', call the given
  35178. pointer operator. */
  35179. op (&(tp->fld), cookie);
  35180. }
  35181. template<typename T>
  35182. void gt_pch_nx (TP<T> *tp, gt_pointer_operator, void *cookie)
  35183. {
  35184. extern void gt_pch_nx (T *, gt_pointer_operator, void *);
  35185. /* For every field 'fld' of 'tp' with type 'T', call the pointer
  35186. walker for all the fields of T. */
  35187. gt_pch_nx (&(tp->fld), op, cookie);
  35188. }
  35189. Support for user-defined types is currently limited. The following
  35190. restrictions apply:
  35191. 1. Type 'TP' and all the argument types 'T' must be marked with 'GTY'.
  35192. 2. Type 'TP' can only have type names in its argument list.
  35193. 3. The pointer walker functions are different for 'TP<T>' and 'TP<T
  35194. *>'. In the case of 'TP<T>', references to 'T' must be handled by
  35195. calling 'gt_pch_nx' (which will, in turn, walk all the pointers
  35196. inside fields of 'T'). In the case of 'TP<T *>', references to 'T
  35197. *' must be handled by calling the 'op' function on the address of
  35198. the pointer (see the code snippets above).
  35199. 
  35200. File: gccint.info, Node: GGC Roots, Next: Files, Prev: User GC, Up: Type Information
  35201. 23.4 Marking Roots for the Garbage Collector
  35202. ============================================
  35203. In addition to keeping track of types, the type machinery also locates
  35204. the global variables ("roots") that the garbage collector starts at.
  35205. Roots must be declared using one of the following syntaxes:
  35206. * 'extern GTY(([OPTIONS])) TYPE NAME;'
  35207. * 'static GTY(([OPTIONS])) TYPE NAME;'
  35208. The syntax
  35209. * 'GTY(([OPTIONS])) TYPE NAME;'
  35210. is _not_ accepted. There should be an 'extern' declaration of such a
  35211. variable in a header somewhere--mark that, not the definition. Or, if
  35212. the variable is only used in one file, make it 'static'.
  35213. 
  35214. File: gccint.info, Node: Files, Next: Invoking the garbage collector, Prev: GGC Roots, Up: Type Information
  35215. 23.5 Source Files Containing Type Information
  35216. =============================================
  35217. Whenever you add 'GTY' markers to a source file that previously had
  35218. none, or create a new source file containing 'GTY' markers, there are
  35219. three things you need to do:
  35220. 1. You need to add the file to the list of source files the type
  35221. machinery scans. There are four cases:
  35222. a. For a back-end file, this is usually done automatically; if
  35223. not, you should add it to 'target_gtfiles' in the appropriate
  35224. port's entries in 'config.gcc'.
  35225. b. For files shared by all front ends, add the filename to the
  35226. 'GTFILES' variable in 'Makefile.in'.
  35227. c. For files that are part of one front end, add the filename to
  35228. the 'gtfiles' variable defined in the appropriate
  35229. 'config-lang.in'. Headers should appear before non-headers in
  35230. this list.
  35231. d. For files that are part of some but not all front ends, add
  35232. the filename to the 'gtfiles' variable of _all_ the front ends
  35233. that use it.
  35234. 2. If the file was a header file, you'll need to check that it's
  35235. included in the right place to be visible to the generated files.
  35236. For a back-end header file, this should be done automatically. For
  35237. a front-end header file, it needs to be included by the same file
  35238. that includes 'gtype-LANG.h'. For other header files, it needs to
  35239. be included in 'gtype-desc.c', which is a generated file, so add it
  35240. to 'ifiles' in 'open_base_file' in 'gengtype.c'.
  35241. For source files that aren't header files, the machinery will
  35242. generate a header file that should be included in the source file
  35243. you just changed. The file will be called 'gt-PATH.h' where PATH
  35244. is the pathname relative to the 'gcc' directory with slashes
  35245. replaced by -, so for example the header file to be included in
  35246. 'cp/parser.c' is called 'gt-cp-parser.c'. The generated header
  35247. file should be included after everything else in the source file.
  35248. Don't forget to mention this file as a dependency in the
  35249. 'Makefile'!
  35250. For language frontends, there is another file that needs to be included
  35251. somewhere. It will be called 'gtype-LANG.h', where LANG is the name of
  35252. the subdirectory the language is contained in.
  35253. Plugins can add additional root tables. Run the 'gengtype' utility in
  35254. plugin mode as 'gengtype -P pluginout.h SOURCE-DIR FILE-LIST PLUGIN*.C'
  35255. with your plugin files PLUGIN*.C using 'GTY' to generate the PLUGINOUT.H
  35256. file. The GCC build tree is needed to be present in that mode.
  35257. 
  35258. File: gccint.info, Node: Invoking the garbage collector, Next: Troubleshooting, Prev: Files, Up: Type Information
  35259. 23.6 How to invoke the garbage collector
  35260. ========================================
  35261. The GCC garbage collector GGC is only invoked explicitly. In contrast
  35262. with many other garbage collectors, it is not implicitly invoked by
  35263. allocation routines when a lot of memory has been consumed. So the only
  35264. way to have GGC reclaim storage is to call the 'ggc_collect' function
  35265. explicitly. This call is an expensive operation, as it may have to scan
  35266. the entire heap. Beware that local variables (on the GCC call stack)
  35267. are not followed by such an invocation (as many other garbage collectors
  35268. do): you should reference all your data from static or external 'GTY'-ed
  35269. variables, and it is advised to call 'ggc_collect' with a shallow call
  35270. stack. The GGC is an exact mark and sweep garbage collector (so it does
  35271. not scan the call stack for pointers). In practice GCC passes don't
  35272. often call 'ggc_collect' themselves, because it is called by the pass
  35273. manager between passes.
  35274. At the time of the 'ggc_collect' call all pointers in the GC-marked
  35275. structures must be valid or 'NULL'. In practice this means that there
  35276. should not be uninitialized pointer fields in the structures even if
  35277. your code never reads or writes those fields at a particular instance.
  35278. One way to ensure this is to use cleared versions of allocators unless
  35279. all the fields are initialized manually immediately after allocation.
  35280. 
  35281. File: gccint.info, Node: Troubleshooting, Prev: Invoking the garbage collector, Up: Type Information
  35282. 23.7 Troubleshooting the garbage collector
  35283. ==========================================
  35284. With the current garbage collector implementation, most issues should
  35285. show up as GCC compilation errors. Some of the most commonly
  35286. encountered issues are described below.
  35287. * Gengtype does not produce allocators for a 'GTY'-marked type.
  35288. Gengtype checks if there is at least one possible path from GC
  35289. roots to at least one instance of each type before outputting
  35290. allocators. If there is no such path, the 'GTY' markers will be
  35291. ignored and no allocators will be output. Solve this by making
  35292. sure that there exists at least one such path. If creating it is
  35293. unfeasible or raises a "code smell", consider if you really must
  35294. use GC for allocating such type.
  35295. * Link-time errors about undefined 'gt_ggc_r_foo_bar' and
  35296. similarly-named symbols. Check if your 'foo_bar' source file has
  35297. '#include "gt-foo_bar.h"' as its very last line.
  35298. 
  35299. File: gccint.info, Node: Plugins, Next: LTO, Prev: Type Information, Up: Top
  35300. 24 Plugins
  35301. **********
  35302. GCC plugins are loadable modules that provide extra features to the
  35303. compiler. Like GCC itself they can be distributed in source and binary
  35304. forms.
  35305. GCC plugins provide developers with a rich subset of the GCC API to
  35306. allow them to extend GCC as they see fit. Whether it is writing an
  35307. additional optimization pass, transforming code, or analyzing
  35308. information, plugins can be quite useful.
  35309. * Menu:
  35310. * Plugins loading:: How can we load plugins.
  35311. * Plugin API:: The APIs for plugins.
  35312. * Plugins pass:: How a plugin interact with the pass manager.
  35313. * Plugins GC:: How a plugin Interact with GCC Garbage Collector.
  35314. * Plugins description:: Giving information about a plugin itself.
  35315. * Plugins attr:: Registering custom attributes or pragmas.
  35316. * Plugins recording:: Recording information about pass execution.
  35317. * Plugins gate:: Controlling which passes are being run.
  35318. * Plugins tracking:: Keeping track of available passes.
  35319. * Plugins building:: How can we build a plugin.
  35320. 
  35321. File: gccint.info, Node: Plugins loading, Next: Plugin API, Up: Plugins
  35322. 24.1 Loading Plugins
  35323. ====================
  35324. Plugins are supported on platforms that support '-ldl -rdynamic' as well
  35325. as Windows/MinGW. They are loaded by the compiler using 'dlopen' or
  35326. equivalent and invoked at pre-determined locations in the compilation
  35327. process.
  35328. Plugins are loaded with
  35329. '-fplugin=/path/to/NAME.EXT' '-fplugin-arg-NAME-KEY1[=VALUE1]'
  35330. Where NAME is the plugin name and EXT is the platform-specific dynamic
  35331. library extension. It should be 'dll' on Windows/MinGW, 'dylib' on
  35332. Darwin/Mac OS X, and 'so' on all other platforms. The plugin arguments
  35333. are parsed by GCC and passed to respective plugins as key-value pairs.
  35334. Multiple plugins can be invoked by specifying multiple '-fplugin'
  35335. arguments.
  35336. A plugin can be simply given by its short name (no dots or slashes).
  35337. When simply passing '-fplugin=NAME', the plugin is loaded from the
  35338. 'plugin' directory, so '-fplugin=NAME' is the same as '-fplugin=`gcc
  35339. -print-file-name=plugin`/NAME.EXT', using backquote shell syntax to
  35340. query the 'plugin' directory.
  35341. 
  35342. File: gccint.info, Node: Plugin API, Next: Plugins pass, Prev: Plugins loading, Up: Plugins
  35343. 24.2 Plugin API
  35344. ===============
  35345. Plugins are activated by the compiler at specific events as defined in
  35346. 'gcc-plugin.h'. For each event of interest, the plugin should call
  35347. 'register_callback' specifying the name of the event and address of the
  35348. callback function that will handle that event.
  35349. The header 'gcc-plugin.h' must be the first gcc header to be included.
  35350. 24.2.1 Plugin license check
  35351. ---------------------------
  35352. Every plugin should define the global symbol 'plugin_is_GPL_compatible'
  35353. to assert that it has been licensed under a GPL-compatible license. If
  35354. this symbol does not exist, the compiler will emit a fatal error and
  35355. exit with the error message:
  35356. fatal error: plugin NAME is not licensed under a GPL-compatible license
  35357. NAME: undefined symbol: plugin_is_GPL_compatible
  35358. compilation terminated
  35359. The declared type of the symbol should be int, to match a forward
  35360. declaration in 'gcc-plugin.h' that suppresses C++ mangling. It does not
  35361. need to be in any allocated section, though. The compiler merely
  35362. asserts that the symbol exists in the global scope. Something like this
  35363. is enough:
  35364. int plugin_is_GPL_compatible;
  35365. 24.2.2 Plugin initialization
  35366. ----------------------------
  35367. Every plugin should export a function called 'plugin_init' that is
  35368. called right after the plugin is loaded. This function is responsible
  35369. for registering all the callbacks required by the plugin and do any
  35370. other required initialization.
  35371. This function is called from 'compile_file' right before invoking the
  35372. parser. The arguments to 'plugin_init' are:
  35373. * 'plugin_info': Plugin invocation information.
  35374. * 'version': GCC version.
  35375. The 'plugin_info' struct is defined as follows:
  35376. struct plugin_name_args
  35377. {
  35378. char *base_name; /* Short name of the plugin
  35379. (filename without .so suffix). */
  35380. const char *full_name; /* Path to the plugin as specified with
  35381. -fplugin=. */
  35382. int argc; /* Number of arguments specified with
  35383. -fplugin-arg-.... */
  35384. struct plugin_argument *argv; /* Array of ARGC key-value pairs. */
  35385. const char *version; /* Version string provided by plugin. */
  35386. const char *help; /* Help string provided by plugin. */
  35387. }
  35388. If initialization fails, 'plugin_init' must return a non-zero value.
  35389. Otherwise, it should return 0.
  35390. The version of the GCC compiler loading the plugin is described by the
  35391. following structure:
  35392. struct plugin_gcc_version
  35393. {
  35394. const char *basever;
  35395. const char *datestamp;
  35396. const char *devphase;
  35397. const char *revision;
  35398. const char *configuration_arguments;
  35399. };
  35400. The function 'plugin_default_version_check' takes two pointers to such
  35401. structure and compare them field by field. It can be used by the
  35402. plugin's 'plugin_init' function.
  35403. The version of GCC used to compile the plugin can be found in the
  35404. symbol 'gcc_version' defined in the header 'plugin-version.h'. The
  35405. recommended version check to perform looks like
  35406. #include "plugin-version.h"
  35407. ...
  35408. int
  35409. plugin_init (struct plugin_name_args *plugin_info,
  35410. struct plugin_gcc_version *version)
  35411. {
  35412. if (!plugin_default_version_check (version, &gcc_version))
  35413. return 1;
  35414. }
  35415. but you can also check the individual fields if you want a less strict
  35416. check.
  35417. 24.2.3 Plugin callbacks
  35418. -----------------------
  35419. Callback functions have the following prototype:
  35420. /* The prototype for a plugin callback function.
  35421. gcc_data - event-specific data provided by GCC
  35422. user_data - plugin-specific data provided by the plug-in. */
  35423. typedef void (*plugin_callback_func)(void *gcc_data, void *user_data);
  35424. Callbacks can be invoked at the following pre-determined events:
  35425. enum plugin_event
  35426. {
  35427. PLUGIN_START_PARSE_FUNCTION, /* Called before parsing the body of a function. */
  35428. PLUGIN_FINISH_PARSE_FUNCTION, /* After finishing parsing a function. */
  35429. PLUGIN_PASS_MANAGER_SETUP, /* To hook into pass manager. */
  35430. PLUGIN_FINISH_TYPE, /* After finishing parsing a type. */
  35431. PLUGIN_FINISH_DECL, /* After finishing parsing a declaration. */
  35432. PLUGIN_FINISH_UNIT, /* Useful for summary processing. */
  35433. PLUGIN_PRE_GENERICIZE, /* Allows to see low level AST in C and C++ frontends. */
  35434. PLUGIN_FINISH, /* Called before GCC exits. */
  35435. PLUGIN_INFO, /* Information about the plugin. */
  35436. PLUGIN_GGC_START, /* Called at start of GCC Garbage Collection. */
  35437. PLUGIN_GGC_MARKING, /* Extend the GGC marking. */
  35438. PLUGIN_GGC_END, /* Called at end of GGC. */
  35439. PLUGIN_REGISTER_GGC_ROOTS, /* Register an extra GGC root table. */
  35440. PLUGIN_ATTRIBUTES, /* Called during attribute registration */
  35441. PLUGIN_START_UNIT, /* Called before processing a translation unit. */
  35442. PLUGIN_PRAGMAS, /* Called during pragma registration. */
  35443. /* Called before first pass from all_passes. */
  35444. PLUGIN_ALL_PASSES_START,
  35445. /* Called after last pass from all_passes. */
  35446. PLUGIN_ALL_PASSES_END,
  35447. /* Called before first ipa pass. */
  35448. PLUGIN_ALL_IPA_PASSES_START,
  35449. /* Called after last ipa pass. */
  35450. PLUGIN_ALL_IPA_PASSES_END,
  35451. /* Allows to override pass gate decision for current_pass. */
  35452. PLUGIN_OVERRIDE_GATE,
  35453. /* Called before executing a pass. */
  35454. PLUGIN_PASS_EXECUTION,
  35455. /* Called before executing subpasses of a GIMPLE_PASS in
  35456. execute_ipa_pass_list. */
  35457. PLUGIN_EARLY_GIMPLE_PASSES_START,
  35458. /* Called after executing subpasses of a GIMPLE_PASS in
  35459. execute_ipa_pass_list. */
  35460. PLUGIN_EARLY_GIMPLE_PASSES_END,
  35461. /* Called when a pass is first instantiated. */
  35462. PLUGIN_NEW_PASS,
  35463. /* Called when a file is #include-d or given via the #line directive.
  35464. This could happen many times. The event data is the included file path,
  35465. as a const char* pointer. */
  35466. PLUGIN_INCLUDE_FILE,
  35467. PLUGIN_EVENT_FIRST_DYNAMIC /* Dummy event used for indexing callback
  35468. array. */
  35469. };
  35470. In addition, plugins can also look up the enumerator of a named event,
  35471. and / or generate new events dynamically, by calling the function
  35472. 'get_named_event_id'.
  35473. To register a callback, the plugin calls 'register_callback' with the
  35474. arguments:
  35475. * 'char *name': Plugin name.
  35476. * 'int event': The event code.
  35477. * 'plugin_callback_func callback': The function that handles 'event'.
  35478. * 'void *user_data': Pointer to plugin-specific data.
  35479. For the PLUGIN_PASS_MANAGER_SETUP, PLUGIN_INFO, and
  35480. PLUGIN_REGISTER_GGC_ROOTS pseudo-events the 'callback' should be null,
  35481. and the 'user_data' is specific.
  35482. When the PLUGIN_PRAGMAS event is triggered (with a null pointer as data
  35483. from GCC), plugins may register their own pragmas. Notice that pragmas
  35484. are not available from 'lto1', so plugins used with '-flto' option to
  35485. GCC during link-time optimization cannot use pragmas and do not even see
  35486. functions like 'c_register_pragma' or 'pragma_lex'.
  35487. The PLUGIN_INCLUDE_FILE event, with a 'const char*' file path as GCC
  35488. data, is triggered for processing of '#include' or '#line' directives.
  35489. The PLUGIN_FINISH event is the last time that plugins can call GCC
  35490. functions, notably emit diagnostics with 'warning', 'error' etc.
  35491. 
  35492. File: gccint.info, Node: Plugins pass, Next: Plugins GC, Prev: Plugin API, Up: Plugins
  35493. 24.3 Interacting with the pass manager
  35494. ======================================
  35495. There needs to be a way to add/reorder/remove passes dynamically. This
  35496. is useful for both analysis plugins (plugging in after a certain pass
  35497. such as CFG or an IPA pass) and optimization plugins.
  35498. Basic support for inserting new passes or replacing existing passes is
  35499. provided. A plugin registers a new pass with GCC by calling
  35500. 'register_callback' with the 'PLUGIN_PASS_MANAGER_SETUP' event and a
  35501. pointer to a 'struct register_pass_info' object defined as follows
  35502. enum pass_positioning_ops
  35503. {
  35504. PASS_POS_INSERT_AFTER, // Insert after the reference pass.
  35505. PASS_POS_INSERT_BEFORE, // Insert before the reference pass.
  35506. PASS_POS_REPLACE // Replace the reference pass.
  35507. };
  35508. struct register_pass_info
  35509. {
  35510. struct opt_pass *pass; /* New pass provided by the plugin. */
  35511. const char *reference_pass_name; /* Name of the reference pass for hooking
  35512. up the new pass. */
  35513. int ref_pass_instance_number; /* Insert the pass at the specified
  35514. instance number of the reference pass. */
  35515. /* Do it for every instance if it is 0. */
  35516. enum pass_positioning_ops pos_op; /* how to insert the new pass. */
  35517. };
  35518. /* Sample plugin code that registers a new pass. */
  35519. int
  35520. plugin_init (struct plugin_name_args *plugin_info,
  35521. struct plugin_gcc_version *version)
  35522. {
  35523. struct register_pass_info pass_info;
  35524. ...
  35525. /* Code to fill in the pass_info object with new pass information. */
  35526. ...
  35527. /* Register the new pass. */
  35528. register_callback (plugin_info->base_name, PLUGIN_PASS_MANAGER_SETUP, NULL, &pass_info);
  35529. ...
  35530. }
  35531. 
  35532. File: gccint.info, Node: Plugins GC, Next: Plugins description, Prev: Plugins pass, Up: Plugins
  35533. 24.4 Interacting with the GCC Garbage Collector
  35534. ===============================================
  35535. Some plugins may want to be informed when GGC (the GCC Garbage
  35536. Collector) is running. They can register callbacks for the
  35537. 'PLUGIN_GGC_START' and 'PLUGIN_GGC_END' events (for which the callback
  35538. is called with a null 'gcc_data') to be notified of the start or end of
  35539. the GCC garbage collection.
  35540. Some plugins may need to have GGC mark additional data. This can be
  35541. done by registering a callback (called with a null 'gcc_data') for the
  35542. 'PLUGIN_GGC_MARKING' event. Such callbacks can call the 'ggc_set_mark'
  35543. routine, preferably through the 'ggc_mark' macro (and conversely, these
  35544. routines should usually not be used in plugins outside of the
  35545. 'PLUGIN_GGC_MARKING' event). Plugins that wish to hold weak references
  35546. to gc data may also use this event to drop weak references when the
  35547. object is about to be collected. The 'ggc_marked_p' function can be
  35548. used to tell if an object is marked, or is about to be collected. The
  35549. 'gt_clear_cache' overloads which some types define may also be of use in
  35550. managing weak references.
  35551. Some plugins may need to add extra GGC root tables, e.g. to handle
  35552. their own 'GTY'-ed data. This can be done with the
  35553. 'PLUGIN_REGISTER_GGC_ROOTS' pseudo-event with a null callback and the
  35554. extra root table (of type 'struct ggc_root_tab*') as 'user_data'.
  35555. Running the 'gengtype -p SOURCE-DIR FILE-LIST PLUGIN*.C ...' utility
  35556. generates these extra root tables.
  35557. You should understand the details of memory management inside GCC
  35558. before using 'PLUGIN_GGC_MARKING' or 'PLUGIN_REGISTER_GGC_ROOTS'.
  35559. 
  35560. File: gccint.info, Node: Plugins description, Next: Plugins attr, Prev: Plugins GC, Up: Plugins
  35561. 24.5 Giving information about a plugin
  35562. ======================================
  35563. A plugin should give some information to the user about itself. This
  35564. uses the following structure:
  35565. struct plugin_info
  35566. {
  35567. const char *version;
  35568. const char *help;
  35569. };
  35570. Such a structure is passed as the 'user_data' by the plugin's init
  35571. routine using 'register_callback' with the 'PLUGIN_INFO' pseudo-event
  35572. and a null callback.
  35573. 
  35574. File: gccint.info, Node: Plugins attr, Next: Plugins recording, Prev: Plugins description, Up: Plugins
  35575. 24.6 Registering custom attributes or pragmas
  35576. =============================================
  35577. For analysis (or other) purposes it is useful to be able to add custom
  35578. attributes or pragmas.
  35579. The 'PLUGIN_ATTRIBUTES' callback is called during attribute
  35580. registration. Use the 'register_attribute' function to register custom
  35581. attributes.
  35582. /* Attribute handler callback */
  35583. static tree
  35584. handle_user_attribute (tree *node, tree name, tree args,
  35585. int flags, bool *no_add_attrs)
  35586. {
  35587. return NULL_TREE;
  35588. }
  35589. /* Attribute definition */
  35590. static struct attribute_spec user_attr =
  35591. { "user", 1, 1, false, false, false, false, handle_user_attribute, NULL };
  35592. /* Plugin callback called during attribute registration.
  35593. Registered with register_callback (plugin_name, PLUGIN_ATTRIBUTES, register_attributes, NULL)
  35594. */
  35595. static void
  35596. register_attributes (void *event_data, void *data)
  35597. {
  35598. warning (0, G_("Callback to register attributes"));
  35599. register_attribute (&user_attr);
  35600. }
  35601. The PLUGIN_PRAGMAS callback is called once during pragmas registration.
  35602. Use the 'c_register_pragma', 'c_register_pragma_with_data',
  35603. 'c_register_pragma_with_expansion',
  35604. 'c_register_pragma_with_expansion_and_data' functions to register custom
  35605. pragmas and their handlers (which often want to call 'pragma_lex') from
  35606. 'c-family/c-pragma.h'.
  35607. /* Plugin callback called during pragmas registration. Registered with
  35608. register_callback (plugin_name, PLUGIN_PRAGMAS,
  35609. register_my_pragma, NULL);
  35610. */
  35611. static void
  35612. register_my_pragma (void *event_data, void *data)
  35613. {
  35614. warning (0, G_("Callback to register pragmas"));
  35615. c_register_pragma ("GCCPLUGIN", "sayhello", handle_pragma_sayhello);
  35616. }
  35617. It is suggested to pass '"GCCPLUGIN"' (or a short name identifying your
  35618. plugin) as the "space" argument of your pragma.
  35619. Pragmas registered with 'c_register_pragma_with_expansion' or
  35620. 'c_register_pragma_with_expansion_and_data' support preprocessor
  35621. expansions. For example:
  35622. #define NUMBER 10
  35623. #pragma GCCPLUGIN foothreshold (NUMBER)
  35624. 
  35625. File: gccint.info, Node: Plugins recording, Next: Plugins gate, Prev: Plugins attr, Up: Plugins
  35626. 24.7 Recording information about pass execution
  35627. ===============================================
  35628. The event PLUGIN_PASS_EXECUTION passes the pointer to the executed pass
  35629. (the same as current_pass) as 'gcc_data' to the callback. You can also
  35630. inspect cfun to find out about which function this pass is executed for.
  35631. Note that this event will only be invoked if the gate check (if
  35632. applicable, modified by PLUGIN_OVERRIDE_GATE) succeeds. You can use
  35633. other hooks, like 'PLUGIN_ALL_PASSES_START', 'PLUGIN_ALL_PASSES_END',
  35634. 'PLUGIN_ALL_IPA_PASSES_START', 'PLUGIN_ALL_IPA_PASSES_END',
  35635. 'PLUGIN_EARLY_GIMPLE_PASSES_START', and/or
  35636. 'PLUGIN_EARLY_GIMPLE_PASSES_END' to manipulate global state in your
  35637. plugin(s) in order to get context for the pass execution.
  35638. 
  35639. File: gccint.info, Node: Plugins gate, Next: Plugins tracking, Prev: Plugins recording, Up: Plugins
  35640. 24.8 Controlling which passes are being run
  35641. ===========================================
  35642. After the original gate function for a pass is called, its result - the
  35643. gate status - is stored as an integer. Then the event
  35644. 'PLUGIN_OVERRIDE_GATE' is invoked, with a pointer to the gate status in
  35645. the 'gcc_data' parameter to the callback function. A nonzero value of
  35646. the gate status means that the pass is to be executed. You can both
  35647. read and write the gate status via the passed pointer.
  35648. 
  35649. File: gccint.info, Node: Plugins tracking, Next: Plugins building, Prev: Plugins gate, Up: Plugins
  35650. 24.9 Keeping track of available passes
  35651. ======================================
  35652. When your plugin is loaded, you can inspect the various pass lists to
  35653. determine what passes are available. However, other plugins might add
  35654. new passes. Also, future changes to GCC might cause generic passes to
  35655. be added after plugin loading. When a pass is first added to one of the
  35656. pass lists, the event 'PLUGIN_NEW_PASS' is invoked, with the callback
  35657. parameter 'gcc_data' pointing to the new pass.
  35658. 
  35659. File: gccint.info, Node: Plugins building, Prev: Plugins tracking, Up: Plugins
  35660. 24.10 Building GCC plugins
  35661. ==========================
  35662. If plugins are enabled, GCC installs the headers needed to build a
  35663. plugin (somewhere in the installation tree, e.g. under '/usr/local').
  35664. In particular a 'plugin/include' directory is installed, containing all
  35665. the header files needed to build plugins.
  35666. On most systems, you can query this 'plugin' directory by invoking 'gcc
  35667. -print-file-name=plugin' (replace if needed 'gcc' with the appropriate
  35668. program path).
  35669. Inside plugins, this 'plugin' directory name can be queried by calling
  35670. 'default_plugin_dir_name ()'.
  35671. Plugins may know, when they are compiled, the GCC version for which
  35672. 'plugin-version.h' is provided. The constant macros
  35673. 'GCCPLUGIN_VERSION_MAJOR', 'GCCPLUGIN_VERSION_MINOR',
  35674. 'GCCPLUGIN_VERSION_PATCHLEVEL', 'GCCPLUGIN_VERSION' are integer numbers,
  35675. so a plugin could ensure it is built for GCC 4.7 with
  35676. #if GCCPLUGIN_VERSION != 4007
  35677. #error this GCC plugin is for GCC 4.7
  35678. #endif
  35679. The following GNU Makefile excerpt shows how to build a simple plugin:
  35680. HOST_GCC=g++
  35681. TARGET_GCC=gcc
  35682. PLUGIN_SOURCE_FILES= plugin1.c plugin2.cc
  35683. GCCPLUGINS_DIR:= $(shell $(TARGET_GCC) -print-file-name=plugin)
  35684. CXXFLAGS+= -I$(GCCPLUGINS_DIR)/include -fPIC -fno-rtti -O2
  35685. plugin.so: $(PLUGIN_SOURCE_FILES)
  35686. $(HOST_GCC) -shared $(CXXFLAGS) $^ -o $@
  35687. A single source file plugin may be built with 'g++ -I`gcc
  35688. -print-file-name=plugin`/include -fPIC -shared -fno-rtti -O2 plugin.c -o
  35689. plugin.so', using backquote shell syntax to query the 'plugin'
  35690. directory.
  35691. Plugin support on Windows/MinGW has a number of limitations and
  35692. additional requirements. When building a plugin on Windows we have to
  35693. link an import library for the corresponding backend executable, for
  35694. example, 'cc1.exe', 'cc1plus.exe', etc., in order to gain access to the
  35695. symbols provided by GCC. This means that on Windows a plugin is
  35696. language-specific, for example, for C, C++, etc. If you wish to use
  35697. your plugin with multiple languages, then you will need to build
  35698. multiple plugin libraries and either instruct your users on how to load
  35699. the correct version or provide a compiler wrapper that does this
  35700. automatically.
  35701. Additionally, on Windows the plugin library has to export the
  35702. 'plugin_is_GPL_compatible' and 'plugin_init' symbols. If you do not
  35703. wish to modify the source code of your plugin, then you can use the
  35704. '-Wl,--export-all-symbols' option or provide a suitable DEF file.
  35705. Alternatively, you can export just these two symbols by decorating them
  35706. with '__declspec(dllexport)', for example:
  35707. #ifdef _WIN32
  35708. __declspec(dllexport)
  35709. #endif
  35710. int plugin_is_GPL_compatible;
  35711. #ifdef _WIN32
  35712. __declspec(dllexport)
  35713. #endif
  35714. int plugin_init (plugin_name_args *, plugin_gcc_version *)
  35715. The import libraries are installed into the 'plugin' directory and
  35716. their names are derived by appending the '.a' extension to the backend
  35717. executable names, for example, 'cc1.exe.a', 'cc1plus.exe.a', etc. The
  35718. following command line shows how to build the single source file plugin
  35719. on Windows to be used with the C++ compiler:
  35720. g++ -I`gcc -print-file-name=plugin`/include -shared -Wl,--export-all-symbols \
  35721. -o plugin.dll plugin.c `gcc -print-file-name=plugin`/cc1plus.exe.a
  35722. When a plugin needs to use 'gengtype', be sure that both 'gengtype' and
  35723. 'gtype.state' have the same version as the GCC for which the plugin is
  35724. built.
  35725. 
  35726. File: gccint.info, Node: LTO, Next: Match and Simplify, Prev: Plugins, Up: Top
  35727. 25 Link Time Optimization
  35728. *************************
  35729. Link Time Optimization (LTO) gives GCC the capability of dumping its
  35730. internal representation (GIMPLE) to disk, so that all the different
  35731. compilation units that make up a single executable can be optimized as a
  35732. single module. This expands the scope of inter-procedural optimizations
  35733. to encompass the whole program (or, rather, everything that is visible
  35734. at link time).
  35735. * Menu:
  35736. * LTO Overview:: Overview of LTO.
  35737. * LTO object file layout:: LTO file sections in ELF.
  35738. * IPA:: Using summary information in IPA passes.
  35739. * WHOPR:: Whole program assumptions,
  35740. linker plugin and symbol visibilities.
  35741. * Internal flags:: Internal flags controlling 'lto1'.
  35742. 
  35743. File: gccint.info, Node: LTO Overview, Next: LTO object file layout, Up: LTO
  35744. 25.1 Design Overview
  35745. ====================
  35746. Link time optimization is implemented as a GCC front end for a bytecode
  35747. representation of GIMPLE that is emitted in special sections of '.o'
  35748. files. Currently, LTO support is enabled in most ELF-based systems, as
  35749. well as darwin, cygwin and mingw systems.
  35750. Since GIMPLE bytecode is saved alongside final object code, object
  35751. files generated with LTO support are larger than regular object files.
  35752. This "fat" object format makes it easy to integrate LTO into existing
  35753. build systems, as one can, for instance, produce archives of the files.
  35754. Additionally, one might be able to ship one set of fat objects which
  35755. could be used both for development and the production of optimized
  35756. builds. A, perhaps surprising, side effect of this feature is that any
  35757. mistake in the toolchain leads to LTO information not being used (e.g.
  35758. an older 'libtool' calling 'ld' directly). This is both an advantage,
  35759. as the system is more robust, and a disadvantage, as the user is not
  35760. informed that the optimization has been disabled.
  35761. The current implementation only produces "fat" objects, effectively
  35762. doubling compilation time and increasing file sizes up to 5x the
  35763. original size. This hides the problem that some tools, such as 'ar' and
  35764. 'nm', need to understand symbol tables of LTO sections. These tools
  35765. were extended to use the plugin infrastructure, and with these problems
  35766. solved, GCC will also support "slim" objects consisting of the
  35767. intermediate code alone.
  35768. At the highest level, LTO splits the compiler in two. The first half
  35769. (the "writer") produces a streaming representation of all the internal
  35770. data structures needed to optimize and generate code. This includes
  35771. declarations, types, the callgraph and the GIMPLE representation of
  35772. function bodies.
  35773. When '-flto' is given during compilation of a source file, the pass
  35774. manager executes all the passes in 'all_lto_gen_passes'. Currently,
  35775. this phase is composed of two IPA passes:
  35776. * 'pass_ipa_lto_gimple_out' This pass executes the function
  35777. 'lto_output' in 'lto-streamer-out.c', which traverses the call
  35778. graph encoding every reachable declaration, type and function.
  35779. This generates a memory representation of all the file sections
  35780. described below.
  35781. * 'pass_ipa_lto_finish_out' This pass executes the function
  35782. 'produce_asm_for_decls' in 'lto-streamer-out.c', which takes the
  35783. memory image built in the previous pass and encodes it in the
  35784. corresponding ELF file sections.
  35785. The second half of LTO support is the "reader". This is implemented as
  35786. the GCC front end 'lto1' in 'lto/lto.c'. When 'collect2' detects a link
  35787. set of '.o'/'.a' files with LTO information and the '-flto' is enabled,
  35788. it invokes 'lto1' which reads the set of files and aggregates them into
  35789. a single translation unit for optimization. The main entry point for
  35790. the reader is 'lto/lto.c':'lto_main'.
  35791. 25.1.1 LTO modes of operation
  35792. -----------------------------
  35793. One of the main goals of the GCC link-time infrastructure was to allow
  35794. effective compilation of large programs. For this reason GCC implements
  35795. two link-time compilation modes.
  35796. 1. _LTO mode_, in which the whole program is read into the compiler at
  35797. link-time and optimized in a similar way as if it were a single
  35798. source-level compilation unit.
  35799. 2. _WHOPR or partitioned mode_, designed to utilize multiple CPUs
  35800. and/or a distributed compilation environment to quickly link large
  35801. applications. WHOPR stands for WHOle Program optimizeR (not to be
  35802. confused with the semantics of '-fwhole-program'). It partitions
  35803. the aggregated callgraph from many different '.o' files and
  35804. distributes the compilation of the sub-graphs to different CPUs.
  35805. Note that distributed compilation is not implemented yet, but since
  35806. the parallelism is facilitated via generating a 'Makefile', it
  35807. would be easy to implement.
  35808. WHOPR splits LTO into three main stages:
  35809. 1. Local generation (LGEN) This stage executes in parallel. Every
  35810. file in the program is compiled into the intermediate language and
  35811. packaged together with the local call-graph and summary
  35812. information. This stage is the same for both the LTO and WHOPR
  35813. compilation mode.
  35814. 2. Whole Program Analysis (WPA) WPA is performed sequentially. The
  35815. global call-graph is generated, and a global analysis procedure
  35816. makes transformation decisions. The global call-graph is
  35817. partitioned to facilitate parallel optimization during phase 3.
  35818. The results of the WPA stage are stored into new object files which
  35819. contain the partitions of program expressed in the intermediate
  35820. language and the optimization decisions.
  35821. 3. Local transformations (LTRANS) This stage executes in parallel.
  35822. All the decisions made during phase 2 are implemented locally in
  35823. each partitioned object file, and the final object code is
  35824. generated. Optimizations which cannot be decided efficiently
  35825. during the phase 2 may be performed on the local call-graph
  35826. partitions.
  35827. WHOPR can be seen as an extension of the usual LTO mode of compilation.
  35828. In LTO, WPA and LTRANS are executed within a single execution of the
  35829. compiler, after the whole program has been read into memory.
  35830. When compiling in WHOPR mode, the callgraph is partitioned during the
  35831. WPA stage. The whole program is split into a given number of partitions
  35832. of roughly the same size. The compiler tries to minimize the number of
  35833. references which cross partition boundaries. The main advantage of
  35834. WHOPR is to allow the parallel execution of LTRANS stages, which are the
  35835. most time-consuming part of the compilation process. Additionally, it
  35836. avoids the need to load the whole program into memory.
  35837. 
  35838. File: gccint.info, Node: LTO object file layout, Next: IPA, Prev: LTO Overview, Up: LTO
  35839. 25.2 LTO file sections
  35840. ======================
  35841. LTO information is stored in several ELF sections inside object files.
  35842. Data structures and enum codes for sections are defined in
  35843. 'lto-streamer.h'.
  35844. These sections are emitted from 'lto-streamer-out.c' and mapped in all
  35845. at once from 'lto/lto.c':'lto_file_read'. The individual functions
  35846. dealing with the reading/writing of each section are described below.
  35847. * Command line options ('.gnu.lto_.opts')
  35848. This section contains the command line options used to generate the
  35849. object files. This is used at link time to determine the
  35850. optimization level and other settings when they are not explicitly
  35851. specified at the linker command line.
  35852. Currently, GCC does not support combining LTO object files compiled
  35853. with different set of the command line options into a single
  35854. binary. At link time, the options given on the command line and
  35855. the options saved on all the files in a link-time set are applied
  35856. globally. No attempt is made at validating the combination of
  35857. flags (other than the usual validation done by option processing).
  35858. This is implemented in 'lto/lto.c':'lto_read_all_file_options'.
  35859. * Symbol table ('.gnu.lto_.symtab')
  35860. This table replaces the ELF symbol table for functions and
  35861. variables represented in the LTO IL. Symbols used and exported by
  35862. the optimized assembly code of "fat" objects might not match the
  35863. ones used and exported by the intermediate code. This table is
  35864. necessary because the intermediate code is less optimized and thus
  35865. requires a separate symbol table.
  35866. Additionally, the binary code in the "fat" object will lack a call
  35867. to a function, since the call was optimized out at compilation time
  35868. after the intermediate language was streamed out. In some special
  35869. cases, the same optimization may not happen during link-time
  35870. optimization. This would lead to an undefined symbol if only one
  35871. symbol table was used.
  35872. The symbol table is emitted in
  35873. 'lto-streamer-out.c':'produce_symtab'.
  35874. * Global declarations and types ('.gnu.lto_.decls')
  35875. This section contains an intermediate language dump of all
  35876. declarations and types required to represent the callgraph, static
  35877. variables and top-level debug info.
  35878. The contents of this section are emitted in
  35879. 'lto-streamer-out.c':'produce_asm_for_decls'. Types and symbols
  35880. are emitted in a topological order that preserves the sharing of
  35881. pointers when the file is read back in
  35882. ('lto.c':'read_cgraph_and_symbols').
  35883. * The callgraph ('.gnu.lto_.cgraph')
  35884. This section contains the basic data structure used by the GCC
  35885. inter-procedural optimization infrastructure. This section stores
  35886. an annotated multi-graph which represents the functions and call
  35887. sites as well as the variables, aliases and top-level 'asm'
  35888. statements.
  35889. This section is emitted in 'lto-streamer-out.c':'output_cgraph' and
  35890. read in 'lto-cgraph.c':'input_cgraph'.
  35891. * IPA references ('.gnu.lto_.refs')
  35892. This section contains references between function and static
  35893. variables. It is emitted by 'lto-cgraph.c':'output_refs' and read
  35894. by 'lto-cgraph.c':'input_refs'.
  35895. * Function bodies ('.gnu.lto_.function_body.<name>')
  35896. This section contains function bodies in the intermediate language
  35897. representation. Every function body is in a separate section to
  35898. allow copying of the section independently to different object
  35899. files or reading the function on demand.
  35900. Functions are emitted in 'lto-streamer-out.c':'output_function' and
  35901. read in 'lto-streamer-in.c':'input_function'.
  35902. * Static variable initializers ('.gnu.lto_.vars')
  35903. This section contains all the symbols in the global variable pool.
  35904. It is emitted by 'lto-cgraph.c':'output_varpool' and read in
  35905. 'lto-cgraph.c':'input_cgraph'.
  35906. * Summaries and optimization summaries used by IPA passes
  35907. ('.gnu.lto_.<xxx>', where '<xxx>' is one of 'jmpfuncs', 'pureconst'
  35908. or 'reference')
  35909. These sections are used by IPA passes that need to emit summary
  35910. information during LTO generation to be read and aggregated at link
  35911. time. Each pass is responsible for implementing two pass manager
  35912. hooks: one for writing the summary and another for reading it in.
  35913. The format of these sections is entirely up to each individual
  35914. pass. The only requirement is that the writer and reader hooks
  35915. agree on the format.
  35916. 
  35917. File: gccint.info, Node: IPA, Next: WHOPR, Prev: LTO object file layout, Up: LTO
  35918. 25.3 Using summary information in IPA passes
  35919. ============================================
  35920. Programs are represented internally as a _callgraph_ (a multi-graph
  35921. where nodes are functions and edges are call sites) and a _varpool_ (a
  35922. list of static and external variables in the program).
  35923. The inter-procedural optimization is organized as a sequence of
  35924. individual passes, which operate on the callgraph and the varpool. To
  35925. make the implementation of WHOPR possible, every inter-procedural
  35926. optimization pass is split into several stages that are executed at
  35927. different times during WHOPR compilation:
  35928. * LGEN time
  35929. 1. _Generate summary_ ('generate_summary' in 'struct
  35930. ipa_opt_pass_d'). This stage analyzes every function body and
  35931. variable initializer is examined and stores relevant
  35932. information into a pass-specific data structure.
  35933. 2. _Write summary_ ('write_summary' in 'struct ipa_opt_pass_d').
  35934. This stage writes all the pass-specific information generated
  35935. by 'generate_summary'. Summaries go into their own
  35936. 'LTO_section_*' sections that have to be declared in
  35937. 'lto-streamer.h':'enum lto_section_type'. A new section is
  35938. created by calling 'create_output_block' and data can be
  35939. written using the 'lto_output_*' routines.
  35940. * WPA time
  35941. 1. _Read summary_ ('read_summary' in 'struct ipa_opt_pass_d').
  35942. This stage reads all the pass-specific information in exactly
  35943. the same order that it was written by 'write_summary'.
  35944. 2. _Execute_ ('execute' in 'struct opt_pass'). This performs
  35945. inter-procedural propagation. This must be done without
  35946. actual access to the individual function bodies or variable
  35947. initializers. Typically, this results in a transitive closure
  35948. operation over the summary information of all the nodes in the
  35949. callgraph.
  35950. 3. _Write optimization summary_ ('write_optimization_summary' in
  35951. 'struct ipa_opt_pass_d'). This writes the result of the
  35952. inter-procedural propagation into the object file. This can
  35953. use the same data structures and helper routines used in
  35954. 'write_summary'.
  35955. * LTRANS time
  35956. 1. _Read optimization summary_ ('read_optimization_summary' in
  35957. 'struct ipa_opt_pass_d'). The counterpart to
  35958. 'write_optimization_summary'. This reads the interprocedural
  35959. optimization decisions in exactly the same format emitted by
  35960. 'write_optimization_summary'.
  35961. 2. _Transform_ ('function_transform' and 'variable_transform' in
  35962. 'struct ipa_opt_pass_d'). The actual function bodies and
  35963. variable initializers are updated based on the information
  35964. passed down from the _Execute_ stage.
  35965. The implementation of the inter-procedural passes are shared between
  35966. LTO, WHOPR and classic non-LTO compilation.
  35967. * During the traditional file-by-file mode every pass executes its
  35968. own _Generate summary_, _Execute_, and _Transform_ stages within
  35969. the single execution context of the compiler.
  35970. * In LTO compilation mode, every pass uses _Generate summary_ and
  35971. _Write summary_ stages at compilation time, while the _Read
  35972. summary_, _Execute_, and _Transform_ stages are executed at link
  35973. time.
  35974. * In WHOPR mode all stages are used.
  35975. To simplify development, the GCC pass manager differentiates between
  35976. normal inter-procedural passes (*note Regular IPA passes::), small
  35977. inter-procedural passes (*note Small IPA passes::) and late
  35978. inter-procedural passes (*note Late IPA passes::). A small or late IPA
  35979. pass ('SIMPLE_IPA_PASS') does everything at once and thus cannot be
  35980. executed during WPA in WHOPR mode. It defines only the _Execute_ stage
  35981. and during this stage it accesses and modifies the function bodies.
  35982. Such passes are useful for optimization at LGEN or LTRANS time and are
  35983. used, for example, to implement early optimization before writing object
  35984. files. The simple inter-procedural passes can also be used for easier
  35985. prototyping and development of a new inter-procedural pass.
  35986. 25.3.1 Virtual clones
  35987. ---------------------
  35988. One of the main challenges of introducing the WHOPR compilation mode was
  35989. addressing the interactions between optimization passes. In LTO
  35990. compilation mode, the passes are executed in a sequence, each of which
  35991. consists of analysis (or _Generate summary_), propagation (or _Execute_)
  35992. and _Transform_ stages. Once the work of one pass is finished, the next
  35993. pass sees the updated program representation and can execute. This
  35994. makes the individual passes dependent on each other.
  35995. In WHOPR mode all passes first execute their _Generate summary_ stage.
  35996. Then summary writing marks the end of the LGEN stage. At WPA time, the
  35997. summaries are read back into memory and all passes run the _Execute_
  35998. stage. Optimization summaries are streamed and sent to LTRANS, where
  35999. all the passes execute the _Transform_ stage.
  36000. Most optimization passes split naturally into analysis, propagation and
  36001. transformation stages. But some do not. The main problem arises when
  36002. one pass performs changes and the following pass gets confused by seeing
  36003. different callgraphs between the _Transform_ stage and the _Generate
  36004. summary_ or _Execute_ stage. This means that the passes are required to
  36005. communicate their decisions with each other.
  36006. To facilitate this communication, the GCC callgraph infrastructure
  36007. implements _virtual clones_, a method of representing the changes
  36008. performed by the optimization passes in the callgraph without needing to
  36009. update function bodies.
  36010. A _virtual clone_ in the callgraph is a function that has no associated
  36011. body, just a description of how to create its body based on a different
  36012. function (which itself may be a virtual clone).
  36013. The description of function modifications includes adjustments to the
  36014. function's signature (which allows, for example, removing or adding
  36015. function arguments), substitutions to perform on the function body, and,
  36016. for inlined functions, a pointer to the function that it will be inlined
  36017. into.
  36018. It is also possible to redirect any edge of the callgraph from a
  36019. function to its virtual clone. This implies updating of the call site
  36020. to adjust for the new function signature.
  36021. Most of the transformations performed by inter-procedural optimizations
  36022. can be represented via virtual clones. For instance, a constant
  36023. propagation pass can produce a virtual clone of the function which
  36024. replaces one of its arguments by a constant. The inliner can represent
  36025. its decisions by producing a clone of a function whose body will be
  36026. later integrated into a given function.
  36027. Using _virtual clones_, the program can be easily updated during the
  36028. _Execute_ stage, solving most of pass interactions problems that would
  36029. otherwise occur during _Transform_.
  36030. Virtual clones are later materialized in the LTRANS stage and turned
  36031. into real functions. Passes executed after the virtual clone were
  36032. introduced also perform their _Transform_ stage on new functions, so for
  36033. a pass there is no significant difference between operating on a real
  36034. function or a virtual clone introduced before its _Execute_ stage.
  36035. Optimization passes then work on virtual clones introduced before their
  36036. _Execute_ stage as if they were real functions. The only difference is
  36037. that clones are not visible during the _Generate Summary_ stage.
  36038. To keep function summaries updated, the callgraph interface allows an
  36039. optimizer to register a callback that is called every time a new clone
  36040. is introduced as well as when the actual function or variable is
  36041. generated or when a function or variable is removed. These hooks are
  36042. registered in the _Generate summary_ stage and allow the pass to keep
  36043. its information intact until the _Execute_ stage. The same hooks can
  36044. also be registered during the _Execute_ stage to keep the optimization
  36045. summaries updated for the _Transform_ stage.
  36046. 25.3.2 IPA references
  36047. ---------------------
  36048. GCC represents IPA references in the callgraph. For a function or
  36049. variable 'A', the _IPA reference_ is a list of all locations where the
  36050. address of 'A' is taken and, when 'A' is a variable, a list of all
  36051. direct stores and reads to/from 'A'. References represent an oriented
  36052. multi-graph on the union of nodes of the callgraph and the varpool. See
  36053. 'ipa-reference.c':'ipa_reference_write_optimization_summary' and
  36054. 'ipa-reference.c':'ipa_reference_read_optimization_summary' for details.
  36055. 25.3.3 Jump functions
  36056. ---------------------
  36057. Suppose that an optimization pass sees a function 'A' and it knows the
  36058. values of (some of) its arguments. The _jump function_ describes the
  36059. value of a parameter of a given function call in function 'A' based on
  36060. this knowledge.
  36061. Jump functions are used by several optimizations, such as the
  36062. inter-procedural constant propagation pass and the devirtualization
  36063. pass. The inliner also uses jump functions to perform inlining of
  36064. callbacks.
  36065. 
  36066. File: gccint.info, Node: WHOPR, Next: Internal flags, Prev: IPA, Up: LTO
  36067. 25.4 Whole program assumptions, linker plugin and symbol visibilities
  36068. =====================================================================
  36069. Link-time optimization gives relatively minor benefits when used alone.
  36070. The problem is that propagation of inter-procedural information does not
  36071. work well across functions and variables that are called or referenced
  36072. by other compilation units (such as from a dynamically linked library).
  36073. We say that such functions and variables are _externally visible_.
  36074. To make the situation even more difficult, many applications organize
  36075. themselves as a set of shared libraries, and the default ELF visibility
  36076. rules allow one to overwrite any externally visible symbol with a
  36077. different symbol at runtime. This basically disables any optimizations
  36078. across such functions and variables, because the compiler cannot be sure
  36079. that the function body it is seeing is the same function body that will
  36080. be used at runtime. Any function or variable not declared 'static' in
  36081. the sources degrades the quality of inter-procedural optimization.
  36082. To avoid this problem the compiler must assume that it sees the whole
  36083. program when doing link-time optimization. Strictly speaking, the whole
  36084. program is rarely visible even at link-time. Standard system libraries
  36085. are usually linked dynamically or not provided with the link-time
  36086. information. In GCC, the whole program option ('-fwhole-program')
  36087. asserts that every function and variable defined in the current
  36088. compilation unit is static, except for function 'main' (note: at link
  36089. time, the current unit is the union of all objects compiled with LTO).
  36090. Since some functions and variables need to be referenced externally, for
  36091. example by another DSO or from an assembler file, GCC also provides the
  36092. function and variable attribute 'externally_visible' which can be used
  36093. to disable the effect of '-fwhole-program' on a specific symbol.
  36094. The whole program mode assumptions are slightly more complex in C++,
  36095. where inline functions in headers are put into _COMDAT_ sections.
  36096. COMDAT function and variables can be defined by multiple object files
  36097. and their bodies are unified at link-time and dynamic link-time. COMDAT
  36098. functions are changed to local only when their address is not taken and
  36099. thus un-sharing them with a library is not harmful. COMDAT variables
  36100. always remain externally visible, however for readonly variables it is
  36101. assumed that their initializers cannot be overwritten by a different
  36102. value.
  36103. GCC provides the function and variable attribute 'visibility' that can
  36104. be used to specify the visibility of externally visible symbols (or
  36105. alternatively an '-fdefault-visibility' command line option). ELF
  36106. defines the 'default', 'protected', 'hidden' and 'internal'
  36107. visibilities.
  36108. The most commonly used is visibility is 'hidden'. It specifies that
  36109. the symbol cannot be referenced from outside of the current shared
  36110. library. Unfortunately, this information cannot be used directly by the
  36111. link-time optimization in the compiler since the whole shared library
  36112. also might contain non-LTO objects and those are not visible to the
  36113. compiler.
  36114. GCC solves this problem using linker plugins. A _linker plugin_ is an
  36115. interface to the linker that allows an external program to claim the
  36116. ownership of a given object file. The linker then performs the linking
  36117. procedure by querying the plugin about the symbol table of the claimed
  36118. objects and once the linking decisions are complete, the plugin is
  36119. allowed to provide the final object file before the actual linking is
  36120. made. The linker plugin obtains the symbol resolution information which
  36121. specifies which symbols provided by the claimed objects are bound from
  36122. the rest of a binary being linked.
  36123. GCC is designed to be independent of the rest of the toolchain and aims
  36124. to support linkers without plugin support. For this reason it does not
  36125. use the linker plugin by default. Instead, the object files are
  36126. examined by 'collect2' before being passed to the linker and objects
  36127. found to have LTO sections are passed to 'lto1' first. This mode does
  36128. not work for library archives. The decision on what object files from
  36129. the archive are needed depends on the actual linking and thus GCC would
  36130. have to implement the linker itself. The resolution information is
  36131. missing too and thus GCC needs to make an educated guess based on
  36132. '-fwhole-program'. Without the linker plugin GCC also assumes that
  36133. symbols are declared 'hidden' and not referred by non-LTO code by
  36134. default.
  36135. 
  36136. File: gccint.info, Node: Internal flags, Prev: WHOPR, Up: LTO
  36137. 25.5 Internal flags controlling 'lto1'
  36138. ======================================
  36139. The following flags are passed into 'lto1' and are not meant to be used
  36140. directly from the command line.
  36141. * -fwpa This option runs the serial part of the link-time optimizer
  36142. performing the inter-procedural propagation (WPA mode). The
  36143. compiler reads in summary information from all inputs and performs
  36144. an analysis based on summary information only. It generates object
  36145. files for subsequent runs of the link-time optimizer where
  36146. individual object files are optimized using both summary
  36147. information from the WPA mode and the actual function bodies. It
  36148. then drives the LTRANS phase.
  36149. * -fltrans This option runs the link-time optimizer in the
  36150. local-transformation (LTRANS) mode, which reads in output from a
  36151. previous run of the LTO in WPA mode. In the LTRANS mode, LTO
  36152. optimizes an object and produces the final assembly.
  36153. * -fltrans-output-list=FILE This option specifies a file to which the
  36154. names of LTRANS output files are written. This option is only
  36155. meaningful in conjunction with '-fwpa'.
  36156. * -fresolution=FILE This option specifies the linker resolution file.
  36157. This option is only meaningful in conjunction with '-fwpa' and as
  36158. option to pass through to the LTO linker plugin.
  36159. 
  36160. File: gccint.info, Node: Match and Simplify, Next: Static Analyzer, Prev: LTO, Up: Top
  36161. 26 Match and Simplify
  36162. *********************
  36163. The GIMPLE and GENERIC pattern matching project match-and-simplify tries
  36164. to address several issues.
  36165. 1. unify expression simplifications currently spread and duplicated
  36166. over separate files like fold-const.c, gimple-fold.c and builtins.c
  36167. 2. allow for a cheap way to implement building and simplifying
  36168. non-trivial GIMPLE expressions, avoiding the need to go through
  36169. building and simplifying GENERIC via fold_buildN and then
  36170. gimplifying via force_gimple_operand
  36171. To address these the project introduces a simple domain specific
  36172. language to write expression simplifications from which code targeting
  36173. GIMPLE and GENERIC is auto-generated. The GENERIC variant follows the
  36174. fold_buildN API while for the GIMPLE variant and to address 2) new APIs
  36175. are introduced.
  36176. * Menu:
  36177. * GIMPLE API::
  36178. * The Language::
  36179. 
  36180. File: gccint.info, Node: GIMPLE API, Next: The Language, Up: Match and Simplify
  36181. 26.1 GIMPLE API
  36182. ===============
  36183. -- GIMPLE function: tree gimple_simplify (enum tree_code, tree, tree,
  36184. gimple_seq *, tree (*)(tree))
  36185. -- GIMPLE function: tree gimple_simplify (enum tree_code, tree, tree,
  36186. tree, gimple_seq *, tree (*)(tree))
  36187. -- GIMPLE function: tree gimple_simplify (enum tree_code, tree, tree,
  36188. tree, tree, gimple_seq *, tree (*)(tree))
  36189. -- GIMPLE function: tree gimple_simplify (enum built_in_function, tree,
  36190. tree, gimple_seq *, tree (*)(tree))
  36191. -- GIMPLE function: tree gimple_simplify (enum built_in_function, tree,
  36192. tree, tree, gimple_seq *, tree (*)(tree))
  36193. -- GIMPLE function: tree gimple_simplify (enum built_in_function, tree,
  36194. tree, tree, tree, gimple_seq *, tree (*)(tree))
  36195. The main GIMPLE API entry to the expression simplifications
  36196. mimicing that of the GENERIC fold_{unary,binary,ternary} functions.
  36197. thus providing n-ary overloads for operation or function. The
  36198. additional arguments are a gimple_seq where built statements are
  36199. inserted on (if 'NULL' then simplifications requiring new statements are
  36200. not performed) and a valueization hook that can be used to tie
  36201. simplifications to a SSA lattice.
  36202. In addition to those APIs 'fold_stmt' is overloaded with a valueization
  36203. hook:
  36204. -- bool: fold_stmt (gimple_stmt_iterator *, tree (*)(tree));
  36205. Ontop of these a 'fold_buildN'-like API for GIMPLE is introduced:
  36206. -- GIMPLE function: tree gimple_build (gimple_seq *, location_t, enum
  36207. tree_code, tree, tree, tree (*valueize) (tree) = NULL);
  36208. -- GIMPLE function: tree gimple_build (gimple_seq *, location_t, enum
  36209. tree_code, tree, tree, tree, tree (*valueize) (tree) = NULL);
  36210. -- GIMPLE function: tree gimple_build (gimple_seq *, location_t, enum
  36211. tree_code, tree, tree, tree, tree, tree (*valueize) (tree) =
  36212. NULL);
  36213. -- GIMPLE function: tree gimple_build (gimple_seq *, location_t, enum
  36214. built_in_function, tree, tree, tree (*valueize) (tree) =
  36215. NULL);
  36216. -- GIMPLE function: tree gimple_build (gimple_seq *, location_t, enum
  36217. built_in_function, tree, tree, tree, tree (*valueize) (tree) =
  36218. NULL);
  36219. -- GIMPLE function: tree gimple_build (gimple_seq *, location_t, enum
  36220. built_in_function, tree, tree, tree, tree, tree (*valueize)
  36221. (tree) = NULL);
  36222. -- GIMPLE function: tree gimple_convert (gimple_seq *, location_t,
  36223. tree, tree);
  36224. which is supposed to replace 'force_gimple_operand (fold_buildN (...),
  36225. ...)' and calls to 'fold_convert'. Overloads without the 'location_t'
  36226. argument exist. Built statements are inserted on the provided sequence
  36227. and simplification is performed using the optional valueization hook.
  36228. 
  36229. File: gccint.info, Node: The Language, Prev: GIMPLE API, Up: Match and Simplify
  36230. 26.2 The Language
  36231. =================
  36232. The language to write expression simplifications in resembles other
  36233. domain-specific languages GCC uses. Thus it is lispy. Lets start with
  36234. an example from the match.pd file:
  36235. (simplify
  36236. (bit_and @0 integer_all_onesp)
  36237. @0)
  36238. This example contains all required parts of an expression
  36239. simplification. A simplification is wrapped inside a '(simplify ...)'
  36240. expression. That contains at least two operands - an expression that is
  36241. matched with the GIMPLE or GENERIC IL and a replacement expression that
  36242. is returned if the match was successful.
  36243. Expressions have an operator ID, 'bit_and' in this case. Expressions
  36244. can be lower-case tree codes with '_expr' stripped off or builtin
  36245. function code names in all-caps, like 'BUILT_IN_SQRT'.
  36246. '@n' denotes a so-called capture. It captures the operand and lets you
  36247. refer to it in other places of the match-and-simplify. In the above
  36248. example it is refered to in the replacement expression. Captures are
  36249. '@' followed by a number or an identifier.
  36250. (simplify
  36251. (bit_xor @0 @0)
  36252. { build_zero_cst (type); })
  36253. In this example '@0' is mentioned twice which constrains the matched
  36254. expression to have two equal operands. Usually matches are constraint
  36255. to equal types. If operands may be constants and conversions are
  36256. involved matching by value might be preferred in which case use '@@0' to
  36257. denote a by value match and the specific operand you want to refer to in
  36258. the result part. This example also introduces operands written in C
  36259. code. These can be used in the expression replacements and are supposed
  36260. to evaluate to a tree node which has to be a valid GIMPLE operand (so
  36261. you cannot generate expressions in C code).
  36262. (simplify
  36263. (trunc_mod integer_zerop@0 @1)
  36264. (if (!integer_zerop (@1))
  36265. @0))
  36266. Here '@0' captures the first operand of the trunc_mod expression which
  36267. is also predicated with 'integer_zerop'. Expression operands may be
  36268. either expressions, predicates or captures. Captures can be
  36269. unconstrained or capture expresions or predicates.
  36270. This example introduces an optional operand of simplify, the
  36271. if-expression. This condition is evaluated after the expression matched
  36272. in the IL and is required to evaluate to true to enable the replacement
  36273. expression in the second operand position. The expression operand of
  36274. the 'if' is a standard C expression which may contain references to
  36275. captures. The 'if' has an optional third operand which may contain the
  36276. replacement expression that is enabled when the condition evaluates to
  36277. false.
  36278. A 'if' expression can be used to specify a common condition for
  36279. multiple simplify patterns, avoiding the need to repeat that multiple
  36280. times:
  36281. (if (!TYPE_SATURATING (type)
  36282. && !FLOAT_TYPE_P (type) && !FIXED_POINT_TYPE_P (type))
  36283. (simplify
  36284. (minus (plus @0 @1) @0)
  36285. @1)
  36286. (simplify
  36287. (minus (minus @0 @1) @0)
  36288. (negate @1)))
  36289. Note that 'if's in outer position do not have the optional else clause
  36290. but instead have multiple then clauses.
  36291. Ifs can be nested.
  36292. There exists a 'switch' expression which can be used to chain
  36293. conditions avoiding nesting 'if's too much:
  36294. (simplify
  36295. (simple_comparison @0 REAL_CST@1)
  36296. (switch
  36297. /* a CMP (-0) -> a CMP 0 */
  36298. (if (REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (@1)))
  36299. (cmp @0 { build_real (TREE_TYPE (@1), dconst0); }))
  36300. /* x != NaN is always true, other ops are always false. */
  36301. (if (REAL_VALUE_ISNAN (TREE_REAL_CST (@1))
  36302. && ! HONOR_SNANS (@1))
  36303. { constant_boolean_node (cmp == NE_EXPR, type); })))
  36304. Is equal to
  36305. (simplify
  36306. (simple_comparison @0 REAL_CST@1)
  36307. (switch
  36308. /* a CMP (-0) -> a CMP 0 */
  36309. (if (REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (@1)))
  36310. (cmp @0 { build_real (TREE_TYPE (@1), dconst0); })
  36311. /* x != NaN is always true, other ops are always false. */
  36312. (if (REAL_VALUE_ISNAN (TREE_REAL_CST (@1))
  36313. && ! HONOR_SNANS (@1))
  36314. { constant_boolean_node (cmp == NE_EXPR, type); }))))
  36315. which has the second 'if' in the else operand of the first. The
  36316. 'switch' expression takes 'if' expressions as operands (which may not
  36317. have else clauses) and as a last operand a replacement expression which
  36318. should be enabled by default if no other condition evaluated to true.
  36319. Captures can also be used for capturing results of sub-expressions.
  36320. #if GIMPLE
  36321. (simplify
  36322. (pointer_plus (addr@2 @0) INTEGER_CST_P@1)
  36323. (if (is_gimple_min_invariant (@2)))
  36324. {
  36325. poly_int64 off;
  36326. tree base = get_addr_base_and_unit_offset (@0, &off);
  36327. off += tree_to_uhwi (@1);
  36328. /* Now with that we should be able to simply write
  36329. (addr (mem_ref (addr @base) (plus @off @1))) */
  36330. build1 (ADDR_EXPR, type,
  36331. build2 (MEM_REF, TREE_TYPE (TREE_TYPE (@2)),
  36332. build_fold_addr_expr (base),
  36333. build_int_cst (ptr_type_node, off)));
  36334. })
  36335. #endif
  36336. In the above example, '@2' captures the result of the expression '(addr
  36337. @0)'. For outermost expression only its type can be captured, and the
  36338. keyword 'type' is reserved for this purpose. The above example also
  36339. gives a way to conditionalize patterns to only apply to 'GIMPLE' or
  36340. 'GENERIC' by means of using the pre-defined preprocessor macros 'GIMPLE'
  36341. and 'GENERIC' and using preprocessor directives.
  36342. (simplify
  36343. (bit_and:c integral_op_p@0 (bit_ior:c (bit_not @0) @1))
  36344. (bit_and @1 @0))
  36345. Here we introduce flags on match expressions. The flag used above,
  36346. 'c', denotes that the expression should be also matched commutated.
  36347. Thus the above match expression is really the following four match
  36348. expressions:
  36349. (bit_and integral_op_p@0 (bit_ior (bit_not @0) @1))
  36350. (bit_and (bit_ior (bit_not @0) @1) integral_op_p@0)
  36351. (bit_and integral_op_p@0 (bit_ior @1 (bit_not @0)))
  36352. (bit_and (bit_ior @1 (bit_not @0)) integral_op_p@0)
  36353. Usual canonicalizations you know from GENERIC expressions are applied
  36354. before matching, so for example constant operands always come second in
  36355. commutative expressions.
  36356. The second supported flag is 's' which tells the code generator to fail
  36357. the pattern if the expression marked with 's' does have more than one
  36358. use and the simplification results in an expression with more than one
  36359. operator. For example in
  36360. (simplify
  36361. (pointer_plus (pointer_plus:s @0 @1) @3)
  36362. (pointer_plus @0 (plus @1 @3)))
  36363. this avoids the association if '(pointer_plus @0 @1)' is used outside
  36364. of the matched expression and thus it would stay live and not trivially
  36365. removed by dead code elimination. Now consider '((x + 3) + -3)' with
  36366. the temporary holding '(x + 3)' used elsewhere. This simplifies down to
  36367. 'x' which is desirable and thus flagging with 's' does not prevent the
  36368. transform. Now consider '((x + 3) + 1)' which simplifies to '(x + 4)'.
  36369. Despite being flagged with 's' the simplification will be performed.
  36370. The simplification of '((x + a) + 1)' to '(x + (a + 1))' will not
  36371. performed in this case though.
  36372. More features exist to avoid too much repetition.
  36373. (for op (plus pointer_plus minus bit_ior bit_xor)
  36374. (simplify
  36375. (op @0 integer_zerop)
  36376. @0))
  36377. A 'for' expression can be used to repeat a pattern for each operator
  36378. specified, substituting 'op'. 'for' can be nested and a 'for' can have
  36379. multiple operators to iterate.
  36380. (for opa (plus minus)
  36381. opb (minus plus)
  36382. (for opc (plus minus)
  36383. (simplify...
  36384. In this example the pattern will be repeated four times with 'opa, opb,
  36385. opc' being 'plus, minus, plus'; 'plus, minus, minus'; 'minus, plus,
  36386. plus'; 'minus, plus, minus'.
  36387. To avoid repeating operator lists in 'for' you can name them via
  36388. (define_operator_list pmm plus minus mult)
  36389. and use them in 'for' operator lists where they get expanded.
  36390. (for opa (pmm trunc_div)
  36391. (simplify...
  36392. So this example iterates over 'plus', 'minus', 'mult' and 'trunc_div'.
  36393. Using operator lists can also remove the need to explicitely write a
  36394. 'for'. All operator list uses that appear in a 'simplify' or 'match'
  36395. pattern in operator positions will implicitely be added to a new 'for'.
  36396. For example
  36397. (define_operator_list SQRT BUILT_IN_SQRTF BUILT_IN_SQRT BUILT_IN_SQRTL)
  36398. (define_operator_list POW BUILT_IN_POWF BUILT_IN_POW BUILT_IN_POWL)
  36399. (simplify
  36400. (SQRT (POW @0 @1))
  36401. (POW (abs @0) (mult @1 { built_real (TREE_TYPE (@1), dconsthalf); })))
  36402. is the same as
  36403. (for SQRT (BUILT_IN_SQRTF BUILT_IN_SQRT BUILT_IN_SQRTL)
  36404. POW (BUILT_IN_POWF BUILT_IN_POW BUILT_IN_POWL)
  36405. (simplify
  36406. (SQRT (POW @0 @1))
  36407. (POW (abs @0) (mult @1 { built_real (TREE_TYPE (@1), dconsthalf); }))))
  36408. 'for's and operator lists can include the special identifier 'null'
  36409. that matches nothing and can never be generated. This can be used to
  36410. pad an operator list so that it has a standard form, even if there isn't
  36411. a suitable operator for every form.
  36412. Another building block are 'with' expressions in the result expression
  36413. which nest the generated code in a new C block followed by its argument:
  36414. (simplify
  36415. (convert (mult @0 @1))
  36416. (with { tree utype = unsigned_type_for (type); }
  36417. (convert (mult (convert:utype @0) (convert:utype @1)))))
  36418. This allows code nested in the 'with' to refer to the declared
  36419. variables. In the above case we use the feature to specify the type of
  36420. a generated expression with the ':type' syntax where 'type' needs to be
  36421. an identifier that refers to the desired type. Usually the types of the
  36422. generated result expressions are determined from the context, but
  36423. sometimes like in the above case it is required that you specify them
  36424. explicitely.
  36425. As intermediate conversions are often optional there is a way to avoid
  36426. the need to repeat patterns both with and without such conversions.
  36427. Namely you can mark a conversion as being optional with a '?':
  36428. (simplify
  36429. (eq (convert@0 @1) (convert? @2))
  36430. (eq @1 (convert @2)))
  36431. which will match both '(eq (convert @1) (convert @2))' and '(eq
  36432. (convert @1) @2)'. The optional converts are supposed to be all either
  36433. present or not, thus '(eq (convert? @1) (convert? @2))' will result in
  36434. two patterns only. If you want to match all four combinations you have
  36435. access to two additional conditional converts as in '(eq (convert1? @1)
  36436. (convert2? @2))'.
  36437. The support for '?' marking extends to all unary operations including
  36438. predicates you declare yourself with 'match'.
  36439. Predicates available from the GCC middle-end need to be made available
  36440. explicitely via 'define_predicates':
  36441. (define_predicates
  36442. integer_onep integer_zerop integer_all_onesp)
  36443. You can also define predicates using the pattern matching language and
  36444. the 'match' form:
  36445. (match negate_expr_p
  36446. INTEGER_CST
  36447. (if (TYPE_OVERFLOW_WRAPS (type)
  36448. || may_negate_without_overflow_p (t))))
  36449. (match negate_expr_p
  36450. (negate @0))
  36451. This shows that for 'match' expressions there is 't' available which
  36452. captures the outermost expression (something not possible in the
  36453. 'simplify' context). As you can see 'match' has an identifier as first
  36454. operand which is how you refer to the predicate in patterns. Multiple
  36455. 'match' for the same identifier add additional cases where the predicate
  36456. matches.
  36457. Predicates can also match an expression in which case you need to
  36458. provide a template specifying the identifier and where to get its
  36459. operands from:
  36460. (match (logical_inverted_value @0)
  36461. (eq @0 integer_zerop))
  36462. (match (logical_inverted_value @0)
  36463. (bit_not truth_valued_p@0))
  36464. You can use the above predicate like
  36465. (simplify
  36466. (bit_and @0 (logical_inverted_value @0))
  36467. { build_zero_cst (type); })
  36468. Which will match a bitwise and of an operand with its logical inverted
  36469. value.
  36470. 
  36471. File: gccint.info, Node: Static Analyzer, Next: User Experience Guidelines, Prev: Match and Simplify, Up: Top
  36472. 27 Static Analyzer
  36473. ******************
  36474. * Menu:
  36475. * Analyzer Internals:: Analyzer Internals
  36476. * Debugging the Analyzer:: Useful debugging tips
  36477. 
  36478. File: gccint.info, Node: Analyzer Internals, Next: Debugging the Analyzer, Up: Static Analyzer
  36479. 27.1 Analyzer Internals
  36480. =======================
  36481. 27.1.1 Overview
  36482. ---------------
  36483. The analyzer implementation works on the gimple-SSA representation. (I
  36484. chose this in the hopes of making it easy to work with LTO to do
  36485. whole-program analysis).
  36486. The implementation is read-only: it doesn't attempt to change anything,
  36487. just emit warnings.
  36488. The gimple representation can be seen using '-fdump-ipa-analyzer'.
  36489. First, we build a 'supergraph' which combines the callgraph and all of
  36490. the CFGs into a single directed graph, with both interprocedural and
  36491. intraprocedural edges. The nodes and edges in the supergraph are called
  36492. "supernodes" and "superedges", and often referred to in code as 'snodes'
  36493. and 'sedges'. Basic blocks in the CFGs are split at interprocedural
  36494. calls, so there can be more than one supernode per basic block. Most
  36495. statements will be in just one supernode, but a call statement can
  36496. appear in two supernodes: at the end of one for the call, and again at
  36497. the start of another for the return.
  36498. The supergraph can be seen using '-fdump-analyzer-supergraph'.
  36499. We then build an 'analysis_plan' which walks the callgraph to determine
  36500. which calls might be suitable for being summarized (rather than fully
  36501. explored) and thus in what order to explore the functions.
  36502. Next is the heart of the analyzer: we use a worklist to explore state
  36503. within the supergraph, building an "exploded graph". Nodes in the
  36504. exploded graph correspond to <point, state> pairs, as in "Precise
  36505. Interprocedural Dataflow Analysis via Graph Reachability" (Thomas Reps,
  36506. Susan Horwitz and Mooly Sagiv).
  36507. We reuse nodes for <point, state> pairs we've already seen, and avoid
  36508. tracking state too closely, so that (hopefully) we rapidly converge on a
  36509. final exploded graph, and terminate the analysis. We also bail out if
  36510. the number of exploded <end-of-basic-block, state> nodes gets larger
  36511. than a particular multiple of the total number of basic blocks (to
  36512. ensure termination in the face of pathological state-explosion cases, or
  36513. bugs). We also stop exploring a point once we hit a limit of states for
  36514. that point.
  36515. We can identify problems directly when processing a <point, state>
  36516. instance. For example, if we're finding the successors of
  36517. <point: before-stmt: "free (ptr);",
  36518. state: {"ptr": freed}>
  36519. then we can detect a double-free of "ptr". We can then emit a path to
  36520. reach the problem by finding the simplest route through the graph.
  36521. Program points in the analysis are much more fine-grained than in the
  36522. CFG and supergraph, with points (and thus potentially exploded nodes)
  36523. for various events, including before individual statements. By default
  36524. the exploded graph merges multiple consecutive statements in a supernode
  36525. into one exploded edge to minimize the size of the exploded graph. This
  36526. can be suppressed via '-fanalyzer-fine-grained'. The fine-grained
  36527. approach seems to make things simpler and more debuggable that other
  36528. approaches I tried, in that each point is responsible for one thing.
  36529. Program points in the analysis also have a "call string" identifying
  36530. the stack of callsites below them, so that paths in the exploded graph
  36531. correspond to interprocedurally valid paths: we always return to the
  36532. correct call site, propagating state information accordingly. We avoid
  36533. infinite recursion by stopping the analysis if a callsite appears more
  36534. than 'analyzer-max-recursion-depth' in a callstring (defaulting to 2).
  36535. 27.1.2 Graphs
  36536. -------------
  36537. Nodes and edges in the exploded graph are called "exploded nodes" and
  36538. "exploded edges" and often referred to in the code as 'enodes' and
  36539. 'eedges' (especially when distinguishing them from the 'snodes' and
  36540. 'sedges' in the supergraph).
  36541. Each graph numbers its nodes, giving unique identifiers - supernodes
  36542. are referred to throughout dumps in the form 'SN': INDEX' and exploded
  36543. nodes in the form 'EN: INDEX' (e.g. 'SN: 2' and 'EN:29').
  36544. The supergraph can be seen using '-fdump-analyzer-supergraph-graph'.
  36545. The exploded graph can be seen using '-fdump-analyzer-exploded-graph'
  36546. and other dump options. Exploded nodes are color-coded in the .dot
  36547. output based on state-machine states to make it easier to see state
  36548. changes at a glance.
  36549. 27.1.3 State Tracking
  36550. ---------------------
  36551. There's a tension between:
  36552. * precision of analysis in the straight-line case, vs
  36553. * exponential blow-up in the face of control flow.
  36554. For example, in general, given this CFG:
  36555. A
  36556. / \
  36557. B C
  36558. \ /
  36559. D
  36560. / \
  36561. E F
  36562. \ /
  36563. G
  36564. we want to avoid differences in state-tracking in B and C from leading
  36565. to blow-up. If we don't prevent state blowup, we end up with
  36566. exponential growth of the exploded graph like this:
  36567. 1:A
  36568. / \
  36569. / \
  36570. / \
  36571. 2:B 3:C
  36572. | |
  36573. 4:D 5:D (2 exploded nodes for D)
  36574. / \ / \
  36575. 6:E 7:F 8:E 9:F
  36576. | | | |
  36577. 10:G 11:G 12:G 13:G (4 exploded nodes for G)
  36578. Similar issues arise with loops.
  36579. To prevent this, we follow various approaches:
  36580. a. state pruning: which tries to discard state that won't be relevant
  36581. later on withing the function. This can be disabled via
  36582. '-fno-analyzer-state-purge'.
  36583. b. state merging. We can try to find the commonality between two
  36584. program_state instances to make a third, simpler program_state. We
  36585. have two strategies here:
  36586. 1. the worklist keeps new nodes for the same program_point
  36587. together, and tries to merge them before processing, and thus
  36588. before they have successors. Hence, in the above, the two
  36589. nodes for D (4 and 5) reach the front of the worklist
  36590. together, and we create a node for D with the merger of the
  36591. incoming states.
  36592. 2. try merging with the state of existing enodes for the
  36593. program_point (which may have already been explored). There
  36594. will be duplication, but only one set of duplication;
  36595. subsequent duplicates are more likely to hit the cache. In
  36596. particular, (hopefully) all merger chains are finite, and so
  36597. we guarantee termination. This is intended to help with
  36598. loops: we ought to explore the first iteration, and then have
  36599. a "subsequent iterations" exploration, which uses a state
  36600. merged from that of the first, to be more abstract.
  36601. We avoid merging pairs of states that have state-machine
  36602. differences, as these are the kinds of differences that are likely
  36603. to be most interesting. So, for example, given:
  36604. if (condition)
  36605. ptr = malloc (size);
  36606. else
  36607. ptr = local_buf;
  36608. .... do things with 'ptr'
  36609. if (condition)
  36610. free (ptr);
  36611. ...etc
  36612. then we end up with an exploded graph that looks like this:
  36613. if (condition)
  36614. / T \ F
  36615. --------- ----------
  36616. / \
  36617. ptr = malloc (size) ptr = local_buf
  36618. | |
  36619. copy of copy of
  36620. "do things with 'ptr'" "do things with 'ptr'"
  36621. with ptr: heap-allocated with ptr: stack-allocated
  36622. | |
  36623. if (condition) if (condition)
  36624. | known to be T | known to be F
  36625. free (ptr); |
  36626. \ /
  36627. -----------------------------
  36628. | ('ptr' is pruned, so states can be merged)
  36629. etc
  36630. where some duplication has occurred, but only for the places where
  36631. the the different paths are worth exploringly separately.
  36632. Merging can be disabled via '-fno-analyzer-state-merge'.
  36633. 27.1.4 Region Model
  36634. -------------------
  36635. Part of the state stored at a 'exploded_node' is a 'region_model'. This
  36636. is an implementation of the region-based ternary model described in "A
  36637. Memory Model for Static Analysis of C Programs"
  36638. (http://lcs.ios.ac.cn/~xuzb/canalyze/memmodel.pdf) (Zhongxing Xu, Ted
  36639. Kremenek, and Jian Zhang).
  36640. A 'region_model' encapsulates a representation of the state of memory,
  36641. with a tree of 'region' instances, along with their associated values.
  36642. The representation is graph-like because values can be pointers to
  36643. regions. It also stores a constraint_manager, capturing relationships
  36644. between the values.
  36645. Because each node in the 'exploded_graph' has a 'region_model', and
  36646. each of the latter is graph-like, the 'exploded_graph' is in some ways a
  36647. graph of graphs.
  36648. Here's an example of printing a 'region_model', showing the ASCII-art
  36649. used to visualize the region hierarchy (colorized when printing to
  36650. stderr):
  36651. (gdb) call debug (*this)
  36652. r0: {kind: 'root', parent: null, sval: null}
  36653. |-stack: r1: {kind: 'stack', parent: r0, sval: sv1}
  36654. | |: sval: sv1: {poisoned: uninit}
  36655. | |-frame for 'test': r2: {kind: 'frame', parent: r1, sval: null, map: {'ptr_3': r3}, function: 'test', depth: 0}
  36656. | | `-'ptr_3': r3: {kind: 'map', parent: r2, sval: sv3, type: 'void *', map: {}}
  36657. | | |: sval: sv3: {type: 'void *', unknown}
  36658. | | |: type: 'void *'
  36659. | `-frame for 'calls_malloc': r4: {kind: 'frame', parent: r1, sval: null, map: {'result_3': r7, '_4': r8, '<anonymous>': r5}, function: 'calls_malloc', depth: 1}
  36660. | |-'<anonymous>': r5: {kind: 'map', parent: r4, sval: sv4, type: 'void *', map: {}}
  36661. | | |: sval: sv4: {type: 'void *', &r6}
  36662. | | |: type: 'void *'
  36663. | |-'result_3': r7: {kind: 'map', parent: r4, sval: sv4, type: 'void *', map: {}}
  36664. | | |: sval: sv4: {type: 'void *', &r6}
  36665. | | |: type: 'void *'
  36666. | `-'_4': r8: {kind: 'map', parent: r4, sval: sv4, type: 'void *', map: {}}
  36667. | |: sval: sv4: {type: 'void *', &r6}
  36668. | |: type: 'void *'
  36669. `-heap: r9: {kind: 'heap', parent: r0, sval: sv2}
  36670. |: sval: sv2: {poisoned: uninit}
  36671. `-r6: {kind: 'symbolic', parent: r9, sval: null, map: {}}
  36672. svalues:
  36673. sv0: {type: 'size_t', '1024'}
  36674. sv1: {poisoned: uninit}
  36675. sv2: {poisoned: uninit}
  36676. sv3: {type: 'void *', unknown}
  36677. sv4: {type: 'void *', &r6}
  36678. constraint manager:
  36679. equiv classes:
  36680. ec0: {sv0 == '1024'}
  36681. ec1: {sv4}
  36682. constraints:
  36683. This is the state at the point of returning from 'calls_malloc' back to
  36684. 'test' in the following:
  36685. void *
  36686. calls_malloc (void)
  36687. {
  36688. void *result = malloc (1024);
  36689. return result;
  36690. }
  36691. void test (void)
  36692. {
  36693. void *ptr = calls_malloc ();
  36694. /* etc. */
  36695. }
  36696. The "root" region ("r0") has a "stack" child ("r1"), with two children:
  36697. a frame for 'test' ("r2"), and a frame for 'calls_malloc' ("r4"). These
  36698. frame regions have child regions for storing their local variables. For
  36699. example, the return region and that of various other regions within the
  36700. "calls_malloc" frame all have value "sv4", a pointer to a heap-allocated
  36701. region "r6". Within the parent frame, 'ptr_3' has value "sv3", an
  36702. unknown 'void *'.
  36703. 27.1.5 Analyzer Paths
  36704. ---------------------
  36705. We need to explain to the user what the problem is, and to persuade them
  36706. that there really is a problem. Hence having a 'diagnostic_path' isn't
  36707. just an incidental detail of the analyzer; it's required.
  36708. Paths ought to be:
  36709. * interprocedurally-valid
  36710. * feasible
  36711. Without state-merging, all paths in the exploded graph are feasible (in
  36712. terms of constraints being satisified). With state-merging, paths in
  36713. the exploded graph can be infeasible.
  36714. We collate warnings and only emit them for the simplest path e.g. for
  36715. a bug in a utility function, with lots of routes to calling it, we only
  36716. emit the simplest path (which could be intraprocedural, if it can be
  36717. reproduced without a caller). We apply a check that each duplicate
  36718. warning's shortest path is feasible, rejecting any warnings for which
  36719. the shortest path is infeasible (which could lead to false negatives).
  36720. We use the shortest feasible 'exploded_path' through the
  36721. 'exploded_graph' (a list of 'exploded_edge *') to build a
  36722. 'diagnostic_path' (a list of events for the diagnostic subsystem) -
  36723. specifically a 'checker_path'.
  36724. Having built the 'checker_path', we prune it to try to eliminate events
  36725. that aren't relevant, to minimize how much the user has to read.
  36726. After pruning, we notify each event in the path of its ID and record
  36727. the IDs of interesting events, allowing for events to refer to other
  36728. events in their descriptions. The 'pending_diagnostic' class has
  36729. various vfuncs to support emitting more precise descriptions, so that
  36730. e.g.
  36731. * a deref-of-unchecked-malloc diagnostic might use:
  36732. returning possibly-NULL pointer to 'make_obj' from 'allocator'
  36733. for a 'return_event' to make it clearer how the unchecked value
  36734. moves from callee back to caller
  36735. * a double-free diagnostic might use:
  36736. second 'free' here; first 'free' was at (3)
  36737. and a use-after-free might use
  36738. use after 'free' here; memory was freed at (2)
  36739. At this point we can emit the diagnostic.
  36740. 27.1.6 Limitations
  36741. ------------------
  36742. * Only for C so far
  36743. * The implementation of call summaries is currently very simplistic.
  36744. * Lack of function pointer analysis
  36745. * The constraint-handling code assumes reflexivity in some places
  36746. (that values are equal to themselves), which is not the case for
  36747. NaN. As a simple workaround, constraints on floating-point values
  36748. are currently ignored.
  36749. * The region model code creates lots of little mutable objects at
  36750. each 'region_model' (and thus per 'exploded_node') rather than
  36751. sharing immutable objects and having the mutable state in the
  36752. 'program_state' or 'region_model'. The latter approach might be
  36753. more efficient, and might avoid dealing with IDs rather than
  36754. pointers (which requires us to impose an ordering to get meaningful
  36755. equality).
  36756. * The region model code doesn't yet support 'memcpy'. At the
  36757. gimple-ssa level these have been optimized to statements like this:
  36758. _10 = MEM <long unsigned int> [(char * {ref-all})&c]
  36759. MEM <long unsigned int> [(char * {ref-all})&d] = _10;
  36760. Perhaps they could be supported via a new 'compound_svalue' type.
  36761. * There are various other limitations in the region model (grep for
  36762. TODO/xfail in the testsuite).
  36763. * The constraint_manager's implementation of transitivity is
  36764. currently too expensive to enable by default and so must be
  36765. manually enabled via '-fanalyzer-transitivity').
  36766. * The checkers are currently hardcoded and don't allow for user
  36767. extensibility (e.g. adding allocate/release pairs).
  36768. * Although the analyzer's test suite has a proof-of-concept test case
  36769. for LTO, LTO support hasn't had extensive testing. There are
  36770. various lang-specific things in the analyzer that assume C rather
  36771. than LTO. For example, SSA names are printed to the user in "raw"
  36772. form, rather than printing the underlying variable name.
  36773. Some ideas for other checkers
  36774. * File-descriptor-based APIs
  36775. * Linux kernel internal APIs
  36776. * Signal handling
  36777. 
  36778. File: gccint.info, Node: Debugging the Analyzer, Prev: Analyzer Internals, Up: Static Analyzer
  36779. 27.2 Debugging the Analyzer
  36780. ===========================
  36781. 27.2.1 Special Functions for Debugging the Analyzer
  36782. ---------------------------------------------------
  36783. The analyzer recognizes various special functions by name, for use in
  36784. debugging the analyzer. Declarations can be seen in the testsuite in
  36785. 'analyzer-decls.h'. None of these functions are actually implemented.
  36786. Add:
  36787. __analyzer_break ();
  36788. to the source being analyzed to trigger a breakpoint in the analyzer
  36789. when that source is reached. By putting a series of these in the
  36790. source, it's much easier to effectively step through the program state
  36791. as it's analyzed.
  36792. __analyzer_dump ();
  36793. will dump the copious information about the analyzer's state each time
  36794. it reaches the call in its traversal of the source.
  36795. __analyzer_dump_path ();
  36796. will emit a placeholder "note" diagnostic with a path to that call
  36797. site, if the analyzer finds a feasible path to it.
  36798. The builtin '__analyzer_dump_exploded_nodes' will emit a warning after
  36799. analysis containing information on all of the exploded nodes at that
  36800. program point:
  36801. __analyzer_dump_exploded_nodes (0);
  36802. will output the number of "processed" nodes, and the IDs of both
  36803. "processed" and "merger" nodes, such as:
  36804. warning: 2 processed enodes: [EN: 56, EN: 58] merger(s): [EN: 54-55, EN: 57, EN: 59]
  36805. With a non-zero argument
  36806. __analyzer_dump_exploded_nodes (1);
  36807. it will also dump all of the states within the "processed" nodes.
  36808. __analyzer_dump_region_model ();
  36809. will dump the region_model's state to stderr.
  36810. __analyzer_eval (expr);
  36811. will emit a warning with text "TRUE", FALSE" or "UNKNOWN" based on the
  36812. truthfulness of the argument. This is useful for writing DejaGnu tests.
  36813. 27.2.2 Other Debugging Techniques
  36814. ---------------------------------
  36815. One approach when tracking down where a particular bogus state is
  36816. introduced into the 'exploded_graph' is to add custom code to
  36817. 'region_model::validate'.
  36818. For example, this custom code (added to 'region_model::validate')
  36819. breaks with an assertion failure when a variable called 'ptr' acquires a
  36820. value that's unknown, using 'region_model::get_value_by_name' to locate
  36821. the variable
  36822. /* Find a variable matching "ptr". */
  36823. svalue_id sid = get_value_by_name ("ptr");
  36824. if (!sid.null_p ())
  36825. {
  36826. svalue *sval = get_svalue (sid);
  36827. gcc_assert (sval->get_kind () != SK_UNKNOWN);
  36828. }
  36829. making it easier to investigate further in a debugger when this occurs.
  36830. 
  36831. File: gccint.info, Node: User Experience Guidelines, Next: Funding, Prev: Static Analyzer, Up: Top
  36832. 28 User Experience Guidelines
  36833. *****************************
  36834. To borrow a slogan from Elm
  36835. (https://elm-lang.org/news/compilers-as-assistants),
  36836. *Compilers should be assistants, not adversaries.* A compiler
  36837. should not just detect bugs, it should then help you understand why
  36838. there is a bug. It should not berate you in a robot voice, it
  36839. should give you specific hints that help you write better code.
  36840. Ultimately, a compiler should make programming faster and more fun!
  36841. -- _Evan Czaplicki_
  36842. This chapter provides guidelines on how to implement diagnostics and
  36843. command-line options in ways that we hope achieve the above ideal.
  36844. * Menu:
  36845. * Guidelines for Diagnostics:: How to implement diagnostics.
  36846. * Guidelines for Options:: Guidelines for command-line options.
  36847. 
  36848. File: gccint.info, Node: Guidelines for Diagnostics, Next: Guidelines for Options, Up: User Experience Guidelines
  36849. 28.1 Guidelines for Diagnostics
  36850. ===============================
  36851. 28.1.1 Talk in terms of the user's code
  36852. ---------------------------------------
  36853. Diagnostics should be worded in terms of the user's source code, and the
  36854. source language, rather than GCC's own implementation details.
  36855. 28.1.2 Diagnostics are actionable
  36856. ---------------------------------
  36857. A good diagnostic is "actionable": it should assist the user in taking
  36858. action.
  36859. Consider what an end user will want to do when encountering a
  36860. diagnostic.
  36861. Given an error, an end user will think: "How do I fix this?"
  36862. Given a warning, an end user will think:
  36863. * "Is this a real problem?"
  36864. * "Do I care?"
  36865. * if they decide it's genuine: "How do I fix this?"
  36866. A good diagnostic provides pertinent information to allow the user to
  36867. easily answer the above questions.
  36868. 28.1.3 The user's attention is important
  36869. ----------------------------------------
  36870. A perfect compiler would issue a warning on every aspect of the user's
  36871. source code that ought to be fixed, and issue no other warnings.
  36872. Naturally, this ideal is impossible to achieve.
  36873. Warnings should have a good "signal-to-noise ratio": we should have few
  36874. "false positives" (falsely issuing a warning when no warning is
  36875. warranted) and few "false negatives" (failing to issue a warning when
  36876. one _is_ justified).
  36877. Note that a false positive can mean, in practice, a warning that the
  36878. user doesn't agree with. Ideally a diagnostic should contain enough
  36879. information to allow the user to make an informed choice about whether
  36880. they should care (and how to fix it), but a balance must be drawn
  36881. against overloading the user with irrelevant data.
  36882. 28.1.4 Precision of Wording
  36883. ---------------------------
  36884. Provide the user with details that allow them to identify what the
  36885. problem is. For example, the vaguely-worded message:
  36886. demo.c:1:1: warning: 'noinline' attribute ignored [-Wattributes]
  36887. 1 | int foo __attribute__((noinline));
  36888. | ^~~
  36889. doesn't tell the user why the attribute was ignored, or what kind of
  36890. entity the compiler thought the attribute was being applied to (the
  36891. source location for the diagnostic is also poor; *note discussion of
  36892. 'input_location': input_location_example.). A better message would be:
  36893. demo.c:1:24: warning: attribute 'noinline' on variable 'foo' was
  36894. ignored [-Wattributes]
  36895. 1 | int foo __attribute__((noinline));
  36896. | ~~~ ~~~~~~~~~~~~~~~^~~~~~~~~
  36897. demo.c:1:24: note: attribute 'noinline' is only applicable to functions
  36898. which spells out the missing information (and fixes the location
  36899. information, as discussed below).
  36900. The above example uses a note to avoid a combinatorial explosion of
  36901. possible messages.
  36902. 28.1.5 Try the diagnostic on real-world code
  36903. --------------------------------------------
  36904. It's worth testing a new warning on many instances of real-world code,
  36905. written by different people, and seeing what it complains about, and
  36906. what it doesn't complain about.
  36907. This may suggest heuristics that silence common false positives.
  36908. It may also suggest ways to improve the precision of the message.
  36909. 28.1.6 Make mismatches clear
  36910. ----------------------------
  36911. Many diagnostics relate to a mismatch between two different places in
  36912. the user's source code. Examples include:
  36913. * a type mismatch, where the type at a usage site does not match the
  36914. type at a declaration
  36915. * the argument count at a call site does not match the parameter
  36916. count at the declaration
  36917. * something is erroneously duplicated (e.g. an error, due to breaking
  36918. a uniqueness requirement, or a warning, if it's suggestive of a
  36919. bug)
  36920. * an "opened" syntactic construct (such as an open-parenthesis) is
  36921. not closed
  36922. In each case, the diagnostic should indicate *both* pertinent locations
  36923. (so that the user can easily see the problem and how to fix it).
  36924. The standard way to do this is with a note (via 'inform'). For
  36925. example:
  36926. auto_diagnostic_group d;
  36927. if (warning_at (loc, OPT_Wduplicated_cond,
  36928. "duplicated %<if%> condition"))
  36929. inform (EXPR_LOCATION (t), "previously used here");
  36930. which leads to:
  36931. demo.c: In function 'test':
  36932. demo.c:5:17: warning: duplicated 'if' condition [-Wduplicated-cond]
  36933. 5 | else if (flag > 3)
  36934. | ~~~~~^~~
  36935. demo.c:3:12: note: previously used here
  36936. 3 | if (flag > 3)
  36937. | ~~~~~^~~
  36938. The 'inform' call should be guarded by the return value from the
  36939. 'warning_at' call so that the note isn't emitted when the warning is
  36940. suppressed.
  36941. For cases involving punctuation where the locations might be near each
  36942. other, they can be conditionally consolidated via
  36943. 'gcc_rich_location::add_location_if_nearby':
  36944. auto_diagnostic_group d;
  36945. gcc_rich_location richloc (primary_loc);
  36946. bool added secondary = richloc.add_location_if_nearby (secondary_loc);
  36947. error_at (&richloc, "main message");
  36948. if (!added secondary)
  36949. inform (secondary_loc, "message for secondary");
  36950. This will emit either one diagnostic with two locations:
  36951. demo.c:42:10: error: main message
  36952. (foo)
  36953. ~ ^
  36954. or two diagnostics:
  36955. demo.c:42:4: error: main message
  36956. foo)
  36957. ^
  36958. demo.c:40:2: note: message for secondary
  36959. (
  36960. ^
  36961. 28.1.7 Location Information
  36962. ---------------------------
  36963. GCC's 'location_t' type can support both ordinary locations, and
  36964. locations relating to a macro expansion.
  36965. As of GCC 6, ordinary locations changed from supporting just a point in
  36966. the user's source code to supporting three points: the "caret" location,
  36967. plus a start and a finish:
  36968. a = foo && bar;
  36969. ~~~~^~~~~~
  36970. | | |
  36971. | | finish
  36972. | caret
  36973. start
  36974. Tokens coming out of libcpp have locations of the form 'caret ==
  36975. start', such as for 'foo' here:
  36976. a = foo && bar;
  36977. ^~~
  36978. | |
  36979. | finish
  36980. caret == start
  36981. Compound expressions should be reported using the location of the
  36982. expression as a whole, rather than just of one token within it.
  36983. For example, in '-Wformat', rather than underlining just the first
  36984. token of a bad argument:
  36985. printf("hello %i %s", (long)0, "world");
  36986. ~^ ~
  36987. %li
  36988. the whole of the expression should be underlined, so that the user can
  36989. easily identify what is being referred to:
  36990. printf("hello %i %s", (long)0, "world");
  36991. ~^ ~~~~~~~
  36992. %li
  36993. Avoid using the 'input_location' global, and the diagnostic functions
  36994. that implicitly use it--use 'error_at' and 'warning_at' rather than
  36995. 'error' and 'warning', and provide the most appropriate 'location_t'
  36996. value available at that phase of the compilation. It's possible to
  36997. supply secondary 'location_t' values via 'rich_location'.
  36998. For example, in the example of imprecise wording above, generating the
  36999. diagnostic using 'warning':
  37000. // BAD: implicitly uses input_location
  37001. warning (OPT_Wattributes, "%qE attribute ignored", name);
  37002. leads to:
  37003. // BAD: uses input_location
  37004. demo.c:1:1: warning: 'noinline' attribute ignored [-Wattributes]
  37005. 1 | int foo __attribute__((noinline));
  37006. | ^~~
  37007. which thus happened to use the location of the 'int' token, rather than
  37008. that of the attribute. Using 'warning_at' with the location of the
  37009. attribute, providing the location of the declaration in question as a
  37010. secondary location, and adding a note:
  37011. auto_diagnostic_group d;
  37012. gcc_rich_location richloc (attrib_loc);
  37013. richloc.add_range (decl_loc);
  37014. if (warning_at (OPT_Wattributes, &richloc,
  37015. "attribute %qE on variable %qE was ignored", name))
  37016. inform (attrib_loc, "attribute %qE is only applicable to functions");
  37017. would lead to:
  37018. // OK: use location of attribute, with a secondary location
  37019. demo.c:1:24: warning: attribute 'noinline' on variable 'foo' was
  37020. ignored [-Wattributes]
  37021. 1 | int foo __attribute__((noinline));
  37022. | ~~~ ~~~~~~~~~~~~~~~^~~~~~~~~
  37023. demo.c:1:24: note: attribute 'noinline' is only applicable to functions
  37024. 28.1.8 Coding Conventions
  37025. -------------------------
  37026. See the diagnostics section
  37027. (https://gcc.gnu.org/codingconventions.html#Diagnostics) of the GCC
  37028. coding conventions.
  37029. In the C++ front end, when comparing two types in a message, use '%H'
  37030. and '%I' rather than '%T', as this allows the diagnostics subsystem to
  37031. highlight differences between template-based types. For example, rather
  37032. than using '%qT':
  37033. // BAD: a pair of %qT used in C++ front end for type comparison
  37034. error_at (loc, "could not convert %qE from %qT to %qT", expr,
  37035. TREE_TYPE (expr), type);
  37036. which could lead to:
  37037. error: could not convert 'map<int, double>()' from 'map<int,double>'
  37038. to 'map<int,int>'
  37039. using '%H' and '%I' (via '%qH' and '%qI'):
  37040. // OK: compare types in C++ front end via %qH and %qI
  37041. error_at (loc, "could not convert %qE from %qH to %qI", expr,
  37042. TREE_TYPE (expr), type);
  37043. allows the above output to be simplified to:
  37044. error: could not convert 'map<int, double>()' from 'map<[...],double>'
  37045. to 'map<[...],int>'
  37046. where the 'double' and 'int' are colorized to highlight them.
  37047. 28.1.9 Group logically-related diagnostics
  37048. ------------------------------------------
  37049. Use 'auto_diagnostic_group' when issuing multiple related diagnostics
  37050. (seen in various examples on this page). This informs the diagnostic
  37051. subsystem that all diagnostics issued within the lifetime of the
  37052. 'auto_diagnostic_group' are related. For example,
  37053. '-fdiagnostics-format=json' will treat the first diagnostic emitted
  37054. within the group as a top-level diagnostic, and all subsequent
  37055. diagnostics within the group as its children.
  37056. 28.1.10 Quoting
  37057. ---------------
  37058. Text should be quoted by either using the 'q' modifier in a directive
  37059. such as '%qE', or by enclosing the quoted text in a pair of '%<' and
  37060. '%>' directives, and never by using explicit quote characters. The
  37061. directives handle the appropriate quote characters for each language and
  37062. apply the correct color or highlighting.
  37063. The following elements should be quoted in GCC diagnostics:
  37064. * Language keywords.
  37065. * Tokens.
  37066. * Boolean, numerical, character, and string constants that appear in
  37067. the source code.
  37068. * Identifiers, including function, macro, type, and variable names.
  37069. Other elements such as numbers that do not refer to numeric constants
  37070. that appear in the source code should not be quoted. For example, in
  37071. the message:
  37072. argument %d of %qE must be a pointer type
  37073. since the argument number does not refer to a numerical constant in the
  37074. source code it should not be quoted.
  37075. 28.1.11 Spelling and Terminology
  37076. --------------------------------
  37077. See the terminology and markup
  37078. (https://gcc.gnu.org/codingconventions.html#Spelling Spelling) section
  37079. of the GCC coding conventions.
  37080. 28.1.12 Fix-it hints
  37081. --------------------
  37082. GCC's diagnostic subsystem can emit "fix-it hints": small suggested
  37083. edits to the user's source code.
  37084. They are printed by default underneath the code in question. They can
  37085. also be viewed via '-fdiagnostics-generate-patch' and
  37086. '-fdiagnostics-parseable-fixits'. With the latter, an IDE ought to be
  37087. able to offer to automatically apply the suggested fix.
  37088. Fix-it hints contain code fragments, and thus they should not be marked
  37089. for translation.
  37090. Fix-it hints can be added to a diagnostic by using a 'rich_location'
  37091. rather than a 'location_t' - the fix-it hints are added to the
  37092. 'rich_location' using one of the various 'add_fixit' member functions of
  37093. 'rich_location'. They are documented with 'rich_location' in
  37094. 'libcpp/line-map.h'. It's easiest to use the 'gcc_rich_location'
  37095. subclass of 'rich_location' found in 'gcc-rich-location.h', as this
  37096. implicitly supplies the 'line_table' variable.
  37097. For example:
  37098. if (const char *suggestion = hint.suggestion ())
  37099. {
  37100. gcc_rich_location richloc (location);
  37101. richloc.add_fixit_replace (suggestion);
  37102. error_at (&richloc,
  37103. "%qE does not name a type; did you mean %qs?",
  37104. id, suggestion);
  37105. }
  37106. which can lead to:
  37107. spellcheck-typenames.C:73:1: error: 'singed' does not name a type; did
  37108. you mean 'signed'?
  37109. 73 | singed char ch;
  37110. | ^~~~~~
  37111. | signed
  37112. Non-trivial edits can be built up by adding multiple fix-it hints to
  37113. one 'rich_location'. It's best to express the edits in terms of the
  37114. locations of individual tokens. Various handy functions for adding
  37115. fix-it hints for idiomatic C and C++ can be seen in
  37116. 'gcc-rich-location.h'.
  37117. 28.1.12.1 Fix-it hints should work
  37118. ..................................
  37119. When implementing a fix-it hint, please verify that the suggested edit
  37120. leads to fixed, compilable code. (Unfortunately, this currently must be
  37121. done by hand using '-fdiagnostics-generate-patch'. It would be good to
  37122. have an automated way of verifying that fix-it hints actually fix the
  37123. code).
  37124. For example, a "gotcha" here is to forget to add a space when adding a
  37125. missing reserved word. Consider a C++ fix-it hint that adds 'typename'
  37126. in front of a template declaration. A naive way to implement this might
  37127. be:
  37128. gcc_rich_location richloc (loc);
  37129. // BAD: insertion is missing a trailing space
  37130. richloc.add_fixit_insert_before ("typename");
  37131. error_at (&richloc, "need %<typename%> before %<%T::%E%> because "
  37132. "%qT is a dependent scope",
  37133. parser->scope, id, parser->scope);
  37134. When applied to the code, this might lead to:
  37135. T::type x;
  37136. being "corrected" to:
  37137. typenameT::type x;
  37138. In this case, the correct thing to do is to add a trailing space after
  37139. 'typename':
  37140. gcc_rich_location richloc (loc);
  37141. // OK: note that here we have a trailing space
  37142. richloc.add_fixit_insert_before ("typename ");
  37143. error_at (&richloc, "need %<typename%> before %<%T::%E%> because "
  37144. "%qT is a dependent scope",
  37145. parser->scope, id, parser->scope);
  37146. leading to this corrected code:
  37147. typename T::type x;
  37148. 28.1.12.2 Express deletion in terms of deletion, not replacement
  37149. ................................................................
  37150. It's best to express deletion suggestions in terms of deletion fix-it
  37151. hints, rather than replacement fix-it hints. For example, consider
  37152. this:
  37153. auto_diagnostic_group d;
  37154. gcc_rich_location richloc (location_of (retval));
  37155. tree name = DECL_NAME (arg);
  37156. richloc.add_fixit_replace (IDENTIFIER_POINTER (name));
  37157. warning_at (&richloc, OPT_Wredundant_move,
  37158. "redundant move in return statement");
  37159. which is intended to e.g. replace a 'std::move' with the underlying
  37160. value:
  37161. return std::move (retval);
  37162. ~~~~~~~~~~^~~~~~~~
  37163. retval
  37164. where the change has been expressed as replacement, replacing with the
  37165. name of the declaration. This works for simple cases, but consider this
  37166. case:
  37167. #ifdef SOME_CONFIG_FLAG
  37168. # define CONFIGURY_GLOBAL global_a
  37169. #else
  37170. # define CONFIGURY_GLOBAL global_b
  37171. #endif
  37172. int fn ()
  37173. {
  37174. return std::move (CONFIGURY_GLOBAL /* some comment */);
  37175. }
  37176. The above implementation erroneously strips out the macro and the
  37177. comment in the fix-it hint:
  37178. return std::move (CONFIGURY_GLOBAL /* some comment */);
  37179. ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  37180. global_a
  37181. and thus this resulting code:
  37182. return global_a;
  37183. It's better to do deletions in terms of deletions; deleting the
  37184. 'std::move (' and the trailing close-paren, leading to this:
  37185. return std::move (CONFIGURY_GLOBAL /* some comment */);
  37186. ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  37187. CONFIGURY_GLOBAL /* some comment */
  37188. and thus this result:
  37189. return CONFIGURY_GLOBAL /* some comment */;
  37190. Unfortunately, the pertinent 'location_t' values are not always
  37191. available.
  37192. 28.1.12.3 Multiple suggestions
  37193. ..............................
  37194. In the rare cases where you need to suggest more than one mutually
  37195. exclusive solution to a problem, this can be done by emitting multiple
  37196. notes and calling 'rich_location::fixits_cannot_be_auto_applied' on each
  37197. note's 'rich_location'. If this is called, then the fix-it hints in the
  37198. 'rich_location' will be printed, but will not be added to generated
  37199. patches.
  37200. 
  37201. File: gccint.info, Node: Guidelines for Options, Prev: Guidelines for Diagnostics, Up: User Experience Guidelines
  37202. 28.2 Guidelines for Options
  37203. ===========================
  37204. 
  37205. File: gccint.info, Node: Funding, Next: GNU Project, Prev: User Experience Guidelines, Up: Top
  37206. Funding Free Software
  37207. *********************
  37208. If you want to have more free software a few years from now, it makes
  37209. sense for you to help encourage people to contribute funds for its
  37210. development. The most effective approach known is to encourage
  37211. commercial redistributors to donate.
  37212. Users of free software systems can boost the pace of development by
  37213. encouraging for-a-fee distributors to donate part of their selling price
  37214. to free software developers--the Free Software Foundation, and others.
  37215. The way to convince distributors to do this is to demand it and expect
  37216. it from them. So when you compare distributors, judge them partly by
  37217. how much they give to free software development. Show distributors they
  37218. must compete to be the one who gives the most.
  37219. To make this approach work, you must insist on numbers that you can
  37220. compare, such as, "We will donate ten dollars to the Frobnitz project
  37221. for each disk sold." Don't be satisfied with a vague promise, such as
  37222. "A portion of the profits are donated," since it doesn't give a basis
  37223. for comparison.
  37224. Even a precise fraction "of the profits from this disk" is not very
  37225. meaningful, since creative accounting and unrelated business decisions
  37226. can greatly alter what fraction of the sales price counts as profit. If
  37227. the price you pay is $50, ten percent of the profit is probably less
  37228. than a dollar; it might be a few cents, or nothing at all.
  37229. Some redistributors do development work themselves. This is useful
  37230. too; but to keep everyone honest, you need to inquire how much they do,
  37231. and what kind. Some kinds of development make much more long-term
  37232. difference than others. For example, maintaining a separate version of
  37233. a program contributes very little; maintaining the standard version of a
  37234. program for the whole community contributes much. Easy new ports
  37235. contribute little, since someone else would surely do them; difficult
  37236. ports such as adding a new CPU to the GNU Compiler Collection contribute
  37237. more; major new features or packages contribute the most.
  37238. By establishing the idea that supporting further development is "the
  37239. proper thing to do" when distributing free software for a fee, we can
  37240. assure a steady flow of resources into making more free software.
  37241. Copyright (C) 1994 Free Software Foundation, Inc.
  37242. Verbatim copying and redistribution of this section is permitted
  37243. without royalty; alteration is not permitted.
  37244. 
  37245. File: gccint.info, Node: GNU Project, Next: Copying, Prev: Funding, Up: Top
  37246. The GNU Project and GNU/Linux
  37247. *****************************
  37248. The GNU Project was launched in 1984 to develop a complete Unix-like
  37249. operating system which is free software: the GNU system. (GNU is a
  37250. recursive acronym for "GNU's Not Unix"; it is pronounced "guh-NEW".)
  37251. Variants of the GNU operating system, which use the kernel Linux, are
  37252. now widely used; though these systems are often referred to as "Linux",
  37253. they are more accurately called GNU/Linux systems.
  37254. For more information, see:
  37255. <http://www.gnu.org/>
  37256. <http://www.gnu.org/gnu/linux-and-gnu.html>
  37257. 
  37258. File: gccint.info, Node: Copying, Next: GNU Free Documentation License, Prev: GNU Project, Up: Top
  37259. GNU General Public License
  37260. **************************
  37261. Version 3, 29 June 2007
  37262. Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
  37263. Everyone is permitted to copy and distribute verbatim copies of this
  37264. license document, but changing it is not allowed.
  37265. Preamble
  37266. ========
  37267. The GNU General Public License is a free, copyleft license for software
  37268. and other kinds of works.
  37269. The licenses for most software and other practical works are designed
  37270. to take away your freedom to share and change the works. By contrast,
  37271. the GNU General Public License is intended to guarantee your freedom to
  37272. share and change all versions of a program-to make sure it remains free
  37273. software for all its users. We, the Free Software Foundation, use the
  37274. GNU General Public License for most of our software; it applies also to
  37275. any other work released this way by its authors. You can apply it to
  37276. your programs, too.
  37277. When we speak of free software, we are referring to freedom, not price.
  37278. Our General Public Licenses are designed to make sure that you have the
  37279. freedom to distribute copies of free software (and charge for them if
  37280. you wish), that you receive source code or can get it if you want it,
  37281. that you can change the software or use pieces of it in new free
  37282. programs, and that you know you can do these things.
  37283. To protect your rights, we need to prevent others from denying you
  37284. these rights or asking you to surrender the rights. Therefore, you have
  37285. certain responsibilities if you distribute copies of the software, or if
  37286. you modify it: responsibilities to respect the freedom of others.
  37287. For example, if you distribute copies of such a program, whether gratis
  37288. or for a fee, you must pass on to the recipients the same freedoms that
  37289. you received. You must make sure that they, too, receive or can get the
  37290. source code. And you must show them these terms so they know their
  37291. rights.
  37292. Developers that use the GNU GPL protect your rights with two steps: (1)
  37293. assert copyright on the software, and (2) offer you this License giving
  37294. you legal permission to copy, distribute and/or modify it.
  37295. For the developers' and authors' protection, the GPL clearly explains
  37296. that there is no warranty for this free software. For both users' and
  37297. authors' sake, the GPL requires that modified versions be marked as
  37298. changed, so that their problems will not be attributed erroneously to
  37299. authors of previous versions.
  37300. Some devices are designed to deny users access to install or run
  37301. modified versions of the software inside them, although the manufacturer
  37302. can do so. This is fundamentally incompatible with the aim of
  37303. protecting users' freedom to change the software. The systematic
  37304. pattern of such abuse occurs in the area of products for individuals to
  37305. use, which is precisely where it is most unacceptable. Therefore, we
  37306. have designed this version of the GPL to prohibit the practice for those
  37307. products. If such problems arise substantially in other domains, we
  37308. stand ready to extend this provision to those domains in future versions
  37309. of the GPL, as needed to protect the freedom of users.
  37310. Finally, every program is threatened constantly by software patents.
  37311. States should not allow patents to restrict development and use of
  37312. software on general-purpose computers, but in those that do, we wish to
  37313. avoid the special danger that patents applied to a free program could
  37314. make it effectively proprietary. To prevent this, the GPL assures that
  37315. patents cannot be used to render the program non-free.
  37316. The precise terms and conditions for copying, distribution and
  37317. modification follow.
  37318. TERMS AND CONDITIONS
  37319. ====================
  37320. 0. Definitions.
  37321. "This License" refers to version 3 of the GNU General Public
  37322. License.
  37323. "Copyright" also means copyright-like laws that apply to other
  37324. kinds of works, such as semiconductor masks.
  37325. "The Program" refers to any copyrightable work licensed under this
  37326. License. Each licensee is addressed as "you". "Licensees" and
  37327. "recipients" may be individuals or organizations.
  37328. To "modify" a work means to copy from or adapt all or part of the
  37329. work in a fashion requiring copyright permission, other than the
  37330. making of an exact copy. The resulting work is called a "modified
  37331. version" of the earlier work or a work "based on" the earlier work.
  37332. A "covered work" means either the unmodified Program or a work
  37333. based on the Program.
  37334. To "propagate" a work means to do anything with it that, without
  37335. permission, would make you directly or secondarily liable for
  37336. infringement under applicable copyright law, except executing it on
  37337. a computer or modifying a private copy. Propagation includes
  37338. copying, distribution (with or without modification), making
  37339. available to the public, and in some countries other activities as
  37340. well.
  37341. To "convey" a work means any kind of propagation that enables other
  37342. parties to make or receive copies. Mere interaction with a user
  37343. through a computer network, with no transfer of a copy, is not
  37344. conveying.
  37345. An interactive user interface displays "Appropriate Legal Notices"
  37346. to the extent that it includes a convenient and prominently visible
  37347. feature that (1) displays an appropriate copyright notice, and (2)
  37348. tells the user that there is no warranty for the work (except to
  37349. the extent that warranties are provided), that licensees may convey
  37350. the work under this License, and how to view a copy of this
  37351. License. If the interface presents a list of user commands or
  37352. options, such as a menu, a prominent item in the list meets this
  37353. criterion.
  37354. 1. Source Code.
  37355. The "source code" for a work means the preferred form of the work
  37356. for making modifications to it. "Object code" means any non-source
  37357. form of a work.
  37358. A "Standard Interface" means an interface that either is an
  37359. official standard defined by a recognized standards body, or, in
  37360. the case of interfaces specified for a particular programming
  37361. language, one that is widely used among developers working in that
  37362. language.
  37363. The "System Libraries" of an executable work include anything,
  37364. other than the work as a whole, that (a) is included in the normal
  37365. form of packaging a Major Component, but which is not part of that
  37366. Major Component, and (b) serves only to enable use of the work with
  37367. that Major Component, or to implement a Standard Interface for
  37368. which an implementation is available to the public in source code
  37369. form. A "Major Component", in this context, means a major
  37370. essential component (kernel, window system, and so on) of the
  37371. specific operating system (if any) on which the executable work
  37372. runs, or a compiler used to produce the work, or an object code
  37373. interpreter used to run it.
  37374. The "Corresponding Source" for a work in object code form means all
  37375. the source code needed to generate, install, and (for an executable
  37376. work) run the object code and to modify the work, including scripts
  37377. to control those activities. However, it does not include the
  37378. work's System Libraries, or general-purpose tools or generally
  37379. available free programs which are used unmodified in performing
  37380. those activities but which are not part of the work. For example,
  37381. Corresponding Source includes interface definition files associated
  37382. with source files for the work, and the source code for shared
  37383. libraries and dynamically linked subprograms that the work is
  37384. specifically designed to require, such as by intimate data
  37385. communication or control flow between those subprograms and other
  37386. parts of the work.
  37387. The Corresponding Source need not include anything that users can
  37388. regenerate automatically from other parts of the Corresponding
  37389. Source.
  37390. The Corresponding Source for a work in source code form is that
  37391. same work.
  37392. 2. Basic Permissions.
  37393. All rights granted under this License are granted for the term of
  37394. copyright on the Program, and are irrevocable provided the stated
  37395. conditions are met. This License explicitly affirms your unlimited
  37396. permission to run the unmodified Program. The output from running
  37397. a covered work is covered by this License only if the output, given
  37398. its content, constitutes a covered work. This License acknowledges
  37399. your rights of fair use or other equivalent, as provided by
  37400. copyright law.
  37401. You may make, run and propagate covered works that you do not
  37402. convey, without conditions so long as your license otherwise
  37403. remains in force. You may convey covered works to others for the
  37404. sole purpose of having them make modifications exclusively for you,
  37405. or provide you with facilities for running those works, provided
  37406. that you comply with the terms of this License in conveying all
  37407. material for which you do not control copyright. Those thus making
  37408. or running the covered works for you must do so exclusively on your
  37409. behalf, under your direction and control, on terms that prohibit
  37410. them from making any copies of your copyrighted material outside
  37411. their relationship with you.
  37412. Conveying under any other circumstances is permitted solely under
  37413. the conditions stated below. Sublicensing is not allowed; section
  37414. 10 makes it unnecessary.
  37415. 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
  37416. No covered work shall be deemed part of an effective technological
  37417. measure under any applicable law fulfilling obligations under
  37418. article 11 of the WIPO copyright treaty adopted on 20 December
  37419. 1996, or similar laws prohibiting or restricting circumvention of
  37420. such measures.
  37421. When you convey a covered work, you waive any legal power to forbid
  37422. circumvention of technological measures to the extent such
  37423. circumvention is effected by exercising rights under this License
  37424. with respect to the covered work, and you disclaim any intention to
  37425. limit operation or modification of the work as a means of
  37426. enforcing, against the work's users, your or third parties' legal
  37427. rights to forbid circumvention of technological measures.
  37428. 4. Conveying Verbatim Copies.
  37429. You may convey verbatim copies of the Program's source code as you
  37430. receive it, in any medium, provided that you conspicuously and
  37431. appropriately publish on each copy an appropriate copyright notice;
  37432. keep intact all notices stating that this License and any
  37433. non-permissive terms added in accord with section 7 apply to the
  37434. code; keep intact all notices of the absence of any warranty; and
  37435. give all recipients a copy of this License along with the Program.
  37436. You may charge any price or no price for each copy that you convey,
  37437. and you may offer support or warranty protection for a fee.
  37438. 5. Conveying Modified Source Versions.
  37439. You may convey a work based on the Program, or the modifications to
  37440. produce it from the Program, in the form of source code under the
  37441. terms of section 4, provided that you also meet all of these
  37442. conditions:
  37443. a. The work must carry prominent notices stating that you
  37444. modified it, and giving a relevant date.
  37445. b. The work must carry prominent notices stating that it is
  37446. released under this License and any conditions added under
  37447. section 7. This requirement modifies the requirement in
  37448. section 4 to "keep intact all notices".
  37449. c. You must license the entire work, as a whole, under this
  37450. License to anyone who comes into possession of a copy. This
  37451. License will therefore apply, along with any applicable
  37452. section 7 additional terms, to the whole of the work, and all
  37453. its parts, regardless of how they are packaged. This License
  37454. gives no permission to license the work in any other way, but
  37455. it does not invalidate such permission if you have separately
  37456. received it.
  37457. d. If the work has interactive user interfaces, each must display
  37458. Appropriate Legal Notices; however, if the Program has
  37459. interactive interfaces that do not display Appropriate Legal
  37460. Notices, your work need not make them do so.
  37461. A compilation of a covered work with other separate and independent
  37462. works, which are not by their nature extensions of the covered
  37463. work, and which are not combined with it such as to form a larger
  37464. program, in or on a volume of a storage or distribution medium, is
  37465. called an "aggregate" if the compilation and its resulting
  37466. copyright are not used to limit the access or legal rights of the
  37467. compilation's users beyond what the individual works permit.
  37468. Inclusion of a covered work in an aggregate does not cause this
  37469. License to apply to the other parts of the aggregate.
  37470. 6. Conveying Non-Source Forms.
  37471. You may convey a covered work in object code form under the terms
  37472. of sections 4 and 5, provided that you also convey the
  37473. machine-readable Corresponding Source under the terms of this
  37474. License, in one of these ways:
  37475. a. Convey the object code in, or embodied in, a physical product
  37476. (including a physical distribution medium), accompanied by the
  37477. Corresponding Source fixed on a durable physical medium
  37478. customarily used for software interchange.
  37479. b. Convey the object code in, or embodied in, a physical product
  37480. (including a physical distribution medium), accompanied by a
  37481. written offer, valid for at least three years and valid for as
  37482. long as you offer spare parts or customer support for that
  37483. product model, to give anyone who possesses the object code
  37484. either (1) a copy of the Corresponding Source for all the
  37485. software in the product that is covered by this License, on a
  37486. durable physical medium customarily used for software
  37487. interchange, for a price no more than your reasonable cost of
  37488. physically performing this conveying of source, or (2) access
  37489. to copy the Corresponding Source from a network server at no
  37490. charge.
  37491. c. Convey individual copies of the object code with a copy of the
  37492. written offer to provide the Corresponding Source. This
  37493. alternative is allowed only occasionally and noncommercially,
  37494. and only if you received the object code with such an offer,
  37495. in accord with subsection 6b.
  37496. d. Convey the object code by offering access from a designated
  37497. place (gratis or for a charge), and offer equivalent access to
  37498. the Corresponding Source in the same way through the same
  37499. place at no further charge. You need not require recipients
  37500. to copy the Corresponding Source along with the object code.
  37501. If the place to copy the object code is a network server, the
  37502. Corresponding Source may be on a different server (operated by
  37503. you or a third party) that supports equivalent copying
  37504. facilities, provided you maintain clear directions next to the
  37505. object code saying where to find the Corresponding Source.
  37506. Regardless of what server hosts the Corresponding Source, you
  37507. remain obligated to ensure that it is available for as long as
  37508. needed to satisfy these requirements.
  37509. e. Convey the object code using peer-to-peer transmission,
  37510. provided you inform other peers where the object code and
  37511. Corresponding Source of the work are being offered to the
  37512. general public at no charge under subsection 6d.
  37513. A separable portion of the object code, whose source code is
  37514. excluded from the Corresponding Source as a System Library, need
  37515. not be included in conveying the object code work.
  37516. A "User Product" is either (1) a "consumer product", which means
  37517. any tangible personal property which is normally used for personal,
  37518. family, or household purposes, or (2) anything designed or sold for
  37519. incorporation into a dwelling. In determining whether a product is
  37520. a consumer product, doubtful cases shall be resolved in favor of
  37521. coverage. For a particular product received by a particular user,
  37522. "normally used" refers to a typical or common use of that class of
  37523. product, regardless of the status of the particular user or of the
  37524. way in which the particular user actually uses, or expects or is
  37525. expected to use, the product. A product is a consumer product
  37526. regardless of whether the product has substantial commercial,
  37527. industrial or non-consumer uses, unless such uses represent the
  37528. only significant mode of use of the product.
  37529. "Installation Information" for a User Product means any methods,
  37530. procedures, authorization keys, or other information required to
  37531. install and execute modified versions of a covered work in that
  37532. User Product from a modified version of its Corresponding Source.
  37533. The information must suffice to ensure that the continued
  37534. functioning of the modified object code is in no case prevented or
  37535. interfered with solely because modification has been made.
  37536. If you convey an object code work under this section in, or with,
  37537. or specifically for use in, a User Product, and the conveying
  37538. occurs as part of a transaction in which the right of possession
  37539. and use of the User Product is transferred to the recipient in
  37540. perpetuity or for a fixed term (regardless of how the transaction
  37541. is characterized), the Corresponding Source conveyed under this
  37542. section must be accompanied by the Installation Information. But
  37543. this requirement does not apply if neither you nor any third party
  37544. retains the ability to install modified object code on the User
  37545. Product (for example, the work has been installed in ROM).
  37546. The requirement to provide Installation Information does not
  37547. include a requirement to continue to provide support service,
  37548. warranty, or updates for a work that has been modified or installed
  37549. by the recipient, or for the User Product in which it has been
  37550. modified or installed. Access to a network may be denied when the
  37551. modification itself materially and adversely affects the operation
  37552. of the network or violates the rules and protocols for
  37553. communication across the network.
  37554. Corresponding Source conveyed, and Installation Information
  37555. provided, in accord with this section must be in a format that is
  37556. publicly documented (and with an implementation available to the
  37557. public in source code form), and must require no special password
  37558. or key for unpacking, reading or copying.
  37559. 7. Additional Terms.
  37560. "Additional permissions" are terms that supplement the terms of
  37561. this License by making exceptions from one or more of its
  37562. conditions. Additional permissions that are applicable to the
  37563. entire Program shall be treated as though they were included in
  37564. this License, to the extent that they are valid under applicable
  37565. law. If additional permissions apply only to part of the Program,
  37566. that part may be used separately under those permissions, but the
  37567. entire Program remains governed by this License without regard to
  37568. the additional permissions.
  37569. When you convey a copy of a covered work, you may at your option
  37570. remove any additional permissions from that copy, or from any part
  37571. of it. (Additional permissions may be written to require their own
  37572. removal in certain cases when you modify the work.) You may place
  37573. additional permissions on material, added by you to a covered work,
  37574. for which you have or can give appropriate copyright permission.
  37575. Notwithstanding any other provision of this License, for material
  37576. you add to a covered work, you may (if authorized by the copyright
  37577. holders of that material) supplement the terms of this License with
  37578. terms:
  37579. a. Disclaiming warranty or limiting liability differently from
  37580. the terms of sections 15 and 16 of this License; or
  37581. b. Requiring preservation of specified reasonable legal notices
  37582. or author attributions in that material or in the Appropriate
  37583. Legal Notices displayed by works containing it; or
  37584. c. Prohibiting misrepresentation of the origin of that material,
  37585. or requiring that modified versions of such material be marked
  37586. in reasonable ways as different from the original version; or
  37587. d. Limiting the use for publicity purposes of names of licensors
  37588. or authors of the material; or
  37589. e. Declining to grant rights under trademark law for use of some
  37590. trade names, trademarks, or service marks; or
  37591. f. Requiring indemnification of licensors and authors of that
  37592. material by anyone who conveys the material (or modified
  37593. versions of it) with contractual assumptions of liability to
  37594. the recipient, for any liability that these contractual
  37595. assumptions directly impose on those licensors and authors.
  37596. All other non-permissive additional terms are considered "further
  37597. restrictions" within the meaning of section 10. If the Program as
  37598. you received it, or any part of it, contains a notice stating that
  37599. it is governed by this License along with a term that is a further
  37600. restriction, you may remove that term. If a license document
  37601. contains a further restriction but permits relicensing or conveying
  37602. under this License, you may add to a covered work material governed
  37603. by the terms of that license document, provided that the further
  37604. restriction does not survive such relicensing or conveying.
  37605. If you add terms to a covered work in accord with this section, you
  37606. must place, in the relevant source files, a statement of the
  37607. additional terms that apply to those files, or a notice indicating
  37608. where to find the applicable terms.
  37609. Additional terms, permissive or non-permissive, may be stated in
  37610. the form of a separately written license, or stated as exceptions;
  37611. the above requirements apply either way.
  37612. 8. Termination.
  37613. You may not propagate or modify a covered work except as expressly
  37614. provided under this License. Any attempt otherwise to propagate or
  37615. modify it is void, and will automatically terminate your rights
  37616. under this License (including any patent licenses granted under the
  37617. third paragraph of section 11).
  37618. However, if you cease all violation of this License, then your
  37619. license from a particular copyright holder is reinstated (a)
  37620. provisionally, unless and until the copyright holder explicitly and
  37621. finally terminates your license, and (b) permanently, if the
  37622. copyright holder fails to notify you of the violation by some
  37623. reasonable means prior to 60 days after the cessation.
  37624. Moreover, your license from a particular copyright holder is
  37625. reinstated permanently if the copyright holder notifies you of the
  37626. violation by some reasonable means, this is the first time you have
  37627. received notice of violation of this License (for any work) from
  37628. that copyright holder, and you cure the violation prior to 30 days
  37629. after your receipt of the notice.
  37630. Termination of your rights under this section does not terminate
  37631. the licenses of parties who have received copies or rights from you
  37632. under this License. If your rights have been terminated and not
  37633. permanently reinstated, you do not qualify to receive new licenses
  37634. for the same material under section 10.
  37635. 9. Acceptance Not Required for Having Copies.
  37636. You are not required to accept this License in order to receive or
  37637. run a copy of the Program. Ancillary propagation of a covered work
  37638. occurring solely as a consequence of using peer-to-peer
  37639. transmission to receive a copy likewise does not require
  37640. acceptance. However, nothing other than this License grants you
  37641. permission to propagate or modify any covered work. These actions
  37642. infringe copyright if you do not accept this License. Therefore,
  37643. by modifying or propagating a covered work, you indicate your
  37644. acceptance of this License to do so.
  37645. 10. Automatic Licensing of Downstream Recipients.
  37646. Each time you convey a covered work, the recipient automatically
  37647. receives a license from the original licensors, to run, modify and
  37648. propagate that work, subject to this License. You are not
  37649. responsible for enforcing compliance by third parties with this
  37650. License.
  37651. An "entity transaction" is a transaction transferring control of an
  37652. organization, or substantially all assets of one, or subdividing an
  37653. organization, or merging organizations. If propagation of a
  37654. covered work results from an entity transaction, each party to that
  37655. transaction who receives a copy of the work also receives whatever
  37656. licenses to the work the party's predecessor in interest had or
  37657. could give under the previous paragraph, plus a right to possession
  37658. of the Corresponding Source of the work from the predecessor in
  37659. interest, if the predecessor has it or can get it with reasonable
  37660. efforts.
  37661. You may not impose any further restrictions on the exercise of the
  37662. rights granted or affirmed under this License. For example, you
  37663. may not impose a license fee, royalty, or other charge for exercise
  37664. of rights granted under this License, and you may not initiate
  37665. litigation (including a cross-claim or counterclaim in a lawsuit)
  37666. alleging that any patent claim is infringed by making, using,
  37667. selling, offering for sale, or importing the Program or any portion
  37668. of it.
  37669. 11. Patents.
  37670. A "contributor" is a copyright holder who authorizes use under this
  37671. License of the Program or a work on which the Program is based.
  37672. The work thus licensed is called the contributor's "contributor
  37673. version".
  37674. A contributor's "essential patent claims" are all patent claims
  37675. owned or controlled by the contributor, whether already acquired or
  37676. hereafter acquired, that would be infringed by some manner,
  37677. permitted by this License, of making, using, or selling its
  37678. contributor version, but do not include claims that would be
  37679. infringed only as a consequence of further modification of the
  37680. contributor version. For purposes of this definition, "control"
  37681. includes the right to grant patent sublicenses in a manner
  37682. consistent with the requirements of this License.
  37683. Each contributor grants you a non-exclusive, worldwide,
  37684. royalty-free patent license under the contributor's essential
  37685. patent claims, to make, use, sell, offer for sale, import and
  37686. otherwise run, modify and propagate the contents of its contributor
  37687. version.
  37688. In the following three paragraphs, a "patent license" is any
  37689. express agreement or commitment, however denominated, not to
  37690. enforce a patent (such as an express permission to practice a
  37691. patent or covenant not to sue for patent infringement). To "grant"
  37692. such a patent license to a party means to make such an agreement or
  37693. commitment not to enforce a patent against the party.
  37694. If you convey a covered work, knowingly relying on a patent
  37695. license, and the Corresponding Source of the work is not available
  37696. for anyone to copy, free of charge and under the terms of this
  37697. License, through a publicly available network server or other
  37698. readily accessible means, then you must either (1) cause the
  37699. Corresponding Source to be so available, or (2) arrange to deprive
  37700. yourself of the benefit of the patent license for this particular
  37701. work, or (3) arrange, in a manner consistent with the requirements
  37702. of this License, to extend the patent license to downstream
  37703. recipients. "Knowingly relying" means you have actual knowledge
  37704. that, but for the patent license, your conveying the covered work
  37705. in a country, or your recipient's use of the covered work in a
  37706. country, would infringe one or more identifiable patents in that
  37707. country that you have reason to believe are valid.
  37708. If, pursuant to or in connection with a single transaction or
  37709. arrangement, you convey, or propagate by procuring conveyance of, a
  37710. covered work, and grant a patent license to some of the parties
  37711. receiving the covered work authorizing them to use, propagate,
  37712. modify or convey a specific copy of the covered work, then the
  37713. patent license you grant is automatically extended to all
  37714. recipients of the covered work and works based on it.
  37715. A patent license is "discriminatory" if it does not include within
  37716. the scope of its coverage, prohibits the exercise of, or is
  37717. conditioned on the non-exercise of one or more of the rights that
  37718. are specifically granted under this License. You may not convey a
  37719. covered work if you are a party to an arrangement with a third
  37720. party that is in the business of distributing software, under which
  37721. you make payment to the third party based on the extent of your
  37722. activity of conveying the work, and under which the third party
  37723. grants, to any of the parties who would receive the covered work
  37724. from you, a discriminatory patent license (a) in connection with
  37725. copies of the covered work conveyed by you (or copies made from
  37726. those copies), or (b) primarily for and in connection with specific
  37727. products or compilations that contain the covered work, unless you
  37728. entered into that arrangement, or that patent license was granted,
  37729. prior to 28 March 2007.
  37730. Nothing in this License shall be construed as excluding or limiting
  37731. any implied license or other defenses to infringement that may
  37732. otherwise be available to you under applicable patent law.
  37733. 12. No Surrender of Others' Freedom.
  37734. If conditions are imposed on you (whether by court order, agreement
  37735. or otherwise) that contradict the conditions of this License, they
  37736. do not excuse you from the conditions of this License. If you
  37737. cannot convey a covered work so as to satisfy simultaneously your
  37738. obligations under this License and any other pertinent obligations,
  37739. then as a consequence you may not convey it at all. For example,
  37740. if you agree to terms that obligate you to collect a royalty for
  37741. further conveying from those to whom you convey the Program, the
  37742. only way you could satisfy both those terms and this License would
  37743. be to refrain entirely from conveying the Program.
  37744. 13. Use with the GNU Affero General Public License.
  37745. Notwithstanding any other provision of this License, you have
  37746. permission to link or combine any covered work with a work licensed
  37747. under version 3 of the GNU Affero General Public License into a
  37748. single combined work, and to convey the resulting work. The terms
  37749. of this License will continue to apply to the part which is the
  37750. covered work, but the special requirements of the GNU Affero
  37751. General Public License, section 13, concerning interaction through
  37752. a network will apply to the combination as such.
  37753. 14. Revised Versions of this License.
  37754. The Free Software Foundation may publish revised and/or new
  37755. versions of the GNU General Public License from time to time. Such
  37756. new versions will be similar in spirit to the present version, but
  37757. may differ in detail to address new problems or concerns.
  37758. Each version is given a distinguishing version number. If the
  37759. Program specifies that a certain numbered version of the GNU
  37760. General Public License "or any later version" applies to it, you
  37761. have the option of following the terms and conditions either of
  37762. that numbered version or of any later version published by the Free
  37763. Software Foundation. If the Program does not specify a version
  37764. number of the GNU General Public License, you may choose any
  37765. version ever published by the Free Software Foundation.
  37766. If the Program specifies that a proxy can decide which future
  37767. versions of the GNU General Public License can be used, that
  37768. proxy's public statement of acceptance of a version permanently
  37769. authorizes you to choose that version for the Program.
  37770. Later license versions may give you additional or different
  37771. permissions. However, no additional obligations are imposed on any
  37772. author or copyright holder as a result of your choosing to follow a
  37773. later version.
  37774. 15. Disclaimer of Warranty.
  37775. THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
  37776. APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE
  37777. COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS"
  37778. WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED,
  37779. INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
  37780. MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE
  37781. RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.
  37782. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL
  37783. NECESSARY SERVICING, REPAIR OR CORRECTION.
  37784. 16. Limitation of Liability.
  37785. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
  37786. WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES
  37787. AND/OR CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR
  37788. DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR
  37789. CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE
  37790. THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA
  37791. BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
  37792. PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
  37793. PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF
  37794. THE POSSIBILITY OF SUCH DAMAGES.
  37795. 17. Interpretation of Sections 15 and 16.
  37796. If the disclaimer of warranty and limitation of liability provided
  37797. above cannot be given local legal effect according to their terms,
  37798. reviewing courts shall apply local law that most closely
  37799. approximates an absolute waiver of all civil liability in
  37800. connection with the Program, unless a warranty or assumption of
  37801. liability accompanies a copy of the Program in return for a fee.
  37802. END OF TERMS AND CONDITIONS
  37803. ===========================
  37804. How to Apply These Terms to Your New Programs
  37805. =============================================
  37806. If you develop a new program, and you want it to be of the greatest
  37807. possible use to the public, the best way to achieve this is to make it
  37808. free software which everyone can redistribute and change under these
  37809. terms.
  37810. To do so, attach the following notices to the program. It is safest to
  37811. attach them to the start of each source file to most effectively state
  37812. the exclusion of warranty; and each file should have at least the
  37813. "copyright" line and a pointer to where the full notice is found.
  37814. ONE LINE TO GIVE THE PROGRAM'S NAME AND A BRIEF IDEA OF WHAT IT DOES.
  37815. Copyright (C) YEAR NAME OF AUTHOR
  37816. This program is free software: you can redistribute it and/or modify
  37817. it under the terms of the GNU General Public License as published by
  37818. the Free Software Foundation, either version 3 of the License, or (at
  37819. your option) any later version.
  37820. This program is distributed in the hope that it will be useful, but
  37821. WITHOUT ANY WARRANTY; without even the implied warranty of
  37822. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  37823. General Public License for more details.
  37824. You should have received a copy of the GNU General Public License
  37825. along with this program. If not, see <http://www.gnu.org/licenses/>.
  37826. Also add information on how to contact you by electronic and paper
  37827. mail.
  37828. If the program does terminal interaction, make it output a short notice
  37829. like this when it starts in an interactive mode:
  37830. PROGRAM Copyright (C) YEAR NAME OF AUTHOR
  37831. This program comes with ABSOLUTELY NO WARRANTY; for details type 'show w'.
  37832. This is free software, and you are welcome to redistribute it
  37833. under certain conditions; type 'show c' for details.
  37834. The hypothetical commands 'show w' and 'show c' should show the
  37835. appropriate parts of the General Public License. Of course, your
  37836. program's commands might be different; for a GUI interface, you would
  37837. use an "about box".
  37838. You should also get your employer (if you work as a programmer) or
  37839. school, if any, to sign a "copyright disclaimer" for the program, if
  37840. necessary. For more information on this, and how to apply and follow
  37841. the GNU GPL, see <http://www.gnu.org/licenses/>.
  37842. The GNU General Public License does not permit incorporating your
  37843. program into proprietary programs. If your program is a subroutine
  37844. library, you may consider it more useful to permit linking proprietary
  37845. applications with the library. If this is what you want to do, use the
  37846. GNU Lesser General Public License instead of this License. But first,
  37847. please read <https://www.gnu.org/licenses/why-not-lgpl.html>.
  37848. 
  37849. File: gccint.info, Node: GNU Free Documentation License, Next: Contributors, Prev: Copying, Up: Top
  37850. GNU Free Documentation License
  37851. ******************************
  37852. Version 1.3, 3 November 2008
  37853. Copyright (C) 2000, 2001, 2002, 2007, 2008 Free Software Foundation, Inc.
  37854. <http://fsf.org/>
  37855. Everyone is permitted to copy and distribute verbatim copies
  37856. of this license document, but changing it is not allowed.
  37857. 0. PREAMBLE
  37858. The purpose of this License is to make a manual, textbook, or other
  37859. functional and useful document "free" in the sense of freedom: to
  37860. assure everyone the effective freedom to copy and redistribute it,
  37861. with or without modifying it, either commercially or
  37862. noncommercially. Secondarily, this License preserves for the
  37863. author and publisher a way to get credit for their work, while not
  37864. being considered responsible for modifications made by others.
  37865. This License is a kind of "copyleft", which means that derivative
  37866. works of the document must themselves be free in the same sense.
  37867. It complements the GNU General Public License, which is a copyleft
  37868. license designed for free software.
  37869. We have designed this License in order to use it for manuals for
  37870. free software, because free software needs free documentation: a
  37871. free program should come with manuals providing the same freedoms
  37872. that the software does. But this License is not limited to
  37873. software manuals; it can be used for any textual work, regardless
  37874. of subject matter or whether it is published as a printed book. We
  37875. recommend this License principally for works whose purpose is
  37876. instruction or reference.
  37877. 1. APPLICABILITY AND DEFINITIONS
  37878. This License applies to any manual or other work, in any medium,
  37879. that contains a notice placed by the copyright holder saying it can
  37880. be distributed under the terms of this License. Such a notice
  37881. grants a world-wide, royalty-free license, unlimited in duration,
  37882. to use that work under the conditions stated herein. The
  37883. "Document", below, refers to any such manual or work. Any member
  37884. of the public is a licensee, and is addressed as "you". You accept
  37885. the license if you copy, modify or distribute the work in a way
  37886. requiring permission under copyright law.
  37887. A "Modified Version" of the Document means any work containing the
  37888. Document or a portion of it, either copied verbatim, or with
  37889. modifications and/or translated into another language.
  37890. A "Secondary Section" is a named appendix or a front-matter section
  37891. of the Document that deals exclusively with the relationship of the
  37892. publishers or authors of the Document to the Document's overall
  37893. subject (or to related matters) and contains nothing that could
  37894. fall directly within that overall subject. (Thus, if the Document
  37895. is in part a textbook of mathematics, a Secondary Section may not
  37896. explain any mathematics.) The relationship could be a matter of
  37897. historical connection with the subject or with related matters, or
  37898. of legal, commercial, philosophical, ethical or political position
  37899. regarding them.
  37900. The "Invariant Sections" are certain Secondary Sections whose
  37901. titles are designated, as being those of Invariant Sections, in the
  37902. notice that says that the Document is released under this License.
  37903. If a section does not fit the above definition of Secondary then it
  37904. is not allowed to be designated as Invariant. The Document may
  37905. contain zero Invariant Sections. If the Document does not identify
  37906. any Invariant Sections then there are none.
  37907. The "Cover Texts" are certain short passages of text that are
  37908. listed, as Front-Cover Texts or Back-Cover Texts, in the notice
  37909. that says that the Document is released under this License. A
  37910. Front-Cover Text may be at most 5 words, and a Back-Cover Text may
  37911. be at most 25 words.
  37912. A "Transparent" copy of the Document means a machine-readable copy,
  37913. represented in a format whose specification is available to the
  37914. general public, that is suitable for revising the document
  37915. straightforwardly with generic text editors or (for images composed
  37916. of pixels) generic paint programs or (for drawings) some widely
  37917. available drawing editor, and that is suitable for input to text
  37918. formatters or for automatic translation to a variety of formats
  37919. suitable for input to text formatters. A copy made in an otherwise
  37920. Transparent file format whose markup, or absence of markup, has
  37921. been arranged to thwart or discourage subsequent modification by
  37922. readers is not Transparent. An image format is not Transparent if
  37923. used for any substantial amount of text. A copy that is not
  37924. "Transparent" is called "Opaque".
  37925. Examples of suitable formats for Transparent copies include plain
  37926. ASCII without markup, Texinfo input format, LaTeX input format,
  37927. SGML or XML using a publicly available DTD, and standard-conforming
  37928. simple HTML, PostScript or PDF designed for human modification.
  37929. Examples of transparent image formats include PNG, XCF and JPG.
  37930. Opaque formats include proprietary formats that can be read and
  37931. edited only by proprietary word processors, SGML or XML for which
  37932. the DTD and/or processing tools are not generally available, and
  37933. the machine-generated HTML, PostScript or PDF produced by some word
  37934. processors for output purposes only.
  37935. The "Title Page" means, for a printed book, the title page itself,
  37936. plus such following pages as are needed to hold, legibly, the
  37937. material this License requires to appear in the title page. For
  37938. works in formats which do not have any title page as such, "Title
  37939. Page" means the text near the most prominent appearance of the
  37940. work's title, preceding the beginning of the body of the text.
  37941. The "publisher" means any person or entity that distributes copies
  37942. of the Document to the public.
  37943. A section "Entitled XYZ" means a named subunit of the Document
  37944. whose title either is precisely XYZ or contains XYZ in parentheses
  37945. following text that translates XYZ in another language. (Here XYZ
  37946. stands for a specific section name mentioned below, such as
  37947. "Acknowledgements", "Dedications", "Endorsements", or "History".)
  37948. To "Preserve the Title" of such a section when you modify the
  37949. Document means that it remains a section "Entitled XYZ" according
  37950. to this definition.
  37951. The Document may include Warranty Disclaimers next to the notice
  37952. which states that this License applies to the Document. These
  37953. Warranty Disclaimers are considered to be included by reference in
  37954. this License, but only as regards disclaiming warranties: any other
  37955. implication that these Warranty Disclaimers may have is void and
  37956. has no effect on the meaning of this License.
  37957. 2. VERBATIM COPYING
  37958. You may copy and distribute the Document in any medium, either
  37959. commercially or noncommercially, provided that this License, the
  37960. copyright notices, and the license notice saying this License
  37961. applies to the Document are reproduced in all copies, and that you
  37962. add no other conditions whatsoever to those of this License. You
  37963. may not use technical measures to obstruct or control the reading
  37964. or further copying of the copies you make or distribute. However,
  37965. you may accept compensation in exchange for copies. If you
  37966. distribute a large enough number of copies you must also follow the
  37967. conditions in section 3.
  37968. You may also lend copies, under the same conditions stated above,
  37969. and you may publicly display copies.
  37970. 3. COPYING IN QUANTITY
  37971. If you publish printed copies (or copies in media that commonly
  37972. have printed covers) of the Document, numbering more than 100, and
  37973. the Document's license notice requires Cover Texts, you must
  37974. enclose the copies in covers that carry, clearly and legibly, all
  37975. these Cover Texts: Front-Cover Texts on the front cover, and
  37976. Back-Cover Texts on the back cover. Both covers must also clearly
  37977. and legibly identify you as the publisher of these copies. The
  37978. front cover must present the full title with all words of the title
  37979. equally prominent and visible. You may add other material on the
  37980. covers in addition. Copying with changes limited to the covers, as
  37981. long as they preserve the title of the Document and satisfy these
  37982. conditions, can be treated as verbatim copying in other respects.
  37983. If the required texts for either cover are too voluminous to fit
  37984. legibly, you should put the first ones listed (as many as fit
  37985. reasonably) on the actual cover, and continue the rest onto
  37986. adjacent pages.
  37987. If you publish or distribute Opaque copies of the Document
  37988. numbering more than 100, you must either include a machine-readable
  37989. Transparent copy along with each Opaque copy, or state in or with
  37990. each Opaque copy a computer-network location from which the general
  37991. network-using public has access to download using public-standard
  37992. network protocols a complete Transparent copy of the Document, free
  37993. of added material. If you use the latter option, you must take
  37994. reasonably prudent steps, when you begin distribution of Opaque
  37995. copies in quantity, to ensure that this Transparent copy will
  37996. remain thus accessible at the stated location until at least one
  37997. year after the last time you distribute an Opaque copy (directly or
  37998. through your agents or retailers) of that edition to the public.
  37999. It is requested, but not required, that you contact the authors of
  38000. the Document well before redistributing any large number of copies,
  38001. to give them a chance to provide you with an updated version of the
  38002. Document.
  38003. 4. MODIFICATIONS
  38004. You may copy and distribute a Modified Version of the Document
  38005. under the conditions of sections 2 and 3 above, provided that you
  38006. release the Modified Version under precisely this License, with the
  38007. Modified Version filling the role of the Document, thus licensing
  38008. distribution and modification of the Modified Version to whoever
  38009. possesses a copy of it. In addition, you must do these things in
  38010. the Modified Version:
  38011. A. Use in the Title Page (and on the covers, if any) a title
  38012. distinct from that of the Document, and from those of previous
  38013. versions (which should, if there were any, be listed in the
  38014. History section of the Document). You may use the same title
  38015. as a previous version if the original publisher of that
  38016. version gives permission.
  38017. B. List on the Title Page, as authors, one or more persons or
  38018. entities responsible for authorship of the modifications in
  38019. the Modified Version, together with at least five of the
  38020. principal authors of the Document (all of its principal
  38021. authors, if it has fewer than five), unless they release you
  38022. from this requirement.
  38023. C. State on the Title page the name of the publisher of the
  38024. Modified Version, as the publisher.
  38025. D. Preserve all the copyright notices of the Document.
  38026. E. Add an appropriate copyright notice for your modifications
  38027. adjacent to the other copyright notices.
  38028. F. Include, immediately after the copyright notices, a license
  38029. notice giving the public permission to use the Modified
  38030. Version under the terms of this License, in the form shown in
  38031. the Addendum below.
  38032. G. Preserve in that license notice the full lists of Invariant
  38033. Sections and required Cover Texts given in the Document's
  38034. license notice.
  38035. H. Include an unaltered copy of this License.
  38036. I. Preserve the section Entitled "History", Preserve its Title,
  38037. and add to it an item stating at least the title, year, new
  38038. authors, and publisher of the Modified Version as given on the
  38039. Title Page. If there is no section Entitled "History" in the
  38040. Document, create one stating the title, year, authors, and
  38041. publisher of the Document as given on its Title Page, then add
  38042. an item describing the Modified Version as stated in the
  38043. previous sentence.
  38044. J. Preserve the network location, if any, given in the Document
  38045. for public access to a Transparent copy of the Document, and
  38046. likewise the network locations given in the Document for
  38047. previous versions it was based on. These may be placed in the
  38048. "History" section. You may omit a network location for a work
  38049. that was published at least four years before the Document
  38050. itself, or if the original publisher of the version it refers
  38051. to gives permission.
  38052. K. For any section Entitled "Acknowledgements" or "Dedications",
  38053. Preserve the Title of the section, and preserve in the section
  38054. all the substance and tone of each of the contributor
  38055. acknowledgements and/or dedications given therein.
  38056. L. Preserve all the Invariant Sections of the Document, unaltered
  38057. in their text and in their titles. Section numbers or the
  38058. equivalent are not considered part of the section titles.
  38059. M. Delete any section Entitled "Endorsements". Such a section
  38060. may not be included in the Modified Version.
  38061. N. Do not retitle any existing section to be Entitled
  38062. "Endorsements" or to conflict in title with any Invariant
  38063. Section.
  38064. O. Preserve any Warranty Disclaimers.
  38065. If the Modified Version includes new front-matter sections or
  38066. appendices that qualify as Secondary Sections and contain no
  38067. material copied from the Document, you may at your option designate
  38068. some or all of these sections as invariant. To do this, add their
  38069. titles to the list of Invariant Sections in the Modified Version's
  38070. license notice. These titles must be distinct from any other
  38071. section titles.
  38072. You may add a section Entitled "Endorsements", provided it contains
  38073. nothing but endorsements of your Modified Version by various
  38074. parties--for example, statements of peer review or that the text
  38075. has been approved by an organization as the authoritative
  38076. definition of a standard.
  38077. You may add a passage of up to five words as a Front-Cover Text,
  38078. and a passage of up to 25 words as a Back-Cover Text, to the end of
  38079. the list of Cover Texts in the Modified Version. Only one passage
  38080. of Front-Cover Text and one of Back-Cover Text may be added by (or
  38081. through arrangements made by) any one entity. If the Document
  38082. already includes a cover text for the same cover, previously added
  38083. by you or by arrangement made by the same entity you are acting on
  38084. behalf of, you may not add another; but you may replace the old
  38085. one, on explicit permission from the previous publisher that added
  38086. the old one.
  38087. The author(s) and publisher(s) of the Document do not by this
  38088. License give permission to use their names for publicity for or to
  38089. assert or imply endorsement of any Modified Version.
  38090. 5. COMBINING DOCUMENTS
  38091. You may combine the Document with other documents released under
  38092. this License, under the terms defined in section 4 above for
  38093. modified versions, provided that you include in the combination all
  38094. of the Invariant Sections of all of the original documents,
  38095. unmodified, and list them all as Invariant Sections of your
  38096. combined work in its license notice, and that you preserve all
  38097. their Warranty Disclaimers.
  38098. The combined work need only contain one copy of this License, and
  38099. multiple identical Invariant Sections may be replaced with a single
  38100. copy. If there are multiple Invariant Sections with the same name
  38101. but different contents, make the title of each such section unique
  38102. by adding at the end of it, in parentheses, the name of the
  38103. original author or publisher of that section if known, or else a
  38104. unique number. Make the same adjustment to the section titles in
  38105. the list of Invariant Sections in the license notice of the
  38106. combined work.
  38107. In the combination, you must combine any sections Entitled
  38108. "History" in the various original documents, forming one section
  38109. Entitled "History"; likewise combine any sections Entitled
  38110. "Acknowledgements", and any sections Entitled "Dedications". You
  38111. must delete all sections Entitled "Endorsements."
  38112. 6. COLLECTIONS OF DOCUMENTS
  38113. You may make a collection consisting of the Document and other
  38114. documents released under this License, and replace the individual
  38115. copies of this License in the various documents with a single copy
  38116. that is included in the collection, provided that you follow the
  38117. rules of this License for verbatim copying of each of the documents
  38118. in all other respects.
  38119. You may extract a single document from such a collection, and
  38120. distribute it individually under this License, provided you insert
  38121. a copy of this License into the extracted document, and follow this
  38122. License in all other respects regarding verbatim copying of that
  38123. document.
  38124. 7. AGGREGATION WITH INDEPENDENT WORKS
  38125. A compilation of the Document or its derivatives with other
  38126. separate and independent documents or works, in or on a volume of a
  38127. storage or distribution medium, is called an "aggregate" if the
  38128. copyright resulting from the compilation is not used to limit the
  38129. legal rights of the compilation's users beyond what the individual
  38130. works permit. When the Document is included in an aggregate, this
  38131. License does not apply to the other works in the aggregate which
  38132. are not themselves derivative works of the Document.
  38133. If the Cover Text requirement of section 3 is applicable to these
  38134. copies of the Document, then if the Document is less than one half
  38135. of the entire aggregate, the Document's Cover Texts may be placed
  38136. on covers that bracket the Document within the aggregate, or the
  38137. electronic equivalent of covers if the Document is in electronic
  38138. form. Otherwise they must appear on printed covers that bracket
  38139. the whole aggregate.
  38140. 8. TRANSLATION
  38141. Translation is considered a kind of modification, so you may
  38142. distribute translations of the Document under the terms of section
  38143. 4. Replacing Invariant Sections with translations requires special
  38144. permission from their copyright holders, but you may include
  38145. translations of some or all Invariant Sections in addition to the
  38146. original versions of these Invariant Sections. You may include a
  38147. translation of this License, and all the license notices in the
  38148. Document, and any Warranty Disclaimers, provided that you also
  38149. include the original English version of this License and the
  38150. original versions of those notices and disclaimers. In case of a
  38151. disagreement between the translation and the original version of
  38152. this License or a notice or disclaimer, the original version will
  38153. prevail.
  38154. If a section in the Document is Entitled "Acknowledgements",
  38155. "Dedications", or "History", the requirement (section 4) to
  38156. Preserve its Title (section 1) will typically require changing the
  38157. actual title.
  38158. 9. TERMINATION
  38159. You may not copy, modify, sublicense, or distribute the Document
  38160. except as expressly provided under this License. Any attempt
  38161. otherwise to copy, modify, sublicense, or distribute it is void,
  38162. and will automatically terminate your rights under this License.
  38163. However, if you cease all violation of this License, then your
  38164. license from a particular copyright holder is reinstated (a)
  38165. provisionally, unless and until the copyright holder explicitly and
  38166. finally terminates your license, and (b) permanently, if the
  38167. copyright holder fails to notify you of the violation by some
  38168. reasonable means prior to 60 days after the cessation.
  38169. Moreover, your license from a particular copyright holder is
  38170. reinstated permanently if the copyright holder notifies you of the
  38171. violation by some reasonable means, this is the first time you have
  38172. received notice of violation of this License (for any work) from
  38173. that copyright holder, and you cure the violation prior to 30 days
  38174. after your receipt of the notice.
  38175. Termination of your rights under this section does not terminate
  38176. the licenses of parties who have received copies or rights from you
  38177. under this License. If your rights have been terminated and not
  38178. permanently reinstated, receipt of a copy of some or all of the
  38179. same material does not give you any rights to use it.
  38180. 10. FUTURE REVISIONS OF THIS LICENSE
  38181. The Free Software Foundation may publish new, revised versions of
  38182. the GNU Free Documentation License from time to time. Such new
  38183. versions will be similar in spirit to the present version, but may
  38184. differ in detail to address new problems or concerns. See
  38185. <http://www.gnu.org/copyleft/>.
  38186. Each version of the License is given a distinguishing version
  38187. number. If the Document specifies that a particular numbered
  38188. version of this License "or any later version" applies to it, you
  38189. have the option of following the terms and conditions either of
  38190. that specified version or of any later version that has been
  38191. published (not as a draft) by the Free Software Foundation. If the
  38192. Document does not specify a version number of this License, you may
  38193. choose any version ever published (not as a draft) by the Free
  38194. Software Foundation. If the Document specifies that a proxy can
  38195. decide which future versions of this License can be used, that
  38196. proxy's public statement of acceptance of a version permanently
  38197. authorizes you to choose that version for the Document.
  38198. 11. RELICENSING
  38199. "Massive Multiauthor Collaboration Site" (or "MMC Site") means any
  38200. World Wide Web server that publishes copyrightable works and also
  38201. provides prominent facilities for anybody to edit those works. A
  38202. public wiki that anybody can edit is an example of such a server.
  38203. A "Massive Multiauthor Collaboration" (or "MMC") contained in the
  38204. site means any set of copyrightable works thus published on the MMC
  38205. site.
  38206. "CC-BY-SA" means the Creative Commons Attribution-Share Alike 3.0
  38207. license published by Creative Commons Corporation, a not-for-profit
  38208. corporation with a principal place of business in San Francisco,
  38209. California, as well as future copyleft versions of that license
  38210. published by that same organization.
  38211. "Incorporate" means to publish or republish a Document, in whole or
  38212. in part, as part of another Document.
  38213. An MMC is "eligible for relicensing" if it is licensed under this
  38214. License, and if all works that were first published under this
  38215. License somewhere other than this MMC, and subsequently
  38216. incorporated in whole or in part into the MMC, (1) had no cover
  38217. texts or invariant sections, and (2) were thus incorporated prior
  38218. to November 1, 2008.
  38219. The operator of an MMC Site may republish an MMC contained in the
  38220. site under CC-BY-SA on the same site at any time before August 1,
  38221. 2009, provided the MMC is eligible for relicensing.
  38222. ADDENDUM: How to use this License for your documents
  38223. ====================================================
  38224. To use this License in a document you have written, include a copy of
  38225. the License in the document and put the following copyright and license
  38226. notices just after the title page:
  38227. Copyright (C) YEAR YOUR NAME.
  38228. Permission is granted to copy, distribute and/or modify this document
  38229. under the terms of the GNU Free Documentation License, Version 1.3
  38230. or any later version published by the Free Software Foundation;
  38231. with no Invariant Sections, no Front-Cover Texts, and no Back-Cover
  38232. Texts. A copy of the license is included in the section entitled ``GNU
  38233. Free Documentation License''.
  38234. If you have Invariant Sections, Front-Cover Texts and Back-Cover Texts,
  38235. replace the "with...Texts." line with this:
  38236. with the Invariant Sections being LIST THEIR TITLES, with
  38237. the Front-Cover Texts being LIST, and with the Back-Cover Texts
  38238. being LIST.
  38239. If you have Invariant Sections without Cover Texts, or some other
  38240. combination of the three, merge those two alternatives to suit the
  38241. situation.
  38242. If your document contains nontrivial examples of program code, we
  38243. recommend releasing these examples in parallel under your choice of free
  38244. software license, such as the GNU General Public License, to permit
  38245. their use in free software.
  38246. 
  38247. File: gccint.info, Node: Contributors, Next: Option Index, Prev: GNU Free Documentation License, Up: Top
  38248. Contributors to GCC
  38249. *******************
  38250. The GCC project would like to thank its many contributors. Without them
  38251. the project would not have been nearly as successful as it has been.
  38252. Any omissions in this list are accidental. Feel free to contact
  38253. <law@redhat.com> or <gerald@pfeifer.com> if you have been left out or
  38254. some of your contributions are not listed. Please keep this list in
  38255. alphabetical order.
  38256. * Analog Devices helped implement the support for complex data types
  38257. and iterators.
  38258. * John David Anglin for threading-related fixes and improvements to
  38259. libstdc++-v3, and the HP-UX port.
  38260. * James van Artsdalen wrote the code that makes efficient use of the
  38261. Intel 80387 register stack.
  38262. * Abramo and Roberto Bagnara for the SysV68 Motorola 3300 Delta
  38263. Series port.
  38264. * Alasdair Baird for various bug fixes.
  38265. * Giovanni Bajo for analyzing lots of complicated C++ problem
  38266. reports.
  38267. * Peter Barada for his work to improve code generation for new
  38268. ColdFire cores.
  38269. * Gerald Baumgartner added the signature extension to the C++ front
  38270. end.
  38271. * Godmar Back for his Java improvements and encouragement.
  38272. * Scott Bambrough for help porting the Java compiler.
  38273. * Wolfgang Bangerth for processing tons of bug reports.
  38274. * Jon Beniston for his Microsoft Windows port of Java and port to
  38275. Lattice Mico32.
  38276. * Daniel Berlin for better DWARF 2 support, faster/better
  38277. optimizations, improved alias analysis, plus migrating GCC to
  38278. Bugzilla.
  38279. * Geoff Berry for his Java object serialization work and various
  38280. patches.
  38281. * David Binderman tests weekly snapshots of GCC trunk against Fedora
  38282. Rawhide for several architectures.
  38283. * Laurynas Biveinis for memory management work and DJGPP port fixes.
  38284. * Uros Bizjak for the implementation of x87 math built-in functions
  38285. and for various middle end and i386 back end improvements and bug
  38286. fixes.
  38287. * Eric Blake for helping to make GCJ and libgcj conform to the
  38288. specifications.
  38289. * Janne Blomqvist for contributions to GNU Fortran.
  38290. * Hans-J. Boehm for his garbage collector, IA-64 libffi port, and
  38291. other Java work.
  38292. * Segher Boessenkool for helping maintain the PowerPC port and the
  38293. instruction combiner plus various contributions to the middle end.
  38294. * Neil Booth for work on cpplib, lang hooks, debug hooks and other
  38295. miscellaneous clean-ups.
  38296. * Steven Bosscher for integrating the GNU Fortran front end into GCC
  38297. and for contributing to the tree-ssa branch.
  38298. * Eric Botcazou for fixing middle- and backend bugs left and right.
  38299. * Per Bothner for his direction via the steering committee and
  38300. various improvements to the infrastructure for supporting new
  38301. languages. Chill front end implementation. Initial
  38302. implementations of cpplib, fix-header, config.guess, libio, and
  38303. past C++ library (libg++) maintainer. Dreaming up, designing and
  38304. implementing much of GCJ.
  38305. * Devon Bowen helped port GCC to the Tahoe.
  38306. * Don Bowman for mips-vxworks contributions.
  38307. * James Bowman for the FT32 port.
  38308. * Dave Brolley for work on cpplib and Chill.
  38309. * Paul Brook for work on the ARM architecture and maintaining GNU
  38310. Fortran.
  38311. * Robert Brown implemented the support for Encore 32000 systems.
  38312. * Christian Bruel for improvements to local store elimination.
  38313. * Herman A.J. ten Brugge for various fixes.
  38314. * Joerg Brunsmann for Java compiler hacking and help with the GCJ
  38315. FAQ.
  38316. * Joe Buck for his direction via the steering committee from its
  38317. creation to 2013.
  38318. * Iain Buclaw for the D frontend.
  38319. * Craig Burley for leadership of the G77 Fortran effort.
  38320. * Tobias Burnus for contributions to GNU Fortran.
  38321. * Stephan Buys for contributing Doxygen notes for libstdc++.
  38322. * Paolo Carlini for libstdc++ work: lots of efficiency improvements
  38323. to the C++ strings, streambufs and formatted I/O, hard detective
  38324. work on the frustrating localization issues, and keeping up with
  38325. the problem reports.
  38326. * John Carr for his alias work, SPARC hacking, infrastructure
  38327. improvements, previous contributions to the steering committee,
  38328. loop optimizations, etc.
  38329. * Stephane Carrez for 68HC11 and 68HC12 ports.
  38330. * Steve Chamberlain for support for the Renesas SH and H8 processors
  38331. and the PicoJava processor, and for GCJ config fixes.
  38332. * Glenn Chambers for help with the GCJ FAQ.
  38333. * John-Marc Chandonia for various libgcj patches.
  38334. * Denis Chertykov for contributing and maintaining the AVR port, the
  38335. first GCC port for an 8-bit architecture.
  38336. * Kito Cheng for his work on the RISC-V port, including bringing up
  38337. the test suite and maintenance.
  38338. * Scott Christley for his Objective-C contributions.
  38339. * Eric Christopher for his Java porting help and clean-ups.
  38340. * Branko Cibej for more warning contributions.
  38341. * The GNU Classpath project for all of their merged runtime code.
  38342. * Nick Clifton for arm, mcore, fr30, v850, m32r, msp430 rx work,
  38343. '--help', and other random hacking.
  38344. * Michael Cook for libstdc++ cleanup patches to reduce warnings.
  38345. * R. Kelley Cook for making GCC buildable from a read-only directory
  38346. as well as other miscellaneous build process and documentation
  38347. clean-ups.
  38348. * Ralf Corsepius for SH testing and minor bug fixing.
  38349. * Franc,ois-Xavier Coudert for contributions to GNU Fortran.
  38350. * Stan Cox for care and feeding of the x86 port and lots of behind
  38351. the scenes hacking.
  38352. * Alex Crain provided changes for the 3b1.
  38353. * Ian Dall for major improvements to the NS32k port.
  38354. * Paul Dale for his work to add uClinux platform support to the m68k
  38355. backend.
  38356. * Palmer Dabbelt for his work maintaining the RISC-V port.
  38357. * Dario Dariol contributed the four varieties of sample programs that
  38358. print a copy of their source.
  38359. * Russell Davidson for fstream and stringstream fixes in libstdc++.
  38360. * Bud Davis for work on the G77 and GNU Fortran compilers.
  38361. * Mo DeJong for GCJ and libgcj bug fixes.
  38362. * Jerry DeLisle for contributions to GNU Fortran.
  38363. * DJ Delorie for the DJGPP port, build and libiberty maintenance,
  38364. various bug fixes, and the M32C, MeP, MSP430, and RL78 ports.
  38365. * Arnaud Desitter for helping to debug GNU Fortran.
  38366. * Gabriel Dos Reis for contributions to G++, contributions and
  38367. maintenance of GCC diagnostics infrastructure, libstdc++-v3,
  38368. including 'valarray<>', 'complex<>', maintaining the numerics
  38369. library (including that pesky '<limits>' :-) and keeping up-to-date
  38370. anything to do with numbers.
  38371. * Ulrich Drepper for his work on glibc, testing of GCC using glibc,
  38372. ISO C99 support, CFG dumping support, etc., plus support of the C++
  38373. runtime libraries including for all kinds of C interface issues,
  38374. contributing and maintaining 'complex<>', sanity checking and
  38375. disbursement, configuration architecture, libio maintenance, and
  38376. early math work.
  38377. * Franc,ois Dumont for his work on libstdc++-v3, especially
  38378. maintaining and improving 'debug-mode' and associative and
  38379. unordered containers.
  38380. * Zdenek Dvorak for a new loop unroller and various fixes.
  38381. * Michael Eager for his work on the Xilinx MicroBlaze port.
  38382. * Richard Earnshaw for his ongoing work with the ARM.
  38383. * David Edelsohn for his direction via the steering committee,
  38384. ongoing work with the RS6000/PowerPC port, help cleaning up Haifa
  38385. loop changes, doing the entire AIX port of libstdc++ with his bare
  38386. hands, and for ensuring GCC properly keeps working on AIX.
  38387. * Kevin Ediger for the floating point formatting of num_put::do_put
  38388. in libstdc++.
  38389. * Phil Edwards for libstdc++ work including configuration hackery,
  38390. documentation maintainer, chief breaker of the web pages, the
  38391. occasional iostream bug fix, and work on shared library symbol
  38392. versioning.
  38393. * Paul Eggert for random hacking all over GCC.
  38394. * Mark Elbrecht for various DJGPP improvements, and for libstdc++
  38395. configuration support for locales and fstream-related fixes.
  38396. * Vadim Egorov for libstdc++ fixes in strings, streambufs, and
  38397. iostreams.
  38398. * Christian Ehrhardt for dealing with bug reports.
  38399. * Ben Elliston for his work to move the Objective-C runtime into its
  38400. own subdirectory and for his work on autoconf.
  38401. * Revital Eres for work on the PowerPC 750CL port.
  38402. * Marc Espie for OpenBSD support.
  38403. * Doug Evans for much of the global optimization framework, arc,
  38404. m32r, and SPARC work.
  38405. * Christopher Faylor for his work on the Cygwin port and for caring
  38406. and feeding the gcc.gnu.org box and saving its users tons of spam.
  38407. * Fred Fish for BeOS support and Ada fixes.
  38408. * Ivan Fontes Garcia for the Portuguese translation of the GCJ FAQ.
  38409. * Peter Gerwinski for various bug fixes and the Pascal front end.
  38410. * Kaveh R. Ghazi for his direction via the steering committee,
  38411. amazing work to make '-W -Wall -W* -Werror' useful, and testing GCC
  38412. on a plethora of platforms. Kaveh extends his gratitude to the
  38413. CAIP Center at Rutgers University for providing him with computing
  38414. resources to work on Free Software from the late 1980s to 2010.
  38415. * John Gilmore for a donation to the FSF earmarked improving GNU
  38416. Java.
  38417. * Judy Goldberg for c++ contributions.
  38418. * Torbjorn Granlund for various fixes and the c-torture testsuite,
  38419. multiply- and divide-by-constant optimization, improved long long
  38420. support, improved leaf function register allocation, and his
  38421. direction via the steering committee.
  38422. * Jonny Grant for improvements to 'collect2's' '--help'
  38423. documentation.
  38424. * Anthony Green for his '-Os' contributions, the moxie port, and Java
  38425. front end work.
  38426. * Stu Grossman for gdb hacking, allowing GCJ developers to debug Java
  38427. code.
  38428. * Michael K. Gschwind contributed the port to the PDP-11.
  38429. * Richard Biener for his ongoing middle-end contributions and bug
  38430. fixes and for release management.
  38431. * Ron Guilmette implemented the 'protoize' and 'unprotoize' tools,
  38432. the support for DWARF 1 symbolic debugging information, and much of
  38433. the support for System V Release 4. He has also worked heavily on
  38434. the Intel 386 and 860 support.
  38435. * Sumanth Gundapaneni for contributing the CR16 port.
  38436. * Mostafa Hagog for Swing Modulo Scheduling (SMS) and post reload
  38437. GCSE.
  38438. * Bruno Haible for improvements in the runtime overhead for EH, new
  38439. warnings and assorted bug fixes.
  38440. * Andrew Haley for his amazing Java compiler and library efforts.
  38441. * Chris Hanson assisted in making GCC work on HP-UX for the 9000
  38442. series 300.
  38443. * Michael Hayes for various thankless work he's done trying to get
  38444. the c30/c40 ports functional. Lots of loop and unroll improvements
  38445. and fixes.
  38446. * Dara Hazeghi for wading through myriads of target-specific bug
  38447. reports.
  38448. * Kate Hedstrom for staking the G77 folks with an initial testsuite.
  38449. * Richard Henderson for his ongoing SPARC, alpha, ia32, and ia64
  38450. work, loop opts, and generally fixing lots of old problems we've
  38451. ignored for years, flow rewrite and lots of further stuff,
  38452. including reviewing tons of patches.
  38453. * Aldy Hernandez for working on the PowerPC port, SIMD support, and
  38454. various fixes.
  38455. * Nobuyuki Hikichi of Software Research Associates, Tokyo,
  38456. contributed the support for the Sony NEWS machine.
  38457. * Kazu Hirata for caring and feeding the Renesas H8/300 port and
  38458. various fixes.
  38459. * Katherine Holcomb for work on GNU Fortran.
  38460. * Manfred Hollstein for his ongoing work to keep the m88k alive, lots
  38461. of testing and bug fixing, particularly of GCC configury code.
  38462. * Steve Holmgren for MachTen patches.
  38463. * Mat Hostetter for work on the TILE-Gx and TILEPro ports.
  38464. * Jan Hubicka for his x86 port improvements.
  38465. * Falk Hueffner for working on C and optimization bug reports.
  38466. * Bernardo Innocenti for his m68k work, including merging of ColdFire
  38467. improvements and uClinux support.
  38468. * Christian Iseli for various bug fixes.
  38469. * Kamil Iskra for general m68k hacking.
  38470. * Lee Iverson for random fixes and MIPS testing.
  38471. * Balaji V. Iyer for Cilk+ development and merging.
  38472. * Andreas Jaeger for testing and benchmarking of GCC and various bug
  38473. fixes.
  38474. * Martin Jambor for his work on inter-procedural optimizations, the
  38475. switch conversion pass, and scalar replacement of aggregates.
  38476. * Jakub Jelinek for his SPARC work and sibling call optimizations as
  38477. well as lots of bug fixes and test cases, and for improving the
  38478. Java build system.
  38479. * Janis Johnson for ia64 testing and fixes, her quality improvement
  38480. sidetracks, and web page maintenance.
  38481. * Kean Johnston for SCO OpenServer support and various fixes.
  38482. * Tim Josling for the sample language treelang based originally on
  38483. Richard Kenner's "toy" language.
  38484. * Nicolai Josuttis for additional libstdc++ documentation.
  38485. * Klaus Kaempf for his ongoing work to make alpha-vms a viable
  38486. target.
  38487. * Steven G. Kargl for work on GNU Fortran.
  38488. * David Kashtan of SRI adapted GCC to VMS.
  38489. * Ryszard Kabatek for many, many libstdc++ bug fixes and
  38490. optimizations of strings, especially member functions, and for
  38491. auto_ptr fixes.
  38492. * Geoffrey Keating for his ongoing work to make the PPC work for
  38493. GNU/Linux and his automatic regression tester.
  38494. * Brendan Kehoe for his ongoing work with G++ and for a lot of early
  38495. work in just about every part of libstdc++.
  38496. * Oliver M. Kellogg of Deutsche Aerospace contributed the port to the
  38497. MIL-STD-1750A.
  38498. * Richard Kenner of the New York University Ultracomputer Research
  38499. Laboratory wrote the machine descriptions for the AMD 29000, the
  38500. DEC Alpha, the IBM RT PC, and the IBM RS/6000 as well as the
  38501. support for instruction attributes. He also made changes to better
  38502. support RISC processors including changes to common subexpression
  38503. elimination, strength reduction, function calling sequence
  38504. handling, and condition code support, in addition to generalizing
  38505. the code for frame pointer elimination and delay slot scheduling.
  38506. Richard Kenner was also the head maintainer of GCC for several
  38507. years.
  38508. * Mumit Khan for various contributions to the Cygwin and Mingw32
  38509. ports and maintaining binary releases for Microsoft Windows hosts,
  38510. and for massive libstdc++ porting work to Cygwin/Mingw32.
  38511. * Robin Kirkham for cpu32 support.
  38512. * Mark Klein for PA improvements.
  38513. * Thomas Koenig for various bug fixes.
  38514. * Bruce Korb for the new and improved fixincludes code.
  38515. * Benjamin Kosnik for his G++ work and for leading the libstdc++-v3
  38516. effort.
  38517. * Maxim Kuvyrkov for contributions to the instruction scheduler, the
  38518. Android and m68k/Coldfire ports, and optimizations.
  38519. * Charles LaBrec contributed the support for the Integrated Solutions
  38520. 68020 system.
  38521. * Asher Langton and Mike Kumbera for contributing Cray pointer
  38522. support to GNU Fortran, and for other GNU Fortran improvements.
  38523. * Jeff Law for his direction via the steering committee, coordinating
  38524. the entire egcs project and GCC 2.95, rolling out snapshots and
  38525. releases, handling merges from GCC2, reviewing tons of patches that
  38526. might have fallen through the cracks else, and random but extensive
  38527. hacking.
  38528. * Walter Lee for work on the TILE-Gx and TILEPro ports.
  38529. * Marc Lehmann for his direction via the steering committee and
  38530. helping with analysis and improvements of x86 performance.
  38531. * Victor Leikehman for work on GNU Fortran.
  38532. * Ted Lemon wrote parts of the RTL reader and printer.
  38533. * Kriang Lerdsuwanakij for C++ improvements including template as
  38534. template parameter support, and many C++ fixes.
  38535. * Warren Levy for tremendous work on libgcj (Java Runtime Library)
  38536. and random work on the Java front end.
  38537. * Alain Lichnewsky ported GCC to the MIPS CPU.
  38538. * Oskar Liljeblad for hacking on AWT and his many Java bug reports
  38539. and patches.
  38540. * Robert Lipe for OpenServer support, new testsuites, testing, etc.
  38541. * Chen Liqin for various S+core related fixes/improvement, and for
  38542. maintaining the S+core port.
  38543. * Martin Liska for his work on identical code folding, the
  38544. sanitizers, HSA, general bug fixing and for running automated
  38545. regression testing of GCC and reporting numerous bugs.
  38546. * Weiwen Liu for testing and various bug fixes.
  38547. * Manuel Lo'pez-Iba'n~ez for improving '-Wconversion' and many other
  38548. diagnostics fixes and improvements.
  38549. * Dave Love for his ongoing work with the Fortran front end and
  38550. runtime libraries.
  38551. * Martin von Lo"wis for internal consistency checking infrastructure,
  38552. various C++ improvements including namespace support, and tons of
  38553. assistance with libstdc++/compiler merges.
  38554. * H.J. Lu for his previous contributions to the steering committee,
  38555. many x86 bug reports, prototype patches, and keeping the GNU/Linux
  38556. ports working.
  38557. * Greg McGary for random fixes and (someday) bounded pointers.
  38558. * Andrew MacLeod for his ongoing work in building a real EH system,
  38559. various code generation improvements, work on the global optimizer,
  38560. etc.
  38561. * Vladimir Makarov for hacking some ugly i960 problems, PowerPC
  38562. hacking improvements to compile-time performance, overall knowledge
  38563. and direction in the area of instruction scheduling, design and
  38564. implementation of the automaton based instruction scheduler and
  38565. design and implementation of the integrated and local register
  38566. allocators.
  38567. * David Malcolm for his work on improving GCC diagnostics, JIT,
  38568. self-tests and unit testing.
  38569. * Bob Manson for his behind the scenes work on dejagnu.
  38570. * John Marino for contributing the DragonFly BSD port.
  38571. * Philip Martin for lots of libstdc++ string and vector iterator
  38572. fixes and improvements, and string clean up and testsuites.
  38573. * Michael Matz for his work on dominance tree discovery, the x86-64
  38574. port, link-time optimization framework and general optimization
  38575. improvements.
  38576. * All of the Mauve project contributors for Java test code.
  38577. * Bryce McKinlay for numerous GCJ and libgcj fixes and improvements.
  38578. * Adam Megacz for his work on the Microsoft Windows port of GCJ.
  38579. * Michael Meissner for LRS framework, ia32, m32r, v850, m88k, MIPS,
  38580. powerpc, haifa, ECOFF debug support, and other assorted hacking.
  38581. * Jason Merrill for his direction via the steering committee and
  38582. leading the G++ effort.
  38583. * Martin Michlmayr for testing GCC on several architectures using the
  38584. entire Debian archive.
  38585. * David Miller for his direction via the steering committee, lots of
  38586. SPARC work, improvements in jump.c and interfacing with the Linux
  38587. kernel developers.
  38588. * Gary Miller ported GCC to Charles River Data Systems machines.
  38589. * Alfred Minarik for libstdc++ string and ios bug fixes, and turning
  38590. the entire libstdc++ testsuite namespace-compatible.
  38591. * Mark Mitchell for his direction via the steering committee,
  38592. mountains of C++ work, load/store hoisting out of loops, alias
  38593. analysis improvements, ISO C 'restrict' support, and serving as
  38594. release manager from 2000 to 2011.
  38595. * Alan Modra for various GNU/Linux bits and testing.
  38596. * Toon Moene for his direction via the steering committee, Fortran
  38597. maintenance, and his ongoing work to make us make Fortran run fast.
  38598. * Jason Molenda for major help in the care and feeding of all the
  38599. services on the gcc.gnu.org (formerly egcs.cygnus.com)
  38600. machine--mail, web services, ftp services, etc etc. Doing all this
  38601. work on scrap paper and the backs of envelopes would have been...
  38602. difficult.
  38603. * Catherine Moore for fixing various ugly problems we have sent her
  38604. way, including the haifa bug which was killing the Alpha & PowerPC
  38605. Linux kernels.
  38606. * Mike Moreton for his various Java patches.
  38607. * David Mosberger-Tang for various Alpha improvements, and for the
  38608. initial IA-64 port.
  38609. * Stephen Moshier contributed the floating point emulator that
  38610. assists in cross-compilation and permits support for floating point
  38611. numbers wider than 64 bits and for ISO C99 support.
  38612. * Bill Moyer for his behind the scenes work on various issues.
  38613. * Philippe De Muyter for his work on the m68k port.
  38614. * Joseph S. Myers for his work on the PDP-11 port, format checking
  38615. and ISO C99 support, and continuous emphasis on (and contributions
  38616. to) documentation.
  38617. * Nathan Myers for his work on libstdc++-v3: architecture and
  38618. authorship through the first three snapshots, including
  38619. implementation of locale infrastructure, string, shadow C headers,
  38620. and the initial project documentation (DESIGN, CHECKLIST, and so
  38621. forth). Later, more work on MT-safe string and shadow headers.
  38622. * Felix Natter for documentation on porting libstdc++.
  38623. * Nathanael Nerode for cleaning up the configuration/build process.
  38624. * NeXT, Inc. donated the front end that supports the Objective-C
  38625. language.
  38626. * Hans-Peter Nilsson for the CRIS and MMIX ports, improvements to the
  38627. search engine setup, various documentation fixes and other small
  38628. fixes.
  38629. * Geoff Noer for his work on getting cygwin native builds working.
  38630. * Vegard Nossum for running automated regression testing of GCC and
  38631. reporting numerous bugs.
  38632. * Diego Novillo for his work on Tree SSA, OpenMP, SPEC performance
  38633. tracking web pages, GIMPLE tuples, and assorted fixes.
  38634. * David O'Brien for the FreeBSD/alpha, FreeBSD/AMD x86-64,
  38635. FreeBSD/ARM, FreeBSD/PowerPC, and FreeBSD/SPARC64 ports and related
  38636. infrastructure improvements.
  38637. * Alexandre Oliva for various build infrastructure improvements,
  38638. scripts and amazing testing work, including keeping libtool issues
  38639. sane and happy.
  38640. * Stefan Olsson for work on mt_alloc.
  38641. * Melissa O'Neill for various NeXT fixes.
  38642. * Rainer Orth for random MIPS work, including improvements to GCC's
  38643. o32 ABI support, improvements to dejagnu's MIPS support, Java
  38644. configuration clean-ups and porting work, and maintaining the IRIX,
  38645. Solaris 2, and Tru64 UNIX ports.
  38646. * Steven Pemberton for his contribution of 'enquire' which allowed
  38647. GCC to determine various properties of the floating point unit and
  38648. generate 'float.h' in older versions of GCC.
  38649. * Hartmut Penner for work on the s390 port.
  38650. * Paul Petersen wrote the machine description for the Alliant FX/8.
  38651. * Alexandre Petit-Bianco for implementing much of the Java compiler
  38652. and continued Java maintainership.
  38653. * Matthias Pfaller for major improvements to the NS32k port.
  38654. * Gerald Pfeifer for his direction via the steering committee,
  38655. pointing out lots of problems we need to solve, maintenance of the
  38656. web pages, and taking care of documentation maintenance in general.
  38657. * Marek Polacek for his work on the C front end, the sanitizers and
  38658. general bug fixing.
  38659. * Andrew Pinski for processing bug reports by the dozen.
  38660. * Ovidiu Predescu for his work on the Objective-C front end and
  38661. runtime libraries.
  38662. * Jerry Quinn for major performance improvements in C++ formatted
  38663. I/O.
  38664. * Ken Raeburn for various improvements to checker, MIPS ports and
  38665. various cleanups in the compiler.
  38666. * Rolf W. Rasmussen for hacking on AWT.
  38667. * David Reese of Sun Microsystems contributed to the Solaris on
  38668. PowerPC port.
  38669. * John Regehr for running automated regression testing of GCC and
  38670. reporting numerous bugs.
  38671. * Volker Reichelt for running automated regression testing of GCC and
  38672. reporting numerous bugs and for keeping up with the problem
  38673. reports.
  38674. * Joern Rennecke for maintaining the sh port, loop, regmove & reload
  38675. hacking and developing and maintaining the Epiphany port.
  38676. * Loren J. Rittle for improvements to libstdc++-v3 including the
  38677. FreeBSD port, threading fixes, thread-related configury changes,
  38678. critical threading documentation, and solutions to really tricky
  38679. I/O problems, as well as keeping GCC properly working on FreeBSD
  38680. and continuous testing.
  38681. * Craig Rodrigues for processing tons of bug reports.
  38682. * Ola Ro"nnerup for work on mt_alloc.
  38683. * Gavin Romig-Koch for lots of behind the scenes MIPS work.
  38684. * David Ronis inspired and encouraged Craig to rewrite the G77
  38685. documentation in texinfo format by contributing a first pass at a
  38686. translation of the old 'g77-0.5.16/f/DOC' file.
  38687. * Ken Rose for fixes to GCC's delay slot filling code.
  38688. * Ira Rosen for her contributions to the auto-vectorizer.
  38689. * Paul Rubin wrote most of the preprocessor.
  38690. * Pe'tur Runo'lfsson for major performance improvements in C++
  38691. formatted I/O and large file support in C++ filebuf.
  38692. * Chip Salzenberg for libstdc++ patches and improvements to locales,
  38693. traits, Makefiles, libio, libtool hackery, and "long long" support.
  38694. * Juha Sarlin for improvements to the H8 code generator.
  38695. * Greg Satz assisted in making GCC work on HP-UX for the 9000 series
  38696. 300.
  38697. * Roger Sayle for improvements to constant folding and GCC's RTL
  38698. optimizers as well as for fixing numerous bugs.
  38699. * Bradley Schatz for his work on the GCJ FAQ.
  38700. * Peter Schauer wrote the code to allow debugging to work on the
  38701. Alpha.
  38702. * William Schelter did most of the work on the Intel 80386 support.
  38703. * Tobias Schlu"ter for work on GNU Fortran.
  38704. * Bernd Schmidt for various code generation improvements and major
  38705. work in the reload pass, serving as release manager for GCC 2.95.3,
  38706. and work on the Blackfin and C6X ports.
  38707. * Peter Schmid for constant testing of libstdc++--especially
  38708. application testing, going above and beyond what was requested for
  38709. the release criteria--and libstdc++ header file tweaks.
  38710. * Jason Schroeder for jcf-dump patches.
  38711. * Andreas Schwab for his work on the m68k port.
  38712. * Lars Segerlund for work on GNU Fortran.
  38713. * Dodji Seketeli for numerous C++ bug fixes and debug info
  38714. improvements.
  38715. * Tim Shen for major work on '<regex>'.
  38716. * Joel Sherrill for his direction via the steering committee, RTEMS
  38717. contributions and RTEMS testing.
  38718. * Nathan Sidwell for many C++ fixes/improvements.
  38719. * Jeffrey Siegal for helping RMS with the original design of GCC,
  38720. some code which handles the parse tree and RTL data structures,
  38721. constant folding and help with the original VAX & m68k ports.
  38722. * Kenny Simpson for prompting libstdc++ fixes due to defect reports
  38723. from the LWG (thereby keeping GCC in line with updates from the
  38724. ISO).
  38725. * Franz Sirl for his ongoing work with making the PPC port stable for
  38726. GNU/Linux.
  38727. * Andrey Slepuhin for assorted AIX hacking.
  38728. * Trevor Smigiel for contributing the SPU port.
  38729. * Christopher Smith did the port for Convex machines.
  38730. * Danny Smith for his major efforts on the Mingw (and Cygwin) ports.
  38731. Retired from GCC maintainership August 2010, having mentored two
  38732. new maintainers into the role.
  38733. * Randy Smith finished the Sun FPA support.
  38734. * Ed Smith-Rowland for his continuous work on libstdc++-v3, special
  38735. functions, '<random>', and various improvements to C++11 features.
  38736. * Scott Snyder for queue, iterator, istream, and string fixes and
  38737. libstdc++ testsuite entries. Also for providing the patch to G77
  38738. to add rudimentary support for 'INTEGER*1', 'INTEGER*2', and
  38739. 'LOGICAL*1'.
  38740. * Zdenek Sojka for running automated regression testing of GCC and
  38741. reporting numerous bugs.
  38742. * Arseny Solokha for running automated regression testing of GCC and
  38743. reporting numerous bugs.
  38744. * Jayant Sonar for contributing the CR16 port.
  38745. * Brad Spencer for contributions to the GLIBCPP_FORCE_NEW technique.
  38746. * Richard Stallman, for writing the original GCC and launching the
  38747. GNU project.
  38748. * Jan Stein of the Chalmers Computer Society provided support for
  38749. Genix, as well as part of the 32000 machine description.
  38750. * Gerhard Steinmetz for running automated regression testing of GCC
  38751. and reporting numerous bugs.
  38752. * Nigel Stephens for various mips16 related fixes/improvements.
  38753. * Jonathan Stone wrote the machine description for the Pyramid
  38754. computer.
  38755. * Graham Stott for various infrastructure improvements.
  38756. * John Stracke for his Java HTTP protocol fixes.
  38757. * Mike Stump for his Elxsi port, G++ contributions over the years and
  38758. more recently his vxworks contributions
  38759. * Jeff Sturm for Java porting help, bug fixes, and encouragement.
  38760. * Zhendong Su for running automated regression testing of GCC and
  38761. reporting numerous bugs.
  38762. * Chengnian Sun for running automated regression testing of GCC and
  38763. reporting numerous bugs.
  38764. * Shigeya Suzuki for this fixes for the bsdi platforms.
  38765. * Ian Lance Taylor for the Go frontend, the initial mips16 and mips64
  38766. support, general configury hacking, fixincludes, etc.
  38767. * Holger Teutsch provided the support for the Clipper CPU.
  38768. * Gary Thomas for his ongoing work to make the PPC work for
  38769. GNU/Linux.
  38770. * Paul Thomas for contributions to GNU Fortran.
  38771. * Philipp Thomas for random bug fixes throughout the compiler
  38772. * Jason Thorpe for thread support in libstdc++ on NetBSD.
  38773. * Kresten Krab Thorup wrote the run time support for the Objective-C
  38774. language and the fantastic Java bytecode interpreter.
  38775. * Michael Tiemann for random bug fixes, the first instruction
  38776. scheduler, initial C++ support, function integration, NS32k, SPARC
  38777. and M88k machine description work, delay slot scheduling.
  38778. * Andreas Tobler for his work porting libgcj to Darwin.
  38779. * Teemu Torma for thread safe exception handling support.
  38780. * Leonard Tower wrote parts of the parser, RTL generator, and RTL
  38781. definitions, and of the VAX machine description.
  38782. * Daniel Towner and Hariharan Sandanagobalane contributed and
  38783. maintain the picoChip port.
  38784. * Tom Tromey for internationalization support and for his many Java
  38785. contributions and libgcj maintainership.
  38786. * Lassi Tuura for improvements to config.guess to determine HP
  38787. processor types.
  38788. * Petter Urkedal for libstdc++ CXXFLAGS, math, and algorithms fixes.
  38789. * Andy Vaught for the design and initial implementation of the GNU
  38790. Fortran front end.
  38791. * Brent Verner for work with the libstdc++ cshadow files and their
  38792. associated configure steps.
  38793. * Todd Vierling for contributions for NetBSD ports.
  38794. * Andrew Waterman for contributing the RISC-V port, as well as
  38795. maintaining it.
  38796. * Jonathan Wakely for contributing libstdc++ Doxygen notes and XHTML
  38797. guidance and maintaining libstdc++.
  38798. * Dean Wakerley for converting the install documentation from HTML to
  38799. texinfo in time for GCC 3.0.
  38800. * Krister Walfridsson for random bug fixes.
  38801. * Feng Wang for contributions to GNU Fortran.
  38802. * Stephen M. Webb for time and effort on making libstdc++ shadow
  38803. files work with the tricky Solaris 8+ headers, and for pushing the
  38804. build-time header tree. Also, for starting and driving the
  38805. '<regex>' effort.
  38806. * John Wehle for various improvements for the x86 code generator,
  38807. related infrastructure improvements to help x86 code generation,
  38808. value range propagation and other work, WE32k port.
  38809. * Ulrich Weigand for work on the s390 port.
  38810. * Janus Weil for contributions to GNU Fortran.
  38811. * Zack Weinberg for major work on cpplib and various other bug fixes.
  38812. * Matt Welsh for help with Linux Threads support in GCJ.
  38813. * Urban Widmark for help fixing java.io.
  38814. * Mark Wielaard for new Java library code and his work integrating
  38815. with Classpath.
  38816. * Dale Wiles helped port GCC to the Tahoe.
  38817. * Bob Wilson from Tensilica, Inc. for the Xtensa port.
  38818. * Jim Wilson for his direction via the steering committee, tackling
  38819. hard problems in various places that nobody else wanted to work on,
  38820. strength reduction and other loop optimizations.
  38821. * Paul Woegerer and Tal Agmon for the CRX port.
  38822. * Carlo Wood for various fixes.
  38823. * Tom Wood for work on the m88k port.
  38824. * Chung-Ju Wu for his work on the Andes NDS32 port.
  38825. * Canqun Yang for work on GNU Fortran.
  38826. * Masanobu Yuhara of Fujitsu Laboratories implemented the machine
  38827. description for the Tron architecture (specifically, the Gmicro).
  38828. * Kevin Zachmann helped port GCC to the Tahoe.
  38829. * Ayal Zaks for Swing Modulo Scheduling (SMS).
  38830. * Qirun Zhang for running automated regression testing of GCC and
  38831. reporting numerous bugs.
  38832. * Xiaoqiang Zhang for work on GNU Fortran.
  38833. * Gilles Zunino for help porting Java to Irix.
  38834. The following people are recognized for their contributions to GNAT,
  38835. the Ada front end of GCC:
  38836. * Bernard Banner
  38837. * Romain Berrendonner
  38838. * Geert Bosch
  38839. * Emmanuel Briot
  38840. * Joel Brobecker
  38841. * Ben Brosgol
  38842. * Vincent Celier
  38843. * Arnaud Charlet
  38844. * Chien Chieng
  38845. * Cyrille Comar
  38846. * Cyrille Crozes
  38847. * Robert Dewar
  38848. * Gary Dismukes
  38849. * Robert Duff
  38850. * Ed Falis
  38851. * Ramon Fernandez
  38852. * Sam Figueroa
  38853. * Vasiliy Fofanov
  38854. * Michael Friess
  38855. * Franco Gasperoni
  38856. * Ted Giering
  38857. * Matthew Gingell
  38858. * Laurent Guerby
  38859. * Jerome Guitton
  38860. * Olivier Hainque
  38861. * Jerome Hugues
  38862. * Hristian Kirtchev
  38863. * Jerome Lambourg
  38864. * Bruno Leclerc
  38865. * Albert Lee
  38866. * Sean McNeil
  38867. * Javier Miranda
  38868. * Laurent Nana
  38869. * Pascal Obry
  38870. * Dong-Ik Oh
  38871. * Laurent Pautet
  38872. * Brett Porter
  38873. * Thomas Quinot
  38874. * Nicolas Roche
  38875. * Pat Rogers
  38876. * Jose Ruiz
  38877. * Douglas Rupp
  38878. * Sergey Rybin
  38879. * Gail Schenker
  38880. * Ed Schonberg
  38881. * Nicolas Setton
  38882. * Samuel Tardieu
  38883. The following people are recognized for their contributions of new
  38884. features, bug reports, testing and integration of classpath/libgcj for
  38885. GCC version 4.1:
  38886. * Lillian Angel for 'JTree' implementation and lots Free Swing
  38887. additions and bug fixes.
  38888. * Wolfgang Baer for 'GapContent' bug fixes.
  38889. * Anthony Balkissoon for 'JList', Free Swing 1.5 updates and mouse
  38890. event fixes, lots of Free Swing work including 'JTable' editing.
  38891. * Stuart Ballard for RMI constant fixes.
  38892. * Goffredo Baroncelli for 'HTTPURLConnection' fixes.
  38893. * Gary Benson for 'MessageFormat' fixes.
  38894. * Daniel Bonniot for 'Serialization' fixes.
  38895. * Chris Burdess for lots of gnu.xml and http protocol fixes, 'StAX'
  38896. and 'DOM xml:id' support.
  38897. * Ka-Hing Cheung for 'TreePath' and 'TreeSelection' fixes.
  38898. * Archie Cobbs for build fixes, VM interface updates,
  38899. 'URLClassLoader' updates.
  38900. * Kelley Cook for build fixes.
  38901. * Martin Cordova for Suggestions for better 'SocketTimeoutException'.
  38902. * David Daney for 'BitSet' bug fixes, 'HttpURLConnection' rewrite and
  38903. improvements.
  38904. * Thomas Fitzsimmons for lots of upgrades to the gtk+ AWT and Cairo
  38905. 2D support. Lots of imageio framework additions, lots of AWT and
  38906. Free Swing bug fixes.
  38907. * Jeroen Frijters for 'ClassLoader' and nio cleanups, serialization
  38908. fixes, better 'Proxy' support, bug fixes and IKVM integration.
  38909. * Santiago Gala for 'AccessControlContext' fixes.
  38910. * Nicolas Geoffray for 'VMClassLoader' and 'AccessController'
  38911. improvements.
  38912. * David Gilbert for 'basic' and 'metal' icon and plaf support and
  38913. lots of documenting, Lots of Free Swing and metal theme additions.
  38914. 'MetalIconFactory' implementation.
  38915. * Anthony Green for 'MIDI' framework, 'ALSA' and 'DSSI' providers.
  38916. * Andrew Haley for 'Serialization' and 'URLClassLoader' fixes, gcj
  38917. build speedups.
  38918. * Kim Ho for 'JFileChooser' implementation.
  38919. * Andrew John Hughes for 'Locale' and net fixes, URI RFC2986 updates,
  38920. 'Serialization' fixes, 'Properties' XML support and generic branch
  38921. work, VMIntegration guide update.
  38922. * Bastiaan Huisman for 'TimeZone' bug fixing.
  38923. * Andreas Jaeger for mprec updates.
  38924. * Paul Jenner for better '-Werror' support.
  38925. * Ito Kazumitsu for 'NetworkInterface' implementation and updates.
  38926. * Roman Kennke for 'BoxLayout', 'GrayFilter' and 'SplitPane', plus
  38927. bug fixes all over. Lots of Free Swing work including styled text.
  38928. * Simon Kitching for 'String' cleanups and optimization suggestions.
  38929. * Michael Koch for configuration fixes, 'Locale' updates, bug and
  38930. build fixes.
  38931. * Guilhem Lavaux for configuration, thread and channel fixes and
  38932. Kaffe integration. JCL native 'Pointer' updates. Logger bug
  38933. fixes.
  38934. * David Lichteblau for JCL support library global/local reference
  38935. cleanups.
  38936. * Aaron Luchko for JDWP updates and documentation fixes.
  38937. * Ziga Mahkovec for 'Graphics2D' upgraded to Cairo 0.5 and new regex
  38938. features.
  38939. * Sven de Marothy for BMP imageio support, CSS and 'TextLayout'
  38940. fixes. 'GtkImage' rewrite, 2D, awt, free swing and date/time fixes
  38941. and implementing the Qt4 peers.
  38942. * Casey Marshall for crypto algorithm fixes, 'FileChannel' lock,
  38943. 'SystemLogger' and 'FileHandler' rotate implementations, NIO
  38944. 'FileChannel.map' support, security and policy updates.
  38945. * Bryce McKinlay for RMI work.
  38946. * Audrius Meskauskas for lots of Free Corba, RMI and HTML work plus
  38947. testing and documenting.
  38948. * Kalle Olavi Niemitalo for build fixes.
  38949. * Rainer Orth for build fixes.
  38950. * Andrew Overholt for 'File' locking fixes.
  38951. * Ingo Proetel for 'Image', 'Logger' and 'URLClassLoader' updates.
  38952. * Olga Rodimina for 'MenuSelectionManager' implementation.
  38953. * Jan Roehrich for 'BasicTreeUI' and 'JTree' fixes.
  38954. * Julian Scheid for documentation updates and gjdoc support.
  38955. * Christian Schlichtherle for zip fixes and cleanups.
  38956. * Robert Schuster for documentation updates and beans fixes,
  38957. 'TreeNode' enumerations and 'ActionCommand' and various fixes, XML
  38958. and URL, AWT and Free Swing bug fixes.
  38959. * Keith Seitz for lots of JDWP work.
  38960. * Christian Thalinger for 64-bit cleanups, Configuration and VM
  38961. interface fixes and 'CACAO' integration, 'fdlibm' updates.
  38962. * Gael Thomas for 'VMClassLoader' boot packages support suggestions.
  38963. * Andreas Tobler for Darwin and Solaris testing and fixing, 'Qt4'
  38964. support for Darwin/OS X, 'Graphics2D' support, 'gtk+' updates.
  38965. * Dalibor Topic for better 'DEBUG' support, build cleanups and Kaffe
  38966. integration. 'Qt4' build infrastructure, 'SHA1PRNG' and
  38967. 'GdkPixbugDecoder' updates.
  38968. * Tom Tromey for Eclipse integration, generics work, lots of bug
  38969. fixes and gcj integration including coordinating The Big Merge.
  38970. * Mark Wielaard for bug fixes, packaging and release management,
  38971. 'Clipboard' implementation, system call interrupts and network
  38972. timeouts and 'GdkPixpufDecoder' fixes.
  38973. In addition to the above, all of which also contributed time and energy
  38974. in testing GCC, we would like to thank the following for their
  38975. contributions to testing:
  38976. * Michael Abd-El-Malek
  38977. * Thomas Arend
  38978. * Bonzo Armstrong
  38979. * Steven Ashe
  38980. * Chris Baldwin
  38981. * David Billinghurst
  38982. * Jim Blandy
  38983. * Stephane Bortzmeyer
  38984. * Horst von Brand
  38985. * Frank Braun
  38986. * Rodney Brown
  38987. * Sidney Cadot
  38988. * Bradford Castalia
  38989. * Robert Clark
  38990. * Jonathan Corbet
  38991. * Ralph Doncaster
  38992. * Richard Emberson
  38993. * Levente Farkas
  38994. * Graham Fawcett
  38995. * Mark Fernyhough
  38996. * Robert A. French
  38997. * Jo"rgen Freyh
  38998. * Mark K. Gardner
  38999. * Charles-Antoine Gauthier
  39000. * Yung Shing Gene
  39001. * David Gilbert
  39002. * Simon Gornall
  39003. * Fred Gray
  39004. * John Griffin
  39005. * Patrik Hagglund
  39006. * Phil Hargett
  39007. * Amancio Hasty
  39008. * Takafumi Hayashi
  39009. * Bryan W. Headley
  39010. * Kevin B. Hendricks
  39011. * Joep Jansen
  39012. * Christian Joensson
  39013. * Michel Kern
  39014. * David Kidd
  39015. * Tobias Kuipers
  39016. * Anand Krishnaswamy
  39017. * A. O. V. Le Blanc
  39018. * llewelly
  39019. * Damon Love
  39020. * Brad Lucier
  39021. * Matthias Klose
  39022. * Martin Knoblauch
  39023. * Rick Lutowski
  39024. * Jesse Macnish
  39025. * Stefan Morrell
  39026. * Anon A. Mous
  39027. * Matthias Mueller
  39028. * Pekka Nikander
  39029. * Rick Niles
  39030. * Jon Olson
  39031. * Magnus Persson
  39032. * Chris Pollard
  39033. * Richard Polton
  39034. * Derk Reefman
  39035. * David Rees
  39036. * Paul Reilly
  39037. * Tom Reilly
  39038. * Torsten Rueger
  39039. * Danny Sadinoff
  39040. * Marc Schifer
  39041. * Erik Schnetter
  39042. * Wayne K. Schroll
  39043. * David Schuler
  39044. * Vin Shelton
  39045. * Tim Souder
  39046. * Adam Sulmicki
  39047. * Bill Thorson
  39048. * George Talbot
  39049. * Pedro A. M. Vazquez
  39050. * Gregory Warnes
  39051. * Ian Watson
  39052. * David E. Young
  39053. * And many others
  39054. And finally we'd like to thank everyone who uses the compiler, provides
  39055. feedback and generally reminds us why we're doing this work in the first
  39056. place.
  39057. 
  39058. File: gccint.info, Node: Option Index, Next: Concept Index, Prev: Contributors, Up: Top
  39059. Option Index
  39060. ************
  39061. GCC's command line options are indexed here without any initial '-' or
  39062. '--'. Where an option has both positive and negative forms (such as
  39063. '-fOPTION' and '-fno-OPTION'), relevant entries in the manual are
  39064. indexed under the most appropriate form; it may sometimes be useful to
  39065. look up both forms.
  39066. �[index�]
  39067. * Menu:
  39068. * fltrans: Internal flags. (line 18)
  39069. * fltrans-output-list: Internal flags. (line 23)
  39070. * fresolution: Internal flags. (line 27)
  39071. * fwpa: Internal flags. (line 9)
  39072. * msoft-float: Soft float library routines.
  39073. (line 6)
  39074. 
  39075. File: gccint.info, Node: Concept Index, Prev: Option Index, Up: Top
  39076. Concept Index
  39077. *************
  39078. �[index�]
  39079. * Menu:
  39080. * ! in constraint: Multi-Alternative. (line 48)
  39081. * # in constraint: Modifiers. (line 78)
  39082. * # in template: Output Template. (line 66)
  39083. * #pragma: Misc. (line 420)
  39084. * $ in constraint: Multi-Alternative. (line 57)
  39085. * % in constraint: Modifiers. (line 52)
  39086. * % in GTY option: GTY Options. (line 18)
  39087. * % in template: Output Template. (line 6)
  39088. * & in constraint: Modifiers. (line 25)
  39089. * (gimple: Logical Operators. (line 169)
  39090. * (gimple <1>: Logical Operators. (line 173)
  39091. * (gimple <2>: Logical Operators. (line 177)
  39092. * (gimple_stmt_iterator: GIMPLE API. (line 30)
  39093. * (nil): RTL Objects. (line 73)
  39094. * * in constraint: Modifiers. (line 83)
  39095. * * in template: Output Statement. (line 29)
  39096. * *gimple_build_asm_vec: GIMPLE_ASM. (line 6)
  39097. * *gimple_build_assign: GIMPLE_ASSIGN. (line 6)
  39098. * *gimple_build_assign <1>: GIMPLE_ASSIGN. (line 18)
  39099. * *gimple_build_assign <2>: GIMPLE_ASSIGN. (line 29)
  39100. * *gimple_build_assign <3>: GIMPLE_ASSIGN. (line 35)
  39101. * *gimple_build_bind: GIMPLE_BIND. (line 6)
  39102. * *gimple_build_call: GIMPLE_CALL. (line 6)
  39103. * *gimple_build_call_from_tree: GIMPLE_CALL. (line 15)
  39104. * *gimple_build_call_vec: GIMPLE_CALL. (line 25)
  39105. * *gimple_build_catch: GIMPLE_CATCH. (line 6)
  39106. * *gimple_build_cond: GIMPLE_COND. (line 6)
  39107. * *gimple_build_cond_from_tree: GIMPLE_COND. (line 14)
  39108. * *gimple_build_debug_bind: GIMPLE_DEBUG. (line 6)
  39109. * *gimple_build_eh_filter: GIMPLE_EH_FILTER. (line 6)
  39110. * *gimple_build_goto: GIMPLE_GOTO. (line 6)
  39111. * *gimple_build_label: GIMPLE_LABEL. (line 6)
  39112. * *gimple_build_omp_atomic_load: GIMPLE_OMP_ATOMIC_LOAD.
  39113. (line 6)
  39114. * *gimple_build_omp_atomic_store: GIMPLE_OMP_ATOMIC_STORE.
  39115. (line 6)
  39116. * *gimple_build_omp_continue: GIMPLE_OMP_CONTINUE.
  39117. (line 6)
  39118. * *gimple_build_omp_critical: GIMPLE_OMP_CRITICAL.
  39119. (line 6)
  39120. * *gimple_build_omp_for: GIMPLE_OMP_FOR. (line 6)
  39121. * *gimple_build_omp_parallel: GIMPLE_OMP_PARALLEL.
  39122. (line 6)
  39123. * *gimple_build_omp_sections: GIMPLE_OMP_SECTIONS.
  39124. (line 6)
  39125. * *gimple_build_omp_single: GIMPLE_OMP_SINGLE. (line 6)
  39126. * *gimple_build_resx: GIMPLE_RESX. (line 6)
  39127. * *gimple_build_return: GIMPLE_RETURN. (line 6)
  39128. * *gimple_build_switch: GIMPLE_SWITCH. (line 6)
  39129. * *gimple_build_try: GIMPLE_TRY. (line 6)
  39130. * + in constraint: Modifiers. (line 12)
  39131. * -fsection-anchors: Special Accessors. (line 117)
  39132. * -fsection-anchors <1>: Anchored Addresses. (line 6)
  39133. * /c in RTL dump: Flags. (line 230)
  39134. * /f in RTL dump: Flags. (line 238)
  39135. * /i in RTL dump: Flags. (line 283)
  39136. * /j in RTL dump: Flags. (line 295)
  39137. * /s in RTL dump: Flags. (line 254)
  39138. * /u in RTL dump: Flags. (line 307)
  39139. * /v in RTL dump: Flags. (line 339)
  39140. * 0 in constraint: Simple Constraints. (line 128)
  39141. * < in constraint: Simple Constraints. (line 47)
  39142. * = in constraint: Modifiers. (line 8)
  39143. * > in constraint: Simple Constraints. (line 59)
  39144. * ? in constraint: Multi-Alternative. (line 42)
  39145. * @ in instruction pattern names: Parameterized Names.
  39146. (line 6)
  39147. * \: Output Template. (line 46)
  39148. * ^ in constraint: Multi-Alternative. (line 53)
  39149. * __absvdi2: Integer library routines.
  39150. (line 106)
  39151. * __absvsi2: Integer library routines.
  39152. (line 105)
  39153. * __addda3: Fixed-point fractional library routines.
  39154. (line 52)
  39155. * __adddf3: Soft float library routines.
  39156. (line 22)
  39157. * __adddq3: Fixed-point fractional library routines.
  39158. (line 39)
  39159. * __addha3: Fixed-point fractional library routines.
  39160. (line 49)
  39161. * __addhq3: Fixed-point fractional library routines.
  39162. (line 37)
  39163. * __addqq3: Fixed-point fractional library routines.
  39164. (line 35)
  39165. * __addsa3: Fixed-point fractional library routines.
  39166. (line 51)
  39167. * __addsf3: Soft float library routines.
  39168. (line 21)
  39169. * __addsq3: Fixed-point fractional library routines.
  39170. (line 38)
  39171. * __addta3: Fixed-point fractional library routines.
  39172. (line 53)
  39173. * __addtf3: Soft float library routines.
  39174. (line 23)
  39175. * __adduda3: Fixed-point fractional library routines.
  39176. (line 59)
  39177. * __addudq3: Fixed-point fractional library routines.
  39178. (line 47)
  39179. * __adduha3: Fixed-point fractional library routines.
  39180. (line 55)
  39181. * __adduhq3: Fixed-point fractional library routines.
  39182. (line 43)
  39183. * __adduqq3: Fixed-point fractional library routines.
  39184. (line 41)
  39185. * __addusa3: Fixed-point fractional library routines.
  39186. (line 57)
  39187. * __addusq3: Fixed-point fractional library routines.
  39188. (line 45)
  39189. * __adduta3: Fixed-point fractional library routines.
  39190. (line 61)
  39191. * __addvdi3: Integer library routines.
  39192. (line 110)
  39193. * __addvsi3: Integer library routines.
  39194. (line 109)
  39195. * __addxf3: Soft float library routines.
  39196. (line 25)
  39197. * __ashlda3: Fixed-point fractional library routines.
  39198. (line 358)
  39199. * __ashldi3: Integer library routines.
  39200. (line 13)
  39201. * __ashldq3: Fixed-point fractional library routines.
  39202. (line 346)
  39203. * __ashlha3: Fixed-point fractional library routines.
  39204. (line 356)
  39205. * __ashlhq3: Fixed-point fractional library routines.
  39206. (line 344)
  39207. * __ashlqq3: Fixed-point fractional library routines.
  39208. (line 343)
  39209. * __ashlsa3: Fixed-point fractional library routines.
  39210. (line 357)
  39211. * __ashlsi3: Integer library routines.
  39212. (line 12)
  39213. * __ashlsq3: Fixed-point fractional library routines.
  39214. (line 345)
  39215. * __ashlta3: Fixed-point fractional library routines.
  39216. (line 359)
  39217. * __ashlti3: Integer library routines.
  39218. (line 14)
  39219. * __ashluda3: Fixed-point fractional library routines.
  39220. (line 365)
  39221. * __ashludq3: Fixed-point fractional library routines.
  39222. (line 354)
  39223. * __ashluha3: Fixed-point fractional library routines.
  39224. (line 361)
  39225. * __ashluhq3: Fixed-point fractional library routines.
  39226. (line 350)
  39227. * __ashluqq3: Fixed-point fractional library routines.
  39228. (line 348)
  39229. * __ashlusa3: Fixed-point fractional library routines.
  39230. (line 363)
  39231. * __ashlusq3: Fixed-point fractional library routines.
  39232. (line 352)
  39233. * __ashluta3: Fixed-point fractional library routines.
  39234. (line 367)
  39235. * __ashrda3: Fixed-point fractional library routines.
  39236. (line 378)
  39237. * __ashrdi3: Integer library routines.
  39238. (line 18)
  39239. * __ashrdq3: Fixed-point fractional library routines.
  39240. (line 374)
  39241. * __ashrha3: Fixed-point fractional library routines.
  39242. (line 376)
  39243. * __ashrhq3: Fixed-point fractional library routines.
  39244. (line 372)
  39245. * __ashrqq3: Fixed-point fractional library routines.
  39246. (line 371)
  39247. * __ashrsa3: Fixed-point fractional library routines.
  39248. (line 377)
  39249. * __ashrsi3: Integer library routines.
  39250. (line 17)
  39251. * __ashrsq3: Fixed-point fractional library routines.
  39252. (line 373)
  39253. * __ashrta3: Fixed-point fractional library routines.
  39254. (line 379)
  39255. * __ashrti3: Integer library routines.
  39256. (line 19)
  39257. * __bid_adddd3: Decimal float library routines.
  39258. (line 23)
  39259. * __bid_addsd3: Decimal float library routines.
  39260. (line 19)
  39261. * __bid_addtd3: Decimal float library routines.
  39262. (line 27)
  39263. * __bid_divdd3: Decimal float library routines.
  39264. (line 66)
  39265. * __bid_divsd3: Decimal float library routines.
  39266. (line 62)
  39267. * __bid_divtd3: Decimal float library routines.
  39268. (line 70)
  39269. * __bid_eqdd2: Decimal float library routines.
  39270. (line 258)
  39271. * __bid_eqsd2: Decimal float library routines.
  39272. (line 256)
  39273. * __bid_eqtd2: Decimal float library routines.
  39274. (line 260)
  39275. * __bid_extendddtd2: Decimal float library routines.
  39276. (line 91)
  39277. * __bid_extendddtf: Decimal float library routines.
  39278. (line 139)
  39279. * __bid_extendddxf: Decimal float library routines.
  39280. (line 133)
  39281. * __bid_extenddfdd: Decimal float library routines.
  39282. (line 146)
  39283. * __bid_extenddftd: Decimal float library routines.
  39284. (line 106)
  39285. * __bid_extendsddd2: Decimal float library routines.
  39286. (line 87)
  39287. * __bid_extendsddf: Decimal float library routines.
  39288. (line 127)
  39289. * __bid_extendsdtd2: Decimal float library routines.
  39290. (line 89)
  39291. * __bid_extendsdtf: Decimal float library routines.
  39292. (line 137)
  39293. * __bid_extendsdxf: Decimal float library routines.
  39294. (line 131)
  39295. * __bid_extendsfdd: Decimal float library routines.
  39296. (line 102)
  39297. * __bid_extendsfsd: Decimal float library routines.
  39298. (line 144)
  39299. * __bid_extendsftd: Decimal float library routines.
  39300. (line 104)
  39301. * __bid_extendtftd: Decimal float library routines.
  39302. (line 148)
  39303. * __bid_extendxftd: Decimal float library routines.
  39304. (line 108)
  39305. * __bid_fixdddi: Decimal float library routines.
  39306. (line 169)
  39307. * __bid_fixddsi: Decimal float library routines.
  39308. (line 161)
  39309. * __bid_fixsddi: Decimal float library routines.
  39310. (line 167)
  39311. * __bid_fixsdsi: Decimal float library routines.
  39312. (line 159)
  39313. * __bid_fixtddi: Decimal float library routines.
  39314. (line 171)
  39315. * __bid_fixtdsi: Decimal float library routines.
  39316. (line 163)
  39317. * __bid_fixunsdddi: Decimal float library routines.
  39318. (line 186)
  39319. * __bid_fixunsddsi: Decimal float library routines.
  39320. (line 177)
  39321. * __bid_fixunssddi: Decimal float library routines.
  39322. (line 184)
  39323. * __bid_fixunssdsi: Decimal float library routines.
  39324. (line 175)
  39325. * __bid_fixunstddi: Decimal float library routines.
  39326. (line 188)
  39327. * __bid_fixunstdsi: Decimal float library routines.
  39328. (line 179)
  39329. * __bid_floatdidd: Decimal float library routines.
  39330. (line 204)
  39331. * __bid_floatdisd: Decimal float library routines.
  39332. (line 202)
  39333. * __bid_floatditd: Decimal float library routines.
  39334. (line 206)
  39335. * __bid_floatsidd: Decimal float library routines.
  39336. (line 195)
  39337. * __bid_floatsisd: Decimal float library routines.
  39338. (line 193)
  39339. * __bid_floatsitd: Decimal float library routines.
  39340. (line 197)
  39341. * __bid_floatunsdidd: Decimal float library routines.
  39342. (line 222)
  39343. * __bid_floatunsdisd: Decimal float library routines.
  39344. (line 220)
  39345. * __bid_floatunsditd: Decimal float library routines.
  39346. (line 224)
  39347. * __bid_floatunssidd: Decimal float library routines.
  39348. (line 213)
  39349. * __bid_floatunssisd: Decimal float library routines.
  39350. (line 211)
  39351. * __bid_floatunssitd: Decimal float library routines.
  39352. (line 215)
  39353. * __bid_gedd2: Decimal float library routines.
  39354. (line 276)
  39355. * __bid_gesd2: Decimal float library routines.
  39356. (line 274)
  39357. * __bid_getd2: Decimal float library routines.
  39358. (line 278)
  39359. * __bid_gtdd2: Decimal float library routines.
  39360. (line 303)
  39361. * __bid_gtsd2: Decimal float library routines.
  39362. (line 301)
  39363. * __bid_gttd2: Decimal float library routines.
  39364. (line 305)
  39365. * __bid_ledd2: Decimal float library routines.
  39366. (line 294)
  39367. * __bid_lesd2: Decimal float library routines.
  39368. (line 292)
  39369. * __bid_letd2: Decimal float library routines.
  39370. (line 296)
  39371. * __bid_ltdd2: Decimal float library routines.
  39372. (line 285)
  39373. * __bid_ltsd2: Decimal float library routines.
  39374. (line 283)
  39375. * __bid_lttd2: Decimal float library routines.
  39376. (line 287)
  39377. * __bid_muldd3: Decimal float library routines.
  39378. (line 52)
  39379. * __bid_mulsd3: Decimal float library routines.
  39380. (line 48)
  39381. * __bid_multd3: Decimal float library routines.
  39382. (line 56)
  39383. * __bid_nedd2: Decimal float library routines.
  39384. (line 267)
  39385. * __bid_negdd2: Decimal float library routines.
  39386. (line 77)
  39387. * __bid_negsd2: Decimal float library routines.
  39388. (line 75)
  39389. * __bid_negtd2: Decimal float library routines.
  39390. (line 79)
  39391. * __bid_nesd2: Decimal float library routines.
  39392. (line 265)
  39393. * __bid_netd2: Decimal float library routines.
  39394. (line 269)
  39395. * __bid_subdd3: Decimal float library routines.
  39396. (line 37)
  39397. * __bid_subsd3: Decimal float library routines.
  39398. (line 33)
  39399. * __bid_subtd3: Decimal float library routines.
  39400. (line 41)
  39401. * __bid_truncdddf: Decimal float library routines.
  39402. (line 152)
  39403. * __bid_truncddsd2: Decimal float library routines.
  39404. (line 93)
  39405. * __bid_truncddsf: Decimal float library routines.
  39406. (line 123)
  39407. * __bid_truncdfsd: Decimal float library routines.
  39408. (line 110)
  39409. * __bid_truncsdsf: Decimal float library routines.
  39410. (line 150)
  39411. * __bid_trunctddd2: Decimal float library routines.
  39412. (line 97)
  39413. * __bid_trunctddf: Decimal float library routines.
  39414. (line 129)
  39415. * __bid_trunctdsd2: Decimal float library routines.
  39416. (line 95)
  39417. * __bid_trunctdsf: Decimal float library routines.
  39418. (line 125)
  39419. * __bid_trunctdtf: Decimal float library routines.
  39420. (line 154)
  39421. * __bid_trunctdxf: Decimal float library routines.
  39422. (line 135)
  39423. * __bid_trunctfdd: Decimal float library routines.
  39424. (line 118)
  39425. * __bid_trunctfsd: Decimal float library routines.
  39426. (line 114)
  39427. * __bid_truncxfdd: Decimal float library routines.
  39428. (line 116)
  39429. * __bid_truncxfsd: Decimal float library routines.
  39430. (line 112)
  39431. * __bid_unorddd2: Decimal float library routines.
  39432. (line 234)
  39433. * __bid_unordsd2: Decimal float library routines.
  39434. (line 232)
  39435. * __bid_unordtd2: Decimal float library routines.
  39436. (line 236)
  39437. * __bswapdi2: Integer library routines.
  39438. (line 161)
  39439. * __bswapsi2: Integer library routines.
  39440. (line 160)
  39441. * __builtin_classify_type: Varargs. (line 48)
  39442. * __builtin_next_arg: Varargs. (line 39)
  39443. * __builtin_saveregs: Varargs. (line 22)
  39444. * __clear_cache: Miscellaneous routines.
  39445. (line 9)
  39446. * __clzdi2: Integer library routines.
  39447. (line 130)
  39448. * __clzsi2: Integer library routines.
  39449. (line 129)
  39450. * __clzti2: Integer library routines.
  39451. (line 131)
  39452. * __cmpda2: Fixed-point fractional library routines.
  39453. (line 458)
  39454. * __cmpdf2: Soft float library routines.
  39455. (line 163)
  39456. * __cmpdi2: Integer library routines.
  39457. (line 86)
  39458. * __cmpdq2: Fixed-point fractional library routines.
  39459. (line 447)
  39460. * __cmpha2: Fixed-point fractional library routines.
  39461. (line 456)
  39462. * __cmphq2: Fixed-point fractional library routines.
  39463. (line 445)
  39464. * __cmpqq2: Fixed-point fractional library routines.
  39465. (line 444)
  39466. * __cmpsa2: Fixed-point fractional library routines.
  39467. (line 457)
  39468. * __cmpsf2: Soft float library routines.
  39469. (line 162)
  39470. * __cmpsq2: Fixed-point fractional library routines.
  39471. (line 446)
  39472. * __cmpta2: Fixed-point fractional library routines.
  39473. (line 459)
  39474. * __cmptf2: Soft float library routines.
  39475. (line 164)
  39476. * __cmpti2: Integer library routines.
  39477. (line 87)
  39478. * __cmpuda2: Fixed-point fractional library routines.
  39479. (line 464)
  39480. * __cmpudq2: Fixed-point fractional library routines.
  39481. (line 454)
  39482. * __cmpuha2: Fixed-point fractional library routines.
  39483. (line 461)
  39484. * __cmpuhq2: Fixed-point fractional library routines.
  39485. (line 451)
  39486. * __cmpuqq2: Fixed-point fractional library routines.
  39487. (line 449)
  39488. * __cmpusa2: Fixed-point fractional library routines.
  39489. (line 463)
  39490. * __cmpusq2: Fixed-point fractional library routines.
  39491. (line 452)
  39492. * __cmputa2: Fixed-point fractional library routines.
  39493. (line 466)
  39494. * __CTOR_LIST__: Initialization. (line 25)
  39495. * __ctzdi2: Integer library routines.
  39496. (line 137)
  39497. * __ctzsi2: Integer library routines.
  39498. (line 136)
  39499. * __ctzti2: Integer library routines.
  39500. (line 138)
  39501. * __divda3: Fixed-point fractional library routines.
  39502. (line 234)
  39503. * __divdc3: Soft float library routines.
  39504. (line 250)
  39505. * __divdf3: Soft float library routines.
  39506. (line 47)
  39507. * __divdi3: Integer library routines.
  39508. (line 24)
  39509. * __divdq3: Fixed-point fractional library routines.
  39510. (line 229)
  39511. * __divha3: Fixed-point fractional library routines.
  39512. (line 231)
  39513. * __divhq3: Fixed-point fractional library routines.
  39514. (line 227)
  39515. * __divqq3: Fixed-point fractional library routines.
  39516. (line 225)
  39517. * __divsa3: Fixed-point fractional library routines.
  39518. (line 233)
  39519. * __divsc3: Soft float library routines.
  39520. (line 248)
  39521. * __divsf3: Soft float library routines.
  39522. (line 46)
  39523. * __divsi3: Integer library routines.
  39524. (line 23)
  39525. * __divsq3: Fixed-point fractional library routines.
  39526. (line 228)
  39527. * __divta3: Fixed-point fractional library routines.
  39528. (line 235)
  39529. * __divtc3: Soft float library routines.
  39530. (line 252)
  39531. * __divtf3: Soft float library routines.
  39532. (line 48)
  39533. * __divti3: Integer library routines.
  39534. (line 25)
  39535. * __divxc3: Soft float library routines.
  39536. (line 254)
  39537. * __divxf3: Soft float library routines.
  39538. (line 50)
  39539. * __dpd_adddd3: Decimal float library routines.
  39540. (line 21)
  39541. * __dpd_addsd3: Decimal float library routines.
  39542. (line 17)
  39543. * __dpd_addtd3: Decimal float library routines.
  39544. (line 25)
  39545. * __dpd_divdd3: Decimal float library routines.
  39546. (line 64)
  39547. * __dpd_divsd3: Decimal float library routines.
  39548. (line 60)
  39549. * __dpd_divtd3: Decimal float library routines.
  39550. (line 68)
  39551. * __dpd_eqdd2: Decimal float library routines.
  39552. (line 257)
  39553. * __dpd_eqsd2: Decimal float library routines.
  39554. (line 255)
  39555. * __dpd_eqtd2: Decimal float library routines.
  39556. (line 259)
  39557. * __dpd_extendddtd2: Decimal float library routines.
  39558. (line 90)
  39559. * __dpd_extendddtf: Decimal float library routines.
  39560. (line 138)
  39561. * __dpd_extendddxf: Decimal float library routines.
  39562. (line 132)
  39563. * __dpd_extenddfdd: Decimal float library routines.
  39564. (line 145)
  39565. * __dpd_extenddftd: Decimal float library routines.
  39566. (line 105)
  39567. * __dpd_extendsddd2: Decimal float library routines.
  39568. (line 86)
  39569. * __dpd_extendsddf: Decimal float library routines.
  39570. (line 126)
  39571. * __dpd_extendsdtd2: Decimal float library routines.
  39572. (line 88)
  39573. * __dpd_extendsdtf: Decimal float library routines.
  39574. (line 136)
  39575. * __dpd_extendsdxf: Decimal float library routines.
  39576. (line 130)
  39577. * __dpd_extendsfdd: Decimal float library routines.
  39578. (line 101)
  39579. * __dpd_extendsfsd: Decimal float library routines.
  39580. (line 143)
  39581. * __dpd_extendsftd: Decimal float library routines.
  39582. (line 103)
  39583. * __dpd_extendtftd: Decimal float library routines.
  39584. (line 147)
  39585. * __dpd_extendxftd: Decimal float library routines.
  39586. (line 107)
  39587. * __dpd_fixdddi: Decimal float library routines.
  39588. (line 168)
  39589. * __dpd_fixddsi: Decimal float library routines.
  39590. (line 160)
  39591. * __dpd_fixsddi: Decimal float library routines.
  39592. (line 166)
  39593. * __dpd_fixsdsi: Decimal float library routines.
  39594. (line 158)
  39595. * __dpd_fixtddi: Decimal float library routines.
  39596. (line 170)
  39597. * __dpd_fixtdsi: Decimal float library routines.
  39598. (line 162)
  39599. * __dpd_fixunsdddi: Decimal float library routines.
  39600. (line 185)
  39601. * __dpd_fixunsddsi: Decimal float library routines.
  39602. (line 176)
  39603. * __dpd_fixunssddi: Decimal float library routines.
  39604. (line 183)
  39605. * __dpd_fixunssdsi: Decimal float library routines.
  39606. (line 174)
  39607. * __dpd_fixunstddi: Decimal float library routines.
  39608. (line 187)
  39609. * __dpd_fixunstdsi: Decimal float library routines.
  39610. (line 178)
  39611. * __dpd_floatdidd: Decimal float library routines.
  39612. (line 203)
  39613. * __dpd_floatdisd: Decimal float library routines.
  39614. (line 201)
  39615. * __dpd_floatditd: Decimal float library routines.
  39616. (line 205)
  39617. * __dpd_floatsidd: Decimal float library routines.
  39618. (line 194)
  39619. * __dpd_floatsisd: Decimal float library routines.
  39620. (line 192)
  39621. * __dpd_floatsitd: Decimal float library routines.
  39622. (line 196)
  39623. * __dpd_floatunsdidd: Decimal float library routines.
  39624. (line 221)
  39625. * __dpd_floatunsdisd: Decimal float library routines.
  39626. (line 219)
  39627. * __dpd_floatunsditd: Decimal float library routines.
  39628. (line 223)
  39629. * __dpd_floatunssidd: Decimal float library routines.
  39630. (line 212)
  39631. * __dpd_floatunssisd: Decimal float library routines.
  39632. (line 210)
  39633. * __dpd_floatunssitd: Decimal float library routines.
  39634. (line 214)
  39635. * __dpd_gedd2: Decimal float library routines.
  39636. (line 275)
  39637. * __dpd_gesd2: Decimal float library routines.
  39638. (line 273)
  39639. * __dpd_getd2: Decimal float library routines.
  39640. (line 277)
  39641. * __dpd_gtdd2: Decimal float library routines.
  39642. (line 302)
  39643. * __dpd_gtsd2: Decimal float library routines.
  39644. (line 300)
  39645. * __dpd_gttd2: Decimal float library routines.
  39646. (line 304)
  39647. * __dpd_ledd2: Decimal float library routines.
  39648. (line 293)
  39649. * __dpd_lesd2: Decimal float library routines.
  39650. (line 291)
  39651. * __dpd_letd2: Decimal float library routines.
  39652. (line 295)
  39653. * __dpd_ltdd2: Decimal float library routines.
  39654. (line 284)
  39655. * __dpd_ltsd2: Decimal float library routines.
  39656. (line 282)
  39657. * __dpd_lttd2: Decimal float library routines.
  39658. (line 286)
  39659. * __dpd_muldd3: Decimal float library routines.
  39660. (line 50)
  39661. * __dpd_mulsd3: Decimal float library routines.
  39662. (line 46)
  39663. * __dpd_multd3: Decimal float library routines.
  39664. (line 54)
  39665. * __dpd_nedd2: Decimal float library routines.
  39666. (line 266)
  39667. * __dpd_negdd2: Decimal float library routines.
  39668. (line 76)
  39669. * __dpd_negsd2: Decimal float library routines.
  39670. (line 74)
  39671. * __dpd_negtd2: Decimal float library routines.
  39672. (line 78)
  39673. * __dpd_nesd2: Decimal float library routines.
  39674. (line 264)
  39675. * __dpd_netd2: Decimal float library routines.
  39676. (line 268)
  39677. * __dpd_subdd3: Decimal float library routines.
  39678. (line 35)
  39679. * __dpd_subsd3: Decimal float library routines.
  39680. (line 31)
  39681. * __dpd_subtd3: Decimal float library routines.
  39682. (line 39)
  39683. * __dpd_truncdddf: Decimal float library routines.
  39684. (line 151)
  39685. * __dpd_truncddsd2: Decimal float library routines.
  39686. (line 92)
  39687. * __dpd_truncddsf: Decimal float library routines.
  39688. (line 122)
  39689. * __dpd_truncdfsd: Decimal float library routines.
  39690. (line 109)
  39691. * __dpd_truncsdsf: Decimal float library routines.
  39692. (line 149)
  39693. * __dpd_trunctddd2: Decimal float library routines.
  39694. (line 96)
  39695. * __dpd_trunctddf: Decimal float library routines.
  39696. (line 128)
  39697. * __dpd_trunctdsd2: Decimal float library routines.
  39698. (line 94)
  39699. * __dpd_trunctdsf: Decimal float library routines.
  39700. (line 124)
  39701. * __dpd_trunctdtf: Decimal float library routines.
  39702. (line 153)
  39703. * __dpd_trunctdxf: Decimal float library routines.
  39704. (line 134)
  39705. * __dpd_trunctfdd: Decimal float library routines.
  39706. (line 117)
  39707. * __dpd_trunctfsd: Decimal float library routines.
  39708. (line 113)
  39709. * __dpd_truncxfdd: Decimal float library routines.
  39710. (line 115)
  39711. * __dpd_truncxfsd: Decimal float library routines.
  39712. (line 111)
  39713. * __dpd_unorddd2: Decimal float library routines.
  39714. (line 233)
  39715. * __dpd_unordsd2: Decimal float library routines.
  39716. (line 231)
  39717. * __dpd_unordtd2: Decimal float library routines.
  39718. (line 235)
  39719. * __DTOR_LIST__: Initialization. (line 25)
  39720. * __eqdf2: Soft float library routines.
  39721. (line 193)
  39722. * __eqsf2: Soft float library routines.
  39723. (line 192)
  39724. * __eqtf2: Soft float library routines.
  39725. (line 194)
  39726. * __extenddftf2: Soft float library routines.
  39727. (line 67)
  39728. * __extenddfxf2: Soft float library routines.
  39729. (line 68)
  39730. * __extendsfdf2: Soft float library routines.
  39731. (line 64)
  39732. * __extendsftf2: Soft float library routines.
  39733. (line 65)
  39734. * __extendsfxf2: Soft float library routines.
  39735. (line 66)
  39736. * __ffsdi2: Integer library routines.
  39737. (line 143)
  39738. * __ffsti2: Integer library routines.
  39739. (line 144)
  39740. * __fixdfdi: Soft float library routines.
  39741. (line 87)
  39742. * __fixdfsi: Soft float library routines.
  39743. (line 80)
  39744. * __fixdfti: Soft float library routines.
  39745. (line 93)
  39746. * __fixsfdi: Soft float library routines.
  39747. (line 86)
  39748. * __fixsfsi: Soft float library routines.
  39749. (line 79)
  39750. * __fixsfti: Soft float library routines.
  39751. (line 92)
  39752. * __fixtfdi: Soft float library routines.
  39753. (line 88)
  39754. * __fixtfsi: Soft float library routines.
  39755. (line 81)
  39756. * __fixtfti: Soft float library routines.
  39757. (line 94)
  39758. * __fixunsdfdi: Soft float library routines.
  39759. (line 107)
  39760. * __fixunsdfsi: Soft float library routines.
  39761. (line 100)
  39762. * __fixunsdfti: Soft float library routines.
  39763. (line 114)
  39764. * __fixunssfdi: Soft float library routines.
  39765. (line 106)
  39766. * __fixunssfsi: Soft float library routines.
  39767. (line 99)
  39768. * __fixunssfti: Soft float library routines.
  39769. (line 113)
  39770. * __fixunstfdi: Soft float library routines.
  39771. (line 108)
  39772. * __fixunstfsi: Soft float library routines.
  39773. (line 101)
  39774. * __fixunstfti: Soft float library routines.
  39775. (line 115)
  39776. * __fixunsxfdi: Soft float library routines.
  39777. (line 109)
  39778. * __fixunsxfsi: Soft float library routines.
  39779. (line 102)
  39780. * __fixunsxfti: Soft float library routines.
  39781. (line 116)
  39782. * __fixxfdi: Soft float library routines.
  39783. (line 89)
  39784. * __fixxfsi: Soft float library routines.
  39785. (line 82)
  39786. * __fixxfti: Soft float library routines.
  39787. (line 95)
  39788. * __floatdidf: Soft float library routines.
  39789. (line 127)
  39790. * __floatdisf: Soft float library routines.
  39791. (line 126)
  39792. * __floatditf: Soft float library routines.
  39793. (line 128)
  39794. * __floatdixf: Soft float library routines.
  39795. (line 129)
  39796. * __floatsidf: Soft float library routines.
  39797. (line 121)
  39798. * __floatsisf: Soft float library routines.
  39799. (line 120)
  39800. * __floatsitf: Soft float library routines.
  39801. (line 122)
  39802. * __floatsixf: Soft float library routines.
  39803. (line 123)
  39804. * __floattidf: Soft float library routines.
  39805. (line 133)
  39806. * __floattisf: Soft float library routines.
  39807. (line 132)
  39808. * __floattitf: Soft float library routines.
  39809. (line 134)
  39810. * __floattixf: Soft float library routines.
  39811. (line 135)
  39812. * __floatundidf: Soft float library routines.
  39813. (line 145)
  39814. * __floatundisf: Soft float library routines.
  39815. (line 144)
  39816. * __floatunditf: Soft float library routines.
  39817. (line 146)
  39818. * __floatundixf: Soft float library routines.
  39819. (line 147)
  39820. * __floatunsidf: Soft float library routines.
  39821. (line 139)
  39822. * __floatunsisf: Soft float library routines.
  39823. (line 138)
  39824. * __floatunsitf: Soft float library routines.
  39825. (line 140)
  39826. * __floatunsixf: Soft float library routines.
  39827. (line 141)
  39828. * __floatuntidf: Soft float library routines.
  39829. (line 151)
  39830. * __floatuntisf: Soft float library routines.
  39831. (line 150)
  39832. * __floatuntitf: Soft float library routines.
  39833. (line 152)
  39834. * __floatuntixf: Soft float library routines.
  39835. (line 153)
  39836. * __fractdadf: Fixed-point fractional library routines.
  39837. (line 643)
  39838. * __fractdadi: Fixed-point fractional library routines.
  39839. (line 640)
  39840. * __fractdadq: Fixed-point fractional library routines.
  39841. (line 623)
  39842. * __fractdaha2: Fixed-point fractional library routines.
  39843. (line 624)
  39844. * __fractdahi: Fixed-point fractional library routines.
  39845. (line 638)
  39846. * __fractdahq: Fixed-point fractional library routines.
  39847. (line 621)
  39848. * __fractdaqi: Fixed-point fractional library routines.
  39849. (line 637)
  39850. * __fractdaqq: Fixed-point fractional library routines.
  39851. (line 620)
  39852. * __fractdasa2: Fixed-point fractional library routines.
  39853. (line 625)
  39854. * __fractdasf: Fixed-point fractional library routines.
  39855. (line 642)
  39856. * __fractdasi: Fixed-point fractional library routines.
  39857. (line 639)
  39858. * __fractdasq: Fixed-point fractional library routines.
  39859. (line 622)
  39860. * __fractdata2: Fixed-point fractional library routines.
  39861. (line 626)
  39862. * __fractdati: Fixed-point fractional library routines.
  39863. (line 641)
  39864. * __fractdauda: Fixed-point fractional library routines.
  39865. (line 634)
  39866. * __fractdaudq: Fixed-point fractional library routines.
  39867. (line 630)
  39868. * __fractdauha: Fixed-point fractional library routines.
  39869. (line 632)
  39870. * __fractdauhq: Fixed-point fractional library routines.
  39871. (line 628)
  39872. * __fractdauqq: Fixed-point fractional library routines.
  39873. (line 627)
  39874. * __fractdausa: Fixed-point fractional library routines.
  39875. (line 633)
  39876. * __fractdausq: Fixed-point fractional library routines.
  39877. (line 629)
  39878. * __fractdauta: Fixed-point fractional library routines.
  39879. (line 635)
  39880. * __fractdfda: Fixed-point fractional library routines.
  39881. (line 1032)
  39882. * __fractdfdq: Fixed-point fractional library routines.
  39883. (line 1029)
  39884. * __fractdfha: Fixed-point fractional library routines.
  39885. (line 1030)
  39886. * __fractdfhq: Fixed-point fractional library routines.
  39887. (line 1027)
  39888. * __fractdfqq: Fixed-point fractional library routines.
  39889. (line 1026)
  39890. * __fractdfsa: Fixed-point fractional library routines.
  39891. (line 1031)
  39892. * __fractdfsq: Fixed-point fractional library routines.
  39893. (line 1028)
  39894. * __fractdfta: Fixed-point fractional library routines.
  39895. (line 1033)
  39896. * __fractdfuda: Fixed-point fractional library routines.
  39897. (line 1040)
  39898. * __fractdfudq: Fixed-point fractional library routines.
  39899. (line 1037)
  39900. * __fractdfuha: Fixed-point fractional library routines.
  39901. (line 1038)
  39902. * __fractdfuhq: Fixed-point fractional library routines.
  39903. (line 1035)
  39904. * __fractdfuqq: Fixed-point fractional library routines.
  39905. (line 1034)
  39906. * __fractdfusa: Fixed-point fractional library routines.
  39907. (line 1039)
  39908. * __fractdfusq: Fixed-point fractional library routines.
  39909. (line 1036)
  39910. * __fractdfuta: Fixed-point fractional library routines.
  39911. (line 1041)
  39912. * __fractdida: Fixed-point fractional library routines.
  39913. (line 982)
  39914. * __fractdidq: Fixed-point fractional library routines.
  39915. (line 979)
  39916. * __fractdiha: Fixed-point fractional library routines.
  39917. (line 980)
  39918. * __fractdihq: Fixed-point fractional library routines.
  39919. (line 977)
  39920. * __fractdiqq: Fixed-point fractional library routines.
  39921. (line 976)
  39922. * __fractdisa: Fixed-point fractional library routines.
  39923. (line 981)
  39924. * __fractdisq: Fixed-point fractional library routines.
  39925. (line 978)
  39926. * __fractdita: Fixed-point fractional library routines.
  39927. (line 983)
  39928. * __fractdiuda: Fixed-point fractional library routines.
  39929. (line 990)
  39930. * __fractdiudq: Fixed-point fractional library routines.
  39931. (line 987)
  39932. * __fractdiuha: Fixed-point fractional library routines.
  39933. (line 988)
  39934. * __fractdiuhq: Fixed-point fractional library routines.
  39935. (line 985)
  39936. * __fractdiuqq: Fixed-point fractional library routines.
  39937. (line 984)
  39938. * __fractdiusa: Fixed-point fractional library routines.
  39939. (line 989)
  39940. * __fractdiusq: Fixed-point fractional library routines.
  39941. (line 986)
  39942. * __fractdiuta: Fixed-point fractional library routines.
  39943. (line 991)
  39944. * __fractdqda: Fixed-point fractional library routines.
  39945. (line 551)
  39946. * __fractdqdf: Fixed-point fractional library routines.
  39947. (line 573)
  39948. * __fractdqdi: Fixed-point fractional library routines.
  39949. (line 570)
  39950. * __fractdqha: Fixed-point fractional library routines.
  39951. (line 549)
  39952. * __fractdqhi: Fixed-point fractional library routines.
  39953. (line 568)
  39954. * __fractdqhq2: Fixed-point fractional library routines.
  39955. (line 547)
  39956. * __fractdqqi: Fixed-point fractional library routines.
  39957. (line 567)
  39958. * __fractdqqq2: Fixed-point fractional library routines.
  39959. (line 546)
  39960. * __fractdqsa: Fixed-point fractional library routines.
  39961. (line 550)
  39962. * __fractdqsf: Fixed-point fractional library routines.
  39963. (line 572)
  39964. * __fractdqsi: Fixed-point fractional library routines.
  39965. (line 569)
  39966. * __fractdqsq2: Fixed-point fractional library routines.
  39967. (line 548)
  39968. * __fractdqta: Fixed-point fractional library routines.
  39969. (line 552)
  39970. * __fractdqti: Fixed-point fractional library routines.
  39971. (line 571)
  39972. * __fractdquda: Fixed-point fractional library routines.
  39973. (line 563)
  39974. * __fractdqudq: Fixed-point fractional library routines.
  39975. (line 558)
  39976. * __fractdquha: Fixed-point fractional library routines.
  39977. (line 560)
  39978. * __fractdquhq: Fixed-point fractional library routines.
  39979. (line 555)
  39980. * __fractdquqq: Fixed-point fractional library routines.
  39981. (line 553)
  39982. * __fractdqusa: Fixed-point fractional library routines.
  39983. (line 562)
  39984. * __fractdqusq: Fixed-point fractional library routines.
  39985. (line 556)
  39986. * __fractdquta: Fixed-point fractional library routines.
  39987. (line 565)
  39988. * __fracthada2: Fixed-point fractional library routines.
  39989. (line 579)
  39990. * __fracthadf: Fixed-point fractional library routines.
  39991. (line 597)
  39992. * __fracthadi: Fixed-point fractional library routines.
  39993. (line 594)
  39994. * __fracthadq: Fixed-point fractional library routines.
  39995. (line 577)
  39996. * __fracthahi: Fixed-point fractional library routines.
  39997. (line 592)
  39998. * __fracthahq: Fixed-point fractional library routines.
  39999. (line 575)
  40000. * __fracthaqi: Fixed-point fractional library routines.
  40001. (line 591)
  40002. * __fracthaqq: Fixed-point fractional library routines.
  40003. (line 574)
  40004. * __fracthasa2: Fixed-point fractional library routines.
  40005. (line 578)
  40006. * __fracthasf: Fixed-point fractional library routines.
  40007. (line 596)
  40008. * __fracthasi: Fixed-point fractional library routines.
  40009. (line 593)
  40010. * __fracthasq: Fixed-point fractional library routines.
  40011. (line 576)
  40012. * __fracthata2: Fixed-point fractional library routines.
  40013. (line 580)
  40014. * __fracthati: Fixed-point fractional library routines.
  40015. (line 595)
  40016. * __fracthauda: Fixed-point fractional library routines.
  40017. (line 588)
  40018. * __fracthaudq: Fixed-point fractional library routines.
  40019. (line 584)
  40020. * __fracthauha: Fixed-point fractional library routines.
  40021. (line 586)
  40022. * __fracthauhq: Fixed-point fractional library routines.
  40023. (line 582)
  40024. * __fracthauqq: Fixed-point fractional library routines.
  40025. (line 581)
  40026. * __fracthausa: Fixed-point fractional library routines.
  40027. (line 587)
  40028. * __fracthausq: Fixed-point fractional library routines.
  40029. (line 583)
  40030. * __fracthauta: Fixed-point fractional library routines.
  40031. (line 589)
  40032. * __fracthida: Fixed-point fractional library routines.
  40033. (line 950)
  40034. * __fracthidq: Fixed-point fractional library routines.
  40035. (line 947)
  40036. * __fracthiha: Fixed-point fractional library routines.
  40037. (line 948)
  40038. * __fracthihq: Fixed-point fractional library routines.
  40039. (line 945)
  40040. * __fracthiqq: Fixed-point fractional library routines.
  40041. (line 944)
  40042. * __fracthisa: Fixed-point fractional library routines.
  40043. (line 949)
  40044. * __fracthisq: Fixed-point fractional library routines.
  40045. (line 946)
  40046. * __fracthita: Fixed-point fractional library routines.
  40047. (line 951)
  40048. * __fracthiuda: Fixed-point fractional library routines.
  40049. (line 958)
  40050. * __fracthiudq: Fixed-point fractional library routines.
  40051. (line 955)
  40052. * __fracthiuha: Fixed-point fractional library routines.
  40053. (line 956)
  40054. * __fracthiuhq: Fixed-point fractional library routines.
  40055. (line 953)
  40056. * __fracthiuqq: Fixed-point fractional library routines.
  40057. (line 952)
  40058. * __fracthiusa: Fixed-point fractional library routines.
  40059. (line 957)
  40060. * __fracthiusq: Fixed-point fractional library routines.
  40061. (line 954)
  40062. * __fracthiuta: Fixed-point fractional library routines.
  40063. (line 959)
  40064. * __fracthqda: Fixed-point fractional library routines.
  40065. (line 505)
  40066. * __fracthqdf: Fixed-point fractional library routines.
  40067. (line 521)
  40068. * __fracthqdi: Fixed-point fractional library routines.
  40069. (line 518)
  40070. * __fracthqdq2: Fixed-point fractional library routines.
  40071. (line 502)
  40072. * __fracthqha: Fixed-point fractional library routines.
  40073. (line 503)
  40074. * __fracthqhi: Fixed-point fractional library routines.
  40075. (line 516)
  40076. * __fracthqqi: Fixed-point fractional library routines.
  40077. (line 515)
  40078. * __fracthqqq2: Fixed-point fractional library routines.
  40079. (line 500)
  40080. * __fracthqsa: Fixed-point fractional library routines.
  40081. (line 504)
  40082. * __fracthqsf: Fixed-point fractional library routines.
  40083. (line 520)
  40084. * __fracthqsi: Fixed-point fractional library routines.
  40085. (line 517)
  40086. * __fracthqsq2: Fixed-point fractional library routines.
  40087. (line 501)
  40088. * __fracthqta: Fixed-point fractional library routines.
  40089. (line 506)
  40090. * __fracthqti: Fixed-point fractional library routines.
  40091. (line 519)
  40092. * __fracthquda: Fixed-point fractional library routines.
  40093. (line 513)
  40094. * __fracthqudq: Fixed-point fractional library routines.
  40095. (line 510)
  40096. * __fracthquha: Fixed-point fractional library routines.
  40097. (line 511)
  40098. * __fracthquhq: Fixed-point fractional library routines.
  40099. (line 508)
  40100. * __fracthquqq: Fixed-point fractional library routines.
  40101. (line 507)
  40102. * __fracthqusa: Fixed-point fractional library routines.
  40103. (line 512)
  40104. * __fracthqusq: Fixed-point fractional library routines.
  40105. (line 509)
  40106. * __fracthquta: Fixed-point fractional library routines.
  40107. (line 514)
  40108. * __fractqida: Fixed-point fractional library routines.
  40109. (line 932)
  40110. * __fractqidq: Fixed-point fractional library routines.
  40111. (line 929)
  40112. * __fractqiha: Fixed-point fractional library routines.
  40113. (line 930)
  40114. * __fractqihq: Fixed-point fractional library routines.
  40115. (line 927)
  40116. * __fractqiqq: Fixed-point fractional library routines.
  40117. (line 926)
  40118. * __fractqisa: Fixed-point fractional library routines.
  40119. (line 931)
  40120. * __fractqisq: Fixed-point fractional library routines.
  40121. (line 928)
  40122. * __fractqita: Fixed-point fractional library routines.
  40123. (line 933)
  40124. * __fractqiuda: Fixed-point fractional library routines.
  40125. (line 941)
  40126. * __fractqiudq: Fixed-point fractional library routines.
  40127. (line 937)
  40128. * __fractqiuha: Fixed-point fractional library routines.
  40129. (line 939)
  40130. * __fractqiuhq: Fixed-point fractional library routines.
  40131. (line 935)
  40132. * __fractqiuqq: Fixed-point fractional library routines.
  40133. (line 934)
  40134. * __fractqiusa: Fixed-point fractional library routines.
  40135. (line 940)
  40136. * __fractqiusq: Fixed-point fractional library routines.
  40137. (line 936)
  40138. * __fractqiuta: Fixed-point fractional library routines.
  40139. (line 942)
  40140. * __fractqqda: Fixed-point fractional library routines.
  40141. (line 481)
  40142. * __fractqqdf: Fixed-point fractional library routines.
  40143. (line 499)
  40144. * __fractqqdi: Fixed-point fractional library routines.
  40145. (line 496)
  40146. * __fractqqdq2: Fixed-point fractional library routines.
  40147. (line 478)
  40148. * __fractqqha: Fixed-point fractional library routines.
  40149. (line 479)
  40150. * __fractqqhi: Fixed-point fractional library routines.
  40151. (line 494)
  40152. * __fractqqhq2: Fixed-point fractional library routines.
  40153. (line 476)
  40154. * __fractqqqi: Fixed-point fractional library routines.
  40155. (line 493)
  40156. * __fractqqsa: Fixed-point fractional library routines.
  40157. (line 480)
  40158. * __fractqqsf: Fixed-point fractional library routines.
  40159. (line 498)
  40160. * __fractqqsi: Fixed-point fractional library routines.
  40161. (line 495)
  40162. * __fractqqsq2: Fixed-point fractional library routines.
  40163. (line 477)
  40164. * __fractqqta: Fixed-point fractional library routines.
  40165. (line 482)
  40166. * __fractqqti: Fixed-point fractional library routines.
  40167. (line 497)
  40168. * __fractqquda: Fixed-point fractional library routines.
  40169. (line 490)
  40170. * __fractqqudq: Fixed-point fractional library routines.
  40171. (line 486)
  40172. * __fractqquha: Fixed-point fractional library routines.
  40173. (line 488)
  40174. * __fractqquhq: Fixed-point fractional library routines.
  40175. (line 484)
  40176. * __fractqquqq: Fixed-point fractional library routines.
  40177. (line 483)
  40178. * __fractqqusa: Fixed-point fractional library routines.
  40179. (line 489)
  40180. * __fractqqusq: Fixed-point fractional library routines.
  40181. (line 485)
  40182. * __fractqquta: Fixed-point fractional library routines.
  40183. (line 491)
  40184. * __fractsada2: Fixed-point fractional library routines.
  40185. (line 603)
  40186. * __fractsadf: Fixed-point fractional library routines.
  40187. (line 619)
  40188. * __fractsadi: Fixed-point fractional library routines.
  40189. (line 616)
  40190. * __fractsadq: Fixed-point fractional library routines.
  40191. (line 601)
  40192. * __fractsaha2: Fixed-point fractional library routines.
  40193. (line 602)
  40194. * __fractsahi: Fixed-point fractional library routines.
  40195. (line 614)
  40196. * __fractsahq: Fixed-point fractional library routines.
  40197. (line 599)
  40198. * __fractsaqi: Fixed-point fractional library routines.
  40199. (line 613)
  40200. * __fractsaqq: Fixed-point fractional library routines.
  40201. (line 598)
  40202. * __fractsasf: Fixed-point fractional library routines.
  40203. (line 618)
  40204. * __fractsasi: Fixed-point fractional library routines.
  40205. (line 615)
  40206. * __fractsasq: Fixed-point fractional library routines.
  40207. (line 600)
  40208. * __fractsata2: Fixed-point fractional library routines.
  40209. (line 604)
  40210. * __fractsati: Fixed-point fractional library routines.
  40211. (line 617)
  40212. * __fractsauda: Fixed-point fractional library routines.
  40213. (line 611)
  40214. * __fractsaudq: Fixed-point fractional library routines.
  40215. (line 608)
  40216. * __fractsauha: Fixed-point fractional library routines.
  40217. (line 609)
  40218. * __fractsauhq: Fixed-point fractional library routines.
  40219. (line 606)
  40220. * __fractsauqq: Fixed-point fractional library routines.
  40221. (line 605)
  40222. * __fractsausa: Fixed-point fractional library routines.
  40223. (line 610)
  40224. * __fractsausq: Fixed-point fractional library routines.
  40225. (line 607)
  40226. * __fractsauta: Fixed-point fractional library routines.
  40227. (line 612)
  40228. * __fractsfda: Fixed-point fractional library routines.
  40229. (line 1016)
  40230. * __fractsfdq: Fixed-point fractional library routines.
  40231. (line 1013)
  40232. * __fractsfha: Fixed-point fractional library routines.
  40233. (line 1014)
  40234. * __fractsfhq: Fixed-point fractional library routines.
  40235. (line 1011)
  40236. * __fractsfqq: Fixed-point fractional library routines.
  40237. (line 1010)
  40238. * __fractsfsa: Fixed-point fractional library routines.
  40239. (line 1015)
  40240. * __fractsfsq: Fixed-point fractional library routines.
  40241. (line 1012)
  40242. * __fractsfta: Fixed-point fractional library routines.
  40243. (line 1017)
  40244. * __fractsfuda: Fixed-point fractional library routines.
  40245. (line 1024)
  40246. * __fractsfudq: Fixed-point fractional library routines.
  40247. (line 1021)
  40248. * __fractsfuha: Fixed-point fractional library routines.
  40249. (line 1022)
  40250. * __fractsfuhq: Fixed-point fractional library routines.
  40251. (line 1019)
  40252. * __fractsfuqq: Fixed-point fractional library routines.
  40253. (line 1018)
  40254. * __fractsfusa: Fixed-point fractional library routines.
  40255. (line 1023)
  40256. * __fractsfusq: Fixed-point fractional library routines.
  40257. (line 1020)
  40258. * __fractsfuta: Fixed-point fractional library routines.
  40259. (line 1025)
  40260. * __fractsida: Fixed-point fractional library routines.
  40261. (line 966)
  40262. * __fractsidq: Fixed-point fractional library routines.
  40263. (line 963)
  40264. * __fractsiha: Fixed-point fractional library routines.
  40265. (line 964)
  40266. * __fractsihq: Fixed-point fractional library routines.
  40267. (line 961)
  40268. * __fractsiqq: Fixed-point fractional library routines.
  40269. (line 960)
  40270. * __fractsisa: Fixed-point fractional library routines.
  40271. (line 965)
  40272. * __fractsisq: Fixed-point fractional library routines.
  40273. (line 962)
  40274. * __fractsita: Fixed-point fractional library routines.
  40275. (line 967)
  40276. * __fractsiuda: Fixed-point fractional library routines.
  40277. (line 974)
  40278. * __fractsiudq: Fixed-point fractional library routines.
  40279. (line 971)
  40280. * __fractsiuha: Fixed-point fractional library routines.
  40281. (line 972)
  40282. * __fractsiuhq: Fixed-point fractional library routines.
  40283. (line 969)
  40284. * __fractsiuqq: Fixed-point fractional library routines.
  40285. (line 968)
  40286. * __fractsiusa: Fixed-point fractional library routines.
  40287. (line 973)
  40288. * __fractsiusq: Fixed-point fractional library routines.
  40289. (line 970)
  40290. * __fractsiuta: Fixed-point fractional library routines.
  40291. (line 975)
  40292. * __fractsqda: Fixed-point fractional library routines.
  40293. (line 527)
  40294. * __fractsqdf: Fixed-point fractional library routines.
  40295. (line 545)
  40296. * __fractsqdi: Fixed-point fractional library routines.
  40297. (line 542)
  40298. * __fractsqdq2: Fixed-point fractional library routines.
  40299. (line 524)
  40300. * __fractsqha: Fixed-point fractional library routines.
  40301. (line 525)
  40302. * __fractsqhi: Fixed-point fractional library routines.
  40303. (line 540)
  40304. * __fractsqhq2: Fixed-point fractional library routines.
  40305. (line 523)
  40306. * __fractsqqi: Fixed-point fractional library routines.
  40307. (line 539)
  40308. * __fractsqqq2: Fixed-point fractional library routines.
  40309. (line 522)
  40310. * __fractsqsa: Fixed-point fractional library routines.
  40311. (line 526)
  40312. * __fractsqsf: Fixed-point fractional library routines.
  40313. (line 544)
  40314. * __fractsqsi: Fixed-point fractional library routines.
  40315. (line 541)
  40316. * __fractsqta: Fixed-point fractional library routines.
  40317. (line 528)
  40318. * __fractsqti: Fixed-point fractional library routines.
  40319. (line 543)
  40320. * __fractsquda: Fixed-point fractional library routines.
  40321. (line 536)
  40322. * __fractsqudq: Fixed-point fractional library routines.
  40323. (line 532)
  40324. * __fractsquha: Fixed-point fractional library routines.
  40325. (line 534)
  40326. * __fractsquhq: Fixed-point fractional library routines.
  40327. (line 530)
  40328. * __fractsquqq: Fixed-point fractional library routines.
  40329. (line 529)
  40330. * __fractsqusa: Fixed-point fractional library routines.
  40331. (line 535)
  40332. * __fractsqusq: Fixed-point fractional library routines.
  40333. (line 531)
  40334. * __fractsquta: Fixed-point fractional library routines.
  40335. (line 537)
  40336. * __fracttada2: Fixed-point fractional library routines.
  40337. (line 650)
  40338. * __fracttadf: Fixed-point fractional library routines.
  40339. (line 671)
  40340. * __fracttadi: Fixed-point fractional library routines.
  40341. (line 668)
  40342. * __fracttadq: Fixed-point fractional library routines.
  40343. (line 647)
  40344. * __fracttaha2: Fixed-point fractional library routines.
  40345. (line 648)
  40346. * __fracttahi: Fixed-point fractional library routines.
  40347. (line 666)
  40348. * __fracttahq: Fixed-point fractional library routines.
  40349. (line 645)
  40350. * __fracttaqi: Fixed-point fractional library routines.
  40351. (line 665)
  40352. * __fracttaqq: Fixed-point fractional library routines.
  40353. (line 644)
  40354. * __fracttasa2: Fixed-point fractional library routines.
  40355. (line 649)
  40356. * __fracttasf: Fixed-point fractional library routines.
  40357. (line 670)
  40358. * __fracttasi: Fixed-point fractional library routines.
  40359. (line 667)
  40360. * __fracttasq: Fixed-point fractional library routines.
  40361. (line 646)
  40362. * __fracttati: Fixed-point fractional library routines.
  40363. (line 669)
  40364. * __fracttauda: Fixed-point fractional library routines.
  40365. (line 661)
  40366. * __fracttaudq: Fixed-point fractional library routines.
  40367. (line 656)
  40368. * __fracttauha: Fixed-point fractional library routines.
  40369. (line 658)
  40370. * __fracttauhq: Fixed-point fractional library routines.
  40371. (line 653)
  40372. * __fracttauqq: Fixed-point fractional library routines.
  40373. (line 651)
  40374. * __fracttausa: Fixed-point fractional library routines.
  40375. (line 660)
  40376. * __fracttausq: Fixed-point fractional library routines.
  40377. (line 654)
  40378. * __fracttauta: Fixed-point fractional library routines.
  40379. (line 663)
  40380. * __fracttida: Fixed-point fractional library routines.
  40381. (line 998)
  40382. * __fracttidq: Fixed-point fractional library routines.
  40383. (line 995)
  40384. * __fracttiha: Fixed-point fractional library routines.
  40385. (line 996)
  40386. * __fracttihq: Fixed-point fractional library routines.
  40387. (line 993)
  40388. * __fracttiqq: Fixed-point fractional library routines.
  40389. (line 992)
  40390. * __fracttisa: Fixed-point fractional library routines.
  40391. (line 997)
  40392. * __fracttisq: Fixed-point fractional library routines.
  40393. (line 994)
  40394. * __fracttita: Fixed-point fractional library routines.
  40395. (line 999)
  40396. * __fracttiuda: Fixed-point fractional library routines.
  40397. (line 1007)
  40398. * __fracttiudq: Fixed-point fractional library routines.
  40399. (line 1003)
  40400. * __fracttiuha: Fixed-point fractional library routines.
  40401. (line 1005)
  40402. * __fracttiuhq: Fixed-point fractional library routines.
  40403. (line 1001)
  40404. * __fracttiuqq: Fixed-point fractional library routines.
  40405. (line 1000)
  40406. * __fracttiusa: Fixed-point fractional library routines.
  40407. (line 1006)
  40408. * __fracttiusq: Fixed-point fractional library routines.
  40409. (line 1002)
  40410. * __fracttiuta: Fixed-point fractional library routines.
  40411. (line 1008)
  40412. * __fractudada: Fixed-point fractional library routines.
  40413. (line 865)
  40414. * __fractudadf: Fixed-point fractional library routines.
  40415. (line 888)
  40416. * __fractudadi: Fixed-point fractional library routines.
  40417. (line 885)
  40418. * __fractudadq: Fixed-point fractional library routines.
  40419. (line 861)
  40420. * __fractudaha: Fixed-point fractional library routines.
  40421. (line 863)
  40422. * __fractudahi: Fixed-point fractional library routines.
  40423. (line 883)
  40424. * __fractudahq: Fixed-point fractional library routines.
  40425. (line 859)
  40426. * __fractudaqi: Fixed-point fractional library routines.
  40427. (line 882)
  40428. * __fractudaqq: Fixed-point fractional library routines.
  40429. (line 858)
  40430. * __fractudasa: Fixed-point fractional library routines.
  40431. (line 864)
  40432. * __fractudasf: Fixed-point fractional library routines.
  40433. (line 887)
  40434. * __fractudasi: Fixed-point fractional library routines.
  40435. (line 884)
  40436. * __fractudasq: Fixed-point fractional library routines.
  40437. (line 860)
  40438. * __fractudata: Fixed-point fractional library routines.
  40439. (line 866)
  40440. * __fractudati: Fixed-point fractional library routines.
  40441. (line 886)
  40442. * __fractudaudq: Fixed-point fractional library routines.
  40443. (line 874)
  40444. * __fractudauha2: Fixed-point fractional library routines.
  40445. (line 876)
  40446. * __fractudauhq: Fixed-point fractional library routines.
  40447. (line 870)
  40448. * __fractudauqq: Fixed-point fractional library routines.
  40449. (line 868)
  40450. * __fractudausa2: Fixed-point fractional library routines.
  40451. (line 878)
  40452. * __fractudausq: Fixed-point fractional library routines.
  40453. (line 872)
  40454. * __fractudauta2: Fixed-point fractional library routines.
  40455. (line 880)
  40456. * __fractudqda: Fixed-point fractional library routines.
  40457. (line 772)
  40458. * __fractudqdf: Fixed-point fractional library routines.
  40459. (line 798)
  40460. * __fractudqdi: Fixed-point fractional library routines.
  40461. (line 794)
  40462. * __fractudqdq: Fixed-point fractional library routines.
  40463. (line 767)
  40464. * __fractudqha: Fixed-point fractional library routines.
  40465. (line 769)
  40466. * __fractudqhi: Fixed-point fractional library routines.
  40467. (line 792)
  40468. * __fractudqhq: Fixed-point fractional library routines.
  40469. (line 764)
  40470. * __fractudqqi: Fixed-point fractional library routines.
  40471. (line 790)
  40472. * __fractudqqq: Fixed-point fractional library routines.
  40473. (line 762)
  40474. * __fractudqsa: Fixed-point fractional library routines.
  40475. (line 771)
  40476. * __fractudqsf: Fixed-point fractional library routines.
  40477. (line 797)
  40478. * __fractudqsi: Fixed-point fractional library routines.
  40479. (line 793)
  40480. * __fractudqsq: Fixed-point fractional library routines.
  40481. (line 765)
  40482. * __fractudqta: Fixed-point fractional library routines.
  40483. (line 774)
  40484. * __fractudqti: Fixed-point fractional library routines.
  40485. (line 795)
  40486. * __fractudquda: Fixed-point fractional library routines.
  40487. (line 786)
  40488. * __fractudquha: Fixed-point fractional library routines.
  40489. (line 782)
  40490. * __fractudquhq2: Fixed-point fractional library routines.
  40491. (line 778)
  40492. * __fractudquqq2: Fixed-point fractional library routines.
  40493. (line 776)
  40494. * __fractudqusa: Fixed-point fractional library routines.
  40495. (line 784)
  40496. * __fractudqusq2: Fixed-point fractional library routines.
  40497. (line 780)
  40498. * __fractudquta: Fixed-point fractional library routines.
  40499. (line 788)
  40500. * __fractuhada: Fixed-point fractional library routines.
  40501. (line 806)
  40502. * __fractuhadf: Fixed-point fractional library routines.
  40503. (line 829)
  40504. * __fractuhadi: Fixed-point fractional library routines.
  40505. (line 826)
  40506. * __fractuhadq: Fixed-point fractional library routines.
  40507. (line 802)
  40508. * __fractuhaha: Fixed-point fractional library routines.
  40509. (line 804)
  40510. * __fractuhahi: Fixed-point fractional library routines.
  40511. (line 824)
  40512. * __fractuhahq: Fixed-point fractional library routines.
  40513. (line 800)
  40514. * __fractuhaqi: Fixed-point fractional library routines.
  40515. (line 823)
  40516. * __fractuhaqq: Fixed-point fractional library routines.
  40517. (line 799)
  40518. * __fractuhasa: Fixed-point fractional library routines.
  40519. (line 805)
  40520. * __fractuhasf: Fixed-point fractional library routines.
  40521. (line 828)
  40522. * __fractuhasi: Fixed-point fractional library routines.
  40523. (line 825)
  40524. * __fractuhasq: Fixed-point fractional library routines.
  40525. (line 801)
  40526. * __fractuhata: Fixed-point fractional library routines.
  40527. (line 807)
  40528. * __fractuhati: Fixed-point fractional library routines.
  40529. (line 827)
  40530. * __fractuhauda2: Fixed-point fractional library routines.
  40531. (line 819)
  40532. * __fractuhaudq: Fixed-point fractional library routines.
  40533. (line 815)
  40534. * __fractuhauhq: Fixed-point fractional library routines.
  40535. (line 811)
  40536. * __fractuhauqq: Fixed-point fractional library routines.
  40537. (line 809)
  40538. * __fractuhausa2: Fixed-point fractional library routines.
  40539. (line 817)
  40540. * __fractuhausq: Fixed-point fractional library routines.
  40541. (line 813)
  40542. * __fractuhauta2: Fixed-point fractional library routines.
  40543. (line 821)
  40544. * __fractuhqda: Fixed-point fractional library routines.
  40545. (line 709)
  40546. * __fractuhqdf: Fixed-point fractional library routines.
  40547. (line 730)
  40548. * __fractuhqdi: Fixed-point fractional library routines.
  40549. (line 727)
  40550. * __fractuhqdq: Fixed-point fractional library routines.
  40551. (line 706)
  40552. * __fractuhqha: Fixed-point fractional library routines.
  40553. (line 707)
  40554. * __fractuhqhi: Fixed-point fractional library routines.
  40555. (line 725)
  40556. * __fractuhqhq: Fixed-point fractional library routines.
  40557. (line 704)
  40558. * __fractuhqqi: Fixed-point fractional library routines.
  40559. (line 724)
  40560. * __fractuhqqq: Fixed-point fractional library routines.
  40561. (line 703)
  40562. * __fractuhqsa: Fixed-point fractional library routines.
  40563. (line 708)
  40564. * __fractuhqsf: Fixed-point fractional library routines.
  40565. (line 729)
  40566. * __fractuhqsi: Fixed-point fractional library routines.
  40567. (line 726)
  40568. * __fractuhqsq: Fixed-point fractional library routines.
  40569. (line 705)
  40570. * __fractuhqta: Fixed-point fractional library routines.
  40571. (line 710)
  40572. * __fractuhqti: Fixed-point fractional library routines.
  40573. (line 728)
  40574. * __fractuhquda: Fixed-point fractional library routines.
  40575. (line 720)
  40576. * __fractuhqudq2: Fixed-point fractional library routines.
  40577. (line 715)
  40578. * __fractuhquha: Fixed-point fractional library routines.
  40579. (line 717)
  40580. * __fractuhquqq2: Fixed-point fractional library routines.
  40581. (line 711)
  40582. * __fractuhqusa: Fixed-point fractional library routines.
  40583. (line 719)
  40584. * __fractuhqusq2: Fixed-point fractional library routines.
  40585. (line 713)
  40586. * __fractuhquta: Fixed-point fractional library routines.
  40587. (line 722)
  40588. * __fractunsdadi: Fixed-point fractional library routines.
  40589. (line 1562)
  40590. * __fractunsdahi: Fixed-point fractional library routines.
  40591. (line 1560)
  40592. * __fractunsdaqi: Fixed-point fractional library routines.
  40593. (line 1559)
  40594. * __fractunsdasi: Fixed-point fractional library routines.
  40595. (line 1561)
  40596. * __fractunsdati: Fixed-point fractional library routines.
  40597. (line 1563)
  40598. * __fractunsdida: Fixed-point fractional library routines.
  40599. (line 1714)
  40600. * __fractunsdidq: Fixed-point fractional library routines.
  40601. (line 1711)
  40602. * __fractunsdiha: Fixed-point fractional library routines.
  40603. (line 1712)
  40604. * __fractunsdihq: Fixed-point fractional library routines.
  40605. (line 1709)
  40606. * __fractunsdiqq: Fixed-point fractional library routines.
  40607. (line 1708)
  40608. * __fractunsdisa: Fixed-point fractional library routines.
  40609. (line 1713)
  40610. * __fractunsdisq: Fixed-point fractional library routines.
  40611. (line 1710)
  40612. * __fractunsdita: Fixed-point fractional library routines.
  40613. (line 1715)
  40614. * __fractunsdiuda: Fixed-point fractional library routines.
  40615. (line 1726)
  40616. * __fractunsdiudq: Fixed-point fractional library routines.
  40617. (line 1721)
  40618. * __fractunsdiuha: Fixed-point fractional library routines.
  40619. (line 1723)
  40620. * __fractunsdiuhq: Fixed-point fractional library routines.
  40621. (line 1718)
  40622. * __fractunsdiuqq: Fixed-point fractional library routines.
  40623. (line 1716)
  40624. * __fractunsdiusa: Fixed-point fractional library routines.
  40625. (line 1725)
  40626. * __fractunsdiusq: Fixed-point fractional library routines.
  40627. (line 1719)
  40628. * __fractunsdiuta: Fixed-point fractional library routines.
  40629. (line 1728)
  40630. * __fractunsdqdi: Fixed-point fractional library routines.
  40631. (line 1546)
  40632. * __fractunsdqhi: Fixed-point fractional library routines.
  40633. (line 1544)
  40634. * __fractunsdqqi: Fixed-point fractional library routines.
  40635. (line 1543)
  40636. * __fractunsdqsi: Fixed-point fractional library routines.
  40637. (line 1545)
  40638. * __fractunsdqti: Fixed-point fractional library routines.
  40639. (line 1547)
  40640. * __fractunshadi: Fixed-point fractional library routines.
  40641. (line 1552)
  40642. * __fractunshahi: Fixed-point fractional library routines.
  40643. (line 1550)
  40644. * __fractunshaqi: Fixed-point fractional library routines.
  40645. (line 1549)
  40646. * __fractunshasi: Fixed-point fractional library routines.
  40647. (line 1551)
  40648. * __fractunshati: Fixed-point fractional library routines.
  40649. (line 1553)
  40650. * __fractunshida: Fixed-point fractional library routines.
  40651. (line 1670)
  40652. * __fractunshidq: Fixed-point fractional library routines.
  40653. (line 1667)
  40654. * __fractunshiha: Fixed-point fractional library routines.
  40655. (line 1668)
  40656. * __fractunshihq: Fixed-point fractional library routines.
  40657. (line 1665)
  40658. * __fractunshiqq: Fixed-point fractional library routines.
  40659. (line 1664)
  40660. * __fractunshisa: Fixed-point fractional library routines.
  40661. (line 1669)
  40662. * __fractunshisq: Fixed-point fractional library routines.
  40663. (line 1666)
  40664. * __fractunshita: Fixed-point fractional library routines.
  40665. (line 1671)
  40666. * __fractunshiuda: Fixed-point fractional library routines.
  40667. (line 1682)
  40668. * __fractunshiudq: Fixed-point fractional library routines.
  40669. (line 1677)
  40670. * __fractunshiuha: Fixed-point fractional library routines.
  40671. (line 1679)
  40672. * __fractunshiuhq: Fixed-point fractional library routines.
  40673. (line 1674)
  40674. * __fractunshiuqq: Fixed-point fractional library routines.
  40675. (line 1672)
  40676. * __fractunshiusa: Fixed-point fractional library routines.
  40677. (line 1681)
  40678. * __fractunshiusq: Fixed-point fractional library routines.
  40679. (line 1675)
  40680. * __fractunshiuta: Fixed-point fractional library routines.
  40681. (line 1684)
  40682. * __fractunshqdi: Fixed-point fractional library routines.
  40683. (line 1536)
  40684. * __fractunshqhi: Fixed-point fractional library routines.
  40685. (line 1534)
  40686. * __fractunshqqi: Fixed-point fractional library routines.
  40687. (line 1533)
  40688. * __fractunshqsi: Fixed-point fractional library routines.
  40689. (line 1535)
  40690. * __fractunshqti: Fixed-point fractional library routines.
  40691. (line 1537)
  40692. * __fractunsqida: Fixed-point fractional library routines.
  40693. (line 1648)
  40694. * __fractunsqidq: Fixed-point fractional library routines.
  40695. (line 1645)
  40696. * __fractunsqiha: Fixed-point fractional library routines.
  40697. (line 1646)
  40698. * __fractunsqihq: Fixed-point fractional library routines.
  40699. (line 1643)
  40700. * __fractunsqiqq: Fixed-point fractional library routines.
  40701. (line 1642)
  40702. * __fractunsqisa: Fixed-point fractional library routines.
  40703. (line 1647)
  40704. * __fractunsqisq: Fixed-point fractional library routines.
  40705. (line 1644)
  40706. * __fractunsqita: Fixed-point fractional library routines.
  40707. (line 1649)
  40708. * __fractunsqiuda: Fixed-point fractional library routines.
  40709. (line 1660)
  40710. * __fractunsqiudq: Fixed-point fractional library routines.
  40711. (line 1655)
  40712. * __fractunsqiuha: Fixed-point fractional library routines.
  40713. (line 1657)
  40714. * __fractunsqiuhq: Fixed-point fractional library routines.
  40715. (line 1652)
  40716. * __fractunsqiuqq: Fixed-point fractional library routines.
  40717. (line 1650)
  40718. * __fractunsqiusa: Fixed-point fractional library routines.
  40719. (line 1659)
  40720. * __fractunsqiusq: Fixed-point fractional library routines.
  40721. (line 1653)
  40722. * __fractunsqiuta: Fixed-point fractional library routines.
  40723. (line 1662)
  40724. * __fractunsqqdi: Fixed-point fractional library routines.
  40725. (line 1531)
  40726. * __fractunsqqhi: Fixed-point fractional library routines.
  40727. (line 1529)
  40728. * __fractunsqqqi: Fixed-point fractional library routines.
  40729. (line 1528)
  40730. * __fractunsqqsi: Fixed-point fractional library routines.
  40731. (line 1530)
  40732. * __fractunsqqti: Fixed-point fractional library routines.
  40733. (line 1532)
  40734. * __fractunssadi: Fixed-point fractional library routines.
  40735. (line 1557)
  40736. * __fractunssahi: Fixed-point fractional library routines.
  40737. (line 1555)
  40738. * __fractunssaqi: Fixed-point fractional library routines.
  40739. (line 1554)
  40740. * __fractunssasi: Fixed-point fractional library routines.
  40741. (line 1556)
  40742. * __fractunssati: Fixed-point fractional library routines.
  40743. (line 1558)
  40744. * __fractunssida: Fixed-point fractional library routines.
  40745. (line 1692)
  40746. * __fractunssidq: Fixed-point fractional library routines.
  40747. (line 1689)
  40748. * __fractunssiha: Fixed-point fractional library routines.
  40749. (line 1690)
  40750. * __fractunssihq: Fixed-point fractional library routines.
  40751. (line 1687)
  40752. * __fractunssiqq: Fixed-point fractional library routines.
  40753. (line 1686)
  40754. * __fractunssisa: Fixed-point fractional library routines.
  40755. (line 1691)
  40756. * __fractunssisq: Fixed-point fractional library routines.
  40757. (line 1688)
  40758. * __fractunssita: Fixed-point fractional library routines.
  40759. (line 1693)
  40760. * __fractunssiuda: Fixed-point fractional library routines.
  40761. (line 1704)
  40762. * __fractunssiudq: Fixed-point fractional library routines.
  40763. (line 1699)
  40764. * __fractunssiuha: Fixed-point fractional library routines.
  40765. (line 1701)
  40766. * __fractunssiuhq: Fixed-point fractional library routines.
  40767. (line 1696)
  40768. * __fractunssiuqq: Fixed-point fractional library routines.
  40769. (line 1694)
  40770. * __fractunssiusa: Fixed-point fractional library routines.
  40771. (line 1703)
  40772. * __fractunssiusq: Fixed-point fractional library routines.
  40773. (line 1697)
  40774. * __fractunssiuta: Fixed-point fractional library routines.
  40775. (line 1706)
  40776. * __fractunssqdi: Fixed-point fractional library routines.
  40777. (line 1541)
  40778. * __fractunssqhi: Fixed-point fractional library routines.
  40779. (line 1539)
  40780. * __fractunssqqi: Fixed-point fractional library routines.
  40781. (line 1538)
  40782. * __fractunssqsi: Fixed-point fractional library routines.
  40783. (line 1540)
  40784. * __fractunssqti: Fixed-point fractional library routines.
  40785. (line 1542)
  40786. * __fractunstadi: Fixed-point fractional library routines.
  40787. (line 1567)
  40788. * __fractunstahi: Fixed-point fractional library routines.
  40789. (line 1565)
  40790. * __fractunstaqi: Fixed-point fractional library routines.
  40791. (line 1564)
  40792. * __fractunstasi: Fixed-point fractional library routines.
  40793. (line 1566)
  40794. * __fractunstati: Fixed-point fractional library routines.
  40795. (line 1568)
  40796. * __fractunstida: Fixed-point fractional library routines.
  40797. (line 1737)
  40798. * __fractunstidq: Fixed-point fractional library routines.
  40799. (line 1733)
  40800. * __fractunstiha: Fixed-point fractional library routines.
  40801. (line 1735)
  40802. * __fractunstihq: Fixed-point fractional library routines.
  40803. (line 1731)
  40804. * __fractunstiqq: Fixed-point fractional library routines.
  40805. (line 1730)
  40806. * __fractunstisa: Fixed-point fractional library routines.
  40807. (line 1736)
  40808. * __fractunstisq: Fixed-point fractional library routines.
  40809. (line 1732)
  40810. * __fractunstita: Fixed-point fractional library routines.
  40811. (line 1738)
  40812. * __fractunstiuda: Fixed-point fractional library routines.
  40813. (line 1752)
  40814. * __fractunstiudq: Fixed-point fractional library routines.
  40815. (line 1746)
  40816. * __fractunstiuha: Fixed-point fractional library routines.
  40817. (line 1748)
  40818. * __fractunstiuhq: Fixed-point fractional library routines.
  40819. (line 1742)
  40820. * __fractunstiuqq: Fixed-point fractional library routines.
  40821. (line 1740)
  40822. * __fractunstiusa: Fixed-point fractional library routines.
  40823. (line 1750)
  40824. * __fractunstiusq: Fixed-point fractional library routines.
  40825. (line 1744)
  40826. * __fractunstiuta: Fixed-point fractional library routines.
  40827. (line 1754)
  40828. * __fractunsudadi: Fixed-point fractional library routines.
  40829. (line 1628)
  40830. * __fractunsudahi: Fixed-point fractional library routines.
  40831. (line 1624)
  40832. * __fractunsudaqi: Fixed-point fractional library routines.
  40833. (line 1622)
  40834. * __fractunsudasi: Fixed-point fractional library routines.
  40835. (line 1626)
  40836. * __fractunsudati: Fixed-point fractional library routines.
  40837. (line 1630)
  40838. * __fractunsudqdi: Fixed-point fractional library routines.
  40839. (line 1602)
  40840. * __fractunsudqhi: Fixed-point fractional library routines.
  40841. (line 1598)
  40842. * __fractunsudqqi: Fixed-point fractional library routines.
  40843. (line 1596)
  40844. * __fractunsudqsi: Fixed-point fractional library routines.
  40845. (line 1600)
  40846. * __fractunsudqti: Fixed-point fractional library routines.
  40847. (line 1604)
  40848. * __fractunsuhadi: Fixed-point fractional library routines.
  40849. (line 1612)
  40850. * __fractunsuhahi: Fixed-point fractional library routines.
  40851. (line 1608)
  40852. * __fractunsuhaqi: Fixed-point fractional library routines.
  40853. (line 1606)
  40854. * __fractunsuhasi: Fixed-point fractional library routines.
  40855. (line 1610)
  40856. * __fractunsuhati: Fixed-point fractional library routines.
  40857. (line 1614)
  40858. * __fractunsuhqdi: Fixed-point fractional library routines.
  40859. (line 1583)
  40860. * __fractunsuhqhi: Fixed-point fractional library routines.
  40861. (line 1581)
  40862. * __fractunsuhqqi: Fixed-point fractional library routines.
  40863. (line 1580)
  40864. * __fractunsuhqsi: Fixed-point fractional library routines.
  40865. (line 1582)
  40866. * __fractunsuhqti: Fixed-point fractional library routines.
  40867. (line 1584)
  40868. * __fractunsuqqdi: Fixed-point fractional library routines.
  40869. (line 1576)
  40870. * __fractunsuqqhi: Fixed-point fractional library routines.
  40871. (line 1572)
  40872. * __fractunsuqqqi: Fixed-point fractional library routines.
  40873. (line 1570)
  40874. * __fractunsuqqsi: Fixed-point fractional library routines.
  40875. (line 1574)
  40876. * __fractunsuqqti: Fixed-point fractional library routines.
  40877. (line 1578)
  40878. * __fractunsusadi: Fixed-point fractional library routines.
  40879. (line 1619)
  40880. * __fractunsusahi: Fixed-point fractional library routines.
  40881. (line 1617)
  40882. * __fractunsusaqi: Fixed-point fractional library routines.
  40883. (line 1616)
  40884. * __fractunsusasi: Fixed-point fractional library routines.
  40885. (line 1618)
  40886. * __fractunsusati: Fixed-point fractional library routines.
  40887. (line 1620)
  40888. * __fractunsusqdi: Fixed-point fractional library routines.
  40889. (line 1592)
  40890. * __fractunsusqhi: Fixed-point fractional library routines.
  40891. (line 1588)
  40892. * __fractunsusqqi: Fixed-point fractional library routines.
  40893. (line 1586)
  40894. * __fractunsusqsi: Fixed-point fractional library routines.
  40895. (line 1590)
  40896. * __fractunsusqti: Fixed-point fractional library routines.
  40897. (line 1594)
  40898. * __fractunsutadi: Fixed-point fractional library routines.
  40899. (line 1638)
  40900. * __fractunsutahi: Fixed-point fractional library routines.
  40901. (line 1634)
  40902. * __fractunsutaqi: Fixed-point fractional library routines.
  40903. (line 1632)
  40904. * __fractunsutasi: Fixed-point fractional library routines.
  40905. (line 1636)
  40906. * __fractunsutati: Fixed-point fractional library routines.
  40907. (line 1640)
  40908. * __fractuqqda: Fixed-point fractional library routines.
  40909. (line 679)
  40910. * __fractuqqdf: Fixed-point fractional library routines.
  40911. (line 702)
  40912. * __fractuqqdi: Fixed-point fractional library routines.
  40913. (line 699)
  40914. * __fractuqqdq: Fixed-point fractional library routines.
  40915. (line 675)
  40916. * __fractuqqha: Fixed-point fractional library routines.
  40917. (line 677)
  40918. * __fractuqqhi: Fixed-point fractional library routines.
  40919. (line 697)
  40920. * __fractuqqhq: Fixed-point fractional library routines.
  40921. (line 673)
  40922. * __fractuqqqi: Fixed-point fractional library routines.
  40923. (line 696)
  40924. * __fractuqqqq: Fixed-point fractional library routines.
  40925. (line 672)
  40926. * __fractuqqsa: Fixed-point fractional library routines.
  40927. (line 678)
  40928. * __fractuqqsf: Fixed-point fractional library routines.
  40929. (line 701)
  40930. * __fractuqqsi: Fixed-point fractional library routines.
  40931. (line 698)
  40932. * __fractuqqsq: Fixed-point fractional library routines.
  40933. (line 674)
  40934. * __fractuqqta: Fixed-point fractional library routines.
  40935. (line 680)
  40936. * __fractuqqti: Fixed-point fractional library routines.
  40937. (line 700)
  40938. * __fractuqquda: Fixed-point fractional library routines.
  40939. (line 692)
  40940. * __fractuqqudq2: Fixed-point fractional library routines.
  40941. (line 686)
  40942. * __fractuqquha: Fixed-point fractional library routines.
  40943. (line 688)
  40944. * __fractuqquhq2: Fixed-point fractional library routines.
  40945. (line 682)
  40946. * __fractuqqusa: Fixed-point fractional library routines.
  40947. (line 690)
  40948. * __fractuqqusq2: Fixed-point fractional library routines.
  40949. (line 684)
  40950. * __fractuqquta: Fixed-point fractional library routines.
  40951. (line 694)
  40952. * __fractusada: Fixed-point fractional library routines.
  40953. (line 836)
  40954. * __fractusadf: Fixed-point fractional library routines.
  40955. (line 857)
  40956. * __fractusadi: Fixed-point fractional library routines.
  40957. (line 854)
  40958. * __fractusadq: Fixed-point fractional library routines.
  40959. (line 833)
  40960. * __fractusaha: Fixed-point fractional library routines.
  40961. (line 834)
  40962. * __fractusahi: Fixed-point fractional library routines.
  40963. (line 852)
  40964. * __fractusahq: Fixed-point fractional library routines.
  40965. (line 831)
  40966. * __fractusaqi: Fixed-point fractional library routines.
  40967. (line 851)
  40968. * __fractusaqq: Fixed-point fractional library routines.
  40969. (line 830)
  40970. * __fractusasa: Fixed-point fractional library routines.
  40971. (line 835)
  40972. * __fractusasf: Fixed-point fractional library routines.
  40973. (line 856)
  40974. * __fractusasi: Fixed-point fractional library routines.
  40975. (line 853)
  40976. * __fractusasq: Fixed-point fractional library routines.
  40977. (line 832)
  40978. * __fractusata: Fixed-point fractional library routines.
  40979. (line 837)
  40980. * __fractusati: Fixed-point fractional library routines.
  40981. (line 855)
  40982. * __fractusauda2: Fixed-point fractional library routines.
  40983. (line 847)
  40984. * __fractusaudq: Fixed-point fractional library routines.
  40985. (line 843)
  40986. * __fractusauha2: Fixed-point fractional library routines.
  40987. (line 845)
  40988. * __fractusauhq: Fixed-point fractional library routines.
  40989. (line 840)
  40990. * __fractusauqq: Fixed-point fractional library routines.
  40991. (line 838)
  40992. * __fractusausq: Fixed-point fractional library routines.
  40993. (line 841)
  40994. * __fractusauta2: Fixed-point fractional library routines.
  40995. (line 849)
  40996. * __fractusqda: Fixed-point fractional library routines.
  40997. (line 738)
  40998. * __fractusqdf: Fixed-point fractional library routines.
  40999. (line 761)
  41000. * __fractusqdi: Fixed-point fractional library routines.
  41001. (line 758)
  41002. * __fractusqdq: Fixed-point fractional library routines.
  41003. (line 734)
  41004. * __fractusqha: Fixed-point fractional library routines.
  41005. (line 736)
  41006. * __fractusqhi: Fixed-point fractional library routines.
  41007. (line 756)
  41008. * __fractusqhq: Fixed-point fractional library routines.
  41009. (line 732)
  41010. * __fractusqqi: Fixed-point fractional library routines.
  41011. (line 755)
  41012. * __fractusqqq: Fixed-point fractional library routines.
  41013. (line 731)
  41014. * __fractusqsa: Fixed-point fractional library routines.
  41015. (line 737)
  41016. * __fractusqsf: Fixed-point fractional library routines.
  41017. (line 760)
  41018. * __fractusqsi: Fixed-point fractional library routines.
  41019. (line 757)
  41020. * __fractusqsq: Fixed-point fractional library routines.
  41021. (line 733)
  41022. * __fractusqta: Fixed-point fractional library routines.
  41023. (line 739)
  41024. * __fractusqti: Fixed-point fractional library routines.
  41025. (line 759)
  41026. * __fractusquda: Fixed-point fractional library routines.
  41027. (line 751)
  41028. * __fractusqudq2: Fixed-point fractional library routines.
  41029. (line 745)
  41030. * __fractusquha: Fixed-point fractional library routines.
  41031. (line 747)
  41032. * __fractusquhq2: Fixed-point fractional library routines.
  41033. (line 743)
  41034. * __fractusquqq2: Fixed-point fractional library routines.
  41035. (line 741)
  41036. * __fractusqusa: Fixed-point fractional library routines.
  41037. (line 749)
  41038. * __fractusquta: Fixed-point fractional library routines.
  41039. (line 753)
  41040. * __fractutada: Fixed-point fractional library routines.
  41041. (line 899)
  41042. * __fractutadf: Fixed-point fractional library routines.
  41043. (line 925)
  41044. * __fractutadi: Fixed-point fractional library routines.
  41045. (line 921)
  41046. * __fractutadq: Fixed-point fractional library routines.
  41047. (line 894)
  41048. * __fractutaha: Fixed-point fractional library routines.
  41049. (line 896)
  41050. * __fractutahi: Fixed-point fractional library routines.
  41051. (line 919)
  41052. * __fractutahq: Fixed-point fractional library routines.
  41053. (line 891)
  41054. * __fractutaqi: Fixed-point fractional library routines.
  41055. (line 917)
  41056. * __fractutaqq: Fixed-point fractional library routines.
  41057. (line 889)
  41058. * __fractutasa: Fixed-point fractional library routines.
  41059. (line 898)
  41060. * __fractutasf: Fixed-point fractional library routines.
  41061. (line 924)
  41062. * __fractutasi: Fixed-point fractional library routines.
  41063. (line 920)
  41064. * __fractutasq: Fixed-point fractional library routines.
  41065. (line 892)
  41066. * __fractutata: Fixed-point fractional library routines.
  41067. (line 901)
  41068. * __fractutati: Fixed-point fractional library routines.
  41069. (line 922)
  41070. * __fractutauda2: Fixed-point fractional library routines.
  41071. (line 915)
  41072. * __fractutaudq: Fixed-point fractional library routines.
  41073. (line 909)
  41074. * __fractutauha2: Fixed-point fractional library routines.
  41075. (line 911)
  41076. * __fractutauhq: Fixed-point fractional library routines.
  41077. (line 905)
  41078. * __fractutauqq: Fixed-point fractional library routines.
  41079. (line 903)
  41080. * __fractutausa2: Fixed-point fractional library routines.
  41081. (line 913)
  41082. * __fractutausq: Fixed-point fractional library routines.
  41083. (line 907)
  41084. * __gedf2: Soft float library routines.
  41085. (line 205)
  41086. * __gesf2: Soft float library routines.
  41087. (line 204)
  41088. * __getf2: Soft float library routines.
  41089. (line 206)
  41090. * __gtdf2: Soft float library routines.
  41091. (line 223)
  41092. * __gtsf2: Soft float library routines.
  41093. (line 222)
  41094. * __gttf2: Soft float library routines.
  41095. (line 224)
  41096. * __ledf2: Soft float library routines.
  41097. (line 217)
  41098. * __lesf2: Soft float library routines.
  41099. (line 216)
  41100. * __letf2: Soft float library routines.
  41101. (line 218)
  41102. * __lshrdi3: Integer library routines.
  41103. (line 30)
  41104. * __lshrsi3: Integer library routines.
  41105. (line 29)
  41106. * __lshrti3: Integer library routines.
  41107. (line 31)
  41108. * __lshruda3: Fixed-point fractional library routines.
  41109. (line 396)
  41110. * __lshrudq3: Fixed-point fractional library routines.
  41111. (line 390)
  41112. * __lshruha3: Fixed-point fractional library routines.
  41113. (line 392)
  41114. * __lshruhq3: Fixed-point fractional library routines.
  41115. (line 386)
  41116. * __lshruqq3: Fixed-point fractional library routines.
  41117. (line 384)
  41118. * __lshrusa3: Fixed-point fractional library routines.
  41119. (line 394)
  41120. * __lshrusq3: Fixed-point fractional library routines.
  41121. (line 388)
  41122. * __lshruta3: Fixed-point fractional library routines.
  41123. (line 398)
  41124. * __ltdf2: Soft float library routines.
  41125. (line 211)
  41126. * __ltsf2: Soft float library routines.
  41127. (line 210)
  41128. * __lttf2: Soft float library routines.
  41129. (line 212)
  41130. * __main: Collect2. (line 15)
  41131. * __moddi3: Integer library routines.
  41132. (line 36)
  41133. * __modsi3: Integer library routines.
  41134. (line 35)
  41135. * __modti3: Integer library routines.
  41136. (line 37)
  41137. * __morestack_current_segment: Miscellaneous routines.
  41138. (line 45)
  41139. * __morestack_initial_sp: Miscellaneous routines.
  41140. (line 46)
  41141. * __morestack_segments: Miscellaneous routines.
  41142. (line 44)
  41143. * __mulda3: Fixed-point fractional library routines.
  41144. (line 178)
  41145. * __muldc3: Soft float library routines.
  41146. (line 239)
  41147. * __muldf3: Soft float library routines.
  41148. (line 39)
  41149. * __muldi3: Integer library routines.
  41150. (line 42)
  41151. * __muldq3: Fixed-point fractional library routines.
  41152. (line 165)
  41153. * __mulha3: Fixed-point fractional library routines.
  41154. (line 175)
  41155. * __mulhq3: Fixed-point fractional library routines.
  41156. (line 163)
  41157. * __mulqq3: Fixed-point fractional library routines.
  41158. (line 161)
  41159. * __mulsa3: Fixed-point fractional library routines.
  41160. (line 177)
  41161. * __mulsc3: Soft float library routines.
  41162. (line 237)
  41163. * __mulsf3: Soft float library routines.
  41164. (line 38)
  41165. * __mulsi3: Integer library routines.
  41166. (line 41)
  41167. * __mulsq3: Fixed-point fractional library routines.
  41168. (line 164)
  41169. * __multa3: Fixed-point fractional library routines.
  41170. (line 179)
  41171. * __multc3: Soft float library routines.
  41172. (line 241)
  41173. * __multf3: Soft float library routines.
  41174. (line 40)
  41175. * __multi3: Integer library routines.
  41176. (line 43)
  41177. * __muluda3: Fixed-point fractional library routines.
  41178. (line 185)
  41179. * __muludq3: Fixed-point fractional library routines.
  41180. (line 173)
  41181. * __muluha3: Fixed-point fractional library routines.
  41182. (line 181)
  41183. * __muluhq3: Fixed-point fractional library routines.
  41184. (line 169)
  41185. * __muluqq3: Fixed-point fractional library routines.
  41186. (line 167)
  41187. * __mulusa3: Fixed-point fractional library routines.
  41188. (line 183)
  41189. * __mulusq3: Fixed-point fractional library routines.
  41190. (line 171)
  41191. * __muluta3: Fixed-point fractional library routines.
  41192. (line 187)
  41193. * __mulvdi3: Integer library routines.
  41194. (line 114)
  41195. * __mulvsi3: Integer library routines.
  41196. (line 113)
  41197. * __mulxc3: Soft float library routines.
  41198. (line 243)
  41199. * __mulxf3: Soft float library routines.
  41200. (line 42)
  41201. * __nedf2: Soft float library routines.
  41202. (line 199)
  41203. * __negda2: Fixed-point fractional library routines.
  41204. (line 306)
  41205. * __negdf2: Soft float library routines.
  41206. (line 55)
  41207. * __negdi2: Integer library routines.
  41208. (line 46)
  41209. * __negdq2: Fixed-point fractional library routines.
  41210. (line 296)
  41211. * __negha2: Fixed-point fractional library routines.
  41212. (line 304)
  41213. * __neghq2: Fixed-point fractional library routines.
  41214. (line 294)
  41215. * __negqq2: Fixed-point fractional library routines.
  41216. (line 293)
  41217. * __negsa2: Fixed-point fractional library routines.
  41218. (line 305)
  41219. * __negsf2: Soft float library routines.
  41220. (line 54)
  41221. * __negsq2: Fixed-point fractional library routines.
  41222. (line 295)
  41223. * __negta2: Fixed-point fractional library routines.
  41224. (line 307)
  41225. * __negtf2: Soft float library routines.
  41226. (line 56)
  41227. * __negti2: Integer library routines.
  41228. (line 47)
  41229. * __neguda2: Fixed-point fractional library routines.
  41230. (line 311)
  41231. * __negudq2: Fixed-point fractional library routines.
  41232. (line 302)
  41233. * __neguha2: Fixed-point fractional library routines.
  41234. (line 308)
  41235. * __neguhq2: Fixed-point fractional library routines.
  41236. (line 299)
  41237. * __neguqq2: Fixed-point fractional library routines.
  41238. (line 297)
  41239. * __negusa2: Fixed-point fractional library routines.
  41240. (line 310)
  41241. * __negusq2: Fixed-point fractional library routines.
  41242. (line 300)
  41243. * __neguta2: Fixed-point fractional library routines.
  41244. (line 313)
  41245. * __negvdi2: Integer library routines.
  41246. (line 118)
  41247. * __negvsi2: Integer library routines.
  41248. (line 117)
  41249. * __negxf2: Soft float library routines.
  41250. (line 57)
  41251. * __nesf2: Soft float library routines.
  41252. (line 198)
  41253. * __netf2: Soft float library routines.
  41254. (line 200)
  41255. * __paritydi2: Integer library routines.
  41256. (line 150)
  41257. * __paritysi2: Integer library routines.
  41258. (line 149)
  41259. * __parityti2: Integer library routines.
  41260. (line 151)
  41261. * __popcountdi2: Integer library routines.
  41262. (line 156)
  41263. * __popcountsi2: Integer library routines.
  41264. (line 155)
  41265. * __popcountti2: Integer library routines.
  41266. (line 157)
  41267. * __powidf2: Soft float library routines.
  41268. (line 232)
  41269. * __powisf2: Soft float library routines.
  41270. (line 231)
  41271. * __powitf2: Soft float library routines.
  41272. (line 233)
  41273. * __powixf2: Soft float library routines.
  41274. (line 234)
  41275. * __satfractdadq: Fixed-point fractional library routines.
  41276. (line 1160)
  41277. * __satfractdaha2: Fixed-point fractional library routines.
  41278. (line 1161)
  41279. * __satfractdahq: Fixed-point fractional library routines.
  41280. (line 1158)
  41281. * __satfractdaqq: Fixed-point fractional library routines.
  41282. (line 1157)
  41283. * __satfractdasa2: Fixed-point fractional library routines.
  41284. (line 1162)
  41285. * __satfractdasq: Fixed-point fractional library routines.
  41286. (line 1159)
  41287. * __satfractdata2: Fixed-point fractional library routines.
  41288. (line 1163)
  41289. * __satfractdauda: Fixed-point fractional library routines.
  41290. (line 1173)
  41291. * __satfractdaudq: Fixed-point fractional library routines.
  41292. (line 1168)
  41293. * __satfractdauha: Fixed-point fractional library routines.
  41294. (line 1170)
  41295. * __satfractdauhq: Fixed-point fractional library routines.
  41296. (line 1166)
  41297. * __satfractdauqq: Fixed-point fractional library routines.
  41298. (line 1164)
  41299. * __satfractdausa: Fixed-point fractional library routines.
  41300. (line 1172)
  41301. * __satfractdausq: Fixed-point fractional library routines.
  41302. (line 1167)
  41303. * __satfractdauta: Fixed-point fractional library routines.
  41304. (line 1174)
  41305. * __satfractdfda: Fixed-point fractional library routines.
  41306. (line 1513)
  41307. * __satfractdfdq: Fixed-point fractional library routines.
  41308. (line 1510)
  41309. * __satfractdfha: Fixed-point fractional library routines.
  41310. (line 1511)
  41311. * __satfractdfhq: Fixed-point fractional library routines.
  41312. (line 1508)
  41313. * __satfractdfqq: Fixed-point fractional library routines.
  41314. (line 1507)
  41315. * __satfractdfsa: Fixed-point fractional library routines.
  41316. (line 1512)
  41317. * __satfractdfsq: Fixed-point fractional library routines.
  41318. (line 1509)
  41319. * __satfractdfta: Fixed-point fractional library routines.
  41320. (line 1514)
  41321. * __satfractdfuda: Fixed-point fractional library routines.
  41322. (line 1522)
  41323. * __satfractdfudq: Fixed-point fractional library routines.
  41324. (line 1518)
  41325. * __satfractdfuha: Fixed-point fractional library routines.
  41326. (line 1520)
  41327. * __satfractdfuhq: Fixed-point fractional library routines.
  41328. (line 1516)
  41329. * __satfractdfuqq: Fixed-point fractional library routines.
  41330. (line 1515)
  41331. * __satfractdfusa: Fixed-point fractional library routines.
  41332. (line 1521)
  41333. * __satfractdfusq: Fixed-point fractional library routines.
  41334. (line 1517)
  41335. * __satfractdfuta: Fixed-point fractional library routines.
  41336. (line 1523)
  41337. * __satfractdida: Fixed-point fractional library routines.
  41338. (line 1463)
  41339. * __satfractdidq: Fixed-point fractional library routines.
  41340. (line 1460)
  41341. * __satfractdiha: Fixed-point fractional library routines.
  41342. (line 1461)
  41343. * __satfractdihq: Fixed-point fractional library routines.
  41344. (line 1458)
  41345. * __satfractdiqq: Fixed-point fractional library routines.
  41346. (line 1457)
  41347. * __satfractdisa: Fixed-point fractional library routines.
  41348. (line 1462)
  41349. * __satfractdisq: Fixed-point fractional library routines.
  41350. (line 1459)
  41351. * __satfractdita: Fixed-point fractional library routines.
  41352. (line 1464)
  41353. * __satfractdiuda: Fixed-point fractional library routines.
  41354. (line 1471)
  41355. * __satfractdiudq: Fixed-point fractional library routines.
  41356. (line 1468)
  41357. * __satfractdiuha: Fixed-point fractional library routines.
  41358. (line 1469)
  41359. * __satfractdiuhq: Fixed-point fractional library routines.
  41360. (line 1466)
  41361. * __satfractdiuqq: Fixed-point fractional library routines.
  41362. (line 1465)
  41363. * __satfractdiusa: Fixed-point fractional library routines.
  41364. (line 1470)
  41365. * __satfractdiusq: Fixed-point fractional library routines.
  41366. (line 1467)
  41367. * __satfractdiuta: Fixed-point fractional library routines.
  41368. (line 1472)
  41369. * __satfractdqda: Fixed-point fractional library routines.
  41370. (line 1105)
  41371. * __satfractdqha: Fixed-point fractional library routines.
  41372. (line 1103)
  41373. * __satfractdqhq2: Fixed-point fractional library routines.
  41374. (line 1101)
  41375. * __satfractdqqq2: Fixed-point fractional library routines.
  41376. (line 1100)
  41377. * __satfractdqsa: Fixed-point fractional library routines.
  41378. (line 1104)
  41379. * __satfractdqsq2: Fixed-point fractional library routines.
  41380. (line 1102)
  41381. * __satfractdqta: Fixed-point fractional library routines.
  41382. (line 1106)
  41383. * __satfractdquda: Fixed-point fractional library routines.
  41384. (line 1117)
  41385. * __satfractdqudq: Fixed-point fractional library routines.
  41386. (line 1112)
  41387. * __satfractdquha: Fixed-point fractional library routines.
  41388. (line 1114)
  41389. * __satfractdquhq: Fixed-point fractional library routines.
  41390. (line 1109)
  41391. * __satfractdquqq: Fixed-point fractional library routines.
  41392. (line 1107)
  41393. * __satfractdqusa: Fixed-point fractional library routines.
  41394. (line 1116)
  41395. * __satfractdqusq: Fixed-point fractional library routines.
  41396. (line 1110)
  41397. * __satfractdquta: Fixed-point fractional library routines.
  41398. (line 1119)
  41399. * __satfracthada2: Fixed-point fractional library routines.
  41400. (line 1126)
  41401. * __satfracthadq: Fixed-point fractional library routines.
  41402. (line 1124)
  41403. * __satfracthahq: Fixed-point fractional library routines.
  41404. (line 1122)
  41405. * __satfracthaqq: Fixed-point fractional library routines.
  41406. (line 1121)
  41407. * __satfracthasa2: Fixed-point fractional library routines.
  41408. (line 1125)
  41409. * __satfracthasq: Fixed-point fractional library routines.
  41410. (line 1123)
  41411. * __satfracthata2: Fixed-point fractional library routines.
  41412. (line 1127)
  41413. * __satfracthauda: Fixed-point fractional library routines.
  41414. (line 1138)
  41415. * __satfracthaudq: Fixed-point fractional library routines.
  41416. (line 1133)
  41417. * __satfracthauha: Fixed-point fractional library routines.
  41418. (line 1135)
  41419. * __satfracthauhq: Fixed-point fractional library routines.
  41420. (line 1130)
  41421. * __satfracthauqq: Fixed-point fractional library routines.
  41422. (line 1128)
  41423. * __satfracthausa: Fixed-point fractional library routines.
  41424. (line 1137)
  41425. * __satfracthausq: Fixed-point fractional library routines.
  41426. (line 1131)
  41427. * __satfracthauta: Fixed-point fractional library routines.
  41428. (line 1140)
  41429. * __satfracthida: Fixed-point fractional library routines.
  41430. (line 1431)
  41431. * __satfracthidq: Fixed-point fractional library routines.
  41432. (line 1428)
  41433. * __satfracthiha: Fixed-point fractional library routines.
  41434. (line 1429)
  41435. * __satfracthihq: Fixed-point fractional library routines.
  41436. (line 1426)
  41437. * __satfracthiqq: Fixed-point fractional library routines.
  41438. (line 1425)
  41439. * __satfracthisa: Fixed-point fractional library routines.
  41440. (line 1430)
  41441. * __satfracthisq: Fixed-point fractional library routines.
  41442. (line 1427)
  41443. * __satfracthita: Fixed-point fractional library routines.
  41444. (line 1432)
  41445. * __satfracthiuda: Fixed-point fractional library routines.
  41446. (line 1439)
  41447. * __satfracthiudq: Fixed-point fractional library routines.
  41448. (line 1436)
  41449. * __satfracthiuha: Fixed-point fractional library routines.
  41450. (line 1437)
  41451. * __satfracthiuhq: Fixed-point fractional library routines.
  41452. (line 1434)
  41453. * __satfracthiuqq: Fixed-point fractional library routines.
  41454. (line 1433)
  41455. * __satfracthiusa: Fixed-point fractional library routines.
  41456. (line 1438)
  41457. * __satfracthiusq: Fixed-point fractional library routines.
  41458. (line 1435)
  41459. * __satfracthiuta: Fixed-point fractional library routines.
  41460. (line 1440)
  41461. * __satfracthqda: Fixed-point fractional library routines.
  41462. (line 1071)
  41463. * __satfracthqdq2: Fixed-point fractional library routines.
  41464. (line 1068)
  41465. * __satfracthqha: Fixed-point fractional library routines.
  41466. (line 1069)
  41467. * __satfracthqqq2: Fixed-point fractional library routines.
  41468. (line 1066)
  41469. * __satfracthqsa: Fixed-point fractional library routines.
  41470. (line 1070)
  41471. * __satfracthqsq2: Fixed-point fractional library routines.
  41472. (line 1067)
  41473. * __satfracthqta: Fixed-point fractional library routines.
  41474. (line 1072)
  41475. * __satfracthquda: Fixed-point fractional library routines.
  41476. (line 1079)
  41477. * __satfracthqudq: Fixed-point fractional library routines.
  41478. (line 1076)
  41479. * __satfracthquha: Fixed-point fractional library routines.
  41480. (line 1077)
  41481. * __satfracthquhq: Fixed-point fractional library routines.
  41482. (line 1074)
  41483. * __satfracthquqq: Fixed-point fractional library routines.
  41484. (line 1073)
  41485. * __satfracthqusa: Fixed-point fractional library routines.
  41486. (line 1078)
  41487. * __satfracthqusq: Fixed-point fractional library routines.
  41488. (line 1075)
  41489. * __satfracthquta: Fixed-point fractional library routines.
  41490. (line 1080)
  41491. * __satfractqida: Fixed-point fractional library routines.
  41492. (line 1409)
  41493. * __satfractqidq: Fixed-point fractional library routines.
  41494. (line 1406)
  41495. * __satfractqiha: Fixed-point fractional library routines.
  41496. (line 1407)
  41497. * __satfractqihq: Fixed-point fractional library routines.
  41498. (line 1404)
  41499. * __satfractqiqq: Fixed-point fractional library routines.
  41500. (line 1403)
  41501. * __satfractqisa: Fixed-point fractional library routines.
  41502. (line 1408)
  41503. * __satfractqisq: Fixed-point fractional library routines.
  41504. (line 1405)
  41505. * __satfractqita: Fixed-point fractional library routines.
  41506. (line 1410)
  41507. * __satfractqiuda: Fixed-point fractional library routines.
  41508. (line 1421)
  41509. * __satfractqiudq: Fixed-point fractional library routines.
  41510. (line 1416)
  41511. * __satfractqiuha: Fixed-point fractional library routines.
  41512. (line 1418)
  41513. * __satfractqiuhq: Fixed-point fractional library routines.
  41514. (line 1413)
  41515. * __satfractqiuqq: Fixed-point fractional library routines.
  41516. (line 1411)
  41517. * __satfractqiusa: Fixed-point fractional library routines.
  41518. (line 1420)
  41519. * __satfractqiusq: Fixed-point fractional library routines.
  41520. (line 1414)
  41521. * __satfractqiuta: Fixed-point fractional library routines.
  41522. (line 1423)
  41523. * __satfractqqda: Fixed-point fractional library routines.
  41524. (line 1050)
  41525. * __satfractqqdq2: Fixed-point fractional library routines.
  41526. (line 1047)
  41527. * __satfractqqha: Fixed-point fractional library routines.
  41528. (line 1048)
  41529. * __satfractqqhq2: Fixed-point fractional library routines.
  41530. (line 1045)
  41531. * __satfractqqsa: Fixed-point fractional library routines.
  41532. (line 1049)
  41533. * __satfractqqsq2: Fixed-point fractional library routines.
  41534. (line 1046)
  41535. * __satfractqqta: Fixed-point fractional library routines.
  41536. (line 1051)
  41537. * __satfractqquda: Fixed-point fractional library routines.
  41538. (line 1062)
  41539. * __satfractqqudq: Fixed-point fractional library routines.
  41540. (line 1057)
  41541. * __satfractqquha: Fixed-point fractional library routines.
  41542. (line 1059)
  41543. * __satfractqquhq: Fixed-point fractional library routines.
  41544. (line 1054)
  41545. * __satfractqquqq: Fixed-point fractional library routines.
  41546. (line 1052)
  41547. * __satfractqqusa: Fixed-point fractional library routines.
  41548. (line 1061)
  41549. * __satfractqqusq: Fixed-point fractional library routines.
  41550. (line 1055)
  41551. * __satfractqquta: Fixed-point fractional library routines.
  41552. (line 1064)
  41553. * __satfractsada2: Fixed-point fractional library routines.
  41554. (line 1147)
  41555. * __satfractsadq: Fixed-point fractional library routines.
  41556. (line 1145)
  41557. * __satfractsaha2: Fixed-point fractional library routines.
  41558. (line 1146)
  41559. * __satfractsahq: Fixed-point fractional library routines.
  41560. (line 1143)
  41561. * __satfractsaqq: Fixed-point fractional library routines.
  41562. (line 1142)
  41563. * __satfractsasq: Fixed-point fractional library routines.
  41564. (line 1144)
  41565. * __satfractsata2: Fixed-point fractional library routines.
  41566. (line 1148)
  41567. * __satfractsauda: Fixed-point fractional library routines.
  41568. (line 1155)
  41569. * __satfractsaudq: Fixed-point fractional library routines.
  41570. (line 1152)
  41571. * __satfractsauha: Fixed-point fractional library routines.
  41572. (line 1153)
  41573. * __satfractsauhq: Fixed-point fractional library routines.
  41574. (line 1150)
  41575. * __satfractsauqq: Fixed-point fractional library routines.
  41576. (line 1149)
  41577. * __satfractsausa: Fixed-point fractional library routines.
  41578. (line 1154)
  41579. * __satfractsausq: Fixed-point fractional library routines.
  41580. (line 1151)
  41581. * __satfractsauta: Fixed-point fractional library routines.
  41582. (line 1156)
  41583. * __satfractsfda: Fixed-point fractional library routines.
  41584. (line 1497)
  41585. * __satfractsfdq: Fixed-point fractional library routines.
  41586. (line 1494)
  41587. * __satfractsfha: Fixed-point fractional library routines.
  41588. (line 1495)
  41589. * __satfractsfhq: Fixed-point fractional library routines.
  41590. (line 1492)
  41591. * __satfractsfqq: Fixed-point fractional library routines.
  41592. (line 1491)
  41593. * __satfractsfsa: Fixed-point fractional library routines.
  41594. (line 1496)
  41595. * __satfractsfsq: Fixed-point fractional library routines.
  41596. (line 1493)
  41597. * __satfractsfta: Fixed-point fractional library routines.
  41598. (line 1498)
  41599. * __satfractsfuda: Fixed-point fractional library routines.
  41600. (line 1505)
  41601. * __satfractsfudq: Fixed-point fractional library routines.
  41602. (line 1502)
  41603. * __satfractsfuha: Fixed-point fractional library routines.
  41604. (line 1503)
  41605. * __satfractsfuhq: Fixed-point fractional library routines.
  41606. (line 1500)
  41607. * __satfractsfuqq: Fixed-point fractional library routines.
  41608. (line 1499)
  41609. * __satfractsfusa: Fixed-point fractional library routines.
  41610. (line 1504)
  41611. * __satfractsfusq: Fixed-point fractional library routines.
  41612. (line 1501)
  41613. * __satfractsfuta: Fixed-point fractional library routines.
  41614. (line 1506)
  41615. * __satfractsida: Fixed-point fractional library routines.
  41616. (line 1447)
  41617. * __satfractsidq: Fixed-point fractional library routines.
  41618. (line 1444)
  41619. * __satfractsiha: Fixed-point fractional library routines.
  41620. (line 1445)
  41621. * __satfractsihq: Fixed-point fractional library routines.
  41622. (line 1442)
  41623. * __satfractsiqq: Fixed-point fractional library routines.
  41624. (line 1441)
  41625. * __satfractsisa: Fixed-point fractional library routines.
  41626. (line 1446)
  41627. * __satfractsisq: Fixed-point fractional library routines.
  41628. (line 1443)
  41629. * __satfractsita: Fixed-point fractional library routines.
  41630. (line 1448)
  41631. * __satfractsiuda: Fixed-point fractional library routines.
  41632. (line 1455)
  41633. * __satfractsiudq: Fixed-point fractional library routines.
  41634. (line 1452)
  41635. * __satfractsiuha: Fixed-point fractional library routines.
  41636. (line 1453)
  41637. * __satfractsiuhq: Fixed-point fractional library routines.
  41638. (line 1450)
  41639. * __satfractsiuqq: Fixed-point fractional library routines.
  41640. (line 1449)
  41641. * __satfractsiusa: Fixed-point fractional library routines.
  41642. (line 1454)
  41643. * __satfractsiusq: Fixed-point fractional library routines.
  41644. (line 1451)
  41645. * __satfractsiuta: Fixed-point fractional library routines.
  41646. (line 1456)
  41647. * __satfractsqda: Fixed-point fractional library routines.
  41648. (line 1086)
  41649. * __satfractsqdq2: Fixed-point fractional library routines.
  41650. (line 1083)
  41651. * __satfractsqha: Fixed-point fractional library routines.
  41652. (line 1084)
  41653. * __satfractsqhq2: Fixed-point fractional library routines.
  41654. (line 1082)
  41655. * __satfractsqqq2: Fixed-point fractional library routines.
  41656. (line 1081)
  41657. * __satfractsqsa: Fixed-point fractional library routines.
  41658. (line 1085)
  41659. * __satfractsqta: Fixed-point fractional library routines.
  41660. (line 1087)
  41661. * __satfractsquda: Fixed-point fractional library routines.
  41662. (line 1097)
  41663. * __satfractsqudq: Fixed-point fractional library routines.
  41664. (line 1092)
  41665. * __satfractsquha: Fixed-point fractional library routines.
  41666. (line 1094)
  41667. * __satfractsquhq: Fixed-point fractional library routines.
  41668. (line 1090)
  41669. * __satfractsquqq: Fixed-point fractional library routines.
  41670. (line 1088)
  41671. * __satfractsqusa: Fixed-point fractional library routines.
  41672. (line 1096)
  41673. * __satfractsqusq: Fixed-point fractional library routines.
  41674. (line 1091)
  41675. * __satfractsquta: Fixed-point fractional library routines.
  41676. (line 1098)
  41677. * __satfracttada2: Fixed-point fractional library routines.
  41678. (line 1182)
  41679. * __satfracttadq: Fixed-point fractional library routines.
  41680. (line 1179)
  41681. * __satfracttaha2: Fixed-point fractional library routines.
  41682. (line 1180)
  41683. * __satfracttahq: Fixed-point fractional library routines.
  41684. (line 1177)
  41685. * __satfracttaqq: Fixed-point fractional library routines.
  41686. (line 1176)
  41687. * __satfracttasa2: Fixed-point fractional library routines.
  41688. (line 1181)
  41689. * __satfracttasq: Fixed-point fractional library routines.
  41690. (line 1178)
  41691. * __satfracttauda: Fixed-point fractional library routines.
  41692. (line 1193)
  41693. * __satfracttaudq: Fixed-point fractional library routines.
  41694. (line 1188)
  41695. * __satfracttauha: Fixed-point fractional library routines.
  41696. (line 1190)
  41697. * __satfracttauhq: Fixed-point fractional library routines.
  41698. (line 1185)
  41699. * __satfracttauqq: Fixed-point fractional library routines.
  41700. (line 1183)
  41701. * __satfracttausa: Fixed-point fractional library routines.
  41702. (line 1192)
  41703. * __satfracttausq: Fixed-point fractional library routines.
  41704. (line 1186)
  41705. * __satfracttauta: Fixed-point fractional library routines.
  41706. (line 1195)
  41707. * __satfracttida: Fixed-point fractional library routines.
  41708. (line 1479)
  41709. * __satfracttidq: Fixed-point fractional library routines.
  41710. (line 1476)
  41711. * __satfracttiha: Fixed-point fractional library routines.
  41712. (line 1477)
  41713. * __satfracttihq: Fixed-point fractional library routines.
  41714. (line 1474)
  41715. * __satfracttiqq: Fixed-point fractional library routines.
  41716. (line 1473)
  41717. * __satfracttisa: Fixed-point fractional library routines.
  41718. (line 1478)
  41719. * __satfracttisq: Fixed-point fractional library routines.
  41720. (line 1475)
  41721. * __satfracttita: Fixed-point fractional library routines.
  41722. (line 1480)
  41723. * __satfracttiuda: Fixed-point fractional library routines.
  41724. (line 1488)
  41725. * __satfracttiudq: Fixed-point fractional library routines.
  41726. (line 1484)
  41727. * __satfracttiuha: Fixed-point fractional library routines.
  41728. (line 1486)
  41729. * __satfracttiuhq: Fixed-point fractional library routines.
  41730. (line 1482)
  41731. * __satfracttiuqq: Fixed-point fractional library routines.
  41732. (line 1481)
  41733. * __satfracttiusa: Fixed-point fractional library routines.
  41734. (line 1487)
  41735. * __satfracttiusq: Fixed-point fractional library routines.
  41736. (line 1483)
  41737. * __satfracttiuta: Fixed-point fractional library routines.
  41738. (line 1489)
  41739. * __satfractudada: Fixed-point fractional library routines.
  41740. (line 1358)
  41741. * __satfractudadq: Fixed-point fractional library routines.
  41742. (line 1353)
  41743. * __satfractudaha: Fixed-point fractional library routines.
  41744. (line 1355)
  41745. * __satfractudahq: Fixed-point fractional library routines.
  41746. (line 1351)
  41747. * __satfractudaqq: Fixed-point fractional library routines.
  41748. (line 1349)
  41749. * __satfractudasa: Fixed-point fractional library routines.
  41750. (line 1357)
  41751. * __satfractudasq: Fixed-point fractional library routines.
  41752. (line 1352)
  41753. * __satfractudata: Fixed-point fractional library routines.
  41754. (line 1359)
  41755. * __satfractudaudq: Fixed-point fractional library routines.
  41756. (line 1367)
  41757. * __satfractudauha2: Fixed-point fractional library routines.
  41758. (line 1369)
  41759. * __satfractudauhq: Fixed-point fractional library routines.
  41760. (line 1363)
  41761. * __satfractudauqq: Fixed-point fractional library routines.
  41762. (line 1361)
  41763. * __satfractudausa2: Fixed-point fractional library routines.
  41764. (line 1371)
  41765. * __satfractudausq: Fixed-point fractional library routines.
  41766. (line 1365)
  41767. * __satfractudauta2: Fixed-point fractional library routines.
  41768. (line 1373)
  41769. * __satfractudqda: Fixed-point fractional library routines.
  41770. (line 1282)
  41771. * __satfractudqdq: Fixed-point fractional library routines.
  41772. (line 1277)
  41773. * __satfractudqha: Fixed-point fractional library routines.
  41774. (line 1279)
  41775. * __satfractudqhq: Fixed-point fractional library routines.
  41776. (line 1274)
  41777. * __satfractudqqq: Fixed-point fractional library routines.
  41778. (line 1272)
  41779. * __satfractudqsa: Fixed-point fractional library routines.
  41780. (line 1281)
  41781. * __satfractudqsq: Fixed-point fractional library routines.
  41782. (line 1275)
  41783. * __satfractudqta: Fixed-point fractional library routines.
  41784. (line 1284)
  41785. * __satfractudquda: Fixed-point fractional library routines.
  41786. (line 1296)
  41787. * __satfractudquha: Fixed-point fractional library routines.
  41788. (line 1292)
  41789. * __satfractudquhq2: Fixed-point fractional library routines.
  41790. (line 1288)
  41791. * __satfractudquqq2: Fixed-point fractional library routines.
  41792. (line 1286)
  41793. * __satfractudqusa: Fixed-point fractional library routines.
  41794. (line 1294)
  41795. * __satfractudqusq2: Fixed-point fractional library routines.
  41796. (line 1290)
  41797. * __satfractudquta: Fixed-point fractional library routines.
  41798. (line 1298)
  41799. * __satfractuhada: Fixed-point fractional library routines.
  41800. (line 1310)
  41801. * __satfractuhadq: Fixed-point fractional library routines.
  41802. (line 1305)
  41803. * __satfractuhaha: Fixed-point fractional library routines.
  41804. (line 1307)
  41805. * __satfractuhahq: Fixed-point fractional library routines.
  41806. (line 1302)
  41807. * __satfractuhaqq: Fixed-point fractional library routines.
  41808. (line 1300)
  41809. * __satfractuhasa: Fixed-point fractional library routines.
  41810. (line 1309)
  41811. * __satfractuhasq: Fixed-point fractional library routines.
  41812. (line 1303)
  41813. * __satfractuhata: Fixed-point fractional library routines.
  41814. (line 1312)
  41815. * __satfractuhauda2: Fixed-point fractional library routines.
  41816. (line 1324)
  41817. * __satfractuhaudq: Fixed-point fractional library routines.
  41818. (line 1320)
  41819. * __satfractuhauhq: Fixed-point fractional library routines.
  41820. (line 1316)
  41821. * __satfractuhauqq: Fixed-point fractional library routines.
  41822. (line 1314)
  41823. * __satfractuhausa2: Fixed-point fractional library routines.
  41824. (line 1322)
  41825. * __satfractuhausq: Fixed-point fractional library routines.
  41826. (line 1318)
  41827. * __satfractuhauta2: Fixed-point fractional library routines.
  41828. (line 1326)
  41829. * __satfractuhqda: Fixed-point fractional library routines.
  41830. (line 1231)
  41831. * __satfractuhqdq: Fixed-point fractional library routines.
  41832. (line 1228)
  41833. * __satfractuhqha: Fixed-point fractional library routines.
  41834. (line 1229)
  41835. * __satfractuhqhq: Fixed-point fractional library routines.
  41836. (line 1226)
  41837. * __satfractuhqqq: Fixed-point fractional library routines.
  41838. (line 1225)
  41839. * __satfractuhqsa: Fixed-point fractional library routines.
  41840. (line 1230)
  41841. * __satfractuhqsq: Fixed-point fractional library routines.
  41842. (line 1227)
  41843. * __satfractuhqta: Fixed-point fractional library routines.
  41844. (line 1232)
  41845. * __satfractuhquda: Fixed-point fractional library routines.
  41846. (line 1242)
  41847. * __satfractuhqudq2: Fixed-point fractional library routines.
  41848. (line 1237)
  41849. * __satfractuhquha: Fixed-point fractional library routines.
  41850. (line 1239)
  41851. * __satfractuhquqq2: Fixed-point fractional library routines.
  41852. (line 1233)
  41853. * __satfractuhqusa: Fixed-point fractional library routines.
  41854. (line 1241)
  41855. * __satfractuhqusq2: Fixed-point fractional library routines.
  41856. (line 1235)
  41857. * __satfractuhquta: Fixed-point fractional library routines.
  41858. (line 1244)
  41859. * __satfractunsdida: Fixed-point fractional library routines.
  41860. (line 1841)
  41861. * __satfractunsdidq: Fixed-point fractional library routines.
  41862. (line 1837)
  41863. * __satfractunsdiha: Fixed-point fractional library routines.
  41864. (line 1839)
  41865. * __satfractunsdihq: Fixed-point fractional library routines.
  41866. (line 1835)
  41867. * __satfractunsdiqq: Fixed-point fractional library routines.
  41868. (line 1834)
  41869. * __satfractunsdisa: Fixed-point fractional library routines.
  41870. (line 1840)
  41871. * __satfractunsdisq: Fixed-point fractional library routines.
  41872. (line 1836)
  41873. * __satfractunsdita: Fixed-point fractional library routines.
  41874. (line 1842)
  41875. * __satfractunsdiuda: Fixed-point fractional library routines.
  41876. (line 1856)
  41877. * __satfractunsdiudq: Fixed-point fractional library routines.
  41878. (line 1850)
  41879. * __satfractunsdiuha: Fixed-point fractional library routines.
  41880. (line 1852)
  41881. * __satfractunsdiuhq: Fixed-point fractional library routines.
  41882. (line 1846)
  41883. * __satfractunsdiuqq: Fixed-point fractional library routines.
  41884. (line 1844)
  41885. * __satfractunsdiusa: Fixed-point fractional library routines.
  41886. (line 1854)
  41887. * __satfractunsdiusq: Fixed-point fractional library routines.
  41888. (line 1848)
  41889. * __satfractunsdiuta: Fixed-point fractional library routines.
  41890. (line 1858)
  41891. * __satfractunshida: Fixed-point fractional library routines.
  41892. (line 1793)
  41893. * __satfractunshidq: Fixed-point fractional library routines.
  41894. (line 1789)
  41895. * __satfractunshiha: Fixed-point fractional library routines.
  41896. (line 1791)
  41897. * __satfractunshihq: Fixed-point fractional library routines.
  41898. (line 1787)
  41899. * __satfractunshiqq: Fixed-point fractional library routines.
  41900. (line 1786)
  41901. * __satfractunshisa: Fixed-point fractional library routines.
  41902. (line 1792)
  41903. * __satfractunshisq: Fixed-point fractional library routines.
  41904. (line 1788)
  41905. * __satfractunshita: Fixed-point fractional library routines.
  41906. (line 1794)
  41907. * __satfractunshiuda: Fixed-point fractional library routines.
  41908. (line 1808)
  41909. * __satfractunshiudq: Fixed-point fractional library routines.
  41910. (line 1802)
  41911. * __satfractunshiuha: Fixed-point fractional library routines.
  41912. (line 1804)
  41913. * __satfractunshiuhq: Fixed-point fractional library routines.
  41914. (line 1798)
  41915. * __satfractunshiuqq: Fixed-point fractional library routines.
  41916. (line 1796)
  41917. * __satfractunshiusa: Fixed-point fractional library routines.
  41918. (line 1806)
  41919. * __satfractunshiusq: Fixed-point fractional library routines.
  41920. (line 1800)
  41921. * __satfractunshiuta: Fixed-point fractional library routines.
  41922. (line 1810)
  41923. * __satfractunsqida: Fixed-point fractional library routines.
  41924. (line 1767)
  41925. * __satfractunsqidq: Fixed-point fractional library routines.
  41926. (line 1763)
  41927. * __satfractunsqiha: Fixed-point fractional library routines.
  41928. (line 1765)
  41929. * __satfractunsqihq: Fixed-point fractional library routines.
  41930. (line 1761)
  41931. * __satfractunsqiqq: Fixed-point fractional library routines.
  41932. (line 1760)
  41933. * __satfractunsqisa: Fixed-point fractional library routines.
  41934. (line 1766)
  41935. * __satfractunsqisq: Fixed-point fractional library routines.
  41936. (line 1762)
  41937. * __satfractunsqita: Fixed-point fractional library routines.
  41938. (line 1768)
  41939. * __satfractunsqiuda: Fixed-point fractional library routines.
  41940. (line 1782)
  41941. * __satfractunsqiudq: Fixed-point fractional library routines.
  41942. (line 1776)
  41943. * __satfractunsqiuha: Fixed-point fractional library routines.
  41944. (line 1778)
  41945. * __satfractunsqiuhq: Fixed-point fractional library routines.
  41946. (line 1772)
  41947. * __satfractunsqiuqq: Fixed-point fractional library routines.
  41948. (line 1770)
  41949. * __satfractunsqiusa: Fixed-point fractional library routines.
  41950. (line 1780)
  41951. * __satfractunsqiusq: Fixed-point fractional library routines.
  41952. (line 1774)
  41953. * __satfractunsqiuta: Fixed-point fractional library routines.
  41954. (line 1784)
  41955. * __satfractunssida: Fixed-point fractional library routines.
  41956. (line 1818)
  41957. * __satfractunssidq: Fixed-point fractional library routines.
  41958. (line 1815)
  41959. * __satfractunssiha: Fixed-point fractional library routines.
  41960. (line 1816)
  41961. * __satfractunssihq: Fixed-point fractional library routines.
  41962. (line 1813)
  41963. * __satfractunssiqq: Fixed-point fractional library routines.
  41964. (line 1812)
  41965. * __satfractunssisa: Fixed-point fractional library routines.
  41966. (line 1817)
  41967. * __satfractunssisq: Fixed-point fractional library routines.
  41968. (line 1814)
  41969. * __satfractunssita: Fixed-point fractional library routines.
  41970. (line 1819)
  41971. * __satfractunssiuda: Fixed-point fractional library routines.
  41972. (line 1830)
  41973. * __satfractunssiudq: Fixed-point fractional library routines.
  41974. (line 1825)
  41975. * __satfractunssiuha: Fixed-point fractional library routines.
  41976. (line 1827)
  41977. * __satfractunssiuhq: Fixed-point fractional library routines.
  41978. (line 1822)
  41979. * __satfractunssiuqq: Fixed-point fractional library routines.
  41980. (line 1820)
  41981. * __satfractunssiusa: Fixed-point fractional library routines.
  41982. (line 1829)
  41983. * __satfractunssiusq: Fixed-point fractional library routines.
  41984. (line 1823)
  41985. * __satfractunssiuta: Fixed-point fractional library routines.
  41986. (line 1832)
  41987. * __satfractunstida: Fixed-point fractional library routines.
  41988. (line 1870)
  41989. * __satfractunstidq: Fixed-point fractional library routines.
  41990. (line 1865)
  41991. * __satfractunstiha: Fixed-point fractional library routines.
  41992. (line 1867)
  41993. * __satfractunstihq: Fixed-point fractional library routines.
  41994. (line 1862)
  41995. * __satfractunstiqq: Fixed-point fractional library routines.
  41996. (line 1860)
  41997. * __satfractunstisa: Fixed-point fractional library routines.
  41998. (line 1869)
  41999. * __satfractunstisq: Fixed-point fractional library routines.
  42000. (line 1863)
  42001. * __satfractunstita: Fixed-point fractional library routines.
  42002. (line 1872)
  42003. * __satfractunstiuda: Fixed-point fractional library routines.
  42004. (line 1886)
  42005. * __satfractunstiudq: Fixed-point fractional library routines.
  42006. (line 1880)
  42007. * __satfractunstiuha: Fixed-point fractional library routines.
  42008. (line 1882)
  42009. * __satfractunstiuhq: Fixed-point fractional library routines.
  42010. (line 1876)
  42011. * __satfractunstiuqq: Fixed-point fractional library routines.
  42012. (line 1874)
  42013. * __satfractunstiusa: Fixed-point fractional library routines.
  42014. (line 1884)
  42015. * __satfractunstiusq: Fixed-point fractional library routines.
  42016. (line 1878)
  42017. * __satfractunstiuta: Fixed-point fractional library routines.
  42018. (line 1888)
  42019. * __satfractuqqda: Fixed-point fractional library routines.
  42020. (line 1207)
  42021. * __satfractuqqdq: Fixed-point fractional library routines.
  42022. (line 1202)
  42023. * __satfractuqqha: Fixed-point fractional library routines.
  42024. (line 1204)
  42025. * __satfractuqqhq: Fixed-point fractional library routines.
  42026. (line 1199)
  42027. * __satfractuqqqq: Fixed-point fractional library routines.
  42028. (line 1197)
  42029. * __satfractuqqsa: Fixed-point fractional library routines.
  42030. (line 1206)
  42031. * __satfractuqqsq: Fixed-point fractional library routines.
  42032. (line 1200)
  42033. * __satfractuqqta: Fixed-point fractional library routines.
  42034. (line 1209)
  42035. * __satfractuqquda: Fixed-point fractional library routines.
  42036. (line 1221)
  42037. * __satfractuqqudq2: Fixed-point fractional library routines.
  42038. (line 1215)
  42039. * __satfractuqquha: Fixed-point fractional library routines.
  42040. (line 1217)
  42041. * __satfractuqquhq2: Fixed-point fractional library routines.
  42042. (line 1211)
  42043. * __satfractuqqusa: Fixed-point fractional library routines.
  42044. (line 1219)
  42045. * __satfractuqqusq2: Fixed-point fractional library routines.
  42046. (line 1213)
  42047. * __satfractuqquta: Fixed-point fractional library routines.
  42048. (line 1223)
  42049. * __satfractusada: Fixed-point fractional library routines.
  42050. (line 1334)
  42051. * __satfractusadq: Fixed-point fractional library routines.
  42052. (line 1331)
  42053. * __satfractusaha: Fixed-point fractional library routines.
  42054. (line 1332)
  42055. * __satfractusahq: Fixed-point fractional library routines.
  42056. (line 1329)
  42057. * __satfractusaqq: Fixed-point fractional library routines.
  42058. (line 1328)
  42059. * __satfractusasa: Fixed-point fractional library routines.
  42060. (line 1333)
  42061. * __satfractusasq: Fixed-point fractional library routines.
  42062. (line 1330)
  42063. * __satfractusata: Fixed-point fractional library routines.
  42064. (line 1335)
  42065. * __satfractusauda2: Fixed-point fractional library routines.
  42066. (line 1345)
  42067. * __satfractusaudq: Fixed-point fractional library routines.
  42068. (line 1341)
  42069. * __satfractusauha2: Fixed-point fractional library routines.
  42070. (line 1343)
  42071. * __satfractusauhq: Fixed-point fractional library routines.
  42072. (line 1338)
  42073. * __satfractusauqq: Fixed-point fractional library routines.
  42074. (line 1336)
  42075. * __satfractusausq: Fixed-point fractional library routines.
  42076. (line 1339)
  42077. * __satfractusauta2: Fixed-point fractional library routines.
  42078. (line 1347)
  42079. * __satfractusqda: Fixed-point fractional library routines.
  42080. (line 1255)
  42081. * __satfractusqdq: Fixed-point fractional library routines.
  42082. (line 1250)
  42083. * __satfractusqha: Fixed-point fractional library routines.
  42084. (line 1252)
  42085. * __satfractusqhq: Fixed-point fractional library routines.
  42086. (line 1248)
  42087. * __satfractusqqq: Fixed-point fractional library routines.
  42088. (line 1246)
  42089. * __satfractusqsa: Fixed-point fractional library routines.
  42090. (line 1254)
  42091. * __satfractusqsq: Fixed-point fractional library routines.
  42092. (line 1249)
  42093. * __satfractusqta: Fixed-point fractional library routines.
  42094. (line 1256)
  42095. * __satfractusquda: Fixed-point fractional library routines.
  42096. (line 1268)
  42097. * __satfractusqudq2: Fixed-point fractional library routines.
  42098. (line 1262)
  42099. * __satfractusquha: Fixed-point fractional library routines.
  42100. (line 1264)
  42101. * __satfractusquhq2: Fixed-point fractional library routines.
  42102. (line 1260)
  42103. * __satfractusquqq2: Fixed-point fractional library routines.
  42104. (line 1258)
  42105. * __satfractusqusa: Fixed-point fractional library routines.
  42106. (line 1266)
  42107. * __satfractusquta: Fixed-point fractional library routines.
  42108. (line 1270)
  42109. * __satfractutada: Fixed-point fractional library routines.
  42110. (line 1385)
  42111. * __satfractutadq: Fixed-point fractional library routines.
  42112. (line 1380)
  42113. * __satfractutaha: Fixed-point fractional library routines.
  42114. (line 1382)
  42115. * __satfractutahq: Fixed-point fractional library routines.
  42116. (line 1377)
  42117. * __satfractutaqq: Fixed-point fractional library routines.
  42118. (line 1375)
  42119. * __satfractutasa: Fixed-point fractional library routines.
  42120. (line 1384)
  42121. * __satfractutasq: Fixed-point fractional library routines.
  42122. (line 1378)
  42123. * __satfractutata: Fixed-point fractional library routines.
  42124. (line 1387)
  42125. * __satfractutauda2: Fixed-point fractional library routines.
  42126. (line 1401)
  42127. * __satfractutaudq: Fixed-point fractional library routines.
  42128. (line 1395)
  42129. * __satfractutauha2: Fixed-point fractional library routines.
  42130. (line 1397)
  42131. * __satfractutauhq: Fixed-point fractional library routines.
  42132. (line 1391)
  42133. * __satfractutauqq: Fixed-point fractional library routines.
  42134. (line 1389)
  42135. * __satfractutausa2: Fixed-point fractional library routines.
  42136. (line 1399)
  42137. * __satfractutausq: Fixed-point fractional library routines.
  42138. (line 1393)
  42139. * __splitstack_find: Miscellaneous routines.
  42140. (line 15)
  42141. * __ssaddda3: Fixed-point fractional library routines.
  42142. (line 74)
  42143. * __ssadddq3: Fixed-point fractional library routines.
  42144. (line 69)
  42145. * __ssaddha3: Fixed-point fractional library routines.
  42146. (line 71)
  42147. * __ssaddhq3: Fixed-point fractional library routines.
  42148. (line 67)
  42149. * __ssaddqq3: Fixed-point fractional library routines.
  42150. (line 65)
  42151. * __ssaddsa3: Fixed-point fractional library routines.
  42152. (line 73)
  42153. * __ssaddsq3: Fixed-point fractional library routines.
  42154. (line 68)
  42155. * __ssaddta3: Fixed-point fractional library routines.
  42156. (line 75)
  42157. * __ssashlda3: Fixed-point fractional library routines.
  42158. (line 409)
  42159. * __ssashldq3: Fixed-point fractional library routines.
  42160. (line 405)
  42161. * __ssashlha3: Fixed-point fractional library routines.
  42162. (line 407)
  42163. * __ssashlhq3: Fixed-point fractional library routines.
  42164. (line 403)
  42165. * __ssashlsa3: Fixed-point fractional library routines.
  42166. (line 408)
  42167. * __ssashlsq3: Fixed-point fractional library routines.
  42168. (line 404)
  42169. * __ssashlta3: Fixed-point fractional library routines.
  42170. (line 410)
  42171. * __ssdivda3: Fixed-point fractional library routines.
  42172. (line 268)
  42173. * __ssdivdq3: Fixed-point fractional library routines.
  42174. (line 263)
  42175. * __ssdivha3: Fixed-point fractional library routines.
  42176. (line 265)
  42177. * __ssdivhq3: Fixed-point fractional library routines.
  42178. (line 261)
  42179. * __ssdivqq3: Fixed-point fractional library routines.
  42180. (line 259)
  42181. * __ssdivsa3: Fixed-point fractional library routines.
  42182. (line 267)
  42183. * __ssdivsq3: Fixed-point fractional library routines.
  42184. (line 262)
  42185. * __ssdivta3: Fixed-point fractional library routines.
  42186. (line 269)
  42187. * __ssmulda3: Fixed-point fractional library routines.
  42188. (line 200)
  42189. * __ssmuldq3: Fixed-point fractional library routines.
  42190. (line 195)
  42191. * __ssmulha3: Fixed-point fractional library routines.
  42192. (line 197)
  42193. * __ssmulhq3: Fixed-point fractional library routines.
  42194. (line 193)
  42195. * __ssmulqq3: Fixed-point fractional library routines.
  42196. (line 191)
  42197. * __ssmulsa3: Fixed-point fractional library routines.
  42198. (line 199)
  42199. * __ssmulsq3: Fixed-point fractional library routines.
  42200. (line 194)
  42201. * __ssmulta3: Fixed-point fractional library routines.
  42202. (line 201)
  42203. * __ssnegda2: Fixed-point fractional library routines.
  42204. (line 323)
  42205. * __ssnegdq2: Fixed-point fractional library routines.
  42206. (line 320)
  42207. * __ssnegha2: Fixed-point fractional library routines.
  42208. (line 321)
  42209. * __ssneghq2: Fixed-point fractional library routines.
  42210. (line 318)
  42211. * __ssnegqq2: Fixed-point fractional library routines.
  42212. (line 317)
  42213. * __ssnegsa2: Fixed-point fractional library routines.
  42214. (line 322)
  42215. * __ssnegsq2: Fixed-point fractional library routines.
  42216. (line 319)
  42217. * __ssnegta2: Fixed-point fractional library routines.
  42218. (line 324)
  42219. * __sssubda3: Fixed-point fractional library routines.
  42220. (line 136)
  42221. * __sssubdq3: Fixed-point fractional library routines.
  42222. (line 131)
  42223. * __sssubha3: Fixed-point fractional library routines.
  42224. (line 133)
  42225. * __sssubhq3: Fixed-point fractional library routines.
  42226. (line 129)
  42227. * __sssubqq3: Fixed-point fractional library routines.
  42228. (line 127)
  42229. * __sssubsa3: Fixed-point fractional library routines.
  42230. (line 135)
  42231. * __sssubsq3: Fixed-point fractional library routines.
  42232. (line 130)
  42233. * __sssubta3: Fixed-point fractional library routines.
  42234. (line 137)
  42235. * __subda3: Fixed-point fractional library routines.
  42236. (line 114)
  42237. * __subdf3: Soft float library routines.
  42238. (line 30)
  42239. * __subdq3: Fixed-point fractional library routines.
  42240. (line 101)
  42241. * __subha3: Fixed-point fractional library routines.
  42242. (line 111)
  42243. * __subhq3: Fixed-point fractional library routines.
  42244. (line 99)
  42245. * __subqq3: Fixed-point fractional library routines.
  42246. (line 97)
  42247. * __subsa3: Fixed-point fractional library routines.
  42248. (line 113)
  42249. * __subsf3: Soft float library routines.
  42250. (line 29)
  42251. * __subsq3: Fixed-point fractional library routines.
  42252. (line 100)
  42253. * __subta3: Fixed-point fractional library routines.
  42254. (line 115)
  42255. * __subtf3: Soft float library routines.
  42256. (line 31)
  42257. * __subuda3: Fixed-point fractional library routines.
  42258. (line 121)
  42259. * __subudq3: Fixed-point fractional library routines.
  42260. (line 109)
  42261. * __subuha3: Fixed-point fractional library routines.
  42262. (line 117)
  42263. * __subuhq3: Fixed-point fractional library routines.
  42264. (line 105)
  42265. * __subuqq3: Fixed-point fractional library routines.
  42266. (line 103)
  42267. * __subusa3: Fixed-point fractional library routines.
  42268. (line 119)
  42269. * __subusq3: Fixed-point fractional library routines.
  42270. (line 107)
  42271. * __subuta3: Fixed-point fractional library routines.
  42272. (line 123)
  42273. * __subvdi3: Integer library routines.
  42274. (line 122)
  42275. * __subvsi3: Integer library routines.
  42276. (line 121)
  42277. * __subxf3: Soft float library routines.
  42278. (line 33)
  42279. * __truncdfsf2: Soft float library routines.
  42280. (line 75)
  42281. * __trunctfdf2: Soft float library routines.
  42282. (line 72)
  42283. * __trunctfsf2: Soft float library routines.
  42284. (line 74)
  42285. * __truncxfdf2: Soft float library routines.
  42286. (line 71)
  42287. * __truncxfsf2: Soft float library routines.
  42288. (line 73)
  42289. * __ucmpdi2: Integer library routines.
  42290. (line 92)
  42291. * __ucmpti2: Integer library routines.
  42292. (line 93)
  42293. * __udivdi3: Integer library routines.
  42294. (line 52)
  42295. * __udivmoddi4: Integer library routines.
  42296. (line 59)
  42297. * __udivmodti4: Integer library routines.
  42298. (line 61)
  42299. * __udivsi3: Integer library routines.
  42300. (line 50)
  42301. * __udivti3: Integer library routines.
  42302. (line 54)
  42303. * __udivuda3: Fixed-point fractional library routines.
  42304. (line 252)
  42305. * __udivudq3: Fixed-point fractional library routines.
  42306. (line 246)
  42307. * __udivuha3: Fixed-point fractional library routines.
  42308. (line 248)
  42309. * __udivuhq3: Fixed-point fractional library routines.
  42310. (line 242)
  42311. * __udivuqq3: Fixed-point fractional library routines.
  42312. (line 240)
  42313. * __udivusa3: Fixed-point fractional library routines.
  42314. (line 250)
  42315. * __udivusq3: Fixed-point fractional library routines.
  42316. (line 244)
  42317. * __udivuta3: Fixed-point fractional library routines.
  42318. (line 254)
  42319. * __umoddi3: Integer library routines.
  42320. (line 69)
  42321. * __umodsi3: Integer library routines.
  42322. (line 67)
  42323. * __umodti3: Integer library routines.
  42324. (line 71)
  42325. * __unorddf2: Soft float library routines.
  42326. (line 172)
  42327. * __unordsf2: Soft float library routines.
  42328. (line 171)
  42329. * __unordtf2: Soft float library routines.
  42330. (line 173)
  42331. * __usadduda3: Fixed-point fractional library routines.
  42332. (line 91)
  42333. * __usaddudq3: Fixed-point fractional library routines.
  42334. (line 85)
  42335. * __usadduha3: Fixed-point fractional library routines.
  42336. (line 87)
  42337. * __usadduhq3: Fixed-point fractional library routines.
  42338. (line 81)
  42339. * __usadduqq3: Fixed-point fractional library routines.
  42340. (line 79)
  42341. * __usaddusa3: Fixed-point fractional library routines.
  42342. (line 89)
  42343. * __usaddusq3: Fixed-point fractional library routines.
  42344. (line 83)
  42345. * __usadduta3: Fixed-point fractional library routines.
  42346. (line 93)
  42347. * __usashluda3: Fixed-point fractional library routines.
  42348. (line 427)
  42349. * __usashludq3: Fixed-point fractional library routines.
  42350. (line 421)
  42351. * __usashluha3: Fixed-point fractional library routines.
  42352. (line 423)
  42353. * __usashluhq3: Fixed-point fractional library routines.
  42354. (line 417)
  42355. * __usashluqq3: Fixed-point fractional library routines.
  42356. (line 415)
  42357. * __usashlusa3: Fixed-point fractional library routines.
  42358. (line 425)
  42359. * __usashlusq3: Fixed-point fractional library routines.
  42360. (line 419)
  42361. * __usashluta3: Fixed-point fractional library routines.
  42362. (line 429)
  42363. * __usdivuda3: Fixed-point fractional library routines.
  42364. (line 286)
  42365. * __usdivudq3: Fixed-point fractional library routines.
  42366. (line 280)
  42367. * __usdivuha3: Fixed-point fractional library routines.
  42368. (line 282)
  42369. * __usdivuhq3: Fixed-point fractional library routines.
  42370. (line 276)
  42371. * __usdivuqq3: Fixed-point fractional library routines.
  42372. (line 274)
  42373. * __usdivusa3: Fixed-point fractional library routines.
  42374. (line 284)
  42375. * __usdivusq3: Fixed-point fractional library routines.
  42376. (line 278)
  42377. * __usdivuta3: Fixed-point fractional library routines.
  42378. (line 288)
  42379. * __usmuluda3: Fixed-point fractional library routines.
  42380. (line 218)
  42381. * __usmuludq3: Fixed-point fractional library routines.
  42382. (line 212)
  42383. * __usmuluha3: Fixed-point fractional library routines.
  42384. (line 214)
  42385. * __usmuluhq3: Fixed-point fractional library routines.
  42386. (line 208)
  42387. * __usmuluqq3: Fixed-point fractional library routines.
  42388. (line 206)
  42389. * __usmulusa3: Fixed-point fractional library routines.
  42390. (line 216)
  42391. * __usmulusq3: Fixed-point fractional library routines.
  42392. (line 210)
  42393. * __usmuluta3: Fixed-point fractional library routines.
  42394. (line 220)
  42395. * __usneguda2: Fixed-point fractional library routines.
  42396. (line 337)
  42397. * __usnegudq2: Fixed-point fractional library routines.
  42398. (line 332)
  42399. * __usneguha2: Fixed-point fractional library routines.
  42400. (line 334)
  42401. * __usneguhq2: Fixed-point fractional library routines.
  42402. (line 329)
  42403. * __usneguqq2: Fixed-point fractional library routines.
  42404. (line 327)
  42405. * __usnegusa2: Fixed-point fractional library routines.
  42406. (line 336)
  42407. * __usnegusq2: Fixed-point fractional library routines.
  42408. (line 330)
  42409. * __usneguta2: Fixed-point fractional library routines.
  42410. (line 339)
  42411. * __ussubuda3: Fixed-point fractional library routines.
  42412. (line 154)
  42413. * __ussubudq3: Fixed-point fractional library routines.
  42414. (line 148)
  42415. * __ussubuha3: Fixed-point fractional library routines.
  42416. (line 150)
  42417. * __ussubuhq3: Fixed-point fractional library routines.
  42418. (line 144)
  42419. * __ussubuqq3: Fixed-point fractional library routines.
  42420. (line 142)
  42421. * __ussubusa3: Fixed-point fractional library routines.
  42422. (line 152)
  42423. * __ussubusq3: Fixed-point fractional library routines.
  42424. (line 146)
  42425. * __ussubuta3: Fixed-point fractional library routines.
  42426. (line 156)
  42427. * abort: Portability. (line 20)
  42428. * abs: Arithmetic. (line 200)
  42429. * abs and attributes: Expressions. (line 83)
  42430. * absence_set: Processor pipeline description.
  42431. (line 223)
  42432. * absM2 instruction pattern: Standard Names. (line 879)
  42433. * absolute value: Arithmetic. (line 200)
  42434. * ABSU_EXPR: Unary and Binary Expressions.
  42435. (line 6)
  42436. * ABS_EXPR: Unary and Binary Expressions.
  42437. (line 6)
  42438. * access to operands: Accessors. (line 6)
  42439. * access to special operands: Special Accessors. (line 6)
  42440. * accessors: Accessors. (line 6)
  42441. * ACCUMULATE_OUTGOING_ARGS: Stack Arguments. (line 48)
  42442. * ACCUMULATE_OUTGOING_ARGS and stack frames: Function Entry. (line 140)
  42443. * ACCUM_TYPE_SIZE: Type Layout. (line 87)
  42444. * acosM2 instruction pattern: Standard Names. (line 966)
  42445. * ADA_LONG_TYPE_SIZE: Type Layout. (line 25)
  42446. * Adding a new GIMPLE statement code: Adding a new GIMPLE statement code.
  42447. (line 6)
  42448. * ADDITIONAL_REGISTER_NAMES: Instruction Output. (line 14)
  42449. * addM3 instruction pattern: Standard Names. (line 436)
  42450. * addMODEcc instruction pattern: Standard Names. (line 1589)
  42451. * addptrM3 instruction pattern: Standard Names. (line 469)
  42452. * address constraints: Simple Constraints. (line 162)
  42453. * addressing modes: Addressing Modes. (line 6)
  42454. * address_operand: Machine-Independent Predicates.
  42455. (line 62)
  42456. * address_operand <1>: Simple Constraints. (line 166)
  42457. * addr_diff_vec: Side Effects. (line 314)
  42458. * addr_diff_vec, length of: Insn Lengths. (line 26)
  42459. * ADDR_EXPR: Storage References. (line 6)
  42460. * addr_vec: Side Effects. (line 309)
  42461. * addr_vec, length of: Insn Lengths. (line 26)
  42462. * addvM4 instruction pattern: Standard Names. (line 452)
  42463. * ADJUST_FIELD_ALIGN: Storage Layout. (line 212)
  42464. * ADJUST_INSN_LENGTH: Insn Lengths. (line 41)
  42465. * ADJUST_REG_ALLOC_ORDER: Allocation Order. (line 22)
  42466. * aggregates as return values: Aggregate Return. (line 6)
  42467. * alias: Alias analysis. (line 6)
  42468. * allocate_stack instruction pattern: Standard Names. (line 1956)
  42469. * ALL_REGS: Register Classes. (line 17)
  42470. * alternate entry points: Insns. (line 146)
  42471. * analyzer: Static Analyzer. (line 6)
  42472. * analyzer, debugging: Debugging the Analyzer.
  42473. (line 6)
  42474. * analyzer, internals: Analyzer Internals. (line 6)
  42475. * anchored addresses: Anchored Addresses. (line 6)
  42476. * and: Arithmetic. (line 158)
  42477. * and and attributes: Expressions. (line 50)
  42478. * and, canonicalization of: Insn Canonicalizations.
  42479. (line 67)
  42480. * andM3 instruction pattern: Standard Names. (line 442)
  42481. * ANNOTATE_EXPR: Unary and Binary Expressions.
  42482. (line 6)
  42483. * annotations: Annotations. (line 6)
  42484. * APPLY_RESULT_SIZE: Scalar Return. (line 112)
  42485. * ARGS_GROW_DOWNWARD: Frame Layout. (line 30)
  42486. * argument passing: Interface. (line 36)
  42487. * arguments in registers: Register Arguments. (line 6)
  42488. * arguments on stack: Stack Arguments. (line 6)
  42489. * ARG_POINTER_CFA_OFFSET: Frame Layout. (line 207)
  42490. * ARG_POINTER_REGNUM: Frame Registers. (line 40)
  42491. * ARG_POINTER_REGNUM and virtual registers: Regs and Memory. (line 65)
  42492. * arg_pointer_rtx: Frame Registers. (line 104)
  42493. * arithmetic library: Soft float library routines.
  42494. (line 6)
  42495. * arithmetic shift: Arithmetic. (line 173)
  42496. * arithmetic shift with signed saturation: Arithmetic. (line 173)
  42497. * arithmetic shift with unsigned saturation: Arithmetic. (line 173)
  42498. * arithmetic, in RTL: Arithmetic. (line 6)
  42499. * ARITHMETIC_TYPE_P: Types for C++. (line 59)
  42500. * array: Types. (line 6)
  42501. * ARRAY_RANGE_REF: Storage References. (line 6)
  42502. * ARRAY_REF: Storage References. (line 6)
  42503. * ARRAY_TYPE: Types. (line 6)
  42504. * ashift: Arithmetic. (line 173)
  42505. * ashift and attributes: Expressions. (line 83)
  42506. * ashiftrt: Arithmetic. (line 190)
  42507. * ashiftrt and attributes: Expressions. (line 83)
  42508. * ashlM3 instruction pattern: Standard Names. (line 828)
  42509. * ashrM3 instruction pattern: Standard Names. (line 840)
  42510. * asinM2 instruction pattern: Standard Names. (line 960)
  42511. * ASM_APP_OFF: File Framework. (line 76)
  42512. * ASM_APP_ON: File Framework. (line 69)
  42513. * ASM_COMMENT_START: File Framework. (line 64)
  42514. * ASM_DECLARE_COLD_FUNCTION_NAME: Label Output. (line 136)
  42515. * ASM_DECLARE_COLD_FUNCTION_SIZE: Label Output. (line 151)
  42516. * ASM_DECLARE_FUNCTION_NAME: Label Output. (line 108)
  42517. * ASM_DECLARE_FUNCTION_SIZE: Label Output. (line 123)
  42518. * ASM_DECLARE_OBJECT_NAME: Label Output. (line 164)
  42519. * ASM_DECLARE_REGISTER_GLOBAL: Label Output. (line 192)
  42520. * ASM_FINAL_SPEC: Driver. (line 81)
  42521. * ASM_FINISH_DECLARE_OBJECT: Label Output. (line 200)
  42522. * ASM_FORMAT_PRIVATE_NAME: Label Output. (line 426)
  42523. * asm_fprintf: Instruction Output. (line 150)
  42524. * ASM_FPRINTF_EXTENSIONS: Instruction Output. (line 160)
  42525. * ASM_GENERATE_INTERNAL_LABEL: Label Output. (line 410)
  42526. * asm_input: Side Effects. (line 296)
  42527. * asm_input and /v: Flags. (line 65)
  42528. * ASM_MAYBE_OUTPUT_ENCODED_ADDR_RTX: Exception Handling. (line 80)
  42529. * asm_noperands: Insns. (line 327)
  42530. * ASM_NO_SKIP_IN_TEXT: Alignment Output. (line 59)
  42531. * asm_operands and /v: Flags. (line 65)
  42532. * asm_operands, RTL sharing: Sharing. (line 48)
  42533. * asm_operands, usage: Assembler. (line 6)
  42534. * ASM_OUTPUT_ADDR_DIFF_ELT: Dispatch Tables. (line 8)
  42535. * ASM_OUTPUT_ADDR_VEC_ELT: Dispatch Tables. (line 25)
  42536. * ASM_OUTPUT_ALIGN: Alignment Output. (line 66)
  42537. * ASM_OUTPUT_ALIGNED_BSS: Uninitialized Data. (line 45)
  42538. * ASM_OUTPUT_ALIGNED_COMMON: Uninitialized Data. (line 29)
  42539. * ASM_OUTPUT_ALIGNED_DECL_COMMON: Uninitialized Data. (line 36)
  42540. * ASM_OUTPUT_ALIGNED_DECL_LOCAL: Uninitialized Data. (line 89)
  42541. * ASM_OUTPUT_ALIGNED_LOCAL: Uninitialized Data. (line 82)
  42542. * ASM_OUTPUT_ALIGN_WITH_NOP: Alignment Output. (line 71)
  42543. * ASM_OUTPUT_ASCII: Data Output. (line 60)
  42544. * ASM_OUTPUT_CASE_END: Dispatch Tables. (line 50)
  42545. * ASM_OUTPUT_CASE_LABEL: Dispatch Tables. (line 37)
  42546. * ASM_OUTPUT_COMMON: Uninitialized Data. (line 9)
  42547. * ASM_OUTPUT_DEBUG_LABEL: Label Output. (line 398)
  42548. * ASM_OUTPUT_DEF: Label Output. (line 447)
  42549. * ASM_OUTPUT_DEF_FROM_DECLS: Label Output. (line 454)
  42550. * ASM_OUTPUT_DWARF_DATAREL: DWARF. (line 110)
  42551. * ASM_OUTPUT_DWARF_DELTA: DWARF. (line 89)
  42552. * ASM_OUTPUT_DWARF_OFFSET: DWARF. (line 98)
  42553. * ASM_OUTPUT_DWARF_PCREL: DWARF. (line 105)
  42554. * ASM_OUTPUT_DWARF_TABLE_REF: DWARF. (line 115)
  42555. * ASM_OUTPUT_DWARF_VMS_DELTA: DWARF. (line 93)
  42556. * ASM_OUTPUT_EXTERNAL: Label Output. (line 327)
  42557. * ASM_OUTPUT_FDESC: Data Output. (line 69)
  42558. * ASM_OUTPUT_FUNCTION_LABEL: Label Output. (line 16)
  42559. * ASM_OUTPUT_INTERNAL_LABEL: Label Output. (line 27)
  42560. * ASM_OUTPUT_LABEL: Label Output. (line 8)
  42561. * ASM_OUTPUT_LABELREF: Label Output. (line 349)
  42562. * ASM_OUTPUT_LABEL_REF: Label Output. (line 371)
  42563. * ASM_OUTPUT_LOCAL: Uninitialized Data. (line 69)
  42564. * ASM_OUTPUT_MAX_SKIP_ALIGN: Alignment Output. (line 75)
  42565. * ASM_OUTPUT_MEASURED_SIZE: Label Output. (line 51)
  42566. * ASM_OUTPUT_OPCODE: Instruction Output. (line 35)
  42567. * ASM_OUTPUT_POOL_EPILOGUE: Data Output. (line 118)
  42568. * ASM_OUTPUT_POOL_PROLOGUE: Data Output. (line 82)
  42569. * ASM_OUTPUT_REG_POP: Instruction Output. (line 206)
  42570. * ASM_OUTPUT_REG_PUSH: Instruction Output. (line 201)
  42571. * ASM_OUTPUT_SIZE_DIRECTIVE: Label Output. (line 45)
  42572. * ASM_OUTPUT_SKIP: Alignment Output. (line 53)
  42573. * ASM_OUTPUT_SOURCE_FILENAME: File Framework. (line 83)
  42574. * ASM_OUTPUT_SPECIAL_POOL_ENTRY: Data Output. (line 93)
  42575. * ASM_OUTPUT_SYMBOL_REF: Label Output. (line 364)
  42576. * ASM_OUTPUT_TYPE_DIRECTIVE: Label Output. (line 98)
  42577. * ASM_OUTPUT_WEAKREF: Label Output. (line 259)
  42578. * ASM_OUTPUT_WEAK_ALIAS: Label Output. (line 473)
  42579. * ASM_PREFERRED_EH_DATA_FORMAT: Exception Handling. (line 66)
  42580. * ASM_SPEC: Driver. (line 73)
  42581. * ASM_STABD_OP: DBX Options. (line 34)
  42582. * ASM_STABN_OP: DBX Options. (line 41)
  42583. * ASM_STABS_OP: DBX Options. (line 28)
  42584. * ASM_WEAKEN_DECL: Label Output. (line 251)
  42585. * ASM_WEAKEN_LABEL: Label Output. (line 238)
  42586. * assembler format: File Framework. (line 6)
  42587. * assembler instructions in RTL: Assembler. (line 6)
  42588. * ASSEMBLER_DIALECT: Instruction Output. (line 172)
  42589. * assemble_name: Label Output. (line 8)
  42590. * assemble_name_raw: Label Output. (line 27)
  42591. * assigning attribute values to insns: Tagging Insns. (line 6)
  42592. * ASSUME_EXTENDED_UNWIND_CONTEXT: Frame Registers. (line 163)
  42593. * asterisk in template: Output Statement. (line 29)
  42594. * AS_NEEDS_DASH_FOR_PIPED_INPUT: Driver. (line 88)
  42595. * atan2M3 instruction pattern: Standard Names. (line 1061)
  42596. * atanM2 instruction pattern: Standard Names. (line 972)
  42597. * atomic: GTY Options. (line 197)
  42598. * atomic_addMODE instruction pattern: Standard Names. (line 2380)
  42599. * atomic_add_fetchMODE instruction pattern: Standard Names. (line 2409)
  42600. * atomic_andMODE instruction pattern: Standard Names. (line 2380)
  42601. * atomic_and_fetchMODE instruction pattern: Standard Names. (line 2409)
  42602. * atomic_bit_test_and_complementMODE instruction pattern: Standard Names.
  42603. (line 2437)
  42604. * atomic_bit_test_and_resetMODE instruction pattern: Standard Names.
  42605. (line 2437)
  42606. * atomic_bit_test_and_setMODE instruction pattern: Standard Names.
  42607. (line 2437)
  42608. * atomic_compare_and_swapMODE instruction pattern: Standard Names.
  42609. (line 2316)
  42610. * atomic_exchangeMODE instruction pattern: Standard Names. (line 2368)
  42611. * atomic_fetch_addMODE instruction pattern: Standard Names. (line 2394)
  42612. * atomic_fetch_andMODE instruction pattern: Standard Names. (line 2394)
  42613. * atomic_fetch_nandMODE instruction pattern: Standard Names. (line 2394)
  42614. * atomic_fetch_orMODE instruction pattern: Standard Names. (line 2394)
  42615. * atomic_fetch_subMODE instruction pattern: Standard Names. (line 2394)
  42616. * atomic_fetch_xorMODE instruction pattern: Standard Names. (line 2394)
  42617. * atomic_loadMODE instruction pattern: Standard Names. (line 2347)
  42618. * atomic_nandMODE instruction pattern: Standard Names. (line 2380)
  42619. * atomic_nand_fetchMODE instruction pattern: Standard Names. (line 2409)
  42620. * atomic_orMODE instruction pattern: Standard Names. (line 2380)
  42621. * atomic_or_fetchMODE instruction pattern: Standard Names. (line 2409)
  42622. * atomic_storeMODE instruction pattern: Standard Names. (line 2357)
  42623. * atomic_subMODE instruction pattern: Standard Names. (line 2380)
  42624. * atomic_sub_fetchMODE instruction pattern: Standard Names. (line 2409)
  42625. * atomic_test_and_set instruction pattern: Standard Names. (line 2426)
  42626. * atomic_xorMODE instruction pattern: Standard Names. (line 2380)
  42627. * atomic_xor_fetchMODE instruction pattern: Standard Names. (line 2409)
  42628. * attr: Expressions. (line 163)
  42629. * attr <1>: Tagging Insns. (line 54)
  42630. * attribute expressions: Expressions. (line 6)
  42631. * attribute specifications: Attr Example. (line 6)
  42632. * attribute specifications example: Attr Example. (line 6)
  42633. * attributes: Attributes. (line 6)
  42634. * attributes, defining: Defining Attributes.
  42635. (line 6)
  42636. * attributes, target-specific: Target Attributes. (line 6)
  42637. * ATTRIBUTE_ALIGNED_VALUE: Storage Layout. (line 194)
  42638. * attr_flag: Expressions. (line 138)
  42639. * autoincrement addressing, availability: Portability. (line 20)
  42640. * autoincrement/decrement addressing: Simple Constraints. (line 30)
  42641. * automata_option: Processor pipeline description.
  42642. (line 304)
  42643. * automaton based pipeline description: Processor pipeline description.
  42644. (line 6)
  42645. * automaton based pipeline description <1>: Processor pipeline description.
  42646. (line 49)
  42647. * automaton based scheduler: Processor pipeline description.
  42648. (line 6)
  42649. * avgM3_ceil instruction pattern: Standard Names. (line 860)
  42650. * avgM3_floor instruction pattern: Standard Names. (line 848)
  42651. * AVOID_CCMODE_COPIES: Values in Registers.
  42652. (line 148)
  42653. * backslash: Output Template. (line 46)
  42654. * barrier: Insns. (line 176)
  42655. * barrier and /f: Flags. (line 135)
  42656. * barrier and /v: Flags. (line 33)
  42657. * BASE_REG_CLASS: Register Classes. (line 111)
  42658. * basic block: Basic Blocks. (line 6)
  42659. * Basic Statements: Basic Statements. (line 6)
  42660. * basic-block.h: Control Flow. (line 6)
  42661. * basic_block: Basic Blocks. (line 6)
  42662. * BASIC_BLOCK: Basic Blocks. (line 14)
  42663. * BB_HEAD, BB_END: Maintaining the CFG.
  42664. (line 76)
  42665. * bb_seq: GIMPLE sequences. (line 72)
  42666. * BIGGEST_ALIGNMENT: Storage Layout. (line 179)
  42667. * BIGGEST_FIELD_ALIGNMENT: Storage Layout. (line 205)
  42668. * BImode: Machine Modes. (line 22)
  42669. * BIND_EXPR: Unary and Binary Expressions.
  42670. (line 6)
  42671. * BINFO_TYPE: Classes. (line 6)
  42672. * bit-fields: Bit-Fields. (line 6)
  42673. * BITFIELD_NBYTES_LIMITED: Storage Layout. (line 428)
  42674. * BITS_BIG_ENDIAN: Storage Layout. (line 11)
  42675. * BITS_BIG_ENDIAN, effect on sign_extract: Bit-Fields. (line 8)
  42676. * BITS_PER_UNIT: Machine Modes. (line 440)
  42677. * BITS_PER_WORD: Storage Layout. (line 50)
  42678. * bitwise complement: Arithmetic. (line 154)
  42679. * bitwise exclusive-or: Arithmetic. (line 168)
  42680. * bitwise inclusive-or: Arithmetic. (line 163)
  42681. * bitwise logical-and: Arithmetic. (line 158)
  42682. * BIT_AND_EXPR: Unary and Binary Expressions.
  42683. (line 6)
  42684. * BIT_IOR_EXPR: Unary and Binary Expressions.
  42685. (line 6)
  42686. * BIT_NOT_EXPR: Unary and Binary Expressions.
  42687. (line 6)
  42688. * BIT_XOR_EXPR: Unary and Binary Expressions.
  42689. (line 6)
  42690. * BLKmode: Machine Modes. (line 185)
  42691. * BLKmode, and function return values: Calls. (line 23)
  42692. * blockage instruction pattern: Standard Names. (line 2156)
  42693. * Blocks: Blocks. (line 6)
  42694. * BLOCK_FOR_INSN, gimple_bb: Maintaining the CFG.
  42695. (line 28)
  42696. * BLOCK_REG_PADDING: Register Arguments. (line 238)
  42697. * BND32mode: Machine Modes. (line 210)
  42698. * BND64mode: Machine Modes. (line 210)
  42699. * bool: Misc. (line 958)
  42700. * BOOLEAN_TYPE: Types. (line 6)
  42701. * BOOL_TYPE_SIZE: Type Layout. (line 43)
  42702. * branch prediction: Profile information.
  42703. (line 24)
  42704. * BRANCH_COST: Costs. (line 104)
  42705. * break_out_memory_refs: Addressing Modes. (line 134)
  42706. * BREAK_STMT: Statements for C++. (line 6)
  42707. * BSS_SECTION_ASM_OP: Sections. (line 67)
  42708. * bswap: Arithmetic. (line 246)
  42709. * bswapM2 instruction pattern: Standard Names. (line 868)
  42710. * btruncM2 instruction pattern: Standard Names. (line 1078)
  42711. * build0: Macros and Functions.
  42712. (line 16)
  42713. * build1: Macros and Functions.
  42714. (line 17)
  42715. * build2: Macros and Functions.
  42716. (line 18)
  42717. * build3: Macros and Functions.
  42718. (line 19)
  42719. * build4: Macros and Functions.
  42720. (line 20)
  42721. * build5: Macros and Functions.
  42722. (line 21)
  42723. * build6: Macros and Functions.
  42724. (line 22)
  42725. * builtin_longjmp instruction pattern: Standard Names. (line 2054)
  42726. * builtin_setjmp_receiver instruction pattern: Standard Names.
  42727. (line 2044)
  42728. * builtin_setjmp_setup instruction pattern: Standard Names. (line 2033)
  42729. * BYTES_BIG_ENDIAN: Storage Layout. (line 23)
  42730. * BYTES_BIG_ENDIAN, effect on subreg: Regs and Memory. (line 229)
  42731. * byte_mode: Machine Modes. (line 458)
  42732. * C statements for assembler output: Output Statement. (line 6)
  42733. * cache: GTY Options. (line 127)
  42734. * call: Flags. (line 230)
  42735. * call <1>: Side Effects. (line 92)
  42736. * call instruction pattern: Standard Names. (line 1709)
  42737. * call usage: Calls. (line 10)
  42738. * call, in call_insn: Flags. (line 129)
  42739. * call, in mem: Flags. (line 70)
  42740. * call-clobbered register: Register Basics. (line 35)
  42741. * call-clobbered register <1>: Register Basics. (line 50)
  42742. * call-clobbered register <2>: Register Basics. (line 58)
  42743. * call-clobbered register <3>: Register Basics. (line 76)
  42744. * call-saved register: Register Basics. (line 35)
  42745. * call-saved register <1>: Register Basics. (line 50)
  42746. * call-saved register <2>: Register Basics. (line 58)
  42747. * call-saved register <3>: Register Basics. (line 76)
  42748. * call-used register: Register Basics. (line 35)
  42749. * call-used register <1>: Register Basics. (line 50)
  42750. * call-used register <2>: Register Basics. (line 58)
  42751. * call-used register <3>: Register Basics. (line 76)
  42752. * calling conventions: Stack and Calling. (line 6)
  42753. * calling functions in RTL: Calls. (line 6)
  42754. * CALL_EXPR: Unary and Binary Expressions.
  42755. (line 6)
  42756. * call_insn: Insns. (line 95)
  42757. * call_insn and /c: Flags. (line 129)
  42758. * call_insn and /f: Flags. (line 135)
  42759. * call_insn and /i: Flags. (line 120)
  42760. * call_insn and /j: Flags. (line 175)
  42761. * call_insn and /s: Flags. (line 38)
  42762. * call_insn and /s <1>: Flags. (line 162)
  42763. * call_insn and /u: Flags. (line 28)
  42764. * call_insn and /u <1>: Flags. (line 115)
  42765. * call_insn and /u or /i: Flags. (line 125)
  42766. * call_insn and /v: Flags. (line 33)
  42767. * CALL_INSN_FUNCTION_USAGE: Insns. (line 101)
  42768. * call_pop instruction pattern: Standard Names. (line 1737)
  42769. * CALL_POPS_ARGS: Stack Arguments. (line 138)
  42770. * CALL_REALLY_USED_REGISTERS: Register Basics. (line 49)
  42771. * CALL_USED_REGISTERS: Register Basics. (line 34)
  42772. * call_used_regs: Register Basics. (line 102)
  42773. * call_value instruction pattern: Standard Names. (line 1729)
  42774. * call_value_pop instruction pattern: Standard Names. (line 1737)
  42775. * canadian: Configure Terms. (line 6)
  42776. * canonicalization of instructions: Insn Canonicalizations.
  42777. (line 6)
  42778. * canonicalize_funcptr_for_compare instruction pattern: Standard Names.
  42779. (line 1888)
  42780. * can_create_pseudo_p: Standard Names. (line 75)
  42781. * can_fallthru: Basic Blocks. (line 67)
  42782. * caret: Multi-Alternative. (line 53)
  42783. * caret <1>: Guidelines for Diagnostics.
  42784. (line 159)
  42785. * casesi instruction pattern: Standard Names. (line 1830)
  42786. * CASE_VECTOR_MODE: Misc. (line 26)
  42787. * CASE_VECTOR_PC_RELATIVE: Misc. (line 39)
  42788. * CASE_VECTOR_SHORTEN_MODE: Misc. (line 30)
  42789. * cbranchMODE4 instruction pattern: Standard Names. (line 1698)
  42790. * cc0: Regs and Memory. (line 329)
  42791. * cc0 <1>: CC0 Condition Codes.
  42792. (line 6)
  42793. * cc0, RTL sharing: Sharing. (line 30)
  42794. * cc0_rtx: Regs and Memory. (line 355)
  42795. * CC1PLUS_SPEC: Driver. (line 63)
  42796. * CC1_SPEC: Driver. (line 55)
  42797. * CCmode: Machine Modes. (line 178)
  42798. * CCmode <1>: MODE_CC Condition Codes.
  42799. (line 6)
  42800. * cc_status: CC0 Condition Codes.
  42801. (line 6)
  42802. * CC_STATUS_MDEP: CC0 Condition Codes.
  42803. (line 16)
  42804. * CC_STATUS_MDEP_INIT: CC0 Condition Codes.
  42805. (line 22)
  42806. * CDImode: Machine Modes. (line 204)
  42807. * ceilM2 instruction pattern: Standard Names. (line 1097)
  42808. * CEIL_DIV_EXPR: Unary and Binary Expressions.
  42809. (line 6)
  42810. * CEIL_MOD_EXPR: Unary and Binary Expressions.
  42811. (line 6)
  42812. * CFA_FRAME_BASE_OFFSET: Frame Layout. (line 239)
  42813. * CFG verification: Maintaining the CFG.
  42814. (line 116)
  42815. * CFG, Control Flow Graph: Control Flow. (line 6)
  42816. * cfghooks.h: Maintaining the CFG.
  42817. (line 6)
  42818. * cgraph_finalize_function: Parsing pass. (line 51)
  42819. * chain_circular: GTY Options. (line 160)
  42820. * chain_next: GTY Options. (line 160)
  42821. * chain_prev: GTY Options. (line 160)
  42822. * change_address: Standard Names. (line 47)
  42823. * CHAR_TYPE_SIZE: Type Layout. (line 38)
  42824. * check_raw_ptrsM instruction pattern: Standard Names. (line 330)
  42825. * check_stack instruction pattern: Standard Names. (line 1974)
  42826. * check_war_ptrsM instruction pattern: Standard Names. (line 349)
  42827. * CHImode: Machine Modes. (line 204)
  42828. * class definitions, register: Register Classes. (line 6)
  42829. * class preference constraints: Class Preferences. (line 6)
  42830. * class, scope: Classes. (line 6)
  42831. * classes of RTX codes: RTL Classes. (line 6)
  42832. * CLASSTYPE_DECLARED_CLASS: Classes. (line 6)
  42833. * CLASSTYPE_HAS_MUTABLE: Classes. (line 82)
  42834. * CLASSTYPE_NON_POD_P: Classes. (line 87)
  42835. * CLASS_MAX_NREGS: Register Classes. (line 531)
  42836. * CLASS_TYPE_P: Types for C++. (line 63)
  42837. * Cleanups: Cleanups. (line 6)
  42838. * CLEANUP_DECL: Statements for C++. (line 6)
  42839. * CLEANUP_EXPR: Statements for C++. (line 6)
  42840. * CLEANUP_POINT_EXPR: Unary and Binary Expressions.
  42841. (line 6)
  42842. * CLEANUP_STMT: Statements for C++. (line 6)
  42843. * clear_cache instruction pattern: Standard Names. (line 2543)
  42844. * CLEAR_INSN_CACHE: Trampolines. (line 151)
  42845. * CLEAR_RATIO: Costs. (line 225)
  42846. * clobber: Side Effects. (line 106)
  42847. * clrsb: Arithmetic. (line 215)
  42848. * clrsbM2 instruction pattern: Standard Names. (line 1170)
  42849. * clz: Arithmetic. (line 222)
  42850. * clzM2 instruction pattern: Standard Names. (line 1186)
  42851. * CLZ_DEFINED_VALUE_AT_ZERO: Misc. (line 338)
  42852. * cmpmemM instruction pattern: Standard Names. (line 1389)
  42853. * cmpstrM instruction pattern: Standard Names. (line 1368)
  42854. * cmpstrnM instruction pattern: Standard Names. (line 1355)
  42855. * code generation RTL sequences: Expander Definitions.
  42856. (line 6)
  42857. * code iterators in .md files: Code Iterators. (line 6)
  42858. * codes, RTL expression: RTL Objects. (line 47)
  42859. * code_label: Insns. (line 125)
  42860. * CODE_LABEL: Basic Blocks. (line 50)
  42861. * code_label and /i: Flags. (line 48)
  42862. * code_label and /v: Flags. (line 33)
  42863. * CODE_LABEL_NUMBER: Insns. (line 125)
  42864. * COImode: Machine Modes. (line 204)
  42865. * COLLECT2_HOST_INITIALIZATION: Host Misc. (line 32)
  42866. * COLLECT_EXPORT_LIST: Misc. (line 864)
  42867. * COLLECT_SHARED_FINI_FUNC: Macros for Initialization.
  42868. (line 43)
  42869. * COLLECT_SHARED_INIT_FUNC: Macros for Initialization.
  42870. (line 32)
  42871. * command-line options, guidelines for: Guidelines for Options.
  42872. (line 6)
  42873. * commit_edge_insertions: Maintaining the CFG.
  42874. (line 104)
  42875. * compare: Arithmetic. (line 46)
  42876. * compare, canonicalization of: Insn Canonicalizations.
  42877. (line 36)
  42878. * COMPARE_MAX_PIECES: Costs. (line 220)
  42879. * comparison_operator: Machine-Independent Predicates.
  42880. (line 110)
  42881. * compiler passes and files: Passes. (line 6)
  42882. * complement, bitwise: Arithmetic. (line 154)
  42883. * COMPLEX_CST: Constant expressions.
  42884. (line 6)
  42885. * COMPLEX_EXPR: Unary and Binary Expressions.
  42886. (line 6)
  42887. * complex_mode: Machine Modes. (line 302)
  42888. * COMPLEX_TYPE: Types. (line 6)
  42889. * COMPONENT_REF: Storage References. (line 6)
  42890. * Compound Expressions: Compound Expressions.
  42891. (line 6)
  42892. * Compound Lvalues: Compound Lvalues. (line 6)
  42893. * COMPOUND_EXPR: Unary and Binary Expressions.
  42894. (line 6)
  42895. * COMPOUND_LITERAL_EXPR: Unary and Binary Expressions.
  42896. (line 6)
  42897. * COMPOUND_LITERAL_EXPR_DECL: Unary and Binary Expressions.
  42898. (line 392)
  42899. * COMPOUND_LITERAL_EXPR_DECL_EXPR: Unary and Binary Expressions.
  42900. (line 392)
  42901. * computed jump: Edges. (line 127)
  42902. * computing the length of an insn: Insn Lengths. (line 6)
  42903. * concat: Regs and Memory. (line 407)
  42904. * concatn: Regs and Memory. (line 413)
  42905. * cond: Comparisons. (line 90)
  42906. * cond and attributes: Expressions. (line 37)
  42907. * condition code register: Regs and Memory. (line 329)
  42908. * condition code status: Condition Code. (line 6)
  42909. * condition codes: Comparisons. (line 20)
  42910. * conditional execution: Conditional Execution.
  42911. (line 6)
  42912. * Conditional Expressions: Conditional Expressions.
  42913. (line 6)
  42914. * conditions, in patterns: Patterns. (line 55)
  42915. * cond_addMODE instruction pattern: Standard Names. (line 1596)
  42916. * cond_andMODE instruction pattern: Standard Names. (line 1596)
  42917. * cond_divMODE instruction pattern: Standard Names. (line 1596)
  42918. * cond_exec: Side Effects. (line 254)
  42919. * COND_EXPR: Unary and Binary Expressions.
  42920. (line 6)
  42921. * cond_fmaMODE instruction pattern: Standard Names. (line 1634)
  42922. * cond_fmsMODE instruction pattern: Standard Names. (line 1634)
  42923. * cond_fnmaMODE instruction pattern: Standard Names. (line 1634)
  42924. * cond_fnmsMODE instruction pattern: Standard Names. (line 1634)
  42925. * cond_iorMODE instruction pattern: Standard Names. (line 1596)
  42926. * cond_modMODE instruction pattern: Standard Names. (line 1596)
  42927. * cond_mulMODE instruction pattern: Standard Names. (line 1596)
  42928. * cond_smaxMODE instruction pattern: Standard Names. (line 1596)
  42929. * cond_sminMODE instruction pattern: Standard Names. (line 1596)
  42930. * cond_subMODE instruction pattern: Standard Names. (line 1596)
  42931. * cond_udivMODE instruction pattern: Standard Names. (line 1596)
  42932. * cond_umaxMODE instruction pattern: Standard Names. (line 1596)
  42933. * cond_uminMODE instruction pattern: Standard Names. (line 1596)
  42934. * cond_umodMODE instruction pattern: Standard Names. (line 1596)
  42935. * cond_xorMODE instruction pattern: Standard Names. (line 1596)
  42936. * configuration file: Filesystem. (line 6)
  42937. * configuration file <1>: Host Misc. (line 6)
  42938. * configure terms: Configure Terms. (line 6)
  42939. * CONJ_EXPR: Unary and Binary Expressions.
  42940. (line 6)
  42941. * const: Constants. (line 212)
  42942. * const0_rtx: Constants. (line 21)
  42943. * CONST0_RTX: Constants. (line 230)
  42944. * const1_rtx: Constants. (line 21)
  42945. * CONST1_RTX: Constants. (line 230)
  42946. * const2_rtx: Constants. (line 21)
  42947. * CONST2_RTX: Constants. (line 230)
  42948. * constant attributes: Constant Attributes.
  42949. (line 6)
  42950. * constant definitions: Constant Definitions.
  42951. (line 6)
  42952. * constants in constraints: Simple Constraints. (line 68)
  42953. * CONSTANT_ADDRESS_P: Addressing Modes. (line 28)
  42954. * CONSTANT_P: Addressing Modes. (line 35)
  42955. * CONSTANT_POOL_ADDRESS_P: Flags. (line 19)
  42956. * CONSTANT_POOL_BEFORE_FUNCTION: Data Output. (line 74)
  42957. * constm1_rtx: Constants. (line 21)
  42958. * constraint modifier characters: Modifiers. (line 6)
  42959. * constraint, matching: Simple Constraints. (line 140)
  42960. * constraints: Constraints. (line 6)
  42961. * constraints, defining: Define Constraints. (line 6)
  42962. * constraints, machine specific: Machine Constraints.
  42963. (line 6)
  42964. * constraints, testing: C Constraint Interface.
  42965. (line 6)
  42966. * constraint_num: C Constraint Interface.
  42967. (line 30)
  42968. * constraint_satisfied_p: C Constraint Interface.
  42969. (line 42)
  42970. * CONSTRUCTOR: Unary and Binary Expressions.
  42971. (line 6)
  42972. * constructors, automatic calls: Collect2. (line 15)
  42973. * constructors, output of: Initialization. (line 6)
  42974. * CONST_DECL: Declarations. (line 6)
  42975. * const_double: Constants. (line 37)
  42976. * const_double, RTL sharing: Sharing. (line 32)
  42977. * CONST_DOUBLE_LOW: Constants. (line 54)
  42978. * const_double_operand: Machine-Independent Predicates.
  42979. (line 20)
  42980. * const_fixed: Constants. (line 93)
  42981. * const_int: Constants. (line 8)
  42982. * const_int and attribute tests: Expressions. (line 47)
  42983. * const_int and attributes: Expressions. (line 10)
  42984. * const_int, RTL sharing: Sharing. (line 23)
  42985. * const_int_operand: Machine-Independent Predicates.
  42986. (line 15)
  42987. * const_poly_int: Constants. (line 100)
  42988. * const_poly_int, RTL sharing: Sharing. (line 25)
  42989. * const_string: Constants. (line 184)
  42990. * const_string and attributes: Expressions. (line 20)
  42991. * const_true_rtx: Constants. (line 31)
  42992. * const_vector: Constants. (line 107)
  42993. * const_vector, RTL sharing: Sharing. (line 35)
  42994. * CONST_WIDE_INT: Constants. (line 67)
  42995. * CONST_WIDE_INT_ELT: Constants. (line 89)
  42996. * CONST_WIDE_INT_NUNITS: Constants. (line 84)
  42997. * CONST_WIDE_INT_VEC: Constants. (line 80)
  42998. * container: Containers. (line 6)
  42999. * CONTINUE_STMT: Statements for C++. (line 6)
  43000. * contributors: Contributors. (line 6)
  43001. * controlling register usage: Register Basics. (line 116)
  43002. * controlling the compilation driver: Driver. (line 6)
  43003. * conventions, run-time: Interface. (line 6)
  43004. * conversions: Conversions. (line 6)
  43005. * CONVERT_EXPR: Unary and Binary Expressions.
  43006. (line 6)
  43007. * copysignM3 instruction pattern: Standard Names. (line 1142)
  43008. * copy_rtx: Addressing Modes. (line 189)
  43009. * copy_rtx_if_shared: Sharing. (line 67)
  43010. * cosM2 instruction pattern: Standard Names. (line 931)
  43011. * costs of instructions: Costs. (line 6)
  43012. * CPLUSPLUS_CPP_SPEC: Driver. (line 50)
  43013. * CPP_SPEC: Driver. (line 43)
  43014. * CPSImode: Machine Modes. (line 204)
  43015. * cpymemM instruction pattern: Standard Names. (line 1244)
  43016. * CP_INTEGRAL_TYPE: Types for C++. (line 55)
  43017. * cp_namespace_decls: Namespaces. (line 49)
  43018. * CP_TYPE_CONST_NON_VOLATILE_P: Types for C++. (line 33)
  43019. * CP_TYPE_CONST_P: Types for C++. (line 24)
  43020. * cp_type_quals: Types for C++. (line 6)
  43021. * cp_type_quals <1>: Types for C++. (line 16)
  43022. * CP_TYPE_RESTRICT_P: Types for C++. (line 30)
  43023. * CP_TYPE_VOLATILE_P: Types for C++. (line 27)
  43024. * CQImode: Machine Modes. (line 204)
  43025. * cross compilation and floating point: Floating Point. (line 6)
  43026. * CROSSING_JUMP_P: Flags. (line 10)
  43027. * crtl->args.pops_args: Function Entry. (line 111)
  43028. * crtl->args.pretend_args_size: Function Entry. (line 117)
  43029. * crtl->outgoing_args_size: Stack Arguments. (line 48)
  43030. * CRTSTUFF_T_CFLAGS: Target Fragment. (line 15)
  43031. * CRTSTUFF_T_CFLAGS_S: Target Fragment. (line 19)
  43032. * CRT_CALL_STATIC_FUNCTION: Sections. (line 125)
  43033. * CSImode: Machine Modes. (line 204)
  43034. * cstoreMODE4 instruction pattern: Standard Names. (line 1659)
  43035. * CTImode: Machine Modes. (line 204)
  43036. * ctrapMM4 instruction pattern: Standard Names. (line 2125)
  43037. * ctz: Arithmetic. (line 230)
  43038. * ctzM2 instruction pattern: Standard Names. (line 1201)
  43039. * CTZ_DEFINED_VALUE_AT_ZERO: Misc. (line 339)
  43040. * CUMULATIVE_ARGS: Register Arguments. (line 137)
  43041. * current_function_is_leaf: Leaf Functions. (line 50)
  43042. * current_function_uses_only_leaf_regs: Leaf Functions. (line 50)
  43043. * current_insn_predicate: Conditional Execution.
  43044. (line 27)
  43045. * C_COMMON_OVERRIDE_OPTIONS: Run-time Target. (line 136)
  43046. * c_register_pragma: Misc. (line 440)
  43047. * c_register_pragma_with_expansion: Misc. (line 442)
  43048. * DAmode: Machine Modes. (line 154)
  43049. * data bypass: Processor pipeline description.
  43050. (line 105)
  43051. * data bypass <1>: Processor pipeline description.
  43052. (line 196)
  43053. * data dependence delays: Processor pipeline description.
  43054. (line 6)
  43055. * Data Dependency Analysis: Dependency analysis.
  43056. (line 6)
  43057. * data structures: Per-Function Data. (line 6)
  43058. * DATA_ABI_ALIGNMENT: Storage Layout. (line 263)
  43059. * DATA_ALIGNMENT: Storage Layout. (line 250)
  43060. * DATA_SECTION_ASM_OP: Sections. (line 52)
  43061. * DBR_OUTPUT_SEQEND: Instruction Output. (line 133)
  43062. * dbr_sequence_length: Instruction Output. (line 133)
  43063. * DBX_BLOCKS_FUNCTION_RELATIVE: DBX Options. (line 100)
  43064. * DBX_CONTIN_CHAR: DBX Options. (line 63)
  43065. * DBX_CONTIN_LENGTH: DBX Options. (line 53)
  43066. * DBX_DEBUGGING_INFO: DBX Options. (line 8)
  43067. * DBX_FUNCTION_FIRST: DBX Options. (line 94)
  43068. * DBX_LINES_FUNCTION_RELATIVE: DBX Options. (line 106)
  43069. * DBX_NO_XREFS: DBX Options. (line 47)
  43070. * DBX_OUTPUT_MAIN_SOURCE_FILENAME: File Names and DBX. (line 8)
  43071. * DBX_OUTPUT_MAIN_SOURCE_FILE_END: File Names and DBX. (line 33)
  43072. * DBX_OUTPUT_NULL_N_SO_AT_MAIN_SOURCE_FILE_END: File Names and DBX.
  43073. (line 41)
  43074. * DBX_OUTPUT_SOURCE_LINE: DBX Hooks. (line 8)
  43075. * DBX_REGISTER_NUMBER: All Debuggers. (line 8)
  43076. * DBX_REGPARM_STABS_CODE: DBX Options. (line 84)
  43077. * DBX_REGPARM_STABS_LETTER: DBX Options. (line 89)
  43078. * DBX_STATIC_CONST_VAR_CODE: DBX Options. (line 79)
  43079. * DBX_STATIC_STAB_DATA_SECTION: DBX Options. (line 70)
  43080. * DBX_TYPE_DECL_STABS_CODE: DBX Options. (line 75)
  43081. * DBX_USE_BINCL: DBX Options. (line 112)
  43082. * DCmode: Machine Modes. (line 199)
  43083. * DDmode: Machine Modes. (line 93)
  43084. * De Morgan's law: Insn Canonicalizations.
  43085. (line 67)
  43086. * dead_or_set_p: define_peephole. (line 65)
  43087. * DEBUGGER_ARG_OFFSET: All Debuggers. (line 35)
  43088. * DEBUGGER_AUTO_OFFSET: All Debuggers. (line 27)
  43089. * debug_expr: Debug Information. (line 22)
  43090. * DEBUG_EXPR_DECL: Declarations. (line 6)
  43091. * debug_implicit_ptr: Debug Information. (line 27)
  43092. * debug_insn: Insns. (line 247)
  43093. * debug_marker: Debug Information. (line 37)
  43094. * debug_parameter_ref: Debug Information. (line 34)
  43095. * DEBUG_SYMS_TEXT: DBX Options. (line 24)
  43096. * decimal float library: Decimal float library routines.
  43097. (line 6)
  43098. * declaration: Declarations. (line 6)
  43099. * declarations, RTL: RTL Declarations. (line 6)
  43100. * DECLARE_LIBRARY_RENAMES: Library Calls. (line 8)
  43101. * DECL_ALIGN: Declarations. (line 6)
  43102. * DECL_ANTICIPATED: Functions for C++. (line 42)
  43103. * DECL_ARGUMENTS: Function Basics. (line 36)
  43104. * DECL_ARRAY_DELETE_OPERATOR_P: Functions for C++. (line 158)
  43105. * DECL_ARTIFICIAL: Working with declarations.
  43106. (line 24)
  43107. * DECL_ARTIFICIAL <1>: Function Basics. (line 6)
  43108. * DECL_ARTIFICIAL <2>: Function Properties.
  43109. (line 47)
  43110. * DECL_ASSEMBLER_NAME: Function Basics. (line 6)
  43111. * DECL_ASSEMBLER_NAME <1>: Function Basics. (line 19)
  43112. * DECL_ATTRIBUTES: Attributes. (line 21)
  43113. * DECL_BASE_CONSTRUCTOR_P: Functions for C++. (line 88)
  43114. * DECL_COMPLETE_CONSTRUCTOR_P: Functions for C++. (line 84)
  43115. * DECL_COMPLETE_DESTRUCTOR_P: Functions for C++. (line 98)
  43116. * DECL_CONSTRUCTOR_P: Functions for C++. (line 77)
  43117. * DECL_CONST_MEMFUNC_P: Functions for C++. (line 71)
  43118. * DECL_CONTEXT: Namespaces. (line 31)
  43119. * DECL_CONV_FN_P: Functions for C++. (line 105)
  43120. * DECL_COPY_CONSTRUCTOR_P: Functions for C++. (line 92)
  43121. * DECL_DESTRUCTOR_P: Functions for C++. (line 95)
  43122. * DECL_EXTERNAL: Declarations. (line 6)
  43123. * DECL_EXTERNAL <1>: Function Properties.
  43124. (line 25)
  43125. * DECL_EXTERN_C_FUNCTION_P: Functions for C++. (line 46)
  43126. * DECL_FUNCTION_MEMBER_P: Functions for C++. (line 61)
  43127. * DECL_FUNCTION_SPECIFIC_OPTIMIZATION: Function Basics. (line 6)
  43128. * DECL_FUNCTION_SPECIFIC_OPTIMIZATION <1>: Function Properties.
  43129. (line 61)
  43130. * DECL_FUNCTION_SPECIFIC_TARGET: Function Basics. (line 6)
  43131. * DECL_FUNCTION_SPECIFIC_TARGET <1>: Function Properties.
  43132. (line 55)
  43133. * DECL_GLOBAL_CTOR_P: Functions for C++. (line 108)
  43134. * DECL_GLOBAL_DTOR_P: Functions for C++. (line 112)
  43135. * DECL_INITIAL: Declarations. (line 6)
  43136. * DECL_INITIAL <1>: Function Basics. (line 51)
  43137. * DECL_LINKONCE_P: Functions for C++. (line 50)
  43138. * DECL_LOCAL_FUNCTION_P: Functions for C++. (line 38)
  43139. * DECL_MAIN_P: Functions for C++. (line 34)
  43140. * DECL_NAME: Working with declarations.
  43141. (line 7)
  43142. * DECL_NAME <1>: Function Basics. (line 6)
  43143. * DECL_NAME <2>: Function Basics. (line 9)
  43144. * DECL_NAME <3>: Namespaces. (line 20)
  43145. * DECL_NAMESPACE_ALIAS: Namespaces. (line 35)
  43146. * DECL_NAMESPACE_STD_P: Namespaces. (line 45)
  43147. * DECL_NONCONVERTING_P: Functions for C++. (line 80)
  43148. * DECL_NONSTATIC_MEMBER_FUNCTION_P: Functions for C++. (line 68)
  43149. * DECL_NON_THUNK_FUNCTION_P: Functions for C++. (line 138)
  43150. * DECL_OVERLOADED_OPERATOR_P: Functions for C++. (line 102)
  43151. * DECL_PURE_P: Function Properties.
  43152. (line 40)
  43153. * DECL_RESULT: Function Basics. (line 41)
  43154. * DECL_SAVED_TREE: Function Basics. (line 44)
  43155. * DECL_SIZE: Declarations. (line 6)
  43156. * DECL_STATIC_FUNCTION_P: Functions for C++. (line 65)
  43157. * DECL_STMT: Statements for C++. (line 6)
  43158. * DECL_STMT_DECL: Statements for C++. (line 6)
  43159. * DECL_THUNK_P: Functions for C++. (line 116)
  43160. * DECL_VIRTUAL_P: Function Properties.
  43161. (line 44)
  43162. * DECL_VOLATILE_MEMFUNC_P: Functions for C++. (line 74)
  43163. * default: GTY Options. (line 90)
  43164. * default_file_start: File Framework. (line 8)
  43165. * DEFAULT_GDB_EXTENSIONS: DBX Options. (line 17)
  43166. * DEFAULT_INCOMING_FRAME_SP_OFFSET: Frame Layout. (line 199)
  43167. * DEFAULT_PCC_STRUCT_RETURN: Aggregate Return. (line 34)
  43168. * DEFAULT_SIGNED_CHAR: Type Layout. (line 117)
  43169. * define_address_constraint: Define Constraints. (line 113)
  43170. * define_asm_attributes: Tagging Insns. (line 73)
  43171. * define_attr: Defining Attributes.
  43172. (line 6)
  43173. * define_automaton: Processor pipeline description.
  43174. (line 53)
  43175. * define_bypass: Processor pipeline description.
  43176. (line 196)
  43177. * define_code_attr: Code Iterators. (line 6)
  43178. * define_code_iterator: Code Iterators. (line 6)
  43179. * define_cond_exec: Conditional Execution.
  43180. (line 13)
  43181. * define_constants: Constant Definitions.
  43182. (line 6)
  43183. * define_constraint: Define Constraints. (line 45)
  43184. * define_cpu_unit: Processor pipeline description.
  43185. (line 68)
  43186. * define_c_enum: Constant Definitions.
  43187. (line 49)
  43188. * define_delay: Delay Slots. (line 25)
  43189. * define_enum: Constant Definitions.
  43190. (line 118)
  43191. * define_enum_attr: Defining Attributes.
  43192. (line 83)
  43193. * define_enum_attr <1>: Constant Definitions.
  43194. (line 136)
  43195. * define_expand: Expander Definitions.
  43196. (line 11)
  43197. * define_insn: Patterns. (line 6)
  43198. * define_insn example: Example. (line 6)
  43199. * define_insn_and_rewrite: Insn Splitting. (line 236)
  43200. * define_insn_and_split: Insn Splitting. (line 190)
  43201. * define_insn_reservation: Processor pipeline description.
  43202. (line 105)
  43203. * define_int_attr: Int Iterators. (line 6)
  43204. * define_int_iterator: Int Iterators. (line 6)
  43205. * define_memory_constraint: Define Constraints. (line 80)
  43206. * define_mode_attr: Substitutions. (line 6)
  43207. * define_mode_iterator: Defining Mode Iterators.
  43208. (line 6)
  43209. * define_peephole: define_peephole. (line 6)
  43210. * define_peephole2: define_peephole2. (line 6)
  43211. * define_predicate: Defining Predicates.
  43212. (line 6)
  43213. * define_query_cpu_unit: Processor pipeline description.
  43214. (line 90)
  43215. * define_register_constraint: Define Constraints. (line 26)
  43216. * define_reservation: Processor pipeline description.
  43217. (line 185)
  43218. * define_special_memory_constraint: Define Constraints. (line 99)
  43219. * define_special_predicate: Defining Predicates.
  43220. (line 6)
  43221. * define_split: Insn Splitting. (line 32)
  43222. * define_subst: Define Subst. (line 6)
  43223. * define_subst <1>: Define Subst Example.
  43224. (line 6)
  43225. * define_subst <2>: Define Subst Pattern Matching.
  43226. (line 6)
  43227. * define_subst <3>: Define Subst Output Template.
  43228. (line 6)
  43229. * define_subst <4>: Define Subst. (line 14)
  43230. * define_subst <5>: Subst Iterators. (line 6)
  43231. * define_subst_attr: Subst Iterators. (line 6)
  43232. * define_subst_attr <1>: Subst Iterators. (line 26)
  43233. * defining attributes and their values: Defining Attributes.
  43234. (line 6)
  43235. * defining constraints: Define Constraints. (line 6)
  43236. * defining jump instruction patterns: Jump Patterns. (line 6)
  43237. * defining looping instruction patterns: Looping Patterns. (line 6)
  43238. * defining peephole optimizers: Peephole Definitions.
  43239. (line 6)
  43240. * defining predicates: Defining Predicates.
  43241. (line 6)
  43242. * defining RTL sequences for code generation: Expander Definitions.
  43243. (line 6)
  43244. * delay slots, defining: Delay Slots. (line 6)
  43245. * deletable: GTY Options. (line 134)
  43246. * DELETE_IF_ORDINARY: Filesystem. (line 79)
  43247. * Dependent Patterns: Dependent Patterns. (line 6)
  43248. * desc: GTY Options. (line 90)
  43249. * descriptors for nested functions: Trampolines. (line 6)
  43250. * destructors, output of: Initialization. (line 6)
  43251. * deterministic finite state automaton: Processor pipeline description.
  43252. (line 6)
  43253. * deterministic finite state automaton <1>: Processor pipeline description.
  43254. (line 304)
  43255. * DFmode: Machine Modes. (line 76)
  43256. * diagnostics guidelines, fix-it hints: Guidelines for Diagnostics.
  43257. (line 320)
  43258. * diagnostics, actionable: Guidelines for Diagnostics.
  43259. (line 15)
  43260. * diagnostics, false positive: Guidelines for Diagnostics.
  43261. (line 39)
  43262. * diagnostics, guidelines for: Guidelines for Diagnostics.
  43263. (line 5)
  43264. * diagnostics, locations: Guidelines for Diagnostics.
  43265. (line 159)
  43266. * diagnostics, true positive: Guidelines for Diagnostics.
  43267. (line 39)
  43268. * digits in constraint: Simple Constraints. (line 128)
  43269. * DImode: Machine Modes. (line 45)
  43270. * directory options .md: Including Patterns. (line 47)
  43271. * DIR_SEPARATOR: Filesystem. (line 18)
  43272. * DIR_SEPARATOR_2: Filesystem. (line 19)
  43273. * disabling certain registers: Register Basics. (line 116)
  43274. * dispatch table: Dispatch Tables. (line 8)
  43275. * div: Arithmetic. (line 116)
  43276. * div and attributes: Expressions. (line 83)
  43277. * division: Arithmetic. (line 116)
  43278. * division <1>: Arithmetic. (line 130)
  43279. * division <2>: Arithmetic. (line 136)
  43280. * divM3 instruction pattern: Standard Names. (line 442)
  43281. * divmodM4 instruction pattern: Standard Names. (line 808)
  43282. * dollar sign: Multi-Alternative. (line 57)
  43283. * DOLLARS_IN_IDENTIFIERS: Misc. (line 485)
  43284. * doloop_begin instruction pattern: Standard Names. (line 1879)
  43285. * doloop_end instruction pattern: Standard Names. (line 1867)
  43286. * DONE: Expander Definitions.
  43287. (line 77)
  43288. * DONE <1>: Insn Splitting. (line 61)
  43289. * DONE <2>: define_peephole2. (line 76)
  43290. * DONT_USE_BUILTIN_SETJMP: Exception Region Output.
  43291. (line 78)
  43292. * DOUBLE_TYPE_SIZE: Type Layout. (line 52)
  43293. * DO_BODY: Statements for C++. (line 6)
  43294. * DO_COND: Statements for C++. (line 6)
  43295. * DO_STMT: Statements for C++. (line 6)
  43296. * DQmode: Machine Modes. (line 118)
  43297. * driver: Driver. (line 6)
  43298. * DRIVER_SELF_SPECS: Driver. (line 8)
  43299. * dump examples: Dump examples. (line 6)
  43300. * dump setup: Dump setup. (line 6)
  43301. * dump types: Dump types. (line 6)
  43302. * dump verbosity: Dump output verbosity.
  43303. (line 6)
  43304. * DUMPFILE_FORMAT: Filesystem. (line 67)
  43305. * dump_basic_block: Dump types. (line 29)
  43306. * dump_generic_expr: Dump types. (line 31)
  43307. * dump_gimple_stmt: Dump types. (line 33)
  43308. * dump_printf: Dump types. (line 6)
  43309. * DWARF2_ASM_LINE_DEBUG_INFO: DWARF. (line 45)
  43310. * DWARF2_ASM_VIEW_DEBUG_INFO: DWARF. (line 51)
  43311. * DWARF2_DEBUGGING_INFO: DWARF. (line 8)
  43312. * DWARF2_FRAME_INFO: DWARF. (line 25)
  43313. * DWARF2_FRAME_REG_OUT: Frame Registers. (line 149)
  43314. * DWARF2_UNWIND_INFO: Exception Region Output.
  43315. (line 39)
  43316. * DWARF_ALT_FRAME_RETURN_COLUMN: Frame Layout. (line 146)
  43317. * DWARF_CIE_DATA_ALIGNMENT: Exception Region Output.
  43318. (line 90)
  43319. * DWARF_FRAME_REGISTERS: Frame Registers. (line 109)
  43320. * DWARF_FRAME_REGNUM: Frame Registers. (line 141)
  43321. * DWARF_LAZY_REGISTER_VALUE: Frame Registers. (line 170)
  43322. * DWARF_REG_TO_UNWIND_COLUMN: Frame Registers. (line 134)
  43323. * DWARF_ZERO_REG: Frame Layout. (line 157)
  43324. * DYNAMIC_CHAIN_ADDRESS: Frame Layout. (line 84)
  43325. * E in constraint: Simple Constraints. (line 87)
  43326. * earlyclobber operand: Modifiers. (line 25)
  43327. * edge: Edges. (line 6)
  43328. * edge in the flow graph: Edges. (line 6)
  43329. * edge iterators: Edges. (line 15)
  43330. * edge splitting: Maintaining the CFG.
  43331. (line 104)
  43332. * EDGE_ABNORMAL: Edges. (line 127)
  43333. * EDGE_ABNORMAL, EDGE_ABNORMAL_CALL: Edges. (line 171)
  43334. * EDGE_ABNORMAL, EDGE_EH: Edges. (line 95)
  43335. * EDGE_ABNORMAL, EDGE_SIBCALL: Edges. (line 121)
  43336. * EDGE_FALLTHRU, force_nonfallthru: Edges. (line 85)
  43337. * EDOM, implicit usage: Library Calls. (line 59)
  43338. * EH_FRAME_SECTION_NAME: Exception Region Output.
  43339. (line 9)
  43340. * EH_FRAME_THROUGH_COLLECT2: Exception Region Output.
  43341. (line 19)
  43342. * eh_return instruction pattern: Standard Names. (line 2060)
  43343. * EH_RETURN_DATA_REGNO: Exception Handling. (line 6)
  43344. * EH_RETURN_HANDLER_RTX: Exception Handling. (line 38)
  43345. * EH_RETURN_STACKADJ_RTX: Exception Handling. (line 21)
  43346. * EH_TABLES_CAN_BE_READ_ONLY: Exception Region Output.
  43347. (line 29)
  43348. * EH_USES: Function Entry. (line 162)
  43349. * ei_edge: Edges. (line 43)
  43350. * ei_end_p: Edges. (line 27)
  43351. * ei_last: Edges. (line 23)
  43352. * ei_next: Edges. (line 35)
  43353. * ei_one_before_end_p: Edges. (line 31)
  43354. * ei_prev: Edges. (line 39)
  43355. * ei_safe_safe: Edges. (line 47)
  43356. * ei_start: Edges. (line 19)
  43357. * ELIMINABLE_REGS: Elimination. (line 34)
  43358. * ELSE_CLAUSE: Statements for C++. (line 6)
  43359. * Embedded C: Fixed-point fractional library routines.
  43360. (line 6)
  43361. * Empty Statements: Empty Statements. (line 6)
  43362. * EMPTY_CLASS_EXPR: Statements for C++. (line 6)
  43363. * EMPTY_FIELD_BOUNDARY: Storage Layout. (line 341)
  43364. * Emulated TLS: Emulated TLS. (line 6)
  43365. * enabled: Disable Insn Alternatives.
  43366. (line 6)
  43367. * ENDFILE_SPEC: Driver. (line 155)
  43368. * endianness: Portability. (line 20)
  43369. * ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR: Basic Blocks. (line 10)
  43370. * entry_value: Debug Information. (line 30)
  43371. * enum reg_class: Register Classes. (line 70)
  43372. * ENUMERAL_TYPE: Types. (line 6)
  43373. * enumerations: Constant Definitions.
  43374. (line 49)
  43375. * epilogue: Function Entry. (line 6)
  43376. * epilogue instruction pattern: Standard Names. (line 2098)
  43377. * EPILOGUE_USES: Function Entry. (line 156)
  43378. * eq: Comparisons. (line 52)
  43379. * eq and attributes: Expressions. (line 83)
  43380. * equal: Comparisons. (line 52)
  43381. * eq_attr: Expressions. (line 104)
  43382. * EQ_EXPR: Unary and Binary Expressions.
  43383. (line 6)
  43384. * errno, implicit usage: Library Calls. (line 71)
  43385. * EXACT_DIV_EXPR: Unary and Binary Expressions.
  43386. (line 6)
  43387. * examining SSA_NAMEs: SSA. (line 182)
  43388. * exception handling: Edges. (line 95)
  43389. * exception handling <1>: Exception Handling. (line 6)
  43390. * exception_receiver instruction pattern: Standard Names. (line 2025)
  43391. * exclamation point: Multi-Alternative. (line 48)
  43392. * exclusion_set: Processor pipeline description.
  43393. (line 223)
  43394. * exclusive-or, bitwise: Arithmetic. (line 168)
  43395. * EXIT_EXPR: Unary and Binary Expressions.
  43396. (line 6)
  43397. * EXIT_IGNORE_STACK: Function Entry. (line 144)
  43398. * exp10M2 instruction pattern: Standard Names. (line 995)
  43399. * exp2M2 instruction pattern: Standard Names. (line 1002)
  43400. * expander definitions: Expander Definitions.
  43401. (line 6)
  43402. * expm1M2 instruction pattern: Standard Names. (line 985)
  43403. * expM2 instruction pattern: Standard Names. (line 978)
  43404. * expression: Expression trees. (line 6)
  43405. * expression codes: RTL Objects. (line 47)
  43406. * EXPR_FILENAME: Working with declarations.
  43407. (line 14)
  43408. * EXPR_LINENO: Working with declarations.
  43409. (line 20)
  43410. * expr_list: Insns. (line 568)
  43411. * EXPR_STMT: Statements for C++. (line 6)
  43412. * EXPR_STMT_EXPR: Statements for C++. (line 6)
  43413. * extendMN2 instruction pattern: Standard Names. (line 1447)
  43414. * extensible constraints: Simple Constraints. (line 171)
  43415. * extract_last_M instruction pattern: Standard Names. (line 543)
  43416. * EXTRA_SPECS: Driver. (line 182)
  43417. * extv instruction pattern: Standard Names. (line 1538)
  43418. * extvM instruction pattern: Standard Names. (line 1483)
  43419. * extvmisalignM instruction pattern: Standard Names. (line 1493)
  43420. * extzv instruction pattern: Standard Names. (line 1556)
  43421. * extzvM instruction pattern: Standard Names. (line 1507)
  43422. * extzvmisalignM instruction pattern: Standard Names. (line 1510)
  43423. * F in constraint: Simple Constraints. (line 92)
  43424. * FAIL: Expander Definitions.
  43425. (line 83)
  43426. * FAIL <1>: Insn Splitting. (line 68)
  43427. * FAIL <2>: define_peephole2. (line 83)
  43428. * fall-thru: Edges. (line 68)
  43429. * false positive: Guidelines for Diagnostics.
  43430. (line 39)
  43431. * FATAL_EXIT_CODE: Host Misc. (line 6)
  43432. * FDL, GNU Free Documentation License: GNU Free Documentation License.
  43433. (line 6)
  43434. * features, optional, in system conventions: Run-time Target.
  43435. (line 59)
  43436. * ffs: Arithmetic. (line 210)
  43437. * ffsM2 instruction pattern: Standard Names. (line 1157)
  43438. * FIELD_DECL: Declarations. (line 6)
  43439. * files and passes of the compiler: Passes. (line 6)
  43440. * files, generated: Files. (line 6)
  43441. * file_end_indicate_exec_stack: File Framework. (line 39)
  43442. * final_absence_set: Processor pipeline description.
  43443. (line 223)
  43444. * FINAL_PRESCAN_INSN: Instruction Output. (line 60)
  43445. * final_presence_set: Processor pipeline description.
  43446. (line 223)
  43447. * final_sequence: Instruction Output. (line 144)
  43448. * FIND_BASE_TERM: Addressing Modes. (line 117)
  43449. * finite state automaton minimization: Processor pipeline description.
  43450. (line 304)
  43451. * FINI_ARRAY_SECTION_ASM_OP: Sections. (line 113)
  43452. * FINI_SECTION_ASM_OP: Sections. (line 98)
  43453. * FIRST_PARM_OFFSET: Frame Layout. (line 59)
  43454. * FIRST_PARM_OFFSET and virtual registers: Regs and Memory. (line 65)
  43455. * FIRST_PSEUDO_REGISTER: Register Basics. (line 8)
  43456. * FIRST_STACK_REG: Stack Registers. (line 26)
  43457. * FIRST_VIRTUAL_REGISTER: Regs and Memory. (line 51)
  43458. * fix: Conversions. (line 66)
  43459. * fix-it hints: Guidelines for Diagnostics.
  43460. (line 320)
  43461. * fixed register: Register Basics. (line 15)
  43462. * fixed-point fractional library: Fixed-point fractional library routines.
  43463. (line 6)
  43464. * FIXED_CONVERT_EXPR: Unary and Binary Expressions.
  43465. (line 6)
  43466. * FIXED_CST: Constant expressions.
  43467. (line 6)
  43468. * FIXED_POINT_TYPE: Types. (line 6)
  43469. * FIXED_REGISTERS: Register Basics. (line 14)
  43470. * fixed_regs: Register Basics. (line 102)
  43471. * fixed_size_mode: Machine Modes. (line 305)
  43472. * fixMN2 instruction pattern: Standard Names. (line 1414)
  43473. * fixunsMN2 instruction pattern: Standard Names. (line 1423)
  43474. * fixuns_truncMN2 instruction pattern: Standard Names. (line 1438)
  43475. * fix_truncMN2 instruction pattern: Standard Names. (line 1434)
  43476. * FIX_TRUNC_EXPR: Unary and Binary Expressions.
  43477. (line 6)
  43478. * flags in RTL expression: Flags. (line 6)
  43479. * float: Conversions. (line 58)
  43480. * floating point and cross compilation: Floating Point. (line 6)
  43481. * floatMN2 instruction pattern: Standard Names. (line 1406)
  43482. * floatunsMN2 instruction pattern: Standard Names. (line 1410)
  43483. * FLOAT_EXPR: Unary and Binary Expressions.
  43484. (line 6)
  43485. * float_extend: Conversions. (line 33)
  43486. * FLOAT_LIB_COMPARE_RETURNS_BOOL: Library Calls. (line 32)
  43487. * FLOAT_STORE_FLAG_VALUE: Misc. (line 320)
  43488. * float_truncate: Conversions. (line 53)
  43489. * FLOAT_TYPE_SIZE: Type Layout. (line 48)
  43490. * FLOAT_WORDS_BIG_ENDIAN: Storage Layout. (line 41)
  43491. * FLOAT_WORDS_BIG_ENDIAN, (lack of) effect on subreg: Regs and Memory.
  43492. (line 234)
  43493. * floorM2 instruction pattern: Standard Names. (line 1069)
  43494. * FLOOR_DIV_EXPR: Unary and Binary Expressions.
  43495. (line 6)
  43496. * FLOOR_MOD_EXPR: Unary and Binary Expressions.
  43497. (line 6)
  43498. * flow-insensitive alias analysis: Alias analysis. (line 6)
  43499. * flow-sensitive alias analysis: Alias analysis. (line 6)
  43500. * fma: Arithmetic. (line 112)
  43501. * fmaM4 instruction pattern: Standard Names. (line 478)
  43502. * fmaxM3 instruction pattern: Standard Names. (line 509)
  43503. * fminM3 instruction pattern: Standard Names. (line 509)
  43504. * fmodM3 instruction pattern: Standard Names. (line 901)
  43505. * fmsM4 instruction pattern: Standard Names. (line 485)
  43506. * fnmaM4 instruction pattern: Standard Names. (line 491)
  43507. * fnmsM4 instruction pattern: Standard Names. (line 497)
  43508. * fold_extract_last_M instruction pattern: Standard Names. (line 550)
  43509. * fold_left_plus_M instruction pattern: Standard Names. (line 558)
  43510. * FORCE_CODE_SECTION_ALIGN: Sections. (line 149)
  43511. * force_reg: Standard Names. (line 36)
  43512. * FOR_BODY: Statements for C++. (line 6)
  43513. * FOR_COND: Statements for C++. (line 6)
  43514. * FOR_EXPR: Statements for C++. (line 6)
  43515. * FOR_INIT_STMT: Statements for C++. (line 6)
  43516. * FOR_STMT: Statements for C++. (line 6)
  43517. * for_user: GTY Options. (line 82)
  43518. * fractional types: Fixed-point fractional library routines.
  43519. (line 6)
  43520. * fractMN2 instruction pattern: Standard Names. (line 1456)
  43521. * fractunsMN2 instruction pattern: Standard Names. (line 1471)
  43522. * fract_convert: Conversions. (line 82)
  43523. * FRACT_TYPE_SIZE: Type Layout. (line 67)
  43524. * frame layout: Frame Layout. (line 6)
  43525. * FRAME_ADDR_RTX: Frame Layout. (line 108)
  43526. * FRAME_GROWS_DOWNWARD: Frame Layout. (line 26)
  43527. * FRAME_GROWS_DOWNWARD and virtual registers: Regs and Memory.
  43528. (line 69)
  43529. * FRAME_POINTER_CFA_OFFSET: Frame Layout. (line 225)
  43530. * frame_pointer_needed: Function Entry. (line 42)
  43531. * FRAME_POINTER_REGNUM: Frame Registers. (line 13)
  43532. * FRAME_POINTER_REGNUM and virtual registers: Regs and Memory.
  43533. (line 74)
  43534. * frame_pointer_rtx: Frame Registers. (line 104)
  43535. * frame_related: Flags. (line 238)
  43536. * frame_related, in insn, call_insn, jump_insn, barrier, and set: Flags.
  43537. (line 135)
  43538. * frame_related, in mem: Flags. (line 74)
  43539. * frame_related, in reg: Flags. (line 102)
  43540. * frame_related, in symbol_ref: Flags. (line 179)
  43541. * frequency, count, BB_FREQ_BASE: Profile information.
  43542. (line 30)
  43543. * ftruncM2 instruction pattern: Standard Names. (line 1429)
  43544. * function: Functions. (line 6)
  43545. * function <1>: Functions for C++. (line 6)
  43546. * function call conventions: Interface. (line 6)
  43547. * function entry and exit: Function Entry. (line 6)
  43548. * function entry point, alternate function entry point: Edges.
  43549. (line 180)
  43550. * function properties: Function Properties.
  43551. (line 6)
  43552. * function-call insns: Calls. (line 6)
  43553. * functions, leaf: Leaf Functions. (line 6)
  43554. * FUNCTION_ARG_REGNO_P: Register Arguments. (line 261)
  43555. * FUNCTION_BOUNDARY: Storage Layout. (line 176)
  43556. * FUNCTION_DECL: Functions. (line 6)
  43557. * FUNCTION_DECL <1>: Functions for C++. (line 6)
  43558. * FUNCTION_MODE: Misc. (line 375)
  43559. * FUNCTION_PROFILER: Profiling. (line 8)
  43560. * FUNCTION_TYPE: Types. (line 6)
  43561. * FUNCTION_VALUE: Scalar Return. (line 52)
  43562. * FUNCTION_VALUE_REGNO_P: Scalar Return. (line 78)
  43563. * fundamental type: Types. (line 6)
  43564. * G in constraint: Simple Constraints. (line 96)
  43565. * g in constraint: Simple Constraints. (line 118)
  43566. * garbage collector, invocation: Invoking the garbage collector.
  43567. (line 6)
  43568. * garbage collector, troubleshooting: Troubleshooting. (line 6)
  43569. * gather_loadMN instruction pattern: Standard Names. (line 232)
  43570. * GCC and portability: Portability. (line 6)
  43571. * GCC_DRIVER_HOST_INITIALIZATION: Host Misc. (line 36)
  43572. * gcov_type: Profile information.
  43573. (line 41)
  43574. * ge: Comparisons. (line 72)
  43575. * ge and attributes: Expressions. (line 83)
  43576. * gencodes: RTL passes. (line 18)
  43577. * general_operand: Machine-Independent Predicates.
  43578. (line 104)
  43579. * GENERAL_REGS: Register Classes. (line 22)
  43580. * generated files: Files. (line 6)
  43581. * generating assembler output: Output Statement. (line 6)
  43582. * generating insns: RTL Template. (line 6)
  43583. * GENERIC: Parsing pass. (line 6)
  43584. * GENERIC <1>: GENERIC. (line 6)
  43585. * generic predicates: Machine-Independent Predicates.
  43586. (line 6)
  43587. * genflags: RTL passes. (line 18)
  43588. * GEN_ERRNO_RTX: Library Calls. (line 71)
  43589. * get_attr: Expressions. (line 99)
  43590. * get_attr_length: Insn Lengths. (line 52)
  43591. * GET_CLASS_NARROWEST_MODE: Machine Modes. (line 430)
  43592. * GET_CODE: RTL Objects. (line 47)
  43593. * get_insns: Insns. (line 34)
  43594. * get_last_insn: Insns. (line 34)
  43595. * GET_MODE: Machine Modes. (line 377)
  43596. * GET_MODE_ALIGNMENT: Machine Modes. (line 417)
  43597. * GET_MODE_BITSIZE: Machine Modes. (line 401)
  43598. * GET_MODE_CLASS: Machine Modes. (line 391)
  43599. * GET_MODE_FBIT: Machine Modes. (line 408)
  43600. * GET_MODE_IBIT: Machine Modes. (line 404)
  43601. * GET_MODE_MASK: Machine Modes. (line 412)
  43602. * GET_MODE_NAME: Machine Modes. (line 388)
  43603. * GET_MODE_NUNITS: Machine Modes. (line 426)
  43604. * GET_MODE_SIZE: Machine Modes. (line 398)
  43605. * GET_MODE_UNIT_SIZE: Machine Modes. (line 420)
  43606. * GET_MODE_WIDER_MODE: Machine Modes. (line 394)
  43607. * GET_RTX_CLASS: RTL Classes. (line 6)
  43608. * GET_RTX_FORMAT: RTL Classes. (line 136)
  43609. * GET_RTX_LENGTH: RTL Classes. (line 133)
  43610. * get_thread_pointerMODE instruction pattern: Standard Names.
  43611. (line 2477)
  43612. * geu: Comparisons. (line 72)
  43613. * geu and attributes: Expressions. (line 83)
  43614. * GE_EXPR: Unary and Binary Expressions.
  43615. (line 6)
  43616. * GGC: Type Information. (line 6)
  43617. * ggc_collect: Invoking the garbage collector.
  43618. (line 6)
  43619. * GIMPLE: Parsing pass. (line 13)
  43620. * GIMPLE <1>: Gimplification pass.
  43621. (line 6)
  43622. * GIMPLE <2>: GIMPLE. (line 6)
  43623. * gimple: Tuple representation.
  43624. (line 14)
  43625. * GIMPLE API: GIMPLE API. (line 6)
  43626. * GIMPLE class hierarchy: Class hierarchy of GIMPLE statements.
  43627. (line 6)
  43628. * GIMPLE Exception Handling: GIMPLE Exception Handling.
  43629. (line 6)
  43630. * GIMPLE instruction set: GIMPLE instruction set.
  43631. (line 6)
  43632. * GIMPLE sequences: GIMPLE sequences. (line 6)
  43633. * GIMPLE statement iterators: Basic Blocks. (line 78)
  43634. * GIMPLE statement iterators <1>: Maintaining the CFG.
  43635. (line 33)
  43636. * gimple_addresses_taken: Manipulating GIMPLE statements.
  43637. (line 89)
  43638. * GIMPLE_ASM: GIMPLE_ASM. (line 6)
  43639. * gimple_asm_clobber_op: GIMPLE_ASM. (line 39)
  43640. * gimple_asm_input_op: GIMPLE_ASM. (line 23)
  43641. * gimple_asm_nclobbers: GIMPLE_ASM. (line 20)
  43642. * gimple_asm_ninputs: GIMPLE_ASM. (line 14)
  43643. * gimple_asm_noutputs: GIMPLE_ASM. (line 17)
  43644. * gimple_asm_output_op: GIMPLE_ASM. (line 31)
  43645. * gimple_asm_set_clobber_op: GIMPLE_ASM. (line 43)
  43646. * gimple_asm_set_input_op: GIMPLE_ASM. (line 27)
  43647. * gimple_asm_set_output_op: GIMPLE_ASM. (line 35)
  43648. * gimple_asm_set_volatile: GIMPLE_ASM. (line 54)
  43649. * gimple_asm_string: GIMPLE_ASM. (line 47)
  43650. * gimple_asm_volatile_p: GIMPLE_ASM. (line 51)
  43651. * GIMPLE_ASSIGN: GIMPLE_ASSIGN. (line 6)
  43652. * gimple_assign_cast_p: Logical Operators. (line 158)
  43653. * gimple_assign_cast_p <1>: GIMPLE_ASSIGN. (line 104)
  43654. * gimple_assign_lhs: GIMPLE_ASSIGN. (line 62)
  43655. * gimple_assign_lhs_ptr: GIMPLE_ASSIGN. (line 65)
  43656. * gimple_assign_rhs1: GIMPLE_ASSIGN. (line 68)
  43657. * gimple_assign_rhs1_ptr: GIMPLE_ASSIGN. (line 71)
  43658. * gimple_assign_rhs2: GIMPLE_ASSIGN. (line 75)
  43659. * gimple_assign_rhs2_ptr: GIMPLE_ASSIGN. (line 78)
  43660. * gimple_assign_rhs3: GIMPLE_ASSIGN. (line 82)
  43661. * gimple_assign_rhs3_ptr: GIMPLE_ASSIGN. (line 85)
  43662. * gimple_assign_rhs_class: GIMPLE_ASSIGN. (line 56)
  43663. * gimple_assign_rhs_code: GIMPLE_ASSIGN. (line 52)
  43664. * gimple_assign_set_lhs: GIMPLE_ASSIGN. (line 89)
  43665. * gimple_assign_set_rhs1: GIMPLE_ASSIGN. (line 92)
  43666. * gimple_assign_set_rhs2: GIMPLE_ASSIGN. (line 96)
  43667. * gimple_assign_set_rhs3: GIMPLE_ASSIGN. (line 100)
  43668. * gimple_bb: Manipulating GIMPLE statements.
  43669. (line 17)
  43670. * GIMPLE_BIND: GIMPLE_BIND. (line 6)
  43671. * gimple_bind_add_seq: GIMPLE_BIND. (line 34)
  43672. * gimple_bind_add_stmt: GIMPLE_BIND. (line 31)
  43673. * gimple_bind_append_vars: GIMPLE_BIND. (line 18)
  43674. * gimple_bind_block: GIMPLE_BIND. (line 39)
  43675. * gimple_bind_body: GIMPLE_BIND. (line 22)
  43676. * gimple_bind_set_block: GIMPLE_BIND. (line 44)
  43677. * gimple_bind_set_body: GIMPLE_BIND. (line 26)
  43678. * gimple_bind_set_vars: GIMPLE_BIND. (line 14)
  43679. * gimple_bind_vars: GIMPLE_BIND. (line 11)
  43680. * gimple_block: Manipulating GIMPLE statements.
  43681. (line 20)
  43682. * gimple_build: GIMPLE API. (line 34)
  43683. * gimple_build <1>: GIMPLE API. (line 36)
  43684. * gimple_build <2>: GIMPLE API. (line 38)
  43685. * gimple_build <3>: GIMPLE API. (line 41)
  43686. * gimple_build <4>: GIMPLE API. (line 44)
  43687. * gimple_build <5>: GIMPLE API. (line 47)
  43688. * gimple_build_debug_begin_stmt: GIMPLE_DEBUG. (line 72)
  43689. * gimple_build_debug_inline_entry: GIMPLE_DEBUG. (line 82)
  43690. * gimple_build_nop: GIMPLE_NOP. (line 6)
  43691. * gimple_build_omp_master: GIMPLE_OMP_MASTER. (line 6)
  43692. * gimple_build_omp_ordered: GIMPLE_OMP_ORDERED. (line 6)
  43693. * gimple_build_omp_return: GIMPLE_OMP_RETURN. (line 6)
  43694. * gimple_build_omp_section: GIMPLE_OMP_SECTION. (line 6)
  43695. * gimple_build_omp_sections_switch: GIMPLE_OMP_SECTIONS.
  43696. (line 13)
  43697. * gimple_build_wce: GIMPLE_WITH_CLEANUP_EXPR.
  43698. (line 6)
  43699. * GIMPLE_CALL: GIMPLE_CALL. (line 6)
  43700. * gimple_call_arg: GIMPLE_CALL. (line 67)
  43701. * gimple_call_arg_ptr: GIMPLE_CALL. (line 71)
  43702. * gimple_call_chain: GIMPLE_CALL. (line 58)
  43703. * gimple_call_copy_skip_args: GIMPLE_CALL. (line 92)
  43704. * gimple_call_fn: GIMPLE_CALL. (line 39)
  43705. * gimple_call_fndecl: GIMPLE_CALL. (line 47)
  43706. * gimple_call_lhs: GIMPLE_CALL. (line 30)
  43707. * gimple_call_lhs_ptr: GIMPLE_CALL. (line 33)
  43708. * gimple_call_noreturn_p: GIMPLE_CALL. (line 89)
  43709. * gimple_call_num_args: GIMPLE_CALL. (line 64)
  43710. * gimple_call_return_type: GIMPLE_CALL. (line 55)
  43711. * gimple_call_set_arg: GIMPLE_CALL. (line 76)
  43712. * gimple_call_set_chain: GIMPLE_CALL. (line 61)
  43713. * gimple_call_set_fn: GIMPLE_CALL. (line 43)
  43714. * gimple_call_set_fndecl: GIMPLE_CALL. (line 52)
  43715. * gimple_call_set_lhs: GIMPLE_CALL. (line 36)
  43716. * gimple_call_set_tail: GIMPLE_CALL. (line 81)
  43717. * gimple_call_tail_p: GIMPLE_CALL. (line 86)
  43718. * GIMPLE_CATCH: GIMPLE_CATCH. (line 6)
  43719. * gimple_catch_handler: GIMPLE_CATCH. (line 19)
  43720. * gimple_catch_set_handler: GIMPLE_CATCH. (line 26)
  43721. * gimple_catch_set_types: GIMPLE_CATCH. (line 23)
  43722. * gimple_catch_types: GIMPLE_CATCH. (line 12)
  43723. * gimple_catch_types_ptr: GIMPLE_CATCH. (line 15)
  43724. * gimple_code: Manipulating GIMPLE statements.
  43725. (line 14)
  43726. * GIMPLE_COND: GIMPLE_COND. (line 6)
  43727. * gimple_cond_code: GIMPLE_COND. (line 20)
  43728. * gimple_cond_false_label: GIMPLE_COND. (line 59)
  43729. * gimple_cond_lhs: GIMPLE_COND. (line 29)
  43730. * gimple_cond_make_false: GIMPLE_COND. (line 63)
  43731. * gimple_cond_make_true: GIMPLE_COND. (line 66)
  43732. * gimple_cond_rhs: GIMPLE_COND. (line 37)
  43733. * gimple_cond_set_code: GIMPLE_COND. (line 24)
  43734. * gimple_cond_set_false_label: GIMPLE_COND. (line 54)
  43735. * gimple_cond_set_lhs: GIMPLE_COND. (line 33)
  43736. * gimple_cond_set_rhs: GIMPLE_COND. (line 41)
  43737. * gimple_cond_set_true_label: GIMPLE_COND. (line 49)
  43738. * gimple_cond_true_label: GIMPLE_COND. (line 45)
  43739. * gimple_convert: GIMPLE API. (line 50)
  43740. * gimple_copy: Manipulating GIMPLE statements.
  43741. (line 146)
  43742. * GIMPLE_DEBUG: GIMPLE_DEBUG. (line 6)
  43743. * GIMPLE_DEBUG_BEGIN_STMT: GIMPLE_DEBUG. (line 6)
  43744. * GIMPLE_DEBUG_BIND: GIMPLE_DEBUG. (line 6)
  43745. * gimple_debug_bind_get_value: GIMPLE_DEBUG. (line 46)
  43746. * gimple_debug_bind_get_value_ptr: GIMPLE_DEBUG. (line 50)
  43747. * gimple_debug_bind_get_var: GIMPLE_DEBUG. (line 43)
  43748. * gimple_debug_bind_has_value_p: GIMPLE_DEBUG. (line 68)
  43749. * gimple_debug_bind_p: Logical Operators. (line 162)
  43750. * gimple_debug_bind_reset_value: GIMPLE_DEBUG. (line 64)
  43751. * gimple_debug_bind_set_value: GIMPLE_DEBUG. (line 59)
  43752. * gimple_debug_bind_set_var: GIMPLE_DEBUG. (line 55)
  43753. * GIMPLE_DEBUG_INLINE_ENTRY: GIMPLE_DEBUG. (line 6)
  43754. * gimple_def_ops: Manipulating GIMPLE statements.
  43755. (line 93)
  43756. * GIMPLE_EH_FILTER: GIMPLE_EH_FILTER. (line 6)
  43757. * gimple_eh_filter_failure: GIMPLE_EH_FILTER. (line 18)
  43758. * gimple_eh_filter_set_failure: GIMPLE_EH_FILTER. (line 27)
  43759. * gimple_eh_filter_set_types: GIMPLE_EH_FILTER. (line 22)
  43760. * gimple_eh_filter_types: GIMPLE_EH_FILTER. (line 11)
  43761. * gimple_eh_filter_types_ptr: GIMPLE_EH_FILTER. (line 14)
  43762. * gimple_eh_must_not_throw_fndecl: GIMPLE_EH_FILTER. (line 32)
  43763. * gimple_eh_must_not_throw_set_fndecl: GIMPLE_EH_FILTER. (line 36)
  43764. * gimple_expr_code: Manipulating GIMPLE statements.
  43765. (line 30)
  43766. * gimple_expr_type: Manipulating GIMPLE statements.
  43767. (line 23)
  43768. * GIMPLE_GOTO: GIMPLE_GOTO. (line 6)
  43769. * gimple_goto_dest: GIMPLE_GOTO. (line 9)
  43770. * gimple_goto_set_dest: GIMPLE_GOTO. (line 12)
  43771. * gimple_has_mem_ops: Manipulating GIMPLE statements.
  43772. (line 71)
  43773. * gimple_has_ops: Manipulating GIMPLE statements.
  43774. (line 68)
  43775. * gimple_has_volatile_ops: Manipulating GIMPLE statements.
  43776. (line 133)
  43777. * GIMPLE_LABEL: GIMPLE_LABEL. (line 6)
  43778. * gimple_label_label: GIMPLE_LABEL. (line 10)
  43779. * gimple_label_set_label: GIMPLE_LABEL. (line 13)
  43780. * gimple_loaded_syms: Manipulating GIMPLE statements.
  43781. (line 121)
  43782. * gimple_locus: Manipulating GIMPLE statements.
  43783. (line 41)
  43784. * gimple_locus_empty_p: Manipulating GIMPLE statements.
  43785. (line 47)
  43786. * gimple_modified_p: Manipulating GIMPLE statements.
  43787. (line 129)
  43788. * GIMPLE_NOP: GIMPLE_NOP. (line 6)
  43789. * gimple_nop_p: GIMPLE_NOP. (line 9)
  43790. * gimple_no_warning_p: Manipulating GIMPLE statements.
  43791. (line 50)
  43792. * gimple_num_ops: Logical Operators. (line 76)
  43793. * gimple_num_ops <1>: Manipulating GIMPLE statements.
  43794. (line 74)
  43795. * GIMPLE_OMP_ATOMIC_LOAD: GIMPLE_OMP_ATOMIC_LOAD.
  43796. (line 6)
  43797. * gimple_omp_atomic_load_lhs: GIMPLE_OMP_ATOMIC_LOAD.
  43798. (line 16)
  43799. * gimple_omp_atomic_load_rhs: GIMPLE_OMP_ATOMIC_LOAD.
  43800. (line 24)
  43801. * gimple_omp_atomic_load_set_lhs: GIMPLE_OMP_ATOMIC_LOAD.
  43802. (line 12)
  43803. * gimple_omp_atomic_load_set_rhs: GIMPLE_OMP_ATOMIC_LOAD.
  43804. (line 20)
  43805. * GIMPLE_OMP_ATOMIC_STORE: GIMPLE_OMP_ATOMIC_STORE.
  43806. (line 6)
  43807. * gimple_omp_atomic_store_set_val: GIMPLE_OMP_ATOMIC_STORE.
  43808. (line 11)
  43809. * gimple_omp_atomic_store_val: GIMPLE_OMP_ATOMIC_STORE.
  43810. (line 15)
  43811. * gimple_omp_body: GIMPLE_OMP_PARALLEL.
  43812. (line 23)
  43813. * GIMPLE_OMP_CONTINUE: GIMPLE_OMP_CONTINUE.
  43814. (line 6)
  43815. * gimple_omp_continue_control_def: GIMPLE_OMP_CONTINUE.
  43816. (line 12)
  43817. * gimple_omp_continue_control_def_ptr: GIMPLE_OMP_CONTINUE.
  43818. (line 17)
  43819. * gimple_omp_continue_control_use: GIMPLE_OMP_CONTINUE.
  43820. (line 26)
  43821. * gimple_omp_continue_control_use_ptr: GIMPLE_OMP_CONTINUE.
  43822. (line 31)
  43823. * gimple_omp_continue_set_control_def: GIMPLE_OMP_CONTINUE.
  43824. (line 21)
  43825. * gimple_omp_continue_set_control_use: GIMPLE_OMP_CONTINUE.
  43826. (line 35)
  43827. * GIMPLE_OMP_CRITICAL: GIMPLE_OMP_CRITICAL.
  43828. (line 6)
  43829. * gimple_omp_critical_name: GIMPLE_OMP_CRITICAL.
  43830. (line 12)
  43831. * gimple_omp_critical_name_ptr: GIMPLE_OMP_CRITICAL.
  43832. (line 16)
  43833. * gimple_omp_critical_set_name: GIMPLE_OMP_CRITICAL.
  43834. (line 21)
  43835. * GIMPLE_OMP_FOR: GIMPLE_OMP_FOR. (line 6)
  43836. * gimple_omp_for_clauses: GIMPLE_OMP_FOR. (line 17)
  43837. * gimple_omp_for_clauses_ptr: GIMPLE_OMP_FOR. (line 20)
  43838. * gimple_omp_for_cond: GIMPLE_OMP_FOR. (line 80)
  43839. * gimple_omp_for_final: GIMPLE_OMP_FOR. (line 48)
  43840. * gimple_omp_for_final_ptr: GIMPLE_OMP_FOR. (line 51)
  43841. * gimple_omp_for_incr: GIMPLE_OMP_FOR. (line 58)
  43842. * gimple_omp_for_incr_ptr: GIMPLE_OMP_FOR. (line 61)
  43843. * gimple_omp_for_index: GIMPLE_OMP_FOR. (line 28)
  43844. * gimple_omp_for_index_ptr: GIMPLE_OMP_FOR. (line 31)
  43845. * gimple_omp_for_initial: GIMPLE_OMP_FOR. (line 38)
  43846. * gimple_omp_for_initial_ptr: GIMPLE_OMP_FOR. (line 41)
  43847. * gimple_omp_for_pre_body: GIMPLE_OMP_FOR. (line 67)
  43848. * gimple_omp_for_set_clauses: GIMPLE_OMP_FOR. (line 23)
  43849. * gimple_omp_for_set_cond: GIMPLE_OMP_FOR. (line 76)
  43850. * gimple_omp_for_set_final: GIMPLE_OMP_FOR. (line 54)
  43851. * gimple_omp_for_set_incr: GIMPLE_OMP_FOR. (line 64)
  43852. * gimple_omp_for_set_index: GIMPLE_OMP_FOR. (line 34)
  43853. * gimple_omp_for_set_initial: GIMPLE_OMP_FOR. (line 44)
  43854. * gimple_omp_for_set_pre_body: GIMPLE_OMP_FOR. (line 71)
  43855. * GIMPLE_OMP_MASTER: GIMPLE_OMP_MASTER. (line 6)
  43856. * GIMPLE_OMP_ORDERED: GIMPLE_OMP_ORDERED. (line 6)
  43857. * GIMPLE_OMP_PARALLEL: GIMPLE_OMP_PARALLEL.
  43858. (line 6)
  43859. * gimple_omp_parallel_child_fn: GIMPLE_OMP_PARALLEL.
  43860. (line 42)
  43861. * gimple_omp_parallel_child_fn_ptr: GIMPLE_OMP_PARALLEL.
  43862. (line 47)
  43863. * gimple_omp_parallel_clauses: GIMPLE_OMP_PARALLEL.
  43864. (line 30)
  43865. * gimple_omp_parallel_clauses_ptr: GIMPLE_OMP_PARALLEL.
  43866. (line 33)
  43867. * gimple_omp_parallel_combined_p: GIMPLE_OMP_PARALLEL.
  43868. (line 15)
  43869. * gimple_omp_parallel_data_arg: GIMPLE_OMP_PARALLEL.
  43870. (line 56)
  43871. * gimple_omp_parallel_data_arg_ptr: GIMPLE_OMP_PARALLEL.
  43872. (line 61)
  43873. * gimple_omp_parallel_set_child_fn: GIMPLE_OMP_PARALLEL.
  43874. (line 52)
  43875. * gimple_omp_parallel_set_clauses: GIMPLE_OMP_PARALLEL.
  43876. (line 37)
  43877. * gimple_omp_parallel_set_combined_p: GIMPLE_OMP_PARALLEL.
  43878. (line 19)
  43879. * gimple_omp_parallel_set_data_arg: GIMPLE_OMP_PARALLEL.
  43880. (line 65)
  43881. * GIMPLE_OMP_RETURN: GIMPLE_OMP_RETURN. (line 6)
  43882. * gimple_omp_return_nowait_p: GIMPLE_OMP_RETURN. (line 13)
  43883. * gimple_omp_return_set_nowait: GIMPLE_OMP_RETURN. (line 10)
  43884. * GIMPLE_OMP_SECTION: GIMPLE_OMP_SECTION. (line 6)
  43885. * GIMPLE_OMP_SECTIONS: GIMPLE_OMP_SECTIONS.
  43886. (line 6)
  43887. * gimple_omp_sections_clauses: GIMPLE_OMP_SECTIONS.
  43888. (line 29)
  43889. * gimple_omp_sections_clauses_ptr: GIMPLE_OMP_SECTIONS.
  43890. (line 32)
  43891. * gimple_omp_sections_control: GIMPLE_OMP_SECTIONS.
  43892. (line 16)
  43893. * gimple_omp_sections_control_ptr: GIMPLE_OMP_SECTIONS.
  43894. (line 20)
  43895. * gimple_omp_sections_set_clauses: GIMPLE_OMP_SECTIONS.
  43896. (line 35)
  43897. * gimple_omp_sections_set_control: GIMPLE_OMP_SECTIONS.
  43898. (line 24)
  43899. * gimple_omp_section_last_p: GIMPLE_OMP_SECTION. (line 11)
  43900. * gimple_omp_section_set_last: GIMPLE_OMP_SECTION. (line 15)
  43901. * gimple_omp_set_body: GIMPLE_OMP_PARALLEL.
  43902. (line 26)
  43903. * GIMPLE_OMP_SINGLE: GIMPLE_OMP_SINGLE. (line 6)
  43904. * gimple_omp_single_clauses: GIMPLE_OMP_SINGLE. (line 13)
  43905. * gimple_omp_single_clauses_ptr: GIMPLE_OMP_SINGLE. (line 16)
  43906. * gimple_omp_single_set_clauses: GIMPLE_OMP_SINGLE. (line 19)
  43907. * gimple_op: Logical Operators. (line 79)
  43908. * gimple_op <1>: Manipulating GIMPLE statements.
  43909. (line 80)
  43910. * gimple_ops: Logical Operators. (line 82)
  43911. * gimple_ops <1>: Manipulating GIMPLE statements.
  43912. (line 77)
  43913. * gimple_op_ptr: Manipulating GIMPLE statements.
  43914. (line 83)
  43915. * GIMPLE_PHI: GIMPLE_PHI. (line 6)
  43916. * gimple_phi_arg: GIMPLE_PHI. (line 24)
  43917. * gimple_phi_arg <1>: SSA. (line 62)
  43918. * gimple_phi_arg_def: SSA. (line 68)
  43919. * gimple_phi_arg_edge: SSA. (line 65)
  43920. * gimple_phi_capacity: GIMPLE_PHI. (line 6)
  43921. * gimple_phi_num_args: GIMPLE_PHI. (line 10)
  43922. * gimple_phi_num_args <1>: SSA. (line 58)
  43923. * gimple_phi_result: GIMPLE_PHI. (line 15)
  43924. * gimple_phi_result <1>: SSA. (line 55)
  43925. * gimple_phi_result_ptr: GIMPLE_PHI. (line 18)
  43926. * gimple_phi_set_arg: GIMPLE_PHI. (line 28)
  43927. * gimple_phi_set_result: GIMPLE_PHI. (line 21)
  43928. * gimple_plf: Manipulating GIMPLE statements.
  43929. (line 64)
  43930. * GIMPLE_RESX: GIMPLE_RESX. (line 6)
  43931. * gimple_resx_region: GIMPLE_RESX. (line 12)
  43932. * gimple_resx_set_region: GIMPLE_RESX. (line 15)
  43933. * GIMPLE_RETURN: GIMPLE_RETURN. (line 6)
  43934. * gimple_return_retval: GIMPLE_RETURN. (line 9)
  43935. * gimple_return_set_retval: GIMPLE_RETURN. (line 12)
  43936. * gimple_seq_add_seq: GIMPLE sequences. (line 30)
  43937. * gimple_seq_add_stmt: GIMPLE sequences. (line 24)
  43938. * gimple_seq_alloc: GIMPLE sequences. (line 61)
  43939. * gimple_seq_copy: GIMPLE sequences. (line 65)
  43940. * gimple_seq_deep_copy: GIMPLE sequences. (line 36)
  43941. * gimple_seq_empty_p: GIMPLE sequences. (line 69)
  43942. * gimple_seq_first: GIMPLE sequences. (line 43)
  43943. * gimple_seq_init: GIMPLE sequences. (line 58)
  43944. * gimple_seq_last: GIMPLE sequences. (line 46)
  43945. * gimple_seq_reverse: GIMPLE sequences. (line 39)
  43946. * gimple_seq_set_first: GIMPLE sequences. (line 53)
  43947. * gimple_seq_set_last: GIMPLE sequences. (line 49)
  43948. * gimple_seq_singleton_p: GIMPLE sequences. (line 78)
  43949. * gimple_set_block: Manipulating GIMPLE statements.
  43950. (line 38)
  43951. * gimple_set_def_ops: Manipulating GIMPLE statements.
  43952. (line 96)
  43953. * gimple_set_has_volatile_ops: Manipulating GIMPLE statements.
  43954. (line 136)
  43955. * gimple_set_locus: Manipulating GIMPLE statements.
  43956. (line 44)
  43957. * gimple_set_op: Manipulating GIMPLE statements.
  43958. (line 86)
  43959. * gimple_set_plf: Manipulating GIMPLE statements.
  43960. (line 60)
  43961. * gimple_set_use_ops: Manipulating GIMPLE statements.
  43962. (line 103)
  43963. * gimple_set_vdef_ops: Manipulating GIMPLE statements.
  43964. (line 117)
  43965. * gimple_set_visited: Manipulating GIMPLE statements.
  43966. (line 53)
  43967. * gimple_set_vuse_ops: Manipulating GIMPLE statements.
  43968. (line 110)
  43969. * gimple_simplify: GIMPLE API. (line 6)
  43970. * gimple_simplify <1>: GIMPLE API. (line 8)
  43971. * gimple_simplify <2>: GIMPLE API. (line 10)
  43972. * gimple_simplify <3>: GIMPLE API. (line 12)
  43973. * gimple_simplify <4>: GIMPLE API. (line 14)
  43974. * gimple_simplify <5>: GIMPLE API. (line 16)
  43975. * gimple_statement_with_ops: Tuple representation.
  43976. (line 96)
  43977. * gimple_stored_syms: Manipulating GIMPLE statements.
  43978. (line 125)
  43979. * GIMPLE_SWITCH: GIMPLE_SWITCH. (line 6)
  43980. * gimple_switch_default_label: GIMPLE_SWITCH. (line 41)
  43981. * gimple_switch_index: GIMPLE_SWITCH. (line 24)
  43982. * gimple_switch_label: GIMPLE_SWITCH. (line 31)
  43983. * gimple_switch_num_labels: GIMPLE_SWITCH. (line 14)
  43984. * gimple_switch_set_default_label: GIMPLE_SWITCH. (line 45)
  43985. * gimple_switch_set_index: GIMPLE_SWITCH. (line 27)
  43986. * gimple_switch_set_label: GIMPLE_SWITCH. (line 36)
  43987. * gimple_switch_set_num_labels: GIMPLE_SWITCH. (line 19)
  43988. * GIMPLE_TRY: GIMPLE_TRY. (line 6)
  43989. * gimple_try_catch_is_cleanup: GIMPLE_TRY. (line 19)
  43990. * gimple_try_cleanup: GIMPLE_TRY. (line 26)
  43991. * gimple_try_eval: GIMPLE_TRY. (line 22)
  43992. * gimple_try_kind: GIMPLE_TRY. (line 15)
  43993. * gimple_try_set_catch_is_cleanup: GIMPLE_TRY. (line 30)
  43994. * gimple_try_set_cleanup: GIMPLE_TRY. (line 38)
  43995. * gimple_try_set_eval: GIMPLE_TRY. (line 34)
  43996. * gimple_use_ops: Manipulating GIMPLE statements.
  43997. (line 100)
  43998. * gimple_vdef_ops: Manipulating GIMPLE statements.
  43999. (line 114)
  44000. * gimple_visited_p: Manipulating GIMPLE statements.
  44001. (line 57)
  44002. * gimple_vuse_ops: Manipulating GIMPLE statements.
  44003. (line 107)
  44004. * gimple_wce_cleanup: GIMPLE_WITH_CLEANUP_EXPR.
  44005. (line 10)
  44006. * gimple_wce_cleanup_eh_only: GIMPLE_WITH_CLEANUP_EXPR.
  44007. (line 17)
  44008. * gimple_wce_set_cleanup: GIMPLE_WITH_CLEANUP_EXPR.
  44009. (line 13)
  44010. * gimple_wce_set_cleanup_eh_only: GIMPLE_WITH_CLEANUP_EXPR.
  44011. (line 20)
  44012. * GIMPLE_WITH_CLEANUP_EXPR: GIMPLE_WITH_CLEANUP_EXPR.
  44013. (line 6)
  44014. * gimplification: Parsing pass. (line 13)
  44015. * gimplification <1>: Gimplification pass.
  44016. (line 6)
  44017. * gimplifier: Parsing pass. (line 13)
  44018. * gimplify_assign: GIMPLE_ASSIGN. (line 41)
  44019. * gimplify_expr: Gimplification pass.
  44020. (line 18)
  44021. * gimplify_function_tree: Gimplification pass.
  44022. (line 18)
  44023. * GLOBAL_INIT_PRIORITY: Functions for C++. (line 141)
  44024. * global_regs: Register Basics. (line 102)
  44025. * GO_IF_LEGITIMATE_ADDRESS: Addressing Modes. (line 90)
  44026. * greater than: Comparisons. (line 60)
  44027. * greater than <1>: Comparisons. (line 64)
  44028. * greater than <2>: Comparisons. (line 72)
  44029. * gsi_after_labels: Sequence iterators. (line 74)
  44030. * gsi_bb: Sequence iterators. (line 82)
  44031. * gsi_commit_edge_inserts: Sequence iterators. (line 193)
  44032. * gsi_commit_edge_inserts <1>: Maintaining the CFG.
  44033. (line 104)
  44034. * gsi_commit_one_edge_insert: Sequence iterators. (line 188)
  44035. * gsi_end_p: Sequence iterators. (line 59)
  44036. * gsi_end_p <1>: Maintaining the CFG.
  44037. (line 48)
  44038. * gsi_for_stmt: Sequence iterators. (line 156)
  44039. * gsi_insert_after: Sequence iterators. (line 145)
  44040. * gsi_insert_after <1>: Maintaining the CFG.
  44041. (line 60)
  44042. * gsi_insert_before: Sequence iterators. (line 134)
  44043. * gsi_insert_before <1>: Maintaining the CFG.
  44044. (line 66)
  44045. * gsi_insert_on_edge: Sequence iterators. (line 173)
  44046. * gsi_insert_on_edge <1>: Maintaining the CFG.
  44047. (line 104)
  44048. * gsi_insert_on_edge_immediate: Sequence iterators. (line 183)
  44049. * gsi_insert_seq_after: Sequence iterators. (line 152)
  44050. * gsi_insert_seq_before: Sequence iterators. (line 141)
  44051. * gsi_insert_seq_on_edge: Sequence iterators. (line 177)
  44052. * gsi_last: Sequence iterators. (line 49)
  44053. * gsi_last <1>: Maintaining the CFG.
  44054. (line 44)
  44055. * gsi_last_bb: Sequence iterators. (line 55)
  44056. * gsi_link_after: Sequence iterators. (line 113)
  44057. * gsi_link_before: Sequence iterators. (line 103)
  44058. * gsi_link_seq_after: Sequence iterators. (line 108)
  44059. * gsi_link_seq_before: Sequence iterators. (line 97)
  44060. * gsi_move_after: Sequence iterators. (line 159)
  44061. * gsi_move_before: Sequence iterators. (line 164)
  44062. * gsi_move_to_bb_end: Sequence iterators. (line 169)
  44063. * gsi_next: Sequence iterators. (line 65)
  44064. * gsi_next <1>: Maintaining the CFG.
  44065. (line 52)
  44066. * gsi_one_before_end_p: Sequence iterators. (line 62)
  44067. * gsi_prev: Sequence iterators. (line 68)
  44068. * gsi_prev <1>: Maintaining the CFG.
  44069. (line 56)
  44070. * gsi_remove: Sequence iterators. (line 88)
  44071. * gsi_remove <1>: Maintaining the CFG.
  44072. (line 72)
  44073. * gsi_replace: Sequence iterators. (line 128)
  44074. * gsi_seq: Sequence iterators. (line 85)
  44075. * gsi_split_seq_after: Sequence iterators. (line 118)
  44076. * gsi_split_seq_before: Sequence iterators. (line 123)
  44077. * gsi_start: Sequence iterators. (line 39)
  44078. * gsi_start <1>: Maintaining the CFG.
  44079. (line 40)
  44080. * gsi_start_bb: Sequence iterators. (line 45)
  44081. * gsi_stmt: Sequence iterators. (line 71)
  44082. * gsi_stmt_ptr: Sequence iterators. (line 79)
  44083. * gt: Comparisons. (line 60)
  44084. * gt and attributes: Expressions. (line 83)
  44085. * gtu: Comparisons. (line 64)
  44086. * gtu and attributes: Expressions. (line 83)
  44087. * GTY: Type Information. (line 6)
  44088. * GT_EXPR: Unary and Binary Expressions.
  44089. (line 6)
  44090. * guidelines for diagnostics: Guidelines for Diagnostics.
  44091. (line 6)
  44092. * guidelines for options: Guidelines for Options.
  44093. (line 6)
  44094. * guidelines, user experience: User Experience Guidelines.
  44095. (line 6)
  44096. * H in constraint: Simple Constraints. (line 96)
  44097. * HAmode: Machine Modes. (line 146)
  44098. * HANDLER: Statements for C++. (line 6)
  44099. * HANDLER_BODY: Statements for C++. (line 6)
  44100. * HANDLER_PARMS: Statements for C++. (line 6)
  44101. * HANDLE_PRAGMA_PACK_WITH_EXPANSION: Misc. (line 475)
  44102. * hard registers: Regs and Memory. (line 9)
  44103. * HARD_FRAME_POINTER_IS_ARG_POINTER: Frame Registers. (line 57)
  44104. * HARD_FRAME_POINTER_IS_FRAME_POINTER: Frame Registers. (line 50)
  44105. * HARD_FRAME_POINTER_REGNUM: Frame Registers. (line 19)
  44106. * HARD_REGNO_CALLER_SAVE_MODE: Caller Saves. (line 10)
  44107. * HARD_REGNO_NREGS_HAS_PADDING: Values in Registers.
  44108. (line 21)
  44109. * HARD_REGNO_NREGS_WITH_PADDING: Values in Registers.
  44110. (line 39)
  44111. * HARD_REGNO_RENAME_OK: Values in Registers.
  44112. (line 113)
  44113. * HAS_INIT_SECTION: Macros for Initialization.
  44114. (line 18)
  44115. * HAS_LONG_COND_BRANCH: Misc. (line 8)
  44116. * HAS_LONG_UNCOND_BRANCH: Misc. (line 17)
  44117. * HAVE_DOS_BASED_FILE_SYSTEM: Filesystem. (line 11)
  44118. * HAVE_POST_DECREMENT: Addressing Modes. (line 11)
  44119. * HAVE_POST_INCREMENT: Addressing Modes. (line 10)
  44120. * HAVE_POST_MODIFY_DISP: Addressing Modes. (line 17)
  44121. * HAVE_POST_MODIFY_REG: Addressing Modes. (line 23)
  44122. * HAVE_PRE_DECREMENT: Addressing Modes. (line 9)
  44123. * HAVE_PRE_INCREMENT: Addressing Modes. (line 8)
  44124. * HAVE_PRE_MODIFY_DISP: Addressing Modes. (line 16)
  44125. * HAVE_PRE_MODIFY_REG: Addressing Modes. (line 22)
  44126. * HCmode: Machine Modes. (line 199)
  44127. * HFmode: Machine Modes. (line 61)
  44128. * high: Constants. (line 220)
  44129. * HImode: Machine Modes. (line 29)
  44130. * HImode, in insn: Insns. (line 291)
  44131. * HONOR_REG_ALLOC_ORDER: Allocation Order. (line 36)
  44132. * host configuration: Host Config. (line 6)
  44133. * host functions: Host Common. (line 6)
  44134. * host hooks: Host Common. (line 6)
  44135. * host makefile fragment: Host Fragment. (line 6)
  44136. * HOST_BIT_BUCKET: Filesystem. (line 51)
  44137. * HOST_EXECUTABLE_SUFFIX: Filesystem. (line 45)
  44138. * HOST_HOOKS_EXTRA_SIGNALS: Host Common. (line 11)
  44139. * HOST_HOOKS_GT_PCH_ALLOC_GRANULARITY: Host Common. (line 43)
  44140. * HOST_HOOKS_GT_PCH_GET_ADDRESS: Host Common. (line 15)
  44141. * HOST_HOOKS_GT_PCH_USE_ADDRESS: Host Common. (line 24)
  44142. * HOST_LACKS_INODE_NUMBERS: Filesystem. (line 89)
  44143. * HOST_LONG_FORMAT: Host Misc. (line 45)
  44144. * HOST_LONG_LONG_FORMAT: Host Misc. (line 41)
  44145. * HOST_OBJECT_SUFFIX: Filesystem. (line 40)
  44146. * HOST_PTR_PRINTF: Host Misc. (line 49)
  44147. * HOT_TEXT_SECTION_NAME: Sections. (line 42)
  44148. * HQmode: Machine Modes. (line 110)
  44149. * i in constraint: Simple Constraints. (line 68)
  44150. * I in constraint: Simple Constraints. (line 79)
  44151. * identifier: Identifiers. (line 6)
  44152. * IDENTIFIER_LENGTH: Identifiers. (line 22)
  44153. * IDENTIFIER_NODE: Identifiers. (line 6)
  44154. * IDENTIFIER_OPNAME_P: Identifiers. (line 27)
  44155. * IDENTIFIER_POINTER: Identifiers. (line 17)
  44156. * IDENTIFIER_TYPENAME_P: Identifiers. (line 33)
  44157. * IEEE 754-2008: Decimal float library routines.
  44158. (line 6)
  44159. * IFCVT_MACHDEP_INIT: Misc. (line 601)
  44160. * IFCVT_MODIFY_CANCEL: Misc. (line 595)
  44161. * IFCVT_MODIFY_FINAL: Misc. (line 589)
  44162. * IFCVT_MODIFY_INSN: Misc. (line 583)
  44163. * IFCVT_MODIFY_MULTIPLE_TESTS: Misc. (line 575)
  44164. * IFCVT_MODIFY_TESTS: Misc. (line 565)
  44165. * IF_COND: Statements for C++. (line 6)
  44166. * IF_STMT: Statements for C++. (line 6)
  44167. * if_then_else: Comparisons. (line 80)
  44168. * if_then_else and attributes: Expressions. (line 32)
  44169. * if_then_else usage: Side Effects. (line 56)
  44170. * IMAGPART_EXPR: Unary and Binary Expressions.
  44171. (line 6)
  44172. * Immediate Uses: SSA Operands. (line 258)
  44173. * immediate_operand: Machine-Independent Predicates.
  44174. (line 10)
  44175. * IMMEDIATE_PREFIX: Instruction Output. (line 153)
  44176. * include: Including Patterns. (line 6)
  44177. * INCLUDE_DEFAULTS: Driver. (line 331)
  44178. * inclusive-or, bitwise: Arithmetic. (line 163)
  44179. * INCOMING_FRAME_SP_OFFSET: Frame Layout. (line 188)
  44180. * INCOMING_REGNO: Register Basics. (line 129)
  44181. * INCOMING_REG_PARM_STACK_SPACE: Stack Arguments. (line 73)
  44182. * INCOMING_RETURN_ADDR_RTX: Frame Layout. (line 133)
  44183. * INCOMING_STACK_BOUNDARY: Storage Layout. (line 171)
  44184. * INDEX_REG_CLASS: Register Classes. (line 140)
  44185. * indirect_jump instruction pattern: Standard Names. (line 1826)
  44186. * indirect_operand: Machine-Independent Predicates.
  44187. (line 70)
  44188. * INDIRECT_REF: Storage References. (line 6)
  44189. * initialization routines: Initialization. (line 6)
  44190. * INITIAL_ELIMINATION_OFFSET: Elimination. (line 68)
  44191. * INITIAL_FRAME_ADDRESS_RTX: Frame Layout. (line 75)
  44192. * INIT_ARRAY_SECTION_ASM_OP: Sections. (line 106)
  44193. * INIT_CUMULATIVE_ARGS: Register Arguments. (line 158)
  44194. * INIT_CUMULATIVE_INCOMING_ARGS: Register Arguments. (line 186)
  44195. * INIT_CUMULATIVE_LIBCALL_ARGS: Register Arguments. (line 180)
  44196. * INIT_ENVIRONMENT: Driver. (line 309)
  44197. * INIT_EXPANDERS: Per-Function Data. (line 36)
  44198. * INIT_EXPR: Unary and Binary Expressions.
  44199. (line 6)
  44200. * init_machine_status: Per-Function Data. (line 42)
  44201. * init_one_libfunc: Library Calls. (line 15)
  44202. * INIT_SECTION_ASM_OP: Sections. (line 90)
  44203. * INIT_SECTION_ASM_OP <1>: Macros for Initialization.
  44204. (line 9)
  44205. * inlining: Target Attributes. (line 103)
  44206. * insert_insn_on_edge: Maintaining the CFG.
  44207. (line 104)
  44208. * insn: Insns. (line 63)
  44209. * insn and /f: Flags. (line 135)
  44210. * insn and /j: Flags. (line 171)
  44211. * insn and /s: Flags. (line 38)
  44212. * insn and /s <1>: Flags. (line 162)
  44213. * insn and /u: Flags. (line 28)
  44214. * insn and /v: Flags. (line 33)
  44215. * insn attributes: Insn Attributes. (line 6)
  44216. * insn canonicalization: Insn Canonicalizations.
  44217. (line 6)
  44218. * insn includes: Including Patterns. (line 6)
  44219. * insn lengths, computing: Insn Lengths. (line 6)
  44220. * insn notes, notes: Basic Blocks. (line 52)
  44221. * insn splitting: Insn Splitting. (line 6)
  44222. * insn-attr.h: Defining Attributes.
  44223. (line 34)
  44224. * insns: Insns. (line 6)
  44225. * insns, generating: RTL Template. (line 6)
  44226. * insns, recognizing: RTL Template. (line 6)
  44227. * INSN_ANNULLED_BRANCH_P: Flags. (line 28)
  44228. * INSN_CODE: Insns. (line 318)
  44229. * INSN_DELETED_P: Flags. (line 33)
  44230. * INSN_FROM_TARGET_P: Flags. (line 38)
  44231. * insn_list: Insns. (line 568)
  44232. * INSN_REFERENCES_ARE_DELAYED: Misc. (line 502)
  44233. * INSN_SETS_ARE_DELAYED: Misc. (line 491)
  44234. * INSN_UID: Insns. (line 23)
  44235. * INSN_VAR_LOCATION: Insns. (line 247)
  44236. * instruction attributes: Insn Attributes. (line 6)
  44237. * instruction latency time: Processor pipeline description.
  44238. (line 6)
  44239. * instruction latency time <1>: Processor pipeline description.
  44240. (line 105)
  44241. * instruction latency time <2>: Processor pipeline description.
  44242. (line 196)
  44243. * instruction patterns: Patterns. (line 6)
  44244. * instruction splitting: Insn Splitting. (line 6)
  44245. * insv instruction pattern: Standard Names. (line 1562)
  44246. * insvM instruction pattern: Standard Names. (line 1514)
  44247. * insvmisalignM instruction pattern: Standard Names. (line 1524)
  44248. * int iterators in .md files: Int Iterators. (line 6)
  44249. * INT16_TYPE: Type Layout. (line 210)
  44250. * INT32_TYPE: Type Layout. (line 211)
  44251. * INT64_TYPE: Type Layout. (line 212)
  44252. * INT8_TYPE: Type Layout. (line 209)
  44253. * INTEGER_CST: Constant expressions.
  44254. (line 6)
  44255. * INTEGER_TYPE: Types. (line 6)
  44256. * inter-procedural optimization passes: IPA passes. (line 6)
  44257. * Interdependence of Patterns: Dependent Patterns. (line 6)
  44258. * interfacing to GCC output: Interface. (line 6)
  44259. * interlock delays: Processor pipeline description.
  44260. (line 6)
  44261. * intermediate representation lowering: Parsing pass. (line 13)
  44262. * INTMAX_TYPE: Type Layout. (line 186)
  44263. * INTPTR_TYPE: Type Layout. (line 233)
  44264. * introduction: Top. (line 6)
  44265. * INT_FAST16_TYPE: Type Layout. (line 226)
  44266. * INT_FAST32_TYPE: Type Layout. (line 227)
  44267. * INT_FAST64_TYPE: Type Layout. (line 228)
  44268. * INT_FAST8_TYPE: Type Layout. (line 225)
  44269. * INT_LEAST16_TYPE: Type Layout. (line 218)
  44270. * INT_LEAST32_TYPE: Type Layout. (line 219)
  44271. * INT_LEAST64_TYPE: Type Layout. (line 220)
  44272. * INT_LEAST8_TYPE: Type Layout. (line 217)
  44273. * INT_TYPE_SIZE: Type Layout. (line 11)
  44274. * INVOKE__main: Macros for Initialization.
  44275. (line 50)
  44276. * in_struct: Flags. (line 254)
  44277. * in_struct, in code_label and note: Flags. (line 48)
  44278. * in_struct, in insn and jump_insn and call_insn: Flags. (line 38)
  44279. * in_struct, in insn, call_insn, jump_insn and jump_table_data: Flags.
  44280. (line 162)
  44281. * in_struct, in subreg: Flags. (line 201)
  44282. * ior: Arithmetic. (line 163)
  44283. * ior and attributes: Expressions. (line 50)
  44284. * ior, canonicalization of: Insn Canonicalizations.
  44285. (line 67)
  44286. * iorM3 instruction pattern: Standard Names. (line 442)
  44287. * IPA passes: IPA passes. (line 6)
  44288. * IRA_HARD_REGNO_ADD_COST_MULTIPLIER: Allocation Order. (line 44)
  44289. * is_a: Machine Modes. (line 347)
  44290. * IS_ASM_LOGICAL_LINE_SEPARATOR: Data Output. (line 129)
  44291. * is_gimple_addressable: Logical Operators. (line 113)
  44292. * is_gimple_asm_val: Logical Operators. (line 117)
  44293. * is_gimple_assign: Logical Operators. (line 149)
  44294. * is_gimple_call: Logical Operators. (line 152)
  44295. * is_gimple_call_addr: Logical Operators. (line 120)
  44296. * is_gimple_constant: Logical Operators. (line 128)
  44297. * is_gimple_debug: Logical Operators. (line 155)
  44298. * is_gimple_ip_invariant: Logical Operators. (line 137)
  44299. * is_gimple_ip_invariant_address: Logical Operators. (line 142)
  44300. * is_gimple_mem_ref_addr: Logical Operators. (line 124)
  44301. * is_gimple_min_invariant: Logical Operators. (line 131)
  44302. * is_gimple_omp: Logical Operators. (line 166)
  44303. * is_gimple_val: Logical Operators. (line 107)
  44304. * iterators in .md files: Iterators. (line 6)
  44305. * IV analysis on GIMPLE: Scalar evolutions. (line 6)
  44306. * IV analysis on RTL: loop-iv. (line 6)
  44307. * JMP_BUF_SIZE: Exception Region Output.
  44308. (line 83)
  44309. * jump: Flags. (line 295)
  44310. * jump instruction pattern: Standard Names. (line 1704)
  44311. * jump instruction patterns: Jump Patterns. (line 6)
  44312. * jump instructions and set: Side Effects. (line 56)
  44313. * jump, in call_insn: Flags. (line 175)
  44314. * jump, in insn: Flags. (line 171)
  44315. * jump, in mem: Flags. (line 59)
  44316. * Jumps: Jumps. (line 6)
  44317. * JUMP_ALIGN: Alignment Output. (line 8)
  44318. * jump_insn: Insns. (line 73)
  44319. * jump_insn and /f: Flags. (line 135)
  44320. * jump_insn and /j: Flags. (line 10)
  44321. * jump_insn and /s: Flags. (line 38)
  44322. * jump_insn and /s <1>: Flags. (line 162)
  44323. * jump_insn and /u: Flags. (line 28)
  44324. * jump_insn and /v: Flags. (line 33)
  44325. * JUMP_LABEL: Insns. (line 80)
  44326. * JUMP_TABLES_IN_TEXT_SECTION: Sections. (line 155)
  44327. * jump_table_data: Insns. (line 166)
  44328. * jump_table_data and /s: Flags. (line 162)
  44329. * jump_table_data and /v: Flags. (line 33)
  44330. * LABEL_ALIGN: Alignment Output. (line 42)
  44331. * LABEL_ALIGN_AFTER_BARRIER: Alignment Output. (line 21)
  44332. * LABEL_ALTERNATE_NAME: Edges. (line 180)
  44333. * LABEL_ALT_ENTRY_P: Insns. (line 146)
  44334. * LABEL_DECL: Declarations. (line 6)
  44335. * LABEL_KIND: Insns. (line 146)
  44336. * LABEL_NUSES: Insns. (line 142)
  44337. * LABEL_PRESERVE_P: Flags. (line 48)
  44338. * label_ref: Constants. (line 199)
  44339. * label_ref and /v: Flags. (line 54)
  44340. * label_ref, RTL sharing: Sharing. (line 38)
  44341. * LABEL_REF_NONLOCAL_P: Flags. (line 54)
  44342. * language-dependent trees: Language-dependent trees.
  44343. (line 6)
  44344. * language-independent intermediate representation: Parsing pass.
  44345. (line 13)
  44346. * lang_hooks.gimplify_expr: Gimplification pass.
  44347. (line 18)
  44348. * lang_hooks.parse_file: Parsing pass. (line 6)
  44349. * large return values: Aggregate Return. (line 6)
  44350. * LAST_STACK_REG: Stack Registers. (line 30)
  44351. * LAST_VIRTUAL_REGISTER: Regs and Memory. (line 51)
  44352. * late IPA passes: Late IPA passes. (line 6)
  44353. * lceilMN2: Standard Names. (line 1137)
  44354. * LCSSA: LCSSA. (line 6)
  44355. * LDD_SUFFIX: Macros for Initialization.
  44356. (line 121)
  44357. * ldexpM3 instruction pattern: Standard Names. (line 922)
  44358. * LD_FINI_SWITCH: Macros for Initialization.
  44359. (line 28)
  44360. * LD_INIT_SWITCH: Macros for Initialization.
  44361. (line 24)
  44362. * le: Comparisons. (line 76)
  44363. * le and attributes: Expressions. (line 83)
  44364. * leaf functions: Leaf Functions. (line 6)
  44365. * leaf_function_p: Standard Names. (line 1788)
  44366. * LEAF_REGISTERS: Leaf Functions. (line 23)
  44367. * LEAF_REG_REMAP: Leaf Functions. (line 37)
  44368. * left rotate: Arithmetic. (line 195)
  44369. * left shift: Arithmetic. (line 173)
  44370. * LEGITIMATE_PIC_OPERAND_P: PIC. (line 31)
  44371. * LEGITIMIZE_RELOAD_ADDRESS: Addressing Modes. (line 150)
  44372. * length: GTY Options. (line 47)
  44373. * less than: Comparisons. (line 68)
  44374. * less than or equal: Comparisons. (line 76)
  44375. * leu: Comparisons. (line 76)
  44376. * leu and attributes: Expressions. (line 83)
  44377. * LE_EXPR: Unary and Binary Expressions.
  44378. (line 6)
  44379. * lfloorMN2: Standard Names. (line 1132)
  44380. * LIB2FUNCS_EXTRA: Target Fragment. (line 11)
  44381. * LIBCALL_VALUE: Scalar Return. (line 56)
  44382. * libgcc.a: Library Calls. (line 6)
  44383. * LIBGCC2_CFLAGS: Target Fragment. (line 8)
  44384. * LIBGCC2_GNU_PREFIX: Type Layout. (line 102)
  44385. * LIBGCC2_UNWIND_ATTRIBUTE: Misc. (line 1047)
  44386. * LIBGCC_SPEC: Driver. (line 115)
  44387. * library subroutine names: Library Calls. (line 6)
  44388. * LIBRARY_PATH_ENV: Misc. (line 543)
  44389. * LIB_SPEC: Driver. (line 107)
  44390. * LIMIT_RELOAD_CLASS: Register Classes. (line 296)
  44391. * LINK_COMMAND_SPEC: Driver. (line 240)
  44392. * LINK_EH_SPEC: Driver. (line 142)
  44393. * LINK_GCC_C_SEQUENCE_SPEC: Driver. (line 232)
  44394. * LINK_LIBGCC_SPECIAL_1: Driver. (line 227)
  44395. * LINK_SPEC: Driver. (line 100)
  44396. * list: Containers. (line 6)
  44397. * Liveness representation: Liveness information.
  44398. (line 6)
  44399. * load address instruction: Simple Constraints. (line 162)
  44400. * LOAD_EXTEND_OP: Misc. (line 80)
  44401. * load_multiple instruction pattern: Standard Names. (line 136)
  44402. * Local Register Allocator (LRA): RTL passes. (line 187)
  44403. * LOCAL_ALIGNMENT: Storage Layout. (line 284)
  44404. * LOCAL_CLASS_P: Classes. (line 70)
  44405. * LOCAL_DECL_ALIGNMENT: Storage Layout. (line 321)
  44406. * LOCAL_INCLUDE_DIR: Driver. (line 316)
  44407. * LOCAL_LABEL_PREFIX: Instruction Output. (line 151)
  44408. * LOCAL_REGNO: Register Basics. (line 143)
  44409. * location information: Guidelines for Diagnostics.
  44410. (line 159)
  44411. * log10M2 instruction pattern: Standard Names. (line 1026)
  44412. * log1pM2 instruction pattern: Standard Names. (line 1016)
  44413. * log2M2 instruction pattern: Standard Names. (line 1033)
  44414. * logbM2 instruction pattern: Standard Names. (line 1040)
  44415. * Logical Operators: Logical Operators. (line 6)
  44416. * logical-and, bitwise: Arithmetic. (line 158)
  44417. * LOGICAL_OP_NON_SHORT_CIRCUIT: Costs. (line 294)
  44418. * logM2 instruction pattern: Standard Names. (line 1009)
  44419. * LOG_LINKS: Insns. (line 337)
  44420. * longjmp and automatic variables: Interface. (line 52)
  44421. * LONG_ACCUM_TYPE_SIZE: Type Layout. (line 92)
  44422. * LONG_DOUBLE_TYPE_SIZE: Type Layout. (line 57)
  44423. * LONG_FRACT_TYPE_SIZE: Type Layout. (line 72)
  44424. * LONG_LONG_ACCUM_TYPE_SIZE: Type Layout. (line 97)
  44425. * LONG_LONG_FRACT_TYPE_SIZE: Type Layout. (line 77)
  44426. * LONG_LONG_TYPE_SIZE: Type Layout. (line 32)
  44427. * LONG_TYPE_SIZE: Type Layout. (line 21)
  44428. * Loop analysis: Loop representation.
  44429. (line 6)
  44430. * Loop manipulation: Loop manipulation. (line 6)
  44431. * Loop querying: Loop querying. (line 6)
  44432. * Loop representation: Loop representation.
  44433. (line 6)
  44434. * Loop-closed SSA form: LCSSA. (line 6)
  44435. * looping instruction patterns: Looping Patterns. (line 6)
  44436. * LOOP_ALIGN: Alignment Output. (line 29)
  44437. * LOOP_EXPR: Unary and Binary Expressions.
  44438. (line 6)
  44439. * lowering, language-dependent intermediate representation: Parsing pass.
  44440. (line 13)
  44441. * lo_sum: Arithmetic. (line 25)
  44442. * lrintMN2: Standard Names. (line 1122)
  44443. * lroundMN2: Standard Names. (line 1127)
  44444. * lshiftrt: Arithmetic. (line 190)
  44445. * lshiftrt and attributes: Expressions. (line 83)
  44446. * LSHIFT_EXPR: Unary and Binary Expressions.
  44447. (line 6)
  44448. * lshrM3 instruction pattern: Standard Names. (line 840)
  44449. * lt: Comparisons. (line 68)
  44450. * lt and attributes: Expressions. (line 83)
  44451. * LTGT_EXPR: Unary and Binary Expressions.
  44452. (line 6)
  44453. * lto: LTO. (line 6)
  44454. * ltrans: LTO. (line 6)
  44455. * ltu: Comparisons. (line 68)
  44456. * LT_EXPR: Unary and Binary Expressions.
  44457. (line 6)
  44458. * m in constraint: Simple Constraints. (line 17)
  44459. * machine attributes: Target Attributes. (line 6)
  44460. * machine description macros: Target Macros. (line 6)
  44461. * machine descriptions: Machine Desc. (line 6)
  44462. * machine mode conversions: Conversions. (line 6)
  44463. * machine mode wrapper classes: Machine Modes. (line 286)
  44464. * machine modes: Machine Modes. (line 6)
  44465. * machine specific constraints: Machine Constraints.
  44466. (line 6)
  44467. * machine-independent predicates: Machine-Independent Predicates.
  44468. (line 6)
  44469. * machine_mode: Machine Modes. (line 6)
  44470. * MACH_DEP_SECTION_ASM_FLAG: Sections. (line 120)
  44471. * macros, target description: Target Macros. (line 6)
  44472. * maddMN4 instruction pattern: Standard Names. (line 761)
  44473. * makefile fragment: Fragments. (line 6)
  44474. * makefile targets: Makefile. (line 6)
  44475. * MAKE_DECL_ONE_ONLY: Label Output. (line 281)
  44476. * make_safe_from: Expander Definitions.
  44477. (line 151)
  44478. * MALLOC_ABI_ALIGNMENT: Storage Layout. (line 190)
  44479. * Manipulating GIMPLE statements: Manipulating GIMPLE statements.
  44480. (line 6)
  44481. * marking roots: GGC Roots. (line 6)
  44482. * maskloadMN instruction pattern: Standard Names. (line 396)
  44483. * maskstoreMN instruction pattern: Standard Names. (line 403)
  44484. * mask_fold_left_plus_M instruction pattern: Standard Names. (line 564)
  44485. * mask_gather_loadMN instruction pattern: Standard Names. (line 249)
  44486. * MASK_RETURN_ADDR: Exception Region Output.
  44487. (line 35)
  44488. * mask_scatter_storeMN instruction pattern: Standard Names. (line 272)
  44489. * Match and Simplify: Match and Simplify. (line 6)
  44490. * matching constraint: Simple Constraints. (line 140)
  44491. * matching operands: Output Template. (line 49)
  44492. * match_dup: RTL Template. (line 73)
  44493. * match_dup <1>: define_peephole2. (line 28)
  44494. * match_dup and attributes: Insn Lengths. (line 16)
  44495. * match_operand: RTL Template. (line 16)
  44496. * match_operand and attributes: Expressions. (line 55)
  44497. * match_operator: RTL Template. (line 95)
  44498. * match_op_dup: RTL Template. (line 163)
  44499. * match_parallel: RTL Template. (line 172)
  44500. * match_par_dup: RTL Template. (line 219)
  44501. * match_scratch: RTL Template. (line 58)
  44502. * match_scratch <1>: define_peephole2. (line 28)
  44503. * match_test and attributes: Expressions. (line 64)
  44504. * math library: Soft float library routines.
  44505. (line 6)
  44506. * math, in RTL: Arithmetic. (line 6)
  44507. * matherr: Library Calls. (line 59)
  44508. * MATH_LIBRARY: Misc. (line 536)
  44509. * maxM3 instruction pattern: Standard Names. (line 503)
  44510. * MAX_BITSIZE_MODE_ANY_INT: Machine Modes. (line 444)
  44511. * MAX_BITSIZE_MODE_ANY_MODE: Machine Modes. (line 450)
  44512. * MAX_BITS_PER_WORD: Storage Layout. (line 54)
  44513. * MAX_CONDITIONAL_EXECUTE: Misc. (line 558)
  44514. * MAX_FIXED_MODE_SIZE: Storage Layout. (line 466)
  44515. * MAX_MOVE_MAX: Misc. (line 127)
  44516. * MAX_OFILE_ALIGNMENT: Storage Layout. (line 228)
  44517. * MAX_REGS_PER_ADDRESS: Addressing Modes. (line 42)
  44518. * MAX_STACK_ALIGNMENT: Storage Layout. (line 222)
  44519. * maybe_undef: GTY Options. (line 141)
  44520. * may_trap_p, tree_could_trap_p: Edges. (line 114)
  44521. * mcount: Profiling. (line 12)
  44522. * MD_EXEC_PREFIX: Driver. (line 271)
  44523. * MD_FALLBACK_FRAME_STATE_FOR: Exception Handling. (line 93)
  44524. * MD_HANDLE_UNWABI: Exception Handling. (line 112)
  44525. * MD_STARTFILE_PREFIX: Driver. (line 299)
  44526. * MD_STARTFILE_PREFIX_1: Driver. (line 304)
  44527. * mem: Regs and Memory. (line 396)
  44528. * mem and /c: Flags. (line 70)
  44529. * mem and /f: Flags. (line 74)
  44530. * mem and /j: Flags. (line 59)
  44531. * mem and /u: Flags. (line 78)
  44532. * mem and /v: Flags. (line 65)
  44533. * mem, RTL sharing: Sharing. (line 43)
  44534. * memory model: Memory model. (line 6)
  44535. * memory reference, nonoffsettable: Simple Constraints. (line 254)
  44536. * memory references in constraints: Simple Constraints. (line 17)
  44537. * memory_barrier instruction pattern: Standard Names. (line 2172)
  44538. * memory_blockage instruction pattern: Standard Names. (line 2163)
  44539. * MEMORY_MOVE_COST: Costs. (line 53)
  44540. * memory_operand: Machine-Independent Predicates.
  44541. (line 57)
  44542. * MEM_ADDR_SPACE: Special Accessors. (line 48)
  44543. * MEM_ALIAS_SET: Special Accessors. (line 9)
  44544. * MEM_ALIGN: Special Accessors. (line 45)
  44545. * MEM_EXPR: Special Accessors. (line 19)
  44546. * MEM_KEEP_ALIAS_SET_P: Flags. (line 59)
  44547. * MEM_NOTRAP_P: Flags. (line 70)
  44548. * MEM_OFFSET: Special Accessors. (line 31)
  44549. * MEM_OFFSET_KNOWN_P: Special Accessors. (line 27)
  44550. * MEM_POINTER: Flags. (line 74)
  44551. * MEM_READONLY_P: Flags. (line 78)
  44552. * MEM_REF: Storage References. (line 6)
  44553. * MEM_SIZE: Special Accessors. (line 39)
  44554. * MEM_SIZE_KNOWN_P: Special Accessors. (line 35)
  44555. * mem_thread_fence instruction pattern: Standard Names. (line 2462)
  44556. * MEM_VOLATILE_P: Flags. (line 65)
  44557. * METHOD_TYPE: Types. (line 6)
  44558. * MINIMUM_ALIGNMENT: Storage Layout. (line 334)
  44559. * MINIMUM_ATOMIC_ALIGNMENT: Storage Layout. (line 198)
  44560. * minM3 instruction pattern: Standard Names. (line 503)
  44561. * minus: Arithmetic. (line 38)
  44562. * minus and attributes: Expressions. (line 83)
  44563. * minus, canonicalization of: Insn Canonicalizations.
  44564. (line 27)
  44565. * MINUS_EXPR: Unary and Binary Expressions.
  44566. (line 6)
  44567. * MIN_UNITS_PER_WORD: Storage Layout. (line 64)
  44568. * MIPS coprocessor-definition macros: MIPS Coprocessors. (line 6)
  44569. * miscellaneous register hooks: Miscellaneous Register Hooks.
  44570. (line 6)
  44571. * mnemonic attribute: Mnemonic Attribute. (line 6)
  44572. * mod: Arithmetic. (line 136)
  44573. * mod and attributes: Expressions. (line 83)
  44574. * mode classes: Machine Modes. (line 226)
  44575. * mode iterators in .md files: Mode Iterators. (line 6)
  44576. * mode switching: Mode Switching. (line 6)
  44577. * MODE_ACCUM: Machine Modes. (line 256)
  44578. * MODE_BASE_REG_CLASS: Register Classes. (line 116)
  44579. * MODE_BASE_REG_REG_CLASS: Register Classes. (line 122)
  44580. * MODE_CC: Machine Modes. (line 271)
  44581. * MODE_CC <1>: MODE_CC Condition Codes.
  44582. (line 6)
  44583. * MODE_CODE_BASE_REG_CLASS: Register Classes. (line 129)
  44584. * MODE_COMPLEX_FLOAT: Machine Modes. (line 267)
  44585. * MODE_COMPLEX_INT: Machine Modes. (line 264)
  44586. * MODE_DECIMAL_FLOAT: Machine Modes. (line 244)
  44587. * MODE_FLOAT: Machine Modes. (line 240)
  44588. * MODE_FRACT: Machine Modes. (line 248)
  44589. * MODE_INT: Machine Modes. (line 232)
  44590. * MODE_PARTIAL_INT: Machine Modes. (line 236)
  44591. * MODE_POINTER_BOUNDS: Machine Modes. (line 276)
  44592. * MODE_RANDOM: Machine Modes. (line 281)
  44593. * MODE_UACCUM: Machine Modes. (line 260)
  44594. * MODE_UFRACT: Machine Modes. (line 252)
  44595. * modifiers in constraints: Modifiers. (line 6)
  44596. * MODIFY_EXPR: Unary and Binary Expressions.
  44597. (line 6)
  44598. * modM3 instruction pattern: Standard Names. (line 442)
  44599. * modulo scheduling: RTL passes. (line 123)
  44600. * MOVE_MAX: Misc. (line 122)
  44601. * MOVE_MAX_PIECES: Costs. (line 210)
  44602. * MOVE_RATIO: Costs. (line 149)
  44603. * movM instruction pattern: Standard Names. (line 11)
  44604. * movmemM instruction pattern: Standard Names. (line 1281)
  44605. * movmisalignM instruction pattern: Standard Names. (line 125)
  44606. * movMODEcc instruction pattern: Standard Names. (line 1576)
  44607. * movstr instruction pattern: Standard Names. (line 1317)
  44608. * movstrictM instruction pattern: Standard Names. (line 119)
  44609. * msubMN4 instruction pattern: Standard Names. (line 784)
  44610. * mulhisi3 instruction pattern: Standard Names. (line 737)
  44611. * mulM3 instruction pattern: Standard Names. (line 442)
  44612. * mulqihi3 instruction pattern: Standard Names. (line 741)
  44613. * mulsidi3 instruction pattern: Standard Names. (line 741)
  44614. * mult: Arithmetic. (line 93)
  44615. * mult and attributes: Expressions. (line 83)
  44616. * mult, canonicalization of: Insn Canonicalizations.
  44617. (line 27)
  44618. * mult, canonicalization of <1>: Insn Canonicalizations.
  44619. (line 107)
  44620. * MULTIARCH_DIRNAME: Target Fragment. (line 173)
  44621. * MULTILIB_DEFAULTS: Driver. (line 256)
  44622. * MULTILIB_DIRNAMES: Target Fragment. (line 44)
  44623. * MULTILIB_EXCEPTIONS: Target Fragment. (line 70)
  44624. * MULTILIB_EXTRA_OPTS: Target Fragment. (line 135)
  44625. * MULTILIB_MATCHES: Target Fragment. (line 63)
  44626. * MULTILIB_OPTIONS: Target Fragment. (line 24)
  44627. * MULTILIB_OSDIRNAMES: Target Fragment. (line 142)
  44628. * MULTILIB_REQUIRED: Target Fragment. (line 82)
  44629. * MULTILIB_REUSE: Target Fragment. (line 103)
  44630. * multiple alternative constraints: Multi-Alternative. (line 6)
  44631. * MULTIPLE_SYMBOL_SPACES: Misc. (line 515)
  44632. * multiplication: Arithmetic. (line 93)
  44633. * multiplication with signed saturation: Arithmetic. (line 93)
  44634. * multiplication with unsigned saturation: Arithmetic. (line 93)
  44635. * MULT_EXPR: Unary and Binary Expressions.
  44636. (line 6)
  44637. * MULT_HIGHPART_EXPR: Unary and Binary Expressions.
  44638. (line 6)
  44639. * mulvM4 instruction pattern: Standard Names. (line 458)
  44640. * n in constraint: Simple Constraints. (line 73)
  44641. * name: Identifiers. (line 6)
  44642. * named address spaces: Named Address Spaces.
  44643. (line 6)
  44644. * named patterns and conditions: Patterns. (line 61)
  44645. * names, pattern: Standard Names. (line 6)
  44646. * namespace, scope: Namespaces. (line 6)
  44647. * NAMESPACE_DECL: Declarations. (line 6)
  44648. * NAMESPACE_DECL <1>: Namespaces. (line 6)
  44649. * NATIVE_SYSTEM_HEADER_COMPONENT: Driver. (line 326)
  44650. * ne: Comparisons. (line 56)
  44651. * ne and attributes: Expressions. (line 83)
  44652. * nearbyintM2 instruction pattern: Standard Names. (line 1106)
  44653. * neg: Arithmetic. (line 82)
  44654. * neg and attributes: Expressions. (line 83)
  44655. * neg, canonicalization of: Insn Canonicalizations.
  44656. (line 27)
  44657. * NEGATE_EXPR: Unary and Binary Expressions.
  44658. (line 6)
  44659. * negation: Arithmetic. (line 82)
  44660. * negation with signed saturation: Arithmetic. (line 82)
  44661. * negation with unsigned saturation: Arithmetic. (line 82)
  44662. * negM2 instruction pattern: Standard Names. (line 872)
  44663. * negMODEcc instruction pattern: Standard Names. (line 1645)
  44664. * negvM3 instruction pattern: Standard Names. (line 875)
  44665. * nested functions, support for: Trampolines. (line 6)
  44666. * nested_ptr: GTY Options. (line 149)
  44667. * next_bb, prev_bb, FOR_EACH_BB, FOR_ALL_BB: Basic Blocks. (line 25)
  44668. * NEXT_INSN: Insns. (line 30)
  44669. * NEXT_OBJC_RUNTIME: Library Calls. (line 86)
  44670. * NE_EXPR: Unary and Binary Expressions.
  44671. (line 6)
  44672. * nil: RTL Objects. (line 73)
  44673. * NM_FLAGS: Macros for Initialization.
  44674. (line 110)
  44675. * nondeterministic finite state automaton: Processor pipeline description.
  44676. (line 304)
  44677. * nonimmediate_operand: Machine-Independent Predicates.
  44678. (line 100)
  44679. * nonlocal goto handler: Edges. (line 171)
  44680. * nonlocal_goto instruction pattern: Standard Names. (line 1998)
  44681. * nonlocal_goto_receiver instruction pattern: Standard Names.
  44682. (line 2015)
  44683. * nonmemory_operand: Machine-Independent Predicates.
  44684. (line 96)
  44685. * nonoffsettable memory reference: Simple Constraints. (line 254)
  44686. * NON_LVALUE_EXPR: Unary and Binary Expressions.
  44687. (line 6)
  44688. * nop instruction pattern: Standard Names. (line 1821)
  44689. * NOP_EXPR: Unary and Binary Expressions.
  44690. (line 6)
  44691. * normal predicates: Predicates. (line 31)
  44692. * not: Arithmetic. (line 154)
  44693. * not and attributes: Expressions. (line 50)
  44694. * not equal: Comparisons. (line 56)
  44695. * not, canonicalization of: Insn Canonicalizations.
  44696. (line 27)
  44697. * note: Insns. (line 183)
  44698. * note and /i: Flags. (line 48)
  44699. * note and /v: Flags. (line 33)
  44700. * NOTE_INSN_BASIC_BLOCK: Basic Blocks. (line 50)
  44701. * NOTE_INSN_BASIC_BLOCK <1>: Basic Blocks. (line 52)
  44702. * NOTE_INSN_BEGIN_STMT: Insns. (line 233)
  44703. * NOTE_INSN_BLOCK_BEG: Insns. (line 208)
  44704. * NOTE_INSN_BLOCK_END: Insns. (line 208)
  44705. * NOTE_INSN_DELETED: Insns. (line 198)
  44706. * NOTE_INSN_DELETED_LABEL: Insns. (line 203)
  44707. * NOTE_INSN_EH_REGION_BEG: Insns. (line 214)
  44708. * NOTE_INSN_EH_REGION_END: Insns. (line 214)
  44709. * NOTE_INSN_FUNCTION_BEG: Insns. (line 221)
  44710. * NOTE_INSN_INLINE_ENTRY: Insns. (line 238)
  44711. * NOTE_INSN_VAR_LOCATION: Insns. (line 225)
  44712. * NOTE_LINE_NUMBER: Insns. (line 183)
  44713. * NOTE_SOURCE_FILE: Insns. (line 183)
  44714. * NOTE_VAR_LOCATION: Insns. (line 225)
  44715. * NOTICE_UPDATE_CC: CC0 Condition Codes.
  44716. (line 30)
  44717. * notMODEcc instruction pattern: Standard Names. (line 1652)
  44718. * NO_DBX_BNSYM_ENSYM: DBX Hooks. (line 25)
  44719. * NO_DBX_FUNCTION_END: DBX Hooks. (line 19)
  44720. * NO_DBX_GCC_MARKER: File Names and DBX. (line 27)
  44721. * NO_DBX_MAIN_SOURCE_DIRECTORY: File Names and DBX. (line 22)
  44722. * NO_DOLLAR_IN_LABEL: Label Output. (line 64)
  44723. * NO_DOT_IN_LABEL: Label Output. (line 70)
  44724. * NO_FUNCTION_CSE: Costs. (line 289)
  44725. * NO_PROFILE_COUNTERS: Profiling. (line 27)
  44726. * NO_REGS: Register Classes. (line 17)
  44727. * Number of iterations analysis: Number of iterations.
  44728. (line 6)
  44729. * NUM_MACHINE_MODES: Machine Modes. (line 383)
  44730. * NUM_MODES_FOR_MODE_SWITCHING: Mode Switching. (line 30)
  44731. * NUM_POLY_INT_COEFFS: Overview of poly_int.
  44732. (line 24)
  44733. * N_REG_CLASSES: Register Classes. (line 81)
  44734. * o in constraint: Simple Constraints. (line 23)
  44735. * OACC_CACHE: OpenACC. (line 6)
  44736. * OACC_DATA: OpenACC. (line 6)
  44737. * OACC_DECLARE: OpenACC. (line 6)
  44738. * OACC_ENTER_DATA: OpenACC. (line 6)
  44739. * OACC_EXIT_DATA: OpenACC. (line 6)
  44740. * OACC_HOST_DATA: OpenACC. (line 6)
  44741. * OACC_KERNELS: OpenACC. (line 6)
  44742. * OACC_LOOP: OpenACC. (line 6)
  44743. * OACC_PARALLEL: OpenACC. (line 6)
  44744. * OACC_SERIAL: OpenACC. (line 6)
  44745. * OACC_UPDATE: OpenACC. (line 6)
  44746. * OBJC_GEN_METHOD_LABEL: Label Output. (line 482)
  44747. * OBJC_JBLEN: Misc. (line 1042)
  44748. * OBJECT_FORMAT_COFF: Macros for Initialization.
  44749. (line 96)
  44750. * offsettable address: Simple Constraints. (line 23)
  44751. * OFFSET_TYPE: Types. (line 6)
  44752. * OImode: Machine Modes. (line 51)
  44753. * OMP_ATOMIC: OpenMP. (line 6)
  44754. * OMP_CLAUSE: OpenMP. (line 6)
  44755. * OMP_CONTINUE: OpenMP. (line 6)
  44756. * OMP_CRITICAL: OpenMP. (line 6)
  44757. * OMP_FOR: OpenMP. (line 6)
  44758. * OMP_MASTER: OpenMP. (line 6)
  44759. * OMP_ORDERED: OpenMP. (line 6)
  44760. * OMP_PARALLEL: OpenMP. (line 6)
  44761. * OMP_RETURN: OpenMP. (line 6)
  44762. * OMP_SECTION: OpenMP. (line 6)
  44763. * OMP_SECTIONS: OpenMP. (line 6)
  44764. * OMP_SINGLE: OpenMP. (line 6)
  44765. * one_cmplM2 instruction pattern: Standard Names. (line 1241)
  44766. * operand access: Accessors. (line 6)
  44767. * Operand Access Routines: SSA Operands. (line 116)
  44768. * operand constraints: Constraints. (line 6)
  44769. * Operand Iterators: SSA Operands. (line 116)
  44770. * operand predicates: Predicates. (line 6)
  44771. * operand substitution: Output Template. (line 6)
  44772. * Operands: Operands. (line 6)
  44773. * operands: SSA Operands. (line 6)
  44774. * operands <1>: Patterns. (line 67)
  44775. * operator predicates: Predicates. (line 6)
  44776. * optc-gen.awk: Options. (line 6)
  44777. * OPTGROUP_ALL: Optimization groups.
  44778. (line 28)
  44779. * OPTGROUP_INLINE: Optimization groups.
  44780. (line 15)
  44781. * OPTGROUP_IPA: Optimization groups.
  44782. (line 9)
  44783. * OPTGROUP_LOOP: Optimization groups.
  44784. (line 12)
  44785. * OPTGROUP_OMP: Optimization groups.
  44786. (line 18)
  44787. * OPTGROUP_OTHER: Optimization groups.
  44788. (line 24)
  44789. * OPTGROUP_VEC: Optimization groups.
  44790. (line 21)
  44791. * optimization dumps: Optimization info. (line 6)
  44792. * optimization groups: Optimization groups.
  44793. (line 6)
  44794. * optimization info file names: Dump files and streams.
  44795. (line 6)
  44796. * Optimization infrastructure for GIMPLE: Tree SSA. (line 6)
  44797. * OPTIMIZE_MODE_SWITCHING: Mode Switching. (line 8)
  44798. * option specification files: Options. (line 6)
  44799. * optional hardware or system features: Run-time Target. (line 59)
  44800. * options, directory search: Including Patterns. (line 47)
  44801. * options, guidelines for: Guidelines for Options.
  44802. (line 6)
  44803. * OPTION_DEFAULT_SPECS: Driver. (line 25)
  44804. * opt_mode: Machine Modes. (line 322)
  44805. * order of register allocation: Allocation Order. (line 6)
  44806. * ordered_comparison_operator: Machine-Independent Predicates.
  44807. (line 115)
  44808. * ORDERED_EXPR: Unary and Binary Expressions.
  44809. (line 6)
  44810. * Ordering of Patterns: Pattern Ordering. (line 6)
  44811. * ORIGINAL_REGNO: Special Accessors. (line 53)
  44812. * other register constraints: Simple Constraints. (line 171)
  44813. * outgoing_args_size: Stack Arguments. (line 48)
  44814. * OUTGOING_REGNO: Register Basics. (line 136)
  44815. * OUTGOING_REG_PARM_STACK_SPACE: Stack Arguments. (line 79)
  44816. * output of assembler code: File Framework. (line 6)
  44817. * output statements: Output Statement. (line 6)
  44818. * output templates: Output Template. (line 6)
  44819. * output_asm_insn: Output Statement. (line 52)
  44820. * OUTPUT_QUOTED_STRING: File Framework. (line 105)
  44821. * OVERLAPPING_REGISTER_NAMES: Instruction Output. (line 20)
  44822. * OVERLOAD: Functions for C++. (line 6)
  44823. * OVERRIDE_ABI_FORMAT: Register Arguments. (line 150)
  44824. * OVL_CURRENT: Functions for C++. (line 6)
  44825. * OVL_NEXT: Functions for C++. (line 6)
  44826. * p in constraint: Simple Constraints. (line 162)
  44827. * PAD_VARARGS_DOWN: Register Arguments. (line 230)
  44828. * parallel: Side Effects. (line 210)
  44829. * parameters, c++ abi: C++ ABI. (line 6)
  44830. * parameters, d abi: D Language and ABI. (line 6)
  44831. * parameters, miscellaneous: Misc. (line 6)
  44832. * parameters, precompiled headers: PCH Target. (line 6)
  44833. * parity: Arithmetic. (line 242)
  44834. * parityM2 instruction pattern: Standard Names. (line 1228)
  44835. * PARM_BOUNDARY: Storage Layout. (line 150)
  44836. * PARM_DECL: Declarations. (line 6)
  44837. * PARSE_LDD_OUTPUT: Macros for Initialization.
  44838. (line 125)
  44839. * pass dumps: Passes. (line 6)
  44840. * passes and files of the compiler: Passes. (line 6)
  44841. * passing arguments: Interface. (line 36)
  44842. * pass_duplicate_computed_gotos: Edges. (line 161)
  44843. * PATH_SEPARATOR: Filesystem. (line 31)
  44844. * PATTERN: Insns. (line 307)
  44845. * pattern conditions: Patterns. (line 55)
  44846. * pattern names: Standard Names. (line 6)
  44847. * Pattern Ordering: Pattern Ordering. (line 6)
  44848. * patterns: Patterns. (line 6)
  44849. * pc: Regs and Memory. (line 383)
  44850. * pc and attributes: Insn Lengths. (line 20)
  44851. * pc, RTL sharing: Sharing. (line 28)
  44852. * PCC_BITFIELD_TYPE_MATTERS: Storage Layout. (line 360)
  44853. * PCC_STATIC_STRUCT_RETURN: Aggregate Return. (line 64)
  44854. * PC_REGNUM: Register Basics. (line 150)
  44855. * pc_rtx: Regs and Memory. (line 388)
  44856. * PDImode: Machine Modes. (line 40)
  44857. * peephole optimization, RTL representation: Side Effects. (line 244)
  44858. * peephole optimizer definitions: Peephole Definitions.
  44859. (line 6)
  44860. * per-function data: Per-Function Data. (line 6)
  44861. * percent sign: Output Template. (line 6)
  44862. * PHI nodes: SSA. (line 31)
  44863. * PIC: PIC. (line 6)
  44864. * PIC_OFFSET_TABLE_REGNUM: PIC. (line 15)
  44865. * PIC_OFFSET_TABLE_REG_CALL_CLOBBERED: PIC. (line 25)
  44866. * pipeline hazard recognizer: Processor pipeline description.
  44867. (line 6)
  44868. * pipeline hazard recognizer <1>: Processor pipeline description.
  44869. (line 53)
  44870. * Plugins: Plugins. (line 6)
  44871. * plus: Arithmetic. (line 14)
  44872. * plus and attributes: Expressions. (line 83)
  44873. * plus, canonicalization of: Insn Canonicalizations.
  44874. (line 27)
  44875. * PLUS_EXPR: Unary and Binary Expressions.
  44876. (line 6)
  44877. * Pmode: Misc. (line 363)
  44878. * pmode_register_operand: Machine-Independent Predicates.
  44879. (line 34)
  44880. * pointer: Types. (line 6)
  44881. * POINTERS_EXTEND_UNSIGNED: Storage Layout. (line 76)
  44882. * POINTER_DIFF_EXPR: Unary and Binary Expressions.
  44883. (line 6)
  44884. * POINTER_PLUS_EXPR: Unary and Binary Expressions.
  44885. (line 6)
  44886. * POINTER_SIZE: Storage Layout. (line 70)
  44887. * POINTER_TYPE: Types. (line 6)
  44888. * polynomial integers: poly_int. (line 6)
  44889. * poly_int: poly_int. (line 6)
  44890. * poly_int, invariant range: Overview of poly_int.
  44891. (line 31)
  44892. * poly_int, main typedefs: Overview of poly_int.
  44893. (line 46)
  44894. * poly_int, runtime value: Overview of poly_int.
  44895. (line 6)
  44896. * poly_int, template parameters: Overview of poly_int.
  44897. (line 24)
  44898. * poly_int, use in target-independent code: Consequences of using poly_int.
  44899. (line 32)
  44900. * poly_int, use in target-specific code: Consequences of using poly_int.
  44901. (line 40)
  44902. * POLY_INT_CST: Constant expressions.
  44903. (line 6)
  44904. * popcount: Arithmetic. (line 238)
  44905. * popcountM2 instruction pattern: Standard Names. (line 1216)
  44906. * pops_args: Function Entry. (line 111)
  44907. * pop_operand: Machine-Independent Predicates.
  44908. (line 87)
  44909. * portability: Portability. (line 6)
  44910. * position independent code: PIC. (line 6)
  44911. * POSTDECREMENT_EXPR: Unary and Binary Expressions.
  44912. (line 6)
  44913. * POSTINCREMENT_EXPR: Unary and Binary Expressions.
  44914. (line 6)
  44915. * post_dec: Incdec. (line 25)
  44916. * post_inc: Incdec. (line 30)
  44917. * POST_LINK_SPEC: Driver. (line 236)
  44918. * post_modify: Incdec. (line 33)
  44919. * post_order_compute, inverted_post_order_compute, walk_dominator_tree: Basic Blocks.
  44920. (line 34)
  44921. * POWI_MAX_MULTS: Misc. (line 927)
  44922. * powM3 instruction pattern: Standard Names. (line 1054)
  44923. * pragma: Misc. (line 420)
  44924. * PREDECREMENT_EXPR: Unary and Binary Expressions.
  44925. (line 6)
  44926. * predefined macros: Run-time Target. (line 6)
  44927. * predicates: Predicates. (line 6)
  44928. * predicates and machine modes: Predicates. (line 31)
  44929. * predication: Conditional Execution.
  44930. (line 6)
  44931. * predict.def: Profile information.
  44932. (line 24)
  44933. * PREFERRED_DEBUGGING_TYPE: All Debuggers. (line 40)
  44934. * PREFERRED_RELOAD_CLASS: Register Classes. (line 249)
  44935. * PREFERRED_STACK_BOUNDARY: Storage Layout. (line 164)
  44936. * prefetch: Side Effects. (line 324)
  44937. * prefetch and /v: Flags. (line 92)
  44938. * prefetch instruction pattern: Standard Names. (line 2140)
  44939. * PREFETCH_SCHEDULE_BARRIER_P: Flags. (line 92)
  44940. * PREINCREMENT_EXPR: Unary and Binary Expressions.
  44941. (line 6)
  44942. * presence_set: Processor pipeline description.
  44943. (line 223)
  44944. * preserving SSA form: SSA. (line 74)
  44945. * pretend_args_size: Function Entry. (line 117)
  44946. * prev_active_insn: define_peephole. (line 60)
  44947. * PREV_INSN: Insns. (line 26)
  44948. * pre_dec: Incdec. (line 8)
  44949. * PRE_GCC3_DWARF_FRAME_REGISTERS: Frame Registers. (line 126)
  44950. * pre_inc: Incdec. (line 22)
  44951. * pre_modify: Incdec. (line 52)
  44952. * PRINT_OPERAND: Instruction Output. (line 95)
  44953. * PRINT_OPERAND_ADDRESS: Instruction Output. (line 122)
  44954. * PRINT_OPERAND_PUNCT_VALID_P: Instruction Output. (line 115)
  44955. * probe_stack instruction pattern: Standard Names. (line 1990)
  44956. * probe_stack_address instruction pattern: Standard Names. (line 1983)
  44957. * processor functional units: Processor pipeline description.
  44958. (line 6)
  44959. * processor functional units <1>: Processor pipeline description.
  44960. (line 68)
  44961. * processor pipeline description: Processor pipeline description.
  44962. (line 6)
  44963. * product: Arithmetic. (line 93)
  44964. * profile feedback: Profile information.
  44965. (line 14)
  44966. * profile representation: Profile information.
  44967. (line 6)
  44968. * PROFILE_BEFORE_PROLOGUE: Profiling. (line 34)
  44969. * PROFILE_HOOK: Profiling. (line 22)
  44970. * profiling, code generation: Profiling. (line 6)
  44971. * program counter: Regs and Memory. (line 384)
  44972. * prologue: Function Entry. (line 6)
  44973. * prologue instruction pattern: Standard Names. (line 2079)
  44974. * PROMOTE_MODE: Storage Layout. (line 87)
  44975. * pseudo registers: Regs and Memory. (line 9)
  44976. * PSImode: Machine Modes. (line 32)
  44977. * PTRDIFF_TYPE: Type Layout. (line 157)
  44978. * purge_dead_edges: Edges. (line 103)
  44979. * purge_dead_edges <1>: Maintaining the CFG.
  44980. (line 81)
  44981. * push address instruction: Simple Constraints. (line 162)
  44982. * pushM1 instruction pattern: Standard Names. (line 429)
  44983. * PUSH_ARGS: Stack Arguments. (line 17)
  44984. * PUSH_ARGS_REVERSED: Stack Arguments. (line 25)
  44985. * push_operand: Machine-Independent Predicates.
  44986. (line 80)
  44987. * push_reload: Addressing Modes. (line 176)
  44988. * PUSH_ROUNDING: Stack Arguments. (line 31)
  44989. * PUT_CODE: RTL Objects. (line 47)
  44990. * PUT_MODE: Machine Modes. (line 380)
  44991. * PUT_REG_NOTE_KIND: Insns. (line 369)
  44992. * QCmode: Machine Modes. (line 199)
  44993. * QFmode: Machine Modes. (line 57)
  44994. * QImode: Machine Modes. (line 25)
  44995. * QImode, in insn: Insns. (line 291)
  44996. * QQmode: Machine Modes. (line 106)
  44997. * qualified type: Types. (line 6)
  44998. * qualified type <1>: Types for C++. (line 6)
  44999. * querying function unit reservations: Processor pipeline description.
  45000. (line 90)
  45001. * question mark: Multi-Alternative. (line 42)
  45002. * quotient: Arithmetic. (line 116)
  45003. * r in constraint: Simple Constraints. (line 64)
  45004. * RDIV_EXPR: Unary and Binary Expressions.
  45005. (line 6)
  45006. * READONLY_DATA_SECTION_ASM_OP: Sections. (line 62)
  45007. * real operands: SSA Operands. (line 6)
  45008. * REALPART_EXPR: Unary and Binary Expressions.
  45009. (line 6)
  45010. * REAL_CST: Constant expressions.
  45011. (line 6)
  45012. * REAL_LIBGCC_SPEC: Driver. (line 124)
  45013. * REAL_NM_FILE_NAME: Macros for Initialization.
  45014. (line 105)
  45015. * REAL_TYPE: Types. (line 6)
  45016. * REAL_VALUE_ABS: Floating Point. (line 58)
  45017. * REAL_VALUE_ATOF: Floating Point. (line 39)
  45018. * REAL_VALUE_FIX: Floating Point. (line 31)
  45019. * REAL_VALUE_ISINF: Floating Point. (line 49)
  45020. * REAL_VALUE_ISNAN: Floating Point. (line 52)
  45021. * REAL_VALUE_NEGATE: Floating Point. (line 55)
  45022. * REAL_VALUE_NEGATIVE: Floating Point. (line 46)
  45023. * REAL_VALUE_TO_TARGET_DECIMAL128: Data Output. (line 153)
  45024. * REAL_VALUE_TO_TARGET_DECIMAL32: Data Output. (line 151)
  45025. * REAL_VALUE_TO_TARGET_DECIMAL64: Data Output. (line 152)
  45026. * REAL_VALUE_TO_TARGET_DOUBLE: Data Output. (line 149)
  45027. * REAL_VALUE_TO_TARGET_LONG_DOUBLE: Data Output. (line 150)
  45028. * REAL_VALUE_TO_TARGET_SINGLE: Data Output. (line 148)
  45029. * REAL_VALUE_TYPE: Floating Point. (line 25)
  45030. * REAL_VALUE_UNSIGNED_FIX: Floating Point. (line 34)
  45031. * recognizing insns: RTL Template. (line 6)
  45032. * recog_data.operand: Instruction Output. (line 54)
  45033. * RECORD_TYPE: Types. (line 6)
  45034. * RECORD_TYPE <1>: Classes. (line 6)
  45035. * redirect_edge_and_branch: Profile information.
  45036. (line 71)
  45037. * redirect_edge_and_branch, redirect_jump: Maintaining the CFG.
  45038. (line 89)
  45039. * reduc_and_scal_M instruction pattern: Standard Names. (line 535)
  45040. * reduc_ior_scal_M instruction pattern: Standard Names. (line 536)
  45041. * reduc_plus_scal_M instruction pattern: Standard Names. (line 530)
  45042. * reduc_smax_scal_M instruction pattern: Standard Names. (line 520)
  45043. * reduc_smin_scal_M instruction pattern: Standard Names. (line 520)
  45044. * reduc_umax_scal_M instruction pattern: Standard Names. (line 525)
  45045. * reduc_umin_scal_M instruction pattern: Standard Names. (line 525)
  45046. * reduc_xor_scal_M instruction pattern: Standard Names. (line 537)
  45047. * reference: Types. (line 6)
  45048. * REFERENCE_TYPE: Types. (line 6)
  45049. * reg: Regs and Memory. (line 9)
  45050. * reg and /f: Flags. (line 102)
  45051. * reg and /i: Flags. (line 97)
  45052. * reg and /v: Flags. (line 106)
  45053. * reg, RTL sharing: Sharing. (line 17)
  45054. * register allocation order: Allocation Order. (line 6)
  45055. * register class definitions: Register Classes. (line 6)
  45056. * register class preference constraints: Class Preferences. (line 6)
  45057. * register pairs: Values in Registers.
  45058. (line 65)
  45059. * Register Transfer Language (RTL): RTL. (line 6)
  45060. * register usage: Registers. (line 6)
  45061. * registers arguments: Register Arguments. (line 6)
  45062. * registers in constraints: Simple Constraints. (line 64)
  45063. * REGISTER_MOVE_COST: Costs. (line 9)
  45064. * REGISTER_NAMES: Instruction Output. (line 8)
  45065. * register_operand: Machine-Independent Predicates.
  45066. (line 29)
  45067. * REGISTER_PREFIX: Instruction Output. (line 150)
  45068. * REGISTER_TARGET_PRAGMAS: Misc. (line 420)
  45069. * REGMODE_NATURAL_SIZE: Regs and Memory. (line 191)
  45070. * REGMODE_NATURAL_SIZE <1>: Regs and Memory. (line 268)
  45071. * REGMODE_NATURAL_SIZE <2>: Values in Registers.
  45072. (line 46)
  45073. * REGNO_MODE_CODE_OK_FOR_BASE_P: Register Classes. (line 172)
  45074. * REGNO_MODE_OK_FOR_BASE_P: Register Classes. (line 150)
  45075. * REGNO_MODE_OK_FOR_REG_BASE_P: Register Classes. (line 160)
  45076. * REGNO_OK_FOR_BASE_P: Register Classes. (line 146)
  45077. * REGNO_OK_FOR_INDEX_P: Register Classes. (line 186)
  45078. * REGNO_REG_CLASS: Register Classes. (line 105)
  45079. * regs_ever_live: Function Entry. (line 29)
  45080. * regular expressions: Processor pipeline description.
  45081. (line 6)
  45082. * regular expressions <1>: Processor pipeline description.
  45083. (line 105)
  45084. * regular IPA passes: Regular IPA passes. (line 6)
  45085. * REG_ALLOC_ORDER: Allocation Order. (line 8)
  45086. * REG_BR_PRED: Insns. (line 541)
  45087. * REG_BR_PROB: Insns. (line 533)
  45088. * REG_BR_PROB_BASE, BB_FREQ_BASE, count: Profile information.
  45089. (line 82)
  45090. * REG_BR_PROB_BASE, EDGE_FREQUENCY: Profile information.
  45091. (line 52)
  45092. * REG_CALL_NOCF_CHECK: Insns. (line 557)
  45093. * REG_CC_SETTER: Insns. (line 505)
  45094. * REG_CC_USER: Insns. (line 505)
  45095. * reg_class_contents: Register Basics. (line 102)
  45096. * REG_CLASS_CONTENTS: Register Classes. (line 91)
  45097. * reg_class_for_constraint: C Constraint Interface.
  45098. (line 48)
  45099. * REG_CLASS_NAMES: Register Classes. (line 86)
  45100. * REG_DEAD: Insns. (line 380)
  45101. * REG_DEAD, REG_UNUSED: Liveness information.
  45102. (line 32)
  45103. * REG_DEP_ANTI: Insns. (line 527)
  45104. * REG_DEP_OUTPUT: Insns. (line 523)
  45105. * REG_DEP_TRUE: Insns. (line 520)
  45106. * REG_EH_REGION, EDGE_ABNORMAL_CALL: Edges. (line 109)
  45107. * REG_EQUAL: Insns. (line 434)
  45108. * REG_EQUIV: Insns. (line 434)
  45109. * REG_EXPR: Special Accessors. (line 58)
  45110. * REG_FRAME_RELATED_EXPR: Insns. (line 547)
  45111. * REG_FUNCTION_VALUE_P: Flags. (line 97)
  45112. * REG_INC: Insns. (line 396)
  45113. * reg_label and /v: Flags. (line 54)
  45114. * REG_LABEL_OPERAND: Insns. (line 410)
  45115. * REG_LABEL_TARGET: Insns. (line 419)
  45116. * reg_names: Register Basics. (line 102)
  45117. * reg_names <1>: Instruction Output. (line 107)
  45118. * REG_NONNEG: Insns. (line 402)
  45119. * REG_NOTES: Insns. (line 344)
  45120. * REG_NOTE_KIND: Insns. (line 369)
  45121. * REG_OFFSET: Special Accessors. (line 62)
  45122. * REG_OK_STRICT: Addressing Modes. (line 99)
  45123. * REG_PARM_STACK_SPACE: Stack Arguments. (line 58)
  45124. * REG_PARM_STACK_SPACE, and TARGET_FUNCTION_ARG: Register Arguments.
  45125. (line 49)
  45126. * REG_POINTER: Flags. (line 102)
  45127. * REG_SETJMP: Insns. (line 428)
  45128. * REG_UNUSED: Insns. (line 389)
  45129. * REG_USERVAR_P: Flags. (line 106)
  45130. * REG_VALUE_IN_UNWIND_CONTEXT: Frame Registers. (line 156)
  45131. * REG_WORDS_BIG_ENDIAN: Storage Layout. (line 35)
  45132. * relative costs: Costs. (line 6)
  45133. * RELATIVE_PREFIX_NOT_LINKDIR: Driver. (line 266)
  45134. * reloading: RTL passes. (line 170)
  45135. * reload_completed: Standard Names. (line 1788)
  45136. * reload_in instruction pattern: Standard Names. (line 98)
  45137. * reload_in_progress: Standard Names. (line 57)
  45138. * reload_out instruction pattern: Standard Names. (line 98)
  45139. * remainder: Arithmetic. (line 136)
  45140. * remainderM3 instruction pattern: Standard Names. (line 908)
  45141. * reorder: GTY Options. (line 175)
  45142. * representation of RTL: RTL. (line 6)
  45143. * reservation delays: Processor pipeline description.
  45144. (line 6)
  45145. * restore_stack_block instruction pattern: Standard Names. (line 1904)
  45146. * restore_stack_function instruction pattern: Standard Names.
  45147. (line 1904)
  45148. * restore_stack_nonlocal instruction pattern: Standard Names.
  45149. (line 1904)
  45150. * rest_of_decl_compilation: Parsing pass. (line 51)
  45151. * rest_of_type_compilation: Parsing pass. (line 51)
  45152. * RESULT_DECL: Declarations. (line 6)
  45153. * return: Side Effects. (line 72)
  45154. * return instruction pattern: Standard Names. (line 1762)
  45155. * return values in registers: Scalar Return. (line 6)
  45156. * returning aggregate values: Aggregate Return. (line 6)
  45157. * returning structures and unions: Interface. (line 10)
  45158. * RETURN_ADDRESS_POINTER_REGNUM: Frame Registers. (line 64)
  45159. * RETURN_ADDR_IN_PREVIOUS_FRAME: Frame Layout. (line 127)
  45160. * RETURN_ADDR_OFFSET: Exception Handling. (line 59)
  45161. * RETURN_ADDR_RTX: Frame Layout. (line 116)
  45162. * RETURN_EXPR: Statements for C++. (line 6)
  45163. * RETURN_STMT: Statements for C++. (line 6)
  45164. * return_val: Flags. (line 283)
  45165. * return_val, in call_insn: Flags. (line 120)
  45166. * return_val, in reg: Flags. (line 97)
  45167. * return_val, in symbol_ref: Flags. (line 216)
  45168. * reverse probability: Profile information.
  45169. (line 66)
  45170. * REVERSE_CONDITION: MODE_CC Condition Codes.
  45171. (line 92)
  45172. * REVERSIBLE_CC_MODE: MODE_CC Condition Codes.
  45173. (line 77)
  45174. * right rotate: Arithmetic. (line 195)
  45175. * right shift: Arithmetic. (line 190)
  45176. * rintM2 instruction pattern: Standard Names. (line 1114)
  45177. * RISC: Processor pipeline description.
  45178. (line 6)
  45179. * RISC <1>: Processor pipeline description.
  45180. (line 223)
  45181. * roots, marking: GGC Roots. (line 6)
  45182. * rotate: Arithmetic. (line 195)
  45183. * rotate <1>: Arithmetic. (line 195)
  45184. * rotatert: Arithmetic. (line 195)
  45185. * rotlM3 instruction pattern: Standard Names. (line 840)
  45186. * rotrM3 instruction pattern: Standard Names. (line 840)
  45187. * roundM2 instruction pattern: Standard Names. (line 1087)
  45188. * ROUND_DIV_EXPR: Unary and Binary Expressions.
  45189. (line 6)
  45190. * ROUND_MOD_EXPR: Unary and Binary Expressions.
  45191. (line 6)
  45192. * ROUND_TYPE_ALIGN: Storage Layout. (line 457)
  45193. * RSHIFT_EXPR: Unary and Binary Expressions.
  45194. (line 6)
  45195. * rsqrtM2 instruction pattern: Standard Names. (line 888)
  45196. * RTL addition: Arithmetic. (line 14)
  45197. * RTL addition with signed saturation: Arithmetic. (line 14)
  45198. * RTL addition with unsigned saturation: Arithmetic. (line 14)
  45199. * RTL classes: RTL Classes. (line 6)
  45200. * RTL comparison: Arithmetic. (line 46)
  45201. * RTL comparison operations: Comparisons. (line 6)
  45202. * RTL constant expression types: Constants. (line 6)
  45203. * RTL constants: Constants. (line 6)
  45204. * RTL declarations: RTL Declarations. (line 6)
  45205. * RTL difference: Arithmetic. (line 38)
  45206. * RTL expression: RTL Objects. (line 6)
  45207. * RTL expressions for arithmetic: Arithmetic. (line 6)
  45208. * RTL format: RTL Classes. (line 73)
  45209. * RTL format characters: RTL Classes. (line 78)
  45210. * RTL function-call insns: Calls. (line 6)
  45211. * RTL insn template: RTL Template. (line 6)
  45212. * RTL integers: RTL Objects. (line 6)
  45213. * RTL memory expressions: Regs and Memory. (line 6)
  45214. * RTL object types: RTL Objects. (line 6)
  45215. * RTL postdecrement: Incdec. (line 6)
  45216. * RTL postincrement: Incdec. (line 6)
  45217. * RTL predecrement: Incdec. (line 6)
  45218. * RTL preincrement: Incdec. (line 6)
  45219. * RTL register expressions: Regs and Memory. (line 6)
  45220. * RTL representation: RTL. (line 6)
  45221. * RTL side effect expressions: Side Effects. (line 6)
  45222. * RTL strings: RTL Objects. (line 6)
  45223. * RTL structure sharing assumptions: Sharing. (line 6)
  45224. * RTL subtraction: Arithmetic. (line 38)
  45225. * RTL subtraction with signed saturation: Arithmetic. (line 38)
  45226. * RTL subtraction with unsigned saturation: Arithmetic. (line 38)
  45227. * RTL sum: Arithmetic. (line 14)
  45228. * RTL vectors: RTL Objects. (line 6)
  45229. * RTL_CONST_CALL_P: Flags. (line 115)
  45230. * RTL_CONST_OR_PURE_CALL_P: Flags. (line 125)
  45231. * RTL_LOOPING_CONST_OR_PURE_CALL_P: Flags. (line 129)
  45232. * RTL_PURE_CALL_P: Flags. (line 120)
  45233. * RTX (See RTL): RTL Objects. (line 6)
  45234. * RTX codes, classes of: RTL Classes. (line 6)
  45235. * RTX_FRAME_RELATED_P: Flags. (line 135)
  45236. * run-time conventions: Interface. (line 6)
  45237. * run-time target specification: Run-time Target. (line 6)
  45238. * s in constraint: Simple Constraints. (line 100)
  45239. * SAD_EXPR: Vectors. (line 6)
  45240. * same_type_p: Types. (line 86)
  45241. * SAmode: Machine Modes. (line 150)
  45242. * satfractMN2 instruction pattern: Standard Names. (line 1464)
  45243. * satfractunsMN2 instruction pattern: Standard Names. (line 1477)
  45244. * satisfies_constraint_M: C Constraint Interface.
  45245. (line 36)
  45246. * sat_fract: Conversions. (line 90)
  45247. * SAVE_EXPR: Unary and Binary Expressions.
  45248. (line 6)
  45249. * save_stack_block instruction pattern: Standard Names. (line 1904)
  45250. * save_stack_function instruction pattern: Standard Names. (line 1904)
  45251. * save_stack_nonlocal instruction pattern: Standard Names. (line 1904)
  45252. * SBSS_SECTION_ASM_OP: Sections. (line 75)
  45253. * Scalar evolutions: Scalar evolutions. (line 6)
  45254. * scalars, returned as values: Scalar Return. (line 6)
  45255. * scalar_float_mode: Machine Modes. (line 293)
  45256. * scalar_int_mode: Machine Modes. (line 290)
  45257. * scalar_mode: Machine Modes. (line 296)
  45258. * scalbM3 instruction pattern: Standard Names. (line 915)
  45259. * scatter_storeMN instruction pattern: Standard Names. (line 255)
  45260. * SCHED_GROUP_P: Flags. (line 162)
  45261. * SCmode: Machine Modes. (line 199)
  45262. * scratch: Regs and Memory. (line 320)
  45263. * scratch operands: Regs and Memory. (line 320)
  45264. * scratch, RTL sharing: Sharing. (line 38)
  45265. * scratch_operand: Machine-Independent Predicates.
  45266. (line 49)
  45267. * SDATA_SECTION_ASM_OP: Sections. (line 57)
  45268. * sdiv_pow2M3 instruction pattern: Standard Names. (line 614)
  45269. * sdiv_pow2M3 instruction pattern <1>: Standard Names. (line 615)
  45270. * SDmode: Machine Modes. (line 88)
  45271. * sdot_prodM instruction pattern: Standard Names. (line 569)
  45272. * search options: Including Patterns. (line 47)
  45273. * SECONDARY_INPUT_RELOAD_CLASS: Register Classes. (line 391)
  45274. * SECONDARY_MEMORY_NEEDED_RTX: Register Classes. (line 457)
  45275. * SECONDARY_OUTPUT_RELOAD_CLASS: Register Classes. (line 392)
  45276. * SECONDARY_RELOAD_CLASS: Register Classes. (line 390)
  45277. * SELECT_CC_MODE: MODE_CC Condition Codes.
  45278. (line 6)
  45279. * sequence: Side Effects. (line 259)
  45280. * Sequence iterators: Sequence iterators. (line 6)
  45281. * set: Side Effects. (line 15)
  45282. * set and /f: Flags. (line 135)
  45283. * setmemM instruction pattern: Standard Names. (line 1328)
  45284. * SETUP_FRAME_ADDRESSES: Frame Layout. (line 94)
  45285. * SET_ASM_OP: Label Output. (line 451)
  45286. * SET_ASM_OP <1>: Label Output. (line 462)
  45287. * set_attr: Tagging Insns. (line 31)
  45288. * set_attr_alternative: Tagging Insns. (line 49)
  45289. * set_bb_seq: GIMPLE sequences. (line 75)
  45290. * SET_DEST: Side Effects. (line 69)
  45291. * SET_IS_RETURN_P: Flags. (line 171)
  45292. * SET_LABEL_KIND: Insns. (line 146)
  45293. * set_optab_libfunc: Library Calls. (line 15)
  45294. * SET_RATIO: Costs. (line 237)
  45295. * SET_SRC: Side Effects. (line 69)
  45296. * set_thread_pointerMODE instruction pattern: Standard Names.
  45297. (line 2477)
  45298. * SET_TYPE_STRUCTURAL_EQUALITY: Types. (line 6)
  45299. * SET_TYPE_STRUCTURAL_EQUALITY <1>: Types. (line 81)
  45300. * SFmode: Machine Modes. (line 69)
  45301. * sharing of RTL components: Sharing. (line 6)
  45302. * shift: Arithmetic. (line 173)
  45303. * SHIFT_COUNT_TRUNCATED: Misc. (line 134)
  45304. * SHLIB_SUFFIX: Macros for Initialization.
  45305. (line 133)
  45306. * SHORT_ACCUM_TYPE_SIZE: Type Layout. (line 82)
  45307. * SHORT_FRACT_TYPE_SIZE: Type Layout. (line 62)
  45308. * SHORT_IMMEDIATES_SIGN_EXTEND: Misc. (line 108)
  45309. * SHORT_TYPE_SIZE: Type Layout. (line 15)
  45310. * shrink-wrapping separate components: Shrink-wrapping separate components.
  45311. (line 6)
  45312. * sibcall_epilogue instruction pattern: Standard Names. (line 2111)
  45313. * sibling call: Edges. (line 121)
  45314. * SIBLING_CALL_P: Flags. (line 175)
  45315. * signal-to-noise ratio (metaphorical usage for diagnostics): Guidelines for Diagnostics.
  45316. (line 39)
  45317. * signed division: Arithmetic. (line 116)
  45318. * signed division with signed saturation: Arithmetic. (line 116)
  45319. * signed maximum: Arithmetic. (line 141)
  45320. * signed minimum: Arithmetic. (line 141)
  45321. * significandM2 instruction pattern: Standard Names. (line 1047)
  45322. * sign_extend: Conversions. (line 23)
  45323. * sign_extract: Bit-Fields. (line 8)
  45324. * sign_extract, canonicalization of: Insn Canonicalizations.
  45325. (line 103)
  45326. * SIG_ATOMIC_TYPE: Type Layout. (line 208)
  45327. * SImode: Machine Modes. (line 37)
  45328. * simple constraints: Simple Constraints. (line 6)
  45329. * simple_return: Side Effects. (line 86)
  45330. * simple_return instruction pattern: Standard Names. (line 1777)
  45331. * sincosM3 instruction pattern: Standard Names. (line 943)
  45332. * sinM2 instruction pattern: Standard Names. (line 937)
  45333. * SIZETYPE: Type Layout. (line 147)
  45334. * SIZE_ASM_OP: Label Output. (line 33)
  45335. * SIZE_TYPE: Type Layout. (line 131)
  45336. * skip: GTY Options. (line 76)
  45337. * SLOW_BYTE_ACCESS: Costs. (line 117)
  45338. * small IPA passes: Small IPA passes. (line 6)
  45339. * smax: Arithmetic. (line 141)
  45340. * smin: Arithmetic. (line 141)
  45341. * sms, swing, software pipelining: RTL passes. (line 123)
  45342. * smulhrsM3 instruction pattern: Standard Names. (line 604)
  45343. * smulhsM3 instruction pattern: Standard Names. (line 594)
  45344. * smulM3_highpart instruction pattern: Standard Names. (line 753)
  45345. * soft float library: Soft float library routines.
  45346. (line 6)
  45347. * source code, location information: Guidelines for Diagnostics.
  45348. (line 159)
  45349. * special: GTY Options. (line 238)
  45350. * special predicates: Predicates. (line 31)
  45351. * SPECS: Target Fragment. (line 194)
  45352. * speculation_barrier instruction pattern: Standard Names. (line 2178)
  45353. * speed of instructions: Costs. (line 6)
  45354. * splitting instructions: Insn Splitting. (line 6)
  45355. * split_block: Maintaining the CFG.
  45356. (line 96)
  45357. * SQmode: Machine Modes. (line 114)
  45358. * sqrt: Arithmetic. (line 206)
  45359. * sqrtM2 instruction pattern: Standard Names. (line 882)
  45360. * square root: Arithmetic. (line 206)
  45361. * SSA: SSA. (line 6)
  45362. * ssaddM3 instruction pattern: Standard Names. (line 442)
  45363. * ssadM instruction pattern: Standard Names. (line 578)
  45364. * ssashlM3 instruction pattern: Standard Names. (line 828)
  45365. * SSA_NAME_DEF_STMT: SSA. (line 184)
  45366. * SSA_NAME_VERSION: SSA. (line 189)
  45367. * ssdivM3 instruction pattern: Standard Names. (line 442)
  45368. * ssmaddMN4 instruction pattern: Standard Names. (line 776)
  45369. * ssmsubMN4 instruction pattern: Standard Names. (line 800)
  45370. * ssmulM3 instruction pattern: Standard Names. (line 442)
  45371. * ssnegM2 instruction pattern: Standard Names. (line 872)
  45372. * sssubM3 instruction pattern: Standard Names. (line 442)
  45373. * ss_abs: Arithmetic. (line 200)
  45374. * ss_ashift: Arithmetic. (line 173)
  45375. * ss_div: Arithmetic. (line 116)
  45376. * ss_minus: Arithmetic. (line 38)
  45377. * ss_mult: Arithmetic. (line 93)
  45378. * ss_neg: Arithmetic. (line 82)
  45379. * ss_plus: Arithmetic. (line 14)
  45380. * ss_truncate: Conversions. (line 43)
  45381. * stack arguments: Stack Arguments. (line 6)
  45382. * stack frame layout: Frame Layout. (line 6)
  45383. * stack smashing protection: Stack Smashing Protection.
  45384. (line 6)
  45385. * STACK_ALIGNMENT_NEEDED: Frame Layout. (line 41)
  45386. * STACK_BOUNDARY: Storage Layout. (line 156)
  45387. * STACK_CHECK_BUILTIN: Stack Checking. (line 31)
  45388. * STACK_CHECK_FIXED_FRAME_SIZE: Stack Checking. (line 83)
  45389. * STACK_CHECK_MAX_FRAME_SIZE: Stack Checking. (line 74)
  45390. * STACK_CHECK_MAX_VAR_SIZE: Stack Checking. (line 90)
  45391. * STACK_CHECK_MOVING_SP: Stack Checking. (line 53)
  45392. * STACK_CHECK_PROBE_INTERVAL_EXP: Stack Checking. (line 45)
  45393. * STACK_CHECK_PROTECT: Stack Checking. (line 62)
  45394. * STACK_CHECK_STATIC_BUILTIN: Stack Checking. (line 38)
  45395. * STACK_DYNAMIC_OFFSET: Frame Layout. (line 67)
  45396. * STACK_DYNAMIC_OFFSET and virtual registers: Regs and Memory.
  45397. (line 83)
  45398. * STACK_GROWS_DOWNWARD: Frame Layout. (line 8)
  45399. * STACK_PARMS_IN_REG_PARM_AREA: Stack Arguments. (line 89)
  45400. * STACK_POINTER_OFFSET: Frame Layout. (line 51)
  45401. * STACK_POINTER_OFFSET and virtual registers: Regs and Memory.
  45402. (line 93)
  45403. * STACK_POINTER_REGNUM: Frame Registers. (line 8)
  45404. * STACK_POINTER_REGNUM and virtual registers: Regs and Memory.
  45405. (line 83)
  45406. * stack_pointer_rtx: Frame Registers. (line 104)
  45407. * stack_protect_combined_set instruction pattern: Standard Names.
  45408. (line 2487)
  45409. * stack_protect_combined_test instruction pattern: Standard Names.
  45410. (line 2517)
  45411. * stack_protect_set instruction pattern: Standard Names. (line 2503)
  45412. * stack_protect_test instruction pattern: Standard Names. (line 2534)
  45413. * STACK_PUSH_CODE: Frame Layout. (line 12)
  45414. * STACK_REGS: Stack Registers. (line 19)
  45415. * STACK_REG_COVER_CLASS: Stack Registers. (line 22)
  45416. * STACK_SAVEAREA_MODE: Storage Layout. (line 473)
  45417. * STACK_SIZE_MODE: Storage Layout. (line 484)
  45418. * STACK_SLOT_ALIGNMENT: Storage Layout. (line 305)
  45419. * standard pattern names: Standard Names. (line 6)
  45420. * STANDARD_STARTFILE_PREFIX: Driver. (line 278)
  45421. * STANDARD_STARTFILE_PREFIX_1: Driver. (line 285)
  45422. * STANDARD_STARTFILE_PREFIX_2: Driver. (line 292)
  45423. * STARTFILE_SPEC: Driver. (line 147)
  45424. * Statement and operand traversals: Statement and operand traversals.
  45425. (line 6)
  45426. * Statement Sequences: Statement Sequences.
  45427. (line 6)
  45428. * Statements: Statements. (line 6)
  45429. * statements: Function Properties.
  45430. (line 6)
  45431. * statements <1>: Statements for C++. (line 6)
  45432. * static analysis: Static Analyzer. (line 6)
  45433. * static analyzer: Static Analyzer. (line 6)
  45434. * static analyzer, debugging: Debugging the Analyzer.
  45435. (line 5)
  45436. * static analyzer, internals: Analyzer Internals. (line 5)
  45437. * Static profile estimation: Profile information.
  45438. (line 24)
  45439. * static single assignment: SSA. (line 6)
  45440. * STATIC_CHAIN_INCOMING_REGNUM: Frame Registers. (line 77)
  45441. * STATIC_CHAIN_REGNUM: Frame Registers. (line 76)
  45442. * stdarg.h and register arguments: Register Arguments. (line 44)
  45443. * STDC_0_IN_SYSTEM_HEADERS: Misc. (line 384)
  45444. * STMT_EXPR: Unary and Binary Expressions.
  45445. (line 6)
  45446. * STMT_IS_FULL_EXPR_P: Statements for C++. (line 22)
  45447. * storage layout: Storage Layout. (line 6)
  45448. * STORE_FLAG_VALUE: Misc. (line 235)
  45449. * STORE_MAX_PIECES: Costs. (line 215)
  45450. * store_multiple instruction pattern: Standard Names. (line 159)
  45451. * strcpy: Storage Layout. (line 258)
  45452. * STRICT_ALIGNMENT: Storage Layout. (line 355)
  45453. * strict_low_part: RTL Declarations. (line 9)
  45454. * strict_memory_address_p: Addressing Modes. (line 186)
  45455. * STRING_CST: Constant expressions.
  45456. (line 6)
  45457. * STRING_POOL_ADDRESS_P: Flags. (line 179)
  45458. * strlenM instruction pattern: Standard Names. (line 1399)
  45459. * structure value address: Aggregate Return. (line 6)
  45460. * structures, returning: Interface. (line 10)
  45461. * STRUCTURE_SIZE_BOUNDARY: Storage Layout. (line 347)
  45462. * subM3 instruction pattern: Standard Names. (line 442)
  45463. * SUBOBJECT: Statements for C++. (line 6)
  45464. * SUBOBJECT_CLEANUP: Statements for C++. (line 6)
  45465. * subreg: Regs and Memory. (line 97)
  45466. * subreg and /s: Flags. (line 201)
  45467. * subreg and /u: Flags. (line 194)
  45468. * subreg and /u and /v: Flags. (line 184)
  45469. * subreg, in strict_low_part: RTL Declarations. (line 9)
  45470. * SUBREG_BYTE: Regs and Memory. (line 311)
  45471. * SUBREG_PROMOTED_UNSIGNED_P: Flags. (line 184)
  45472. * SUBREG_PROMOTED_UNSIGNED_SET: Flags. (line 194)
  45473. * SUBREG_PROMOTED_VAR_P: Flags. (line 201)
  45474. * SUBREG_REG: Regs and Memory. (line 311)
  45475. * subst iterators in .md files: Subst Iterators. (line 6)
  45476. * subvM4 instruction pattern: Standard Names. (line 458)
  45477. * SUCCESS_EXIT_CODE: Host Misc. (line 12)
  45478. * support for nested functions: Trampolines. (line 6)
  45479. * SUPPORTS_INIT_PRIORITY: Macros for Initialization.
  45480. (line 57)
  45481. * SUPPORTS_ONE_ONLY: Label Output. (line 290)
  45482. * SUPPORTS_WEAK: Label Output. (line 264)
  45483. * SWITCHABLE_TARGET: Run-time Target. (line 160)
  45484. * SWITCH_BODY: Statements for C++. (line 6)
  45485. * SWITCH_COND: Statements for C++. (line 6)
  45486. * SWITCH_STMT: Statements for C++. (line 6)
  45487. * symbolic label: Sharing. (line 20)
  45488. * SYMBOL_FLAG_ANCHOR: Special Accessors. (line 117)
  45489. * SYMBOL_FLAG_EXTERNAL: Special Accessors. (line 99)
  45490. * SYMBOL_FLAG_FUNCTION: Special Accessors. (line 92)
  45491. * SYMBOL_FLAG_HAS_BLOCK_INFO: Special Accessors. (line 113)
  45492. * SYMBOL_FLAG_LOCAL: Special Accessors. (line 95)
  45493. * SYMBOL_FLAG_SMALL: Special Accessors. (line 104)
  45494. * SYMBOL_FLAG_TLS_SHIFT: Special Accessors. (line 108)
  45495. * symbol_ref: Constants. (line 189)
  45496. * symbol_ref and /f: Flags. (line 179)
  45497. * symbol_ref and /i: Flags. (line 216)
  45498. * symbol_ref and /u: Flags. (line 19)
  45499. * symbol_ref and /v: Flags. (line 220)
  45500. * symbol_ref, RTL sharing: Sharing. (line 20)
  45501. * SYMBOL_REF_ANCHOR_P: Special Accessors. (line 117)
  45502. * SYMBOL_REF_BLOCK: Special Accessors. (line 130)
  45503. * SYMBOL_REF_BLOCK_OFFSET: Special Accessors. (line 135)
  45504. * SYMBOL_REF_CONSTANT: Special Accessors. (line 78)
  45505. * SYMBOL_REF_DATA: Special Accessors. (line 82)
  45506. * SYMBOL_REF_DECL: Special Accessors. (line 67)
  45507. * SYMBOL_REF_EXTERNAL_P: Special Accessors. (line 99)
  45508. * SYMBOL_REF_FLAG: Flags. (line 220)
  45509. * SYMBOL_REF_FLAG, in TARGET_ENCODE_SECTION_INFO: Sections. (line 289)
  45510. * SYMBOL_REF_FLAGS: Special Accessors. (line 86)
  45511. * SYMBOL_REF_FUNCTION_P: Special Accessors. (line 92)
  45512. * SYMBOL_REF_HAS_BLOCK_INFO_P: Special Accessors. (line 113)
  45513. * SYMBOL_REF_LOCAL_P: Special Accessors. (line 95)
  45514. * SYMBOL_REF_SMALL_P: Special Accessors. (line 104)
  45515. * SYMBOL_REF_TLS_MODEL: Special Accessors. (line 108)
  45516. * SYMBOL_REF_USED: Flags. (line 211)
  45517. * SYMBOL_REF_WEAK: Flags. (line 216)
  45518. * sync_addMODE instruction pattern: Standard Names. (line 2232)
  45519. * sync_andMODE instruction pattern: Standard Names. (line 2232)
  45520. * sync_compare_and_swapMODE instruction pattern: Standard Names.
  45521. (line 2192)
  45522. * sync_iorMODE instruction pattern: Standard Names. (line 2232)
  45523. * sync_lock_releaseMODE instruction pattern: Standard Names. (line 2297)
  45524. * sync_lock_test_and_setMODE instruction pattern: Standard Names.
  45525. (line 2271)
  45526. * sync_nandMODE instruction pattern: Standard Names. (line 2232)
  45527. * sync_new_addMODE instruction pattern: Standard Names. (line 2264)
  45528. * sync_new_andMODE instruction pattern: Standard Names. (line 2264)
  45529. * sync_new_iorMODE instruction pattern: Standard Names. (line 2264)
  45530. * sync_new_nandMODE instruction pattern: Standard Names. (line 2264)
  45531. * sync_new_subMODE instruction pattern: Standard Names. (line 2264)
  45532. * sync_new_xorMODE instruction pattern: Standard Names. (line 2264)
  45533. * sync_old_addMODE instruction pattern: Standard Names. (line 2247)
  45534. * sync_old_andMODE instruction pattern: Standard Names. (line 2247)
  45535. * sync_old_iorMODE instruction pattern: Standard Names. (line 2247)
  45536. * sync_old_nandMODE instruction pattern: Standard Names. (line 2247)
  45537. * sync_old_subMODE instruction pattern: Standard Names. (line 2247)
  45538. * sync_old_xorMODE instruction pattern: Standard Names. (line 2247)
  45539. * sync_subMODE instruction pattern: Standard Names. (line 2232)
  45540. * sync_xorMODE instruction pattern: Standard Names. (line 2232)
  45541. * SYSROOT_HEADERS_SUFFIX_SPEC: Driver. (line 176)
  45542. * SYSROOT_SUFFIX_SPEC: Driver. (line 171)
  45543. * SYSTEM_IMPLICIT_EXTERN_C: Misc. (line 415)
  45544. * t-TARGET: Target Fragment. (line 6)
  45545. * table jump: Basic Blocks. (line 67)
  45546. * tablejump instruction pattern: Standard Names. (line 1850)
  45547. * tag: GTY Options. (line 90)
  45548. * tagging insns: Tagging Insns. (line 6)
  45549. * tail calls: Tail Calls. (line 6)
  45550. * TAmode: Machine Modes. (line 158)
  45551. * tanM2 instruction pattern: Standard Names. (line 954)
  45552. * target attributes: Target Attributes. (line 6)
  45553. * target description macros: Target Macros. (line 6)
  45554. * target functions: Target Structure. (line 6)
  45555. * target hooks: Target Structure. (line 6)
  45556. * target makefile fragment: Target Fragment. (line 6)
  45557. * target specifications: Run-time Target. (line 6)
  45558. * targetm: Target Structure. (line 6)
  45559. * targets, makefile: Makefile. (line 6)
  45560. * TARGET_ABSOLUTE_BIGGEST_ALIGNMENT: Storage Layout. (line 185)
  45561. * TARGET_ADDITIONAL_ALLOCNO_CLASS_P: Register Classes. (line 639)
  45562. * TARGET_ADDRESS_COST: Costs. (line 344)
  45563. * TARGET_ADDR_SPACE_ADDRESS_MODE: Named Address Spaces.
  45564. (line 42)
  45565. * TARGET_ADDR_SPACE_CONVERT: Named Address Spaces.
  45566. (line 89)
  45567. * TARGET_ADDR_SPACE_DEBUG: Named Address Spaces.
  45568. (line 99)
  45569. * TARGET_ADDR_SPACE_DIAGNOSE_USAGE: Named Address Spaces.
  45570. (line 103)
  45571. * TARGET_ADDR_SPACE_LEGITIMATE_ADDRESS_P: Named Address Spaces.
  45572. (line 59)
  45573. * TARGET_ADDR_SPACE_LEGITIMIZE_ADDRESS: Named Address Spaces.
  45574. (line 67)
  45575. * TARGET_ADDR_SPACE_POINTER_MODE: Named Address Spaces.
  45576. (line 36)
  45577. * TARGET_ADDR_SPACE_SUBSET_P: Named Address Spaces.
  45578. (line 74)
  45579. * TARGET_ADDR_SPACE_VALID_POINTER_MODE: Named Address Spaces.
  45580. (line 48)
  45581. * TARGET_ADDR_SPACE_ZERO_ADDRESS_VALID: Named Address Spaces.
  45582. (line 83)
  45583. * TARGET_ALIGN_ANON_BITFIELD: Storage Layout. (line 432)
  45584. * TARGET_ALLOCATE_INITIAL_VALUE: Misc. (line 807)
  45585. * TARGET_ALLOCATE_STACK_SLOTS_FOR_ARGS: Misc. (line 1064)
  45586. * TARGET_ALWAYS_STRIP_DOTDOT: Driver. (line 250)
  45587. * TARGET_ARG_PARTIAL_BYTES: Register Arguments. (line 92)
  45588. * TARGET_ARM_EABI_UNWINDER: Exception Region Output.
  45589. (line 133)
  45590. * TARGET_ARRAY_MODE: Register Arguments. (line 373)
  45591. * TARGET_ARRAY_MODE_SUPPORTED_P: Register Arguments. (line 388)
  45592. * TARGET_ASAN_SHADOW_OFFSET: Misc. (line 1092)
  45593. * TARGET_ASM_ALIGNED_DI_OP: Data Output. (line 11)
  45594. * TARGET_ASM_ALIGNED_HI_OP: Data Output. (line 7)
  45595. * TARGET_ASM_ALIGNED_PDI_OP: Data Output. (line 10)
  45596. * TARGET_ASM_ALIGNED_PSI_OP: Data Output. (line 8)
  45597. * TARGET_ASM_ALIGNED_PTI_OP: Data Output. (line 12)
  45598. * TARGET_ASM_ALIGNED_SI_OP: Data Output. (line 9)
  45599. * TARGET_ASM_ALIGNED_TI_OP: Data Output. (line 13)
  45600. * TARGET_ASM_ASSEMBLE_UNDEFINED_DECL: Label Output. (line 231)
  45601. * TARGET_ASM_ASSEMBLE_VISIBILITY: Label Output. (line 301)
  45602. * TARGET_ASM_BYTE_OP: Data Output. (line 6)
  45603. * TARGET_ASM_CAN_OUTPUT_MI_THUNK: Function Entry. (line 209)
  45604. * TARGET_ASM_CLOSE_PAREN: Data Output. (line 139)
  45605. * TARGET_ASM_CODE_END: File Framework. (line 57)
  45606. * TARGET_ASM_CONSTRUCTOR: Macros for Initialization.
  45607. (line 68)
  45608. * TARGET_ASM_DECLARE_CONSTANT_NAME: Label Output. (line 177)
  45609. * TARGET_ASM_DECL_END: Data Output. (line 44)
  45610. * TARGET_ASM_DESTRUCTOR: Macros for Initialization.
  45611. (line 82)
  45612. * TARGET_ASM_ELF_FLAGS_NUMERIC: File Framework. (line 120)
  45613. * TARGET_ASM_EMIT_EXCEPT_PERSONALITY: Dispatch Tables. (line 89)
  45614. * TARGET_ASM_EMIT_EXCEPT_TABLE_LABEL: Dispatch Tables. (line 82)
  45615. * TARGET_ASM_EMIT_UNWIND_LABEL: Dispatch Tables. (line 70)
  45616. * TARGET_ASM_EXTERNAL_LIBCALL: Label Output. (line 337)
  45617. * TARGET_ASM_FILE_END: File Framework. (line 35)
  45618. * TARGET_ASM_FILE_START: File Framework. (line 8)
  45619. * TARGET_ASM_FILE_START_APP_OFF: File Framework. (line 16)
  45620. * TARGET_ASM_FILE_START_FILE_DIRECTIVE: File Framework. (line 29)
  45621. * TARGET_ASM_FINAL_POSTSCAN_INSN: Instruction Output. (line 82)
  45622. * TARGET_ASM_FUNCTION_BEGIN_EPILOGUE: Function Entry. (line 67)
  45623. * TARGET_ASM_FUNCTION_END_PROLOGUE: Function Entry. (line 61)
  45624. * TARGET_ASM_FUNCTION_EPILOGUE: Function Entry. (line 73)
  45625. * TARGET_ASM_FUNCTION_PROLOGUE: Function Entry. (line 18)
  45626. * TARGET_ASM_FUNCTION_RODATA_SECTION: Sections. (line 225)
  45627. * TARGET_ASM_FUNCTION_SECTION: File Framework. (line 132)
  45628. * TARGET_ASM_FUNCTION_SWITCHED_TEXT_SECTIONS: File Framework.
  45629. (line 142)
  45630. * TARGET_ASM_GENERATE_PIC_ADDR_DIFF_VEC: Sections. (line 184)
  45631. * TARGET_ASM_GLOBALIZE_DECL_NAME: Label Output. (line 222)
  45632. * TARGET_ASM_GLOBALIZE_LABEL: Label Output. (line 213)
  45633. * TARGET_ASM_INIT_SECTIONS: Sections. (line 164)
  45634. * TARGET_ASM_INTEGER: Data Output. (line 31)
  45635. * TARGET_ASM_INTERNAL_LABEL: Label Output. (line 380)
  45636. * TARGET_ASM_LTO_END: File Framework. (line 52)
  45637. * TARGET_ASM_LTO_START: File Framework. (line 47)
  45638. * TARGET_ASM_MARK_DECL_PRESERVED: Label Output. (line 343)
  45639. * TARGET_ASM_MERGEABLE_RODATA_PREFIX: Sections. (line 233)
  45640. * TARGET_ASM_NAMED_SECTION: File Framework. (line 112)
  45641. * TARGET_ASM_OPEN_PAREN: Data Output. (line 138)
  45642. * TARGET_ASM_OUTPUT_ADDR_CONST_EXTRA: Data Output. (line 48)
  45643. * TARGET_ASM_OUTPUT_ANCHOR: Anchored Addresses. (line 42)
  45644. * TARGET_ASM_OUTPUT_DWARF_DTPREL: DWARF. (line 121)
  45645. * TARGET_ASM_OUTPUT_IDENT: File Framework. (line 99)
  45646. * TARGET_ASM_OUTPUT_MI_THUNK: Function Entry. (line 167)
  45647. * TARGET_ASM_OUTPUT_SOURCE_FILENAME: File Framework. (line 91)
  45648. * TARGET_ASM_POST_CFI_STARTPROC: Dispatch Tables. (line 61)
  45649. * TARGET_ASM_PRINT_PATCHABLE_FUNCTION_ENTRY: Function Entry. (line 9)
  45650. * TARGET_ASM_RECORD_GCC_SWITCHES: File Framework. (line 173)
  45651. * TARGET_ASM_RECORD_GCC_SWITCHES_SECTION: File Framework. (line 218)
  45652. * TARGET_ASM_RELOC_RW_MASK: Sections. (line 173)
  45653. * TARGET_ASM_SELECT_RTX_SECTION: Sections. (line 242)
  45654. * TARGET_ASM_SELECT_SECTION: Sections. (line 191)
  45655. * TARGET_ASM_TM_CLONE_TABLE_SECTION: Sections. (line 238)
  45656. * TARGET_ASM_TRAMPOLINE_TEMPLATE: Trampolines. (line 81)
  45657. * TARGET_ASM_TTYPE: Exception Region Output.
  45658. (line 127)
  45659. * TARGET_ASM_UNALIGNED_DI_OP: Data Output. (line 18)
  45660. * TARGET_ASM_UNALIGNED_HI_OP: Data Output. (line 14)
  45661. * TARGET_ASM_UNALIGNED_PDI_OP: Data Output. (line 17)
  45662. * TARGET_ASM_UNALIGNED_PSI_OP: Data Output. (line 15)
  45663. * TARGET_ASM_UNALIGNED_PTI_OP: Data Output. (line 19)
  45664. * TARGET_ASM_UNALIGNED_SI_OP: Data Output. (line 16)
  45665. * TARGET_ASM_UNALIGNED_TI_OP: Data Output. (line 20)
  45666. * TARGET_ASM_UNIQUE_SECTION: Sections. (line 213)
  45667. * TARGET_ASM_UNWIND_EMIT: Dispatch Tables. (line 96)
  45668. * TARGET_ASM_UNWIND_EMIT_BEFORE_INSN: Dispatch Tables. (line 102)
  45669. * TARGET_ATOMIC_ALIGN_FOR_MODE: Misc. (line 1111)
  45670. * TARGET_ATOMIC_ASSIGN_EXPAND_FENV: Misc. (line 1117)
  45671. * TARGET_ATOMIC_TEST_AND_SET_TRUEVAL: Misc. (line 1102)
  45672. * TARGET_ATTRIBUTE_TABLE: Target Attributes. (line 10)
  45673. * TARGET_ATTRIBUTE_TAKES_IDENTIFIER_P: Target Attributes. (line 17)
  45674. * TARGET_BINDS_LOCAL_P: Sections. (line 320)
  45675. * TARGET_BUILD_BUILTIN_VA_LIST: Register Arguments. (line 281)
  45676. * TARGET_BUILTIN_DECL: Misc. (line 637)
  45677. * TARGET_BUILTIN_RECIPROCAL: Addressing Modes. (line 261)
  45678. * TARGET_BUILTIN_SETJMP_FRAME_VALUE: Frame Layout. (line 101)
  45679. * TARGET_CALLEE_COPIES: Register Arguments. (line 124)
  45680. * TARGET_CALL_ARGS: Varargs. (line 123)
  45681. * TARGET_CALL_FUSAGE_CONTAINS_NON_CALLEE_CLOBBERS: Miscellaneous Register Hooks.
  45682. (line 6)
  45683. * TARGET_CANNOT_FORCE_CONST_MEM: Addressing Modes. (line 234)
  45684. * TARGET_CANNOT_MODIFY_JUMPS_P: Misc. (line 871)
  45685. * TARGET_CANNOT_SUBSTITUTE_MEM_EQUIV_P: Register Classes. (line 610)
  45686. * TARGET_CANONICALIZE_COMPARISON: MODE_CC Condition Codes.
  45687. (line 55)
  45688. * TARGET_CANONICAL_VA_LIST_TYPE: Register Arguments. (line 302)
  45689. * TARGET_CAN_CHANGE_MODE_CLASS: Register Classes. (line 543)
  45690. * TARGET_CAN_CHANGE_MODE_CLASS and subreg semantics: Regs and Memory.
  45691. (line 294)
  45692. * TARGET_CAN_ELIMINATE: Elimination. (line 58)
  45693. * TARGET_CAN_FOLLOW_JUMP: Misc. (line 793)
  45694. * TARGET_CAN_INLINE_P: Target Attributes. (line 173)
  45695. * TARGET_CAN_USE_DOLOOP_P: Misc. (line 757)
  45696. * TARGET_CASE_VALUES_THRESHOLD: Misc. (line 46)
  45697. * TARGET_CC_MODES_COMPATIBLE: MODE_CC Condition Codes.
  45698. (line 120)
  45699. * TARGET_CHECK_BUILTIN_CALL: Misc. (line 669)
  45700. * TARGET_CHECK_PCH_TARGET_FLAGS: PCH Target. (line 26)
  45701. * TARGET_CHECK_STRING_OBJECT_FORMAT_ARG: Run-time Target. (line 119)
  45702. * TARGET_CLASS_LIKELY_SPILLED_P: Register Classes. (line 499)
  45703. * TARGET_CLASS_MAX_NREGS: Register Classes. (line 515)
  45704. * TARGET_COMMUTATIVE_P: Misc. (line 800)
  45705. * TARGET_COMPARE_BY_PIECES_BRANCH_RATIO: Costs. (line 200)
  45706. * TARGET_COMPARE_VERSION_PRIORITY: Misc. (line 701)
  45707. * TARGET_COMPATIBLE_VECTOR_TYPES_P: Register Arguments. (line 350)
  45708. * TARGET_COMPUTE_FRAME_LAYOUT: Elimination. (line 74)
  45709. * TARGET_COMPUTE_PRESSURE_CLASSES: Register Classes. (line 655)
  45710. * TARGET_COMP_TYPE_ATTRIBUTES: Target Attributes. (line 25)
  45711. * TARGET_CONDITIONAL_REGISTER_USAGE: Register Basics. (line 102)
  45712. * TARGET_CONSTANT_ALIGNMENT: Storage Layout. (line 271)
  45713. * TARGET_CONST_ANCHOR: Misc. (line 1075)
  45714. * TARGET_CONST_NOT_OK_FOR_DEBUG_P: Addressing Modes. (line 230)
  45715. * TARGET_CONVERT_TO_TYPE: Misc. (line 1022)
  45716. * TARGET_CPU_CPP_BUILTINS: Run-time Target. (line 8)
  45717. * TARGET_CSTORE_MODE: Register Classes. (line 647)
  45718. * TARGET_CUSTOM_FUNCTION_DESCRIPTORS: Trampolines. (line 39)
  45719. * TARGET_CXX_ADJUST_CLASS_AT_DEFINITION: C++ ABI. (line 86)
  45720. * TARGET_CXX_CDTOR_RETURNS_THIS: C++ ABI. (line 37)
  45721. * TARGET_CXX_CLASS_DATA_ALWAYS_COMDAT: C++ ABI. (line 61)
  45722. * TARGET_CXX_COOKIE_HAS_SIZE: C++ ABI. (line 24)
  45723. * TARGET_CXX_DECL_MANGLING_CONTEXT: C++ ABI. (line 92)
  45724. * TARGET_CXX_DETERMINE_CLASS_DATA_VISIBILITY: C++ ABI. (line 52)
  45725. * TARGET_CXX_GET_COOKIE_SIZE: C++ ABI. (line 17)
  45726. * TARGET_CXX_GUARD_MASK_BIT: C++ ABI. (line 11)
  45727. * TARGET_CXX_GUARD_TYPE: C++ ABI. (line 6)
  45728. * TARGET_CXX_IMPLICIT_EXTERN_C: Misc. (line 407)
  45729. * TARGET_CXX_IMPORT_EXPORT_CLASS: C++ ABI. (line 28)
  45730. * TARGET_CXX_KEY_METHOD_MAY_BE_INLINE: C++ ABI. (line 42)
  45731. * TARGET_CXX_LIBRARY_RTTI_COMDAT: C++ ABI. (line 68)
  45732. * TARGET_CXX_USE_AEABI_ATEXIT: C++ ABI. (line 73)
  45733. * TARGET_CXX_USE_ATEXIT_FOR_CXA_ATEXIT: C++ ABI. (line 79)
  45734. * TARGET_C_EXCESS_PRECISION: Storage Layout. (line 109)
  45735. * TARGET_C_PREINCLUDE: Misc. (line 395)
  45736. * TARGET_DEBUG_UNWIND_INFO: DWARF. (line 32)
  45737. * TARGET_DECIMAL_FLOAT_SUPPORTED_P: Storage Layout. (line 537)
  45738. * TARGET_DECLSPEC: Target Attributes. (line 72)
  45739. * TARGET_DEFAULT_PACK_STRUCT: Misc. (line 479)
  45740. * TARGET_DEFAULT_SHORT_ENUMS: Type Layout. (line 123)
  45741. * TARGET_DEFAULT_TARGET_FLAGS: Run-time Target. (line 55)
  45742. * TARGET_DEFERRED_OUTPUT_DEFS: Label Output. (line 465)
  45743. * TARGET_DELAY_SCHED2: DWARF. (line 77)
  45744. * TARGET_DELAY_VARTRACK: DWARF. (line 81)
  45745. * TARGET_DELEGITIMIZE_ADDRESS: Addressing Modes. (line 221)
  45746. * TARGET_DIFFERENT_ADDR_DISPLACEMENT_P: Register Classes. (line 603)
  45747. * TARGET_DLLIMPORT_DECL_ATTRIBUTES: Target Attributes. (line 55)
  45748. * TARGET_DOLOOP_COST_FOR_ADDRESS: Misc. (line 746)
  45749. * TARGET_DOLOOP_COST_FOR_GENERIC: Misc. (line 735)
  45750. * TARGET_DWARF_CALLING_CONVENTION: DWARF. (line 12)
  45751. * TARGET_DWARF_FRAME_REG_MODE: Exception Region Output.
  45752. (line 113)
  45753. * TARGET_DWARF_HANDLE_FRAME_UNSPEC: Frame Layout. (line 165)
  45754. * TARGET_DWARF_POLY_INDETERMINATE_VALUE: Frame Layout. (line 177)
  45755. * TARGET_DWARF_REGISTER_SPAN: Exception Region Output.
  45756. (line 104)
  45757. * TARGET_D_CPU_VERSIONS: D Language and ABI. (line 6)
  45758. * TARGET_D_CRITSEC_SIZE: D Language and ABI. (line 17)
  45759. * TARGET_D_OS_VERSIONS: D Language and ABI. (line 13)
  45760. * TARGET_EDOM: Library Calls. (line 59)
  45761. * TARGET_EMPTY_RECORD_P: Aggregate Return. (line 86)
  45762. * TARGET_EMUTLS_DEBUG_FORM_TLS_ADDRESS: Emulated TLS. (line 67)
  45763. * TARGET_EMUTLS_GET_ADDRESS: Emulated TLS. (line 18)
  45764. * TARGET_EMUTLS_REGISTER_COMMON: Emulated TLS. (line 23)
  45765. * TARGET_EMUTLS_TMPL_PREFIX: Emulated TLS. (line 44)
  45766. * TARGET_EMUTLS_TMPL_SECTION: Emulated TLS. (line 35)
  45767. * TARGET_EMUTLS_VAR_ALIGN_FIXED: Emulated TLS. (line 62)
  45768. * TARGET_EMUTLS_VAR_FIELDS: Emulated TLS. (line 48)
  45769. * TARGET_EMUTLS_VAR_INIT: Emulated TLS. (line 55)
  45770. * TARGET_EMUTLS_VAR_PREFIX: Emulated TLS. (line 40)
  45771. * TARGET_EMUTLS_VAR_SECTION: Emulated TLS. (line 30)
  45772. * TARGET_ENCODE_SECTION_INFO: Sections. (line 263)
  45773. * TARGET_ENCODE_SECTION_INFO and address validation: Addressing Modes.
  45774. (line 82)
  45775. * TARGET_ENCODE_SECTION_INFO usage: Instruction Output. (line 127)
  45776. * TARGET_END_CALL_ARGS: Varargs. (line 137)
  45777. * TARGET_ENUM_VA_LIST_P: Register Arguments. (line 285)
  45778. * TARGET_ESTIMATED_POLY_VALUE: Costs. (line 425)
  45779. * TARGET_EXCEPT_UNWIND_INFO: Exception Region Output.
  45780. (line 46)
  45781. * TARGET_EXECUTABLE_SUFFIX: Misc. (line 858)
  45782. * TARGET_EXPAND_BUILTIN: Misc. (line 647)
  45783. * TARGET_EXPAND_BUILTIN_SAVEREGS: Varargs. (line 64)
  45784. * TARGET_EXPAND_DIVMOD_LIBFUNC: Scheduling. (line 461)
  45785. * TARGET_EXPAND_TO_RTL_HOOK: Storage Layout. (line 543)
  45786. * TARGET_EXPR: Unary and Binary Expressions.
  45787. (line 6)
  45788. * TARGET_EXTRA_INCLUDES: Misc. (line 937)
  45789. * TARGET_EXTRA_LIVE_ON_ENTRY: Tail Calls. (line 20)
  45790. * TARGET_EXTRA_PRE_INCLUDES: Misc. (line 944)
  45791. * TARGET_FIXED_CONDITION_CODE_REGS: MODE_CC Condition Codes.
  45792. (line 105)
  45793. * TARGET_FIXED_POINT_SUPPORTED_P: Storage Layout. (line 540)
  45794. * target_flags: Run-time Target. (line 51)
  45795. * TARGET_FLAGS_REGNUM: MODE_CC Condition Codes.
  45796. (line 133)
  45797. * TARGET_FLOATN_BUILTIN_P: Register Arguments. (line 438)
  45798. * TARGET_FLOATN_MODE: Register Arguments. (line 420)
  45799. * TARGET_FLOAT_EXCEPTIONS_ROUNDING_SUPPORTED_P: Run-time Target.
  45800. (line 179)
  45801. * TARGET_FNTYPE_ABI: Register Basics. (line 58)
  45802. * TARGET_FN_ABI_VA_LIST: Register Arguments. (line 297)
  45803. * TARGET_FOLD_BUILTIN: Misc. (line 684)
  45804. * TARGET_FORMAT_TYPES: Misc. (line 965)
  45805. * TARGET_FRAME_POINTER_REQUIRED: Elimination. (line 8)
  45806. * TARGET_FUNCTION_ARG: Register Arguments. (line 10)
  45807. * TARGET_FUNCTION_ARG_ADVANCE: Register Arguments. (line 195)
  45808. * TARGET_FUNCTION_ARG_BOUNDARY: Register Arguments. (line 248)
  45809. * TARGET_FUNCTION_ARG_OFFSET: Register Arguments. (line 206)
  45810. * TARGET_FUNCTION_ARG_PADDING: Register Arguments. (line 214)
  45811. * TARGET_FUNCTION_ARG_ROUND_BOUNDARY: Register Arguments. (line 254)
  45812. * TARGET_FUNCTION_ATTRIBUTE_INLINABLE_P: Target Attributes. (line 101)
  45813. * TARGET_FUNCTION_INCOMING_ARG: Register Arguments. (line 64)
  45814. * TARGET_FUNCTION_OK_FOR_SIBCALL: Tail Calls. (line 6)
  45815. * TARGET_FUNCTION_VALUE: Scalar Return. (line 9)
  45816. * TARGET_FUNCTION_VALUE_REGNO_P: Scalar Return. (line 96)
  45817. * TARGET_GENERATE_VERSION_DISPATCHER_BODY: Misc. (line 717)
  45818. * TARGET_GEN_CCMP_FIRST: Misc. (line 890)
  45819. * TARGET_GEN_CCMP_NEXT: Misc. (line 901)
  45820. * TARGET_GET_DRAP_RTX: Misc. (line 1058)
  45821. * TARGET_GET_FUNCTION_VERSIONS_DISPATCHER: Misc. (line 710)
  45822. * TARGET_GET_MULTILIB_ABI_NAME: Register Basics. (line 99)
  45823. * TARGET_GET_PCH_VALIDITY: PCH Target. (line 6)
  45824. * TARGET_GET_RAW_ARG_MODE: Aggregate Return. (line 81)
  45825. * TARGET_GET_RAW_RESULT_MODE: Aggregate Return. (line 76)
  45826. * TARGET_GET_VALID_OPTION_VALUES: Stack Smashing Protection.
  45827. (line 39)
  45828. * TARGET_GIMPLE_FOLD_BUILTIN: Misc. (line 694)
  45829. * TARGET_GIMPLIFY_VA_ARG_EXPR: Register Arguments. (line 307)
  45830. * TARGET_GOACC_DIM_LIMIT: Addressing Modes. (line 540)
  45831. * TARGET_GOACC_FORK_JOIN: Addressing Modes. (line 544)
  45832. * TARGET_GOACC_REDUCTION: Addressing Modes. (line 555)
  45833. * TARGET_GOACC_VALIDATE_DIMS: Addressing Modes. (line 527)
  45834. * TARGET_HANDLE_C_OPTION: Run-time Target. (line 73)
  45835. * TARGET_HANDLE_GENERIC_ATTRIBUTE: Target Attributes. (line 93)
  45836. * TARGET_HANDLE_OPTION: Run-time Target. (line 59)
  45837. * TARGET_HARD_REGNO_CALL_PART_CLOBBERED: Register Basics. (line 76)
  45838. * TARGET_HARD_REGNO_MODE_OK: Values in Registers.
  45839. (line 54)
  45840. * TARGET_HARD_REGNO_NREGS: Values in Registers.
  45841. (line 10)
  45842. * TARGET_HARD_REGNO_SCRATCH_OK: Values in Registers.
  45843. (line 139)
  45844. * TARGET_HAS_IFUNC_P: Misc. (line 1106)
  45845. * TARGET_HAS_NO_HW_DIVIDE: Library Calls. (line 52)
  45846. * TARGET_HAVE_CONDITIONAL_EXECUTION: Misc. (line 884)
  45847. * TARGET_HAVE_COUNT_REG_DECR_P: Misc. (line 731)
  45848. * TARGET_HAVE_CTORS_DTORS: Macros for Initialization.
  45849. (line 63)
  45850. * TARGET_HAVE_NAMED_SECTIONS: File Framework. (line 150)
  45851. * TARGET_HAVE_SPECULATION_SAFE_VALUE: Misc. (line 1189)
  45852. * TARGET_HAVE_SRODATA_SECTION: Sections. (line 309)
  45853. * TARGET_HAVE_SWITCHABLE_BSS_SECTIONS: File Framework. (line 155)
  45854. * TARGET_HAVE_TLS: Sections. (line 329)
  45855. * TARGET_INIT_BUILTINS: Misc. (line 621)
  45856. * TARGET_INIT_DWARF_REG_SIZES_EXTRA: Exception Region Output.
  45857. (line 119)
  45858. * TARGET_INIT_LIBFUNCS: Library Calls. (line 15)
  45859. * TARGET_INIT_PIC_REG: Register Arguments. (line 88)
  45860. * TARGET_INSERT_ATTRIBUTES: Target Attributes. (line 80)
  45861. * TARGET_INSN_CALLEE_ABI: Register Basics. (line 65)
  45862. * TARGET_INSN_COST: Costs. (line 380)
  45863. * TARGET_INSTANTIATE_DECLS: Storage Layout. (line 551)
  45864. * TARGET_INVALID_ARG_FOR_UNPROTOTYPED_FN: Misc. (line 989)
  45865. * TARGET_INVALID_BINARY_OP: Misc. (line 1008)
  45866. * TARGET_INVALID_CONVERSION: Misc. (line 995)
  45867. * TARGET_INVALID_UNARY_OP: Misc. (line 1001)
  45868. * TARGET_INVALID_WITHIN_DOLOOP: Misc. (line 774)
  45869. * TARGET_IN_SMALL_DATA_P: Sections. (line 305)
  45870. * TARGET_IRA_CHANGE_PSEUDO_ALLOCNO_CLASS: Register Classes. (line 570)
  45871. * TARGET_KEEP_LEAF_WHEN_PROFILED: Profiling. (line 39)
  45872. * TARGET_LEGITIMATE_ADDRESS_P: Addressing Modes. (line 48)
  45873. * TARGET_LEGITIMATE_COMBINED_INSN: Misc. (line 788)
  45874. * TARGET_LEGITIMATE_CONSTANT_P: Addressing Modes. (line 213)
  45875. * TARGET_LEGITIMIZE_ADDRESS: Addressing Modes. (line 129)
  45876. * TARGET_LEGITIMIZE_ADDRESS_DISPLACEMENT: Register Classes. (line 618)
  45877. * TARGET_LIBCALL_VALUE: Scalar Return. (line 65)
  45878. * TARGET_LIBC_HAS_FAST_FUNCTION: Library Calls. (line 82)
  45879. * TARGET_LIBC_HAS_FUNCTION: Library Calls. (line 77)
  45880. * TARGET_LIBFUNC_GNU_PREFIX: Library Calls. (line 24)
  45881. * TARGET_LIBGCC_CMP_RETURN_MODE: Storage Layout. (line 493)
  45882. * TARGET_LIBGCC_FLOATING_MODE_SUPPORTED_P: Register Arguments.
  45883. (line 412)
  45884. * TARGET_LIBGCC_SDATA_SECTION: Sections. (line 136)
  45885. * TARGET_LIBGCC_SHIFT_COUNT_MODE: Storage Layout. (line 499)
  45886. * TARGET_LIB_INT_CMP_BIASED: Library Calls. (line 42)
  45887. * TARGET_LOAD_BOUNDS_FOR_ARG: Varargs. (line 153)
  45888. * TARGET_LOAD_RETURNED_BOUNDS: Varargs. (line 172)
  45889. * TARGET_LOOP_UNROLL_ADJUST: Misc. (line 918)
  45890. * TARGET_LRA_P: Register Classes. (line 577)
  45891. * TARGET_MACHINE_DEPENDENT_REORG: Misc. (line 606)
  45892. * TARGET_MANGLE_ASSEMBLER_NAME: Label Output. (line 356)
  45893. * TARGET_MANGLE_DECL_ASSEMBLER_NAME: Sections. (line 253)
  45894. * TARGET_MANGLE_TYPE: Storage Layout. (line 555)
  45895. * TARGET_MAX_ANCHOR_OFFSET: Anchored Addresses. (line 38)
  45896. * TARGET_MAX_NOCE_IFCVT_SEQ_COST: Costs. (line 390)
  45897. * TARGET_MD_ASM_ADJUST: Misc. (line 524)
  45898. * TARGET_MEMBER_TYPE_FORCES_BLK: Storage Layout. (line 445)
  45899. * TARGET_MEMMODEL_CHECK: Misc. (line 1097)
  45900. * TARGET_MEMORY_MOVE_COST: Costs. (line 79)
  45901. * TARGET_MEM_CONSTRAINT: Addressing Modes. (line 107)
  45902. * TARGET_MEM_REF: Storage References. (line 6)
  45903. * TARGET_MERGE_DECL_ATTRIBUTES: Target Attributes. (line 45)
  45904. * TARGET_MERGE_TYPE_ATTRIBUTES: Target Attributes. (line 37)
  45905. * TARGET_MIN_ANCHOR_OFFSET: Anchored Addresses. (line 32)
  45906. * TARGET_MIN_ARITHMETIC_PRECISION: Misc. (line 63)
  45907. * TARGET_MIN_DIVISIONS_FOR_RECIP_MUL: Misc. (line 112)
  45908. * TARGET_MODES_TIEABLE_P: Values in Registers.
  45909. (line 123)
  45910. * TARGET_MODE_AFTER: Mode Switching. (line 57)
  45911. * TARGET_MODE_DEPENDENT_ADDRESS_P: Addressing Modes. (line 196)
  45912. * TARGET_MODE_EMIT: Mode Switching. (line 42)
  45913. * TARGET_MODE_ENTRY: Mode Switching. (line 64)
  45914. * TARGET_MODE_EXIT: Mode Switching. (line 71)
  45915. * TARGET_MODE_NEEDED: Mode Switching. (line 50)
  45916. * TARGET_MODE_PRIORITY: Mode Switching. (line 78)
  45917. * TARGET_MODE_REP_EXTENDED: Misc. (line 197)
  45918. * TARGET_MS_BITFIELD_LAYOUT_P: Storage Layout. (line 509)
  45919. * TARGET_MUST_PASS_IN_STACK: Register Arguments. (line 57)
  45920. * TARGET_MUST_PASS_IN_STACK, and TARGET_FUNCTION_ARG: Register Arguments.
  45921. (line 49)
  45922. * TARGET_NARROW_VOLATILE_BITFIELD: Storage Layout. (line 438)
  45923. * TARGET_NOCE_CONVERSION_PROFITABLE_P: Costs. (line 409)
  45924. * TARGET_NO_REGISTER_ALLOCATION: DWARF. (line 85)
  45925. * TARGET_NO_SPECULATION_IN_DELAY_SLOTS_P: Costs. (line 415)
  45926. * TARGET_N_FORMAT_TYPES: Misc. (line 970)
  45927. * TARGET_OBJC_CONSTRUCT_STRING_OBJECT: Run-time Target. (line 88)
  45928. * TARGET_OBJC_DECLARE_CLASS_DEFINITION: Run-time Target. (line 109)
  45929. * TARGET_OBJC_DECLARE_UNRESOLVED_CLASS_REFERENCE: Run-time Target.
  45930. (line 104)
  45931. * TARGET_OBJECT_SUFFIX: Misc. (line 853)
  45932. * TARGET_OBJFMT_CPP_BUILTINS: Run-time Target. (line 45)
  45933. * TARGET_OFFLOAD_OPTIONS: Misc. (line 1140)
  45934. * TARGET_OMIT_STRUCT_RETURN_REG: Scalar Return. (line 117)
  45935. * TARGET_OMP_DEVICE_KIND_ARCH_ISA: Addressing Modes. (line 519)
  45936. * TARGET_OPTAB_SUPPORTED_P: Costs. (line 299)
  45937. * TARGET_OPTF: Misc. (line 952)
  45938. * TARGET_OPTION_FUNCTION_VERSIONS: Target Attributes. (line 165)
  45939. * TARGET_OPTION_INIT_STRUCT: Run-time Target. (line 156)
  45940. * TARGET_OPTION_OPTIMIZATION_TABLE: Run-time Target. (line 142)
  45941. * TARGET_OPTION_OVERRIDE: Target Attributes. (line 152)
  45942. * TARGET_OPTION_POST_STREAM_IN: Target Attributes. (line 133)
  45943. * TARGET_OPTION_PRAGMA_PARSE: Target Attributes. (line 145)
  45944. * TARGET_OPTION_PRINT: Target Attributes. (line 139)
  45945. * TARGET_OPTION_RESTORE: Target Attributes. (line 127)
  45946. * TARGET_OPTION_SAVE: Target Attributes. (line 120)
  45947. * TARGET_OPTION_VALID_ATTRIBUTE_P: Target Attributes. (line 108)
  45948. * TARGET_OS_CPP_BUILTINS: Run-time Target. (line 41)
  45949. * TARGET_OVERRIDES_FORMAT_ATTRIBUTES: Misc. (line 974)
  45950. * TARGET_OVERRIDES_FORMAT_ATTRIBUTES_COUNT: Misc. (line 980)
  45951. * TARGET_OVERRIDES_FORMAT_INIT: Misc. (line 984)
  45952. * TARGET_OVERRIDE_OPTIONS_AFTER_CHANGE: Run-time Target. (line 126)
  45953. * TARGET_PASS_BY_REFERENCE: Register Arguments. (line 112)
  45954. * TARGET_PCH_VALID_P: PCH Target. (line 11)
  45955. * TARGET_POSIX_IO: Misc. (line 550)
  45956. * TARGET_PREDICT_DOLOOP_P: Misc. (line 724)
  45957. * TARGET_PREFERRED_ELSE_VALUE: Addressing Modes. (line 563)
  45958. * TARGET_PREFERRED_OUTPUT_RELOAD_CLASS: Register Classes. (line 284)
  45959. * TARGET_PREFERRED_RELOAD_CLASS: Register Classes. (line 213)
  45960. * TARGET_PREFERRED_RENAME_CLASS: Register Classes. (line 201)
  45961. * TARGET_PREPARE_PCH_SAVE: PCH Target. (line 34)
  45962. * TARGET_PRETEND_OUTGOING_VARARGS_NAMED: Varargs. (line 144)
  45963. * TARGET_PROFILE_BEFORE_PROLOGUE: Sections. (line 313)
  45964. * TARGET_PROMOTED_TYPE: Misc. (line 1014)
  45965. * TARGET_PROMOTE_FUNCTION_MODE: Storage Layout. (line 126)
  45966. * TARGET_PROMOTE_PROTOTYPES: Stack Arguments. (line 10)
  45967. * TARGET_PTRMEMFUNC_VBIT_LOCATION: Type Layout. (line 250)
  45968. * TARGET_RECORD_OFFLOAD_SYMBOL: Misc. (line 1135)
  45969. * TARGET_REF_MAY_ALIAS_ERRNO: Register Arguments. (line 318)
  45970. * TARGET_REGISTER_MOVE_COST: Costs. (line 31)
  45971. * TARGET_REGISTER_PRIORITY: Register Classes. (line 582)
  45972. * TARGET_REGISTER_USAGE_LEVELING_P: Register Classes. (line 593)
  45973. * TARGET_RELAYOUT_FUNCTION: Target Attributes. (line 180)
  45974. * TARGET_RESET_LOCATION_VIEW: DWARF. (line 57)
  45975. * TARGET_RESOLVE_OVERLOADED_BUILTIN: Misc. (line 658)
  45976. * TARGET_RETURN_IN_MEMORY: Aggregate Return. (line 15)
  45977. * TARGET_RETURN_IN_MSB: Scalar Return. (line 124)
  45978. * TARGET_RETURN_POPS_ARGS: Stack Arguments. (line 98)
  45979. * TARGET_RTX_COSTS: Costs. (line 313)
  45980. * TARGET_RUN_TARGET_SELFTESTS: Misc. (line 1226)
  45981. * TARGET_SCALAR_MODE_SUPPORTED_P: Register Arguments. (line 334)
  45982. * TARGET_SCHED_ADJUST_COST: Scheduling. (line 35)
  45983. * TARGET_SCHED_ADJUST_PRIORITY: Scheduling. (line 50)
  45984. * TARGET_SCHED_ALLOC_SCHED_CONTEXT: Scheduling. (line 294)
  45985. * TARGET_SCHED_CAN_SPECULATE_INSN: Scheduling. (line 354)
  45986. * TARGET_SCHED_CLEAR_SCHED_CONTEXT: Scheduling. (line 309)
  45987. * TARGET_SCHED_DEPENDENCIES_EVALUATION_HOOK: Scheduling. (line 101)
  45988. * TARGET_SCHED_DFA_NEW_CYCLE: Scheduling. (line 255)
  45989. * TARGET_SCHED_DFA_POST_ADVANCE_CYCLE: Scheduling. (line 172)
  45990. * TARGET_SCHED_DFA_POST_CYCLE_INSN: Scheduling. (line 156)
  45991. * TARGET_SCHED_DFA_PRE_ADVANCE_CYCLE: Scheduling. (line 165)
  45992. * TARGET_SCHED_DFA_PRE_CYCLE_INSN: Scheduling. (line 144)
  45993. * TARGET_SCHED_DISPATCH: Scheduling. (line 370)
  45994. * TARGET_SCHED_DISPATCH_DO: Scheduling. (line 375)
  45995. * TARGET_SCHED_EXPOSED_PIPELINE: Scheduling. (line 379)
  45996. * TARGET_SCHED_FINISH: Scheduling. (line 122)
  45997. * TARGET_SCHED_FINISH_GLOBAL: Scheduling. (line 137)
  45998. * TARGET_SCHED_FIRST_CYCLE_MULTIPASS_BACKTRACK: Scheduling. (line 235)
  45999. * TARGET_SCHED_FIRST_CYCLE_MULTIPASS_BEGIN: Scheduling. (line 223)
  46000. * TARGET_SCHED_FIRST_CYCLE_MULTIPASS_DFA_LOOKAHEAD: Scheduling.
  46001. (line 179)
  46002. * TARGET_SCHED_FIRST_CYCLE_MULTIPASS_DFA_LOOKAHEAD_GUARD: Scheduling.
  46003. (line 207)
  46004. * TARGET_SCHED_FIRST_CYCLE_MULTIPASS_END: Scheduling. (line 240)
  46005. * TARGET_SCHED_FIRST_CYCLE_MULTIPASS_FINI: Scheduling. (line 250)
  46006. * TARGET_SCHED_FIRST_CYCLE_MULTIPASS_INIT: Scheduling. (line 245)
  46007. * TARGET_SCHED_FIRST_CYCLE_MULTIPASS_ISSUE: Scheduling. (line 229)
  46008. * TARGET_SCHED_FREE_SCHED_CONTEXT: Scheduling. (line 313)
  46009. * TARGET_SCHED_FUSION_PRIORITY: Scheduling. (line 389)
  46010. * TARGET_SCHED_GEN_SPEC_CHECK: Scheduling. (line 335)
  46011. * TARGET_SCHED_H_I_D_EXTENDED: Scheduling. (line 289)
  46012. * TARGET_SCHED_INIT: Scheduling. (line 111)
  46013. * TARGET_SCHED_INIT_DFA_POST_CYCLE_INSN: Scheduling. (line 161)
  46014. * TARGET_SCHED_INIT_DFA_PRE_CYCLE_INSN: Scheduling. (line 153)
  46015. * TARGET_SCHED_INIT_GLOBAL: Scheduling. (line 129)
  46016. * TARGET_SCHED_INIT_SCHED_CONTEXT: Scheduling. (line 298)
  46017. * TARGET_SCHED_ISSUE_RATE: Scheduling. (line 11)
  46018. * TARGET_SCHED_IS_COSTLY_DEPENDENCE: Scheduling. (line 267)
  46019. * TARGET_SCHED_MACRO_FUSION_P: Scheduling. (line 87)
  46020. * TARGET_SCHED_MACRO_FUSION_PAIR_P: Scheduling. (line 91)
  46021. * TARGET_SCHED_NEEDS_BLOCK_P: Scheduling. (line 328)
  46022. * TARGET_SCHED_REASSOCIATION_WIDTH: Scheduling. (line 384)
  46023. * TARGET_SCHED_REORDER: Scheduling. (line 58)
  46024. * TARGET_SCHED_REORDER2: Scheduling. (line 75)
  46025. * TARGET_SCHED_SET_SCHED_CONTEXT: Scheduling. (line 305)
  46026. * TARGET_SCHED_SET_SCHED_FLAGS: Scheduling. (line 347)
  46027. * TARGET_SCHED_SMS_RES_MII: Scheduling. (line 361)
  46028. * TARGET_SCHED_SPECULATE_INSN: Scheduling. (line 316)
  46029. * TARGET_SCHED_VARIABLE_ISSUE: Scheduling. (line 22)
  46030. * TARGET_SECONDARY_MEMORY_NEEDED: Register Classes. (line 447)
  46031. * TARGET_SECONDARY_MEMORY_NEEDED_MODE: Register Classes. (line 466)
  46032. * TARGET_SECONDARY_RELOAD: Register Classes. (line 312)
  46033. * TARGET_SECTION_TYPE_FLAGS: File Framework. (line 160)
  46034. * TARGET_SELECT_EARLY_REMAT_MODES: Register Classes. (line 488)
  46035. * TARGET_SETJMP_PRESERVES_NONVOLATILE_REGS_P: Misc. (line 223)
  46036. * TARGET_SETUP_INCOMING_VARARGS: Varargs. (line 71)
  46037. * TARGET_SET_CURRENT_FUNCTION: Misc. (line 835)
  46038. * TARGET_SET_DEFAULT_TYPE_ATTRIBUTES: Target Attributes. (line 33)
  46039. * TARGET_SET_UP_BY_PROLOGUE: Tail Calls. (line 29)
  46040. * TARGET_SHIFT_TRUNCATION_MASK: Misc. (line 160)
  46041. * TARGET_SHRINK_WRAP_COMPONENTS_FOR_BB: Shrink-wrapping separate components.
  46042. (line 36)
  46043. * TARGET_SHRINK_WRAP_DISQUALIFY_COMPONENTS: Shrink-wrapping separate components.
  46044. (line 43)
  46045. * TARGET_SHRINK_WRAP_EMIT_EPILOGUE_COMPONENTS: Shrink-wrapping separate components.
  46046. (line 54)
  46047. * TARGET_SHRINK_WRAP_EMIT_PROLOGUE_COMPONENTS: Shrink-wrapping separate components.
  46048. (line 50)
  46049. * TARGET_SHRINK_WRAP_GET_SEPARATE_COMPONENTS: Shrink-wrapping separate components.
  46050. (line 27)
  46051. * TARGET_SHRINK_WRAP_SET_HANDLED_COMPONENTS: Shrink-wrapping separate components.
  46052. (line 58)
  46053. * TARGET_SIMD_CLONE_ADJUST: Addressing Modes. (line 506)
  46054. * TARGET_SIMD_CLONE_COMPUTE_VECSIZE_AND_SIMDLEN: Addressing Modes.
  46055. (line 498)
  46056. * TARGET_SIMD_CLONE_USABLE: Addressing Modes. (line 510)
  46057. * TARGET_SIMT_VF: Addressing Modes. (line 516)
  46058. * TARGET_SLOW_UNALIGNED_ACCESS: Costs. (line 132)
  46059. * TARGET_SMALL_REGISTER_CLASSES_FOR_MODE_P: Register Arguments.
  46060. (line 448)
  46061. * TARGET_SPECULATION_SAFE_VALUE: Misc. (line 1208)
  46062. * TARGET_SPILL_CLASS: Register Classes. (line 632)
  46063. * TARGET_SPLIT_COMPLEX_ARG: Register Arguments. (line 269)
  46064. * TARGET_STACK_CLASH_PROTECTION_ALLOCA_PROBE_RANGE: Stack Checking.
  46065. (line 97)
  46066. * TARGET_STACK_PROTECT_FAIL: Stack Smashing Protection.
  46067. (line 16)
  46068. * TARGET_STACK_PROTECT_GUARD: Stack Smashing Protection.
  46069. (line 6)
  46070. * TARGET_STACK_PROTECT_RUNTIME_ENABLED_P: Stack Smashing Protection.
  46071. (line 25)
  46072. * TARGET_STARTING_FRAME_OFFSET: Frame Layout. (line 34)
  46073. * TARGET_STARTING_FRAME_OFFSET and virtual registers: Regs and Memory.
  46074. (line 74)
  46075. * TARGET_STATIC_CHAIN: Frame Registers. (line 90)
  46076. * TARGET_STATIC_RTX_ALIGNMENT: Storage Layout. (line 243)
  46077. * TARGET_STORE_BOUNDS_FOR_ARG: Varargs. (line 163)
  46078. * TARGET_STORE_RETURNED_BOUNDS: Varargs. (line 177)
  46079. * TARGET_STRICT_ARGUMENT_NAMING: Varargs. (line 107)
  46080. * TARGET_STRING_OBJECT_REF_TYPE_P: Run-time Target. (line 114)
  46081. * TARGET_STRIP_NAME_ENCODING: Sections. (line 300)
  46082. * TARGET_STRUCT_VALUE_RTX: Aggregate Return. (line 44)
  46083. * TARGET_SUPPORTS_SPLIT_STACK: Stack Smashing Protection.
  46084. (line 30)
  46085. * TARGET_SUPPORTS_WEAK: Label Output. (line 272)
  46086. * TARGET_SUPPORTS_WIDE_INT: Misc. (line 1148)
  46087. * TARGET_TERMINATE_DW2_EH_FRAME_INFO: Exception Region Output.
  46088. (line 98)
  46089. * TARGET_TRAMPOLINE_ADJUST_ADDRESS: Trampolines. (line 127)
  46090. * TARGET_TRAMPOLINE_INIT: Trampolines. (line 107)
  46091. * TARGET_TRANSLATE_MODE_ATTRIBUTE: Register Arguments. (line 325)
  46092. * TARGET_TRULY_NOOP_TRUNCATION: Misc. (line 184)
  46093. * TARGET_UNSPEC_MAY_TRAP_P: Misc. (line 826)
  46094. * TARGET_UNWIND_TABLES_DEFAULT: Exception Region Output.
  46095. (line 73)
  46096. * TARGET_UNWIND_WORD_MODE: Storage Layout. (line 505)
  46097. * TARGET_UPDATE_STACK_BOUNDARY: Misc. (line 1054)
  46098. * TARGET_USES_WEAK_UNWIND_INFO: Exception Handling. (line 123)
  46099. * TARGET_USE_ANCHORS_FOR_SYMBOL_P: Anchored Addresses. (line 53)
  46100. * TARGET_USE_BLOCKS_FOR_CONSTANT_P: Addressing Modes. (line 248)
  46101. * TARGET_USE_BLOCKS_FOR_DECL_P: Addressing Modes. (line 255)
  46102. * TARGET_USE_BY_PIECES_INFRASTRUCTURE_P: Costs. (line 165)
  46103. * TARGET_USE_PSEUDO_PIC_REG: Register Arguments. (line 84)
  46104. * TARGET_VALID_DLLIMPORT_ATTRIBUTE_P: Target Attributes. (line 66)
  46105. * TARGET_VALID_POINTER_MODE: Register Arguments. (line 313)
  46106. * TARGET_VECTORIZE_ADD_STMT_COST: Addressing Modes. (line 461)
  46107. * TARGET_VECTORIZE_AUTOVECTORIZE_VECTOR_MODES: Addressing Modes.
  46108. (line 376)
  46109. * TARGET_VECTORIZE_BUILTIN_GATHER: Addressing Modes. (line 484)
  46110. * TARGET_VECTORIZE_BUILTIN_MASK_FOR_LOAD: Addressing Modes. (line 266)
  46111. * TARGET_VECTORIZE_BUILTIN_MD_VECTORIZED_FUNCTION: Addressing Modes.
  46112. (line 344)
  46113. * TARGET_VECTORIZE_BUILTIN_SCATTER: Addressing Modes. (line 491)
  46114. * TARGET_VECTORIZE_BUILTIN_VECTORIZATION_COST: Addressing Modes.
  46115. (line 292)
  46116. * TARGET_VECTORIZE_BUILTIN_VECTORIZED_FUNCTION: Addressing Modes.
  46117. (line 336)
  46118. * TARGET_VECTORIZE_DESTROY_COST_DATA: Addressing Modes. (line 479)
  46119. * TARGET_VECTORIZE_EMPTY_MASK_IS_EXPENSIVE: Addressing Modes.
  46120. (line 445)
  46121. * TARGET_VECTORIZE_FINISH_COST: Addressing Modes. (line 472)
  46122. * TARGET_VECTORIZE_GET_MASK_MODE: Addressing Modes. (line 433)
  46123. * TARGET_VECTORIZE_INIT_COST: Addressing Modes. (line 452)
  46124. * TARGET_VECTORIZE_PREFERRED_SIMD_MODE: Addressing Modes. (line 361)
  46125. * TARGET_VECTORIZE_PREFERRED_VECTOR_ALIGNMENT: Addressing Modes.
  46126. (line 298)
  46127. * TARGET_VECTORIZE_RELATED_MODE: Addressing Modes. (line 407)
  46128. * TARGET_VECTORIZE_SPLIT_REDUCTION: Addressing Modes. (line 368)
  46129. * TARGET_VECTORIZE_SUPPORT_VECTOR_MISALIGNMENT: Addressing Modes.
  46130. (line 351)
  46131. * TARGET_VECTORIZE_VECTOR_ALIGNMENT_REACHABLE: Addressing Modes.
  46132. (line 310)
  46133. * TARGET_VECTORIZE_VEC_PERM_CONST: Addressing Modes. (line 316)
  46134. * TARGET_VECTOR_ALIGNMENT: Storage Layout. (line 298)
  46135. * TARGET_VECTOR_MODE_SUPPORTED_P: Register Arguments. (line 345)
  46136. * TARGET_VERIFY_TYPE_CONTEXT: Misc. (line 1029)
  46137. * TARGET_VTABLE_DATA_ENTRY_DISTANCE: Type Layout. (line 303)
  46138. * TARGET_VTABLE_ENTRY_ALIGN: Type Layout. (line 297)
  46139. * TARGET_VTABLE_USES_DESCRIPTORS: Type Layout. (line 286)
  46140. * TARGET_WANT_DEBUG_PUB_SECTIONS: DWARF. (line 72)
  46141. * TARGET_WARN_FUNC_RETURN: Tail Calls. (line 35)
  46142. * TARGET_WARN_PARAMETER_PASSING_ABI: Aggregate Return. (line 90)
  46143. * TARGET_WEAK_NOT_IN_ARCHIVE_TOC: Label Output. (line 308)
  46144. * TCmode: Machine Modes. (line 199)
  46145. * TDmode: Machine Modes. (line 97)
  46146. * TEMPLATE_DECL: Declarations. (line 6)
  46147. * Temporaries: Temporaries. (line 6)
  46148. * termination routines: Initialization. (line 6)
  46149. * testing constraints: C Constraint Interface.
  46150. (line 6)
  46151. * TEXT_SECTION_ASM_OP: Sections. (line 37)
  46152. * TFmode: Machine Modes. (line 101)
  46153. * The Language: The Language. (line 6)
  46154. * THEN_CLAUSE: Statements for C++. (line 6)
  46155. * THREAD_MODEL_SPEC: Driver. (line 162)
  46156. * THROW_EXPR: Unary and Binary Expressions.
  46157. (line 6)
  46158. * THUNK_DECL: Declarations. (line 6)
  46159. * THUNK_DELTA: Declarations. (line 6)
  46160. * TImode: Machine Modes. (line 48)
  46161. * TImode, in insn: Insns. (line 291)
  46162. * TLS_COMMON_ASM_OP: Sections. (line 80)
  46163. * TLS_SECTION_ASM_FLAG: Sections. (line 85)
  46164. * tm.h macros: Target Macros. (line 6)
  46165. * TQFmode: Machine Modes. (line 65)
  46166. * TQmode: Machine Modes. (line 122)
  46167. * trampolines for nested functions: Trampolines. (line 6)
  46168. * TRAMPOLINE_ALIGNMENT: Trampolines. (line 101)
  46169. * TRAMPOLINE_SECTION: Trampolines. (line 92)
  46170. * TRAMPOLINE_SIZE: Trampolines. (line 97)
  46171. * TRANSFER_FROM_TRAMPOLINE: Trampolines. (line 163)
  46172. * trap instruction pattern: Standard Names. (line 2121)
  46173. * tree: Tree overview. (line 6)
  46174. * tree <1>: Macros and Functions.
  46175. (line 6)
  46176. * Tree SSA: Tree SSA. (line 6)
  46177. * TREE_CHAIN: Macros and Functions.
  46178. (line 6)
  46179. * TREE_CODE: Tree overview. (line 6)
  46180. * tree_fits_shwi_p: Constant expressions.
  46181. (line 6)
  46182. * tree_fits_uhwi_p: Constant expressions.
  46183. (line 6)
  46184. * TREE_INT_CST_ELT: Constant expressions.
  46185. (line 6)
  46186. * tree_int_cst_equal: Constant expressions.
  46187. (line 6)
  46188. * TREE_INT_CST_LOW: Constant expressions.
  46189. (line 6)
  46190. * tree_int_cst_lt: Constant expressions.
  46191. (line 6)
  46192. * TREE_INT_CST_NUNITS: Constant expressions.
  46193. (line 6)
  46194. * TREE_LIST: Containers. (line 6)
  46195. * TREE_OPERAND: Expression trees. (line 6)
  46196. * TREE_PUBLIC: Function Basics. (line 6)
  46197. * TREE_PUBLIC <1>: Function Properties.
  46198. (line 28)
  46199. * TREE_PURPOSE: Containers. (line 6)
  46200. * TREE_READONLY: Function Properties.
  46201. (line 37)
  46202. * tree_size: Macros and Functions.
  46203. (line 13)
  46204. * TREE_STATIC: Function Properties.
  46205. (line 31)
  46206. * TREE_STRING_LENGTH: Constant expressions.
  46207. (line 6)
  46208. * TREE_STRING_POINTER: Constant expressions.
  46209. (line 6)
  46210. * TREE_THIS_VOLATILE: Function Properties.
  46211. (line 34)
  46212. * tree_to_shwi: Constant expressions.
  46213. (line 6)
  46214. * tree_to_uhwi: Constant expressions.
  46215. (line 6)
  46216. * TREE_TYPE: Macros and Functions.
  46217. (line 6)
  46218. * TREE_TYPE <1>: Types. (line 6)
  46219. * TREE_TYPE <2>: Working with declarations.
  46220. (line 11)
  46221. * TREE_TYPE <3>: Expression trees. (line 6)
  46222. * TREE_TYPE <4>: Expression trees. (line 17)
  46223. * TREE_TYPE <5>: Function Basics. (line 47)
  46224. * TREE_TYPE <6>: Types for C++. (line 6)
  46225. * TREE_VALUE: Containers. (line 6)
  46226. * TREE_VEC: Containers. (line 6)
  46227. * TREE_VEC_ELT: Containers. (line 6)
  46228. * TREE_VEC_LENGTH: Containers. (line 6)
  46229. * true positive: Guidelines for Diagnostics.
  46230. (line 39)
  46231. * truncate: Conversions. (line 38)
  46232. * truncMN2 instruction pattern: Standard Names. (line 1442)
  46233. * TRUNC_DIV_EXPR: Unary and Binary Expressions.
  46234. (line 6)
  46235. * TRUNC_MOD_EXPR: Unary and Binary Expressions.
  46236. (line 6)
  46237. * TRUTH_ANDIF_EXPR: Unary and Binary Expressions.
  46238. (line 6)
  46239. * TRUTH_AND_EXPR: Unary and Binary Expressions.
  46240. (line 6)
  46241. * TRUTH_NOT_EXPR: Unary and Binary Expressions.
  46242. (line 6)
  46243. * TRUTH_ORIF_EXPR: Unary and Binary Expressions.
  46244. (line 6)
  46245. * TRUTH_OR_EXPR: Unary and Binary Expressions.
  46246. (line 6)
  46247. * TRUTH_XOR_EXPR: Unary and Binary Expressions.
  46248. (line 6)
  46249. * TRY_BLOCK: Statements for C++. (line 6)
  46250. * TRY_HANDLERS: Statements for C++. (line 6)
  46251. * TRY_STMTS: Statements for C++. (line 6)
  46252. * Tuple specific accessors: Tuple specific accessors.
  46253. (line 6)
  46254. * tuples: Tuple representation.
  46255. (line 6)
  46256. * type: Types. (line 6)
  46257. * type declaration: Declarations. (line 6)
  46258. * TYPENAME_TYPE: Types for C++. (line 6)
  46259. * TYPENAME_TYPE_FULLNAME: Types. (line 6)
  46260. * TYPENAME_TYPE_FULLNAME <1>: Types for C++. (line 6)
  46261. * TYPEOF_TYPE: Types for C++. (line 6)
  46262. * TYPE_ALIGN: Types. (line 6)
  46263. * TYPE_ALIGN <1>: Types. (line 30)
  46264. * TYPE_ALIGN <2>: Types for C++. (line 6)
  46265. * TYPE_ALIGN <3>: Types for C++. (line 44)
  46266. * TYPE_ARG_TYPES: Types. (line 6)
  46267. * TYPE_ARG_TYPES <1>: Types for C++. (line 6)
  46268. * TYPE_ASM_OP: Label Output. (line 76)
  46269. * TYPE_ATTRIBUTES: Attributes. (line 24)
  46270. * TYPE_BINFO: Classes. (line 6)
  46271. * TYPE_BUILT_IN: Types for C++. (line 66)
  46272. * TYPE_CANONICAL: Types. (line 6)
  46273. * TYPE_CANONICAL <1>: Types. (line 41)
  46274. * TYPE_CONTEXT: Types. (line 6)
  46275. * TYPE_CONTEXT <1>: Types for C++. (line 6)
  46276. * TYPE_DECL: Declarations. (line 6)
  46277. * TYPE_FIELDS: Types. (line 6)
  46278. * TYPE_FIELDS <1>: Types for C++. (line 6)
  46279. * TYPE_FIELDS <2>: Classes. (line 6)
  46280. * TYPE_HAS_ARRAY_NEW_OPERATOR: Classes. (line 93)
  46281. * TYPE_HAS_DEFAULT_CONSTRUCTOR: Classes. (line 78)
  46282. * TYPE_HAS_MUTABLE_P: Classes. (line 83)
  46283. * TYPE_HAS_NEW_OPERATOR: Classes. (line 90)
  46284. * TYPE_MAIN_VARIANT: Types. (line 6)
  46285. * TYPE_MAIN_VARIANT <1>: Types. (line 19)
  46286. * TYPE_MAIN_VARIANT <2>: Types for C++. (line 6)
  46287. * TYPE_MAX_VALUE: Types. (line 6)
  46288. * TYPE_METHOD_BASETYPE: Types. (line 6)
  46289. * TYPE_METHOD_BASETYPE <1>: Types for C++. (line 6)
  46290. * TYPE_MIN_VALUE: Types. (line 6)
  46291. * TYPE_NAME: Types. (line 6)
  46292. * TYPE_NAME <1>: Types. (line 33)
  46293. * TYPE_NAME <2>: Types for C++. (line 6)
  46294. * TYPE_NAME <3>: Types for C++. (line 47)
  46295. * TYPE_NOTHROW_P: Functions for C++. (line 154)
  46296. * TYPE_OFFSET_BASETYPE: Types. (line 6)
  46297. * TYPE_OFFSET_BASETYPE <1>: Types for C++. (line 6)
  46298. * TYPE_OPERAND_FMT: Label Output. (line 87)
  46299. * TYPE_OVERLOADS_ARRAY_REF: Classes. (line 101)
  46300. * TYPE_OVERLOADS_ARROW: Classes. (line 104)
  46301. * TYPE_OVERLOADS_CALL_EXPR: Classes. (line 97)
  46302. * TYPE_POLYMORPHIC_P: Classes. (line 74)
  46303. * TYPE_PRECISION: Types. (line 6)
  46304. * TYPE_PRECISION <1>: Types for C++. (line 6)
  46305. * TYPE_PTRDATAMEM_P: Types for C++. (line 6)
  46306. * TYPE_PTRDATAMEM_P <1>: Types for C++. (line 69)
  46307. * TYPE_PTRFN_P: Types for C++. (line 76)
  46308. * TYPE_PTROBV_P: Types for C++. (line 6)
  46309. * TYPE_PTROB_P: Types for C++. (line 79)
  46310. * TYPE_PTR_P: Types for C++. (line 72)
  46311. * TYPE_QUAL_CONST: Types. (line 6)
  46312. * TYPE_QUAL_CONST <1>: Types for C++. (line 6)
  46313. * TYPE_QUAL_RESTRICT: Types. (line 6)
  46314. * TYPE_QUAL_RESTRICT <1>: Types for C++. (line 6)
  46315. * TYPE_QUAL_VOLATILE: Types. (line 6)
  46316. * TYPE_QUAL_VOLATILE <1>: Types for C++. (line 6)
  46317. * TYPE_RAISES_EXCEPTIONS: Functions for C++. (line 149)
  46318. * TYPE_SIZE: Types. (line 6)
  46319. * TYPE_SIZE <1>: Types. (line 25)
  46320. * TYPE_SIZE <2>: Types for C++. (line 6)
  46321. * TYPE_SIZE <3>: Types for C++. (line 39)
  46322. * TYPE_STRUCTURAL_EQUALITY_P: Types. (line 6)
  46323. * TYPE_STRUCTURAL_EQUALITY_P <1>: Types. (line 77)
  46324. * TYPE_UNQUALIFIED: Types. (line 6)
  46325. * TYPE_UNQUALIFIED <1>: Types for C++. (line 6)
  46326. * TYPE_VFIELD: Classes. (line 6)
  46327. * uaddvM4 instruction pattern: Standard Names. (line 461)
  46328. * uavgM3_ceil instruction pattern: Standard Names. (line 860)
  46329. * uavgM3_floor instruction pattern: Standard Names. (line 848)
  46330. * UDAmode: Machine Modes. (line 170)
  46331. * udiv: Arithmetic. (line 130)
  46332. * udivM3 instruction pattern: Standard Names. (line 442)
  46333. * udivmodM4 instruction pattern: Standard Names. (line 825)
  46334. * udot_prodM instruction pattern: Standard Names. (line 570)
  46335. * UDQmode: Machine Modes. (line 138)
  46336. * UHAmode: Machine Modes. (line 162)
  46337. * UHQmode: Machine Modes. (line 130)
  46338. * UINT16_TYPE: Type Layout. (line 214)
  46339. * UINT32_TYPE: Type Layout. (line 215)
  46340. * UINT64_TYPE: Type Layout. (line 216)
  46341. * UINT8_TYPE: Type Layout. (line 213)
  46342. * UINTMAX_TYPE: Type Layout. (line 197)
  46343. * UINTPTR_TYPE: Type Layout. (line 234)
  46344. * UINT_FAST16_TYPE: Type Layout. (line 230)
  46345. * UINT_FAST32_TYPE: Type Layout. (line 231)
  46346. * UINT_FAST64_TYPE: Type Layout. (line 232)
  46347. * UINT_FAST8_TYPE: Type Layout. (line 229)
  46348. * UINT_LEAST16_TYPE: Type Layout. (line 222)
  46349. * UINT_LEAST32_TYPE: Type Layout. (line 223)
  46350. * UINT_LEAST64_TYPE: Type Layout. (line 224)
  46351. * UINT_LEAST8_TYPE: Type Layout. (line 221)
  46352. * umaddMN4 instruction pattern: Standard Names. (line 772)
  46353. * umax: Arithmetic. (line 149)
  46354. * umaxM3 instruction pattern: Standard Names. (line 442)
  46355. * umin: Arithmetic. (line 149)
  46356. * uminM3 instruction pattern: Standard Names. (line 442)
  46357. * umod: Arithmetic. (line 136)
  46358. * umodM3 instruction pattern: Standard Names. (line 442)
  46359. * umsubMN4 instruction pattern: Standard Names. (line 796)
  46360. * umulhisi3 instruction pattern: Standard Names. (line 744)
  46361. * umulhrsM3 instruction pattern: Standard Names. (line 605)
  46362. * umulhsM3 instruction pattern: Standard Names. (line 595)
  46363. * umulM3_highpart instruction pattern: Standard Names. (line 758)
  46364. * umulqihi3 instruction pattern: Standard Names. (line 744)
  46365. * umulsidi3 instruction pattern: Standard Names. (line 744)
  46366. * umulvM4 instruction pattern: Standard Names. (line 466)
  46367. * unchanging: Flags. (line 307)
  46368. * unchanging, in call_insn: Flags. (line 115)
  46369. * unchanging, in jump_insn, call_insn and insn: Flags. (line 28)
  46370. * unchanging, in mem: Flags. (line 78)
  46371. * unchanging, in subreg: Flags. (line 184)
  46372. * unchanging, in subreg <1>: Flags. (line 194)
  46373. * unchanging, in symbol_ref: Flags. (line 19)
  46374. * UNEQ_EXPR: Unary and Binary Expressions.
  46375. (line 6)
  46376. * UNGE_EXPR: Unary and Binary Expressions.
  46377. (line 6)
  46378. * UNGT_EXPR: Unary and Binary Expressions.
  46379. (line 6)
  46380. * unions, returning: Interface. (line 10)
  46381. * UNION_TYPE: Types. (line 6)
  46382. * UNION_TYPE <1>: Classes. (line 6)
  46383. * UNITS_PER_WORD: Storage Layout. (line 60)
  46384. * UNKNOWN_TYPE: Types. (line 6)
  46385. * UNKNOWN_TYPE <1>: Types for C++. (line 6)
  46386. * UNLE_EXPR: Unary and Binary Expressions.
  46387. (line 6)
  46388. * UNLIKELY_EXECUTED_TEXT_SECTION_NAME: Sections. (line 48)
  46389. * UNLT_EXPR: Unary and Binary Expressions.
  46390. (line 6)
  46391. * UNORDERED_EXPR: Unary and Binary Expressions.
  46392. (line 6)
  46393. * unshare_all_rtl: Sharing. (line 61)
  46394. * unsigned division: Arithmetic. (line 130)
  46395. * unsigned division with unsigned saturation: Arithmetic. (line 130)
  46396. * unsigned greater than: Comparisons. (line 64)
  46397. * unsigned greater than <1>: Comparisons. (line 72)
  46398. * unsigned less than: Comparisons. (line 68)
  46399. * unsigned less than <1>: Comparisons. (line 76)
  46400. * unsigned minimum and maximum: Arithmetic. (line 149)
  46401. * unsigned_fix: Conversions. (line 77)
  46402. * unsigned_float: Conversions. (line 62)
  46403. * unsigned_fract_convert: Conversions. (line 97)
  46404. * unsigned_sat_fract: Conversions. (line 103)
  46405. * unspec: Side Effects. (line 299)
  46406. * unspec <1>: Constant Definitions.
  46407. (line 111)
  46408. * unspec_volatile: Side Effects. (line 299)
  46409. * unspec_volatile <1>: Constant Definitions.
  46410. (line 99)
  46411. * untyped_call instruction pattern: Standard Names. (line 1747)
  46412. * untyped_return instruction pattern: Standard Names. (line 1810)
  46413. * UPDATE_PATH_HOST_CANONICALIZE (PATH): Filesystem. (line 59)
  46414. * update_ssa: SSA. (line 74)
  46415. * update_stmt: Manipulating GIMPLE statements.
  46416. (line 140)
  46417. * update_stmt <1>: SSA Operands. (line 6)
  46418. * update_stmt_if_modified: Manipulating GIMPLE statements.
  46419. (line 143)
  46420. * UQQmode: Machine Modes. (line 126)
  46421. * usaddM3 instruction pattern: Standard Names. (line 442)
  46422. * usadM instruction pattern: Standard Names. (line 579)
  46423. * USAmode: Machine Modes. (line 166)
  46424. * usashlM3 instruction pattern: Standard Names. (line 828)
  46425. * usdivM3 instruction pattern: Standard Names. (line 442)
  46426. * use: Side Effects. (line 168)
  46427. * used: Flags. (line 325)
  46428. * used, in symbol_ref: Flags. (line 211)
  46429. * user: GTY Options. (line 245)
  46430. * user experience guidelines: User Experience Guidelines.
  46431. (line 6)
  46432. * user gc: User GC. (line 6)
  46433. * USER_LABEL_PREFIX: Instruction Output. (line 152)
  46434. * USE_C_ALLOCA: Host Misc. (line 19)
  46435. * USE_LD_AS_NEEDED: Driver. (line 135)
  46436. * USE_LOAD_POST_DECREMENT: Costs. (line 254)
  46437. * USE_LOAD_POST_INCREMENT: Costs. (line 249)
  46438. * USE_LOAD_PRE_DECREMENT: Costs. (line 264)
  46439. * USE_LOAD_PRE_INCREMENT: Costs. (line 259)
  46440. * USE_SELECT_SECTION_FOR_FUNCTIONS: Sections. (line 205)
  46441. * USE_STORE_POST_DECREMENT: Costs. (line 274)
  46442. * USE_STORE_POST_INCREMENT: Costs. (line 269)
  46443. * USE_STORE_PRE_DECREMENT: Costs. (line 284)
  46444. * USE_STORE_PRE_INCREMENT: Costs. (line 279)
  46445. * USING_STMT: Statements for C++. (line 6)
  46446. * usmaddMN4 instruction pattern: Standard Names. (line 780)
  46447. * usmsubMN4 instruction pattern: Standard Names. (line 804)
  46448. * usmulhisi3 instruction pattern: Standard Names. (line 748)
  46449. * usmulM3 instruction pattern: Standard Names. (line 442)
  46450. * usmulqihi3 instruction pattern: Standard Names. (line 748)
  46451. * usmulsidi3 instruction pattern: Standard Names. (line 748)
  46452. * usnegM2 instruction pattern: Standard Names. (line 872)
  46453. * USQmode: Machine Modes. (line 134)
  46454. * ussubM3 instruction pattern: Standard Names. (line 442)
  46455. * usubvM4 instruction pattern: Standard Names. (line 466)
  46456. * us_ashift: Arithmetic. (line 173)
  46457. * us_minus: Arithmetic. (line 38)
  46458. * us_mult: Arithmetic. (line 93)
  46459. * us_neg: Arithmetic. (line 82)
  46460. * us_plus: Arithmetic. (line 14)
  46461. * us_truncate: Conversions. (line 48)
  46462. * UTAmode: Machine Modes. (line 174)
  46463. * UTQmode: Machine Modes. (line 142)
  46464. * V in constraint: Simple Constraints. (line 43)
  46465. * values, returned by functions: Scalar Return. (line 6)
  46466. * varargs implementation: Varargs. (line 6)
  46467. * variable: Declarations. (line 6)
  46468. * Variable Location Debug Information in RTL: Debug Information.
  46469. (line 6)
  46470. * VAR_DECL: Declarations. (line 6)
  46471. * var_location: Debug Information. (line 14)
  46472. * vashlM3 instruction pattern: Standard Names. (line 844)
  46473. * vashrM3 instruction pattern: Standard Names. (line 844)
  46474. * VA_ARG_EXPR: Unary and Binary Expressions.
  46475. (line 6)
  46476. * vcondeqMN instruction pattern: Standard Names. (line 385)
  46477. * vcondMN instruction pattern: Standard Names. (line 372)
  46478. * vconduMN instruction pattern: Standard Names. (line 382)
  46479. * vcond_mask_MN instruction pattern: Standard Names. (line 392)
  46480. * vector: Containers. (line 6)
  46481. * vector operations: Vector Operations. (line 6)
  46482. * VECTOR_CST: Constant expressions.
  46483. (line 6)
  46484. * VECTOR_STORE_FLAG_VALUE: Misc. (line 327)
  46485. * vec_cmpeqMN instruction pattern: Standard Names. (line 365)
  46486. * vec_cmpMN instruction pattern: Standard Names. (line 355)
  46487. * vec_cmpuMN instruction pattern: Standard Names. (line 362)
  46488. * vec_concat: Vector Operations. (line 29)
  46489. * VEC_COND_EXPR: Vectors. (line 6)
  46490. * vec_duplicate: Vector Operations. (line 34)
  46491. * vec_duplicateM instruction pattern: Standard Names. (line 298)
  46492. * VEC_DUPLICATE_EXPR: Vectors. (line 6)
  46493. * vec_extractMN instruction pattern: Standard Names. (line 282)
  46494. * vec_initMN instruction pattern: Standard Names. (line 291)
  46495. * vec_load_lanesMN instruction pattern: Standard Names. (line 165)
  46496. * VEC_LSHIFT_EXPR: Vectors. (line 6)
  46497. * vec_mask_load_lanesMN instruction pattern: Standard Names. (line 189)
  46498. * vec_mask_store_lanesMN instruction pattern: Standard Names.
  46499. (line 219)
  46500. * vec_merge: Vector Operations. (line 11)
  46501. * vec_packs_float_M instruction pattern: Standard Names. (line 670)
  46502. * vec_packu_float_M instruction pattern: Standard Names. (line 670)
  46503. * VEC_PACK_FIX_TRUNC_EXPR: Vectors. (line 6)
  46504. * VEC_PACK_FLOAT_EXPR: Vectors. (line 6)
  46505. * VEC_PACK_SAT_EXPR: Vectors. (line 6)
  46506. * vec_pack_sbool_trunc_M instruction pattern: Standard Names.
  46507. (line 647)
  46508. * vec_pack_sfix_trunc_M instruction pattern: Standard Names. (line 663)
  46509. * vec_pack_ssat_M instruction pattern: Standard Names. (line 656)
  46510. * VEC_PACK_TRUNC_EXPR: Vectors. (line 6)
  46511. * vec_pack_trunc_M instruction pattern: Standard Names. (line 640)
  46512. * vec_pack_ufix_trunc_M instruction pattern: Standard Names. (line 663)
  46513. * vec_pack_usat_M instruction pattern: Standard Names. (line 656)
  46514. * vec_permM instruction pattern: Standard Names. (line 410)
  46515. * vec_permM instruction pattern <1>: Addressing Modes. (line 330)
  46516. * VEC_RSHIFT_EXPR: Vectors. (line 6)
  46517. * vec_select: Vector Operations. (line 19)
  46518. * vec_series: Vector Operations. (line 41)
  46519. * vec_seriesM instruction pattern: Standard Names. (line 308)
  46520. * VEC_SERIES_EXPR: Vectors. (line 6)
  46521. * vec_setM instruction pattern: Standard Names. (line 277)
  46522. * vec_shl_insert_M instruction pattern: Standard Names. (line 621)
  46523. * vec_shl_M instruction pattern: Standard Names. (line 628)
  46524. * vec_shr_M instruction pattern: Standard Names. (line 634)
  46525. * vec_store_lanesMN instruction pattern: Standard Names. (line 206)
  46526. * vec_unpacks_float_hi_M instruction pattern: Standard Names.
  46527. (line 700)
  46528. * vec_unpacks_float_lo_M instruction pattern: Standard Names.
  46529. (line 700)
  46530. * vec_unpacks_hi_M instruction pattern: Standard Names. (line 677)
  46531. * vec_unpacks_lo_M instruction pattern: Standard Names. (line 677)
  46532. * vec_unpacks_sbool_hi_M instruction pattern: Standard Names.
  46533. (line 691)
  46534. * vec_unpacks_sbool_lo_M instruction pattern: Standard Names.
  46535. (line 691)
  46536. * vec_unpacku_float_hi_M instruction pattern: Standard Names.
  46537. (line 700)
  46538. * vec_unpacku_float_lo_M instruction pattern: Standard Names.
  46539. (line 700)
  46540. * vec_unpacku_hi_M instruction pattern: Standard Names. (line 684)
  46541. * vec_unpacku_lo_M instruction pattern: Standard Names. (line 684)
  46542. * VEC_UNPACK_FIX_TRUNC_HI_EXPR: Vectors. (line 6)
  46543. * VEC_UNPACK_FIX_TRUNC_LO_EXPR: Vectors. (line 6)
  46544. * VEC_UNPACK_FLOAT_HI_EXPR: Vectors. (line 6)
  46545. * VEC_UNPACK_FLOAT_LO_EXPR: Vectors. (line 6)
  46546. * VEC_UNPACK_HI_EXPR: Vectors. (line 6)
  46547. * VEC_UNPACK_LO_EXPR: Vectors. (line 6)
  46548. * vec_unpack_sfix_trunc_hi_M instruction pattern: Standard Names.
  46549. (line 709)
  46550. * vec_unpack_sfix_trunc_lo_M instruction pattern: Standard Names.
  46551. (line 709)
  46552. * vec_unpack_ufix_trunc_hi_M instruction pattern: Standard Names.
  46553. (line 709)
  46554. * vec_unpack_ufix_trunc_lo_M instruction pattern: Standard Names.
  46555. (line 709)
  46556. * VEC_WIDEN_MULT_HI_EXPR: Vectors. (line 6)
  46557. * VEC_WIDEN_MULT_LO_EXPR: Vectors. (line 6)
  46558. * vec_widen_smult_even_M instruction pattern: Standard Names.
  46559. (line 719)
  46560. * vec_widen_smult_hi_M instruction pattern: Standard Names. (line 719)
  46561. * vec_widen_smult_lo_M instruction pattern: Standard Names. (line 719)
  46562. * vec_widen_smult_odd_M instruction pattern: Standard Names. (line 719)
  46563. * vec_widen_sshiftl_hi_M instruction pattern: Standard Names.
  46564. (line 730)
  46565. * vec_widen_sshiftl_lo_M instruction pattern: Standard Names.
  46566. (line 730)
  46567. * vec_widen_umult_even_M instruction pattern: Standard Names.
  46568. (line 719)
  46569. * vec_widen_umult_hi_M instruction pattern: Standard Names. (line 719)
  46570. * vec_widen_umult_lo_M instruction pattern: Standard Names. (line 719)
  46571. * vec_widen_umult_odd_M instruction pattern: Standard Names. (line 719)
  46572. * vec_widen_ushiftl_hi_M instruction pattern: Standard Names.
  46573. (line 730)
  46574. * vec_widen_ushiftl_lo_M instruction pattern: Standard Names.
  46575. (line 730)
  46576. * verify_flow_info: Maintaining the CFG.
  46577. (line 116)
  46578. * virtual operands: SSA Operands. (line 6)
  46579. * VIRTUAL_INCOMING_ARGS_REGNUM: Regs and Memory. (line 59)
  46580. * VIRTUAL_OUTGOING_ARGS_REGNUM: Regs and Memory. (line 87)
  46581. * VIRTUAL_STACK_DYNAMIC_REGNUM: Regs and Memory. (line 78)
  46582. * VIRTUAL_STACK_VARS_REGNUM: Regs and Memory. (line 69)
  46583. * VLIW: Processor pipeline description.
  46584. (line 6)
  46585. * VLIW <1>: Processor pipeline description.
  46586. (line 223)
  46587. * vlshrM3 instruction pattern: Standard Names. (line 844)
  46588. * VMS: Filesystem. (line 37)
  46589. * VMS_DEBUGGING_INFO: VMS Debug. (line 8)
  46590. * VOIDmode: Machine Modes. (line 192)
  46591. * VOID_TYPE: Types. (line 6)
  46592. * volatil: Flags. (line 339)
  46593. * volatil, in insn, call_insn, jump_insn, code_label, jump_table_data, barrier, and note: Flags.
  46594. (line 33)
  46595. * volatil, in label_ref and reg_label: Flags. (line 54)
  46596. * volatil, in mem, asm_operands, and asm_input: Flags. (line 65)
  46597. * volatil, in reg: Flags. (line 106)
  46598. * volatil, in subreg: Flags. (line 184)
  46599. * volatil, in subreg <1>: Flags. (line 194)
  46600. * volatil, in symbol_ref: Flags. (line 220)
  46601. * volatile memory references: Flags. (line 340)
  46602. * volatile, in prefetch: Flags. (line 92)
  46603. * voting between constraint alternatives: Class Preferences. (line 6)
  46604. * vrotlM3 instruction pattern: Standard Names. (line 844)
  46605. * vrotrM3 instruction pattern: Standard Names. (line 844)
  46606. * walk_dominator_tree: SSA. (line 195)
  46607. * walk_gimple_op: Statement and operand traversals.
  46608. (line 30)
  46609. * walk_gimple_seq: Statement and operand traversals.
  46610. (line 47)
  46611. * walk_gimple_stmt: Statement and operand traversals.
  46612. (line 10)
  46613. * WCHAR_TYPE: Type Layout. (line 165)
  46614. * WCHAR_TYPE_SIZE: Type Layout. (line 173)
  46615. * which_alternative: Output Statement. (line 58)
  46616. * WHILE_BODY: Statements for C++. (line 6)
  46617. * WHILE_COND: Statements for C++. (line 6)
  46618. * WHILE_STMT: Statements for C++. (line 6)
  46619. * while_ultMN instruction pattern: Standard Names. (line 320)
  46620. * whopr: LTO. (line 6)
  46621. * widen_ssumM3 instruction pattern: Standard Names. (line 587)
  46622. * widen_usumM3 instruction pattern: Standard Names. (line 588)
  46623. * WIDEST_HARDWARE_FP_SIZE: Type Layout. (line 110)
  46624. * window_save instruction pattern: Standard Names. (line 2092)
  46625. * WINT_TYPE: Type Layout. (line 178)
  46626. * WORDS_BIG_ENDIAN: Storage Layout. (line 28)
  46627. * WORDS_BIG_ENDIAN, effect on subreg: Regs and Memory. (line 225)
  46628. * word_mode: Machine Modes. (line 458)
  46629. * WORD_REGISTER_OPERATIONS: Misc. (line 53)
  46630. * wpa: LTO. (line 6)
  46631. * X in constraint: Simple Constraints. (line 122)
  46632. * x-HOST: Host Fragment. (line 6)
  46633. * XCmode: Machine Modes. (line 199)
  46634. * XCOFF_DEBUGGING_INFO: DBX Options. (line 12)
  46635. * XEXP: Accessors. (line 6)
  46636. * XFmode: Machine Modes. (line 82)
  46637. * XImode: Machine Modes. (line 54)
  46638. * XINT: Accessors. (line 6)
  46639. * xm-MACHINE.h: Filesystem. (line 6)
  46640. * xm-MACHINE.h <1>: Host Misc. (line 6)
  46641. * xor: Arithmetic. (line 168)
  46642. * xor, canonicalization of: Insn Canonicalizations.
  46643. (line 94)
  46644. * xorM3 instruction pattern: Standard Names. (line 442)
  46645. * xorsignM3 instruction pattern: Standard Names. (line 1149)
  46646. * XSTR: Accessors. (line 6)
  46647. * XVEC: Accessors. (line 38)
  46648. * XVECEXP: Accessors. (line 45)
  46649. * XVECLEN: Accessors. (line 41)
  46650. * XWINT: Accessors. (line 6)
  46651. * zero_extend: Conversions. (line 28)
  46652. * zero_extendMN2 instruction pattern: Standard Names. (line 1452)
  46653. * zero_extract: Bit-Fields. (line 30)
  46654. * zero_extract, canonicalization of: Insn Canonicalizations.
  46655. (line 103)
  46656. 
  46657. Tag Table:
  46658. Node: Top1789
  46659. Node: Contributing5203
  46660. Node: Portability5933
  46661. Node: Interface7721
  46662. Node: Libgcc10762
  46663. Node: Integer library routines12589
  46664. Node: Soft float library routines19557
  46665. Node: Decimal float library routines31495
  46666. Node: Fixed-point fractional library routines47253
  46667. Node: Exception handling routines147649
  46668. Node: Miscellaneous routines148756
  46669. Node: Languages150876
  46670. Node: Source Tree152423
  46671. Node: Configure Terms153005
  46672. Node: Top Level155961
  46673. Node: gcc Directory159546
  46674. Node: Subdirectories160498
  46675. Node: Configuration162666
  46676. Node: Config Fragments163386
  46677. Node: System Config164611
  46678. Node: Configuration Files165547
  46679. Node: Build168163
  46680. Node: Makefile168575
  46681. Ref: Makefile-Footnote-1175350
  46682. Ref: Makefile-Footnote-2175497
  46683. Node: Library Files175571
  46684. Node: Headers176133
  46685. Node: Documentation178216
  46686. Node: Texinfo Manuals179075
  46687. Node: Man Page Generation181404
  46688. Node: Miscellaneous Docs183317
  46689. Node: Front End184704
  46690. Node: Front End Directory188383
  46691. Node: Front End Config189699
  46692. Node: Front End Makefile192535
  46693. Node: Back End196303
  46694. Node: Testsuites201189
  46695. Node: Test Idioms202178
  46696. Node: Test Directives205576
  46697. Node: Directives206103
  46698. Node: Selectors217476
  46699. Node: Effective-Target Keywords218832
  46700. Ref: arm_fp_ok230783
  46701. Ref: arm_fp_dp_ok230950
  46702. Ref: arm_neon_ok232062
  46703. Ref: arm_neon_ok_no_float_abi232231
  46704. Ref: arm_neonv2_ok232398
  46705. Ref: arm_fp16_ok232565
  46706. Ref: arm_neon_fp16_ok232907
  46707. Ref: arm_vfp3_ok233839
  46708. Ref: arm_arch_v8a_hard_ok233982
  46709. Ref: arm_v8_1a_neon_ok234732
  46710. Ref: arm_v8_2a_fp16_scalar_ok235160
  46711. Ref: arm_v8_2a_fp16_neon_ok235611
  46712. Ref: arm_v8_2a_dotprod_neon_ok236086
  46713. Ref: arm_fp16fml_neon_ok236506
  46714. Ref: arm_coproc1_ok239006
  46715. Ref: arm_coproc2_ok239132
  46716. Ref: arm_coproc3_ok239360
  46717. Ref: arm_simd32_ok239727
  46718. Ref: arm_qbit_ok239905
  46719. Ref: arm_softfp_ok240097
  46720. Ref: arm_hard_ok240170
  46721. Ref: stack_size_et252078
  46722. Node: Add Options254471
  46723. Ref: arm_fp16_ieee255709
  46724. Ref: arm_fp16_alternative255964
  46725. Ref: stack_size_ao258359
  46726. Node: Require Support258721
  46727. Node: Final Actions261623
  46728. Node: Ada Tests270463
  46729. Node: C Tests271626
  46730. Node: LTO Testing275998
  46731. Node: gcov Testing277641
  46732. Node: profopt Testing280611
  46733. Node: compat Testing282326
  46734. Node: Torture Tests286566
  46735. Node: GIMPLE Tests288200
  46736. Node: RTL Tests289442
  46737. Node: Options290748
  46738. Node: Option file format291189
  46739. Node: Option properties298178
  46740. Node: Passes314341
  46741. Node: Parsing pass315214
  46742. Node: Gimplification pass318742
  46743. Node: Pass manager320575
  46744. Node: IPA passes322416
  46745. Node: Small IPA passes323309
  46746. Node: Regular IPA passes326746
  46747. Node: Late IPA passes331808
  46748. Node: Tree SSA passes332767
  46749. Node: RTL passes354307
  46750. Node: Optimization info366571
  46751. Node: Dump setup367390
  46752. Node: Optimization groups368519
  46753. Node: Dump files and streams369498
  46754. Node: Dump output verbosity370696
  46755. Node: Dump types371752
  46756. Node: Dump examples374094
  46757. Node: poly_int375575
  46758. Node: Overview of poly_int377055
  46759. Node: Consequences of using poly_int379659
  46760. Node: Comparisons involving poly_int381294
  46761. Node: Comparison functions for poly_int382932
  46762. Node: Properties of the poly_int comparisons384139
  46763. Node: Comparing potentially-unordered poly_ints386581
  46764. Node: Comparing ordered poly_ints387492
  46765. Node: Checking for a poly_int marker value389516
  46766. Node: Range checks on poly_ints390365
  46767. Node: Sorting poly_ints393019
  46768. Node: Arithmetic on poly_ints393792
  46769. Node: Using poly_int with C++ arithmetic operators394593
  46770. Node: wi arithmetic on poly_ints396124
  46771. Node: Division of poly_ints396976
  46772. Node: Other poly_int arithmetic398483
  46773. Node: Alignment of poly_ints399889
  46774. Node: Computing bounds on poly_ints403166
  46775. Node: Converting poly_ints404555
  46776. Node: Miscellaneous poly_int routines408102
  46777. Node: Guidelines for using poly_int408742
  46778. Node: GENERIC413674
  46779. Node: Deficiencies415496
  46780. Node: Tree overview415737
  46781. Node: Macros and Functions419861
  46782. Node: Identifiers420686
  46783. Node: Containers422295
  46784. Node: Types423452
  46785. Node: Declarations435526
  46786. Node: Working with declarations436021
  46787. Node: Internal structure441625
  46788. Node: Current structure hierarchy442009
  46789. Node: Adding new DECL node types444102
  46790. Node: Attributes448386
  46791. Node: Expression trees449630
  46792. Node: Constant expressions451384
  46793. Node: Storage References457476
  46794. Node: Unary and Binary Expressions460995
  46795. Node: Vectors481897
  46796. Node: Statements488801
  46797. Node: Basic Statements489333
  46798. Node: Blocks493960
  46799. Node: Statement Sequences495661
  46800. Node: Empty Statements495994
  46801. Node: Jumps496568
  46802. Node: Cleanups497221
  46803. Node: OpenMP499262
  46804. Node: OpenACC505107
  46805. Node: Functions506224
  46806. Node: Function Basics506695
  46807. Node: Function Properties510379
  46808. Node: Language-dependent trees513160
  46809. Node: C and C++ Trees514047
  46810. Node: Types for C++516932
  46811. Node: Namespaces521902
  46812. Node: Classes525008
  46813. Node: Functions for C++529916
  46814. Node: Statements for C++536167
  46815. Node: C++ Expressions544220
  46816. Node: GIMPLE545725
  46817. Node: Tuple representation549390
  46818. Node: Class hierarchy of GIMPLE statements556350
  46819. Node: GIMPLE instruction set561338
  46820. Node: GIMPLE Exception Handling562970
  46821. Node: Temporaries564882
  46822. Ref: Temporaries-Footnote-1566200
  46823. Node: Operands566265
  46824. Node: Compound Expressions567026
  46825. Node: Compound Lvalues567260
  46826. Node: Conditional Expressions568022
  46827. Node: Logical Operators568681
  46828. Node: Manipulating GIMPLE statements576028
  46829. Node: Tuple specific accessors581964
  46830. Node: GIMPLE_ASM582743
  46831. Node: GIMPLE_ASSIGN585126
  46832. Node: GIMPLE_BIND589830
  46833. Node: GIMPLE_CALL591644
  46834. Node: GIMPLE_CATCH595787
  46835. Node: GIMPLE_COND596937
  46836. Node: GIMPLE_DEBUG599732
  46837. Node: GIMPLE_EH_FILTER604330
  46838. Node: GIMPLE_LABEL605893
  46839. Node: GIMPLE_GOTO606506
  46840. Node: GIMPLE_NOP607029
  46841. Node: GIMPLE_OMP_ATOMIC_LOAD607391
  46842. Node: GIMPLE_OMP_ATOMIC_STORE608387
  46843. Node: GIMPLE_OMP_CONTINUE609086
  46844. Node: GIMPLE_OMP_CRITICAL610565
  46845. Node: GIMPLE_OMP_FOR611559
  46846. Node: GIMPLE_OMP_MASTER614975
  46847. Node: GIMPLE_OMP_ORDERED615353
  46848. Node: GIMPLE_OMP_PARALLEL615747
  46849. Node: GIMPLE_OMP_RETURN618516
  46850. Node: GIMPLE_OMP_SECTION619161
  46851. Node: GIMPLE_OMP_SECTIONS619821
  46852. Node: GIMPLE_OMP_SINGLE621431
  46853. Node: GIMPLE_PHI622377
  46854. Node: GIMPLE_RESX623656
  46855. Node: GIMPLE_RETURN624375
  46856. Node: GIMPLE_SWITCH624949
  46857. Node: GIMPLE_TRY626824
  46858. Node: GIMPLE_WITH_CLEANUP_EXPR628596
  46859. Node: GIMPLE sequences629475
  46860. Node: Sequence iterators632681
  46861. Node: Adding a new GIMPLE statement code641138
  46862. Node: Statement and operand traversals642483
  46863. Node: Tree SSA645075
  46864. Node: Annotations646863
  46865. Node: SSA Operands647268
  46866. Node: SSA661347
  46867. Node: Alias analysis671053
  46868. Node: Memory model674827
  46869. Node: RTL676186
  46870. Node: RTL Objects678374
  46871. Node: RTL Classes682258
  46872. Node: Accessors687557
  46873. Node: Special Accessors689730
  46874. Node: Flags695517
  46875. Node: Machine Modes710780
  46876. Node: Constants728186
  46877. Node: Regs and Memory739575
  46878. Node: Arithmetic758827
  46879. Node: Comparisons769002
  46880. Node: Bit-Fields773294
  46881. Node: Vector Operations774845
  46882. Node: Conversions776949
  46883. Node: RTL Declarations781447
  46884. Node: Side Effects782291
  46885. Node: Incdec799300
  46886. Node: Assembler802636
  46887. Node: Debug Information804181
  46888. Node: Insns806108
  46889. Node: Calls833964
  46890. Node: Sharing836557
  46891. Node: Reading RTL839752
  46892. Node: Control Flow840743
  46893. Node: Basic Blocks842511
  46894. Node: Edges847965
  46895. Node: Profile information856584
  46896. Node: Maintaining the CFG861268
  46897. Node: Liveness information867036
  46898. Node: Loop Analysis and Representation869162
  46899. Node: Loop representation870198
  46900. Node: Loop querying877564
  46901. Node: Loop manipulation880385
  46902. Node: LCSSA882721
  46903. Node: Scalar evolutions884790
  46904. Node: loop-iv888034
  46905. Node: Number of iterations889956
  46906. Node: Dependency analysis894037
  46907. Node: Machine Desc900388
  46908. Node: Overview902951
  46909. Node: Patterns904991
  46910. Node: Example909958
  46911. Node: RTL Template911419
  46912. Node: Output Template922075
  46913. Node: Output Statement926256
  46914. Node: Predicates930595
  46915. Node: Machine-Independent Predicates933513
  46916. Node: Defining Predicates938457
  46917. Node: Constraints944420
  46918. Node: Simple Constraints945889
  46919. Node: Multi-Alternative958729
  46920. Node: Class Preferences961938
  46921. Node: Modifiers962830
  46922. Node: Machine Constraints967563
  46923. Node: Disable Insn Alternatives1029667
  46924. Node: Define Constraints1033159
  46925. Node: C Constraint Interface1040553
  46926. Node: Standard Names1043680
  46927. Ref: shift patterns1079924
  46928. Ref: prologue instruction pattern1134704
  46929. Ref: window_save instruction pattern1135197
  46930. Ref: epilogue instruction pattern1135474
  46931. Node: Pattern Ordering1157450
  46932. Node: Dependent Patterns1158686
  46933. Node: Jump Patterns1160306
  46934. Ref: Jump Patterns-Footnote-11162451
  46935. Node: Looping Patterns1162499
  46936. Node: Insn Canonicalizations1168138
  46937. Node: Expander Definitions1173345
  46938. Node: Insn Splitting1181559
  46939. Node: Including Patterns1196589
  46940. Node: Peephole Definitions1198373
  46941. Node: define_peephole1199626
  46942. Node: define_peephole21205956
  46943. Node: Insn Attributes1210045
  46944. Node: Defining Attributes1211227
  46945. Ref: define_enum_attr1214719
  46946. Node: Expressions1215755
  46947. Node: Tagging Insns1222505
  46948. Node: Attr Example1226858
  46949. Node: Insn Lengths1229231
  46950. Node: Constant Attributes1232639
  46951. Node: Mnemonic Attribute1233815
  46952. Node: Delay Slots1235334
  46953. Node: Processor pipeline description1238557
  46954. Ref: Processor pipeline description-Footnote-11257369
  46955. Node: Conditional Execution1257693
  46956. Node: Define Subst1261176
  46957. Node: Define Subst Example1263211
  46958. Node: Define Subst Pattern Matching1266206
  46959. Node: Define Subst Output Template1267432
  46960. Node: Constant Definitions1269755
  46961. Ref: define_enum1273537
  46962. Node: Iterators1274025
  46963. Node: Mode Iterators1274670
  46964. Node: Defining Mode Iterators1275648
  46965. Node: Substitutions1277142
  46966. Node: Examples1279384
  46967. Node: Code Iterators1280832
  46968. Node: Int Iterators1283962
  46969. Node: Subst Iterators1286408
  46970. Node: Parameterized Names1288128
  46971. Node: Target Macros1292146
  46972. Node: Target Structure1295209
  46973. Node: Driver1297701
  46974. Node: Run-time Target1316671
  46975. Node: Per-Function Data1326204
  46976. Node: Storage Layout1328968
  46977. Node: Type Layout1356467
  46978. Node: Registers1369808
  46979. Node: Register Basics1370782
  46980. Node: Allocation Order1378344
  46981. Node: Values in Registers1380828
  46982. Node: Leaf Functions1388304
  46983. Node: Stack Registers1391163
  46984. Node: Register Classes1392435
  46985. Node: Stack and Calling1427217
  46986. Node: Frame Layout1427823
  46987. Node: Exception Handling1439658
  46988. Node: Stack Checking1445868
  46989. Node: Frame Registers1451493
  46990. Node: Elimination1460044
  46991. Node: Stack Arguments1463900
  46992. Node: Register Arguments1471096
  46993. Node: Scalar Return1495957
  46994. Node: Aggregate Return1502413
  46995. Node: Caller Saves1506967
  46996. Node: Function Entry1507709
  46997. Node: Profiling1519261
  46998. Node: Tail Calls1521371
  46999. Node: Shrink-wrapping separate components1523281
  47000. Node: Stack Smashing Protection1526322
  47001. Node: Miscellaneous Register Hooks1528811
  47002. Node: Varargs1529676
  47003. Node: Trampolines1539076
  47004. Node: Library Calls1547899
  47005. Node: Addressing Modes1552789
  47006. Node: Anchored Addresses1581796
  47007. Node: Condition Code1584439
  47008. Node: CC0 Condition Codes1586766
  47009. Node: MODE_CC Condition Codes1590012
  47010. Node: Costs1596838
  47011. Node: Scheduling1618209
  47012. Node: Sections1642131
  47013. Node: PIC1658350
  47014. Node: Assembler Format1660409
  47015. Node: File Framework1661547
  47016. Ref: TARGET_HAVE_SWITCHABLE_BSS_SECTIONS1669146
  47017. Node: Data Output1672416
  47018. Node: Uninitialized Data1680704
  47019. Node: Label Output1685718
  47020. Node: Initialization1710329
  47021. Node: Macros for Initialization1716290
  47022. Node: Instruction Output1723009
  47023. Node: Dispatch Tables1733638
  47024. Node: Exception Region Output1738467
  47025. Node: Alignment Output1745549
  47026. Node: Debugging Info1749236
  47027. Node: All Debuggers1749890
  47028. Node: DBX Options1752662
  47029. Node: DBX Hooks1758100
  47030. Node: File Names and DBX1759409
  47031. Node: DWARF1761513
  47032. Node: VMS Debug1767328
  47033. Node: Floating Point1767907
  47034. Node: Mode Switching1770662
  47035. Node: Target Attributes1775099
  47036. Node: Emulated TLS1784515
  47037. Node: MIPS Coprocessors1787905
  47038. Node: PCH Target1789064
  47039. Node: C++ ABI1790906
  47040. Node: D Language and ABI1795698
  47041. Node: Named Address Spaces1796743
  47042. Node: Misc1802670
  47043. Ref: TARGET_SHIFT_TRUNCATION_MASK1810541
  47044. Node: Host Config1865875
  47045. Node: Host Common1866944
  47046. Node: Filesystem1869318
  47047. Node: Host Misc1873433
  47048. Node: Fragments1875882
  47049. Node: Target Fragment1877077
  47050. Node: Host Fragment1887889
  47051. Node: Collect21888129
  47052. Node: Header Dirs1890765
  47053. Node: Type Information1892188
  47054. Node: GTY Options1895464
  47055. Node: Inheritance and GTY1906722
  47056. Ref: Inheritance and GTY-Footnote-11908287
  47057. Node: User GC1908557
  47058. Node: GGC Roots1912296
  47059. Node: Files1913009
  47060. Node: Invoking the garbage collector1915716
  47061. Node: Troubleshooting1917221
  47062. Node: Plugins1918296
  47063. Node: Plugins loading1919425
  47064. Node: Plugin API1920524
  47065. Node: Plugins pass1928250
  47066. Node: Plugins GC1930221
  47067. Node: Plugins description1931938
  47068. Node: Plugins attr1932474
  47069. Node: Plugins recording1934754
  47070. Node: Plugins gate1935604
  47071. Node: Plugins tracking1936195
  47072. Node: Plugins building1936783
  47073. Node: LTO1940284
  47074. Node: LTO Overview1941156
  47075. Node: LTO object file layout1946983
  47076. Node: IPA1951613
  47077. Node: WHOPR1960663
  47078. Node: Internal flags1965223
  47079. Node: Match and Simplify1966634
  47080. Node: GIMPLE API1967596
  47081. Node: The Language1970391
  47082. Node: Static Analyzer1982366
  47083. Node: Analyzer Internals1982631
  47084. Node: Debugging the Analyzer1998275
  47085. Node: User Experience Guidelines2000886
  47086. Node: Guidelines for Diagnostics2001822
  47087. Ref: input_location_example2008883
  47088. Node: Guidelines for Options2018566
  47089. Node: Funding2018743
  47090. Node: GNU Project2021250
  47091. Node: Copying2021899
  47092. Node: GNU Free Documentation License2059410
  47093. Node: Contributors2084531
  47094. Node: Option Index2125507
  47095. Node: Concept Index2126384
  47096. 
  47097. End Tag Table