Summary: keep intermediate node alive till the end of the graph construction using dummy hook node trick
Reviewed-by: kvn, twisti
Contributed-by: vladimir.x.ivanov@oracle.com

Summary: Replaced MakeDeps and the includeDB files with more standardized solutions.
Reviewed-by: coleenp, kvn, kamg

Summary: Use hardware DIV instruction for long division by constant when it is faster than code with multiply.
Reviewed-by: never

Summary: Change all the Sun copyrights to Oracle copyright
Reviewed-by: ohair

Summary: Remove AND operation only if mask is equal to shift.
Reviewed-by: never

Summary: The CR's test crashes with SIGSEGV when running with "-server -Xcomp" using using 32bit jvm.
Reviewed-by: kvn, never, rasbold

Summary: I have collected some typos I have found while looking at the code.
Reviewed-by: kvn, never

6805724: ModLNode::Ideal() generates functionally incorrect graph when divisor is any (2^k-1) constant.
Summary: C2, ModLNode::Ideal() generates functionally incorrect graph when divisor is any (2^k-1) constant.
Reviewed-by: rasbold

Summary: This patch adds a comment pointing to the Hacker's Delight version of the algorithm plus a verbatim copy of it.  Furthermore it adds inline comments.
Reviewed-by: kvn, jrose

Summary: suppress constant folding of double divides and multiplications on ia32
Reviewed-by: never

Summary: Fix loop's probability. Add optimizations to avoid spilling. Change InlineSmallCode to product flag.
Reviewed-by: never

Summary: The result of step_through_mergemem() and remove_dead_region() is not checked in some cases.
Reviewed-by: never

Summary: delay transform call until uses of t2 are constructed
Reviewed-by: never

Summary: Update copyright year for files that have been modified in 2008
Reviewed-by: ohair, tbell

Summary: Transform long division by constant into multiply
Reviewed-by: never, kvn

Summary: rework Value method for ModD and ModF, to DTRT for infinities
Reviewed-by: sgoldman, kvn, rasbold