9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/deprecate_32_bit/webrev/doc/building.html.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames doc/building.html
6 | < prev index next >
9 |
--------------------------------------------------------------------------------
/deprecate_32_bit/webrev/doc/building.html.patch:
--------------------------------------------------------------------------------
1 | diff a/doc/building.html b/doc/building.html
2 | --- a/doc/building.html
3 | +++ b/doc/building.html
4 | @@ -319,10 +319,11 @@
5 | GB of RAM. (The more cores to use, the more memory you need.) At least 6
6 | GB of free disk space is required.
7 | Even for 32-bit builds, it is recommended to use a 64-bit build
8 | machine, and instead create a 32-bit target using
9 | --with-target-bits=32.
10 | +Note: The Windows x86 port is deprecated.
11 | Building on aarch64
12 | At a minimum, a machine with 8 cores is advisable, as well as 8 GB of
13 | RAM. (The more cores to use, the more memory you need.) At least 6 GB of
14 | free disk space is required.
15 | If you do not have access to sufficiently powerful hardware, it is
16 | @@ -395,10 +396,11 @@
17 | than C:\git\jdk\Makefile. This rule also applies to input
18 | to the build system, e.g. in arguments to configure. So,
19 | use --with-msvcr-dll=/cygdrive/c/msvcr100.dll rather than
20 | --with-msvcr-dll=c:\msvcr100.dll. For details on this
21 | conversion, see the section on Fixpath .
22 | +Note: The Windows x86 port is deprecated.
23 | Cygwin
24 | A functioning Cygwin environment
25 | is required for building the JDK on Windows. If you have a 64-bit OS, we
26 | strongly recommend using the 64-bit version of Cygwin.
27 | Note: Cygwin has a model of continuously updating
28 |
--------------------------------------------------------------------------------
/deprecate_32_bit/webrev/doc/building.html.udiff.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Udiff doc/building.html
6 | < prev index next > doc/building.html
10 | Print this page
11 |
13 |
14 | GB of RAM. (The more cores to use, the more memory you need.) At least 6
15 | GB of free disk space is required.</p>
16 | <p>Even for 32-bit builds, it is recommended to use a 64-bit build
17 | machine, and instead create a 32-bit target using
18 | <code>--with-target-bits=32</code>.</p>
19 | + <p>Note: The Windows x86 port is deprecated.</p>
20 | <h3 id="building-on-aarch64">Building on aarch64</h3>
21 | <p>At a minimum, a machine with 8 cores is advisable, as well as 8 GB of
22 | RAM. (The more cores to use, the more memory you need.) At least 6 GB of
23 | free disk space is required.</p>
24 | <p>If you do not have access to sufficiently powerful hardware, it is
25 |
26 |
28 |
29 | than <code>C:\git\jdk\Makefile</code>. This rule also applies to input
30 | to the build system, e.g. in arguments to <code>configure</code>. So,
31 | use <code>--with-msvcr-dll=/cygdrive/c/msvcr100.dll</code> rather than
32 | <code>--with-msvcr-dll=c:\msvcr100.dll</code>. For details on this
33 | conversion, see the section on <a href="#fixpath">Fixpath</a>.</p>
34 | + <p>Note: The Windows x86 port is deprecated.</p>
35 | <h4 id="cygwin">Cygwin</h4>
36 | <p>A functioning <a href="http://www.cygwin.com/">Cygwin</a> environment
37 | is required for building the JDK on Windows. If you have a 64-bit OS, we
38 | strongly recommend using the 64-bit version of Cygwin.</p>
39 | <p><strong>Note:</strong> Cygwin has a model of continuously updating
40 |
41 | < prev index next >
42 |
--------------------------------------------------------------------------------
/deprecate_32_bit/webrev/doc/building.md.cdiff.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Cdiff doc/building.md
6 | < prev index next > doc/building.md
10 | Print this page
11 |
13 |
14 |
15 | space is required.
16 |
17 | Even for 32-bit builds, it is recommended to use a 64-bit build machine, and
18 | instead create a 32-bit target using `--with-target-bits=32`.
19 |
20 | + Note: The Widows x86 port is deprecated.
21 | +
22 | ### Building on aarch64
23 |
24 | At a minimum, a machine with 8 cores is advisable, as well as 8 GB of RAM.
25 | (The more cores to use, the more memory you need.) At least 6 GB of free disk
26 | space is required.
27 |
28 |
30 |
31 |
32 | rule also applies to input to the build system, e.g. in arguments to
33 | `configure`. So, use `--with-msvcr-dll=/cygdrive/c/msvcr100.dll` rather than
34 | `--with-msvcr-dll=c:\msvcr100.dll`. For details on this conversion, see the section
35 | on [Fixpath](#fixpath).
36 |
37 | + Note: The Widows x86 port is deprecated.
38 | +
39 | #### Cygwin
40 |
41 | A functioning [Cygwin](http://www.cygwin.com/) environment is required for
42 | building the JDK on Windows. If you have a 64-bit OS, we strongly recommend
43 | using the 64-bit version of Cygwin.
44 |
45 | < prev index next > Frames doc/building.md
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/deprecate_32_bit/webrev/doc/building.md.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames doc/building.md
6 | < prev index next > Udiff doc/building.md
6 | < prev index next > doc/building.md
10 | Print this page
11 |
13 |
14 | space is required.
15 |
16 | Even for 32-bit builds, it is recommended to use a 64-bit build machine, and
17 | instead create a 32-bit target using `--with-target-bits=32`.
18 |
19 | + Note: The Widows x86 port is deprecated.
20 | +
21 | ### Building on aarch64
22 |
23 | At a minimum, a machine with 8 cores is advisable, as well as 8 GB of RAM.
24 | (The more cores to use, the more memory you need.) At least 6 GB of free disk
25 | space is required.
26 |
27 |
29 |
30 | rule also applies to input to the build system, e.g. in arguments to
31 | `configure`. So, use `--with-msvcr-dll=/cygdrive/c/msvcr100.dll` rather than
32 | `--with-msvcr-dll=c:\msvcr100.dll`. For details on this conversion, see the section
33 | on [Fixpath](#fixpath).
34 |
35 | + Note: The Widows x86 port is deprecated.
36 | +
37 | #### Cygwin
38 |
39 | A functioning [Cygwin](http://www.cygwin.com/) environment is required for
40 | building the JDK on Windows. If you have a 64-bit OS, we strongly recommend
41 | using the 64-bit version of Cygwin.
42 |
43 | < prev index next > Cdiff make/autoconf/platform.m4
6 | < prev index next >make/autoconf/platform.m4
10 | Print this page
11 |
13 |
14 |
15 | PLATFORM_EXTRACT_TARGET_AND_BUILD
16 | PLATFORM_SETUP_TARGET_CPU_BITS
17 | PLATFORM_SET_MODULE_TARGET_OS_VALUES
18 | PLATFORM_SET_RELEASE_FILE_OS_VALUES
19 | PLATFORM_SETUP_LEGACY_VARS
20 | + PLATFORM_CHECK_DEPRECATION
21 | + ])
22 | +
23 | + AC_DEFUN_ONCE([PLATFORM_CHECK_DEPRECATION],
24 | + [
25 | + AC_ARG_ENABLE(deprecated-ports, [AS_HELP_STRING([--enable-deprecated-ports@<:@=yes/no@:>@],
26 | + [Suppress the error when configuring for a deprecated port @<:@no@:>@])])
27 | + AC_REQUIRE([PLATFORM_EXTRACT_TARGET_AND_BUILD])
28 | + if test "x$OPENJDK_TARGET_OS" = xwindows && test "x$OPENJDK_TARGET_CPU_ARCH" = xx86; then
29 | + if test "x$enable_deprecated_ports" = "xyes"; then
30 | + AC_MSG_WARN([The Windows x86-32 port is deprecated and may be removed in a future release.])
31 | + else
32 | + AC_MSG_ERROR(m4_normalize([The Windows x86-32 port is deprecated and may be removed in a future release.
33 | + Use --enable-deprecated-ports=yes to suppress this error.]))
34 | + fi
35 | + fi
36 | ])
37 |
38 | AC_DEFUN_ONCE([PLATFORM_SETUP_OPENJDK_BUILD_OS_VERSION],
39 | [
40 | ###############################################################################
41 |
42 | < prev index next >Frames make/autoconf/platform.m4
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/deprecate_32_bit/webrev/make/autoconf/platform.m4.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames make/autoconf/platform.m4
6 | < prev index next >Udiff make/autoconf/platform.m4
6 | < prev index next >make/autoconf/platform.m4
10 | Print this page
11 |
13 |
14 | PLATFORM_EXTRACT_TARGET_AND_BUILD
15 | PLATFORM_SETUP_TARGET_CPU_BITS
16 | PLATFORM_SET_MODULE_TARGET_OS_VALUES
17 | PLATFORM_SET_RELEASE_FILE_OS_VALUES
18 | PLATFORM_SETUP_LEGACY_VARS
19 | + PLATFORM_CHECK_DEPRECATION
20 | + ])
21 | +
22 | + AC_DEFUN_ONCE([PLATFORM_CHECK_DEPRECATION],
23 | + [
24 | + AC_ARG_ENABLE(deprecated-ports, [AS_HELP_STRING([--enable-deprecated-ports@<:@=yes/no@:>@],
25 | + [Suppress the error when configuring for a deprecated port @<:@no@:>@])])
26 | + AC_REQUIRE([PLATFORM_EXTRACT_TARGET_AND_BUILD])
27 | + if test "x$OPENJDK_TARGET_OS" = xwindows && test "x$OPENJDK_TARGET_CPU_ARCH" = xx86; then
28 | + if test "x$enable_deprecated_ports" = "xyes"; then
29 | + AC_MSG_WARN([The Windows x86-32 port is deprecated and may be removed in a future release.])
30 | + else
31 | + AC_MSG_ERROR(m4_normalize([The Windows x86-32 port is deprecated and may be removed in a future release.
32 | + Use --enable-deprecated-ports=yes to suppress this error.]))
33 | + fi
34 | + fi
35 | ])
36 |
37 | AC_DEFUN_ONCE([PLATFORM_SETUP_OPENJDK_BUILD_OS_VERSION],
38 | [
39 | ###############################################################################
40 |
41 | < prev index next >
28 |
29 | _Updated_
30 |
31 | _Issue_
32 |
33 | Summary
34 | -------
35 |
36 | Remove the source code and build support for the Windows 32-bit x86 port. This port was deprecated for removal in JDK 21 with the express intent to remove it in a future release.
37 |
38 | Goals
39 | -----
40 |
41 | - Remove all code paths that apply only to Windows 32-bit x86.
42 | - Cease all testing and development efforts targeting the Windows 32-bit x86 platform.
43 | - Simplify the JDK's build and test infrastructure.
44 |
45 | Non-Goals
46 | ---------
47 |
48 | - It is not a goal to remove or change 32-bit support for any platforms other than Windows.
49 | - It is not a goal to remove either code or support for Windows 32-bit in previous releases.
50 |
51 | Motivation
52 | ----------
53 |
54 | - Allow contributors in the OpenJDK Community to accelerate the development of new features and enhancements that will move the platform forward.
55 | - The implementation of [JEP 436 (Virtual Threads)](https://openjdk.org/jeps/436) for Windows x86-32 falls back to the use of kernel threads and therefore does not bring the expected benefits of Project Loom.
56 | - Windows 10, the last Windows operating system to support 32-bit operation, will reach End of Life in [October 2025](https://learn.microsoft.com/lifecycle/products/windows-10-home-and-pro).
57 |
58 | Description
59 | -----------
60 |
61 | - Find and remove all code paths in the code base that apply only to Windows 32-bit.
62 | - Modify the JDK build system to remove support for compiling on Windows 32-bit platforms, and halt testing activities for this architecture.
63 | - Update the JDK documentation to reflect the removal of Windows 32-bit support, and publicize this change so as to ensure a smooth transition for users and developers.
64 |
65 | Risks and Assumptions
66 | ---------------------
67 |
68 | Some users may still rely on 32-bit Java applications on Windows. This change requires Java applications running on 32-bit Windows to migrate to a 64-bit JDK and Windows environment, or else remain on legacy versions of the JDK, prior to JDK 23, which still include 32-bit support. Transition guidance and support by distributions and vendors of JDK binaries will be critical.
69 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/nanoduke.ico:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/microsoft/openjdk-proposals/b8c7737a46e63b8709ce93812a96a5c6dffa8fea/stack_allocation/webrev/nanoduke.ico
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/code/debugInfo.cpp.frames.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/code/debugInfo.cpp
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/code/debugInfo.cpp.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/code/debugInfo.cpp
6 | < prev index next >
9 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/code/debugInfo.hpp.frames.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/code/debugInfo.hpp
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/code/debugInfo.hpp.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/code/debugInfo.hpp
6 | < prev index next > Cdiff src/hotspot/share/compiler/compilerDefinitions.cpp
6 | < prev index next > src/hotspot/share/compiler/compilerDefinitions.cpp
10 | Print this page
11 |
13 |
14 |
15 | }
16 | if (FLAG_IS_DEFAULT(LoopStripMiningIterShortLoop)) {
17 | // blind guess
18 | LoopStripMiningIterShortLoop = LoopStripMiningIter / 10;
19 | }
20 | + if (UseStackAllocation) {
21 | + if (!(UseSerialGC || UseParallelGC || UseG1GC)) {
22 | + vm_exit_during_initialization("UseStackAllocation is not supported with selected GC", GCConfig::hs_err_name());
23 | + FLAG_SET_DEFAULT(UseStackAllocation, false);
24 | + FLAG_SET_ERGO(UseStackAllocationRuntime, false);
25 | + } else {
26 | + FLAG_SET_ERGO(UseStackAllocationRuntime, true);
27 | + }
28 | + }
29 | #endif // COMPILER2
30 | }
31 |
32 | static CompLevel highest_compile_level() {
33 | return TieredCompilation ? MIN2((CompLevel) TieredStopAtLevel, CompLevel_highest_tier) : CompLevel_highest_tier;
34 |
35 | < prev index next > Frames src/hotspot/share/compiler/compilerDefinitions.cpp
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/compiler/compilerDefinitions.cpp.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/compiler/compilerDefinitions.cpp
6 | < prev index next > Udiff src/hotspot/share/compiler/compilerDefinitions.cpp
6 | < prev index next > src/hotspot/share/compiler/compilerDefinitions.cpp
10 | Print this page
11 |
13 |
14 | }
15 | if (FLAG_IS_DEFAULT(LoopStripMiningIterShortLoop)) {
16 | // blind guess
17 | LoopStripMiningIterShortLoop = LoopStripMiningIter / 10;
18 | }
19 | + if (UseStackAllocation) {
20 | + if (!(UseSerialGC || UseParallelGC || UseG1GC)) {
21 | + vm_exit_during_initialization("UseStackAllocation is not supported with selected GC", GCConfig::hs_err_name());
22 | + FLAG_SET_DEFAULT(UseStackAllocation, false);
23 | + FLAG_SET_ERGO(UseStackAllocationRuntime, false);
24 | + } else {
25 | + FLAG_SET_ERGO(UseStackAllocationRuntime, true);
26 | + }
27 | + }
28 | #endif // COMPILER2
29 | }
30 |
31 | static CompLevel highest_compile_level() {
32 | return TieredCompilation ? MIN2((CompLevel) TieredStopAtLevel, CompLevel_highest_tier) : CompLevel_highest_tier;
33 |
34 | < prev index next > Cdiff src/hotspot/share/compiler/compilerDirectives.hpp
6 | < prev index next > src/hotspot/share/compiler/compilerDirectives.hpp
10 | Print this page
11 |
13 |
14 | NOT_PRODUCT(cflags(IGVPrintLevel, intx, PrintIdealGraphLevel, IGVPrintLevel)) \
15 | cflags(TraceSpilling, bool, TraceSpilling, TraceSpilling) \
16 | cflags(Vectorize, bool, false, Vectorize) \
17 | cflags(VectorizeDebug, uintx, 0, VectorizeDebug) \
18 | cflags(CloneMapDebug, bool, false, CloneMapDebug) \
19 | ! cflags(MaxNodeLimit, intx, MaxNodeLimit, MaxNodeLimit)
20 | #else
21 | #define compilerdirectives_c2_flags(cflags)
22 | #endif
23 |
24 | class CompilerDirectives;
25 |
26 | NOT_PRODUCT(cflags(IGVPrintLevel, intx, PrintIdealGraphLevel, IGVPrintLevel)) \
27 | cflags(TraceSpilling, bool, TraceSpilling, TraceSpilling) \
28 | cflags(Vectorize, bool, false, Vectorize) \
29 | cflags(VectorizeDebug, uintx, 0, VectorizeDebug) \
30 | cflags(CloneMapDebug, bool, false, CloneMapDebug) \
31 | ! cflags(MaxNodeLimit, intx, MaxNodeLimit, MaxNodeLimit) \
32 | + NOT_PRODUCT(cflags(PrintEscapeAnalysis, bool, PrintEscapeAnalysis, PrintEscapeAnalysis)) \
33 | + NOT_PRODUCT(cflags(PrintEliminateAllocations, bool, PrintEliminateAllocations, PrintEliminateAllocations)) \
34 | + cflags(UseStackAllocation, bool, UseStackAllocation, UseStackAllocation) \
35 | + NOT_PRODUCT(cflags(PrintStackAllocation, bool, PrintStackAllocation, PrintStackAllocation))
36 | #else
37 | #define compilerdirectives_c2_flags(cflags)
38 | #endif
39 |
40 | class CompilerDirectives;
41 |
42 | < prev index next > Frames src/hotspot/share/compiler/compilerDirectives.hpp
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/compiler/compilerDirectives.hpp.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/compiler/compilerDirectives.hpp
6 | < prev index next > Udiff src/hotspot/share/compiler/compilerDirectives.hpp
6 | < prev index next > src/hotspot/share/compiler/compilerDirectives.hpp
10 | Print this page
11 |
13 |
14 | NOT_PRODUCT(cflags(IGVPrintLevel, intx, PrintIdealGraphLevel, IGVPrintLevel)) \
15 | cflags(TraceSpilling, bool, TraceSpilling, TraceSpilling) \
16 | cflags(Vectorize, bool, false, Vectorize) \
17 | cflags(VectorizeDebug, uintx, 0, VectorizeDebug) \
18 | cflags(CloneMapDebug, bool, false, CloneMapDebug) \
19 | - cflags(MaxNodeLimit, intx, MaxNodeLimit, MaxNodeLimit)
20 | + cflags(MaxNodeLimit, intx, MaxNodeLimit, MaxNodeLimit) \
21 | + NOT_PRODUCT(cflags(PrintEscapeAnalysis, bool, PrintEscapeAnalysis, PrintEscapeAnalysis)) \
22 | + NOT_PRODUCT(cflags(PrintEliminateAllocations, bool, PrintEliminateAllocations, PrintEliminateAllocations)) \
23 | + cflags(UseStackAllocation, bool, UseStackAllocation, UseStackAllocation) \
24 | + NOT_PRODUCT(cflags(PrintStackAllocation, bool, PrintStackAllocation, PrintStackAllocation))
25 | #else
26 | #define compilerdirectives_c2_flags(cflags)
27 | #endif
28 |
29 | class CompilerDirectives;
30 |
31 | < prev index next > Frames src/hotspot/share/compiler/oopMap.cpp
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/compiler/oopMap.cpp.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/compiler/oopMap.cpp
6 | < prev index next > Cdiff src/hotspot/share/compiler/oopMap.hpp
6 | < prev index next > src/hotspot/share/compiler/oopMap.hpp
10 | Print this page
11 |
13 |
14 |
15 | };
16 |
17 |
18 | class OopMapSet : public ResourceObj {
19 | friend class VMStructs;
20 | + friend class OopClosureWalker;
21 | private:
22 | GrowableArray<OopMap*> _list;
23 |
24 | void add(OopMap* value) { _list.append(value); }
25 |
26 | + static void stack_oop_do(oop *p, OopClosure* oop_fn,
27 | + GrowableArray<oop> *stack_oops,
28 | + intptr_t *stack_base, intptr_t *stack_top);
29 | +
30 | public:
31 | OopMapSet();
32 |
33 | // returns the number of OopMaps in this OopMapSet
34 | int size() const { return _list.length(); }
35 |
36 | < prev index next > Frames src/hotspot/share/compiler/oopMap.hpp
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/compiler/oopMap.hpp.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/compiler/oopMap.hpp
6 | < prev index next > _list;
13 |
14 | void add(OopMap* value) { _list.append(value); }
15 |
16 | + static void stack_oop_do(oop *p, OopClosure* oop_fn,
17 | + GrowableArray *stack_oops,
18 | + intptr_t *stack_base, intptr_t *stack_top);
19 | +
20 | public:
21 | OopMapSet();
22 |
23 | // returns the number of OopMaps in this OopMapSet
24 | int size() const { return _list.length(); }
25 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/compiler/oopMap.hpp.udiff.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Udiff src/hotspot/share/compiler/oopMap.hpp
6 | < prev index next > src/hotspot/share/compiler/oopMap.hpp
10 | Print this page
11 |
13 |
14 | };
15 |
16 |
17 | class OopMapSet : public ResourceObj {
18 | friend class VMStructs;
19 | + friend class OopClosureWalker;
20 | private:
21 | GrowableArray<OopMap*> _list;
22 |
23 | void add(OopMap* value) { _list.append(value); }
24 |
25 | + static void stack_oop_do(oop *p, OopClosure* oop_fn,
26 | + GrowableArray<oop> *stack_oops,
27 | + intptr_t *stack_base, intptr_t *stack_top);
28 | +
29 | public:
30 | OopMapSet();
31 |
32 | // returns the number of OopMaps in this OopMapSet
33 | int size() const { return _list.length(); }
34 |
35 | < prev index next > Frames src/hotspot/share/gc/g1/c2/g1BarrierSetC2.cpp
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/gc/g1/c2/g1BarrierSetC2.cpp.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/gc/g1/c2/g1BarrierSetC2.cpp
6 | < prev index next > Cdiff src/hotspot/share/gc/g1/c2/g1BarrierSetC2.hpp
6 | < prev index next > src/hotspot/share/gc/g1/c2/g1BarrierSetC2.hpp
10 | Print this page
11 |
13 |
14 |
15 |
16 | public:
17 | virtual bool is_gc_barrier_node(Node* node) const;
18 | virtual void eliminate_gc_barrier(PhaseMacroExpand* macro, Node* node) const;
19 | virtual Node* step_over_gc_barrier(Node* c) const;
20 | + virtual bool process_barrier_node(Node* cast_node, PhaseIterGVN& igvn) const;
21 | +
22 |
23 | #ifdef ASSERT
24 | virtual void verify_gc_barriers(Compile* compile, CompilePhase phase) const;
25 | #endif
26 |
27 |
28 | < prev index next > Frames src/hotspot/share/gc/g1/c2/g1BarrierSetC2.hpp
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/gc/g1/c2/g1BarrierSetC2.hpp.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/gc/g1/c2/g1BarrierSetC2.hpp
6 | < prev index next > Udiff src/hotspot/share/gc/g1/c2/g1BarrierSetC2.hpp
6 | < prev index next > src/hotspot/share/gc/g1/c2/g1BarrierSetC2.hpp
10 | Print this page
11 |
13 |
14 |
15 | public:
16 | virtual bool is_gc_barrier_node(Node* node) const;
17 | virtual void eliminate_gc_barrier(PhaseMacroExpand* macro, Node* node) const;
18 | virtual Node* step_over_gc_barrier(Node* c) const;
19 | + virtual bool process_barrier_node(Node* cast_node, PhaseIterGVN& igvn) const;
20 | +
21 |
22 | #ifdef ASSERT
23 | virtual void verify_gc_barriers(Compile* compile, CompilePhase phase) const;
24 | #endif
25 |
26 |
27 | < prev index next > Cdiff src/hotspot/share/gc/parallel/psParallelCompact.inline.hpp
6 | < prev index next > src/hotspot/share/gc/parallel/psParallelCompact.inline.hpp
10 | Print this page
11 |
13 |
14 | oop obj = CompressedOops::decode_not_null(heap_oop);
15 | assert(ParallelScavengeHeap::heap()->is_in(obj), "should be in heap");
16 |
17 | oop new_obj = (oop)summary_data().calc_new_pointer(obj, cm);
18 | assert(new_obj != NULL, // is forwarding ptr?
19 | ! "should be forwarded");
20 | // Just always do the update unconditionally?
21 | if (new_obj != NULL) {
22 | assert(ParallelScavengeHeap::heap()->is_in_reserved(new_obj),
23 | ! "should be in object space");
24 | RawAccess<IS_NOT_NULL>::oop_store(p, new_obj);
25 | }
26 | }
27 | }
28 |
29 |
30 | oop obj = CompressedOops::decode_not_null(heap_oop);
31 | assert(ParallelScavengeHeap::heap()->is_in(obj), "should be in heap");
32 |
33 | oop new_obj = (oop)summary_data().calc_new_pointer(obj, cm);
34 | assert(new_obj != NULL, // is forwarding ptr?
35 | ! "should be forwarded");
36 | // Just always do the update unconditionally?
37 | if (new_obj != NULL) {
38 | assert(ParallelScavengeHeap::heap()->is_in_reserved(new_obj),
39 | ! "should be in object space");
40 | RawAccess<IS_NOT_NULL>::oop_store(p, new_obj);
41 | }
42 | }
43 | }
44 |
45 |
46 | < prev index next > Frames src/hotspot/share/gc/parallel/psParallelCompact.inline.hpp
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/gc/parallel/psParallelCompact.inline.hpp.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/gc/parallel/psParallelCompact.inline.hpp
6 | < prev index next > ::oop_store(p, new_obj);
18 | }
19 | }
20 | }
21 |
22 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/gc/parallel/psParallelCompact.inline.hpp.udiff.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Udiff src/hotspot/share/gc/parallel/psParallelCompact.inline.hpp
6 | < prev index next > src/hotspot/share/gc/parallel/psParallelCompact.inline.hpp
10 | Print this page
11 |
13 |
14 | oop obj = CompressedOops::decode_not_null(heap_oop);
15 | assert(ParallelScavengeHeap::heap()->is_in(obj), "should be in heap");
16 |
17 | oop new_obj = (oop)summary_data().calc_new_pointer(obj, cm);
18 | assert(new_obj != NULL, // is forwarding ptr?
19 | - "should be forwarded");
20 | + "should be forwarded");
21 | // Just always do the update unconditionally?
22 | if (new_obj != NULL) {
23 | assert(ParallelScavengeHeap::heap()->is_in_reserved(new_obj),
24 | - "should be in object space");
25 | + "should be in object space");
26 | RawAccess<IS_NOT_NULL>::oop_store(p, new_obj);
27 | }
28 | }
29 | }
30 |
31 |
32 | < prev index next > Cdiff src/hotspot/share/gc/shared/c2/barrierSetC2.hpp
6 | < prev index next > src/hotspot/share/gc/shared/c2/barrierSetC2.hpp
10 | Print this page
11 |
13 |
14 |
15 | // This could for example comprise macro nodes to be expanded during macro expansion.
16 | virtual void* create_barrier_state(Arena* comp_arena) const { return NULL; }
17 | // If the BarrierSetC2 state has barrier nodes in its compilation
18 | // unit state to be expanded later, then now is the time to do so.
19 | virtual bool expand_barriers(Compile* C, PhaseIterGVN& igvn) const { return false; }
20 | + virtual bool process_barrier_node(Node* cast_node, PhaseIterGVN& igvn) const { return false; }
21 | virtual bool optimize_loops(PhaseIdealLoop* phase, LoopOptsMode mode, VectorSet& visited, Node_Stack& nstack, Node_List& worklist) const { return false; }
22 | virtual bool strip_mined_loops_expanded(LoopOptsMode mode) const { return false; }
23 | virtual bool is_gc_specific_loop_opts_pass(LoopOptsMode mode) const { return false; }
24 |
25 | enum CompilePhase {
26 |
27 | < prev index next > Frames src/hotspot/share/gc/shared/c2/barrierSetC2.hpp
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/gc/shared/c2/barrierSetC2.hpp.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/gc/shared/c2/barrierSetC2.hpp
6 | < prev index next > Udiff src/hotspot/share/gc/shared/c2/barrierSetC2.hpp
6 | < prev index next > src/hotspot/share/gc/shared/c2/barrierSetC2.hpp
10 | Print this page
11 |
13 |
14 | // This could for example comprise macro nodes to be expanded during macro expansion.
15 | virtual void* create_barrier_state(Arena* comp_arena) const { return NULL; }
16 | // If the BarrierSetC2 state has barrier nodes in its compilation
17 | // unit state to be expanded later, then now is the time to do so.
18 | virtual bool expand_barriers(Compile* C, PhaseIterGVN& igvn) const { return false; }
19 | + virtual bool process_barrier_node(Node* cast_node, PhaseIterGVN& igvn) const { return false; }
20 | virtual bool optimize_loops(PhaseIdealLoop* phase, LoopOptsMode mode, VectorSet& visited, Node_Stack& nstack, Node_List& worklist) const { return false; }
21 | virtual bool strip_mined_loops_expanded(LoopOptsMode mode) const { return false; }
22 | virtual bool is_gc_specific_loop_opts_pass(LoopOptsMode mode) const { return false; }
23 |
24 | enum CompilePhase {
25 |
26 | < prev index next > Frames src/hotspot/share/gc/shared/c2/cardTableBarrierSetC2.cpp
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/gc/shared/c2/cardTableBarrierSetC2.cpp.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/gc/shared/c2/cardTableBarrierSetC2.cpp
6 | < prev index next > Old src/hotspot/share/gc/shared/c2/cardTableBarrierSetC2.hpp
6 |
10 | 1 /*
11 | 2 * Copyright (c) 2018, Oracle and/or its affiliates. All rights reserved.
12 | 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
13 | 4 *
14 | 5 * This code is free software; you can redistribute it and/or modify it
15 | 6 * under the terms of the GNU General Public License version 2 only, as
16 | 7 * published by the Free Software Foundation.
17 | 8 *
18 | 9 * This code is distributed in the hope that it will be useful, but WITHOUT
19 | 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
20 | 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
21 | 12 * version 2 for more details (a copy is included in the LICENSE file that
22 | 13 * accompanied this code).
23 | 14 *
24 | 15 * You should have received a copy of the GNU General Public License version
25 | 16 * 2 along with this work; if not, write to the Free Software Foundation,
26 | 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
27 | 18 *
28 | 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
29 | 20 * or visit www.oracle.com if you need additional information or have any
30 | 21 * questions.
31 | 22 *
32 | 23 */
33 | 24
34 | 25 #ifndef SHARE_GC_SHARED_C2_CARDTABLEBARRIERSETC2_HPP
35 | 26 #define SHARE_GC_SHARED_C2_CARDTABLEBARRIERSETC2_HPP
36 | 27
37 | 28 #include "gc/shared/c2/modRefBarrierSetC2.hpp"
38 | 29
39 | 30 class CardTableBarrierSetC2: public ModRefBarrierSetC2 {
40 | 31 protected:
41 | 32 virtual void post_barrier(GraphKit* kit,
42 | 33 Node* ctl,
43 | 34 Node* store,
44 | 35 Node* obj,
45 | 36 Node* adr,
46 | 37 uint adr_idx,
47 | 38 Node* val,
48 | 39 BasicType bt,
49 | 40 bool use_precise) const;
50 | 41
51 | 42 Node* byte_map_base_node(GraphKit* kit) const;
52 | 43
53 | 44 public:
54 | 45 virtual void clone(GraphKit* kit, Node* src, Node* dst, Node* size, bool is_array) const;
55 | 46 virtual bool is_gc_barrier_node(Node* node) const;
56 | 47 virtual void eliminate_gc_barrier(PhaseMacroExpand* macro, Node* node) const;
57 | 48 virtual bool array_copy_requires_gc_barriers(bool tightly_coupled_alloc, BasicType type, bool is_clone, ArrayCopyPhase phase) const;
58 | 49
59 | 50 bool use_ReduceInitialCardMarks() const;
60 | 51 };
61 | 52
62 | 53 #endif // SHARE_GC_SHARED_C2_CARDTABLEBARRIERSETC2_HPP
63 |
64 |
65 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/gc/shared/c2/cardTableBarrierSetC2.hpp.frames.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/gc/shared/c2/cardTableBarrierSetC2.hpp
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/gc/shared/c2/cardTableBarrierSetC2.hpp.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/gc/shared/c2/cardTableBarrierSetC2.hpp
6 | < prev index next > * _enqueue_barriers;
17 | +
18 | +public:
19 | + BarrierSetC2State(Arena* comp_arena);
20 | +
21 | + int enqueue_barriers_count() const;
22 | + CastP2XNode* enqueue_barrier(int idx) const;
23 | + void add_enqueue_barrier(CastP2XNode* n);
24 | + void remove_enqueue_barrier(CastP2XNode* n);
25 | + bool is_a_barrier(CastP2XNode* n);
26 | +};
27 | +
28 |
29 | class CardTableBarrierSetC2: public ModRefBarrierSetC2 {
30 | protected:
31 | virtual void post_barrier(GraphKit* kit,
32 | Node* ctl,
33 | @@ -44,10 +62,19 @@
34 | public:
35 | virtual void clone(GraphKit* kit, Node* src, Node* dst, Node* size, bool is_array) const;
36 | virtual bool is_gc_barrier_node(Node* node) const;
37 | virtual void eliminate_gc_barrier(PhaseMacroExpand* macro, Node* node) const;
38 | virtual bool array_copy_requires_gc_barriers(bool tightly_coupled_alloc, BasicType type, bool is_clone, ArrayCopyPhase phase) const;
39 | + virtual bool process_barrier_node(Node* cast_node, PhaseIterGVN& igvn) const;
40 | + virtual Node* step_over_gc_barrier(Node* c) const;
41 |
42 | bool use_ReduceInitialCardMarks() const;
43 | +
44 | + BarrierSetC2State* state() const;
45 | +
46 | + virtual void register_potential_barrier_node(Node* node) const;
47 | + virtual void unregister_potential_barrier_node(Node* node) const;
48 | + virtual bool expand_barriers(Compile* C, PhaseIterGVN& igvn) const;
49 | + virtual void* create_barrier_state(Arena* comp_arena) const;
50 | };
51 |
52 | #endif // SHARE_GC_SHARED_C2_CARDTABLEBARRIERSETC2_HPP
53 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/gc/shared/cardTable.hpp.cdiff.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Cdiff src/hotspot/share/gc/shared/cardTable.hpp
6 | < prev index next > src/hotspot/share/gc/shared/cardTable.hpp
10 | Print this page
11 |
13 |
14 |
15 | // This would be the 0th element of _byte_map, if the heap started at 0x0.
16 | // But since the heap starts at some higher address, this points to somewhere
17 | // before the beginning of the actual _byte_map.
18 | CardValue* byte_map_base() const { return _byte_map_base; }
19 | bool scanned_concurrently() const { return _scanned_concurrently; }
20 | + size_t byte_map_top_offset() const { return uintptr_t(_whole_heap.end()); }
21 | + size_t byte_map_bottom_offset() const { return uintptr_t(_whole_heap.start()); }
22 |
23 | virtual bool is_in_young(oop obj) const = 0;
24 |
25 | // Print a description of the memory for the card table
26 | virtual void print_on(outputStream* st) const;
27 |
28 | < prev index next > Frames src/hotspot/share/gc/shared/cardTable.hpp
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/gc/shared/cardTable.hpp.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/gc/shared/cardTable.hpp
6 | < prev index next > Udiff src/hotspot/share/gc/shared/cardTable.hpp
6 | < prev index next > src/hotspot/share/gc/shared/cardTable.hpp
10 | Print this page
11 |
13 |
14 | // This would be the 0th element of _byte_map, if the heap started at 0x0.
15 | // But since the heap starts at some higher address, this points to somewhere
16 | // before the beginning of the actual _byte_map.
17 | CardValue* byte_map_base() const { return _byte_map_base; }
18 | bool scanned_concurrently() const { return _scanned_concurrently; }
19 | + size_t byte_map_top_offset() const { return uintptr_t(_whole_heap.end()); }
20 | + size_t byte_map_bottom_offset() const { return uintptr_t(_whole_heap.start()); }
21 |
22 | virtual bool is_in_young(oop obj) const = 0;
23 |
24 | // Print a description of the memory for the card table
25 | virtual void print_on(outputStream* st) const;
26 |
27 | < prev index next > Old src/hotspot/share/memory/iterator.cpp
6 |
10 | 1 /*
11 | 2 * Copyright (c) 1997, 2018, Oracle and/or its affiliates. All rights reserved.
12 | 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
13 | 4 *
14 | 5 * This code is free software; you can redistribute it and/or modify it
15 | 6 * under the terms of the GNU General Public License version 2 only, as
16 | 7 * published by the Free Software Foundation.
17 | 8 *
18 | 9 * This code is distributed in the hope that it will be useful, but WITHOUT
19 | 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
20 | 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
21 | 12 * version 2 for more details (a copy is included in the LICENSE file that
22 | 13 * accompanied this code).
23 | 14 *
24 | 15 * You should have received a copy of the GNU General Public License version
25 | 16 * 2 along with this work; if not, write to the Free Software Foundation,
26 | 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
27 | 18 *
28 | 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
29 | 20 * or visit www.oracle.com if you need additional information or have any
30 | 21 * questions.
31 | 22 *
32 | 23 */
33 | 24
34 | 25 #include "precompiled.hpp"
35 | 26 #include "code/nmethod.hpp"
36 | 27 #include "memory/iterator.inline.hpp"
37 | 28 #include "oops/oop.inline.hpp"
38 | 29 #include "utilities/debug.hpp"
39 | 30 #include "utilities/globalDefinitions.hpp"
40 | 31
41 | 32 DoNothingClosure do_nothing_cl;
42 | 33
43 | 34 void CLDToOopClosure::do_cld(ClassLoaderData* cld) {
44 | 35 cld->oops_do(_oop_closure, _cld_claim);
45 | 36 }
46 | 37
47 | 38 void ObjectToOopClosure::do_object(oop obj) {
48 | 39 obj->oop_iterate(_cl);
49 | 40 }
50 | 41
51 | 42 void VoidClosure::do_void() {
52 | 43 ShouldNotCallThis();
53 | 44 }
54 | 45
55 | 46 void CodeBlobToOopClosure::do_nmethod(nmethod* nm) {
56 | 47 nm->oops_do(_cl);
57 | 48 if (_fix_relocations) {
58 | 49 nm->fix_oop_relocations();
59 | 50 }
60 | 51 }
61 | 52
62 | 53 void CodeBlobToOopClosure::do_code_blob(CodeBlob* cb) {
63 | 54 nmethod* nm = cb->as_nmethod_or_null();
64 | 55 if (nm != NULL) {
65 | 56 do_nmethod(nm);
66 | 57 }
67 | 58 }
68 | 59
69 | 60 void MarkingCodeBlobClosure::do_code_blob(CodeBlob* cb) {
70 | 61 nmethod* nm = cb->as_nmethod_or_null();
71 | 62 if (nm != NULL && nm->oops_do_try_claim()) {
72 | 63 do_nmethod(nm);
73 | 64 }
74 | 65 }
75 |
76 |
77 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/memory/iterator.cpp.cdiff.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Cdiff src/hotspot/share/memory/iterator.cpp
6 | < prev index next > src/hotspot/share/memory/iterator.cpp
10 | Print this page
11 |
13 |
14 |
15 |
16 | #include "precompiled.hpp"
17 | #include "code/nmethod.hpp"
18 | #include "memory/iterator.inline.hpp"
19 | #include "oops/oop.inline.hpp"
20 | + #include "runtime/fieldDescriptor.inline.hpp"
21 | #include "utilities/debug.hpp"
22 | #include "utilities/globalDefinitions.hpp"
23 |
24 | DoNothingClosure do_nothing_cl;
25 |
26 |
27 | < prev index next > Frames src/hotspot/share/memory/iterator.cpp
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/memory/iterator.cpp.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/memory/iterator.cpp
6 | < prev index next > New src/hotspot/share/memory/iterator.cpp
6 |
10 | 1 /*
11 | 2 * Copyright (c) 1997, 2018, Oracle and/or its affiliates. All rights reserved.
12 | 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
13 | 4 *
14 | 5 * This code is free software; you can redistribute it and/or modify it
15 | 6 * under the terms of the GNU General Public License version 2 only, as
16 | 7 * published by the Free Software Foundation.
17 | 8 *
18 | 9 * This code is distributed in the hope that it will be useful, but WITHOUT
19 | 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
20 | 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
21 | 12 * version 2 for more details (a copy is included in the LICENSE file that
22 | 13 * accompanied this code).
23 | 14 *
24 | 15 * You should have received a copy of the GNU General Public License version
25 | 16 * 2 along with this work; if not, write to the Free Software Foundation,
26 | 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
27 | 18 *
28 | 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
29 | 20 * or visit www.oracle.com if you need additional information or have any
30 | 21 * questions.
31 | 22 *
32 | 23 */
33 | 24
34 | 25 #include "precompiled.hpp"
35 | 26 #include "code/nmethod.hpp"
36 | 27 #include "memory/iterator.inline.hpp"
37 | 28 #include "oops/oop.inline.hpp"
38 | 29 #include "runtime/fieldDescriptor.inline.hpp"
39 | 30 #include "utilities/debug.hpp"
40 | 31 #include "utilities/globalDefinitions.hpp"
41 | 32
42 | 33 DoNothingClosure do_nothing_cl;
43 | 34
44 | 35 void CLDToOopClosure::do_cld(ClassLoaderData* cld) {
45 | 36 cld->oops_do(_oop_closure, _cld_claim);
46 | 37 }
47 | 38
48 | 39 void ObjectToOopClosure::do_object(oop obj) {
49 | 40 obj->oop_iterate(_cl);
50 | 41 }
51 | 42
52 | 43 void VoidClosure::do_void() {
53 | 44 ShouldNotCallThis();
54 | 45 }
55 | 46
56 | 47 void CodeBlobToOopClosure::do_nmethod(nmethod* nm) {
57 | 48 nm->oops_do(_cl);
58 | 49 if (_fix_relocations) {
59 | 50 nm->fix_oop_relocations();
60 | 51 }
61 | 52 }
62 | 53
63 | 54 void CodeBlobToOopClosure::do_code_blob(CodeBlob* cb) {
64 | 55 nmethod* nm = cb->as_nmethod_or_null();
65 | 56 if (nm != NULL) {
66 | 57 do_nmethod(nm);
67 | 58 }
68 | 59 }
69 | 60
70 | 61 void MarkingCodeBlobClosure::do_code_blob(CodeBlob* cb) {
71 | 62 nmethod* nm = cb->as_nmethod_or_null();
72 | 63 if (nm != NULL && nm->oops_do_try_claim()) {
73 | 64 do_nmethod(nm);
74 | 65 }
75 | 66 }
76 |
77 |
78 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/memory/iterator.cpp.patch:
--------------------------------------------------------------------------------
1 | diff a/src/hotspot/share/memory/iterator.cpp b/src/hotspot/share/memory/iterator.cpp
2 | --- a/src/hotspot/share/memory/iterator.cpp
3 | +++ b/src/hotspot/share/memory/iterator.cpp
4 | @@ -24,10 +24,11 @@
5 |
6 | #include "precompiled.hpp"
7 | #include "code/nmethod.hpp"
8 | #include "memory/iterator.inline.hpp"
9 | #include "oops/oop.inline.hpp"
10 | +#include "runtime/fieldDescriptor.inline.hpp"
11 | #include "utilities/debug.hpp"
12 | #include "utilities/globalDefinitions.hpp"
13 |
14 | DoNothingClosure do_nothing_cl;
15 |
16 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/memory/iterator.cpp.udiff.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Udiff src/hotspot/share/memory/iterator.cpp
6 | < prev index next > src/hotspot/share/memory/iterator.cpp
10 | Print this page
11 |
13 |
14 |
15 | #include "precompiled.hpp"
16 | #include "code/nmethod.hpp"
17 | #include "memory/iterator.inline.hpp"
18 | #include "oops/oop.inline.hpp"
19 | + #include "runtime/fieldDescriptor.inline.hpp"
20 | #include "utilities/debug.hpp"
21 | #include "utilities/globalDefinitions.hpp"
22 |
23 | DoNothingClosure do_nothing_cl;
24 |
25 |
26 | < prev index next > Cdiff src/hotspot/share/opto/block.cpp
6 | < prev index next > src/hotspot/share/opto/block.cpp
10 | Print this page
11 |
13 |
14 | }
15 |
16 | // Ideal nodes are allowable in empty blocks: skip them Only MachNodes
17 | // turn directly into code, because only MachNodes have non-trivial
18 | // emit() functions.
19 | ! while ((end_idx > 0) && !get_node(end_idx)->is_Mach()) {
20 | end_idx--;
21 | }
22 |
23 | // No room for any interesting instructions?
24 | if (end_idx == 0) {
25 |
26 | }
27 |
28 | // Ideal nodes are allowable in empty blocks: skip them Only MachNodes
29 | // turn directly into code, because only MachNodes have non-trivial
30 | // emit() functions.
31 | ! while ((end_idx > 0) && !(get_node(end_idx)->is_Mach() || get_node(end_idx)->is_BoxLock())) {
32 | end_idx--;
33 | }
34 |
35 | // No room for any interesting instructions?
36 | if (end_idx == 0) {
37 |
38 | < prev index next > Frames src/hotspot/share/opto/block.cpp
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/opto/block.cpp.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/opto/block.cpp
6 | < prev index next > Udiff src/hotspot/share/opto/block.cpp
6 | < prev index next > src/hotspot/share/opto/block.cpp
10 | Print this page
11 |
13 |
14 | }
15 |
16 | // Ideal nodes are allowable in empty blocks: skip them Only MachNodes
17 | // turn directly into code, because only MachNodes have non-trivial
18 | // emit() functions.
19 | - while ((end_idx > 0) && !get_node(end_idx)->is_Mach()) {
20 | + while ((end_idx > 0) && !(get_node(end_idx)->is_Mach() || get_node(end_idx)->is_BoxLock())) {
21 | end_idx--;
22 | }
23 |
24 | // No room for any interesting instructions?
25 | if (end_idx == 0) {
26 |
27 | < prev index next > Cdiff src/hotspot/share/opto/buildOopMap.cpp
6 | < prev index next > src/hotspot/share/opto/buildOopMap.cpp
10 | Print this page
11 |
13 |
14 | Node *def = _defs[reg]; // Get reaching def
15 | assert( def, "since live better have reaching def" );
16 |
17 | // Classify the reaching def as oop, derived, callee-save, dead, or other
18 | const Type *t = def->bottom_type();
19 | ! if( t->isa_oop_ptr() ) { // Oop or derived?
20 | assert( !OptoReg::is_valid(_callees[reg]), "oop can't be callee save" );
21 | #ifdef _LP64
22 | // 64-bit pointers record oop-ishness on 2 aligned adjacent registers.
23 | // Make sure both are record from the same reaching def, but do not
24 | // put both into the oopmap.
25 |
26 | Node *def = _defs[reg]; // Get reaching def
27 | assert( def, "since live better have reaching def" );
28 |
29 | // Classify the reaching def as oop, derived, callee-save, dead, or other
30 | const Type *t = def->bottom_type();
31 | ! if( t->isa_oop_ptr() || // Oop or derived?
32 | + (C->do_stack_allocation() && t->isa_rawptr() && def->is_BoxLock())) { // consider stack oops too
33 | assert( !OptoReg::is_valid(_callees[reg]), "oop can't be callee save" );
34 | #ifdef _LP64
35 | // 64-bit pointers record oop-ishness on 2 aligned adjacent registers.
36 | // Make sure both are record from the same reaching def, but do not
37 | // put both into the oopmap.
38 |
39 | < prev index next > Frames src/hotspot/share/opto/buildOopMap.cpp
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/opto/buildOopMap.cpp.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/opto/buildOopMap.cpp
6 | < prev index next > Udiff src/hotspot/share/opto/buildOopMap.cpp
6 | < prev index next > src/hotspot/share/opto/buildOopMap.cpp
10 | Print this page
11 |
13 |
14 | Node *def = _defs[reg]; // Get reaching def
15 | assert( def, "since live better have reaching def" );
16 |
17 | // Classify the reaching def as oop, derived, callee-save, dead, or other
18 | const Type *t = def->bottom_type();
19 | - if( t->isa_oop_ptr() ) { // Oop or derived?
20 | + if( t->isa_oop_ptr() || // Oop or derived?
21 | + (C->do_stack_allocation() && t->isa_rawptr() && def->is_BoxLock())) { // consider stack oops too
22 | assert( !OptoReg::is_valid(_callees[reg]), "oop can't be callee save" );
23 | #ifdef _LP64
24 | // 64-bit pointers record oop-ishness on 2 aligned adjacent registers.
25 | // Make sure both are record from the same reaching def, but do not
26 | // put both into the oopmap.
27 |
28 | < prev index next > Cdiff src/hotspot/share/opto/c2_globals.hpp
6 | < prev index next > src/hotspot/share/opto/c2_globals.hpp
10 | Print this page
11 |
13 |
14 |
15 | \
16 | product(intx, EliminateAllocationArraySizeLimit, 64, \
17 | "Array size (number of elements) limit for scalar replacement") \
18 | range(0, max_jint) \
19 | \
20 | + experimental(bool, UseStackAllocation, false, \
21 | + "Leverage stack allocation to reduce heap pressure") \
22 | + \
23 | + experimental(bool, UseStackAllocationRuntime, false, \
24 | + "Enable the stack allocation runtime code in oopmap") \
25 | + \
26 | + notproduct(bool, PrintStackAllocation, false, \
27 | + "Print stack allocation debug information") \
28 | + \
29 | product(bool, OptimizePtrCompare, true, \
30 | "Use escape analysis to optimize pointers compare") \
31 | \
32 | notproduct(bool, PrintOptimizePtrCompare, false, \
33 | "Print information about optimized pointers compare") \
34 |
35 | < prev index next > Frames src/hotspot/share/opto/c2_globals.hpp
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/opto/c2_globals.hpp.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/opto/c2_globals.hpp
6 | < prev index next > Udiff src/hotspot/share/opto/c2_globals.hpp
6 | < prev index next > src/hotspot/share/opto/c2_globals.hpp
10 | Print this page
11 |
13 |
14 | \
15 | product(intx, EliminateAllocationArraySizeLimit, 64, \
16 | "Array size (number of elements) limit for scalar replacement") \
17 | range(0, max_jint) \
18 | \
19 | + experimental(bool, UseStackAllocation, false, \
20 | + "Leverage stack allocation to reduce heap pressure") \
21 | + \
22 | + experimental(bool, UseStackAllocationRuntime, false, \
23 | + "Enable the stack allocation runtime code in oopmap") \
24 | + \
25 | + notproduct(bool, PrintStackAllocation, false, \
26 | + "Print stack allocation debug information") \
27 | + \
28 | product(bool, OptimizePtrCompare, true, \
29 | "Use escape analysis to optimize pointers compare") \
30 | \
31 | notproduct(bool, PrintOptimizePtrCompare, false, \
32 | "Print information about optimized pointers compare") \
33 |
34 | < prev index next > Frames src/hotspot/share/opto/callnode.cpp
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/opto/callnode.cpp.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/opto/callnode.cpp
6 | < prev index next > Frames src/hotspot/share/opto/callnode.hpp
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/opto/callnode.hpp.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/opto/callnode.hpp
6 | < prev index next > Cdiff src/hotspot/share/opto/compile.cpp
6 | < prev index next > src/hotspot/share/opto/compile.cpp
10 | Print this page
11 |
13 |
14 |
15 | env()->set_oop_recorder(new OopRecorder(env()->arena()));
16 | env()->set_debug_info(new DebugInformationRecorder(env()->oop_recorder()));
17 | env()->set_dependencies(new Dependencies(env()));
18 |
19 | _fixed_slots = 0;
20 | + _stack_allocated_slots = 0;
21 | + set_fail_stack_allocation_with_references(false);
22 | set_has_split_ifs(false);
23 | set_has_loops(has_method() && method()->has_loops()); // first approximation
24 | set_has_stringbuilder(false);
25 | set_has_boxed_value(false);
26 | _trap_can_recompile = false; // no traps emitted yet
27 |
28 | < prev index next > Frames src/hotspot/share/opto/compile.cpp
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/opto/compile.cpp.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/opto/compile.cpp
6 | < prev index next > Udiff src/hotspot/share/opto/compile.cpp
6 | < prev index next > src/hotspot/share/opto/compile.cpp
10 | Print this page
11 |
13 |
14 | env()->set_oop_recorder(new OopRecorder(env()->arena()));
15 | env()->set_debug_info(new DebugInformationRecorder(env()->oop_recorder()));
16 | env()->set_dependencies(new Dependencies(env()));
17 |
18 | _fixed_slots = 0;
19 | + _stack_allocated_slots = 0;
20 | + set_fail_stack_allocation_with_references(false);
21 | set_has_split_ifs(false);
22 | set_has_loops(has_method() && method()->has_loops()); // first approximation
23 | set_has_stringbuilder(false);
24 | set_has_boxed_value(false);
25 | _trap_can_recompile = false; // no traps emitted yet
26 |
27 | < prev index next > Frames src/hotspot/share/opto/compile.hpp
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/opto/compile.hpp.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/opto/compile.hpp
6 | < prev index next > Frames src/hotspot/share/opto/escape.cpp
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/opto/escape.cpp.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/opto/escape.cpp
6 | < prev index next > Frames src/hotspot/share/opto/escape.hpp
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/opto/escape.hpp.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/opto/escape.hpp
6 | < prev index next > &non_escaped_worklist, int non_escaped_length);
37 | +#ifndef PRODUCT
38 | + void print_stack_allocated_candidates(GrowableArray &non_escaped_worklist, int non_escaped_length);
39 | +#endif
40 | +
41 | #ifndef PRODUCT
42 | void dump(GrowableArray& ptnodes_worklist);
43 | +
44 | + bool print_escape_analysis() {
45 | + return PrintEscapeAnalysis || _compile->directive()->PrintEscapeAnalysisOption;
46 | + }
47 | +
48 | + bool print_eliminate_allocations() {
49 | + return PrintEliminateAllocations || _compile->directive()->PrintEliminateAllocationsOption;
50 | + }
51 | +
52 | + bool print_stack_allocation() {
53 | + return PrintStackAllocation || _compile->directive()->PrintStackAllocationOption;
54 | + }
55 | #endif
56 | };
57 |
58 | inline PointsToNode::PointsToNode(ConnectionGraph *CG, Node* n, EscapeState es, NodeType type):
59 | _edges(CG->_compile->comp_arena(), 2, 0, NULL),
60 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/opto/idealKit.cpp.frames.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/opto/idealKit.cpp
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/opto/idealKit.cpp.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/opto/idealKit.cpp
6 | < prev index next > Frames src/hotspot/share/opto/idealKit.hpp
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/opto/idealKit.hpp.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/opto/idealKit.hpp
6 | < prev index next > Cdiff src/hotspot/share/opto/loopnode.cpp
6 | < prev index next > src/hotspot/share/opto/loopnode.cpp
10 | Print this page
11 |
13 |
14 | (n->in(0)->Opcode() == Op_IfFalse &&
15 | (1.0 - iff->as_If()->_prob) >= 0.01) ||
16 | (iff->as_If()->_prob >= 0.01) )
17 | innermost->_has_call = 1;
18 | }
19 | ! } else if( n->is_Allocate() && n->as_Allocate()->_is_scalar_replaceable ) {
20 | // Disable loop optimizations if the loop has a scalar replaceable
21 | // allocation. This disabling may cause a potential performance lost
22 | // if the allocation is not eliminated for some reason.
23 | innermost->_allow_optimizations = false;
24 | innermost->_has_call = 1; // = true
25 |
26 | (n->in(0)->Opcode() == Op_IfFalse &&
27 | (1.0 - iff->as_If()->_prob) >= 0.01) ||
28 | (iff->as_If()->_prob >= 0.01) )
29 | innermost->_has_call = 1;
30 | }
31 | ! } else if( n->is_Allocate() && (n->as_Allocate()->_is_scalar_replaceable || n->as_Allocate()->_is_stack_allocateable) ) {
32 | // Disable loop optimizations if the loop has a scalar replaceable
33 | // allocation. This disabling may cause a potential performance lost
34 | // if the allocation is not eliminated for some reason.
35 | innermost->_allow_optimizations = false;
36 | innermost->_has_call = 1; // = true
37 |
38 | < prev index next > Frames src/hotspot/share/opto/loopnode.cpp
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/opto/loopnode.cpp.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/opto/loopnode.cpp
6 | < prev index next > Udiff src/hotspot/share/opto/loopnode.cpp
6 | < prev index next > src/hotspot/share/opto/loopnode.cpp
10 | Print this page
11 |
13 |
14 | (n->in(0)->Opcode() == Op_IfFalse &&
15 | (1.0 - iff->as_If()->_prob) >= 0.01) ||
16 | (iff->as_If()->_prob >= 0.01) )
17 | innermost->_has_call = 1;
18 | }
19 | - } else if( n->is_Allocate() && n->as_Allocate()->_is_scalar_replaceable ) {
20 | + } else if( n->is_Allocate() && (n->as_Allocate()->_is_scalar_replaceable || n->as_Allocate()->_is_stack_allocateable) ) {
21 | // Disable loop optimizations if the loop has a scalar replaceable
22 | // allocation. This disabling may cause a potential performance lost
23 | // if the allocation is not eliminated for some reason.
24 | innermost->_allow_optimizations = false;
25 | innermost->_has_call = 1; // = true
26 |
27 | < prev index next > Cdiff src/hotspot/share/opto/machnode.hpp
6 | < prev index next > src/hotspot/share/opto/machnode.hpp
10 | Print this page
11 |
13 |
14 | return in(_jvmadj + jvms->locoff() + idx);
15 | }
16 | Node *stack(const JVMState* jvms, uint idx) const {
17 | assert(verify_jvms(jvms), "jvms must match");
18 | return in(_jvmadj + jvms->stkoff() + idx);
19 | ! }
20 | Node *monitor_obj(const JVMState* jvms, uint idx) const {
21 | assert(verify_jvms(jvms), "jvms must match");
22 | return in(_jvmadj + jvms->monitor_obj_offset(idx));
23 | }
24 | Node *monitor_box(const JVMState* jvms, uint idx) const {
25 |
26 | return in(_jvmadj + jvms->locoff() + idx);
27 | }
28 | Node *stack(const JVMState* jvms, uint idx) const {
29 | assert(verify_jvms(jvms), "jvms must match");
30 | return in(_jvmadj + jvms->stkoff() + idx);
31 | ! }
32 | + Node *scalar(const JVMState* jvms, uint idx) const {
33 | + assert(verify_jvms(jvms), "jvms must match");
34 | + return in(_jvmadj + jvms->scloff() + idx);
35 | + }
36 | Node *monitor_obj(const JVMState* jvms, uint idx) const {
37 | assert(verify_jvms(jvms), "jvms must match");
38 | return in(_jvmadj + jvms->monitor_obj_offset(idx));
39 | }
40 | Node *monitor_box(const JVMState* jvms, uint idx) const {
41 |
42 | < prev index next > Frames src/hotspot/share/opto/machnode.hpp
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/opto/machnode.hpp.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/opto/machnode.hpp
6 | < prev index next > Udiff src/hotspot/share/opto/machnode.hpp
6 | < prev index next > src/hotspot/share/opto/machnode.hpp
10 | Print this page
11 |
13 |
14 | return in(_jvmadj + jvms->locoff() + idx);
15 | }
16 | Node *stack(const JVMState* jvms, uint idx) const {
17 | assert(verify_jvms(jvms), "jvms must match");
18 | return in(_jvmadj + jvms->stkoff() + idx);
19 | - }
20 | + }
21 | + Node *scalar(const JVMState* jvms, uint idx) const {
22 | + assert(verify_jvms(jvms), "jvms must match");
23 | + return in(_jvmadj + jvms->scloff() + idx);
24 | + }
25 | Node *monitor_obj(const JVMState* jvms, uint idx) const {
26 | assert(verify_jvms(jvms), "jvms must match");
27 | return in(_jvmadj + jvms->monitor_obj_offset(idx));
28 | }
29 | Node *monitor_box(const JVMState* jvms, uint idx) const {
30 |
31 | < prev index next > Frames src/hotspot/share/opto/macro.cpp
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/opto/macro.cpp.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/opto/macro.cpp
6 | < prev index next > Frames src/hotspot/share/opto/macro.hpp
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/opto/macro.hpp.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/opto/macro.hpp
6 | < prev index next > Frames src/hotspot/share/opto/memnode.cpp
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/opto/memnode.cpp.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/opto/memnode.cpp
6 | < prev index next > Udiff src/hotspot/share/opto/memnode.cpp
6 | < prev index next > src/hotspot/share/opto/memnode.cpp
10 | Print this page
11 |
13 |
14 | result = proj_in->in(TypeFunc::Memory);
15 | } else {
16 | assert(false, "unexpected projection");
17 | }
18 | } else if (result->is_ClearArray()) {
19 | - if (!is_instance || !ClearArrayNode::step_through(&result, instance_id, phase)) {
20 | + intptr_t offset;
21 | + AllocateNode* alloc = AllocateNode::Ideal_allocation(result->in(3), phase, offset);
22 | +
23 | + if (!is_instance || (alloc == NULL) || !ClearArrayNode::step_through(&result, instance_id, phase)) {
24 | // Can not bypass initialization of the instance
25 | // we are looking for.
26 | break;
27 | }
28 | // Otherwise skip it (the call updated 'result' value).
29 |
30 |
32 |
33 | break;
34 | }
35 | mem = mem->in(0)->in(TypeFunc::Memory);
36 | continue; // (a) advance through independent MemBar memory
37 | } else if (mem->is_ClearArray()) {
38 | - if (ClearArrayNode::step_through(&mem, (uint)addr_t->instance_id(), phase)) {
39 | + intptr_t offset;
40 | + AllocateNode* alloc = AllocateNode::Ideal_allocation(mem->in(3), phase, offset);
41 | +
42 | + if ((alloc != NULL) && ClearArrayNode::step_through(&mem, (uint)addr_t->instance_id(), phase)) {
43 | // (the call updated 'mem' value)
44 | continue; // (a) advance through independent allocation memory
45 | } else {
46 | // Can not bypass initialization of the instance
47 | // we are looking for.
48 |
49 | < prev index next > Frames src/hotspot/share/opto/output.cpp
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/opto/output.cpp.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/opto/output.cpp
6 | < prev index next > Frames src/hotspot/share/runtime/deoptimization.cpp
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/runtime/deoptimization.cpp.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/runtime/deoptimization.cpp
6 | < prev index next > Frames src/hotspot/share/runtime/deoptimization.hpp
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/runtime/deoptimization.hpp.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/runtime/deoptimization.hpp
6 | < prev index next > * objects, TRAPS);
10 | - static void reassign_type_array_elements(frame* fr, RegisterMap* reg_map, ObjectValue* sv, typeArrayOop obj, BasicType type);
11 | - static void reassign_object_array_elements(frame* fr, RegisterMap* reg_map, ObjectValue* sv, objArrayOop obj);
12 | + static void reassign_stack_allocated_fields(frame *fr, GrowableArray* objects, ObjectValue *sv, Handle obj, Klass* k);
13 | + static void reassign_stack_allocated_type_array_elements(oop orig, oop newly_allocated, Klass *k);
14 | + static void reassign_stack_allocated_object_array_elements(oop orig, oop newly_allocated, intptr_t *sp_base, intptr_t *sp_top, GrowableArray* objects);
15 | + static void reassign_scalar_replaced_fields(frame *fr, RegisterMap *reg_map, GrowableArray* objects, ObjectValue *sv, Handle obj, Klass* k, bool skip_internal);
16 | + static void reassign_scalar_replaced_type_array_elements(frame* fr, RegisterMap* reg_map, ObjectValue* sv, typeArrayOop obj, BasicType type);
17 | + static void reassign_scalar_replaced_object_array_elements(frame* fr, RegisterMap* reg_map, GrowableArray* objects, ObjectValue* sv, objArrayOop obj);
18 | + static ScopeValue *get_scope_value(frame* fr, RegisterMap* reg_map, ScopeValue* sv, GrowableArray* objects);
19 | + static ScopeValue *match_object_to_stack_oop(intptr_t *oop_ptr, intptr_t *sp_base, GrowableArray* objects);
20 | + static void reassign_scalar_replaced_fields_by_klass(InstanceKlass* klass, frame* fr, RegisterMap* reg_map, GrowableArray* objects, ObjectValue* sv, int svIndex, oop obj, bool skip_internal);
21 | static void reassign_fields(frame* fr, RegisterMap* reg_map, GrowableArray* objects, bool realloc_failures, bool skip_internal);
22 | static void relock_objects(GrowableArray* monitors, JavaThread* thread, bool realloc_failures);
23 | static void pop_frames_failed_reallocs(JavaThread* thread, vframeArray* array);
24 | NOT_PRODUCT(static void print_objects(GrowableArray* objects, bool realloc_failures);)
25 | #endif // COMPILER2_OR_JVMCI
26 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/runtime/vframe_hp.cpp.frames.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/runtime/vframe_hp.cpp
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/runtime/vframe_hp.cpp.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/runtime/vframe_hp.cpp
6 | < prev index next > Cdiff src/hotspot/share/runtime/vframe_hp.hpp
6 | < prev index next > src/hotspot/share/runtime/vframe_hp.hpp
10 | Print this page
11 |
13 |
14 |
15 | compiledVFrame* at_scope(int decode_offset, int vframe_id);
16 |
17 | // Returns SynchronizationEntryBCI or bci() (used for synchronization)
18 | int raw_bci() const;
19 |
20 | + // Used by stack allocation to match a stack oop to a described stack allocated object
21 | + ScopeValue *match_object_to_stack_oop(intptr_t *oop_ptr, intptr_t *sp_base, GrowableArray<ScopeValue*>* objects) const;
22 | +
23 | protected:
24 | ScopeDesc* _scope;
25 | int _vframe_id;
26 |
27 | //StackValue resolve(ScopeValue* sv) const;
28 | BasicLock* resolve_monitor_lock(Location location) const;
29 | StackValue *create_stack_value(ScopeValue *sv) const;
30 | + ScopeValue *get_scope_value(GrowableArray<ScopeValue*>* scv_list, int index, GrowableArray<ScopeValue*>* objects) const;
31 |
32 | private:
33 | compiledVFrame(const frame* fr, const RegisterMap* reg_map, JavaThread* thread, ScopeDesc* scope, int vframe_id);
34 |
35 | #ifndef PRODUCT
36 |
37 | < prev index next > Frames src/hotspot/share/runtime/vframe_hp.hpp
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/runtime/vframe_hp.hpp.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/hotspot/share/runtime/vframe_hp.hpp
6 | < prev index next > * objects) const;
12 | +
13 | protected:
14 | ScopeDesc* _scope;
15 | int _vframe_id;
16 |
17 | //StackValue resolve(ScopeValue* sv) const;
18 | BasicLock* resolve_monitor_lock(Location location) const;
19 | StackValue *create_stack_value(ScopeValue *sv) const;
20 | + ScopeValue *get_scope_value(GrowableArray* scv_list, int index, GrowableArray* objects) const;
21 |
22 | private:
23 | compiledVFrame(const frame* fr, const RegisterMap* reg_map, JavaThread* thread, ScopeDesc* scope, int vframe_id);
24 |
25 | #ifndef PRODUCT
26 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/hotspot/share/runtime/vframe_hp.hpp.udiff.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Udiff src/hotspot/share/runtime/vframe_hp.hpp
6 | < prev index next > src/hotspot/share/runtime/vframe_hp.hpp
10 | Print this page
11 |
13 |
14 | compiledVFrame* at_scope(int decode_offset, int vframe_id);
15 |
16 | // Returns SynchronizationEntryBCI or bci() (used for synchronization)
17 | int raw_bci() const;
18 |
19 | + // Used by stack allocation to match a stack oop to a described stack allocated object
20 | + ScopeValue *match_object_to_stack_oop(intptr_t *oop_ptr, intptr_t *sp_base, GrowableArray<ScopeValue*>* objects) const;
21 | +
22 | protected:
23 | ScopeDesc* _scope;
24 | int _vframe_id;
25 |
26 | //StackValue resolve(ScopeValue* sv) const;
27 | BasicLock* resolve_monitor_lock(Location location) const;
28 | StackValue *create_stack_value(ScopeValue *sv) const;
29 | + ScopeValue *get_scope_value(GrowableArray<ScopeValue*>* scv_list, int index, GrowableArray<ScopeValue*>* objects) const;
30 |
31 | private:
32 | compiledVFrame(const frame* fr, const RegisterMap* reg_map, JavaThread* thread, ScopeDesc* scope, int vframe_id);
33 |
34 | #ifndef PRODUCT
35 |
36 | < prev index next > Cdiff src/java.base/share/classes/java/util/ArrayList.java
6 | < prev index next > src/java.base/share/classes/java/util/ArrayList.java
10 | Print this page
11 |
13 |
14 | int newCapacity = ArraysSupport.newLength(oldCapacity,
15 | minCapacity - oldCapacity, /* minimum growth */
16 | oldCapacity >> 1 /* preferred growth */);
17 | return elementData = Arrays.copyOf(elementData, newCapacity);
18 | } else {
19 | ! return elementData = new Object[Math.max(DEFAULT_CAPACITY, minCapacity)];
20 | ! }
21 | }
22 |
23 | private Object[] grow() {
24 | return grow(size + 1);
25 | }
26 |
27 | int newCapacity = ArraysSupport.newLength(oldCapacity,
28 | minCapacity - oldCapacity, /* minimum growth */
29 | oldCapacity >> 1 /* preferred growth */);
30 | return elementData = Arrays.copyOf(elementData, newCapacity);
31 | } else {
32 | ! if (DEFAULT_CAPACITY > minCapacity) {
33 | ! return elementData = new Object[DEFAULT_CAPACITY];
34 | + }
35 | + return elementData = new Object[minCapacity];
36 | + }
37 | }
38 |
39 | private Object[] grow() {
40 | return grow(size + 1);
41 | }
42 |
43 | < prev index next > Frames src/java.base/share/classes/java/util/ArrayList.java
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/java.base/share/classes/java/util/ArrayList.java.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/java.base/share/classes/java/util/ArrayList.java
6 | < prev index next > Udiff src/java.base/share/classes/java/util/ArrayList.java
6 | < prev index next > src/java.base/share/classes/java/util/ArrayList.java
10 | Print this page
11 |
13 |
14 | int newCapacity = ArraysSupport.newLength(oldCapacity,
15 | minCapacity - oldCapacity, /* minimum growth */
16 | oldCapacity >> 1 /* preferred growth */);
17 | return elementData = Arrays.copyOf(elementData, newCapacity);
18 | } else {
19 | - return elementData = new Object[Math.max(DEFAULT_CAPACITY, minCapacity)];
20 | - }
21 | + if (DEFAULT_CAPACITY > minCapacity) {
22 | + return elementData = new Object[DEFAULT_CAPACITY];
23 | + }
24 | + return elementData = new Object[minCapacity];
25 | + }
26 | }
27 |
28 | private Object[] grow() {
29 | return grow(size + 1);
30 | }
31 |
32 | < prev index next > Cdiff src/java.base/share/classes/java/util/regex/Matcher.java
6 | < prev index next >src/java.base/share/classes/java/util/regex/Matcher.java
10 | Print this page
11 |
13 |
14 | Matcher(Pattern parent, CharSequence text) {
15 | this.parentPattern = parent;
16 | this.text = text;
17 |
18 | // Allocate state storage
19 | ! int parentGroupCount = Math.max(parent.capturingGroupCount, 10);
20 | ! groups = new int[parentGroupCount * 2];
21 | locals = new int[parent.localCount];
22 | localsPos = new IntHashSet[parent.localTCNCount];
23 |
24 | // Put fields into initial states
25 | reset();
26 |
27 | Matcher(Pattern parent, CharSequence text) {
28 | this.parentPattern = parent;
29 | this.text = text;
30 |
31 | // Allocate state storage
32 | ! if (parent.capturingGroupCount > 10) {
33 | ! groups = new int[parent.capturingGroupCount * 2];
34 | + } else {
35 | + groups = new int[20];
36 | + }
37 | locals = new int[parent.localCount];
38 | localsPos = new IntHashSet[parent.localTCNCount];
39 |
40 | // Put fields into initial states
41 | reset();
42 |
43 | < prev index next >Frames src/java.base/share/classes/java/util/regex/Matcher.java
6 |
9 |
10 |
13 |
14 |
17 |
18 |
--------------------------------------------------------------------------------
/stack_allocation/webrev/src/java.base/share/classes/java/util/regex/Matcher.java.frames.prev_next.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Frames src/java.base/share/classes/java/util/regex/Matcher.java
6 | < prev index next >Udiff src/java.base/share/classes/java/util/regex/Matcher.java
6 | < prev index next >src/java.base/share/classes/java/util/regex/Matcher.java
10 | Print this page
11 |
13 |
14 | Matcher(Pattern parent, CharSequence text) {
15 | this.parentPattern = parent;
16 | this.text = text;
17 |
18 | // Allocate state storage
19 | - int parentGroupCount = Math.max(parent.capturingGroupCount, 10);
20 | - groups = new int[parentGroupCount * 2];
21 | + if (parent.capturingGroupCount > 10) {
22 | + groups = new int[parent.capturingGroupCount * 2];
23 | + } else {
24 | + groups = new int[20];
25 | + }
26 | locals = new int[parent.localCount];
27 | localsPos = new IntHashSet[parent.localTCNCount];
28 |
29 | // Put fields into initial states
30 | reset();
31 |
32 | < prev index next >