Searched refs:invariant (Results 26 – 47 of 47) sorted by relevance
12
/dragonfly/contrib/gcc-4.7/libstdc++-v3/include/std/ |
H A D | bitset | 67 * Base class, general case. It is a class invariant that _Nw will be 699 * the high-order bits in the highest word.) It is a class invariant
|
/dragonfly/contrib/gcc-8.0/gcc/ |
H A D | ira-emit.c | 949 || (ira_reg_equiv[regno].invariant == NULL_RTX in emit_move_list()
|
H A D | gimple.def | 272 INITIAL, FINAL and INCR are required to be loop invariant integer
|
H A D | tree-inline.c | 1016 int invariant = is_gimple_min_invariant (*tp); in remap_gimple_op_r() local 1022 if (invariant && !is_gimple_min_invariant (*tp)) in remap_gimple_op_r() 1292 int invariant = is_gimple_min_invariant (*tp); in copy_tree_body_r() local 1309 if (invariant && !is_gimple_min_invariant (*tp)) in copy_tree_body_r()
|
H A D | common.opt | 1901 Move loop invariant computations out of loops. 2587 Enable loop invariant motion on trees.
|
H A D | tree.def | 1143 private. N1, N2 and INCR are required to be loop invariant integer
|
/dragonfly/contrib/gcc-4.7/gcc/doc/ |
H A D | loop.texi | 302 LCSSA, and @code{verify_loop_closed_ssa} to check that the invariant of 368 is a loop-invariant base and step.
|
H A D | gimple.texi | 672 Return true if t is a valid minimal invariant. This is different 679 Return true if t is an interprocedural invariant. This means that t 680 is a valid invariant in all functions (e.g. it can be an address of a 1670 sequence of statements that are loop invariant. @code{INDEX} is the
|
H A D | rtl.texi | 1650 invariant characteristic of the machine. Note, however, that not 2396 the few expressions that is not invariant under widening. The mode of
|
H A D | invoke.texi | 7386 Perform loop invariant motion on trees. This pass moves only invariants that 7389 operands of conditions that are invariant out of the loop, so that we can use 8426 Enables the loop invariant motion pass in the RTL loop optimizer. Enabled 8431 Move branches with loop invariant conditions out of the loop, with duplicates 8781 The minimum cost of an expensive expression in the loop invariant motion. 9148 @item loop-invariant-max-bbs-in-loop 9149 Loop invariant motion can be very expensive, both in compilation time and 9151 with more basic blocks than this parameter won't have loop invariant
|
H A D | generic.texi | 2092 @code{INCR} are required to be loop invariant integer
|
/dragonfly/contrib/gcc-8.0/libstdc++-v3/include/std/ |
H A D | bitset | 69 * Base class, general case. It is a class invariant that _Nw will be 700 * the high-order bits in the highest word.) It is a class invariant
|
/dragonfly/contrib/gcc-8.0/libstdc++-v3/include/tr2/ |
H A D | dynamic_bitset | 365 * is a class invariant that those unused bits are always zero.
|
/dragonfly/contrib/gcc-4.7/gcc/ |
H A D | common.opt | 1465 Move loop invariant computations out of loops 1990 Enable loop invariant motion on trees
|
H A D | tree.def | 1018 private. N1, N2 and INCR are required to be loop invariant integer
|
/dragonfly/contrib/gcc-4.7/libstdc++-v3/include/tr2/ |
H A D | dynamic_bitset | 518 * is a class invariant that those unused bits are always zero.
|
/dragonfly/contrib/binutils-2.27/gprof/ |
H A D | gprof.info | 2227 designate some or all of these sections as invariant. To do this, 2405 texts or invariant sections, and (2) were thus incorporated prior
|
/dragonfly/contrib/diffutils/doc/ |
H A D | diffutils.info | 4760 some or all of these sections as invariant. To do this, add their 4938 texts or invariant sections, and (2) were thus incorporated prior
|
/dragonfly/contrib/mpfr/doc/ |
H A D | mpfr.info | 3412 designate some or all of these sections as invariant. To do this,
|
/dragonfly/share/dict/ |
H A D | web2a | 15257 curvature invariant 44276 quadri-invariant
|
H A D | web2 | 97543 invariant
|
/dragonfly/games/fortune/datfiles/ |
H A D | fortunes | 38231 The study of those mathematical properties that are invariant
|
12