Lines Matching full:them
60 to port them to new targets and some information about how to write
166 affect only the target machines that need them.
187 Structures and unions of other sizes are returned by storing them into
246 that needs them.
1543 necessary to make them
1546 installed by GCC; these are not documented here. (FIXME: document them
1771 support for them, in `gcc/doc/standards.texi'. This may be a link
2031 generated by `configure' substituting values in them. This
2706 lines that report them.
3143 definitions immediately or queue them for later processing.
3289 of the edges that connect them. It is located in `tree-cfg.c' and
3347 variables that are used once into the expression that uses them and
3363 conditional expressions and rewrites them into straight line code.
3400 passes to do a significantly better job with them. The pass is
3481 iterations into a vector and operate on them in parallel.
3648 This pass removes loops with no code in them. The pass is located
3666 that operate on them, like redundancy elimination and
3704 which patterns correspond to them.
3836 eliminated, either by allocating them to a hard register, replacing
3837 them by an equivalent expression (e.g. a constant) or by placing
3838 them on the stack. This is done in several subpasses:
3870 `reload.h' used for communication between them.
4253 another; i.e., there is no difference between them at the source
4259 be used to access them. Although other kinds of types are used
4366 of the fields in the type or whether one or more of them overlap.
4964 are actually polymorphic; you can use them to work with `FUNCTION_DECL'
5062 translation units which require them, and then relies on the
5208 obtain information about them. There are a few macros that can be used
5222 access them. This documentation describes the use of these nodes in
6323 converting them to GIMPLE and doesn't expect them to work with any
6381 main gimplifier lower them the rest of the way; this is often simpler.
6390 `_STMT' nodes and how to convert them to GENERIC forms. There was some
6592 implicit scopes associated with them. On the other hand, although the
7093 in tree dumps right before the statement that contains them. To
7120 about them.
7324 the uses, but not setting them.
7388 bring them up to date. This must be done before the optimization is
8032 There are other fields in the loop structures, many of them used only
8115 While some of them are written so that they should work on non-innermost
8132 copy of a loop, and a branch before them that selects one of them
8154 outside of them. Only the real operands (not virtual SSA names) are
8221 contain several special tree nodes. One of them is `SCEV_NOT_KNOWN',
8335 others - some of them return only the expression for the number of
8586 them. Vectors of length zero are not created; null pointers are used
8833 elements as well as to access them.
8841 Some RTL nodes have special annotations associated with them.
9327 them. The letters `mode' which appear at the end of each machine mode
9542 modes. For them, the unit size is the size of the real or
9626 them to the precise bit pattern used by the target machine, use
9662 references is so that jump optimization can distinguish them.
9702 pseudo registers, and later convert them into hard registers or
9830 integer values. This works because they handle them solely as a
10200 `note' insns may separate them.
10563 altered, lest it attempt to keep data in them across the string
10714 insert them in the chain of insns. When actually inserted, the
10831 Instruction patterns may not use them. Until the `flow' pass of the
10849 allow them wherever a memory address is called for. Describing them as
11041 the front-end code that creates them, is the function
11048 flow past them. They are placed after unconditional jump
11071 compiler delete insns by altering them into notes of this
11334 them how to think of that value. `REG_EQUIV' notes are used by
11667 table jump instructions referencing them. After removing the
11712 structure and several methods are available to operate on them:
12008 when modifying instructions, so there rarely is a need to move them
12102 flow graph and insert instructions on them. In the RTL representation,
12165 safe, as functions to implement them already know how to update
12446 `match_scratch', the combiner can add or delete them when
12647 text for the instructions, with `\;' between them.
12713 which require doublequote characters to delimit them. To include these
12734 output or compute more of them, using the subroutine `output_asm_insn'.
12748 could use `which_alternative' to choose between them:
12795 fix them up (*note Constraints::). However, GCC will usually generate
13232 of them an input-output operand:
13359 does not permit them, it can make the compiler crash. When this
14945 memory operands: that is, `reload' can make them match by
15025 mangling scheme for referring to them from C. Constraint names that do
15235 loading consecutive registers from memory is to do them one at a
16533 to handle these machines is to treat them just like the others until
16553 code. A similar technique works for them. When it is time to "output"
16601 the SPARC), define them in `MACHINE-modes.def' (*note Condition
16833 represent them. For these target machines, you can write a
16892 compute the values and store them into the appropriate elements of
16893 `operands' so that `match_dup' can find them.
16896 statements: `DONE' and `FAIL'. Use them with a following semicolon, as
17288 data flow in the program does not suggest that it should try them. For
17389 an opportunity to match them. The peephole optimizer definition itself
18348 `presence_set'. The difference between them is when checking is done.
18415 of them may be rejected by reservations in the subsequent insns.
19007 subcommands. It applies them in the order given, so each spec can
19875 them.
20305 them with spaces, and write first any length keyword, then
20537 them.)
20575 to use them (from most preferred to least).
20665 registers, because the allocation mechanism considers them to be
20695 floating registers normalize any value stored in them, because
20873 them in operand constraints.
20879 which includes both of them. Otherwise you will get suboptimal code.
21027 sum of two registers, neither one of them scaled, then either one
21324 into floating-point registers on the Alpha extends them to 64 bits.
22098 them.
22247 pops no arguments and the caller must therefore pop them all after
22279 that take a fixed number of arguments pop them but other functions
22457 never both of them at once.
23040 your operating system environment, not by GCC. To figure them out,
23145 memory so that the varargs mechanism can access them. Both ISO
23159 starts to use them for its own purposes.
23304 may be necessary to take out pieces of the address and store them
23371 make all trampolines identical, by having them jump to a standard
23589 and an integer are stored inside a `const' RTX to mark them as
23598 them will be given to `PRINT_OPERAND_ADDRESS'.
23715 them back into their original form.
24250 them: try the first ones in this list first.
24271 others, so that fewer insns can follow them in the same cycle.
24288 acceptable, you could use the hook to modify them too. See also
24456 between them is considered costly by the target, and `false'
24557 `FOO_SECTION_ASM_OP' macros, and expect them to be string literals.
24571 target does not provide them.
25160 The array element values are designed so that you can print them
26772 you need not define them yourself.
27103 Coprocessor registers are assumed to be epilogue-used; sets to them
27341 by the same divisor, by turning them into multiplications by the
28211 `system.h' will automatically give them appropriate values on Unix
28534 a new temporary `.c' file containing a table of them, compiles it, and
28838 them in a hash table. If garbage collection marks the hash table,
28840 reference to them goes away. GGC has special handling to deal
28991 it from them. So when you compare distributors, judge them partly by
29013 contribute little, since someone else would surely do them; difficult
29084 source code. And you must show them these terms so they know their
29167 apply to those sections when you distribute them as separate
29346 to attach them to the start of each source file to most effectively
29464 regarding them.
29581 copies, to give them a chance to provide you with an updated
29699 unmodified, and list them all as Invariant Sections of your
29840 them the project would not have been nearly as successful as it has
