| /openbsd-src/gnu/gcc/gcc/config/pa/ |
| H A D | elf.h | 81 #define ASM_OUTPUT_EXTERNAL_LIBCALL(FILE, RTL) \ argument 83 if (!function_label_operand (RTL, VOIDmode)) \ 84 hppa_encode_label (RTL); \ 85 assemble_name (FILE, XSTR ((RTL), 0)); \
|
| H A D | som.h | 228 #define ASM_OUTPUT_EXTERNAL_LIBCALL(FILE, RTL) \ argument 232 if (!function_label_operand (RTL, VOIDmode)) \ 233 hppa_encode_label (RTL); \ 235 name = targetm.strip_name_encoding (XSTR ((RTL), 0)); \ 240 assemble_name_raw (FILE, XSTR ((RTL), 0)); \
|
| /openbsd-src/gnu/usr.bin/gcc/gcc/config/pa/ |
| H A D | elf.h | 93 #define ASM_OUTPUT_EXTERNAL_LIBCALL(FILE, RTL) \ argument 95 if (!function_label_operand (RTL, VOIDmode)) \ 96 hppa_encode_label (RTL); \ 97 assemble_name (FILE, XSTR ((RTL), 0)); \
|
| H A D | som.h | 329 #define ASM_OUTPUT_EXTERNAL_LIBCALL(FILE, RTL) \ argument 333 if (!function_label_operand (RTL, VOIDmode)) \ 334 hppa_encode_label (RTL); \ 336 name = (*targetm.strip_name_encoding) (XSTR ((RTL), 0)); \ 341 assemble_name (FILE, XSTR ((RTL), 0)); \
|
| /openbsd-src/gnu/usr.bin/gcc/gcc/doc/ |
| H A D | passes.texi | 20 one function at a time. This tree code is then transformed into RTL 22 the trees into RTL are @file{expr.c}, @file{expmed.c}, and 128 representation, before converting into RTL code. 145 @cindex RTL generation 147 RTL generation. This is the conversion of syntax tree into RTL code. 153 instruction patterns is to provide this information to the RTL 163 The source files for RTL generation include 201 The option @option{-dr} causes a debugging dump of the RTL code after 217 The option @option{-di} causes a debugging dump of the RTL code after 235 immediately following RTL generation. The second time is after CSE, [all …]
|
| H A D | rtl.texi | 6 @node RTL 7 @chapter RTL Representation 8 @cindex RTL representation 9 @cindex representation of RTL 10 @cindex Register Transfer Language (RTL) 17 RTL is inspired by Lisp lists. It has both an internal form, made up of 23 * RTL Objects:: Expressions vs vectors vs strings vs integers. 24 * RTL Classes:: Categories of RTL expression objects, and their structure. 26 * Flags:: Other flags in an RTL expression. 35 * RTL Declarations:: Declaring volatility, constancy, etc. [all …]
|
| H A D | md.texi | 26 * RTL Template:: The RTL template defines what insns match a pattern. 38 * Expander Definitions::Generating a sequence of several RTL insns 61 The parse tree is used to generate an RTL insn list based on named 65 The insn list is matched against the RTL templates to produce assembler 73 to the documentation later in this chapter, without regard for the RTL 93 Finally, the insn list's RTL is matched up with the RTL templates in the 104 Each instruction pattern contains an incomplete RTL expression, with pieces 109 A @code{define_insn} is an RTL expression containing four or five operands: 114 pattern can perform a certain standard job for the RTL-generation 121 used for generating RTL code, but they may permit several simpler insns [all …]
|
| H A D | portability.texi | 31 and the availability of autoincrement addressing. In the RTL-generation
|
| /openbsd-src/gnu/gcc/gcc/doc/ |
| H A D | rtl.texi | 7 @node RTL 8 @chapter RTL Representation 9 @cindex RTL representation 10 @cindex representation of RTL 11 @cindex Register Transfer Language (RTL) 18 RTL is inspired by Lisp lists. It has both an internal form, made up of 24 * RTL Objects:: Expressions vs vectors vs strings vs integers. 25 * RTL Classes:: Categories of RTL expression objects, and their structure. 27 * Special Accessors:: Macros to access specific annotations on RTL. 28 * Flags:: Other flags in an RTL expression. [all …]
|
| H A D | cfg.texi | 16 intermediate code representation (the RTL or @code{tree} instruction 77 and RTL), there are pointers to the head and end of a basic block for 81 For RTL, these pointers are @code{rtx head, end}. In the RTL function 84 In the RTL representation of a function, the instruction stream 228 RTL also for table jumps. They are the easiest to manipulate as they 259 In the RTL representation, the destination of an exception edge is 265 In the RTL representation, the predicate @code{may_trap_p} may be used 278 These edges only exist in the RTL representation. 346 this moment. In RTL, alternate entry points are specified by 358 reload, optimal RTL epilogues are used that use explicit (conditional) [all …]
|
| H A D | loop.texi | 16 RTL, as well as the interfaces to loop-related analyses (induction 25 * loop-iv:: Induction variables on RTL. 170 number of insns in the loop, on GIMPLE and on RTL. 203 specified RTL code on it. On GIMPLE, the function can still be used, 226 @code{tree_duplicate_loop_to_header_edge}: These functions (on RTL and 351 @section IV analysis on RTL 352 @cindex IV analysis on RTL 354 The induction variable on RTL is simple and only allows analysis of 402 Both on GIMPLE and on RTL, there are functions available to determine 414 @item @code{noloop_assumptions} on RTL, @code{may_be_zero} on GIMPLE: If [all …]
|
| H A D | md.texi | 26 * RTL Template:: The RTL template defines what insns match a pattern. 40 * Expander Definitions::Generating a sequence of several RTL insns 64 The parse tree is used to generate an RTL insn list based on named 68 The insn list is matched against the RTL templates to produce assembler 76 to the documentation later in this chapter, without regard for the RTL 96 Finally, the insn list's RTL is matched up with the RTL templates in the 107 Each instruction pattern contains an incomplete RTL expression, with pieces 112 A @code{define_insn} is an RTL expression containing four or five operands: 117 pattern can perform a certain standard job for the RTL-generation 124 used for generating RTL code, but they may permit several simpler insns [all …]
|
| H A D | gccint.info | 89 * RTL:: The intermediate representation that most passes work on. 158 RTL-generation pass, it is often necessary to have multiple strategies 2391 Removes RTL dump files generated for this test. 3074 * RTL passes:: Optimizations on a low-level representation. 3211 File: gccint.info, Node: Tree-SSA passes, Next: RTL passes, Prev: Pass manager, Up: Passes 3563 requires target support, and so is delayed until RTL. In the 3566 `pass_tail_calls'. The RTL transformation is handled by 3684 File: gccint.info, Node: RTL passes, Prev: Tree-SSA passes, Up: Passes 3686 8.5 RTL passes 3692 * RTL generation [all …]
|
| /openbsd-src/gnu/llvm/llvm/docs/HistoricalNotes/ |
| H A D | 2001-06-01-GCCOptimizations.txt | 12 The rundown is that after RTL generation, the following happens: 44 Even if we choose to do LLVM code emission from RTL, we will almost 51 I'm continuing to look at the Tree -> RTL code. It is pretty gross 57 Anyways, I'm proceeding with the RTL -> LLVM conversion phase for now. We
|
| /openbsd-src/gnu/llvm/compiler-rt/lib/asan/ |
| H A D | asan_malloc_win.cpp | 283 enum AllocationOwnership { NEITHER = 0, ASAN = 1, RTL = 2 }; in SharedReAlloc() enumerator 294 ownershipState = RTL; in SharedReAlloc() 306 if (ownershipState == RTL || in SharedReAlloc() 329 CHECK(ownershipState == RTL || ownershipState == NEITHER); in SharedReAlloc()
|
| /openbsd-src/regress/lib/libcrypto/x509/bettertls/certificates/ |
| H A D | 3025.crt | 19 3CQHknP7CJNheOHs+lLtu/KXWuXHdeH8MY14jkONF9O74NTA+RTL/DlWTkUouooP
|
| /openbsd-src/gnu/usr.bin/gcc/gcc/ |
| H A D | params.def | 113 /* For languages that (still) use the RTL inliner, we can specify 114 limits for the RTL inliner separately. 115 The parameter here defines the maximum number of RTL instructions 116 a function may have to be eligible for inlining in the RTL inliner. 120 "The maximum number of instructions for the RTL inliner",
|
| H A D | machmode.def | 28 Each RTL expression has a machine mode. 39 external ASCII format used for reading and printing RTL and trees. 73 as for example on CONST_INT RTL expressions. */
|
| /openbsd-src/gnu/gcc/gcc/config/mips/ |
| H A D | 5400.md | 10 ;; descriptions (also known as reservation RTL) is roughly ordered 11 ;; based on the define attribute RTL for the "type" classification.
|
| H A D | 5500.md | 12 ;; descriptions (also known as reservation RTL) is roughly ordered 13 ;; based on the define attribute RTL for the "type" classification.
|
| /openbsd-src/gnu/usr.bin/gcc/gcc/config/mips/ |
| H A D | 5500.md | 12 ;; descriptions (also known as reservation RTL) is roughly ordered 13 ;; based on the define attribute RTL for the "type" classification.
|
| H A D | 5400.md | 10 ;; descriptions (also known as reservation RTL) is roughly ordered 11 ;; based on the define attribute RTL for the "type" classification.
|
| /openbsd-src/gnu/usr.bin/gcc/gcc/config/mn10200/ |
| H A D | mn10200.md | 387 During RTL generation we call out to library routines. 389 After RTL generation we can not call the library routines as 391 has already been instantiated. So, after RTL generation we just 430 at RTL expansion time. */ 471 /* During RTL generation we call out to library routines. 473 After RTL generation we can not call the library routines as 475 has already been instantiated. So, after RTL generation we just 1477 shift counts we call out to a library call during RTL generation time; 1478 after RTL generation time we allow optabs.c to open code the operation. 1535 shift counts we call out to a library call during RTL generation time; [all …]
|
| /openbsd-src/gnu/gcc/gcc/config/h8300/ |
| H A D | predicates.md | 337 /* Accept any mem during RTL generation. Otherwise, the code that does 339 to avoid reload problems, we only accept 'U' MEM operands after RTL 341 must force its operands to match 'U' before emitting RTL. */
|
| /openbsd-src/gnu/gcc/gcc/ |
| H A D | treestruct.def | 40 DEFTREESTRUCT(TS_DECL_WRTL, "decl with RTL")
|