Search results

Jump to navigation Jump to search

Page title matches

  • ...n can be shown at compile time to produce the same result. In some cases, constant folding is quite similar to [[reduction in strength]] optimizations. Constant folding is most easily implemented on a [[directed acyclic graph|directed acyclic g
    3 KB (572 words) - 07:34, 26 September 2007
  • 12 bytes (1 word) - 07:17, 26 September 2007
  • Auto-populated based on [[Special:WhatLinksHere/Constant folding]]. Needs checking by a human.
    585 bytes (76 words) - 15:39, 11 January 2010

Page text matches

  • ...n can be shown at compile time to produce the same result. In some cases, constant folding is quite similar to [[reduction in strength]] optimizations. Constant folding is most easily implemented on a [[directed acyclic graph|directed acyclic g
    3 KB (572 words) - 07:34, 26 September 2007
  • === Constant Folding === Copy propagation may also aid constant in [[constant folding]]. If, for instance, the operand A was a constant, and the use was an addi
    4 KB (725 words) - 07:28, 26 September 2007
  • Auto-populated based on [[Special:WhatLinksHere/Constant folding]]. Needs checking by a human.
    585 bytes (76 words) - 15:39, 11 January 2010
  • ...appear in a CFG, it is often the result of earlier optimizations such as [[constant folding]]. One often finds conditionals or loops which can be determined to always And after one [[constant folding]] optimization,
    3 KB (494 words) - 08:29, 26 September 2007
  • {{r|Constant folding}}
    1 KB (187 words) - 13:39, 29 April 2011
  • {{r|Constant folding}}
    3 KB (353 words) - 03:48, 24 September 2013
  • * [[constant folding]]
    7 KB (933 words) - 16:53, 16 February 2010
  • .... The coalescing phase is quite similar to the [[copy propagation]] and [[constant folding]] optimizations that may be performed at other times during compilation. C
    9 KB (1,338 words) - 10:00, 16 July 2013