- 06 5月, 2011 1 次提交
-
-
由 kvn 提交于
Summary: Separate limit by Opaque2 node when calculating new limit for unrolled loop. Reviewed-by: never
-
- 05 5月, 2011 1 次提交
-
-
由 kvn 提交于
Summary: Fix integer overflow problem in the code generated by loop optimizer. Reviewed-by: never
-
- 04 5月, 2011 2 次提交
- 03 5月, 2011 1 次提交
-
-
由 never 提交于
Reviewed-by: kvn, twisti
-
- 02 5月, 2011 1 次提交
-
-
由 twisti 提交于
Reviewed-by: kvn, never
-
- 29 4月, 2011 2 次提交
- 28 4月, 2011 1 次提交
-
-
由 never 提交于
Reviewed-by: iveresov, kvn
-
- 27 4月, 2011 1 次提交
-
-
由 kvn 提交于
Summary: A predicate should not be moved in partial peel optimization since it will invalidate jvm state of its uncommon trap. Reviewed-by: never
-
- 26 4月, 2011 1 次提交
-
-
由 never 提交于
Reviewed-by: twisti
-
- 21 4月, 2011 1 次提交
-
-
由 kvn 提交于
Summary: memory slices should be always created for non-static fields after allocation Reviewed-by: never
-
- 16 4月, 2011 1 次提交
-
-
由 johnc 提交于
Summary: Missing parentheses around a casted expression and some missing casts were causing build failures with the jdk6 build tools. Reviewed-by: kvn, brutisso
-
- 14 4月, 2011 2 次提交
- 09 4月, 2011 1 次提交
-
-
由 kvn 提交于
Summary: Add new policy for one iteration loops (mostly formal pre- loops). Reviewed-by: never
-
- 08 4月, 2011 2 次提交
-
-
由 jrose 提交于
Summary: catch errors during the compile-time processing of method handles; back out cleanly Reviewed-by: twisti
-
由 johnc 提交于
Summary: A referent object that is only weakly reachable at the start of concurrent marking but is re-attached to the strongly reachable object graph during marking may not be marked as live. This can cause the reference object to be processed prematurely and leave dangling pointers to the referent object. Implement a read barrier for the java.lang.ref.Reference::referent field by intrinsifying the Reference.get() method, and intercepting accesses though JNI, reflection, and Unsafe, so that when a non-null referent object is read it is also logged in an SATB buffer. Reviewed-by: kvn, iveresov, never, tonyp, dholmes
-
- 07 4月, 2011 1 次提交
-
-
由 kvn 提交于
Summary: Swap checks: check for regular memory slice first and keep input phi. Reviewed-by: never
-
- 06 4月, 2011 2 次提交
- 05 4月, 2011 2 次提交
- 03 4月, 2011 3 次提交
- 02 4月, 2011 1 次提交
-
-
由 never 提交于
Reviewed-by: kvn
-
- 01 4月, 2011 1 次提交
-
-
由 kvn 提交于
Summary: StrIntrinsicNode::Ideal() should not optimize memory during Parse. Reviewed-by: jrose, never
-
- 31 3月, 2011 1 次提交
-
-
由 kvn 提交于
Summary: In Ideal() method of String intrinsics nodes look for TypeAryPtr::CHARS memory slice if memory is MergeMem. Do not unroll a loop with String intrinsics code. Reviewed-by: never
-
- 28 3月, 2011 1 次提交
-
-
由 twisti 提交于
Reviewed-by: never, kvn
-
- 27 3月, 2011 1 次提交
-
-
由 never 提交于
Reviewed-by: kvn
-
- 25 3月, 2011 1 次提交
-
-
由 roland 提交于
Summary: Enables cross building of a c2 VM. Support masking of shift counts when the processor architecture mandates it. Reviewed-by: kvn, never
-
- 23 3月, 2011 1 次提交
-
-
由 jcoomes 提交于
Reviewed-by: never, coleenp, ysr, jwilhelm
-
- 22 3月, 2011 1 次提交
-
-
由 kvn 提交于
Summary: Add predicates when loop head bytecode is parsed instead of when back branch bytecode is parsed. Reviewed-by: never
-
- 19 3月, 2011 1 次提交
-
-
由 never 提交于
Reviewed-by: kvn, coleenp, twisti, stefank
-
- 12 3月, 2011 1 次提交
-
-
由 jrose 提交于
Summary: package and class renaming only; delete unused methods and classes Reviewed-by: twisti
-
- 11 3月, 2011 1 次提交
-
-
由 kvn 提交于
Summary: add missing check this->dual() != TypeAryPtr::OOPS into TypeAryPtr::klass(). Reviewed-by: never
-
- 10 3月, 2011 1 次提交
-
-
由 kvn 提交于
Summary: Use largest_free_block() instead of unallocated_capacity(). Reviewed-by: iveresov, never, ysr
-
- 06 3月, 2011 1 次提交
-
-
由 kvn 提交于
Summary: arrays pointers meet must fall to bottom if exact array klasses in upper lattice are not equal or super klass is exact. Reviewed-by: never
-
- 02 3月, 2011 1 次提交
-
-
由 iveresov 提交于
Summary: Bulk zeroing reduction didn't work with G1, because arraycopy would call pre-barriers on uninitialized oops. The solution is to have version of arraycopy stubs that don't have pre-barriers. Also refactored arraycopy stubs generation on SPARC to be more readable and reduced the number of stubs necessary in some cases. Reviewed-by: jrose, kvn, never
-