Merge
This commit is contained in:
commit
0adcfb6712
@ -185,3 +185,4 @@ e07f499b9dccb529ecf74172cf6ac11a195ec57a jdk8-b60
|
||||
20ff117b509075c3aec4ee3a57990ecd5db5df9c jdk8-b61
|
||||
8a3fe0ae06a8cc21347da5a18384b0aa6c2349f5 jdk8-b62
|
||||
3229597524cab4239325bc3602df6c486397a511 jdk8-b63
|
||||
1c8370a55b305d35353346202bde042ba9e8a9fd jdk8-b64
|
||||
|
File diff suppressed because it is too large
Load Diff
@ -253,5 +253,24 @@ AC_DEFUN_ONCE([SRCDIRS_SETUP_OUTPUT_DIRS],
|
||||
BUILD_OUTPUT="$OUTPUT_ROOT"
|
||||
AC_SUBST(BUILD_OUTPUT)
|
||||
|
||||
HOTSPOT_DIST="$OUTPUT_ROOT/hotspot/dist"
|
||||
BUILD_HOTSPOT=true
|
||||
AC_SUBST(HOTSPOT_DIST)
|
||||
AC_SUBST(BUILD_HOTSPOT)
|
||||
AC_ARG_WITH(import-hotspot, [AS_HELP_STRING([--with-import-hotspot],
|
||||
[import hotspot binaries from this jdk image or hotspot build dist dir instead of building from source])])
|
||||
if test "x$with_import_hotspot" != x; then
|
||||
CURDIR="$PWD"
|
||||
cd "$with_import_hotspot"
|
||||
HOTSPOT_DIST="`pwd`"
|
||||
cd "$CURDIR"
|
||||
if ! (test -d $HOTSPOT_DIST/lib && test -d $HOTSPOT_DIST/jre/lib); then
|
||||
AC_MSG_ERROR([You have to import hotspot from a full jdk image or hotspot build dist dir!])
|
||||
fi
|
||||
AC_MSG_CHECKING([if hotspot should be imported])
|
||||
AC_MSG_RESULT([yes from $HOTSPOT_DIST])
|
||||
BUILD_HOTSPOT=false
|
||||
fi
|
||||
|
||||
JDK_OUTPUTDIR="$OUTPUT_ROOT/jdk"
|
||||
])
|
||||
|
@ -224,7 +224,9 @@ LANGTOOLS_DIST=$(LANGTOOLS_OUTPUTDIR)/dist
|
||||
CORBA_DIST=$(CORBA_OUTPUTDIR)/dist
|
||||
JAXP_DIST=$(JAXP_OUTPUTDIR)/dist
|
||||
JAXWS_DIST=$(JAXWS_OUTPUTDIR)/dist
|
||||
HOTSPOT_DIST=$(HOTSPOT_OUTPUTDIR)/dist
|
||||
HOTSPOT_DIST=@HOTSPOT_DIST@
|
||||
|
||||
BUILD_HOTSPOT=@BUILD_HOTSPOT@
|
||||
|
||||
# The boot jdk to use
|
||||
BOOT_JDK:=@BOOT_JDK@
|
||||
@ -244,12 +246,6 @@ ENABLE_SJAVAC:=@ENABLE_SJAVAC@
|
||||
# Store sjavac server synchronization files here, and
|
||||
# the sjavac server log files.
|
||||
SJAVAC_SERVER_DIR:=@SJAVAC_SERVER_DIR@
|
||||
# We can block the Javac server to never use more cores than this.
|
||||
# This is not for performance reasons, but for memory usage, since each
|
||||
# core requires its own JavaCompiler. We might have 64 cores and 4GB
|
||||
# of memory, 64 JavaCompilers will currently not fit in a 3GB heap.
|
||||
# Since there is no sharing of data between the JavaCompilers.
|
||||
SJAVAC_SERVER_CORES:=@SJAVAC_SERVER_CORES@
|
||||
|
||||
# The OpenJDK makefiles should be changed to using the standard
|
||||
# configure output ..._CFLAGS and ..._LIBS. In the meantime we
|
||||
@ -494,7 +490,14 @@ FIXPATH:=@FIXPATH@
|
||||
# Where the build output is stored for your convenience.
|
||||
BUILD_LOG:=@BUILD_LOG@
|
||||
BUILD_LOG_PREVIOUS:=@BUILD_LOG_PREVIOUS@
|
||||
BUILD_LOG_WRAPPER:=@BUILD_LOG_WRAPPER@
|
||||
# Disable the build log wrapper on sjavac+winapi until
|
||||
# we have solved how to prevent the log wrapper to wait
|
||||
# for the background sjavac server process.
|
||||
ifeq (@ENABLE_SJAVAC@X@OPENJDK_BUILD_OS_API@,yesXwinapi)
|
||||
BUILD_LOG_WRAPPER:=
|
||||
else
|
||||
BUILD_LOG_WRAPPER:=@BUILD_LOG_WRAPPER@
|
||||
endif
|
||||
|
||||
# Build setup
|
||||
ENABLE_JFR=@ENABLE_JFR@
|
||||
|
@ -111,7 +111,7 @@ define SetupArchive
|
||||
ifeq ($$(word 20,$$($1_GREP_INCLUDE_PATTERNS)),)
|
||||
$1_GREP_INCLUDES:=| $(GREP) $$(patsubst %,$(SPACE)-e$(SPACE)$(DQUOTE)%$(DQUOTE),$$($1_GREP_INCLUDE_PATTERNS))
|
||||
else
|
||||
$$(shell $(RM) $$($1_BIN)/_the.$$($1_JARNAME)_include)
|
||||
$$(shell $(MKDIR) -p $$($1_BIN) && $(RM) $$($1_BIN)/_the.$$($1_JARNAME)_include)
|
||||
$$(eval $$(call ListPathsSafelyNow,$1_GREP_INCLUDE_PATTERNS,\n, \
|
||||
>> $$($1_BIN)/_the.$$($1_JARNAME)_include))
|
||||
$1_GREP_INCLUDES:=| $(GREP) -f $$($1_BIN)/_the.$$($1_JARNAME)_include
|
||||
@ -124,7 +124,7 @@ define SetupArchive
|
||||
ifeq ($$(word 20,$$($1_GREP_EXCLUDE_PATTERNS)),)
|
||||
$1_GREP_EXCLUDES:=| $(GREP) -v $$(patsubst %,$(SPACE)-e$(SPACE)$(DQUOTE)%$(DQUOTE),$$($1_GREP_EXCLUDE_PATTERNS))
|
||||
else
|
||||
$$(shell $(RM) $$($1_BIN)/_the.$$($1_JARNAME)_exclude)
|
||||
$$(shell $(MKDIR) -p $$($1_BIN) && $(RM) $$($1_BIN)/_the.$$($1_JARNAME)_exclude)
|
||||
$$(eval $$(call ListPathsSafelyNow,$1_GREP_EXCLUDE_PATTERNS,\n, \
|
||||
>> $$($1_BIN)/_the.$$($1_JARNAME)_exclude))
|
||||
$1_GREP_EXCLUDES:=| $(GREP) -v -f $$($1_BIN)/_the.$$($1_JARNAME)_exclude
|
||||
@ -170,9 +170,10 @@ define SetupArchive
|
||||
# tells us what to remove from the jar-file.
|
||||
$1_CAPTURE_DELETES=$$(foreach src,$$($1_SRCS),($(FIND) $$(src) -name _the.package.deleted -newer $$@ -exec $(SED) 's|$$(src)||g' \{\} >> $$($1_DELETES_FILE) \;) $$(NEWLINE))
|
||||
# The update contents macro updates the jar file with the previously capture contents.
|
||||
# xargs is used to trim the whitespace from the contents file, to see if it is empty.
|
||||
$1_UPDATE_CONTENTS=$$(foreach src,$$($1_SRCS),\
|
||||
(cd $$(src) && \
|
||||
if [ -s _the.$$($1_JARNAME)_contents ]; then \
|
||||
if [ -n "`$(CAT) _the.$$($1_JARNAME)_contents | $(XARGS)`" ]; then \
|
||||
$(ECHO) " updating" `$(WC) -l _the.$$($1_JARNAME)_contents | $(AWK) '{ print $$$$1 }'` files && \
|
||||
$(JAR) $$($1_JAR_UPDATE_OPTIONS) $$@ @_the.$$($1_JARNAME)_contents; \
|
||||
fi) $$(NEWLINE))
|
||||
|
@ -94,11 +94,13 @@ jaxws-only: start-make
|
||||
@($(CD) $(JAXWS_TOPDIR)/makefiles && $(BUILD_LOG_WRAPPER) $(MAKE) $(MAKE_ARGS) -f BuildJaxws.gmk)
|
||||
@$(call TargetExit)
|
||||
|
||||
ifeq ($(BUILD_HOTSPOT),true)
|
||||
hotspot: hotspot-only
|
||||
hotspot-only: start-make
|
||||
@$(call TargetEnter)
|
||||
@($(CD) $(SRC_ROOT)/common/makefiles && $(BUILD_LOG_WRAPPER) $(MAKE) $(MAKE_ARGS) -f HotspotWrapper.gmk)
|
||||
@$(call TargetExit)
|
||||
endif
|
||||
|
||||
jdk: langtools hotspot corba jaxp jaxws jdk-only
|
||||
jdk-only: start-make
|
||||
|
@ -157,7 +157,7 @@ endef
|
||||
|
||||
# Hook to be called as the very last thing for targets that are "top level" targets
|
||||
define AtMakeEnd
|
||||
$(if $(SJAVAC_SERVER_DIR),@$(RM) -rf $(SJAVAC_SERVER_DIR)/*.port)
|
||||
[ -f $(SJAVAC_SERVER_DIR)/server.port ] && echo Stopping sjavac server && $(TOUCH) $(SJAVAC_SERVER_DIR)/server.port.stop; true
|
||||
$(call StopGlobalTimer)
|
||||
$(call ReportBuildTimes)
|
||||
@$(PRINTF) "Finished building $(PRODUCT_NAME) for target '$(call GetRealTarget)'\n"
|
||||
@ -174,8 +174,8 @@ endef
|
||||
define ParseLogLevel
|
||||
ifeq ($$(origin VERBOSE),undefined)
|
||||
# Setup logging according to LOG (but only if VERBOSE is not given)
|
||||
|
||||
# If the "nofile" argument is given, act on it and strip it away
|
||||
|
||||
# If the "nofile" argument is given, act on it and strip it away
|
||||
ifneq ($$(findstring nofile,$$(LOG)),)
|
||||
# Reset the build log wrapper, regardless of other values
|
||||
override BUILD_LOG_WRAPPER=
|
||||
|
@ -185,3 +185,4 @@ d54dc53e223ed9ce7d5f4d2cd02ad9d5def3c2db jdk8-b59
|
||||
0e08ba7648fb3faa0986cb217887d7c4990977f3 jdk8-b61
|
||||
08afb9c6f44f11c3595b01fd0985db64b29834dd jdk8-b62
|
||||
6ccbf67b68bfed1ab9c44ab8748a5bdc7df33506 jdk8-b63
|
||||
54d599a5b4aad83c235d590652fc81f41c2824fb jdk8-b64
|
||||
|
@ -291,3 +291,5 @@ dccd40de8db1fa96f186e6179907818d75320440 jdk8-b62
|
||||
dc16fe422c535ecd4e9f80fb814a1bb9704da6f5 hs25-b07
|
||||
acabb5c282f59be7e3238920b2ea06b684ab68f7 jdk8-b63
|
||||
8cb93eadfb6dcab88d91b8e2cd3e0e07d0ac4048 hs25-b08
|
||||
5920f72e799c8133d1066c4a62fa1fafcb729966 jdk8-b64
|
||||
b4ee7b773144a88af8b6b92e4384dea82cb948d8 hs25-b09
|
||||
|
@ -121,7 +121,7 @@ public class ConstantPool extends Metadata implements ClassConstants {
|
||||
Address addr = cache.getValue(getAddress());
|
||||
return (ConstantPoolCache) VMObjectFactory.newObject(ConstantPoolCache.class, addr);
|
||||
}
|
||||
public Klass getPoolHolder() { return (Klass) poolHolder.getValue(this); }
|
||||
public InstanceKlass getPoolHolder() { return (InstanceKlass)poolHolder.getValue(this); }
|
||||
public int getLength() { return (int)length.getValue(getAddress()); }
|
||||
public Oop getResolvedReferences() {
|
||||
Address handle = resolvedReferences.getValue(getAddress());
|
||||
|
@ -177,7 +177,7 @@ public class Method extends Metadata {
|
||||
bci. It is required that there is currently a bytecode at this
|
||||
bci. */
|
||||
public int getOrigBytecodeAt(int bci) {
|
||||
BreakpointInfo bp = ((InstanceKlass) getMethodHolder()).getBreakpoints();
|
||||
BreakpointInfo bp = getMethodHolder().getBreakpoints();
|
||||
for (; bp != null; bp = bp.getNext()) {
|
||||
if (bp.match(this, bci)) {
|
||||
return bp.getOrigBytecode();
|
||||
@ -238,7 +238,7 @@ public class Method extends Metadata {
|
||||
}
|
||||
|
||||
// Method holder (the Klass holding this method)
|
||||
public Klass getMethodHolder() { return getConstants().getPoolHolder(); }
|
||||
public InstanceKlass getMethodHolder() { return getConstants().getPoolHolder(); }
|
||||
|
||||
// Access flags
|
||||
public boolean isPublic() { return getAccessFlagsObj().isPublic(); }
|
||||
|
@ -35,7 +35,7 @@ HOTSPOT_VM_COPYRIGHT=Copyright 2012
|
||||
|
||||
HS_MAJOR_VER=25
|
||||
HS_MINOR_VER=0
|
||||
HS_BUILD_NUMBER=08
|
||||
HS_BUILD_NUMBER=09
|
||||
|
||||
JDK_MAJOR_VER=1
|
||||
JDK_MINOR_VER=8
|
||||
|
@ -170,68 +170,70 @@ ifeq ($(JDK6_OR_EARLIER),0)
|
||||
# overridden in some situations, e.g., a BUILD_FLAVOR != product
|
||||
# build.
|
||||
|
||||
ifeq ($(BUILD_FLAVOR), product)
|
||||
FULL_DEBUG_SYMBOLS ?= 1
|
||||
ENABLE_FULL_DEBUG_SYMBOLS = $(FULL_DEBUG_SYMBOLS)
|
||||
else
|
||||
# debug variants always get Full Debug Symbols (if available)
|
||||
ENABLE_FULL_DEBUG_SYMBOLS = 1
|
||||
endif
|
||||
_JUNK_ := $(shell \
|
||||
echo >&2 "INFO: ENABLE_FULL_DEBUG_SYMBOLS=$(ENABLE_FULL_DEBUG_SYMBOLS)")
|
||||
# since objcopy is optional, we set ZIP_DEBUGINFO_FILES later
|
||||
|
||||
ifeq ($(ENABLE_FULL_DEBUG_SYMBOLS),1)
|
||||
# Default OBJCOPY comes from GNU Binutils on Linux:
|
||||
DEF_OBJCOPY=/usr/bin/objcopy
|
||||
ifdef CROSS_COMPILE_ARCH
|
||||
# don't try to generate .debuginfo files when cross compiling
|
||||
_JUNK_ := $(shell \
|
||||
echo >&2 "INFO: cross compiling for ARCH $(CROSS_COMPILE_ARCH)," \
|
||||
"skipping .debuginfo generation.")
|
||||
OBJCOPY=
|
||||
# Due to the multiple sub-make processes that occur this logic gets
|
||||
# executed multiple times. We reduce the noise by at least checking that
|
||||
# BUILD_FLAVOR has been set.
|
||||
ifneq ($(BUILD_FLAVOR),)
|
||||
ifeq ($(BUILD_FLAVOR), product)
|
||||
FULL_DEBUG_SYMBOLS ?= 1
|
||||
ENABLE_FULL_DEBUG_SYMBOLS = $(FULL_DEBUG_SYMBOLS)
|
||||
else
|
||||
# debug variants always get Full Debug Symbols (if available)
|
||||
ENABLE_FULL_DEBUG_SYMBOLS = 1
|
||||
endif
|
||||
_JUNK_ := $(shell \
|
||||
echo >&2 "INFO: ENABLE_FULL_DEBUG_SYMBOLS=$(ENABLE_FULL_DEBUG_SYMBOLS)")
|
||||
# since objcopy is optional, we set ZIP_DEBUGINFO_FILES later
|
||||
|
||||
ifeq ($(ENABLE_FULL_DEBUG_SYMBOLS),1)
|
||||
# Default OBJCOPY comes from GNU Binutils on Linux
|
||||
ifeq ($(CROSS_COMPILE_ARCH),)
|
||||
DEF_OBJCOPY=/usr/bin/objcopy
|
||||
else
|
||||
# Assume objcopy is part of the cross-compilation toolset
|
||||
ifneq ($(ALT_COMPILER_PATH),)
|
||||
DEF_OBJCOPY=$(ALT_COMPILER_PATH)/objcopy
|
||||
endif
|
||||
endif
|
||||
OBJCOPY=$(shell test -x $(DEF_OBJCOPY) && echo $(DEF_OBJCOPY))
|
||||
ifneq ($(ALT_OBJCOPY),)
|
||||
_JUNK_ := $(shell echo >&2 "INFO: ALT_OBJCOPY=$(ALT_OBJCOPY)")
|
||||
OBJCOPY=$(shell test -x $(ALT_OBJCOPY) && echo $(ALT_OBJCOPY))
|
||||
endif
|
||||
endif
|
||||
else
|
||||
OBJCOPY=
|
||||
endif
|
||||
|
||||
ifeq ($(OBJCOPY),)
|
||||
_JUNK_ := $(shell \
|
||||
echo >&2 "INFO: no objcopy cmd found so cannot create .debuginfo files.")
|
||||
ENABLE_FULL_DEBUG_SYMBOLS=0
|
||||
_JUNK_ := $(shell \
|
||||
echo >&2 "INFO: ENABLE_FULL_DEBUG_SYMBOLS=$(ENABLE_FULL_DEBUG_SYMBOLS)")
|
||||
else
|
||||
_JUNK_ := $(shell \
|
||||
echo >&2 "INFO: $(OBJCOPY) cmd found so will create .debuginfo files.")
|
||||
ifeq ($(OBJCOPY),)
|
||||
_JUNK_ := $(shell \
|
||||
echo >&2 "INFO: no objcopy cmd found so cannot create .debuginfo files. You may need to set ALT_OBJCOPY.")
|
||||
ENABLE_FULL_DEBUG_SYMBOLS=0
|
||||
_JUNK_ := $(shell \
|
||||
echo >&2 "INFO: ENABLE_FULL_DEBUG_SYMBOLS=$(ENABLE_FULL_DEBUG_SYMBOLS)")
|
||||
else
|
||||
_JUNK_ := $(shell \
|
||||
echo >&2 "INFO: $(OBJCOPY) cmd found so will create .debuginfo files.")
|
||||
|
||||
# Library stripping policies for .debuginfo configs:
|
||||
# all_strip - strips everything from the library
|
||||
# min_strip - strips most stuff from the library; leaves minimum symbols
|
||||
# no_strip - does not strip the library at all
|
||||
#
|
||||
# Oracle security policy requires "all_strip". A waiver was granted on
|
||||
# 2011.09.01 that permits using "min_strip" in the Java JDK and Java JRE.
|
||||
#
|
||||
# Currently, STRIP_POLICY is only used when Full Debug Symbols is enabled.
|
||||
#
|
||||
STRIP_POLICY ?= min_strip
|
||||
# Library stripping policies for .debuginfo configs:
|
||||
# all_strip - strips everything from the library
|
||||
# min_strip - strips most stuff from the library; leaves minimum symbols
|
||||
# no_strip - does not strip the library at all
|
||||
#
|
||||
# Oracle security policy requires "all_strip". A waiver was granted on
|
||||
# 2011.09.01 that permits using "min_strip" in the Java JDK and Java JRE.
|
||||
#
|
||||
# Currently, STRIP_POLICY is only used when Full Debug Symbols is enabled.
|
||||
#
|
||||
STRIP_POLICY ?= min_strip
|
||||
|
||||
_JUNK_ := $(shell \
|
||||
echo >&2 "INFO: STRIP_POLICY=$(STRIP_POLICY)")
|
||||
_JUNK_ := $(shell \
|
||||
echo >&2 "INFO: STRIP_POLICY=$(STRIP_POLICY)")
|
||||
|
||||
ZIP_DEBUGINFO_FILES ?= 1
|
||||
ZIP_DEBUGINFO_FILES ?= 1
|
||||
|
||||
_JUNK_ := $(shell \
|
||||
echo >&2 "INFO: ZIP_DEBUGINFO_FILES=$(ZIP_DEBUGINFO_FILES)")
|
||||
endif
|
||||
endif
|
||||
_JUNK_ := $(shell \
|
||||
echo >&2 "INFO: ZIP_DEBUGINFO_FILES=$(ZIP_DEBUGINFO_FILES)")
|
||||
endif
|
||||
endif # ENABLE_FULL_DEBUG_SYMBOLS=1
|
||||
endif # BUILD_FLAVOR
|
||||
endif # JDK_6_OR_EARLIER
|
||||
|
||||
JDK_INCLUDE_SUBDIR=linux
|
||||
|
||||
|
@ -336,24 +336,23 @@ $(LIBJVM): $(LIBJVM.o) $(LIBJVM_MAPFILE) $(LD_SCRIPT)
|
||||
fi \
|
||||
fi \
|
||||
}
|
||||
ifeq ($(CROSS_COMPILE_ARCH),)
|
||||
ifeq ($(ENABLE_FULL_DEBUG_SYMBOLS),1)
|
||||
|
||||
ifeq ($(ENABLE_FULL_DEBUG_SYMBOLS),1)
|
||||
$(QUIETLY) $(OBJCOPY) --only-keep-debug $@ $(LIBJVM_DEBUGINFO)
|
||||
$(QUIETLY) $(OBJCOPY) --add-gnu-debuglink=$(LIBJVM_DEBUGINFO) $@
|
||||
ifeq ($(STRIP_POLICY),all_strip)
|
||||
ifeq ($(STRIP_POLICY),all_strip)
|
||||
$(QUIETLY) $(STRIP) $@
|
||||
else
|
||||
ifeq ($(STRIP_POLICY),min_strip)
|
||||
else
|
||||
ifeq ($(STRIP_POLICY),min_strip)
|
||||
$(QUIETLY) $(STRIP) -g $@
|
||||
# implied else here is no stripping at all
|
||||
endif
|
||||
# implied else here is no stripping at all
|
||||
endif
|
||||
endif
|
||||
$(QUIETLY) [ -f $(LIBJVM_G_DEBUGINFO) ] || ln -s $(LIBJVM_DEBUGINFO) $(LIBJVM_G_DEBUGINFO)
|
||||
ifeq ($(ZIP_DEBUGINFO_FILES),1)
|
||||
ifeq ($(ZIP_DEBUGINFO_FILES),1)
|
||||
$(ZIPEXE) -q -y $(LIBJVM_DIZ) $(LIBJVM_DEBUGINFO) $(LIBJVM_G_DEBUGINFO)
|
||||
$(RM) $(LIBJVM_DEBUGINFO) $(LIBJVM_G_DEBUGINFO)
|
||||
[ -f $(LIBJVM_G_DIZ) ] || { ln -s $(LIBJVM_DIZ) $(LIBJVM_G_DIZ); }
|
||||
endif
|
||||
endif
|
||||
endif
|
||||
|
||||
|
@ -109,60 +109,63 @@ ifeq ($(JDK6_OR_EARLIER),0)
|
||||
# overridden in some situations, e.g., a BUILD_FLAVOR != product
|
||||
# build.
|
||||
|
||||
ifeq ($(BUILD_FLAVOR), product)
|
||||
FULL_DEBUG_SYMBOLS ?= 1
|
||||
ENABLE_FULL_DEBUG_SYMBOLS = $(FULL_DEBUG_SYMBOLS)
|
||||
else
|
||||
# debug variants always get Full Debug Symbols (if available)
|
||||
ENABLE_FULL_DEBUG_SYMBOLS = 1
|
||||
endif
|
||||
_JUNK_ := $(shell \
|
||||
echo >&2 "INFO: ENABLE_FULL_DEBUG_SYMBOLS=$(ENABLE_FULL_DEBUG_SYMBOLS)")
|
||||
# since objcopy is optional, we set ZIP_DEBUGINFO_FILES later
|
||||
|
||||
ifeq ($(ENABLE_FULL_DEBUG_SYMBOLS),1)
|
||||
# Default OBJCOPY comes from the SUNWbinutils package:
|
||||
DEF_OBJCOPY=/usr/sfw/bin/gobjcopy
|
||||
OBJCOPY=$(shell test -x $(DEF_OBJCOPY) && echo $(DEF_OBJCOPY))
|
||||
ifneq ($(ALT_OBJCOPY),)
|
||||
_JUNK_ := $(shell echo >&2 "INFO: ALT_OBJCOPY=$(ALT_OBJCOPY)")
|
||||
OBJCOPY=$(shell test -x $(ALT_OBJCOPY) && echo $(ALT_OBJCOPY))
|
||||
# Due to the multiple sub-make processes that occur this logic gets
|
||||
# executed multiple times. We reduce the noise by at least checking that
|
||||
# BUILD_FLAVOR has been set.
|
||||
ifneq ($(BUILD_FLAVOR),)
|
||||
ifeq ($(BUILD_FLAVOR), product)
|
||||
FULL_DEBUG_SYMBOLS ?= 1
|
||||
ENABLE_FULL_DEBUG_SYMBOLS = $(FULL_DEBUG_SYMBOLS)
|
||||
else
|
||||
# debug variants always get Full Debug Symbols (if available)
|
||||
ENABLE_FULL_DEBUG_SYMBOLS = 1
|
||||
endif
|
||||
else
|
||||
OBJCOPY=
|
||||
endif
|
||||
|
||||
ifeq ($(OBJCOPY),)
|
||||
_JUNK_ := $(shell \
|
||||
echo >&2 "INFO: no objcopy cmd found so cannot create .debuginfo files.")
|
||||
ENABLE_FULL_DEBUG_SYMBOLS=0
|
||||
_JUNK_ := $(shell \
|
||||
echo >&2 "INFO: ENABLE_FULL_DEBUG_SYMBOLS=$(ENABLE_FULL_DEBUG_SYMBOLS)")
|
||||
else
|
||||
_JUNK_ := $(shell \
|
||||
echo >&2 "INFO: $(OBJCOPY) cmd found so will create .debuginfo files.")
|
||||
# since objcopy is optional, we set ZIP_DEBUGINFO_FILES later
|
||||
|
||||
# Library stripping policies for .debuginfo configs:
|
||||
# all_strip - strips everything from the library
|
||||
# min_strip - strips most stuff from the library; leaves minimum symbols
|
||||
# no_strip - does not strip the library at all
|
||||
#
|
||||
# Oracle security policy requires "all_strip". A waiver was granted on
|
||||
# 2011.09.01 that permits using "min_strip" in the Java JDK and Java JRE.
|
||||
#
|
||||
# Currently, STRIP_POLICY is only used when Full Debug Symbols is enabled.
|
||||
#
|
||||
STRIP_POLICY ?= min_strip
|
||||
ifeq ($(ENABLE_FULL_DEBUG_SYMBOLS),1)
|
||||
# Default OBJCOPY comes from the SUNWbinutils package:
|
||||
DEF_OBJCOPY=/usr/sfw/bin/gobjcopy
|
||||
OBJCOPY=$(shell test -x $(DEF_OBJCOPY) && echo $(DEF_OBJCOPY))
|
||||
ifneq ($(ALT_OBJCOPY),)
|
||||
_JUNK_ := $(shell echo >&2 "INFO: ALT_OBJCOPY=$(ALT_OBJCOPY)")
|
||||
OBJCOPY=$(shell test -x $(ALT_OBJCOPY) && echo $(ALT_OBJCOPY))
|
||||
endif
|
||||
|
||||
_JUNK_ := $(shell \
|
||||
echo >&2 "INFO: STRIP_POLICY=$(STRIP_POLICY)")
|
||||
ifeq ($(OBJCOPY),)
|
||||
_JUNK_ := $(shell \
|
||||
echo >&2 "INFO: no objcopy cmd found so cannot create .debuginfo files.")
|
||||
ENABLE_FULL_DEBUG_SYMBOLS=0
|
||||
_JUNK_ := $(shell \
|
||||
echo >&2 "INFO: ENABLE_FULL_DEBUG_SYMBOLS=$(ENABLE_FULL_DEBUG_SYMBOLS)")
|
||||
else
|
||||
_JUNK_ := $(shell \
|
||||
echo >&2 "INFO: $(OBJCOPY) cmd found so will create .debuginfo files.")
|
||||
|
||||
ZIP_DEBUGINFO_FILES ?= 1
|
||||
# Library stripping policies for .debuginfo configs:
|
||||
# all_strip - strips everything from the library
|
||||
# min_strip - strips most stuff from the library; leaves minimum symbols
|
||||
# no_strip - does not strip the library at all
|
||||
#
|
||||
# Oracle security policy requires "all_strip". A waiver was granted on
|
||||
# 2011.09.01 that permits using "min_strip" in the Java JDK and Java JRE.
|
||||
#
|
||||
# Currently, STRIP_POLICY is only used when Full Debug Symbols is enabled.
|
||||
#
|
||||
STRIP_POLICY ?= min_strip
|
||||
|
||||
_JUNK_ := $(shell \
|
||||
echo >&2 "INFO: ZIP_DEBUGINFO_FILES=$(ZIP_DEBUGINFO_FILES)")
|
||||
endif
|
||||
endif
|
||||
_JUNK_ := $(shell \
|
||||
echo >&2 "INFO: STRIP_POLICY=$(STRIP_POLICY)")
|
||||
|
||||
ZIP_DEBUGINFO_FILES ?= 1
|
||||
|
||||
_JUNK_ := $(shell \
|
||||
echo >&2 "INFO: ZIP_DEBUGINFO_FILES=$(ZIP_DEBUGINFO_FILES)")
|
||||
endif
|
||||
endif # ENABLE_FULL_DEBUG_SYMBOLS=1
|
||||
endif # BUILD_FLAVOR
|
||||
endif # JDK_6_OR_EARLIER
|
||||
|
||||
JDK_INCLUDE_SUBDIR=solaris
|
||||
|
||||
|
@ -131,23 +131,29 @@ endif
|
||||
# overridden in some situations, e.g., a BUILD_FLAVOR != product
|
||||
# build.
|
||||
|
||||
ifeq ($(BUILD_FLAVOR), product)
|
||||
FULL_DEBUG_SYMBOLS ?= 1
|
||||
ENABLE_FULL_DEBUG_SYMBOLS = $(FULL_DEBUG_SYMBOLS)
|
||||
else
|
||||
# debug variants always get Full Debug Symbols (if available)
|
||||
ENABLE_FULL_DEBUG_SYMBOLS = 1
|
||||
endif
|
||||
_JUNK_ := $(shell \
|
||||
echo >&2 "INFO: ENABLE_FULL_DEBUG_SYMBOLS=$(ENABLE_FULL_DEBUG_SYMBOLS)")
|
||||
MAKE_ARGS += ENABLE_FULL_DEBUG_SYMBOLS=$(ENABLE_FULL_DEBUG_SYMBOLS)
|
||||
# Due to the multiple sub-make processes that occur this logic gets
|
||||
# executed multiple times. We reduce the noise by at least checking that
|
||||
# BUILD_FLAVOR has been set.
|
||||
ifneq ($(BUILD_FLAVOR),)
|
||||
ifeq ($(BUILD_FLAVOR), product)
|
||||
FULL_DEBUG_SYMBOLS ?= 1
|
||||
ENABLE_FULL_DEBUG_SYMBOLS = $(FULL_DEBUG_SYMBOLS)
|
||||
else
|
||||
# debug variants always get Full Debug Symbols (if available)
|
||||
ENABLE_FULL_DEBUG_SYMBOLS = 1
|
||||
endif
|
||||
_JUNK_ := $(shell \
|
||||
echo >&2 "INFO: ENABLE_FULL_DEBUG_SYMBOLS=$(ENABLE_FULL_DEBUG_SYMBOLS)")
|
||||
MAKE_ARGS += ENABLE_FULL_DEBUG_SYMBOLS=$(ENABLE_FULL_DEBUG_SYMBOLS)
|
||||
|
||||
ifeq ($(ENABLE_FULL_DEBUG_SYMBOLS),1)
|
||||
ZIP_DEBUGINFO_FILES ?= 1
|
||||
else
|
||||
ZIP_DEBUGINFO_FILES=0
|
||||
ifeq ($(ENABLE_FULL_DEBUG_SYMBOLS),1)
|
||||
ZIP_DEBUGINFO_FILES ?= 1
|
||||
else
|
||||
ZIP_DEBUGINFO_FILES=0
|
||||
endif
|
||||
MAKE_ARGS += ZIP_DEBUGINFO_FILES=$(ZIP_DEBUGINFO_FILES)
|
||||
endif
|
||||
MAKE_ARGS += ZIP_DEBUGINFO_FILES=$(ZIP_DEBUGINFO_FILES)
|
||||
|
||||
MAKE_ARGS += RM="$(RM)"
|
||||
MAKE_ARGS += ZIPEXE=$(ZIPEXE)
|
||||
|
||||
|
@ -2322,7 +2322,7 @@ nmethod* SharedRuntime::generate_native_wrapper(MacroAssembler* masm,
|
||||
// Pre-load a static method's oop into O1. Used both by locking code and
|
||||
// the normal JNI call code.
|
||||
if (method->is_static() && !is_critical_native) {
|
||||
__ set_oop_constant(JNIHandles::make_local(Klass::cast(method->method_holder())->java_mirror()), O1);
|
||||
__ set_oop_constant(JNIHandles::make_local(method->method_holder()->java_mirror()), O1);
|
||||
|
||||
// Now handlize the static class mirror in O1. It's known not-null.
|
||||
__ st_ptr(O1, SP, klass_offset + STACK_BIAS);
|
||||
|
@ -1936,7 +1936,7 @@ nmethod* SharedRuntime::generate_native_wrapper(MacroAssembler* masm,
|
||||
if (method->is_static() && !is_critical_native) {
|
||||
|
||||
// load opp into a register
|
||||
__ movoop(oop_handle_reg, JNIHandles::make_local(Klass::cast(method->method_holder())->java_mirror()));
|
||||
__ movoop(oop_handle_reg, JNIHandles::make_local(method->method_holder()->java_mirror()));
|
||||
|
||||
// Now handlize the static class mirror it's known not-null.
|
||||
__ movptr(Address(rsp, klass_offset), oop_handle_reg);
|
||||
|
@ -2179,7 +2179,7 @@ nmethod* SharedRuntime::generate_native_wrapper(MacroAssembler* masm,
|
||||
if (method->is_static() && !is_critical_native) {
|
||||
|
||||
// load oop into a register
|
||||
__ movoop(oop_handle_reg, JNIHandles::make_local(Klass::cast(method->method_holder())->java_mirror()));
|
||||
__ movoop(oop_handle_reg, JNIHandles::make_local(method->method_holder()->java_mirror()));
|
||||
|
||||
// Now handlize the static class mirror it's known not-null.
|
||||
__ movptr(Address(rsp, klass_offset), oop_handle_reg);
|
||||
|
@ -488,8 +488,8 @@ void VM_Version::get_processor_features() {
|
||||
}
|
||||
|
||||
// The AES intrinsic stubs require AES instruction support (of course)
|
||||
// but also require AVX mode for misaligned SSE access
|
||||
if (UseAES && (UseAVX > 0)) {
|
||||
// but also require AVX and sse3 modes for instructions it use.
|
||||
if (UseAES && (UseAVX > 0) && (UseSSE > 2)) {
|
||||
if (FLAG_IS_DEFAULT(UseAESIntrinsics)) {
|
||||
UseAESIntrinsics = true;
|
||||
}
|
||||
|
@ -85,9 +85,11 @@ void end_of_file() { }
|
||||
|
||||
#include "dlfcn.h"
|
||||
|
||||
#define DECODE_INSTRUCTIONS_NAME "decode_instructions_virtual"
|
||||
#define DECODE_INSTRUCTIONS_VIRTUAL_NAME "decode_instructions_virtual"
|
||||
#define DECODE_INSTRUCTIONS_NAME "decode_instructions"
|
||||
#define HSDIS_NAME "hsdis"
|
||||
static void* decode_instructions_pv = 0;
|
||||
static void* decode_instructions_sv = 0;
|
||||
static const char* hsdis_path[] = {
|
||||
HSDIS_NAME"-"LIBARCH LIB_EXT,
|
||||
"./" HSDIS_NAME"-"LIBARCH LIB_EXT,
|
||||
@ -101,11 +103,12 @@ static const char* load_decode_instructions() {
|
||||
void* dllib = NULL;
|
||||
const char* *next_in_path = hsdis_path;
|
||||
while (1) {
|
||||
decode_instructions_pv = dlsym(dllib, DECODE_INSTRUCTIONS_NAME);
|
||||
if (decode_instructions_pv != NULL)
|
||||
decode_instructions_pv = dlsym(dllib, DECODE_INSTRUCTIONS_VIRTUAL_NAME);
|
||||
decode_instructions_sv = dlsym(dllib, DECODE_INSTRUCTIONS_NAME);
|
||||
if (decode_instructions_pv != NULL || decode_instructions_sv != NULL)
|
||||
return NULL;
|
||||
if (dllib != NULL)
|
||||
return "plugin does not defined "DECODE_INSTRUCTIONS_NAME;
|
||||
return "plugin does not defined "DECODE_INSTRUCTIONS_VIRTUAL_NAME" and "DECODE_INSTRUCTIONS_NAME;
|
||||
for (dllib = NULL; dllib == NULL; ) {
|
||||
const char* next_lib = (*next_in_path++);
|
||||
if (next_lib == NULL)
|
||||
@ -213,20 +216,44 @@ void disassemble(uintptr_t from, uintptr_t to) {
|
||||
printf("%s: %s\n", err, dlerror());
|
||||
exit(1);
|
||||
}
|
||||
printf("Decoding from %p to %p...\n", from, to);
|
||||
decode_instructions_ftype decode_instructions
|
||||
= (decode_instructions_ftype) decode_instructions_pv;
|
||||
decode_func_vtype decode_instructions_v
|
||||
= (decode_func_vtype) decode_instructions_pv;
|
||||
decode_func_stype decode_instructions_s
|
||||
= (decode_func_stype) decode_instructions_sv;
|
||||
void* res;
|
||||
if (raw && xml) {
|
||||
res = (*decode_instructions)(from, to, (unsigned char*)from, to - from, simple_handle_event, stdout, NULL, stdout, options);
|
||||
} else if (raw) {
|
||||
res = (*decode_instructions)(from, to, (unsigned char*)from, to - from, simple_handle_event, stdout, NULL, stdout, options);
|
||||
} else {
|
||||
res = (*decode_instructions)(from, to, (unsigned char*)from, to - from,
|
||||
handle_event, (void*) event_cookie,
|
||||
fprintf_callback, stdout,
|
||||
options);
|
||||
if (decode_instructions_pv != NULL) {
|
||||
printf("\nDecoding from %p to %p...with %s\n", from, to, DECODE_INSTRUCTIONS_VIRTUAL_NAME);
|
||||
if (raw) {
|
||||
res = (*decode_instructions_v)(from, to,
|
||||
(unsigned char*)from, to - from,
|
||||
simple_handle_event, stdout,
|
||||
NULL, stdout,
|
||||
options, 0);
|
||||
} else {
|
||||
res = (*decode_instructions_v)(from, to,
|
||||
(unsigned char*)from, to - from,
|
||||
handle_event, (void*) event_cookie,
|
||||
fprintf_callback, stdout,
|
||||
options, 0);
|
||||
}
|
||||
if (res != (void*)to)
|
||||
printf("*** Result was %p!\n", res);
|
||||
}
|
||||
void* sres;
|
||||
if (decode_instructions_sv != NULL) {
|
||||
printf("\nDecoding from %p to %p...with old decode_instructions\n", from, to, DECODE_INSTRUCTIONS_NAME);
|
||||
if (raw) {
|
||||
sres = (*decode_instructions_s)(from, to,
|
||||
simple_handle_event, stdout,
|
||||
NULL, stdout,
|
||||
options);
|
||||
} else {
|
||||
sres = (*decode_instructions_s)(from, to,
|
||||
handle_event, (void*) event_cookie,
|
||||
fprintf_callback, stdout,
|
||||
options);
|
||||
}
|
||||
if (sres != (void *)to)
|
||||
printf("*** Result of decode_instructions %p!\n", sres);
|
||||
}
|
||||
if (res != (void*)to)
|
||||
printf("*** Result was %p!\n", res);
|
||||
}
|
||||
|
@ -99,7 +99,7 @@ decode_instructions_virtual(uintptr_t start_va, uintptr_t end_va,
|
||||
unsigned char* buffer, uintptr_t length,
|
||||
event_callback_t event_callback_arg, void* event_stream_arg,
|
||||
printf_callback_t printf_callback_arg, void* printf_stream_arg,
|
||||
const char* options) {
|
||||
const char* options, int newline) {
|
||||
struct hsdis_app_data app_data;
|
||||
memset(&app_data, 0, sizeof(app_data));
|
||||
app_data.start_va = start_va;
|
||||
@ -110,7 +110,7 @@ decode_instructions_virtual(uintptr_t start_va, uintptr_t end_va,
|
||||
app_data.event_stream = event_stream_arg;
|
||||
app_data.printf_callback = printf_callback_arg;
|
||||
app_data.printf_stream = printf_stream_arg;
|
||||
app_data.do_newline = false;
|
||||
app_data.do_newline = newline == 0 ? false : true;
|
||||
|
||||
return decode(&app_data, options);
|
||||
}
|
||||
@ -132,7 +132,7 @@ decode_instructions(void* start_pv, void* end_pv,
|
||||
event_stream_arg,
|
||||
printf_callback_arg,
|
||||
printf_stream_arg,
|
||||
options);
|
||||
options, false);
|
||||
}
|
||||
|
||||
static void* decode(struct hsdis_app_data* app_data, const char* options) {
|
||||
@ -173,7 +173,7 @@ static void* decode(struct hsdis_app_data* app_data, const char* options) {
|
||||
if (!app_data->losing) {
|
||||
const char* insn_close = format_insn_close("/insn", &app_data->dinfo,
|
||||
buf, sizeof(buf));
|
||||
(*event_callback)(event_stream, insn_close, (void*) p) != NULL;
|
||||
(*event_callback)(event_stream, insn_close, (void*) p);
|
||||
|
||||
if (app_data->do_newline) {
|
||||
/* follow each complete insn by a nice newline */
|
||||
@ -182,13 +182,14 @@ static void* decode(struct hsdis_app_data* app_data, const char* options) {
|
||||
}
|
||||
}
|
||||
|
||||
(*event_callback)(event_stream, "/insns", (void*) p);
|
||||
if (app_data->losing) (*event_callback)(event_stream, "/insns", (void*) p);
|
||||
return (void*) p;
|
||||
}
|
||||
}
|
||||
|
||||
/* take the address of the function, for luck, and also test the typedef: */
|
||||
const decode_instructions_ftype decode_instructions_address = &decode_instructions_virtual;
|
||||
const decode_func_vtype decode_func_virtual_address = &decode_instructions_virtual;
|
||||
const decode_func_stype decode_func_address = &decode_instructions;
|
||||
|
||||
static const char* format_insn_close(const char* close,
|
||||
disassemble_info* dinfo,
|
||||
|
@ -47,6 +47,9 @@
|
||||
where tag is a simple identifier, signifying (as in XML) a element start,
|
||||
element end, and standalone element. (To render as XML, add angle brackets.)
|
||||
*/
|
||||
#ifndef SHARED_TOOLS_HSDIS_H
|
||||
#define SHARED_TOOLS_HSDIS_H
|
||||
|
||||
extern
|
||||
#ifdef DLL_EXPORT
|
||||
DLL_EXPORT
|
||||
@ -57,16 +60,37 @@ void* decode_instructions_virtual(uintptr_t start_va, uintptr_t end_va,
|
||||
void* event_stream,
|
||||
int (*printf_callback)(void*, const char*, ...),
|
||||
void* printf_stream,
|
||||
const char* options);
|
||||
const char* options,
|
||||
int newline /* bool value for nice new line */);
|
||||
|
||||
/* This is the compatability interface for older versions of hotspot */
|
||||
extern
|
||||
#ifdef DLL_ENTRY
|
||||
DLL_ENTRY
|
||||
#endif
|
||||
void* decode_instructions(void* start_pv, void* end_pv,
|
||||
void* (*event_callback)(void*, const char*, void*),
|
||||
void* event_stream,
|
||||
int (*printf_callback)(void*, const char*, ...),
|
||||
void* printf_stream,
|
||||
const char* options);
|
||||
|
||||
/* convenience typedefs */
|
||||
|
||||
typedef void* (*decode_instructions_event_callback_ftype) (void*, const char*, void*);
|
||||
typedef int (*decode_instructions_printf_callback_ftype) (void*, const char*, ...);
|
||||
typedef void* (*decode_instructions_ftype) (uintptr_t start_va, uintptr_t end_va,
|
||||
unsigned char* buffer, uintptr_t length,
|
||||
decode_instructions_event_callback_ftype event_callback,
|
||||
void* event_stream,
|
||||
decode_instructions_printf_callback_ftype printf_callback,
|
||||
void* printf_stream,
|
||||
const char* options);
|
||||
typedef void* (*decode_func_vtype) (uintptr_t start_va, uintptr_t end_va,
|
||||
unsigned char* buffer, uintptr_t length,
|
||||
decode_instructions_event_callback_ftype event_callback,
|
||||
void* event_stream,
|
||||
decode_instructions_printf_callback_ftype printf_callback,
|
||||
void* printf_stream,
|
||||
const char* options,
|
||||
int newline);
|
||||
typedef void* (*decode_func_stype) (void* start_pv, void* end_pv,
|
||||
decode_instructions_event_callback_ftype event_callback,
|
||||
void* event_stream,
|
||||
decode_instructions_printf_callback_ftype printf_callback,
|
||||
void* printf_stream,
|
||||
const char* options);
|
||||
#endif /* SHARED_TOOLS_HSDIS_H */
|
||||
|
@ -768,8 +768,8 @@ ciMethod* ciEnv::get_method_by_index_impl(constantPoolHandle cpool,
|
||||
Method* m = lookup_method(accessor->get_instanceKlass(), lookup, name_sym, sig_sym, bc);
|
||||
if (m != NULL &&
|
||||
(bc == Bytecodes::_invokestatic
|
||||
? InstanceKlass::cast(m->method_holder())->is_not_initialized()
|
||||
: !InstanceKlass::cast(m->method_holder())->is_loaded())) {
|
||||
? m->method_holder()->is_not_initialized()
|
||||
: !m->method_holder()->is_loaded())) {
|
||||
m = NULL;
|
||||
}
|
||||
if (m != NULL) {
|
||||
@ -1056,7 +1056,7 @@ void ciEnv::register_method(ciMethod* target,
|
||||
method_name,
|
||||
entry_bci);
|
||||
}
|
||||
InstanceKlass::cast(method->method_holder())->add_osr_nmethod(nm);
|
||||
method->method_holder()->add_osr_nmethod(nm);
|
||||
|
||||
}
|
||||
}
|
||||
|
@ -105,7 +105,7 @@ ciMethod::ciMethod(methodHandle h_m) : ciMetadata(h_m()) {
|
||||
CHECK_UNHANDLED_OOPS_ONLY(Thread::current()->clear_unhandled_oops());
|
||||
}
|
||||
|
||||
if (InstanceKlass::cast(h_m()->method_holder())->is_linked()) {
|
||||
if (h_m()->method_holder()->is_linked()) {
|
||||
_can_be_statically_bound = h_m()->can_be_statically_bound();
|
||||
} else {
|
||||
// Have to use a conservative value in this case.
|
||||
@ -188,7 +188,7 @@ void ciMethod::load_code() {
|
||||
|
||||
// Revert any breakpoint bytecodes in ci's copy
|
||||
if (me->number_of_breakpoints() > 0) {
|
||||
BreakpointInfo* bp = InstanceKlass::cast(me->method_holder())->breakpoints();
|
||||
BreakpointInfo* bp = me->method_holder()->breakpoints();
|
||||
for (; bp != NULL; bp = bp->next()) {
|
||||
if (bp->match(me)) {
|
||||
code_at_put(bp->bci(), bp->orig_bytecode());
|
||||
|
269
hotspot/src/share/vm/classfile/bytecodeAssembler.cpp
Normal file
269
hotspot/src/share/vm/classfile/bytecodeAssembler.cpp
Normal file
@ -0,0 +1,269 @@
|
||||
/*
|
||||
* Copyright (c) 2012, Oracle and/or its affiliates. All rights reserved.
|
||||
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
||||
*
|
||||
* This code is free software; you can redistribute it and/or modify it
|
||||
* under the terms of the GNU General Public License version 2 only, as
|
||||
* published by the Free Software Foundation.
|
||||
*
|
||||
* This code is distributed in the hope that it will be useful, but WITHOUT
|
||||
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
||||
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
||||
* version 2 for more details (a copy is included in the LICENSE file that
|
||||
* accompanied this code).
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License version
|
||||
* 2 along with this work; if not, write to the Free Software Foundation,
|
||||
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
||||
*
|
||||
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
||||
* or visit www.oracle.com if you need additional information or have any
|
||||
* questions.
|
||||
*
|
||||
*/
|
||||
|
||||
#include "precompiled.hpp"
|
||||
|
||||
#include "classfile/bytecodeAssembler.hpp"
|
||||
#include "interpreter/bytecodes.hpp"
|
||||
#include "memory/oopFactory.hpp"
|
||||
#include "oops/constantPool.hpp"
|
||||
|
||||
#ifdef TARGET_ARCH_x86
|
||||
# include "bytes_x86.hpp"
|
||||
#endif
|
||||
#ifdef TARGET_ARCH_sparc
|
||||
# include "bytes_sparc.hpp"
|
||||
#endif
|
||||
#ifdef TARGET_ARCH_zero
|
||||
# include "bytes_zero.hpp"
|
||||
#endif
|
||||
#ifdef TARGET_ARCH_arm
|
||||
# include "bytes_arm.hpp"
|
||||
#endif
|
||||
#ifdef TARGET_ARCH_ppc
|
||||
# include "bytes_ppc.hpp"
|
||||
#endif
|
||||
|
||||
u2 BytecodeConstantPool::find_or_add(BytecodeCPEntry const& bcpe) {
|
||||
u2 index;
|
||||
u2* probe = _indices.get(bcpe);
|
||||
if (probe == NULL) {
|
||||
index = _entries.length();
|
||||
_entries.append(bcpe);
|
||||
_indices.put(bcpe, index);
|
||||
} else {
|
||||
index = *probe;
|
||||
}
|
||||
return index + _orig->length();
|
||||
}
|
||||
|
||||
ConstantPool* BytecodeConstantPool::create_constant_pool(TRAPS) const {
|
||||
if (_entries.length() == 0) {
|
||||
return _orig;
|
||||
}
|
||||
|
||||
ConstantPool* cp = ConstantPool::allocate(
|
||||
_orig->pool_holder()->class_loader_data(),
|
||||
_orig->length() + _entries.length(), CHECK_NULL);
|
||||
|
||||
cp->set_pool_holder(_orig->pool_holder());
|
||||
_orig->copy_cp_to(1, _orig->length() - 1, cp, 1, CHECK_NULL);
|
||||
|
||||
for (int i = 0; i < _entries.length(); ++i) {
|
||||
BytecodeCPEntry entry = _entries.at(i);
|
||||
int idx = i + _orig->length();
|
||||
switch (entry._tag) {
|
||||
case BytecodeCPEntry::UTF8:
|
||||
cp->symbol_at_put(idx, entry._u.utf8);
|
||||
entry._u.utf8->increment_refcount();
|
||||
break;
|
||||
case BytecodeCPEntry::KLASS:
|
||||
cp->unresolved_klass_at_put(
|
||||
idx, cp->symbol_at(entry._u.klass));
|
||||
break;
|
||||
case BytecodeCPEntry::STRING:
|
||||
cp->unresolved_string_at_put(
|
||||
idx, cp->symbol_at(entry._u.string));
|
||||
break;
|
||||
case BytecodeCPEntry::NAME_AND_TYPE:
|
||||
cp->name_and_type_at_put(idx,
|
||||
entry._u.name_and_type.name_index,
|
||||
entry._u.name_and_type.type_index);
|
||||
break;
|
||||
case BytecodeCPEntry::METHODREF:
|
||||
cp->method_at_put(idx,
|
||||
entry._u.methodref.class_index,
|
||||
entry._u.methodref.name_and_type_index);
|
||||
break;
|
||||
default:
|
||||
ShouldNotReachHere();
|
||||
}
|
||||
}
|
||||
return cp;
|
||||
}
|
||||
|
||||
void BytecodeAssembler::append(u1 imm_u1) {
|
||||
_code->append(imm_u1);
|
||||
}
|
||||
|
||||
void BytecodeAssembler::append(u2 imm_u2) {
|
||||
_code->append(0);
|
||||
_code->append(0);
|
||||
Bytes::put_Java_u2(_code->adr_at(_code->length() - 2), imm_u2);
|
||||
}
|
||||
|
||||
void BytecodeAssembler::append(u4 imm_u4) {
|
||||
_code->append(0);
|
||||
_code->append(0);
|
||||
_code->append(0);
|
||||
_code->append(0);
|
||||
Bytes::put_Java_u4(_code->adr_at(_code->length() - 4), imm_u4);
|
||||
}
|
||||
|
||||
void BytecodeAssembler::xload(u4 index, u1 onebyteop, u1 twobyteop) {
|
||||
if (index < 4) {
|
||||
_code->append(onebyteop + index);
|
||||
} else {
|
||||
_code->append(twobyteop);
|
||||
_code->append((u2)index);
|
||||
}
|
||||
}
|
||||
|
||||
void BytecodeAssembler::dup() {
|
||||
_code->append(Bytecodes::_dup);
|
||||
}
|
||||
|
||||
void BytecodeAssembler::_new(Symbol* sym) {
|
||||
u2 cpool_index = _cp->klass(sym);
|
||||
_code->append(Bytecodes::_new);
|
||||
append(cpool_index);
|
||||
}
|
||||
|
||||
void BytecodeAssembler::load_string(Symbol* sym) {
|
||||
u2 cpool_index = _cp->string(sym);
|
||||
if (cpool_index < 0x100) {
|
||||
ldc(cpool_index);
|
||||
} else {
|
||||
ldc_w(cpool_index);
|
||||
}
|
||||
}
|
||||
|
||||
void BytecodeAssembler::ldc(u1 index) {
|
||||
_code->append(Bytecodes::_ldc);
|
||||
append(index);
|
||||
}
|
||||
|
||||
void BytecodeAssembler::ldc_w(u2 index) {
|
||||
_code->append(Bytecodes::_ldc_w);
|
||||
append(index);
|
||||
}
|
||||
|
||||
void BytecodeAssembler::athrow() {
|
||||
_code->append(Bytecodes::_athrow);
|
||||
}
|
||||
|
||||
void BytecodeAssembler::iload(u4 index) {
|
||||
xload(index, Bytecodes::_iload_0, Bytecodes::_iload);
|
||||
}
|
||||
|
||||
void BytecodeAssembler::lload(u4 index) {
|
||||
xload(index, Bytecodes::_lload_0, Bytecodes::_lload);
|
||||
}
|
||||
|
||||
void BytecodeAssembler::fload(u4 index) {
|
||||
xload(index, Bytecodes::_fload_0, Bytecodes::_fload);
|
||||
}
|
||||
|
||||
void BytecodeAssembler::dload(u4 index) {
|
||||
xload(index, Bytecodes::_dload_0, Bytecodes::_dload);
|
||||
}
|
||||
|
||||
void BytecodeAssembler::aload(u4 index) {
|
||||
xload(index, Bytecodes::_aload_0, Bytecodes::_aload);
|
||||
}
|
||||
|
||||
void BytecodeAssembler::load(BasicType bt, u4 index) {
|
||||
switch (bt) {
|
||||
case T_BOOLEAN:
|
||||
case T_CHAR:
|
||||
case T_BYTE:
|
||||
case T_SHORT:
|
||||
case T_INT: iload(index); break;
|
||||
case T_FLOAT: fload(index); break;
|
||||
case T_DOUBLE: dload(index); break;
|
||||
case T_LONG: lload(index); break;
|
||||
case T_OBJECT:
|
||||
case T_ARRAY: aload(index); break;
|
||||
default:
|
||||
ShouldNotReachHere();
|
||||
}
|
||||
}
|
||||
|
||||
void BytecodeAssembler::checkcast(Symbol* sym) {
|
||||
u2 cpool_index = _cp->klass(sym);
|
||||
_code->append(Bytecodes::_checkcast);
|
||||
append(cpool_index);
|
||||
}
|
||||
|
||||
void BytecodeAssembler::invokespecial(Method* method) {
|
||||
invokespecial(method->klass_name(), method->name(), method->signature());
|
||||
}
|
||||
|
||||
void BytecodeAssembler::invokespecial(Symbol* klss, Symbol* name, Symbol* sig) {
|
||||
u2 methodref_index = _cp->methodref(klss, name, sig);
|
||||
_code->append(Bytecodes::_invokespecial);
|
||||
append(methodref_index);
|
||||
}
|
||||
|
||||
void BytecodeAssembler::invokevirtual(Method* method) {
|
||||
invokevirtual(method->klass_name(), method->name(), method->signature());
|
||||
}
|
||||
|
||||
void BytecodeAssembler::invokevirtual(Symbol* klss, Symbol* name, Symbol* sig) {
|
||||
u2 methodref_index = _cp->methodref(klss, name, sig);
|
||||
_code->append(Bytecodes::_invokevirtual);
|
||||
append(methodref_index);
|
||||
}
|
||||
|
||||
void BytecodeAssembler::ireturn() {
|
||||
_code->append(Bytecodes::_ireturn);
|
||||
}
|
||||
|
||||
void BytecodeAssembler::lreturn() {
|
||||
_code->append(Bytecodes::_lreturn);
|
||||
}
|
||||
|
||||
void BytecodeAssembler::freturn() {
|
||||
_code->append(Bytecodes::_freturn);
|
||||
}
|
||||
|
||||
void BytecodeAssembler::dreturn() {
|
||||
_code->append(Bytecodes::_dreturn);
|
||||
}
|
||||
|
||||
void BytecodeAssembler::areturn() {
|
||||
_code->append(Bytecodes::_areturn);
|
||||
}
|
||||
|
||||
void BytecodeAssembler::_return() {
|
||||
_code->append(Bytecodes::_return);
|
||||
}
|
||||
|
||||
void BytecodeAssembler::_return(BasicType bt) {
|
||||
switch (bt) {
|
||||
case T_BOOLEAN:
|
||||
case T_CHAR:
|
||||
case T_BYTE:
|
||||
case T_SHORT:
|
||||
case T_INT: ireturn(); break;
|
||||
case T_FLOAT: freturn(); break;
|
||||
case T_DOUBLE: dreturn(); break;
|
||||
case T_LONG: lreturn(); break;
|
||||
case T_OBJECT:
|
||||
case T_ARRAY: areturn(); break;
|
||||
case T_VOID: _return(); break;
|
||||
default:
|
||||
ShouldNotReachHere();
|
||||
}
|
||||
}
|
214
hotspot/src/share/vm/classfile/bytecodeAssembler.hpp
Normal file
214
hotspot/src/share/vm/classfile/bytecodeAssembler.hpp
Normal file
@ -0,0 +1,214 @@
|
||||
/*
|
||||
* Copyright (c) 2012, Oracle and/or its affiliates. All rights reserved.
|
||||
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
||||
*
|
||||
* This code is free software; you can redistribute it and/or modify it
|
||||
* under the terms of the GNU General Public License version 2 only, as
|
||||
* published by the Free Software Foundation.
|
||||
*
|
||||
* This code is distributed in the hope that it will be useful, but WITHOUT
|
||||
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
||||
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
||||
* version 2 for more details (a copy is included in the LICENSE file that
|
||||
* accompanied this code).
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License version
|
||||
* 2 along with this work; if not, write to the Free Software Foundation,
|
||||
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
||||
*
|
||||
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
||||
* or visit www.oracle.com if you need additional information or have any
|
||||
* questions.
|
||||
*
|
||||
*/
|
||||
|
||||
#ifndef SHARE_VM_CLASSFILE_BYTECODEASSEMBLER_HPP
|
||||
#define SHARE_VM_CLASSFILE_BYTECODEASSEMBLER_HPP
|
||||
|
||||
#include "memory/allocation.hpp"
|
||||
#include "oops/method.hpp"
|
||||
#include "oops/symbol.hpp"
|
||||
#include "utilities/globalDefinitions.hpp"
|
||||
#include "utilities/growableArray.hpp"
|
||||
#include "utilities/resourceHash.hpp"
|
||||
|
||||
|
||||
/**
|
||||
* Bytecode Assembler
|
||||
*
|
||||
* These classes are used to synthesize code for creating new methods from
|
||||
* within the VM. This is only a partial implementation of an assembler;
|
||||
* only the bytecodes that are needed by clients are implemented at this time.
|
||||
* This is used during default method analysis to create overpass methods
|
||||
* and add them to a call during parsing. Other uses (such as creating
|
||||
* bridges) may come later. Any missing bytecodes can be implemented on an
|
||||
* as-need basis.
|
||||
*/
|
||||
|
||||
class BytecodeBuffer : public GrowableArray<u1> {
|
||||
public:
|
||||
BytecodeBuffer() : GrowableArray<u1>(20) {}
|
||||
};
|
||||
|
||||
// Entries in a yet-to-be-created constant pool. Limited types for now.
|
||||
class BytecodeCPEntry VALUE_OBJ_CLASS_SPEC {
|
||||
public:
|
||||
enum tag {
|
||||
ERROR_TAG,
|
||||
UTF8,
|
||||
KLASS,
|
||||
STRING,
|
||||
NAME_AND_TYPE,
|
||||
METHODREF
|
||||
};
|
||||
|
||||
u1 _tag;
|
||||
union {
|
||||
Symbol* utf8;
|
||||
u2 klass;
|
||||
u2 string;
|
||||
struct {
|
||||
u2 name_index;
|
||||
u2 type_index;
|
||||
} name_and_type;
|
||||
struct {
|
||||
u2 class_index;
|
||||
u2 name_and_type_index;
|
||||
} methodref;
|
||||
uintptr_t hash;
|
||||
} _u;
|
||||
|
||||
BytecodeCPEntry() : _tag(ERROR_TAG) { _u.hash = 0; }
|
||||
BytecodeCPEntry(u1 tag) : _tag(tag) { _u.hash = 0; }
|
||||
|
||||
static BytecodeCPEntry utf8(Symbol* symbol) {
|
||||
BytecodeCPEntry bcpe(UTF8);
|
||||
bcpe._u.utf8 = symbol;
|
||||
return bcpe;
|
||||
}
|
||||
|
||||
static BytecodeCPEntry klass(u2 index) {
|
||||
BytecodeCPEntry bcpe(KLASS);
|
||||
bcpe._u.klass = index;
|
||||
return bcpe;
|
||||
}
|
||||
|
||||
static BytecodeCPEntry string(u2 index) {
|
||||
BytecodeCPEntry bcpe(STRING);
|
||||
bcpe._u.string = index;
|
||||
return bcpe;
|
||||
}
|
||||
|
||||
static BytecodeCPEntry name_and_type(u2 name, u2 type) {
|
||||
BytecodeCPEntry bcpe(NAME_AND_TYPE);
|
||||
bcpe._u.name_and_type.name_index = name;
|
||||
bcpe._u.name_and_type.type_index = type;
|
||||
return bcpe;
|
||||
}
|
||||
|
||||
static BytecodeCPEntry methodref(u2 class_index, u2 nat) {
|
||||
BytecodeCPEntry bcpe(METHODREF);
|
||||
bcpe._u.methodref.class_index = class_index;
|
||||
bcpe._u.methodref.name_and_type_index = nat;
|
||||
return bcpe;
|
||||
}
|
||||
|
||||
static bool equals(BytecodeCPEntry const& e0, BytecodeCPEntry const& e1) {
|
||||
return e0._tag == e1._tag && e0._u.hash == e1._u.hash;
|
||||
}
|
||||
|
||||
static unsigned hash(BytecodeCPEntry const& e0) {
|
||||
return (unsigned)(e0._tag ^ e0._u.hash);
|
||||
}
|
||||
};
|
||||
|
||||
class BytecodeConstantPool : ResourceObj {
|
||||
private:
|
||||
typedef ResourceHashtable<BytecodeCPEntry, u2,
|
||||
&BytecodeCPEntry::hash, &BytecodeCPEntry::equals> IndexHash;
|
||||
|
||||
ConstantPool* _orig;
|
||||
GrowableArray<BytecodeCPEntry> _entries;
|
||||
IndexHash _indices;
|
||||
|
||||
u2 find_or_add(BytecodeCPEntry const& bcpe);
|
||||
|
||||
public:
|
||||
|
||||
BytecodeConstantPool(ConstantPool* orig) : _orig(orig) {}
|
||||
|
||||
BytecodeCPEntry const& at(u2 index) const { return _entries.at(index); }
|
||||
|
||||
InstanceKlass* pool_holder() const {
|
||||
return InstanceKlass::cast(_orig->pool_holder());
|
||||
}
|
||||
|
||||
u2 utf8(Symbol* sym) {
|
||||
return find_or_add(BytecodeCPEntry::utf8(sym));
|
||||
}
|
||||
|
||||
u2 klass(Symbol* class_name) {
|
||||
return find_or_add(BytecodeCPEntry::klass(utf8(class_name)));
|
||||
}
|
||||
|
||||
u2 string(Symbol* str) {
|
||||
return find_or_add(BytecodeCPEntry::string(utf8(str)));
|
||||
}
|
||||
|
||||
u2 name_and_type(Symbol* name, Symbol* sig) {
|
||||
return find_or_add(BytecodeCPEntry::name_and_type(utf8(name), utf8(sig)));
|
||||
}
|
||||
|
||||
u2 methodref(Symbol* class_name, Symbol* name, Symbol* sig) {
|
||||
return find_or_add(BytecodeCPEntry::methodref(
|
||||
klass(class_name), name_and_type(name, sig)));
|
||||
}
|
||||
|
||||
ConstantPool* create_constant_pool(TRAPS) const;
|
||||
};
|
||||
|
||||
// Partial bytecode assembler - only what we need for creating
|
||||
// overpass methods for default methods is implemented
|
||||
class BytecodeAssembler : StackObj {
|
||||
private:
|
||||
BytecodeBuffer* _code;
|
||||
BytecodeConstantPool* _cp;
|
||||
|
||||
void append(u1 imm_u1);
|
||||
void append(u2 imm_u2);
|
||||
void append(u4 imm_u4);
|
||||
|
||||
void xload(u4 index, u1 quick, u1 twobyte);
|
||||
|
||||
public:
|
||||
BytecodeAssembler(BytecodeBuffer* buffer, BytecodeConstantPool* cp)
|
||||
: _code(buffer), _cp(cp) {}
|
||||
|
||||
void aload(u4 index);
|
||||
void areturn();
|
||||
void athrow();
|
||||
void checkcast(Symbol* sym);
|
||||
void dload(u4 index);
|
||||
void dreturn();
|
||||
void dup();
|
||||
void fload(u4 index);
|
||||
void freturn();
|
||||
void iload(u4 index);
|
||||
void invokespecial(Method* method);
|
||||
void invokespecial(Symbol* cls, Symbol* name, Symbol* sig);
|
||||
void invokevirtual(Method* method);
|
||||
void invokevirtual(Symbol* cls, Symbol* name, Symbol* sig);
|
||||
void ireturn();
|
||||
void ldc(u1 index);
|
||||
void ldc_w(u2 index);
|
||||
void lload(u4 index);
|
||||
void lreturn();
|
||||
void _new(Symbol* sym);
|
||||
void _return();
|
||||
|
||||
void load_string(Symbol* sym);
|
||||
void load(BasicType bt, u4 index);
|
||||
void _return(BasicType bt);
|
||||
};
|
||||
|
||||
#endif // SHARE_VM_CLASSFILE_BYTECODEASSEMBLER_HPP
|
@ -27,6 +27,8 @@
|
||||
#include "classfile/classLoader.hpp"
|
||||
#include "classfile/classLoaderData.hpp"
|
||||
#include "classfile/classLoaderData.inline.hpp"
|
||||
#include "classfile/defaultMethods.hpp"
|
||||
#include "classfile/genericSignatures.hpp"
|
||||
#include "classfile/javaClasses.hpp"
|
||||
#include "classfile/symbolTable.hpp"
|
||||
#include "classfile/systemDictionary.hpp"
|
||||
@ -84,6 +86,9 @@
|
||||
// - to check NameAndType_info signatures more aggressively
|
||||
#define JAVA_7_VERSION 51
|
||||
|
||||
// Extension method support.
|
||||
#define JAVA_8_VERSION 52
|
||||
|
||||
|
||||
void ClassFileParser::parse_constant_pool_entries(ClassLoaderData* loader_data, constantPoolHandle cp, int length, TRAPS) {
|
||||
// Use a local copy of ClassFileStream. It helps the C++ compiler to optimize
|
||||
@ -785,6 +790,7 @@ Array<Klass*>* ClassFileParser::parse_interfaces(constantPoolHandle cp,
|
||||
ClassLoaderData* loader_data,
|
||||
Handle protection_domain,
|
||||
Symbol* class_name,
|
||||
bool* has_default_methods,
|
||||
TRAPS) {
|
||||
ClassFileStream* cfs = stream();
|
||||
assert(length > 0, "only called for length>0");
|
||||
@ -821,6 +827,9 @@ Array<Klass*>* ClassFileParser::parse_interfaces(constantPoolHandle cp,
|
||||
if (!Klass::cast(interf())->is_interface()) {
|
||||
THROW_MSG_(vmSymbols::java_lang_IncompatibleClassChangeError(), "Implementing class", NULL);
|
||||
}
|
||||
if (InstanceKlass::cast(interf())->has_default_methods()) {
|
||||
*has_default_methods = true;
|
||||
}
|
||||
interfaces->at_put(index, interf());
|
||||
}
|
||||
|
||||
@ -1928,7 +1937,8 @@ methodHandle ClassFileParser::parse_method(ClassLoaderData* loader_data,
|
||||
if (method_attribute_name == vmSymbols::tag_code()) {
|
||||
// Parse Code attribute
|
||||
if (_need_verify) {
|
||||
guarantee_property(!access_flags.is_native() && !access_flags.is_abstract(),
|
||||
guarantee_property(
|
||||
!access_flags.is_native() && !access_flags.is_abstract(),
|
||||
"Code attribute in native or abstract methods in class file %s",
|
||||
CHECK_(nullHandle));
|
||||
}
|
||||
@ -2125,7 +2135,9 @@ methodHandle ClassFileParser::parse_method(ClassLoaderData* loader_data,
|
||||
runtime_visible_annotations_length = method_attribute_length;
|
||||
runtime_visible_annotations = cfs->get_u1_buffer();
|
||||
assert(runtime_visible_annotations != NULL, "null visible annotations");
|
||||
parse_annotations(runtime_visible_annotations, runtime_visible_annotations_length, cp, &parsed_annotations, CHECK_(nullHandle));
|
||||
parse_annotations(runtime_visible_annotations,
|
||||
runtime_visible_annotations_length, cp, &parsed_annotations,
|
||||
CHECK_(nullHandle));
|
||||
cfs->skip_u1(runtime_visible_annotations_length, CHECK_(nullHandle));
|
||||
} else if (PreserveAllAnnotations && method_attribute_name == vmSymbols::tag_runtime_invisible_annotations()) {
|
||||
runtime_invisible_annotations_length = method_attribute_length;
|
||||
@ -2169,12 +2181,10 @@ methodHandle ClassFileParser::parse_method(ClassLoaderData* loader_data,
|
||||
}
|
||||
|
||||
// All sizing information for a Method* is finally available, now create it
|
||||
Method* m = Method::allocate(loader_data, code_length, access_flags,
|
||||
linenumber_table_length,
|
||||
total_lvt_length,
|
||||
exception_table_length,
|
||||
checked_exceptions_length,
|
||||
CHECK_(nullHandle));
|
||||
Method* m = Method::allocate(
|
||||
loader_data, code_length, access_flags, linenumber_table_length,
|
||||
total_lvt_length, exception_table_length, checked_exceptions_length,
|
||||
ConstMethod::NORMAL, CHECK_(nullHandle));
|
||||
|
||||
ClassLoadingService::add_class_method_size(m->size()*HeapWordSize);
|
||||
|
||||
@ -2204,7 +2214,6 @@ methodHandle ClassFileParser::parse_method(ClassLoaderData* loader_data,
|
||||
// Fill in code attribute information
|
||||
m->set_max_stack(max_stack);
|
||||
m->set_max_locals(max_locals);
|
||||
|
||||
m->constMethod()->set_stackmap_data(stackmap_data);
|
||||
|
||||
// Copy byte codes
|
||||
@ -2356,6 +2365,7 @@ Array<Method*>* ClassFileParser::parse_methods(ClassLoaderData* loader_data,
|
||||
Array<AnnotationArray*>** methods_annotations,
|
||||
Array<AnnotationArray*>** methods_parameter_annotations,
|
||||
Array<AnnotationArray*>** methods_default_annotations,
|
||||
bool* has_default_methods,
|
||||
TRAPS) {
|
||||
ClassFileStream* cfs = stream();
|
||||
AnnotationArray* method_annotations = NULL;
|
||||
@ -2382,6 +2392,10 @@ Array<Method*>* ClassFileParser::parse_methods(ClassLoaderData* loader_data,
|
||||
if (method->is_final()) {
|
||||
*has_final_method = true;
|
||||
}
|
||||
if (is_interface && !method->is_abstract() && !method->is_static()) {
|
||||
// default method
|
||||
*has_default_methods = true;
|
||||
}
|
||||
methods->at_put(index, method());
|
||||
if (*methods_annotations == NULL) {
|
||||
*methods_annotations =
|
||||
@ -2907,6 +2921,34 @@ AnnotationArray* ClassFileParser::assemble_annotations(ClassLoaderData* loader_d
|
||||
}
|
||||
|
||||
|
||||
#ifndef PRODUCT
|
||||
static void parseAndPrintGenericSignatures(
|
||||
instanceKlassHandle this_klass, TRAPS) {
|
||||
assert(ParseAllGenericSignatures == true, "Shouldn't call otherwise");
|
||||
ResourceMark rm;
|
||||
|
||||
if (this_klass->generic_signature() != NULL) {
|
||||
using namespace generic;
|
||||
ClassDescriptor* spec = ClassDescriptor::parse_generic_signature(this_klass(), CHECK);
|
||||
|
||||
tty->print_cr("Parsing %s", this_klass->generic_signature()->as_C_string());
|
||||
spec->print_on(tty);
|
||||
|
||||
for (int i = 0; i < this_klass->methods()->length(); ++i) {
|
||||
Method* m = this_klass->methods()->at(i);
|
||||
MethodDescriptor* method_spec = MethodDescriptor::parse_generic_signature(m, spec);
|
||||
Symbol* sig = m->generic_signature();
|
||||
if (sig == NULL) {
|
||||
sig = m->signature();
|
||||
}
|
||||
tty->print_cr("Parsing %s", sig->as_C_string());
|
||||
method_spec->print_on(tty);
|
||||
}
|
||||
}
|
||||
}
|
||||
#endif // ndef PRODUCT
|
||||
|
||||
|
||||
instanceKlassHandle ClassFileParser::parseClassFile(Symbol* name,
|
||||
Handle class_loader,
|
||||
Handle protection_domain,
|
||||
@ -2923,6 +2965,8 @@ instanceKlassHandle ClassFileParser::parseClassFile(Symbol* name,
|
||||
unsigned char *cached_class_file_bytes = NULL;
|
||||
jint cached_class_file_length;
|
||||
ClassLoaderData* loader_data = ClassLoaderData::class_loader_data(class_loader());
|
||||
bool has_default_methods = false;
|
||||
ResourceMark rm(THREAD);
|
||||
|
||||
ClassFileStream* cfs = stream();
|
||||
// Timing
|
||||
@ -3138,7 +3182,9 @@ instanceKlassHandle ClassFileParser::parseClassFile(Symbol* name,
|
||||
if (itfs_len == 0) {
|
||||
local_interfaces = Universe::the_empty_klass_array();
|
||||
} else {
|
||||
local_interfaces = parse_interfaces(cp, itfs_len, loader_data, protection_domain, _class_name, CHECK_(nullHandle));
|
||||
local_interfaces = parse_interfaces(
|
||||
cp, itfs_len, loader_data, protection_domain, _class_name,
|
||||
&has_default_methods, CHECK_(nullHandle));
|
||||
}
|
||||
|
||||
u2 java_fields_count = 0;
|
||||
@ -3164,6 +3210,7 @@ instanceKlassHandle ClassFileParser::parseClassFile(Symbol* name,
|
||||
&methods_annotations,
|
||||
&methods_parameter_annotations,
|
||||
&methods_default_annotations,
|
||||
&has_default_methods,
|
||||
CHECK_(nullHandle));
|
||||
|
||||
// Additional attributes
|
||||
@ -3193,6 +3240,11 @@ instanceKlassHandle ClassFileParser::parseClassFile(Symbol* name,
|
||||
super_klass = instanceKlassHandle(THREAD, kh());
|
||||
}
|
||||
if (super_klass.not_null()) {
|
||||
|
||||
if (super_klass->has_default_methods()) {
|
||||
has_default_methods = true;
|
||||
}
|
||||
|
||||
if (super_klass->is_interface()) {
|
||||
ResourceMark rm(THREAD);
|
||||
Exceptions::fthrow(
|
||||
@ -3229,14 +3281,11 @@ instanceKlassHandle ClassFileParser::parseClassFile(Symbol* name,
|
||||
int itable_size = 0;
|
||||
int num_miranda_methods = 0;
|
||||
|
||||
klassVtable::compute_vtable_size_and_num_mirandas(vtable_size,
|
||||
num_miranda_methods,
|
||||
super_klass(),
|
||||
methods,
|
||||
access_flags,
|
||||
class_loader,
|
||||
class_name,
|
||||
local_interfaces,
|
||||
GrowableArray<Method*> all_mirandas(20);
|
||||
|
||||
klassVtable::compute_vtable_size_and_num_mirandas(
|
||||
&vtable_size, &num_miranda_methods, &all_mirandas, super_klass(), methods,
|
||||
access_flags, class_loader, class_name, local_interfaces,
|
||||
CHECK_(nullHandle));
|
||||
|
||||
// Size of Java itable (in words)
|
||||
@ -3656,6 +3705,7 @@ instanceKlassHandle ClassFileParser::parseClassFile(Symbol* name,
|
||||
|
||||
this_klass->set_minor_version(minor_version);
|
||||
this_klass->set_major_version(major_version);
|
||||
this_klass->set_has_default_methods(has_default_methods);
|
||||
|
||||
// Set up Method*::intrinsic_id as soon as we know the names of methods.
|
||||
// (We used to do this lazily, but now we query it in Rewriter,
|
||||
@ -3673,6 +3723,16 @@ instanceKlassHandle ClassFileParser::parseClassFile(Symbol* name,
|
||||
cached_class_file_length);
|
||||
}
|
||||
|
||||
// Fill in field values obtained by parse_classfile_attributes
|
||||
if (parsed_annotations.has_any_annotations())
|
||||
parsed_annotations.apply_to(this_klass);
|
||||
// Create annotations
|
||||
if (_annotations != NULL && this_klass->annotations() == NULL) {
|
||||
Annotations* anno = Annotations::allocate(loader_data, CHECK_NULL);
|
||||
this_klass->set_annotations(anno);
|
||||
}
|
||||
apply_parsed_class_attributes(this_klass);
|
||||
|
||||
// Miranda methods
|
||||
if ((num_miranda_methods > 0) ||
|
||||
// if this class introduced new miranda methods or
|
||||
@ -3682,18 +3742,6 @@ instanceKlassHandle ClassFileParser::parseClassFile(Symbol* name,
|
||||
this_klass->set_has_miranda_methods(); // then set a flag
|
||||
}
|
||||
|
||||
// Fill in field values obtained by parse_classfile_attributes
|
||||
if (parsed_annotations.has_any_annotations()) {
|
||||
parsed_annotations.apply_to(this_klass);
|
||||
}
|
||||
// Create annotations
|
||||
if (_annotations != NULL && this_klass->annotations() == NULL) {
|
||||
Annotations* anno = Annotations::allocate(loader_data, CHECK_NULL);
|
||||
this_klass->set_annotations(anno);
|
||||
}
|
||||
apply_parsed_class_attributes(this_klass);
|
||||
|
||||
// Compute transitive closure of interfaces this class implements
|
||||
this_klass->set_transitive_interfaces(transitive_interfaces);
|
||||
|
||||
// Fill in information needed to compute superclasses.
|
||||
@ -3702,6 +3750,7 @@ instanceKlassHandle ClassFileParser::parseClassFile(Symbol* name,
|
||||
// Initialize itable offset tables
|
||||
klassItable::setup_itable_offset_table(this_klass);
|
||||
|
||||
// Compute transitive closure of interfaces this class implements
|
||||
// Do final class setup
|
||||
fill_oop_maps(this_klass, nonstatic_oop_map_count, nonstatic_oop_offsets, nonstatic_oop_counts);
|
||||
|
||||
@ -3726,6 +3775,21 @@ instanceKlassHandle ClassFileParser::parseClassFile(Symbol* name,
|
||||
check_illegal_static_method(this_klass, CHECK_(nullHandle));
|
||||
}
|
||||
|
||||
|
||||
#ifdef ASSERT
|
||||
if (ParseAllGenericSignatures) {
|
||||
parseAndPrintGenericSignatures(this_klass, CHECK_(nullHandle));
|
||||
}
|
||||
#endif
|
||||
|
||||
// Generate any default methods - default methods are interface methods
|
||||
// that have a default implementation. This is new with Lambda project.
|
||||
if (has_default_methods && !access_flags.is_interface() &&
|
||||
local_interfaces->length() > 0) {
|
||||
DefaultMethods::generate_default_methods(
|
||||
this_klass(), &all_mirandas, CHECK_(nullHandle));
|
||||
}
|
||||
|
||||
// Allocate mirror and initialize static fields
|
||||
java_lang_Class::create_mirror(this_klass, CHECK_(nullHandle));
|
||||
|
||||
@ -3744,6 +3808,7 @@ instanceKlassHandle ClassFileParser::parseClassFile(Symbol* name,
|
||||
false /* not shared class */);
|
||||
|
||||
if (TraceClassLoading) {
|
||||
ResourceMark rm;
|
||||
// print in a single call to reduce interleaving of output
|
||||
if (cfs->source() != NULL) {
|
||||
tty->print("[Loaded %s from %s]\n", this_klass->external_name(),
|
||||
@ -3758,13 +3823,13 @@ instanceKlassHandle ClassFileParser::parseClassFile(Symbol* name,
|
||||
tty->print("[Loaded %s]\n", this_klass->external_name());
|
||||
}
|
||||
} else {
|
||||
ResourceMark rm;
|
||||
tty->print("[Loaded %s from %s]\n", this_klass->external_name(),
|
||||
InstanceKlass::cast(class_loader->klass())->external_name());
|
||||
}
|
||||
}
|
||||
|
||||
if (TraceClassResolution) {
|
||||
ResourceMark rm;
|
||||
// print out the superclass.
|
||||
const char * from = Klass::cast(this_klass())->external_name();
|
||||
if (this_klass->java_super() != NULL) {
|
||||
@ -3785,6 +3850,7 @@ instanceKlassHandle ClassFileParser::parseClassFile(Symbol* name,
|
||||
|
||||
#ifndef PRODUCT
|
||||
if( PrintCompactFieldsSavings ) {
|
||||
ResourceMark rm;
|
||||
if( nonstatic_field_size < orig_nonstatic_field_size ) {
|
||||
tty->print("[Saved %d of %d bytes in %s]\n",
|
||||
(orig_nonstatic_field_size - nonstatic_field_size)*heapOopSize,
|
||||
@ -3811,7 +3877,6 @@ instanceKlassHandle ClassFileParser::parseClassFile(Symbol* name,
|
||||
return this_klass;
|
||||
}
|
||||
|
||||
|
||||
unsigned int
|
||||
ClassFileParser::compute_oop_map_count(instanceKlassHandle super,
|
||||
unsigned int nonstatic_oop_map_count,
|
||||
@ -4128,7 +4193,7 @@ void ClassFileParser::check_final_method_override(instanceKlassHandle this_klass
|
||||
}
|
||||
|
||||
// continue to look from super_m's holder's super.
|
||||
k = InstanceKlass::cast(super_m->method_holder())->super();
|
||||
k = super_m->method_holder()->super();
|
||||
continue;
|
||||
}
|
||||
|
||||
@ -4263,13 +4328,16 @@ void ClassFileParser::verify_legal_method_modifiers(
|
||||
const bool is_strict = (flags & JVM_ACC_STRICT) != 0;
|
||||
const bool is_synchronized = (flags & JVM_ACC_SYNCHRONIZED) != 0;
|
||||
const bool major_gte_15 = _major_version >= JAVA_1_5_VERSION;
|
||||
const bool major_gte_8 = _major_version >= JAVA_8_VERSION;
|
||||
const bool is_initializer = (name == vmSymbols::object_initializer_name());
|
||||
|
||||
bool is_illegal = false;
|
||||
|
||||
if (is_interface) {
|
||||
if (!is_abstract || !is_public || is_static || is_final ||
|
||||
is_native || (major_gte_15 && (is_synchronized || is_strict))) {
|
||||
if (!is_public || is_static || is_final || is_native ||
|
||||
((is_synchronized || is_strict) && major_gte_15 &&
|
||||
(!major_gte_8 || is_abstract)) ||
|
||||
(!major_gte_8 && !is_abstract)) {
|
||||
is_illegal = true;
|
||||
}
|
||||
} else { // not interface
|
||||
|
@ -151,6 +151,7 @@ class ClassFileParser VALUE_OBJ_CLASS_SPEC {
|
||||
ClassLoaderData* loader_data,
|
||||
Handle protection_domain,
|
||||
Symbol* class_name,
|
||||
bool* has_default_methods,
|
||||
TRAPS);
|
||||
void record_defined_class_dependencies(instanceKlassHandle defined_klass, TRAPS);
|
||||
|
||||
@ -188,6 +189,7 @@ class ClassFileParser VALUE_OBJ_CLASS_SPEC {
|
||||
Array<AnnotationArray*>** methods_annotations,
|
||||
Array<AnnotationArray*>** methods_parameter_annotations,
|
||||
Array<AnnotationArray*>** methods_default_annotations,
|
||||
bool* has_default_method,
|
||||
TRAPS);
|
||||
Array<int>* sort_methods(ClassLoaderData* loader_data,
|
||||
Array<Method*>* methods,
|
||||
|
1387
hotspot/src/share/vm/classfile/defaultMethods.cpp
Normal file
1387
hotspot/src/share/vm/classfile/defaultMethods.cpp
Normal file
File diff suppressed because it is too large
Load Diff
58
hotspot/src/share/vm/classfile/defaultMethods.hpp
Normal file
58
hotspot/src/share/vm/classfile/defaultMethods.hpp
Normal file
@ -0,0 +1,58 @@
|
||||
/*
|
||||
* Copyright (c) 2012, Oracle and/or its affiliates. All rights reserved.
|
||||
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
||||
*
|
||||
* This code is free software; you can redistribute it and/or modify it
|
||||
* under the terms of the GNU General Public License version 2 only, as
|
||||
* published by the Free Software Foundation.
|
||||
*
|
||||
* This code is distributed in the hope that it will be useful, but WITHOUT
|
||||
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
||||
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
||||
* version 2 for more details (a copy is included in the LICENSE file that
|
||||
* accompanied this code).
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License version
|
||||
* 2 along with this work; if not, write to the Free Software Foundation,
|
||||
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
||||
*
|
||||
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
||||
* or visit www.oracle.com if you need additional information or have any
|
||||
* questions.
|
||||
*
|
||||
*/
|
||||
|
||||
#ifndef SHARE_VM_CLASSFILE_DEFAULTMETHODS_HPP
|
||||
#define SHARE_VM_CLASSFILE_DEFAULTMETHODS_HPP
|
||||
|
||||
#include "runtime/handles.hpp"
|
||||
#include "utilities/growableArray.hpp"
|
||||
#include "utilities/exceptions.hpp"
|
||||
|
||||
class InstanceKlass;
|
||||
class Symbol;
|
||||
class Method;
|
||||
|
||||
class DefaultMethods : AllStatic {
|
||||
public:
|
||||
|
||||
// Analyzes class and determines which default methods are inherited
|
||||
// from interfaces (and has no other implementation). For each method
|
||||
// (and each different signature the method could have), create an
|
||||
// "overpass" method that is an instance method that redirects to the
|
||||
// default method. Overpass methods are added to the methods lists for
|
||||
// the class.
|
||||
static void generate_default_methods(
|
||||
InstanceKlass* klass, GrowableArray<Method*>* mirandas, TRAPS);
|
||||
|
||||
|
||||
// Called during linking when an invokespecial to an direct interface
|
||||
// method is found. Selects and returns a method if there is a unique
|
||||
// default method in the 'super_iface' part of the hierarchy which is
|
||||
// also a candidate default for 'this_klass'. Otherwise throws an AME.
|
||||
static Method* find_super_default(
|
||||
Klass* this_klass, Klass* super_iface,
|
||||
Symbol* method_name, Symbol* method_sig, TRAPS);
|
||||
};
|
||||
|
||||
#endif // SHARE_VM_CLASSFILE_DEFAULTMETHODS_HPP
|
1272
hotspot/src/share/vm/classfile/genericSignatures.cpp
Normal file
1272
hotspot/src/share/vm/classfile/genericSignatures.cpp
Normal file
File diff suppressed because it is too large
Load Diff
467
hotspot/src/share/vm/classfile/genericSignatures.hpp
Normal file
467
hotspot/src/share/vm/classfile/genericSignatures.hpp
Normal file
@ -0,0 +1,467 @@
|
||||
/*
|
||||
* Copyright (c) 2012, Oracle and/or its affiliates. All rights reserved.
|
||||
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
||||
*
|
||||
* This code is free software; you can redistribute it and/or modify it
|
||||
* under the terms of the GNU General Public License version 2 only, as
|
||||
* published by the Free Software Foundation.
|
||||
*
|
||||
* This code is distributed in the hope that it will be useful, but WITHOUT
|
||||
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
||||
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
||||
* version 2 for more details (a copy is included in the LICENSE file that
|
||||
* accompanied this code).
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License version
|
||||
* 2 along with this work; if not, write to the Free Software Foundation,
|
||||
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
||||
*
|
||||
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
||||
* or visit www.oracle.com if you need additional information or have any
|
||||
* questions.
|
||||
*
|
||||
*/
|
||||
|
||||
#ifndef SHARE_VM_CLASSFILE_GENERICSIGNATURES_HPP
|
||||
#define SHARE_VM_CLASSFILE_GENERICSIGNATURES_HPP
|
||||
|
||||
#include "classfile/symbolTable.hpp"
|
||||
#include "memory/allocation.hpp"
|
||||
#include "runtime/signature.hpp"
|
||||
#include "utilities/growableArray.hpp"
|
||||
#include "utilities/resourceHash.hpp"
|
||||
|
||||
class stringStream;
|
||||
|
||||
namespace generic {
|
||||
|
||||
class Identifier;
|
||||
class ClassDescriptor;
|
||||
class MethodDescriptor;
|
||||
|
||||
class TypeParameter; // a formal type parameter declared in generic signatures
|
||||
class TypeArgument; // The "type value" passed to fill parameters in supertypes
|
||||
class TypeVariable; // A usage of a type parameter as a value
|
||||
/**
|
||||
* Example:
|
||||
*
|
||||
* <T, V> class Foo extends Bar<String> { int m(V v) {} }
|
||||
* ^^^^^^ ^^^^^^ ^^
|
||||
* type parameters type argument type variable
|
||||
*
|
||||
* Note that a type variable could be passed as an argument too:
|
||||
* <T, V> class Foo extends Bar<T> { int m(V v) {} }
|
||||
* ^^^
|
||||
* type argument's value is a type variable
|
||||
*/
|
||||
|
||||
|
||||
class Type;
|
||||
class ClassType;
|
||||
class ArrayType;
|
||||
class PrimitiveType;
|
||||
class Context;
|
||||
class DescriptorCache;
|
||||
|
||||
class DescriptorStream;
|
||||
|
||||
class Identifier : public ResourceObj {
|
||||
private:
|
||||
Symbol* _sym;
|
||||
int _begin;
|
||||
int _end;
|
||||
|
||||
public:
|
||||
Identifier(Symbol* sym, int begin, int end) :
|
||||
_sym(sym), _begin(begin), _end(end) {}
|
||||
|
||||
bool equals(Identifier* other);
|
||||
bool equals(Symbol* sym);
|
||||
|
||||
#ifndef PRODUCT
|
||||
void print_on(outputStream* str) const;
|
||||
#endif // ndef PRODUCT
|
||||
};
|
||||
|
||||
class Descriptor : public ResourceObj {
|
||||
protected:
|
||||
GrowableArray<TypeParameter*> _type_parameters;
|
||||
ClassDescriptor* _outer_class;
|
||||
|
||||
Descriptor(GrowableArray<TypeParameter*>& params,
|
||||
ClassDescriptor* outer)
|
||||
: _type_parameters(params), _outer_class(outer) {}
|
||||
|
||||
public:
|
||||
|
||||
ClassDescriptor* outer_class() { return _outer_class; }
|
||||
void set_outer_class(ClassDescriptor* sig) { _outer_class = sig; }
|
||||
|
||||
virtual ClassDescriptor* as_class_signature() { return NULL; }
|
||||
virtual MethodDescriptor* as_method_signature() { return NULL; }
|
||||
|
||||
bool is_class_signature() { return as_class_signature() != NULL; }
|
||||
bool is_method_signature() { return as_method_signature() != NULL; }
|
||||
|
||||
GrowableArray<TypeParameter*>& type_parameters() {
|
||||
return _type_parameters;
|
||||
}
|
||||
|
||||
TypeParameter* find_type_parameter(Identifier* id, int* param_depth);
|
||||
|
||||
virtual void bind_variables_to_parameters() = 0;
|
||||
|
||||
#ifndef PRODUCT
|
||||
virtual void print_on(outputStream* str) const = 0;
|
||||
#endif
|
||||
};
|
||||
|
||||
class ClassDescriptor : public Descriptor {
|
||||
private:
|
||||
ClassType* _super;
|
||||
GrowableArray<ClassType*> _interfaces;
|
||||
MethodDescriptor* _outer_method;
|
||||
|
||||
ClassDescriptor(GrowableArray<TypeParameter*>& ftp, ClassType* scs,
|
||||
GrowableArray<ClassType*>& sis, ClassDescriptor* outer_class = NULL,
|
||||
MethodDescriptor* outer_method = NULL)
|
||||
: Descriptor(ftp, outer_class), _super(scs), _interfaces(sis),
|
||||
_outer_method(outer_method) {}
|
||||
|
||||
static u2 get_outer_class_index(InstanceKlass* k, TRAPS);
|
||||
static ClassDescriptor* parse_generic_signature(Klass* k, Symbol* original_name, TRAPS);
|
||||
|
||||
public:
|
||||
|
||||
virtual ClassDescriptor* as_class_signature() { return this; }
|
||||
|
||||
MethodDescriptor* outer_method() { return _outer_method; }
|
||||
void set_outer_method(MethodDescriptor* m) { _outer_method = m; }
|
||||
|
||||
ClassType* super() { return _super; }
|
||||
ClassType* interface_desc(Symbol* sym);
|
||||
|
||||
static ClassDescriptor* parse_generic_signature(Klass* k, TRAPS);
|
||||
static ClassDescriptor* parse_generic_signature(Symbol* sym);
|
||||
|
||||
// For use in superclass chains in positions where this is no generic info
|
||||
static ClassDescriptor* placeholder(InstanceKlass* klass);
|
||||
|
||||
#ifndef PRODUCT
|
||||
void print_on(outputStream* str) const;
|
||||
#endif
|
||||
|
||||
ClassDescriptor* canonicalize(Context* ctx);
|
||||
|
||||
// Linking sets the position index in any contained TypeVariable type
|
||||
// to correspond to the location of that identifier in the formal type
|
||||
// parameters.
|
||||
void bind_variables_to_parameters();
|
||||
};
|
||||
|
||||
class MethodDescriptor : public Descriptor {
|
||||
private:
|
||||
GrowableArray<Type*> _parameters;
|
||||
Type* _return_type;
|
||||
GrowableArray<Type*> _throws;
|
||||
|
||||
MethodDescriptor(GrowableArray<TypeParameter*>& ftp, ClassDescriptor* outer,
|
||||
GrowableArray<Type*>& sigs, Type* rt, GrowableArray<Type*>& throws)
|
||||
: Descriptor(ftp, outer), _parameters(sigs), _return_type(rt),
|
||||
_throws(throws) {}
|
||||
|
||||
public:
|
||||
|
||||
static MethodDescriptor* parse_generic_signature(Method* m, ClassDescriptor* outer);
|
||||
static MethodDescriptor* parse_generic_signature(Symbol* sym, ClassDescriptor* outer);
|
||||
|
||||
MethodDescriptor* as_method_signature() { return this; }
|
||||
|
||||
// Performs generic analysis on the method parameters to determine
|
||||
// if both methods refer to the same argument types.
|
||||
bool covariant_match(MethodDescriptor* other, Context* ctx);
|
||||
|
||||
// Returns a new method descriptor with all generic variables
|
||||
// removed and replaced with whatever is indicated using the Context.
|
||||
MethodDescriptor* canonicalize(Context* ctx);
|
||||
|
||||
void bind_variables_to_parameters();
|
||||
|
||||
#ifndef PRODUCT
|
||||
TempNewSymbol reify_signature(Context* ctx, TRAPS);
|
||||
void print_on(outputStream* str) const;
|
||||
#endif
|
||||
};
|
||||
|
||||
class TypeParameter : public ResourceObj {
|
||||
private:
|
||||
Identifier* _identifier;
|
||||
ClassType* _class_bound;
|
||||
GrowableArray<ClassType*> _interface_bounds;
|
||||
|
||||
// The position is the ordinal location of the parameter within the
|
||||
// formal parameter list (excluding outer classes). It is only set for
|
||||
// formal type parameters that are associated with a class -- method
|
||||
// type parameters are left as -1. When resolving a generic variable to
|
||||
// find the actual type, this index is used to access the generic type
|
||||
// argument in the provided context object.
|
||||
int _position; // Assigned during variable linking
|
||||
|
||||
TypeParameter(Identifier* id, ClassType* class_bound,
|
||||
GrowableArray<ClassType*>& interface_bounds) :
|
||||
_identifier(id), _class_bound(class_bound),
|
||||
_interface_bounds(interface_bounds), _position(-1) {}
|
||||
|
||||
public:
|
||||
static TypeParameter* parse_generic_signature(DescriptorStream* str);
|
||||
|
||||
ClassType* bound();
|
||||
int position() { return _position; }
|
||||
|
||||
void bind_variables_to_parameters(Descriptor* sig, int position);
|
||||
Identifier* identifier() { return _identifier; }
|
||||
|
||||
Type* resolve(Context* ctx, int inner_depth, int ctx_depth);
|
||||
TypeParameter* canonicalize(Context* ctx, int ctx_depth);
|
||||
|
||||
#ifndef PRODUCT
|
||||
void print_on(outputStream* str) const;
|
||||
#endif
|
||||
};
|
||||
|
||||
class Type : public ResourceObj {
|
||||
public:
|
||||
static Type* parse_generic_signature(DescriptorStream* str);
|
||||
|
||||
virtual ClassType* as_class() { return NULL; }
|
||||
virtual TypeVariable* as_variable() { return NULL; }
|
||||
virtual ArrayType* as_array() { return NULL; }
|
||||
virtual PrimitiveType* as_primitive() { return NULL; }
|
||||
|
||||
virtual bool covariant_match(Type* gt, Context* ctx) = 0;
|
||||
virtual Type* canonicalize(Context* ctx, int ctx_depth) = 0;
|
||||
|
||||
virtual void bind_variables_to_parameters(Descriptor* sig) = 0;
|
||||
|
||||
#ifndef PRODUCT
|
||||
virtual void reify_signature(stringStream* ss, Context* ctx) = 0;
|
||||
virtual void print_on(outputStream* str) const = 0;
|
||||
#endif
|
||||
};
|
||||
|
||||
class ClassType : public Type {
|
||||
friend class ClassDescriptor;
|
||||
protected:
|
||||
Identifier* _identifier;
|
||||
GrowableArray<TypeArgument*> _type_arguments;
|
||||
ClassType* _outer_class;
|
||||
|
||||
ClassType(Identifier* identifier,
|
||||
GrowableArray<TypeArgument*>& args,
|
||||
ClassType* outer)
|
||||
: _identifier(identifier), _type_arguments(args), _outer_class(outer) {}
|
||||
|
||||
// Returns true if there are inner classes to read
|
||||
static Identifier* parse_generic_signature_simple(
|
||||
GrowableArray<TypeArgument*>* args,
|
||||
bool* has_inner, DescriptorStream* str);
|
||||
|
||||
static ClassType* parse_generic_signature(ClassType* outer,
|
||||
DescriptorStream* str);
|
||||
static ClassType* from_symbol(Symbol* sym);
|
||||
|
||||
public:
|
||||
ClassType* as_class() { return this; }
|
||||
|
||||
static ClassType* parse_generic_signature(DescriptorStream* str);
|
||||
static ClassType* java_lang_Object();
|
||||
|
||||
Identifier* identifier() { return _identifier; }
|
||||
int type_arguments_length() { return _type_arguments.length(); }
|
||||
TypeArgument* type_argument_at(int i);
|
||||
|
||||
virtual ClassType* outer_class() { return _outer_class; }
|
||||
|
||||
bool covariant_match(Type* gt, Context* ctx);
|
||||
ClassType* canonicalize(Context* ctx, int context_depth);
|
||||
|
||||
void bind_variables_to_parameters(Descriptor* sig);
|
||||
|
||||
#ifndef PRODUCT
|
||||
void reify_signature(stringStream* ss, Context* ctx);
|
||||
void print_on(outputStream* str) const;
|
||||
#endif
|
||||
};
|
||||
|
||||
class TypeVariable : public Type {
|
||||
private:
|
||||
Identifier* _id;
|
||||
TypeParameter* _parameter; // assigned during linking
|
||||
|
||||
// how many steps "out" from inner classes, -1 if method
|
||||
int _inner_depth;
|
||||
|
||||
TypeVariable(Identifier* id)
|
||||
: _id(id), _parameter(NULL), _inner_depth(0) {}
|
||||
|
||||
public:
|
||||
TypeVariable* as_variable() { return this; }
|
||||
|
||||
static TypeVariable* parse_generic_signature(DescriptorStream* str);
|
||||
|
||||
Identifier* identifier() { return _id; }
|
||||
TypeParameter* parameter() { return _parameter; }
|
||||
int inner_depth() { return _inner_depth; }
|
||||
|
||||
void bind_variables_to_parameters(Descriptor* sig);
|
||||
|
||||
Type* resolve(Context* ctx, int ctx_depth);
|
||||
bool covariant_match(Type* gt, Context* ctx);
|
||||
Type* canonicalize(Context* ctx, int ctx_depth);
|
||||
|
||||
#ifndef PRODUCT
|
||||
void reify_signature(stringStream* ss, Context* ctx);
|
||||
void print_on(outputStream* str) const;
|
||||
#endif
|
||||
};
|
||||
|
||||
class ArrayType : public Type {
|
||||
private:
|
||||
Type* _base;
|
||||
|
||||
ArrayType(Type* base) : _base(base) {}
|
||||
|
||||
public:
|
||||
ArrayType* as_array() { return this; }
|
||||
|
||||
static ArrayType* parse_generic_signature(DescriptorStream* str);
|
||||
|
||||
bool covariant_match(Type* gt, Context* ctx);
|
||||
ArrayType* canonicalize(Context* ctx, int ctx_depth);
|
||||
|
||||
void bind_variables_to_parameters(Descriptor* sig);
|
||||
|
||||
#ifndef PRODUCT
|
||||
void reify_signature(stringStream* ss, Context* ctx);
|
||||
void print_on(outputStream* str) const;
|
||||
#endif
|
||||
};
|
||||
|
||||
class PrimitiveType : public Type {
|
||||
friend class Type;
|
||||
private:
|
||||
char _type; // includes V for void
|
||||
|
||||
PrimitiveType(char& type) : _type(type) {}
|
||||
|
||||
public:
|
||||
PrimitiveType* as_primitive() { return this; }
|
||||
|
||||
bool covariant_match(Type* gt, Context* ctx);
|
||||
PrimitiveType* canonicalize(Context* ctx, int ctx_depth);
|
||||
|
||||
void bind_variables_to_parameters(Descriptor* sig);
|
||||
|
||||
#ifndef PRODUCT
|
||||
void reify_signature(stringStream* ss, Context* ctx);
|
||||
void print_on(outputStream* str) const;
|
||||
#endif
|
||||
};
|
||||
|
||||
class TypeArgument : public ResourceObj {
|
||||
private:
|
||||
Type* _lower_bound;
|
||||
Type* _upper_bound; // may be null or == _lower_bound
|
||||
|
||||
TypeArgument(Type* lower_bound, Type* upper_bound)
|
||||
: _lower_bound(lower_bound), _upper_bound(upper_bound) {}
|
||||
|
||||
public:
|
||||
|
||||
static TypeArgument* parse_generic_signature(DescriptorStream* str);
|
||||
|
||||
Type* lower_bound() { return _lower_bound; }
|
||||
Type* upper_bound() { return _upper_bound; }
|
||||
|
||||
void bind_variables_to_parameters(Descriptor* sig);
|
||||
TypeArgument* canonicalize(Context* ctx, int ctx_depth);
|
||||
|
||||
bool covariant_match(TypeArgument* a, Context* ctx);
|
||||
|
||||
#ifndef PRODUCT
|
||||
void print_on(outputStream* str) const;
|
||||
#endif
|
||||
};
|
||||
|
||||
|
||||
class Context : public ResourceObj {
|
||||
private:
|
||||
DescriptorCache* _cache;
|
||||
GrowableArray<ClassType*> _type_arguments;
|
||||
|
||||
void reset_to_mark(int size);
|
||||
|
||||
public:
|
||||
// When this object goes out of scope or 'destroy' is
|
||||
// called, then the application of the type to the
|
||||
// context is wound-back (unless it's been deactivated).
|
||||
class Mark : public StackObj {
|
||||
private:
|
||||
mutable Context* _context;
|
||||
int _marked_size;
|
||||
|
||||
bool is_active() const { return _context != NULL; }
|
||||
void deactivate() const { _context = NULL; }
|
||||
|
||||
public:
|
||||
Mark() : _context(NULL), _marked_size(0) {}
|
||||
Mark(Context* ctx, int sz) : _context(ctx), _marked_size(sz) {}
|
||||
Mark(const Mark& m) : _context(m._context), _marked_size(m._marked_size) {
|
||||
m.deactivate(); // Ownership is transferred
|
||||
}
|
||||
|
||||
Mark& operator=(const Mark& cm) {
|
||||
destroy();
|
||||
_context = cm._context;
|
||||
_marked_size = cm._marked_size;
|
||||
cm.deactivate();
|
||||
return *this;
|
||||
}
|
||||
|
||||
void destroy();
|
||||
~Mark() { destroy(); }
|
||||
};
|
||||
|
||||
Context(DescriptorCache* cache) : _cache(cache) {}
|
||||
|
||||
Mark mark() { return Mark(this, _type_arguments.length()); }
|
||||
void apply_type_arguments(InstanceKlass* current, InstanceKlass* super,TRAPS);
|
||||
|
||||
ClassType* at_depth(int i) const;
|
||||
|
||||
#ifndef PRODUCT
|
||||
void print_on(outputStream* str) const;
|
||||
#endif
|
||||
};
|
||||
|
||||
/**
|
||||
* Contains a cache of descriptors for classes and methods so they can be
|
||||
* looked-up instead of reparsing each time they are needed.
|
||||
*/
|
||||
class DescriptorCache : public ResourceObj {
|
||||
private:
|
||||
ResourceHashtable<InstanceKlass*, ClassDescriptor*> _class_descriptors;
|
||||
ResourceHashtable<Method*, MethodDescriptor*> _method_descriptors;
|
||||
|
||||
public:
|
||||
ClassDescriptor* descriptor_for(InstanceKlass* ikh, TRAPS);
|
||||
|
||||
MethodDescriptor* descriptor_for(Method* mh, ClassDescriptor* cd, TRAPS);
|
||||
// Class descriptor derived from method holder
|
||||
MethodDescriptor* descriptor_for(Method* mh, TRAPS);
|
||||
};
|
||||
|
||||
} // namespace generic
|
||||
|
||||
#endif // SHARE_VM_CLASSFILE_GENERICSIGNATURES_HPP
|
||||
|
@ -1156,7 +1156,7 @@ void java_lang_Throwable::print(Handle throwable, outputStream* st) {
|
||||
// Print stack trace element to resource allocated buffer
|
||||
char* java_lang_Throwable::print_stack_element_to_buffer(Method* method, int bci) {
|
||||
// Get strings and string lengths
|
||||
InstanceKlass* klass = InstanceKlass::cast(method->method_holder());
|
||||
InstanceKlass* klass = method->method_holder();
|
||||
const char* klass_name = klass->external_name();
|
||||
int buf_len = (int)strlen(klass_name);
|
||||
char* source_file_name;
|
||||
@ -1747,14 +1747,14 @@ oop java_lang_StackTraceElement::create(methodHandle method, int bci, TRAPS) {
|
||||
Handle element = ik->allocate_instance_handle(CHECK_0);
|
||||
// Fill in class name
|
||||
ResourceMark rm(THREAD);
|
||||
const char* str = InstanceKlass::cast(method->method_holder())->external_name();
|
||||
const char* str = method->method_holder()->external_name();
|
||||
oop classname = StringTable::intern((char*) str, CHECK_0);
|
||||
java_lang_StackTraceElement::set_declaringClass(element(), classname);
|
||||
// Fill in method name
|
||||
oop methodname = StringTable::intern(method->name(), CHECK_0);
|
||||
java_lang_StackTraceElement::set_methodName(element(), methodname);
|
||||
// Fill in source file name
|
||||
Symbol* source = InstanceKlass::cast(method->method_holder())->source_file_name();
|
||||
Symbol* source = method->method_holder()->source_file_name();
|
||||
if (ShowHiddenFrames && source == NULL)
|
||||
source = vmSymbols::unknown_class_name();
|
||||
oop filename = StringTable::intern(source, CHECK_0);
|
||||
|
@ -137,6 +137,7 @@ class SymbolPropertyTable;
|
||||
/* NOTE: needed too early in bootstrapping process to have checks based on JDK version */ \
|
||||
/* Universe::is_gte_jdk14x_version() is not set up by this point. */ \
|
||||
/* It's okay if this turns out to be NULL in non-1.4 JDKs. */ \
|
||||
do_klass(lambda_MagicLambdaImpl_klass, java_lang_invoke_MagicLambdaImpl, Opt ) \
|
||||
do_klass(reflect_MagicAccessorImpl_klass, sun_reflect_MagicAccessorImpl, Opt ) \
|
||||
do_klass(reflect_MethodAccessorImpl_klass, sun_reflect_MethodAccessorImpl, Opt_Only_JDK14NewRef) \
|
||||
do_klass(reflect_ConstructorAccessorImpl_klass, sun_reflect_ConstructorAccessorImpl, Opt_Only_JDK14NewRef) \
|
||||
|
@ -446,7 +446,7 @@ void ErrorContext::location_details(outputStream* ss, Method* method) const {
|
||||
bytecode_name = "<illegal>";
|
||||
}
|
||||
}
|
||||
InstanceKlass* ik = InstanceKlass::cast(method->method_holder());
|
||||
InstanceKlass* ik = method->method_holder();
|
||||
ss->indent().print_cr("Location:");
|
||||
streamIndentor si2(ss);
|
||||
ss->indent().print_cr("%s.%s%s @%d: %s",
|
||||
@ -555,9 +555,10 @@ void ClassVerifier::verify_class(TRAPS) {
|
||||
if (was_recursively_verified()) return;
|
||||
|
||||
Method* m = methods->at(index);
|
||||
if (m->is_native() || m->is_abstract()) {
|
||||
if (m->is_native() || m->is_abstract() || m->is_overpass()) {
|
||||
// If m is native or abstract, skip it. It is checked in class file
|
||||
// parser that methods do not override a final method.
|
||||
// parser that methods do not override a final method. Overpass methods
|
||||
// are trusted since the VM generates them.
|
||||
continue;
|
||||
}
|
||||
verify_method(methodHandle(THREAD, m), CHECK_VERIFY(this));
|
||||
@ -1849,7 +1850,7 @@ void ClassVerifier::verify_cp_index(
|
||||
if ((index <= 0) || (index >= nconstants)) {
|
||||
verify_error(ErrorContext::bad_cp_index(bci, index),
|
||||
"Illegal constant pool index %d in class %s",
|
||||
index, InstanceKlass::cast(cp->pool_holder())->external_name());
|
||||
index, cp->pool_holder()->external_name());
|
||||
return;
|
||||
}
|
||||
}
|
||||
@ -1868,7 +1869,7 @@ void ClassVerifier::verify_cp_type(
|
||||
if ((types & (1 << tag)) == 0) {
|
||||
verify_error(ErrorContext::bad_cp_index(bci, index),
|
||||
"Illegal type at constant pool entry %d in class %s",
|
||||
index, InstanceKlass::cast(cp->pool_holder())->external_name());
|
||||
index, cp->pool_holder()->external_name());
|
||||
return;
|
||||
}
|
||||
}
|
||||
@ -1880,7 +1881,7 @@ void ClassVerifier::verify_cp_class_type(
|
||||
if (!tag.is_klass() && !tag.is_unresolved_klass()) {
|
||||
verify_error(ErrorContext::bad_cp_index(bci, index),
|
||||
"Illegal type at constant pool entry %d in class %s",
|
||||
index, InstanceKlass::cast(cp->pool_holder())->external_name());
|
||||
index, cp->pool_holder()->external_name());
|
||||
return;
|
||||
}
|
||||
}
|
||||
@ -2304,11 +2305,21 @@ void ClassVerifier::verify_invoke_instructions(
|
||||
// Make sure the constant pool item is the right type
|
||||
u2 index = bcs->get_index_u2();
|
||||
Bytecodes::Code opcode = bcs->raw_code();
|
||||
unsigned int types = (opcode == Bytecodes::_invokeinterface
|
||||
? 1 << JVM_CONSTANT_InterfaceMethodref
|
||||
: opcode == Bytecodes::_invokedynamic
|
||||
? 1 << JVM_CONSTANT_InvokeDynamic
|
||||
: 1 << JVM_CONSTANT_Methodref);
|
||||
unsigned int types;
|
||||
switch (opcode) {
|
||||
case Bytecodes::_invokeinterface:
|
||||
types = 1 << JVM_CONSTANT_InterfaceMethodref;
|
||||
break;
|
||||
case Bytecodes::_invokedynamic:
|
||||
types = 1 << JVM_CONSTANT_InvokeDynamic;
|
||||
break;
|
||||
case Bytecodes::_invokespecial:
|
||||
types = (1 << JVM_CONSTANT_InterfaceMethodref) |
|
||||
(1 << JVM_CONSTANT_Methodref);
|
||||
break;
|
||||
default:
|
||||
types = 1 << JVM_CONSTANT_Methodref;
|
||||
}
|
||||
verify_cp_type(bcs->bci(), index, cp, types, CHECK_VERIFY(this));
|
||||
|
||||
// Get method name and signature
|
||||
|
@ -507,7 +507,7 @@ static vmIntrinsics::ID match_method_with_klass(Method* m, Symbol* mk) {
|
||||
}
|
||||
|
||||
void vmIntrinsics::verify_method(ID actual_id, Method* m) {
|
||||
Symbol* mk = Klass::cast(m->method_holder())->name();
|
||||
Symbol* mk = m->method_holder()->name();
|
||||
ID declared_id = match_method_with_klass(m, mk);
|
||||
|
||||
if (declared_id == actual_id) return; // success
|
||||
|
@ -259,6 +259,7 @@
|
||||
template(java_lang_invoke_DontInline_signature, "Ljava/lang/invoke/DontInline;") \
|
||||
template(java_lang_invoke_LambdaForm_Compiled_signature, "Ljava/lang/invoke/LambdaForm$Compiled;") \
|
||||
template(java_lang_invoke_LambdaForm_Hidden_signature, "Ljava/lang/invoke/LambdaForm$Hidden;") \
|
||||
template(java_lang_invoke_MagicLambdaImpl, "java/lang/invoke/MagicLambdaImpl") \
|
||||
/* internal up-calls made only by the JVM, via class sun.invoke.MethodHandleNatives: */ \
|
||||
template(findMethodHandleType_name, "findMethodHandleType") \
|
||||
template(findMethodHandleType_signature, "(Ljava/lang/Class;[Ljava/lang/Class;)Ljava/lang/invoke/MethodType;") \
|
||||
|
@ -191,8 +191,8 @@ void CompiledIC::set_to_megamorphic(CallInfo* call_info, Bytecodes::Code bytecod
|
||||
int index = klassItable::compute_itable_index(call_info->resolved_method()());
|
||||
entry = VtableStubs::create_stub(false, index, method());
|
||||
assert(entry != NULL, "entry not computed");
|
||||
Klass* k = call_info->resolved_method()->method_holder();
|
||||
assert(Klass::cast(k)->is_interface(), "sanity check");
|
||||
InstanceKlass* k = call_info->resolved_method()->method_holder();
|
||||
assert(k->is_interface(), "sanity check");
|
||||
InlineCacheBuffer::create_transition_stub(this, k, entry);
|
||||
} else {
|
||||
// Can be different than method->vtable_index(), due to package-private etc.
|
||||
|
@ -829,7 +829,7 @@ class ClassHierarchyWalker {
|
||||
}
|
||||
if ( !Dependencies::is_concrete_method(lm)
|
||||
&& !Dependencies::is_concrete_method(m)
|
||||
&& Klass::cast(lm->method_holder())->is_subtype_of(m->method_holder()))
|
||||
&& lm->method_holder()->is_subtype_of(m->method_holder()))
|
||||
// Method m is overridden by lm, but both are non-concrete.
|
||||
return true;
|
||||
}
|
||||
@ -1160,7 +1160,11 @@ bool Dependencies::is_concrete_method(Method* m) {
|
||||
|
||||
// We could also return false if m does not yet appear to be
|
||||
// executed, if the VM version supports this distinction also.
|
||||
return !m->is_abstract();
|
||||
return !m->is_abstract() &&
|
||||
!InstanceKlass::cast(m->method_holder())->is_interface();
|
||||
// TODO: investigate whether default methods should be
|
||||
// considered as "concrete" in this situation. For now they
|
||||
// are not.
|
||||
}
|
||||
|
||||
|
||||
|
@ -1263,7 +1263,7 @@ void nmethod::invalidate_osr_method() {
|
||||
assert(_entry_bci != InvocationEntryBci, "wrong kind of nmethod");
|
||||
// Remove from list of active nmethods
|
||||
if (method() != NULL)
|
||||
InstanceKlass::cast(method()->method_holder())->remove_osr_nmethod(this);
|
||||
method()->method_holder()->remove_osr_nmethod(this);
|
||||
// Set entry as invalid
|
||||
_entry_bci = InvalidOSREntryBci;
|
||||
}
|
||||
|
@ -1051,7 +1051,7 @@ void CompileBroker::compile_method_base(methodHandle method,
|
||||
guarantee(!method->is_abstract(), "cannot compile abstract methods");
|
||||
assert(method->method_holder()->oop_is_instance(),
|
||||
"sanity check");
|
||||
assert(!InstanceKlass::cast(method->method_holder())->is_not_initialized(),
|
||||
assert(!method->method_holder()->is_not_initialized(),
|
||||
"method holder must be initialized");
|
||||
assert(!method->is_method_handle_intrinsic(), "do not enqueue these guys");
|
||||
|
||||
@ -1206,7 +1206,7 @@ nmethod* CompileBroker::compile_method(methodHandle method, int osr_bci,
|
||||
assert(method->method_holder()->oop_is_instance(), "not an instance method");
|
||||
assert(osr_bci == InvocationEntryBci || (0 <= osr_bci && osr_bci < method->code_size()), "bci out of range");
|
||||
assert(!method->is_abstract() && (osr_bci == InvocationEntryBci || !method->is_native()), "cannot compile abstract/native methods");
|
||||
assert(!InstanceKlass::cast(method->method_holder())->is_not_initialized(), "method holder must be initialized");
|
||||
assert(!method->method_holder()->is_not_initialized(), "method holder must be initialized");
|
||||
|
||||
if (!TieredCompilation) {
|
||||
comp_level = CompLevel_highest_tier;
|
||||
|
@ -67,7 +67,7 @@ class MethodMatcher : public CHeapObj<mtCompiler> {
|
||||
|
||||
// utility method
|
||||
MethodMatcher* find(methodHandle method) {
|
||||
Symbol* class_name = Klass::cast(method->method_holder())->name();
|
||||
Symbol* class_name = method->method_holder()->name();
|
||||
Symbol* method_name = method->name();
|
||||
for (MethodMatcher* current = this; current != NULL; current = current->_next) {
|
||||
if (match(class_name, current->class_name(), current->_class_mode) &&
|
||||
@ -624,7 +624,7 @@ void CompilerOracle::append_exclude_to_file(methodHandle method) {
|
||||
assert(has_command_file(), "command file must be specified");
|
||||
fileStream stream(fopen(cc_file(), "at"));
|
||||
stream.print("exclude ");
|
||||
Klass::cast(method->method_holder())->name()->print_symbol_on(&stream);
|
||||
method->method_holder()->name()->print_symbol_on(&stream);
|
||||
stream.print(".");
|
||||
method->name()->print_symbol_on(&stream);
|
||||
method->signature()->print_symbol_on(&stream);
|
||||
|
@ -55,16 +55,18 @@ void* Disassembler::_library = NULL;
|
||||
bool Disassembler::_tried_to_load_library = false;
|
||||
|
||||
// This routine is in the shared library:
|
||||
Disassembler::decode_func_virtual Disassembler::_decode_instructions_virtual = NULL;
|
||||
Disassembler::decode_func Disassembler::_decode_instructions = NULL;
|
||||
|
||||
static const char hsdis_library_name[] = "hsdis-"HOTSPOT_LIB_ARCH;
|
||||
static const char decode_instructions_name[] = "decode_instructions_virtual";
|
||||
|
||||
static const char decode_instructions_virtual_name[] = "decode_instructions_virtual";
|
||||
static const char decode_instructions_name[] = "decode_instructions";
|
||||
static bool use_new_version = true;
|
||||
#define COMMENT_COLUMN 40 LP64_ONLY(+8) /*could be an option*/
|
||||
#define BYTES_COMMENT ";..." /* funky byte display comment */
|
||||
|
||||
bool Disassembler::load_library() {
|
||||
if (_decode_instructions != NULL) {
|
||||
if (_decode_instructions_virtual != NULL || _decode_instructions != NULL) {
|
||||
// Already succeeded.
|
||||
return true;
|
||||
}
|
||||
@ -123,11 +125,19 @@ bool Disassembler::load_library() {
|
||||
_library = os::dll_load(buf, ebuf, sizeof ebuf);
|
||||
}
|
||||
if (_library != NULL) {
|
||||
_decode_instructions_virtual = CAST_TO_FN_PTR(Disassembler::decode_func_virtual,
|
||||
os::dll_lookup(_library, decode_instructions_virtual_name));
|
||||
}
|
||||
if (_decode_instructions_virtual == NULL) {
|
||||
// could not spot in new version, try old version
|
||||
_decode_instructions = CAST_TO_FN_PTR(Disassembler::decode_func,
|
||||
os::dll_lookup(_library, decode_instructions_name));
|
||||
use_new_version = false;
|
||||
} else {
|
||||
use_new_version = true;
|
||||
}
|
||||
_tried_to_load_library = true;
|
||||
if (_decode_instructions == NULL) {
|
||||
if (_decode_instructions_virtual == NULL && _decode_instructions == NULL) {
|
||||
tty->print_cr("Could not load %s; %s; %s", buf,
|
||||
((_library != NULL)
|
||||
? "entry point is missing"
|
||||
@ -450,17 +460,31 @@ address decode_env::decode_instructions(address start, address end) {
|
||||
// This is mainly for debugging the library itself.
|
||||
FILE* out = stdout;
|
||||
FILE* xmlout = (_print_raw > 1 ? out : NULL);
|
||||
return (address)
|
||||
(*Disassembler::_decode_instructions)((uintptr_t)start, (uintptr_t)end,
|
||||
start, end - start,
|
||||
return use_new_version ?
|
||||
(address)
|
||||
(*Disassembler::_decode_instructions_virtual)((uintptr_t)start, (uintptr_t)end,
|
||||
start, end - start,
|
||||
NULL, (void*) xmlout,
|
||||
NULL, (void*) out,
|
||||
options(), 0/*nice new line*/)
|
||||
:
|
||||
(address)
|
||||
(*Disassembler::_decode_instructions)(start, end,
|
||||
NULL, (void*) xmlout,
|
||||
NULL, (void*) out,
|
||||
options());
|
||||
}
|
||||
|
||||
return (address)
|
||||
(*Disassembler::_decode_instructions)((uintptr_t)start, (uintptr_t)end,
|
||||
start, end - start,
|
||||
return use_new_version ?
|
||||
(address)
|
||||
(*Disassembler::_decode_instructions_virtual)((uintptr_t)start, (uintptr_t)end,
|
||||
start, end - start,
|
||||
&event_to_env, (void*) this,
|
||||
&printf_to_env, (void*) this,
|
||||
options(), 0/*nice new line*/)
|
||||
:
|
||||
(address)
|
||||
(*Disassembler::_decode_instructions)(start, end,
|
||||
&event_to_env, (void*) this,
|
||||
&printf_to_env, (void*) this,
|
||||
options());
|
||||
|
@ -49,8 +49,16 @@ class Disassembler {
|
||||
friend class decode_env;
|
||||
private:
|
||||
// this is the type of the dll entry point:
|
||||
typedef void* (*decode_func)(uintptr_t start_va, uintptr_t end_va,
|
||||
typedef void* (*decode_func_virtual)(uintptr_t start_va, uintptr_t end_va,
|
||||
unsigned char* buffer, uintptr_t length,
|
||||
void* (*event_callback)(void*, const char*, void*),
|
||||
void* event_stream,
|
||||
int (*printf_callback)(void*, const char*, ...),
|
||||
void* printf_stream,
|
||||
const char* options,
|
||||
int newline);
|
||||
// this is the type of the dll entry point for old version:
|
||||
typedef void* (*decode_func)(void* start_va, void* end_va,
|
||||
void* (*event_callback)(void*, const char*, void*),
|
||||
void* event_stream,
|
||||
int (*printf_callback)(void*, const char*, ...),
|
||||
@ -61,6 +69,7 @@ class Disassembler {
|
||||
// bailout
|
||||
static bool _tried_to_load_library;
|
||||
// points to the decode function.
|
||||
static decode_func_virtual _decode_instructions_virtual;
|
||||
static decode_func _decode_instructions;
|
||||
// tries to load library and return whether it succedded.
|
||||
static bool load_library();
|
||||
@ -85,7 +94,9 @@ class Disassembler {
|
||||
|
||||
public:
|
||||
static bool can_decode() {
|
||||
return (_decode_instructions != NULL) || load_library();
|
||||
return (_decode_instructions_virtual != NULL) ||
|
||||
(_decode_instructions != NULL) ||
|
||||
load_library();
|
||||
}
|
||||
static void decode(CodeBlob *cb, outputStream* st = NULL);
|
||||
static void decode(nmethod* nm, outputStream* st = NULL);
|
||||
|
@ -733,12 +733,7 @@ IRT_ENTRY(void, InterpreterRuntime::resolve_invokehandle(JavaThread* thread)) {
|
||||
get_index_u2_cpcache(thread, bytecode), bytecode, CHECK);
|
||||
} // end JvmtiHideSingleStepping
|
||||
|
||||
cache_entry(thread)->set_method_handle(
|
||||
pool,
|
||||
info.resolved_method(),
|
||||
info.resolved_appendix(),
|
||||
info.resolved_method_type(),
|
||||
pool->resolved_references());
|
||||
cache_entry(thread)->set_method_handle(pool, info);
|
||||
}
|
||||
IRT_END
|
||||
|
||||
@ -762,12 +757,7 @@ IRT_ENTRY(void, InterpreterRuntime::resolve_invokedynamic(JavaThread* thread)) {
|
||||
} // end JvmtiHideSingleStepping
|
||||
|
||||
ConstantPoolCacheEntry* cp_cache_entry = pool->invokedynamic_cp_cache_entry_at(index);
|
||||
cp_cache_entry->set_dynamic_call(
|
||||
pool,
|
||||
info.resolved_method(),
|
||||
info.resolved_appendix(),
|
||||
info.resolved_method_type(),
|
||||
pool->resolved_references());
|
||||
cp_cache_entry->set_dynamic_call(pool, info);
|
||||
}
|
||||
IRT_END
|
||||
|
||||
|
@ -23,6 +23,7 @@
|
||||
*/
|
||||
|
||||
#include "precompiled.hpp"
|
||||
#include "classfile/defaultMethods.hpp"
|
||||
#include "classfile/systemDictionary.hpp"
|
||||
#include "classfile/vmSymbols.hpp"
|
||||
#include "compiler/compileBroker.hpp"
|
||||
@ -132,7 +133,7 @@ void CallInfo::set_common(KlassHandle resolved_klass, KlassHandle selected_klass
|
||||
// don't force compilation, resolve was on behalf of compiler
|
||||
return;
|
||||
}
|
||||
if (InstanceKlass::cast(selected_method->method_holder())->is_not_initialized()) {
|
||||
if (selected_method->method_holder()->is_not_initialized()) {
|
||||
// 'is_not_initialized' means not only '!is_initialized', but also that
|
||||
// initialization has not been started yet ('!being_initialized')
|
||||
// Do not force compilation of methods in uninitialized classes.
|
||||
@ -404,21 +405,13 @@ void LinkResolver::resolve_method(methodHandle& resolved_method, KlassHandle res
|
||||
Symbol* method_name, Symbol* method_signature,
|
||||
KlassHandle current_klass, bool check_access, TRAPS) {
|
||||
|
||||
// 1. check if klass is not interface
|
||||
if (resolved_klass->is_interface()) {
|
||||
ResourceMark rm(THREAD);
|
||||
char buf[200];
|
||||
jio_snprintf(buf, sizeof(buf), "Found interface %s, but class was expected", Klass::cast(resolved_klass())->external_name());
|
||||
THROW_MSG(vmSymbols::java_lang_IncompatibleClassChangeError(), buf);
|
||||
}
|
||||
|
||||
Handle nested_exception;
|
||||
|
||||
// 2. lookup method in resolved klass and its super klasses
|
||||
// 1. lookup method in resolved klass and its super klasses
|
||||
lookup_method_in_klasses(resolved_method, resolved_klass, method_name, method_signature, CHECK);
|
||||
|
||||
if (resolved_method.is_null()) { // not found in the class hierarchy
|
||||
// 3. lookup method in all the interfaces implemented by the resolved klass
|
||||
// 2. lookup method in all the interfaces implemented by the resolved klass
|
||||
lookup_method_in_interfaces(resolved_method, resolved_klass, method_name, method_signature, CHECK);
|
||||
|
||||
if (resolved_method.is_null()) {
|
||||
@ -432,7 +425,7 @@ void LinkResolver::resolve_method(methodHandle& resolved_method, KlassHandle res
|
||||
}
|
||||
|
||||
if (resolved_method.is_null()) {
|
||||
// 4. method lookup failed
|
||||
// 3. method lookup failed
|
||||
ResourceMark rm(THREAD);
|
||||
THROW_MSG_CAUSE(vmSymbols::java_lang_NoSuchMethodError(),
|
||||
Method::name_and_sig_as_C_string(Klass::cast(resolved_klass()),
|
||||
@ -442,6 +435,15 @@ void LinkResolver::resolve_method(methodHandle& resolved_method, KlassHandle res
|
||||
}
|
||||
}
|
||||
|
||||
// 4. check if klass is not interface
|
||||
if (resolved_klass->is_interface() && resolved_method->is_abstract()) {
|
||||
ResourceMark rm(THREAD);
|
||||
char buf[200];
|
||||
jio_snprintf(buf, sizeof(buf), "Found interface %s, but class was expected",
|
||||
resolved_klass()->external_name());
|
||||
THROW_MSG(vmSymbols::java_lang_IncompatibleClassChangeError(), buf);
|
||||
}
|
||||
|
||||
// 5. check if method is concrete
|
||||
if (resolved_method->is_abstract() && !resolved_klass->is_abstract()) {
|
||||
ResourceMark rm(THREAD);
|
||||
@ -464,7 +466,7 @@ void LinkResolver::resolve_method(methodHandle& resolved_method, KlassHandle res
|
||||
|
||||
// check loader constraints
|
||||
Handle loader (THREAD, InstanceKlass::cast(current_klass())->class_loader());
|
||||
Handle class_loader (THREAD, InstanceKlass::cast(resolved_method->method_holder())->class_loader());
|
||||
Handle class_loader (THREAD, resolved_method->method_holder()->class_loader());
|
||||
{
|
||||
ResourceMark rm(THREAD);
|
||||
char* failed_type_name =
|
||||
@ -526,7 +528,7 @@ void LinkResolver::resolve_interface_method(methodHandle& resolved_method,
|
||||
if (check_access) {
|
||||
HandleMark hm(THREAD);
|
||||
Handle loader (THREAD, InstanceKlass::cast(current_klass())->class_loader());
|
||||
Handle class_loader (THREAD, InstanceKlass::cast(resolved_method->method_holder())->class_loader());
|
||||
Handle class_loader (THREAD, resolved_method->method_holder()->class_loader());
|
||||
{
|
||||
ResourceMark rm(THREAD);
|
||||
char* failed_type_name =
|
||||
@ -743,6 +745,27 @@ void LinkResolver::linktime_resolve_special_method(methodHandle& resolved_method
|
||||
Symbol* method_name, Symbol* method_signature,
|
||||
KlassHandle current_klass, bool check_access, TRAPS) {
|
||||
|
||||
if (resolved_klass->is_interface() && current_klass() != NULL) {
|
||||
// If the target class is a direct interface, treat this as a "super"
|
||||
// default call.
|
||||
//
|
||||
// If the current method is an overpass that happens to call a direct
|
||||
// super-interface's method, then we'll end up rerunning the default method
|
||||
// analysis even though we don't need to, but that's ok since it will end
|
||||
// up with the same answer.
|
||||
InstanceKlass* ik = InstanceKlass::cast(current_klass());
|
||||
Array<Klass*>* interfaces = ik->local_interfaces();
|
||||
int num_interfaces = interfaces->length();
|
||||
for (int index = 0; index < num_interfaces; index++) {
|
||||
if (interfaces->at(index) == resolved_klass()) {
|
||||
Method* method = DefaultMethods::find_super_default(current_klass(),
|
||||
resolved_klass(), method_name, method_signature, CHECK);
|
||||
resolved_method = methodHandle(THREAD, method);
|
||||
return;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
resolve_method(resolved_method, resolved_klass, method_name, method_signature, current_klass, check_access, CHECK);
|
||||
|
||||
// check if method name is <init>, that it is found in same klass as static type
|
||||
@ -784,11 +807,17 @@ void LinkResolver::runtime_resolve_special_method(CallInfo& result, methodHandle
|
||||
{ KlassHandle method_klass = KlassHandle(THREAD,
|
||||
resolved_method->method_holder());
|
||||
|
||||
if (check_access &&
|
||||
const bool direct_calling_default_method =
|
||||
resolved_klass() != NULL && resolved_method() != NULL &&
|
||||
resolved_klass->is_interface() && !resolved_method->is_abstract();
|
||||
|
||||
if (!direct_calling_default_method &&
|
||||
check_access &&
|
||||
// a) check if ACC_SUPER flag is set for the current class
|
||||
current_klass->is_super() &&
|
||||
// b) check if the method class is a superclass of the current class (superclass relation is not reflexive!)
|
||||
current_klass->is_subtype_of(method_klass()) && current_klass() != method_klass() &&
|
||||
current_klass->is_subtype_of(method_klass()) &&
|
||||
current_klass() != method_klass() &&
|
||||
// c) check if the method is not <init>
|
||||
resolved_method->name() != vmSymbols::object_initializer_name()) {
|
||||
// Lookup super method
|
||||
@ -881,12 +910,12 @@ void LinkResolver::runtime_resolve_virtual_method(CallInfo& result,
|
||||
|
||||
// Virtual methods cannot be resolved before its klass has been linked, for otherwise the Method*'s
|
||||
// has not been rewritten, and the vtable initialized.
|
||||
assert(InstanceKlass::cast(resolved_method->method_holder())->is_linked(), "must be linked");
|
||||
assert(resolved_method->method_holder()->is_linked(), "must be linked");
|
||||
|
||||
// Virtual methods cannot be resolved before its klass has been linked, for otherwise the Method*'s
|
||||
// has not been rewritten, and the vtable initialized. Make sure to do this after the nullcheck, since
|
||||
// a missing receiver might result in a bogus lookup.
|
||||
assert(InstanceKlass::cast(resolved_method->method_holder())->is_linked(), "must be linked");
|
||||
assert(resolved_method->method_holder()->is_linked(), "must be linked");
|
||||
|
||||
// do lookup based on receiver klass using the vtable index
|
||||
if (resolved_method->method_holder()->is_interface()) { // miranda method
|
||||
|
@ -34,29 +34,30 @@ const u2 ConstMethod::MAX_IDNUM = 0xFFFE;
|
||||
const u2 ConstMethod::UNSET_IDNUM = 0xFFFF;
|
||||
|
||||
ConstMethod* ConstMethod::allocate(ClassLoaderData* loader_data,
|
||||
int byte_code_size,
|
||||
int compressed_line_number_size,
|
||||
int localvariable_table_length,
|
||||
int exception_table_length,
|
||||
int checked_exceptions_length,
|
||||
TRAPS) {
|
||||
int byte_code_size,
|
||||
int compressed_line_number_size,
|
||||
int localvariable_table_length,
|
||||
int exception_table_length,
|
||||
int checked_exceptions_length,
|
||||
MethodType method_type,
|
||||
TRAPS) {
|
||||
int size = ConstMethod::size(byte_code_size,
|
||||
compressed_line_number_size,
|
||||
localvariable_table_length,
|
||||
exception_table_length,
|
||||
checked_exceptions_length);
|
||||
return new (loader_data, size, true, THREAD) ConstMethod(
|
||||
byte_code_size, compressed_line_number_size,
|
||||
localvariable_table_length, exception_table_length,
|
||||
checked_exceptions_length, size);
|
||||
byte_code_size, compressed_line_number_size, localvariable_table_length,
|
||||
exception_table_length, checked_exceptions_length, method_type, size);
|
||||
}
|
||||
|
||||
ConstMethod::ConstMethod(int byte_code_size,
|
||||
int compressed_line_number_size,
|
||||
int localvariable_table_length,
|
||||
int exception_table_length,
|
||||
int checked_exceptions_length,
|
||||
int size) {
|
||||
int compressed_line_number_size,
|
||||
int localvariable_table_length,
|
||||
int exception_table_length,
|
||||
int checked_exceptions_length,
|
||||
MethodType method_type,
|
||||
int size) {
|
||||
|
||||
No_Safepoint_Verifier no_safepoint;
|
||||
set_interpreter_kind(Interpreter::invalid);
|
||||
@ -69,6 +70,7 @@ ConstMethod::ConstMethod(int byte_code_size,
|
||||
compressed_line_number_size,
|
||||
localvariable_table_length,
|
||||
exception_table_length);
|
||||
set_method_type(method_type);
|
||||
assert(this->size() == size, "wrong size for object");
|
||||
}
|
||||
|
||||
@ -111,8 +113,7 @@ int ConstMethod::size(int code_size,
|
||||
}
|
||||
|
||||
Method* ConstMethod::method() const {
|
||||
return InstanceKlass::cast(_constants->pool_holder())->method_with_idnum(
|
||||
_method_idnum);
|
||||
return _constants->pool_holder()->method_with_idnum(_method_idnum);
|
||||
}
|
||||
|
||||
// linenumber table - note that length is unknown until decompression,
|
||||
|
@ -108,12 +108,17 @@ class ExceptionTableElement VALUE_OBJ_CLASS_SPEC {
|
||||
|
||||
class ConstMethod : public MetaspaceObj {
|
||||
friend class VMStructs;
|
||||
|
||||
public:
|
||||
typedef enum { NORMAL, OVERPASS } MethodType;
|
||||
|
||||
private:
|
||||
enum {
|
||||
_has_linenumber_table = 1,
|
||||
_has_checked_exceptions = 2,
|
||||
_has_localvariable_table = 4,
|
||||
_has_exception_table = 8
|
||||
_has_exception_table = 8,
|
||||
_is_overpass = 16
|
||||
};
|
||||
|
||||
// Bit vector of signature
|
||||
@ -145,19 +150,22 @@ private:
|
||||
|
||||
// Constructor
|
||||
ConstMethod(int byte_code_size,
|
||||
int compressed_line_number_size,
|
||||
int localvariable_table_length,
|
||||
int exception_table_length,
|
||||
int checked_exceptions_length,
|
||||
int size);
|
||||
int compressed_line_number_size,
|
||||
int localvariable_table_length,
|
||||
int exception_table_length,
|
||||
int checked_exceptions_length,
|
||||
MethodType is_overpass,
|
||||
int size);
|
||||
public:
|
||||
|
||||
static ConstMethod* allocate(ClassLoaderData* loader_data,
|
||||
int byte_code_size,
|
||||
int compressed_line_number_size,
|
||||
int localvariable_table_length,
|
||||
int exception_table_length,
|
||||
int checked_exceptions_length,
|
||||
TRAPS);
|
||||
int byte_code_size,
|
||||
int compressed_line_number_size,
|
||||
int localvariable_table_length,
|
||||
int exception_table_length,
|
||||
int checked_exceptions_length,
|
||||
MethodType mt,
|
||||
TRAPS);
|
||||
|
||||
bool is_constMethod() const { return true; }
|
||||
|
||||
@ -179,6 +187,19 @@ public:
|
||||
bool has_exception_handler() const
|
||||
{ return (_flags & _has_exception_table) != 0; }
|
||||
|
||||
MethodType method_type() const {
|
||||
return ((_flags & _is_overpass) == 0) ? NORMAL : OVERPASS;
|
||||
}
|
||||
|
||||
void set_method_type(MethodType mt) {
|
||||
if (mt == NORMAL) {
|
||||
_flags &= ~(_is_overpass);
|
||||
} else {
|
||||
_flags |= _is_overpass;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
void set_interpreter_kind(int kind) { _interpreter_kind = kind; }
|
||||
int interpreter_kind(void) const { return _interpreter_kind; }
|
||||
|
||||
|
@ -228,7 +228,7 @@ Klass* ConstantPool::klass_at_impl(constantPoolHandle this_oop, int which, TRAPS
|
||||
} else {
|
||||
do_resolve = true;
|
||||
name = this_oop->unresolved_klass_at(which);
|
||||
loader = Handle(THREAD, InstanceKlass::cast(this_oop->pool_holder())->class_loader());
|
||||
loader = Handle(THREAD, this_oop->pool_holder()->class_loader());
|
||||
}
|
||||
}
|
||||
} // unlocking constantPool
|
||||
@ -247,7 +247,7 @@ Klass* ConstantPool::klass_at_impl(constantPoolHandle this_oop, int which, TRAPS
|
||||
|
||||
if (do_resolve) {
|
||||
// this_oop must be unlocked during resolve_or_fail
|
||||
oop protection_domain = Klass::cast(this_oop->pool_holder())->protection_domain();
|
||||
oop protection_domain = this_oop->pool_holder()->protection_domain();
|
||||
Handle h_prot (THREAD, protection_domain);
|
||||
Klass* k_oop = SystemDictionary::resolve_or_fail(name, loader, h_prot, true, THREAD);
|
||||
KlassHandle k;
|
||||
@ -315,7 +315,7 @@ Klass* ConstantPool::klass_at_impl(constantPoolHandle this_oop, int which, TRAPS
|
||||
vframeStream vfst(JavaThread::current());
|
||||
if (!vfst.at_end()) {
|
||||
line_number = vfst.method()->line_number_from_bci(vfst.bci());
|
||||
Symbol* s = InstanceKlass::cast(vfst.method()->method_holder())->source_file_name();
|
||||
Symbol* s = vfst.method()->method_holder()->source_file_name();
|
||||
if (s != NULL) {
|
||||
source_file = s->as_C_string();
|
||||
}
|
||||
@ -325,11 +325,11 @@ Klass* ConstantPool::klass_at_impl(constantPoolHandle this_oop, int which, TRAPS
|
||||
// only print something if the classes are different
|
||||
if (source_file != NULL) {
|
||||
tty->print("RESOLVE %s %s %s:%d\n",
|
||||
InstanceKlass::cast(this_oop->pool_holder())->external_name(),
|
||||
this_oop->pool_holder()->external_name(),
|
||||
InstanceKlass::cast(k())->external_name(), source_file, line_number);
|
||||
} else {
|
||||
tty->print("RESOLVE %s %s\n",
|
||||
InstanceKlass::cast(this_oop->pool_holder())->external_name(),
|
||||
this_oop->pool_holder()->external_name(),
|
||||
InstanceKlass::cast(k())->external_name());
|
||||
}
|
||||
}
|
||||
@ -339,7 +339,7 @@ Klass* ConstantPool::klass_at_impl(constantPoolHandle this_oop, int which, TRAPS
|
||||
// Only updated constant pool - if it is resolved.
|
||||
do_resolve = this_oop->tag_at(which).is_unresolved_klass();
|
||||
if (do_resolve) {
|
||||
ClassLoaderData* this_key = InstanceKlass::cast(this_oop->pool_holder())->class_loader_data();
|
||||
ClassLoaderData* this_key = this_oop->pool_holder()->class_loader_data();
|
||||
if (!this_key->is_the_null_class_loader_data()) {
|
||||
this_key->record_dependency(k(), CHECK_NULL); // Can throw OOM
|
||||
}
|
||||
@ -367,8 +367,8 @@ Klass* ConstantPool::klass_at_if_loaded(constantPoolHandle this_oop, int which)
|
||||
assert(entry.is_unresolved(), "must be either symbol or klass");
|
||||
Thread *thread = Thread::current();
|
||||
Symbol* name = entry.get_symbol();
|
||||
oop loader = InstanceKlass::cast(this_oop->pool_holder())->class_loader();
|
||||
oop protection_domain = Klass::cast(this_oop->pool_holder())->protection_domain();
|
||||
oop loader = this_oop->pool_holder()->class_loader();
|
||||
oop protection_domain = this_oop->pool_holder()->protection_domain();
|
||||
Handle h_prot (thread, protection_domain);
|
||||
Handle h_loader (thread, loader);
|
||||
Klass* k = SystemDictionary::find(name, h_loader, h_prot, thread);
|
||||
@ -409,8 +409,8 @@ Klass* ConstantPool::klass_ref_at_if_loaded_check(constantPoolHandle this_oop, i
|
||||
} else {
|
||||
assert(entry.is_unresolved(), "must be either symbol or klass");
|
||||
Symbol* name = entry.get_symbol();
|
||||
oop loader = InstanceKlass::cast(this_oop->pool_holder())->class_loader();
|
||||
oop protection_domain = Klass::cast(this_oop->pool_holder())->protection_domain();
|
||||
oop loader = this_oop->pool_holder()->class_loader();
|
||||
oop protection_domain = this_oop->pool_holder()->protection_domain();
|
||||
Handle h_loader(THREAD, loader);
|
||||
Handle h_prot (THREAD, protection_domain);
|
||||
KlassHandle k(THREAD, SystemDictionary::find(name, h_loader, h_prot, THREAD));
|
||||
@ -1143,16 +1143,21 @@ void ConstantPool::copy_cp_to_impl(constantPoolHandle from_cp, int start_i, int
|
||||
int from_oplen = operand_array_length(from_cp->operands());
|
||||
int old_oplen = operand_array_length(to_cp->operands());
|
||||
if (from_oplen != 0) {
|
||||
ClassLoaderData* loader_data = to_cp->pool_holder()->class_loader_data();
|
||||
// append my operands to the target's operands array
|
||||
if (old_oplen == 0) {
|
||||
to_cp->set_operands(from_cp->operands()); // reuse; do not merge
|
||||
// Can't just reuse from_cp's operand list because of deallocation issues
|
||||
int len = from_cp->operands()->length();
|
||||
Array<u2>* new_ops = MetadataFactory::new_array<u2>(loader_data, len, CHECK);
|
||||
Copy::conjoint_memory_atomic(
|
||||
from_cp->operands()->adr_at(0), new_ops->adr_at(0), len * sizeof(u2));
|
||||
to_cp->set_operands(new_ops);
|
||||
} else {
|
||||
int old_len = to_cp->operands()->length();
|
||||
int from_len = from_cp->operands()->length();
|
||||
int old_off = old_oplen * sizeof(u2);
|
||||
int from_off = from_oplen * sizeof(u2);
|
||||
// Use the metaspace for the destination constant pool
|
||||
ClassLoaderData* loader_data = to_cp->pool_holder()->class_loader_data();
|
||||
Array<u2>* new_operands = MetadataFactory::new_array<u2>(loader_data, old_len + from_len, CHECK);
|
||||
int fillp = 0, len = 0;
|
||||
// first part of dest
|
||||
@ -1785,7 +1790,7 @@ void ConstantPool::patch_resolved_references(
|
||||
assert(cp_patches->at(index).is_null(),
|
||||
err_msg("Unused constant pool patch at %d in class file %s",
|
||||
index,
|
||||
InstanceKlass::cast(pool_holder())->external_name()));
|
||||
pool_holder()->external_name()));
|
||||
}
|
||||
#endif // ASSERT
|
||||
}
|
||||
@ -1943,7 +1948,7 @@ void ConstantPool::print_value_on(outputStream* st) const {
|
||||
st->print(" for ");
|
||||
pool_holder()->print_value_on(st);
|
||||
if (pool_holder() != NULL) {
|
||||
bool extra = (InstanceKlass::cast(pool_holder())->constants() != this);
|
||||
bool extra = (pool_holder()->constants() != this);
|
||||
if (extra) st->print(" (extra)");
|
||||
}
|
||||
if (cache() != NULL) {
|
||||
|
@ -86,8 +86,8 @@ class ConstantPool : public Metadata {
|
||||
friend class Universe; // For null constructor
|
||||
private:
|
||||
Array<u1>* _tags; // the tag array describing the constant pool's contents
|
||||
ConstantPoolCache* _cache; // the cache holding interpreter runtime information
|
||||
Klass* _pool_holder; // the corresponding class
|
||||
ConstantPoolCache* _cache; // the cache holding interpreter runtime information
|
||||
InstanceKlass* _pool_holder; // the corresponding class
|
||||
Array<u2>* _operands; // for variable-sized (InvokeDynamic) nodes, usually empty
|
||||
|
||||
// Array of resolved objects from the constant pool and map from resolved
|
||||
@ -193,9 +193,9 @@ class ConstantPool : public Metadata {
|
||||
void set_on_stack(const bool value);
|
||||
|
||||
// Klass holding pool
|
||||
Klass* pool_holder() const { return _pool_holder; }
|
||||
void set_pool_holder(Klass* k) { _pool_holder = k; }
|
||||
Klass** pool_holder_addr() { return &_pool_holder; }
|
||||
InstanceKlass* pool_holder() const { return _pool_holder; }
|
||||
void set_pool_holder(InstanceKlass* k) { _pool_holder = k; }
|
||||
InstanceKlass** pool_holder_addr() { return &_pool_holder; }
|
||||
|
||||
// Interpreter runtime support
|
||||
ConstantPoolCache* cache() const { return _cache; }
|
||||
|
@ -231,8 +231,8 @@ void ConstantPoolCacheEntry::set_method(Bytecodes::Code invoke_code,
|
||||
|
||||
|
||||
void ConstantPoolCacheEntry::set_interface_call(methodHandle method, int index) {
|
||||
Klass* interf = method->method_holder();
|
||||
assert(InstanceKlass::cast(interf)->is_interface(), "must be an interface");
|
||||
InstanceKlass* interf = method->method_holder();
|
||||
assert(interf->is_interface(), "must be an interface");
|
||||
assert(!method->is_final_method(), "interfaces do not have final methods; cannot link to one here");
|
||||
set_f1(interf);
|
||||
set_f2(index);
|
||||
@ -243,25 +243,17 @@ void ConstantPoolCacheEntry::set_interface_call(methodHandle method, int index)
|
||||
}
|
||||
|
||||
|
||||
void ConstantPoolCacheEntry::set_method_handle(constantPoolHandle cpool,
|
||||
methodHandle adapter,
|
||||
Handle appendix, Handle method_type,
|
||||
objArrayHandle resolved_references) {
|
||||
set_method_handle_common(cpool, Bytecodes::_invokehandle, adapter, appendix, method_type, resolved_references);
|
||||
void ConstantPoolCacheEntry::set_method_handle(constantPoolHandle cpool, const CallInfo &call_info) {
|
||||
set_method_handle_common(cpool, Bytecodes::_invokehandle, call_info);
|
||||
}
|
||||
|
||||
void ConstantPoolCacheEntry::set_dynamic_call(constantPoolHandle cpool,
|
||||
methodHandle adapter,
|
||||
Handle appendix, Handle method_type,
|
||||
objArrayHandle resolved_references) {
|
||||
set_method_handle_common(cpool, Bytecodes::_invokedynamic, adapter, appendix, method_type, resolved_references);
|
||||
void ConstantPoolCacheEntry::set_dynamic_call(constantPoolHandle cpool, const CallInfo &call_info) {
|
||||
set_method_handle_common(cpool, Bytecodes::_invokedynamic, call_info);
|
||||
}
|
||||
|
||||
void ConstantPoolCacheEntry::set_method_handle_common(constantPoolHandle cpool,
|
||||
Bytecodes::Code invoke_code,
|
||||
methodHandle adapter,
|
||||
Handle appendix, Handle method_type,
|
||||
objArrayHandle resolved_references) {
|
||||
const CallInfo &call_info) {
|
||||
// NOTE: This CPCE can be the subject of data races.
|
||||
// There are three words to update: flags, refs[f2], f1 (in that order).
|
||||
// Writers must store all other values before f1.
|
||||
@ -276,6 +268,9 @@ void ConstantPoolCacheEntry::set_method_handle_common(constantPoolHandle cpool,
|
||||
return;
|
||||
}
|
||||
|
||||
const methodHandle adapter = call_info.resolved_method();
|
||||
const Handle appendix = call_info.resolved_appendix();
|
||||
const Handle method_type = call_info.resolved_method_type();
|
||||
const bool has_appendix = appendix.not_null();
|
||||
const bool has_method_type = method_type.not_null();
|
||||
|
||||
@ -315,6 +310,7 @@ void ConstantPoolCacheEntry::set_method_handle_common(constantPoolHandle cpool,
|
||||
// This allows us to create fewer method oops, while keeping type safety.
|
||||
//
|
||||
|
||||
objArrayHandle resolved_references = cpool->resolved_references();
|
||||
// Store appendix, if any.
|
||||
if (has_appendix) {
|
||||
const int appendix_index = f2_as_index() + _indy_resolved_references_appendix_offset;
|
||||
@ -421,7 +417,7 @@ bool ConstantPoolCacheEntry::adjust_method_entry(Method* old_method,
|
||||
if (!(*trace_name_printed)) {
|
||||
// RC_TRACE_MESG macro has an embedded ResourceMark
|
||||
RC_TRACE_MESG(("adjust: name=%s",
|
||||
Klass::cast(old_method->method_holder())->external_name()));
|
||||
old_method->method_holder()->external_name()));
|
||||
*trace_name_printed = true;
|
||||
}
|
||||
// RC_TRACE macro has an embedded ResourceMark
|
||||
@ -449,7 +445,7 @@ bool ConstantPoolCacheEntry::adjust_method_entry(Method* old_method,
|
||||
if (!(*trace_name_printed)) {
|
||||
// RC_TRACE_MESG macro has an embedded ResourceMark
|
||||
RC_TRACE_MESG(("adjust: name=%s",
|
||||
Klass::cast(old_method->method_holder())->external_name()));
|
||||
old_method->method_holder()->external_name()));
|
||||
*trace_name_printed = true;
|
||||
}
|
||||
// RC_TRACE macro has an embedded ResourceMark
|
||||
|
@ -117,6 +117,8 @@ class PSPromotionManager;
|
||||
// The fields are volatile so that they are stored in the order written in the
|
||||
// source code. The _indices field with the bytecode must be written last.
|
||||
|
||||
class CallInfo;
|
||||
|
||||
class ConstantPoolCacheEntry VALUE_OBJ_CLASS_SPEC {
|
||||
friend class VMStructs;
|
||||
friend class constantPoolCacheKlass;
|
||||
@ -223,18 +225,12 @@ class ConstantPoolCacheEntry VALUE_OBJ_CLASS_SPEC {
|
||||
|
||||
void set_method_handle(
|
||||
constantPoolHandle cpool, // holding constant pool (required for locking)
|
||||
methodHandle method, // adapter for invokeExact, etc.
|
||||
Handle appendix, // stored in refs[f2+0]; could be a java.lang.invoke.MethodType
|
||||
Handle method_type, // stored in refs[f2+1]; is a java.lang.invoke.MethodType
|
||||
objArrayHandle resolved_references
|
||||
const CallInfo &call_info // Call link information
|
||||
);
|
||||
|
||||
void set_dynamic_call(
|
||||
constantPoolHandle cpool, // holding constant pool (required for locking)
|
||||
methodHandle method, // adapter for this call site
|
||||
Handle appendix, // stored in refs[f2+0]; could be a java.lang.invoke.CallSite
|
||||
Handle method_type, // stored in refs[f2+1]; is a java.lang.invoke.MethodType
|
||||
objArrayHandle resolved_references
|
||||
const CallInfo &call_info // Call link information
|
||||
);
|
||||
|
||||
// Common code for invokedynamic and MH invocations.
|
||||
@ -255,10 +251,7 @@ class ConstantPoolCacheEntry VALUE_OBJ_CLASS_SPEC {
|
||||
void set_method_handle_common(
|
||||
constantPoolHandle cpool, // holding constant pool (required for locking)
|
||||
Bytecodes::Code invoke_code, // _invokehandle or _invokedynamic
|
||||
methodHandle adapter, // invoker method (f1)
|
||||
Handle appendix, // appendix such as CallSite, MethodType, etc. (refs[f2+0])
|
||||
Handle method_type, // MethodType (refs[f2+1])
|
||||
objArrayHandle resolved_references
|
||||
const CallInfo &call_info // Call link information
|
||||
);
|
||||
|
||||
// invokedynamic and invokehandle call sites have two entries in the
|
||||
|
@ -743,6 +743,35 @@ void InstanceKlass::initialize_impl(instanceKlassHandle this_oop, TRAPS) {
|
||||
}
|
||||
}
|
||||
|
||||
if (this_oop->has_default_methods()) {
|
||||
// Step 7.5: initialize any interfaces which have default methods
|
||||
for (int i = 0; i < this_oop->local_interfaces()->length(); ++i) {
|
||||
Klass* iface = this_oop->local_interfaces()->at(i);
|
||||
InstanceKlass* ik = InstanceKlass::cast(iface);
|
||||
if (ik->has_default_methods() && ik->should_be_initialized()) {
|
||||
ik->initialize(THREAD);
|
||||
|
||||
if (HAS_PENDING_EXCEPTION) {
|
||||
Handle e(THREAD, PENDING_EXCEPTION);
|
||||
CLEAR_PENDING_EXCEPTION;
|
||||
{
|
||||
EXCEPTION_MARK;
|
||||
// Locks object, set state, and notify all waiting threads
|
||||
this_oop->set_initialization_state_and_notify(
|
||||
initialization_error, THREAD);
|
||||
|
||||
// ignore any exception thrown, superclass initialization error is
|
||||
// thrown below
|
||||
CLEAR_PENDING_EXCEPTION;
|
||||
}
|
||||
DTRACE_CLASSINIT_PROBE_WAIT(
|
||||
super__failed, InstanceKlass::cast(this_oop()), -1, wait);
|
||||
THROW_OOP(e());
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// Step 8
|
||||
{
|
||||
assert(THREAD->is_Java_thread(), "non-JavaThread in initialize_impl");
|
||||
@ -1252,11 +1281,7 @@ static int linear_search(Array<Method*>* methods, Symbol* name, Symbol* signatur
|
||||
}
|
||||
#endif
|
||||
|
||||
Method* InstanceKlass::find_method(Symbol* name, Symbol* signature) const {
|
||||
return InstanceKlass::find_method(methods(), name, signature);
|
||||
}
|
||||
|
||||
Method* InstanceKlass::find_method(Array<Method*>* methods, Symbol* name, Symbol* signature) {
|
||||
static int binary_search(Array<Method*>* methods, Symbol* name) {
|
||||
int len = methods->length();
|
||||
// methods are sorted, so do binary search
|
||||
int l = 0;
|
||||
@ -1267,43 +1292,70 @@ Method* InstanceKlass::find_method(Array<Method*>* methods, Symbol* name, Symbol
|
||||
assert(m->is_method(), "must be method");
|
||||
int res = m->name()->fast_compare(name);
|
||||
if (res == 0) {
|
||||
// found matching name; do linear search to find matching signature
|
||||
// first, quick check for common case
|
||||
if (m->signature() == signature) return m;
|
||||
// search downwards through overloaded methods
|
||||
int i;
|
||||
for (i = mid - 1; i >= l; i--) {
|
||||
Method* m = methods->at(i);
|
||||
assert(m->is_method(), "must be method");
|
||||
if (m->name() != name) break;
|
||||
if (m->signature() == signature) return m;
|
||||
}
|
||||
// search upwards
|
||||
for (i = mid + 1; i <= h; i++) {
|
||||
Method* m = methods->at(i);
|
||||
assert(m->is_method(), "must be method");
|
||||
if (m->name() != name) break;
|
||||
if (m->signature() == signature) return m;
|
||||
}
|
||||
// not found
|
||||
#ifdef ASSERT
|
||||
int index = linear_search(methods, name, signature);
|
||||
assert(index == -1, err_msg("binary search should have found entry %d", index));
|
||||
#endif
|
||||
return NULL;
|
||||
return mid;
|
||||
} else if (res < 0) {
|
||||
l = mid + 1;
|
||||
} else {
|
||||
h = mid - 1;
|
||||
}
|
||||
}
|
||||
return -1;
|
||||
}
|
||||
|
||||
Method* InstanceKlass::find_method(Symbol* name, Symbol* signature) const {
|
||||
return InstanceKlass::find_method(methods(), name, signature);
|
||||
}
|
||||
|
||||
Method* InstanceKlass::find_method(
|
||||
Array<Method*>* methods, Symbol* name, Symbol* signature) {
|
||||
int hit = binary_search(methods, name);
|
||||
if (hit != -1) {
|
||||
Method* m = methods->at(hit);
|
||||
// Do linear search to find matching signature. First, quick check
|
||||
// for common case
|
||||
if (m->signature() == signature) return m;
|
||||
// search downwards through overloaded methods
|
||||
int i;
|
||||
for (i = hit - 1; i >= 0; --i) {
|
||||
Method* m = methods->at(i);
|
||||
assert(m->is_method(), "must be method");
|
||||
if (m->name() != name) break;
|
||||
if (m->signature() == signature) return m;
|
||||
}
|
||||
// search upwards
|
||||
for (i = hit + 1; i < methods->length(); ++i) {
|
||||
Method* m = methods->at(i);
|
||||
assert(m->is_method(), "must be method");
|
||||
if (m->name() != name) break;
|
||||
if (m->signature() == signature) return m;
|
||||
}
|
||||
// not found
|
||||
#ifdef ASSERT
|
||||
int index = linear_search(methods, name, signature);
|
||||
assert(index == -1, err_msg("binary search should have found entry %d", index));
|
||||
int index = linear_search(methods, name, signature);
|
||||
assert(index == -1, err_msg("binary search should have found entry %d", index));
|
||||
#endif
|
||||
}
|
||||
return NULL;
|
||||
}
|
||||
|
||||
int InstanceKlass::find_method_by_name(Symbol* name, int* end) {
|
||||
return find_method_by_name(methods(), name, end);
|
||||
}
|
||||
|
||||
int InstanceKlass::find_method_by_name(
|
||||
Array<Method*>* methods, Symbol* name, int* end_ptr) {
|
||||
assert(end_ptr != NULL, "just checking");
|
||||
int start = binary_search(methods, name);
|
||||
int end = start + 1;
|
||||
if (start != -1) {
|
||||
while (start - 1 >= 0 && (methods->at(start - 1))->name() == name) --start;
|
||||
while (end < methods->length() && (methods->at(end))->name() == name) ++end;
|
||||
*end_ptr = end;
|
||||
return start;
|
||||
}
|
||||
return -1;
|
||||
}
|
||||
|
||||
Method* InstanceKlass::uncached_lookup_method(Symbol* name, Symbol* signature) const {
|
||||
Klass* klass = const_cast<InstanceKlass*>(this);
|
||||
while (klass != NULL) {
|
||||
|
@ -245,6 +245,10 @@ class InstanceKlass: public Klass {
|
||||
unsigned char * _cached_class_file_bytes; // JVMTI: cached class file, before retransformable agent modified it in CFLH
|
||||
jint _cached_class_file_len; // JVMTI: length of above
|
||||
JvmtiCachedClassFieldMap* _jvmti_cached_class_field_map; // JVMTI: used during heap iteration
|
||||
|
||||
// true if class, superclass, or implemented interfaces have default methods
|
||||
bool _has_default_methods;
|
||||
|
||||
volatile u2 _idnum_allocated_count; // JNI/JVMTI: increments with the addition of methods, old ids don't change
|
||||
// Method array.
|
||||
Array<Method*>* _methods;
|
||||
@ -492,6 +496,13 @@ class InstanceKlass: public Klass {
|
||||
// (returns NULL if not found)
|
||||
Method* lookup_method_in_all_interfaces(Symbol* name, Symbol* signature) const;
|
||||
|
||||
// Find method indices by name. If a method with the specified name is
|
||||
// found the index to the first method is returned, and 'end' is filled in
|
||||
// with the index of first non-name-matching method. If no method is found
|
||||
// -1 is returned.
|
||||
int find_method_by_name(Symbol* name, int* end);
|
||||
static int find_method_by_name(Array<Method*>* methods, Symbol* name, int* end);
|
||||
|
||||
// constant pool
|
||||
ConstantPool* constants() const { return _constants; }
|
||||
void set_constants(ConstantPool* c) { _constants = c; }
|
||||
@ -592,6 +603,9 @@ class InstanceKlass: public Klass {
|
||||
return _jvmti_cached_class_field_map;
|
||||
}
|
||||
|
||||
bool has_default_methods() const { return _has_default_methods; }
|
||||
void set_has_default_methods(bool b) { _has_default_methods = b; }
|
||||
|
||||
// for adding methods, ConstMethod::UNSET_IDNUM means no more ids available
|
||||
inline u2 next_method_idnum();
|
||||
void set_initial_method_idnum(u2 value) { _idnum_allocated_count = value; }
|
||||
@ -728,7 +742,6 @@ class InstanceKlass: public Klass {
|
||||
GrowableArray<Klass*>* compute_secondary_supers(int num_extra_slots);
|
||||
bool compute_is_subtype_of(Klass* k);
|
||||
bool can_be_primary_super_slow() const;
|
||||
Klass* java_super() const { return super(); }
|
||||
int oop_size(oop obj) const { return size_helper(); }
|
||||
bool oop_is_instance_slow() const { return true; }
|
||||
|
||||
@ -750,6 +763,10 @@ class InstanceKlass: public Klass {
|
||||
return (InstanceKlass*) k;
|
||||
}
|
||||
|
||||
InstanceKlass* java_super() const {
|
||||
return (super() == NULL) ? NULL : cast(super());
|
||||
}
|
||||
|
||||
// Sizing (in words)
|
||||
static int header_size() { return align_object_offset(sizeof(InstanceKlass)/HeapWordSize); }
|
||||
static int size(int vtable_length, int itable_length,
|
||||
|
@ -54,22 +54,16 @@ inline InstanceKlass* klassVtable::ik() const {
|
||||
// the same name and signature as m), then m is a Miranda method which is
|
||||
// entered as a public abstract method in C's vtable. From then on it should
|
||||
// treated as any other public method in C for method over-ride purposes.
|
||||
void klassVtable::compute_vtable_size_and_num_mirandas(int &vtable_length,
|
||||
int &num_miranda_methods,
|
||||
Klass* super,
|
||||
Array<Method*>* methods,
|
||||
AccessFlags class_flags,
|
||||
Handle classloader,
|
||||
Symbol* classname,
|
||||
Array<Klass*>* local_interfaces,
|
||||
TRAPS
|
||||
) {
|
||||
|
||||
void klassVtable::compute_vtable_size_and_num_mirandas(
|
||||
int* vtable_length_ret, int* num_new_mirandas,
|
||||
GrowableArray<Method*>* all_mirandas, Klass* super,
|
||||
Array<Method*>* methods, AccessFlags class_flags,
|
||||
Handle classloader, Symbol* classname, Array<Klass*>* local_interfaces,
|
||||
TRAPS) {
|
||||
No_Safepoint_Verifier nsv;
|
||||
|
||||
// set up default result values
|
||||
vtable_length = 0;
|
||||
num_miranda_methods = 0;
|
||||
int vtable_length = 0;
|
||||
|
||||
// start off with super's vtable length
|
||||
InstanceKlass* sk = (InstanceKlass*)super;
|
||||
@ -86,9 +80,12 @@ void klassVtable::compute_vtable_size_and_num_mirandas(int &vtable_length,
|
||||
}
|
||||
}
|
||||
|
||||
GrowableArray<Method*> new_mirandas(20);
|
||||
// compute the number of mirandas methods that must be added to the end
|
||||
num_miranda_methods = get_num_mirandas(super, methods, local_interfaces);
|
||||
vtable_length += (num_miranda_methods * vtableEntry::size());
|
||||
get_mirandas(&new_mirandas, all_mirandas, super, methods, local_interfaces);
|
||||
*num_new_mirandas = new_mirandas.length();
|
||||
|
||||
vtable_length += *num_new_mirandas * vtableEntry::size();
|
||||
|
||||
if (Universe::is_bootstrapping() && vtable_length == 0) {
|
||||
// array classes don't have their superclass set correctly during
|
||||
@ -109,6 +106,8 @@ void klassVtable::compute_vtable_size_and_num_mirandas(int &vtable_length,
|
||||
"bad vtable size for class Object");
|
||||
assert(vtable_length % vtableEntry::size() == 0, "bad vtable length");
|
||||
assert(vtable_length >= Universe::base_vtable_size(), "vtable too small");
|
||||
|
||||
*vtable_length_ret = vtable_length;
|
||||
}
|
||||
|
||||
int klassVtable::index_of(Method* m, int len) const {
|
||||
@ -191,7 +190,7 @@ void klassVtable::initialize_vtable(bool checkconstraints, TRAPS) {
|
||||
}
|
||||
|
||||
// add miranda methods; it will also update the value of initialized
|
||||
fill_in_mirandas(initialized);
|
||||
fill_in_mirandas(&initialized);
|
||||
|
||||
// In class hierarchies where the accessibility is not increasing (i.e., going from private ->
|
||||
// package_private -> publicprotected), the vtable might actually be smaller than our initial
|
||||
@ -249,6 +248,11 @@ InstanceKlass* klassVtable::find_transitive_override(InstanceKlass* initialsuper
|
||||
return superk;
|
||||
}
|
||||
|
||||
// Methods that are "effectively" final don't need vtable entries.
|
||||
bool method_is_effectively_final(
|
||||
AccessFlags klass_flags, methodHandle target) {
|
||||
return target->is_final() || klass_flags.is_final() && !target->is_overpass();
|
||||
}
|
||||
|
||||
// Update child's copy of super vtable for overrides
|
||||
// OR return true if a new vtable entry is required
|
||||
@ -269,7 +273,7 @@ bool klassVtable::update_inherited_vtable(InstanceKlass* klass, methodHandle tar
|
||||
return false;
|
||||
}
|
||||
|
||||
if (klass->is_final() || target_method()->is_final()) {
|
||||
if (method_is_effectively_final(klass->access_flags(), target_method)) {
|
||||
// a final method never needs a new entry; final methods can be statically
|
||||
// resolved and they have to be present in the vtable only if they override
|
||||
// a super's method, in which case they re-use its entry
|
||||
@ -303,7 +307,7 @@ bool klassVtable::update_inherited_vtable(InstanceKlass* klass, methodHandle tar
|
||||
if (super_method->name() == name && super_method->signature() == signature) {
|
||||
|
||||
// get super_klass for method_holder for the found method
|
||||
InstanceKlass* super_klass = InstanceKlass::cast(super_method->method_holder());
|
||||
InstanceKlass* super_klass = super_method->method_holder();
|
||||
|
||||
if ((super_klass->is_override(super_method, target_loader, target_classname, THREAD)) ||
|
||||
((klass->major_version() >= VTABLE_TRANSITIVE_OVERRIDE_VERSION)
|
||||
@ -406,7 +410,8 @@ bool klassVtable::needs_new_vtable_entry(methodHandle target_method,
|
||||
Symbol* classname,
|
||||
AccessFlags class_flags,
|
||||
TRAPS) {
|
||||
if ((class_flags.is_final() || target_method()->is_final()) ||
|
||||
|
||||
if (method_is_effectively_final(class_flags, target_method) ||
|
||||
// a final method never needs a new entry; final methods can be statically
|
||||
// resolved and they have to be present in the vtable only if they override
|
||||
// a super's method, in which case they re-use its entry
|
||||
@ -447,7 +452,7 @@ bool klassVtable::needs_new_vtable_entry(methodHandle target_method,
|
||||
}
|
||||
// get the class holding the matching method
|
||||
// make sure you use that class for is_override
|
||||
InstanceKlass* superk = InstanceKlass::cast(super_method->method_holder());
|
||||
InstanceKlass* superk = super_method->method_holder();
|
||||
// we want only instance method matches
|
||||
// pretend private methods are not in the super vtable
|
||||
// since we do override around them: e.g. a.m pub/b.m private/c.m pub,
|
||||
@ -502,7 +507,7 @@ bool klassVtable::is_miranda_entry_at(int i) {
|
||||
|
||||
// miranda methods are interface methods in a class's vtable
|
||||
if (mhk->is_interface()) {
|
||||
assert(m->is_public() && m->is_abstract(), "should be public and abstract");
|
||||
assert(m->is_public(), "should be public");
|
||||
assert(ik()->implements_interface(method_holder) , "this class should implement the interface");
|
||||
assert(is_miranda(m, ik()->methods(), ik()->super()), "should be a miranda_method");
|
||||
return true;
|
||||
@ -532,19 +537,19 @@ bool klassVtable::is_miranda(Method* m, Array<Method*>* class_methods, Klass* su
|
||||
return false;
|
||||
}
|
||||
|
||||
void klassVtable::add_new_mirandas_to_list(GrowableArray<Method*>* list_of_current_mirandas,
|
||||
Array<Method*>* current_interface_methods,
|
||||
Array<Method*>* class_methods,
|
||||
Klass* super) {
|
||||
void klassVtable::add_new_mirandas_to_lists(
|
||||
GrowableArray<Method*>* new_mirandas, GrowableArray<Method*>* all_mirandas,
|
||||
Array<Method*>* current_interface_methods, Array<Method*>* class_methods,
|
||||
Klass* super) {
|
||||
// iterate thru the current interface's method to see if it a miranda
|
||||
int num_methods = current_interface_methods->length();
|
||||
for (int i = 0; i < num_methods; i++) {
|
||||
Method* im = current_interface_methods->at(i);
|
||||
bool is_duplicate = false;
|
||||
int num_of_current_mirandas = list_of_current_mirandas->length();
|
||||
int num_of_current_mirandas = new_mirandas->length();
|
||||
// check for duplicate mirandas in different interfaces we implement
|
||||
for (int j = 0; j < num_of_current_mirandas; j++) {
|
||||
Method* miranda = list_of_current_mirandas->at(j);
|
||||
Method* miranda = new_mirandas->at(j);
|
||||
if ((im->name() == miranda->name()) &&
|
||||
(im->signature() == miranda->signature())) {
|
||||
is_duplicate = true;
|
||||
@ -557,51 +562,47 @@ void klassVtable::add_new_mirandas_to_list(GrowableArray<Method*>* list_of_curre
|
||||
InstanceKlass *sk = InstanceKlass::cast(super);
|
||||
// check if it is a duplicate of a super's miranda
|
||||
if (sk->lookup_method_in_all_interfaces(im->name(), im->signature()) == NULL) {
|
||||
list_of_current_mirandas->append(im);
|
||||
new_mirandas->append(im);
|
||||
}
|
||||
if (all_mirandas != NULL) {
|
||||
all_mirandas->append(im);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
void klassVtable::get_mirandas(GrowableArray<Method*>* mirandas,
|
||||
void klassVtable::get_mirandas(GrowableArray<Method*>* new_mirandas,
|
||||
GrowableArray<Method*>* all_mirandas,
|
||||
Klass* super, Array<Method*>* class_methods,
|
||||
Array<Klass*>* local_interfaces) {
|
||||
assert((mirandas->length() == 0) , "current mirandas must be 0");
|
||||
assert((new_mirandas->length() == 0) , "current mirandas must be 0");
|
||||
|
||||
// iterate thru the local interfaces looking for a miranda
|
||||
int num_local_ifs = local_interfaces->length();
|
||||
for (int i = 0; i < num_local_ifs; i++) {
|
||||
InstanceKlass *ik = InstanceKlass::cast(local_interfaces->at(i));
|
||||
add_new_mirandas_to_list(mirandas, ik->methods(), class_methods, super);
|
||||
add_new_mirandas_to_lists(new_mirandas, all_mirandas,
|
||||
ik->methods(), class_methods, super);
|
||||
// iterate thru each local's super interfaces
|
||||
Array<Klass*>* super_ifs = ik->transitive_interfaces();
|
||||
int num_super_ifs = super_ifs->length();
|
||||
for (int j = 0; j < num_super_ifs; j++) {
|
||||
InstanceKlass *sik = InstanceKlass::cast(super_ifs->at(j));
|
||||
add_new_mirandas_to_list(mirandas, sik->methods(), class_methods, super);
|
||||
add_new_mirandas_to_lists(new_mirandas, all_mirandas,
|
||||
sik->methods(), class_methods, super);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// get number of mirandas
|
||||
int klassVtable::get_num_mirandas(Klass* super, Array<Method*>* class_methods, Array<Klass*>* local_interfaces) {
|
||||
ResourceMark rm;
|
||||
GrowableArray<Method*>* mirandas = new GrowableArray<Method*>(20);
|
||||
get_mirandas(mirandas, super, class_methods, local_interfaces);
|
||||
return mirandas->length();
|
||||
}
|
||||
|
||||
// fill in mirandas
|
||||
void klassVtable::fill_in_mirandas(int& initialized) {
|
||||
ResourceMark rm;
|
||||
GrowableArray<Method*>* mirandas = new GrowableArray<Method*>(20);
|
||||
InstanceKlass *this_ik = ik();
|
||||
get_mirandas(mirandas, this_ik->super(), this_ik->methods(), this_ik->local_interfaces());
|
||||
int num_mirandas = mirandas->length();
|
||||
for (int i = 0; i < num_mirandas; i++) {
|
||||
put_method_at(mirandas->at(i), initialized);
|
||||
initialized++;
|
||||
void klassVtable::fill_in_mirandas(int* initialized) {
|
||||
GrowableArray<Method*> mirandas(20);
|
||||
get_mirandas(&mirandas, NULL, ik()->super(), ik()->methods(),
|
||||
ik()->local_interfaces());
|
||||
for (int i = 0; i < mirandas.length(); i++) {
|
||||
put_method_at(mirandas.at(i), *initialized);
|
||||
++(*initialized);
|
||||
}
|
||||
}
|
||||
|
||||
@ -629,7 +630,7 @@ void klassVtable::adjust_method_entries(Method** old_methods, Method** new_metho
|
||||
if (!(*trace_name_printed)) {
|
||||
// RC_TRACE_MESG macro has an embedded ResourceMark
|
||||
RC_TRACE_MESG(("adjust: name=%s",
|
||||
Klass::cast(old_method->method_holder())->external_name()));
|
||||
old_method->method_holder()->external_name()));
|
||||
*trace_name_printed = true;
|
||||
}
|
||||
// RC_TRACE macro has an embedded ResourceMark
|
||||
@ -744,7 +745,7 @@ void klassItable::initialize_itable_for_interface(int method_table_offset, Klass
|
||||
Method* target = klass->uncached_lookup_method(method_name, method_signature);
|
||||
while (target != NULL && target->is_static()) {
|
||||
// continue with recursive lookup through the superclass
|
||||
Klass* super = Klass::cast(target->method_holder())->super();
|
||||
Klass* super = target->method_holder()->super();
|
||||
target = (super == NULL) ? (Method*)NULL : Klass::cast(super)->uncached_lookup_method(method_name, method_signature);
|
||||
}
|
||||
if (target == NULL || !target->is_public() || target->is_abstract()) {
|
||||
@ -754,7 +755,7 @@ void klassItable::initialize_itable_for_interface(int method_table_offset, Klass
|
||||
// if checkconstraints requested
|
||||
methodHandle target_h (THREAD, target); // preserve across gc
|
||||
if (checkconstraints) {
|
||||
Handle method_holder_loader (THREAD, InstanceKlass::cast(target->method_holder())->class_loader());
|
||||
Handle method_holder_loader (THREAD, target->method_holder()->class_loader());
|
||||
if (method_holder_loader() != interface_loader()) {
|
||||
ResourceMark rm(THREAD);
|
||||
char* failed_type_name =
|
||||
@ -824,7 +825,7 @@ void klassItable::adjust_method_entries(Method** old_methods, Method** new_metho
|
||||
if (!(*trace_name_printed)) {
|
||||
// RC_TRACE_MESG macro has an embedded ResourceMark
|
||||
RC_TRACE_MESG(("adjust: name=%s",
|
||||
Klass::cast(old_method->method_holder())->external_name()));
|
||||
old_method->method_holder()->external_name()));
|
||||
*trace_name_printed = true;
|
||||
}
|
||||
// RC_TRACE macro has an embedded ResourceMark
|
||||
@ -959,9 +960,9 @@ void klassItable::setup_itable_offset_table(instanceKlassHandle klass) {
|
||||
|
||||
// m must be a method in an interface
|
||||
int klassItable::compute_itable_index(Method* m) {
|
||||
Klass* intf = m->method_holder();
|
||||
assert(InstanceKlass::cast(intf)->is_interface(), "sanity check");
|
||||
Array<Method*>* methods = InstanceKlass::cast(intf)->methods();
|
||||
InstanceKlass* intf = m->method_holder();
|
||||
assert(intf->is_interface(), "sanity check");
|
||||
Array<Method*>* methods = intf->methods();
|
||||
int index = 0;
|
||||
while(methods->at(index) != m) {
|
||||
index++;
|
||||
|
@ -84,11 +84,11 @@ class klassVtable : public ResourceObj {
|
||||
bool is_initialized();
|
||||
|
||||
// computes vtable length (in words) and the number of miranda methods
|
||||
static void compute_vtable_size_and_num_mirandas(int &vtable_length, int &num_miranda_methods,
|
||||
Klass* super, Array<Method*>* methods,
|
||||
AccessFlags class_flags, Handle classloader,
|
||||
Symbol* classname, Array<Klass*>* local_interfaces,
|
||||
TRAPS);
|
||||
static void compute_vtable_size_and_num_mirandas(
|
||||
int* vtable_length, int* num_new_mirandas,
|
||||
GrowableArray<Method*>* all_mirandas, Klass* super,
|
||||
Array<Method*>* methods, AccessFlags class_flags, Handle classloader,
|
||||
Symbol* classname, Array<Klass*>* local_interfaces, TRAPS);
|
||||
|
||||
// RedefineClasses() API support:
|
||||
// If any entry of this vtable points to any of old_methods,
|
||||
@ -125,12 +125,17 @@ class klassVtable : public ResourceObj {
|
||||
|
||||
// support for miranda methods
|
||||
bool is_miranda_entry_at(int i);
|
||||
void fill_in_mirandas(int& initialized);
|
||||
void fill_in_mirandas(int* initialized);
|
||||
static bool is_miranda(Method* m, Array<Method*>* class_methods, Klass* super);
|
||||
static void add_new_mirandas_to_list(GrowableArray<Method*>* list_of_current_mirandas, Array<Method*>* current_interface_methods, Array<Method*>* class_methods, Klass* super);
|
||||
static void get_mirandas(GrowableArray<Method*>* mirandas, Klass* super, Array<Method*>* class_methods, Array<Klass*>* local_interfaces);
|
||||
static int get_num_mirandas(Klass* super, Array<Method*>* class_methods, Array<Klass*>* local_interfaces);
|
||||
|
||||
static void add_new_mirandas_to_lists(
|
||||
GrowableArray<Method*>* new_mirandas,
|
||||
GrowableArray<Method*>* all_mirandas,
|
||||
Array<Method*>* current_interface_methods, Array<Method*>* class_methods,
|
||||
Klass* super);
|
||||
static void get_mirandas(
|
||||
GrowableArray<Method*>* new_mirandas,
|
||||
GrowableArray<Method*>* all_mirandas, Klass* super,
|
||||
Array<Method*>* class_methods, Array<Klass*>* local_interfaces);
|
||||
|
||||
void verify_against(outputStream* st, klassVtable* vt, int index);
|
||||
inline InstanceKlass* ik() const;
|
||||
|
@ -35,6 +35,7 @@
|
||||
#include "memory/generation.hpp"
|
||||
#include "memory/metadataFactory.hpp"
|
||||
#include "memory/oopFactory.hpp"
|
||||
#include "oops/constMethod.hpp"
|
||||
#include "oops/methodData.hpp"
|
||||
#include "oops/method.hpp"
|
||||
#include "oops/oop.inline.hpp"
|
||||
@ -57,22 +58,24 @@
|
||||
// Implementation of Method
|
||||
|
||||
Method* Method::allocate(ClassLoaderData* loader_data,
|
||||
int byte_code_size,
|
||||
AccessFlags access_flags,
|
||||
int compressed_line_number_size,
|
||||
int localvariable_table_length,
|
||||
int exception_table_length,
|
||||
int checked_exceptions_length,
|
||||
TRAPS) {
|
||||
int byte_code_size,
|
||||
AccessFlags access_flags,
|
||||
int compressed_line_number_size,
|
||||
int localvariable_table_length,
|
||||
int exception_table_length,
|
||||
int checked_exceptions_length,
|
||||
ConstMethod::MethodType method_type,
|
||||
TRAPS) {
|
||||
assert(!access_flags.is_native() || byte_code_size == 0,
|
||||
"native methods should not contain byte codes");
|
||||
ConstMethod* cm = ConstMethod::allocate(loader_data,
|
||||
byte_code_size,
|
||||
compressed_line_number_size,
|
||||
localvariable_table_length,
|
||||
exception_table_length,
|
||||
checked_exceptions_length,
|
||||
CHECK_NULL);
|
||||
byte_code_size,
|
||||
compressed_line_number_size,
|
||||
localvariable_table_length,
|
||||
exception_table_length,
|
||||
checked_exceptions_length,
|
||||
method_type,
|
||||
CHECK_NULL);
|
||||
|
||||
int size = Method::size(access_flags.is_native());
|
||||
|
||||
@ -240,12 +243,12 @@ void Method::mask_for(int bci, InterpreterOopMap* mask) {
|
||||
warning("oopmap should only be accessed by the "
|
||||
"VM, GC task or CMS threads (or during debugging)");
|
||||
InterpreterOopMap local_mask;
|
||||
InstanceKlass::cast(method_holder())->mask_for(h_this, bci, &local_mask);
|
||||
method_holder()->mask_for(h_this, bci, &local_mask);
|
||||
local_mask.print();
|
||||
}
|
||||
}
|
||||
#endif
|
||||
InstanceKlass::cast(method_holder())->mask_for(h_this, bci, mask);
|
||||
method_holder()->mask_for(h_this, bci, mask);
|
||||
return;
|
||||
}
|
||||
|
||||
@ -520,7 +523,7 @@ bool Method::compute_has_loops_flag() {
|
||||
bool Method::is_final_method() const {
|
||||
// %%% Should return true for private methods also,
|
||||
// since there is no way to override them.
|
||||
return is_final() || Klass::cast(method_holder())->is_final();
|
||||
return is_final() || method_holder()->is_final();
|
||||
}
|
||||
|
||||
|
||||
@ -552,7 +555,7 @@ bool Method::is_initializer() const {
|
||||
|
||||
bool Method::has_valid_initializer_flags() const {
|
||||
return (is_static() ||
|
||||
InstanceKlass::cast(method_holder())->major_version() < 51);
|
||||
method_holder()->major_version() < 51);
|
||||
}
|
||||
|
||||
bool Method::is_static_initializer() const {
|
||||
@ -614,7 +617,7 @@ bool Method::is_klass_loaded_by_klass_index(int klass_index) const {
|
||||
if( constants()->tag_at(klass_index).is_unresolved_klass() ) {
|
||||
Thread *thread = Thread::current();
|
||||
Symbol* klass_name = constants()->klass_name_at(klass_index);
|
||||
Handle loader(thread, InstanceKlass::cast(method_holder())->class_loader());
|
||||
Handle loader(thread, method_holder()->class_loader());
|
||||
Handle prot (thread, Klass::cast(method_holder())->protection_domain());
|
||||
return SystemDictionary::find(klass_name, loader, prot, thread) != NULL;
|
||||
} else {
|
||||
@ -932,7 +935,7 @@ bool Method::is_overridden_in(Klass* k) const {
|
||||
|
||||
// If method is an interface, we skip it - except if it
|
||||
// is a miranda method
|
||||
if (InstanceKlass::cast(method_holder())->is_interface()) {
|
||||
if (method_holder()->is_interface()) {
|
||||
// Check that method is not a miranda method
|
||||
if (ik->lookup_method(name(), signature()) == NULL) {
|
||||
// No implementation exist - so miranda method
|
||||
@ -1017,7 +1020,7 @@ methodHandle Method::make_method_handle_intrinsic(vmIntrinsics::ID iid,
|
||||
ConstantPool* cp_oop = ConstantPool::allocate(loader_data, cp_length, CHECK_(empty));
|
||||
cp = constantPoolHandle(THREAD, cp_oop);
|
||||
}
|
||||
cp->set_pool_holder(holder());
|
||||
cp->set_pool_holder(InstanceKlass::cast(holder()));
|
||||
cp->symbol_at_put(_imcp_invoke_name, name);
|
||||
cp->symbol_at_put(_imcp_invoke_signature, signature);
|
||||
cp->set_preresolution();
|
||||
@ -1031,7 +1034,7 @@ methodHandle Method::make_method_handle_intrinsic(vmIntrinsics::ID iid,
|
||||
methodHandle m;
|
||||
{
|
||||
Method* m_oop = Method::allocate(loader_data, 0, accessFlags_from(flags_bits),
|
||||
0, 0, 0, 0, CHECK_(empty));
|
||||
0, 0, 0, 0, ConstMethod::NORMAL, CHECK_(empty));
|
||||
m = methodHandle(THREAD, m_oop);
|
||||
}
|
||||
m->set_constants(cp());
|
||||
@ -1083,15 +1086,16 @@ methodHandle Method::clone_with_new_data(methodHandle m, u_char* new_code, int n
|
||||
int localvariable_len = m->localvariable_table_length();
|
||||
int exception_table_len = m->exception_table_length();
|
||||
|
||||
ClassLoaderData* loader_data = m()->method_holder()->class_loader_data();
|
||||
ClassLoaderData* loader_data = m->method_holder()->class_loader_data();
|
||||
Method* newm_oop = Method::allocate(loader_data,
|
||||
new_code_length,
|
||||
flags,
|
||||
new_compressed_linenumber_size,
|
||||
localvariable_len,
|
||||
exception_table_len,
|
||||
checked_exceptions_len,
|
||||
CHECK_(methodHandle()));
|
||||
new_code_length,
|
||||
flags,
|
||||
new_compressed_linenumber_size,
|
||||
localvariable_len,
|
||||
exception_table_len,
|
||||
checked_exceptions_len,
|
||||
m->method_type(),
|
||||
CHECK_(methodHandle()));
|
||||
methodHandle newm (THREAD, newm_oop);
|
||||
int new_method_size = newm->method_size();
|
||||
|
||||
@ -1233,8 +1237,8 @@ bool Method::load_signature_classes(methodHandle m, TRAPS) {
|
||||
return false;
|
||||
}
|
||||
bool sig_is_loaded = true;
|
||||
Handle class_loader(THREAD, InstanceKlass::cast(m->method_holder())->class_loader());
|
||||
Handle protection_domain(THREAD, Klass::cast(m->method_holder())->protection_domain());
|
||||
Handle class_loader(THREAD, m->method_holder()->class_loader());
|
||||
Handle protection_domain(THREAD, m->method_holder()->protection_domain());
|
||||
ResourceMark rm(THREAD);
|
||||
Symbol* signature = m->signature();
|
||||
for(SignatureStream ss(signature); !ss.is_done(); ss.next()) {
|
||||
@ -1260,8 +1264,8 @@ bool Method::load_signature_classes(methodHandle m, TRAPS) {
|
||||
}
|
||||
|
||||
bool Method::has_unloaded_classes_in_signature(methodHandle m, TRAPS) {
|
||||
Handle class_loader(THREAD, InstanceKlass::cast(m->method_holder())->class_loader());
|
||||
Handle protection_domain(THREAD, Klass::cast(m->method_holder())->protection_domain());
|
||||
Handle class_loader(THREAD, m->method_holder()->class_loader());
|
||||
Handle protection_domain(THREAD, m->method_holder()->protection_domain());
|
||||
ResourceMark rm(THREAD);
|
||||
Symbol* signature = m->signature();
|
||||
for(SignatureStream ss(signature); !ss.is_done(); ss.next()) {
|
||||
@ -1468,7 +1472,7 @@ bool CompressedLineNumberReadStream::read_pair() {
|
||||
|
||||
|
||||
Bytecodes::Code Method::orig_bytecode_at(int bci) const {
|
||||
BreakpointInfo* bp = InstanceKlass::cast(method_holder())->breakpoints();
|
||||
BreakpointInfo* bp = method_holder()->breakpoints();
|
||||
for (; bp != NULL; bp = bp->next()) {
|
||||
if (bp->match(this, bci)) {
|
||||
return bp->orig_bytecode();
|
||||
@ -1480,7 +1484,7 @@ Bytecodes::Code Method::orig_bytecode_at(int bci) const {
|
||||
|
||||
void Method::set_orig_bytecode_at(int bci, Bytecodes::Code code) {
|
||||
assert(code != Bytecodes::_breakpoint, "cannot patch breakpoints this way");
|
||||
BreakpointInfo* bp = InstanceKlass::cast(method_holder())->breakpoints();
|
||||
BreakpointInfo* bp = method_holder()->breakpoints();
|
||||
for (; bp != NULL; bp = bp->next()) {
|
||||
if (bp->match(this, bci)) {
|
||||
bp->set_orig_bytecode(code);
|
||||
@ -1490,7 +1494,7 @@ void Method::set_orig_bytecode_at(int bci, Bytecodes::Code code) {
|
||||
}
|
||||
|
||||
void Method::set_breakpoint(int bci) {
|
||||
InstanceKlass* ik = InstanceKlass::cast(method_holder());
|
||||
InstanceKlass* ik = method_holder();
|
||||
BreakpointInfo *bp = new BreakpointInfo(this, bci);
|
||||
bp->set_next(ik->breakpoints());
|
||||
ik->set_breakpoints(bp);
|
||||
@ -1499,7 +1503,7 @@ void Method::set_breakpoint(int bci) {
|
||||
}
|
||||
|
||||
static void clear_matches(Method* m, int bci) {
|
||||
InstanceKlass* ik = InstanceKlass::cast(m->method_holder());
|
||||
InstanceKlass* ik = m->method_holder();
|
||||
BreakpointInfo* prev_bp = NULL;
|
||||
BreakpointInfo* next_bp;
|
||||
for (BreakpointInfo* bp = ik->breakpoints(); bp != NULL; bp = next_bp) {
|
||||
@ -1782,7 +1786,7 @@ void Method::change_method_associated_with_jmethod_id(jmethodID jmid, Method* ne
|
||||
bool Method::is_method_id(jmethodID mid) {
|
||||
Method* m = resolve_jmethod_id(mid);
|
||||
assert(m != NULL, "should be called with non-null method");
|
||||
InstanceKlass* ik = InstanceKlass::cast(m->method_holder());
|
||||
InstanceKlass* ik = m->method_holder();
|
||||
ClassLoaderData* cld = ik->class_loader_data();
|
||||
if (cld->jmethod_ids() == NULL) return false;
|
||||
return (cld->jmethod_ids()->contains((Method**)mid));
|
||||
|
@ -30,7 +30,6 @@
|
||||
#include "compiler/oopMap.hpp"
|
||||
#include "interpreter/invocationCounter.hpp"
|
||||
#include "oops/annotations.hpp"
|
||||
#include "oops/constMethod.hpp"
|
||||
#include "oops/constantPool.hpp"
|
||||
#include "oops/instanceKlass.hpp"
|
||||
#include "oops/oop.hpp"
|
||||
@ -104,6 +103,7 @@ class CheckedExceptionElement;
|
||||
class LocalVariableTableElement;
|
||||
class AdapterHandlerEntry;
|
||||
class MethodData;
|
||||
class ConstMethod;
|
||||
|
||||
class Method : public Metadata {
|
||||
friend class VMStructs;
|
||||
@ -158,14 +158,16 @@ class Method : public Metadata {
|
||||
// Constructor
|
||||
Method(ConstMethod* xconst, AccessFlags access_flags, int size);
|
||||
public:
|
||||
|
||||
static Method* allocate(ClassLoaderData* loader_data,
|
||||
int byte_code_size,
|
||||
AccessFlags access_flags,
|
||||
int compressed_line_number_size,
|
||||
int localvariable_table_length,
|
||||
int exception_table_length,
|
||||
int checked_exceptions_length,
|
||||
TRAPS);
|
||||
int byte_code_size,
|
||||
AccessFlags access_flags,
|
||||
int compressed_line_number_size,
|
||||
int localvariable_table_length,
|
||||
int exception_table_length,
|
||||
int checked_exceptions_length,
|
||||
ConstMethod::MethodType method_type,
|
||||
TRAPS);
|
||||
|
||||
Method() { assert(DumpSharedSpaces || UseSharedSpaces, "only for CDS"); }
|
||||
|
||||
@ -207,21 +209,21 @@ class Method : public Metadata {
|
||||
|
||||
// annotations support
|
||||
AnnotationArray* annotations() const {
|
||||
InstanceKlass* ik = InstanceKlass::cast(method_holder());
|
||||
InstanceKlass* ik = method_holder();
|
||||
if (ik->annotations() == NULL) {
|
||||
return NULL;
|
||||
}
|
||||
return ik->annotations()->get_method_annotations_of(method_idnum());
|
||||
}
|
||||
AnnotationArray* parameter_annotations() const {
|
||||
InstanceKlass* ik = InstanceKlass::cast(method_holder());
|
||||
InstanceKlass* ik = method_holder();
|
||||
if (ik->annotations() == NULL) {
|
||||
return NULL;
|
||||
}
|
||||
return ik->annotations()->get_method_parameter_annotations_of(method_idnum());
|
||||
}
|
||||
AnnotationArray* annotation_default() const {
|
||||
InstanceKlass* ik = InstanceKlass::cast(method_holder());
|
||||
InstanceKlass* ik = method_holder();
|
||||
if (ik->annotations() == NULL) {
|
||||
return NULL;
|
||||
}
|
||||
@ -494,7 +496,7 @@ class Method : public Metadata {
|
||||
{ return constMethod()->compressed_linenumber_table(); }
|
||||
|
||||
// method holder (the Klass* holding this method)
|
||||
Klass* method_holder() const { return constants()->pool_holder(); }
|
||||
InstanceKlass* method_holder() const { return constants()->pool_holder(); }
|
||||
|
||||
void compute_size_of_parameters(Thread *thread); // word size of parameters (receiver if any + arguments)
|
||||
Symbol* klass_name() const; // returns the name of the method holder
|
||||
@ -695,18 +697,18 @@ class Method : public Metadata {
|
||||
|
||||
// Get this method's jmethodID -- allocate if it doesn't exist
|
||||
jmethodID jmethod_id() { methodHandle this_h(this);
|
||||
return InstanceKlass::get_jmethod_id(InstanceKlass::cast(method_holder()), this_h); }
|
||||
return InstanceKlass::get_jmethod_id(method_holder(), this_h); }
|
||||
|
||||
// Lookup the jmethodID for this method. Return NULL if not found.
|
||||
// NOTE that this function can be called from a signal handler
|
||||
// (see AsyncGetCallTrace support for Forte Analyzer) and this
|
||||
// needs to be async-safe. No allocation should be done and
|
||||
// so handles are not used to avoid deadlock.
|
||||
jmethodID find_jmethod_id_or_null() { return InstanceKlass::cast(method_holder())->jmethod_id_or_null(this); }
|
||||
jmethodID find_jmethod_id_or_null() { return method_holder()->jmethod_id_or_null(this); }
|
||||
|
||||
// JNI static invoke cached itable index accessors
|
||||
int cached_itable_index() { return InstanceKlass::cast(method_holder())->cached_itable_index(method_idnum()); }
|
||||
void set_cached_itable_index(int index) { InstanceKlass::cast(method_holder())->set_cached_itable_index(method_idnum(), index); }
|
||||
int cached_itable_index() { return method_holder()->cached_itable_index(method_idnum()); }
|
||||
void set_cached_itable_index(int index) { method_holder()->set_cached_itable_index(method_idnum(), index); }
|
||||
|
||||
// Support for inlining of intrinsic methods
|
||||
vmIntrinsics::ID intrinsic_id() const { return (vmIntrinsics::ID) _intrinsic_id; }
|
||||
@ -725,14 +727,18 @@ class Method : public Metadata {
|
||||
void set_dont_inline(bool x) { _dont_inline = x; }
|
||||
bool is_hidden() { return _hidden; }
|
||||
void set_hidden(bool x) { _hidden = x; }
|
||||
ConstMethod::MethodType method_type() const {
|
||||
return _constMethod->method_type();
|
||||
}
|
||||
bool is_overpass() const { return method_type() == ConstMethod::OVERPASS; }
|
||||
|
||||
// On-stack replacement support
|
||||
bool has_osr_nmethod(int level, bool match_level) {
|
||||
return InstanceKlass::cast(method_holder())->lookup_osr_nmethod(this, InvocationEntryBci, level, match_level) != NULL;
|
||||
return method_holder()->lookup_osr_nmethod(this, InvocationEntryBci, level, match_level) != NULL;
|
||||
}
|
||||
|
||||
nmethod* lookup_osr_nmethod_for(int bci, int level, bool match_level) {
|
||||
return InstanceKlass::cast(method_holder())->lookup_osr_nmethod(this, bci, level, match_level);
|
||||
return method_holder()->lookup_osr_nmethod(this, bci, level, match_level);
|
||||
}
|
||||
|
||||
// Inline cache support
|
||||
|
@ -1386,12 +1386,12 @@ int ConnectionGraph::find_init_values(JavaObjectNode* pta, PointsToNode* init_va
|
||||
// Non-escaped allocation returned from Java or runtime call have
|
||||
// unknown values in fields.
|
||||
for (EdgeIterator i(pta); i.has_next(); i.next()) {
|
||||
PointsToNode* ptn = i.get();
|
||||
if (ptn->is_Field() && ptn->as_Field()->is_oop()) {
|
||||
if (add_edge(ptn, phantom_obj)) {
|
||||
PointsToNode* field = i.get();
|
||||
if (field->is_Field() && field->as_Field()->is_oop()) {
|
||||
if (add_edge(field, phantom_obj)) {
|
||||
// New edge was added
|
||||
new_edges++;
|
||||
add_field_uses_to_worklist(ptn->as_Field());
|
||||
add_field_uses_to_worklist(field->as_Field());
|
||||
}
|
||||
}
|
||||
}
|
||||
@ -1413,30 +1413,30 @@ int ConnectionGraph::find_init_values(JavaObjectNode* pta, PointsToNode* init_va
|
||||
// captured by Initialize node.
|
||||
//
|
||||
for (EdgeIterator i(pta); i.has_next(); i.next()) {
|
||||
PointsToNode* ptn = i.get(); // Field (AddP)
|
||||
if (!ptn->is_Field() || !ptn->as_Field()->is_oop())
|
||||
PointsToNode* field = i.get(); // Field (AddP)
|
||||
if (!field->is_Field() || !field->as_Field()->is_oop())
|
||||
continue; // Not oop field
|
||||
int offset = ptn->as_Field()->offset();
|
||||
int offset = field->as_Field()->offset();
|
||||
if (offset == Type::OffsetBot) {
|
||||
if (!visited_bottom_offset) {
|
||||
// OffsetBot is used to reference array's element,
|
||||
// always add reference to NULL to all Field nodes since we don't
|
||||
// known which element is referenced.
|
||||
if (add_edge(ptn, null_obj)) {
|
||||
if (add_edge(field, null_obj)) {
|
||||
// New edge was added
|
||||
new_edges++;
|
||||
add_field_uses_to_worklist(ptn->as_Field());
|
||||
add_field_uses_to_worklist(field->as_Field());
|
||||
visited_bottom_offset = true;
|
||||
}
|
||||
}
|
||||
} else {
|
||||
// Check only oop fields.
|
||||
const Type* adr_type = ptn->ideal_node()->as_AddP()->bottom_type();
|
||||
const Type* adr_type = field->ideal_node()->as_AddP()->bottom_type();
|
||||
if (adr_type->isa_rawptr()) {
|
||||
#ifdef ASSERT
|
||||
// Raw pointers are used for initializing stores so skip it
|
||||
// since it should be recorded already
|
||||
Node* base = get_addp_base(ptn->ideal_node());
|
||||
Node* base = get_addp_base(field->ideal_node());
|
||||
assert(adr_type->isa_rawptr() && base->is_Proj() &&
|
||||
(base->in(0) == alloc),"unexpected pointer type");
|
||||
#endif
|
||||
@ -1446,10 +1446,54 @@ int ConnectionGraph::find_init_values(JavaObjectNode* pta, PointsToNode* init_va
|
||||
offsets_worklist.append(offset);
|
||||
Node* value = NULL;
|
||||
if (ini != NULL) {
|
||||
BasicType ft = UseCompressedOops ? T_NARROWOOP : T_OBJECT;
|
||||
Node* store = ini->find_captured_store(offset, type2aelembytes(ft), phase);
|
||||
if (store != NULL && store->is_Store()) {
|
||||
// StoreP::memory_type() == T_ADDRESS
|
||||
BasicType ft = UseCompressedOops ? T_NARROWOOP : T_ADDRESS;
|
||||
Node* store = ini->find_captured_store(offset, type2aelembytes(ft, true), phase);
|
||||
// Make sure initializing store has the same type as this AddP.
|
||||
// This AddP may reference non existing field because it is on a
|
||||
// dead branch of bimorphic call which is not eliminated yet.
|
||||
if (store != NULL && store->is_Store() &&
|
||||
store->as_Store()->memory_type() == ft) {
|
||||
value = store->in(MemNode::ValueIn);
|
||||
#ifdef ASSERT
|
||||
if (VerifyConnectionGraph) {
|
||||
// Verify that AddP already points to all objects the value points to.
|
||||
PointsToNode* val = ptnode_adr(value->_idx);
|
||||
assert((val != NULL), "should be processed already");
|
||||
PointsToNode* missed_obj = NULL;
|
||||
if (val->is_JavaObject()) {
|
||||
if (!field->points_to(val->as_JavaObject())) {
|
||||
missed_obj = val;
|
||||
}
|
||||
} else {
|
||||
if (!val->is_LocalVar() || (val->edge_count() == 0)) {
|
||||
tty->print_cr("----------init store has invalid value -----");
|
||||
store->dump();
|
||||
val->dump();
|
||||
assert(val->is_LocalVar() && (val->edge_count() > 0), "should be processed already");
|
||||
}
|
||||
for (EdgeIterator j(val); j.has_next(); j.next()) {
|
||||
PointsToNode* obj = j.get();
|
||||
if (obj->is_JavaObject()) {
|
||||
if (!field->points_to(obj->as_JavaObject())) {
|
||||
missed_obj = obj;
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
if (missed_obj != NULL) {
|
||||
tty->print_cr("----------field---------------------------------");
|
||||
field->dump();
|
||||
tty->print_cr("----------missed referernce to object-----------");
|
||||
missed_obj->dump();
|
||||
tty->print_cr("----------object referernced by init store -----");
|
||||
store->dump();
|
||||
val->dump();
|
||||
assert(!field->points_to(missed_obj->as_JavaObject()), "missed JavaObject reference");
|
||||
}
|
||||
}
|
||||
#endif
|
||||
} else {
|
||||
// There could be initializing stores which follow allocation.
|
||||
// For example, a volatile field store is not collected
|
||||
@ -1462,10 +1506,10 @@ int ConnectionGraph::find_init_values(JavaObjectNode* pta, PointsToNode* init_va
|
||||
}
|
||||
if (value == NULL) {
|
||||
// A field's initializing value was not recorded. Add NULL.
|
||||
if (add_edge(ptn, null_obj)) {
|
||||
if (add_edge(field, null_obj)) {
|
||||
// New edge was added
|
||||
new_edges++;
|
||||
add_field_uses_to_worklist(ptn->as_Field());
|
||||
add_field_uses_to_worklist(field->as_Field());
|
||||
}
|
||||
}
|
||||
}
|
||||
@ -1607,7 +1651,26 @@ void ConnectionGraph::verify_connection_graph(
|
||||
}
|
||||
// Verify that all fields have initializing values.
|
||||
if (field->edge_count() == 0) {
|
||||
tty->print_cr("----------field does not have references----------");
|
||||
field->dump();
|
||||
for (BaseIterator i(field); i.has_next(); i.next()) {
|
||||
PointsToNode* base = i.get();
|
||||
tty->print_cr("----------field has next base---------------------");
|
||||
base->dump();
|
||||
if (base->is_JavaObject() && (base != phantom_obj) && (base != null_obj)) {
|
||||
tty->print_cr("----------base has fields-------------------------");
|
||||
for (EdgeIterator j(base); j.has_next(); j.next()) {
|
||||
j.get()->dump();
|
||||
}
|
||||
tty->print_cr("----------base has references---------------------");
|
||||
for (UseIterator j(base); j.has_next(); j.next()) {
|
||||
j.get()->dump();
|
||||
}
|
||||
}
|
||||
}
|
||||
for (UseIterator i(field); i.has_next(); i.next()) {
|
||||
i.get()->dump();
|
||||
}
|
||||
assert(field->edge_count() > 0, "sanity");
|
||||
}
|
||||
}
|
||||
@ -1967,7 +2030,7 @@ bool PointsToNode::points_to(JavaObjectNode* ptn) const {
|
||||
if (is_JavaObject()) {
|
||||
return (this == ptn);
|
||||
}
|
||||
assert(is_LocalVar(), "sanity");
|
||||
assert(is_LocalVar() || is_Field(), "sanity");
|
||||
for (EdgeIterator i(this); i.has_next(); i.next()) {
|
||||
if (i.get() == ptn)
|
||||
return true;
|
||||
@ -3127,10 +3190,14 @@ void PointsToNode::dump(bool print_state) const {
|
||||
EscapeState fields_es = fields_escape_state();
|
||||
tty->print("%s(%s) ", esc_names[(int)es], esc_names[(int)fields_es]);
|
||||
if (nt == PointsToNode::JavaObject && !this->scalar_replaceable())
|
||||
tty->print("NSR");
|
||||
tty->print("NSR ");
|
||||
}
|
||||
if (is_Field()) {
|
||||
FieldNode* f = (FieldNode*)this;
|
||||
if (f->is_oop())
|
||||
tty->print("oop ");
|
||||
if (f->offset() > 0)
|
||||
tty->print("+%d ", f->offset());
|
||||
tty->print("(");
|
||||
for (BaseIterator i(f); i.has_next(); i.next()) {
|
||||
PointsToNode* b = i.get();
|
||||
|
@ -2985,7 +2985,7 @@ JNI_ENTRY(jfieldID, jni_GetStaticFieldID(JNIEnv *env, jclass clazz,
|
||||
}
|
||||
|
||||
// A jfieldID for a static field is a JNIid specifying the field holder and the offset within the Klass*
|
||||
JNIid* id = InstanceKlass::cast(fd.field_holder())->jni_id_for(fd.offset());
|
||||
JNIid* id = fd.field_holder()->jni_id_for(fd.offset());
|
||||
debug_only(id->set_is_static_field_id();)
|
||||
|
||||
debug_only(id->verify(fd.field_holder()));
|
||||
@ -4016,7 +4016,7 @@ static bool register_native(KlassHandle k, Symbol* name, Symbol* signature, addr
|
||||
if (PrintJNIResolving) {
|
||||
ResourceMark rm(THREAD);
|
||||
tty->print_cr("[Registering JNI native method %s.%s]",
|
||||
Klass::cast(method->method_holder())->external_name(),
|
||||
method->method_holder()->external_name(),
|
||||
method->name()->as_C_string());
|
||||
}
|
||||
return true;
|
||||
|
@ -125,7 +125,7 @@ static void trace_class_resolution_impl(Klass* to_class, TRAPS) {
|
||||
int line_number = -1;
|
||||
const char * source_file = NULL;
|
||||
const char * trace = "explicit";
|
||||
Klass* caller = NULL;
|
||||
InstanceKlass* caller = NULL;
|
||||
JavaThread* jthread = JavaThread::current();
|
||||
if (jthread->has_last_Java_frame()) {
|
||||
vframeStream vfst(jthread);
|
||||
@ -153,17 +153,17 @@ static void trace_class_resolution_impl(Klass* to_class, TRAPS) {
|
||||
// that caller, otherwise keep quiet since this should be picked up elsewhere.
|
||||
bool found_it = false;
|
||||
if (!vfst.at_end() &&
|
||||
InstanceKlass::cast(vfst.method()->method_holder())->name() == vmSymbols::java_lang_Class() &&
|
||||
vfst.method()->method_holder()->name() == vmSymbols::java_lang_Class() &&
|
||||
vfst.method()->name() == vmSymbols::forName0_name()) {
|
||||
vfst.next();
|
||||
if (!vfst.at_end() &&
|
||||
InstanceKlass::cast(vfst.method()->method_holder())->name() == vmSymbols::java_lang_Class() &&
|
||||
vfst.method()->method_holder()->name() == vmSymbols::java_lang_Class() &&
|
||||
vfst.method()->name() == vmSymbols::forName_name()) {
|
||||
vfst.next();
|
||||
found_it = true;
|
||||
}
|
||||
} else if (last_caller != NULL &&
|
||||
InstanceKlass::cast(last_caller->method_holder())->name() ==
|
||||
last_caller->method_holder()->name() ==
|
||||
vmSymbols::java_lang_ClassLoader() &&
|
||||
(last_caller->name() == vmSymbols::loadClassInternal_name() ||
|
||||
last_caller->name() == vmSymbols::loadClass_name())) {
|
||||
@ -182,7 +182,7 @@ static void trace_class_resolution_impl(Klass* to_class, TRAPS) {
|
||||
// show method name if it's a native method
|
||||
trace = vfst.method()->name_and_sig_as_C_string();
|
||||
}
|
||||
Symbol* s = InstanceKlass::cast(caller)->source_file_name();
|
||||
Symbol* s = caller->source_file_name();
|
||||
if (s != NULL) {
|
||||
source_file = s->as_C_string();
|
||||
}
|
||||
@ -190,8 +190,8 @@ static void trace_class_resolution_impl(Klass* to_class, TRAPS) {
|
||||
}
|
||||
if (caller != NULL) {
|
||||
if (to_class != caller) {
|
||||
const char * from = Klass::cast(caller)->external_name();
|
||||
const char * to = Klass::cast(to_class)->external_name();
|
||||
const char * from = caller->external_name();
|
||||
const char * to = to_class->external_name();
|
||||
// print in a single call to reduce interleaving between threads
|
||||
if (source_file != NULL) {
|
||||
tty->print("RESOLVE %s %s %s:%d (%s)\n", from, to, source_file, line_number, trace);
|
||||
@ -1228,7 +1228,7 @@ JVM_ENTRY(jobject, JVM_GetStackAccessControlContext(JNIEnv *env, jclass cls))
|
||||
privileged_context = Handle(thread, thread->privileged_stack_top()->privileged_context());
|
||||
protection_domain = thread->privileged_stack_top()->protection_domain();
|
||||
} else {
|
||||
protection_domain = InstanceKlass::cast(method->method_holder())->protection_domain();
|
||||
protection_domain = method->method_holder()->protection_domain();
|
||||
}
|
||||
|
||||
if ((previous_protection_domain != protection_domain) && (protection_domain != NULL)) {
|
||||
@ -3048,10 +3048,10 @@ JVM_ENTRY(jclass, JVM_CurrentLoadedClass(JNIEnv *env))
|
||||
|
||||
Method* m = vfst.method();
|
||||
if (!m->is_native()) {
|
||||
Klass* holder = m->method_holder();
|
||||
oop loader = InstanceKlass::cast(holder)->class_loader();
|
||||
InstanceKlass* holder = m->method_holder();
|
||||
oop loader = holder->class_loader();
|
||||
if (loader != NULL && !java_lang_ClassLoader::is_trusted_loader(loader)) {
|
||||
return (jclass) JNIHandles::make_local(env, Klass::cast(holder)->java_mirror());
|
||||
return (jclass) JNIHandles::make_local(env, holder->java_mirror());
|
||||
}
|
||||
}
|
||||
}
|
||||
@ -3071,9 +3071,9 @@ JVM_ENTRY(jobject, JVM_CurrentClassLoader(JNIEnv *env))
|
||||
|
||||
Method* m = vfst.method();
|
||||
if (!m->is_native()) {
|
||||
Klass* holder = m->method_holder();
|
||||
InstanceKlass* holder = m->method_holder();
|
||||
assert(holder->is_klass(), "just checking");
|
||||
oop loader = InstanceKlass::cast(holder)->class_loader();
|
||||
oop loader = holder->class_loader();
|
||||
if (loader != NULL && !java_lang_ClassLoader::is_trusted_loader(loader)) {
|
||||
return JNIHandles::make_local(env, loader);
|
||||
}
|
||||
@ -3148,9 +3148,9 @@ JVM_ENTRY(jint, JVM_ClassDepth(JNIEnv *env, jstring name))
|
||||
|
||||
for(vframeStream vfst(thread); !vfst.at_end(); vfst.next()) {
|
||||
if (!vfst.method()->is_native()) {
|
||||
Klass* holder = vfst.method()->method_holder();
|
||||
InstanceKlass* holder = vfst.method()->method_holder();
|
||||
assert(holder->is_klass(), "just checking");
|
||||
if (InstanceKlass::cast(holder)->name() == class_name_sym) {
|
||||
if (holder->name() == class_name_sym) {
|
||||
return depth;
|
||||
}
|
||||
depth++;
|
||||
@ -3171,9 +3171,9 @@ JVM_ENTRY(jint, JVM_ClassLoaderDepth(JNIEnv *env))
|
||||
|
||||
Method* m = vfst.method();
|
||||
if (!m->is_native()) {
|
||||
Klass* holder = m->method_holder();
|
||||
InstanceKlass* holder = m->method_holder();
|
||||
assert(holder->is_klass(), "just checking");
|
||||
oop loader = InstanceKlass::cast(holder)->class_loader();
|
||||
oop loader = holder->class_loader();
|
||||
if (loader != NULL && !java_lang_ClassLoader::is_trusted_loader(loader)) {
|
||||
return depth;
|
||||
}
|
||||
@ -3322,8 +3322,7 @@ JVM_ENTRY(jobject, JVM_LatestUserDefinedLoader(JNIEnv *env))
|
||||
for (vframeStream vfst(thread); !vfst.at_end(); vfst.next()) {
|
||||
// UseNewReflection
|
||||
vfst.skip_reflection_related_frames(); // Only needed for 1.4 reflection
|
||||
Klass* holder = vfst.method()->method_holder();
|
||||
oop loader = InstanceKlass::cast(holder)->class_loader();
|
||||
oop loader = vfst.method()->method_holder()->class_loader();
|
||||
if (loader != NULL) {
|
||||
return JNIHandles::make_local(env, loader);
|
||||
}
|
||||
@ -3365,9 +3364,9 @@ JVM_ENTRY(jclass, JVM_LoadClass0(JNIEnv *env, jobject receiver,
|
||||
!vfst.at_end() && loader == NULL;
|
||||
vfst.next()) {
|
||||
if (!vfst.method()->is_native()) {
|
||||
Klass* holder = vfst.method()->method_holder();
|
||||
loader = InstanceKlass::cast(holder)->class_loader();
|
||||
protection_domain = InstanceKlass::cast(holder)->protection_domain();
|
||||
InstanceKlass* holder = vfst.method()->method_holder();
|
||||
loader = holder->class_loader();
|
||||
protection_domain = holder->protection_domain();
|
||||
}
|
||||
}
|
||||
} else {
|
||||
|
@ -753,7 +753,7 @@ void JvmtiClassFileReconstituter::copy_bytecodes(methodHandle mh,
|
||||
|
||||
unsigned char* p = bytecodes;
|
||||
Bytecodes::Code code;
|
||||
bool is_rewritten = InstanceKlass::cast(mh->method_holder())->is_rewritten();
|
||||
bool is_rewritten = mh->method_holder()->is_rewritten();
|
||||
|
||||
while ((code = bs.next()) >= 0) {
|
||||
assert(Bytecodes::is_java_code(code), "sanity check");
|
||||
|
@ -2822,7 +2822,7 @@ JvmtiEnv::GetLocalVariableTable(Method* method_oop, jint* entry_count_ptr, jvmti
|
||||
JavaThread* current_thread = JavaThread::current();
|
||||
|
||||
// does the klass have any local variable information?
|
||||
InstanceKlass* ik = InstanceKlass::cast(method_oop->method_holder());
|
||||
InstanceKlass* ik = method_oop->method_holder();
|
||||
if (!ik->access_flags().has_localvariable_table()) {
|
||||
return (JVMTI_ERROR_ABSENT_INFORMATION);
|
||||
}
|
||||
|
@ -233,7 +233,7 @@ Handle MethodHandles::init_method_MemberName(oop mname_oop, CallInfo& info, TRAP
|
||||
methodHandle m = info.resolved_method();
|
||||
KlassHandle defc = info.resolved_klass();
|
||||
int vmindex = -1;
|
||||
if (defc->is_interface() && Klass::cast(m->method_holder())->is_interface()) {
|
||||
if (defc->is_interface() && m->method_holder()->is_interface()) {
|
||||
// LinkResolver does not report itable indexes! (fix this?)
|
||||
vmindex = klassItable::compute_itable_index(m());
|
||||
} else if (m->can_be_statically_bound()) {
|
||||
@ -749,8 +749,8 @@ void MethodHandles::expand_MemberName(Handle mname, int suppress, TRAPS) {
|
||||
DEBUG_ONLY(vmtarget = NULL); // safety
|
||||
if (m.is_null()) break;
|
||||
if (!have_defc) {
|
||||
Klass* defc = m->method_holder();
|
||||
java_lang_invoke_MemberName::set_clazz(mname(), Klass::cast(defc)->java_mirror());
|
||||
InstanceKlass* defc = m->method_holder();
|
||||
java_lang_invoke_MemberName::set_clazz(mname(), defc->java_mirror());
|
||||
}
|
||||
if (!have_name) {
|
||||
//not java_lang_String::create_from_symbol; let's intern member names
|
||||
|
@ -165,8 +165,7 @@ address NativeLookup::lookup_style(methodHandle method, char* pure_name, const c
|
||||
// Note: It is critical for bootstrapping that Java_java_lang_ClassLoader_00024NativeLibrary_find
|
||||
// gets found the first time around - otherwise an infinite loop can occure. This is
|
||||
// another VM/library dependency
|
||||
Handle loader(THREAD,
|
||||
InstanceKlass::cast(method->method_holder())->class_loader());
|
||||
Handle loader(THREAD, method->method_holder()->class_loader());
|
||||
if (loader.is_null()) {
|
||||
entry = lookup_special_native(jni_name);
|
||||
if (entry == NULL) {
|
||||
@ -393,7 +392,7 @@ address NativeLookup::lookup(methodHandle method, bool& in_base_library, TRAPS)
|
||||
if (PrintJNIResolving) {
|
||||
ResourceMark rm(THREAD);
|
||||
tty->print_cr("[Dynamic-linking native method %s.%s ... JNI]",
|
||||
Klass::cast(method->method_holder())->external_name(),
|
||||
method->method_holder()->external_name(),
|
||||
method->name()->as_C_string());
|
||||
}
|
||||
}
|
||||
|
@ -627,7 +627,7 @@ const char* StackWalkCompPolicy::shouldNotInline(methodHandle m) {
|
||||
// negative filter: should send NOT be inlined? returns NULL (--> inline) or rejection msg
|
||||
if (m->is_abstract()) return (_msg = "abstract method");
|
||||
// note: we allow ik->is_abstract()
|
||||
if (!InstanceKlass::cast(m->method_holder())->is_initialized()) return (_msg = "method holder not initialized");
|
||||
if (!m->method_holder()->is_initialized()) return (_msg = "method holder not initialized");
|
||||
if (m->is_native()) return (_msg = "native method");
|
||||
nmethod* m_code = m->code();
|
||||
if (m_code != NULL && m_code->code_size() > InlineSmallCode)
|
||||
|
@ -1191,12 +1191,12 @@ void Deoptimization::load_class_by_index(constantPoolHandle constant_pool, int i
|
||||
|
||||
if (!constant_pool->tag_at(index).is_symbol()) return;
|
||||
|
||||
Handle class_loader (THREAD, InstanceKlass::cast(constant_pool->pool_holder())->class_loader());
|
||||
Handle class_loader (THREAD, constant_pool->pool_holder()->class_loader());
|
||||
Symbol* symbol = constant_pool->symbol_at(index);
|
||||
|
||||
// class name?
|
||||
if (symbol->byte_at(0) != '(') {
|
||||
Handle protection_domain (THREAD, Klass::cast(constant_pool->pool_holder())->protection_domain());
|
||||
Handle protection_domain (THREAD, constant_pool->pool_holder()->protection_domain());
|
||||
SystemDictionary::resolve_or_null(symbol, class_loader, protection_domain, CHECK);
|
||||
return;
|
||||
}
|
||||
@ -1206,7 +1206,7 @@ void Deoptimization::load_class_by_index(constantPoolHandle constant_pool, int i
|
||||
for (SignatureStream ss(symbol); !ss.is_done(); ss.next()) {
|
||||
if (ss.is_object()) {
|
||||
Symbol* class_name = ss.as_symbol(CHECK);
|
||||
Handle protection_domain (THREAD, Klass::cast(constant_pool->pool_holder())->protection_domain());
|
||||
Handle protection_domain (THREAD, constant_pool->pool_holder()->protection_domain());
|
||||
SystemDictionary::resolve_or_null(class_name, class_loader, protection_domain, CHECK);
|
||||
}
|
||||
}
|
||||
|
@ -36,7 +36,7 @@
|
||||
|
||||
|
||||
oop fieldDescriptor::loader() const {
|
||||
return InstanceKlass::cast(_cp->pool_holder())->class_loader();
|
||||
return _cp->pool_holder()->class_loader();
|
||||
}
|
||||
|
||||
Symbol* fieldDescriptor::generic_signature() const {
|
||||
@ -45,7 +45,7 @@ Symbol* fieldDescriptor::generic_signature() const {
|
||||
}
|
||||
|
||||
int idx = 0;
|
||||
InstanceKlass* ik = InstanceKlass::cast(field_holder());
|
||||
InstanceKlass* ik = field_holder();
|
||||
for (AllFieldStream fs(ik); !fs.done(); fs.next()) {
|
||||
if (idx == _index) {
|
||||
return fs.generic_signature();
|
||||
@ -58,7 +58,7 @@ Symbol* fieldDescriptor::generic_signature() const {
|
||||
}
|
||||
|
||||
AnnotationArray* fieldDescriptor::annotations() const {
|
||||
InstanceKlass* ik = InstanceKlass::cast(field_holder());
|
||||
InstanceKlass* ik = field_holder();
|
||||
Array<AnnotationArray*>* md = ik->fields_annotations();
|
||||
if (md == NULL)
|
||||
return NULL;
|
||||
|
@ -43,12 +43,12 @@ class fieldDescriptor VALUE_OBJ_CLASS_SPEC {
|
||||
|
||||
// update the access_flags for the field in the klass
|
||||
void update_klass_field_access_flag() {
|
||||
InstanceKlass* ik = InstanceKlass::cast(field_holder());
|
||||
InstanceKlass* ik = field_holder();
|
||||
ik->field(index())->set_access_flags(_access_flags.as_short());
|
||||
}
|
||||
|
||||
FieldInfo* field() const {
|
||||
InstanceKlass* ik = InstanceKlass::cast(field_holder());
|
||||
InstanceKlass* ik = field_holder();
|
||||
return ik->field(_index);
|
||||
}
|
||||
|
||||
@ -59,46 +59,46 @@ class fieldDescriptor VALUE_OBJ_CLASS_SPEC {
|
||||
Symbol* signature() const {
|
||||
return field()->signature(_cp);
|
||||
}
|
||||
Klass* field_holder() const { return _cp->pool_holder(); }
|
||||
ConstantPool* constants() const { return _cp(); }
|
||||
AccessFlags access_flags() const { return _access_flags; }
|
||||
oop loader() const;
|
||||
InstanceKlass* field_holder() const { return _cp->pool_holder(); }
|
||||
ConstantPool* constants() const { return _cp(); }
|
||||
AccessFlags access_flags() const { return _access_flags; }
|
||||
oop loader() const;
|
||||
// Offset (in words) of field from start of instanceOop / Klass*
|
||||
int offset() const { return field()->offset(); }
|
||||
Symbol* generic_signature() const;
|
||||
int index() const { return _index; }
|
||||
AnnotationArray* annotations() const;
|
||||
int offset() const { return field()->offset(); }
|
||||
Symbol* generic_signature() const;
|
||||
int index() const { return _index; }
|
||||
AnnotationArray* annotations() const;
|
||||
|
||||
// Initial field value
|
||||
bool has_initial_value() const { return field()->initval_index() != 0; }
|
||||
int initial_value_index() const { return field()->initval_index(); }
|
||||
bool has_initial_value() const { return field()->initval_index() != 0; }
|
||||
int initial_value_index() const { return field()->initval_index(); }
|
||||
constantTag initial_value_tag() const; // The tag will return true on one of is_int(), is_long(), is_single(), is_double()
|
||||
jint int_initial_value() const;
|
||||
jlong long_initial_value() const;
|
||||
jfloat float_initial_value() const;
|
||||
jdouble double_initial_value() const;
|
||||
oop string_initial_value(TRAPS) const;
|
||||
jint int_initial_value() const;
|
||||
jlong long_initial_value() const;
|
||||
jfloat float_initial_value() const;
|
||||
jdouble double_initial_value() const;
|
||||
oop string_initial_value(TRAPS) const;
|
||||
|
||||
// Field signature type
|
||||
BasicType field_type() const { return FieldType::basic_type(signature()); }
|
||||
BasicType field_type() const { return FieldType::basic_type(signature()); }
|
||||
|
||||
// Access flags
|
||||
bool is_public() const { return access_flags().is_public(); }
|
||||
bool is_private() const { return access_flags().is_private(); }
|
||||
bool is_protected() const { return access_flags().is_protected(); }
|
||||
bool is_package_private() const { return !is_public() && !is_private() && !is_protected(); }
|
||||
bool is_public() const { return access_flags().is_public(); }
|
||||
bool is_private() const { return access_flags().is_private(); }
|
||||
bool is_protected() const { return access_flags().is_protected(); }
|
||||
bool is_package_private() const { return !is_public() && !is_private() && !is_protected(); }
|
||||
|
||||
bool is_static() const { return access_flags().is_static(); }
|
||||
bool is_final() const { return access_flags().is_final(); }
|
||||
bool is_volatile() const { return access_flags().is_volatile(); }
|
||||
bool is_transient() const { return access_flags().is_transient(); }
|
||||
bool is_static() const { return access_flags().is_static(); }
|
||||
bool is_final() const { return access_flags().is_final(); }
|
||||
bool is_volatile() const { return access_flags().is_volatile(); }
|
||||
bool is_transient() const { return access_flags().is_transient(); }
|
||||
|
||||
bool is_synthetic() const { return access_flags().is_synthetic(); }
|
||||
bool is_synthetic() const { return access_flags().is_synthetic(); }
|
||||
|
||||
bool is_field_access_watched() const { return access_flags().is_field_access_watched(); }
|
||||
bool is_field_access_watched() const { return access_flags().is_field_access_watched(); }
|
||||
bool is_field_modification_watched() const
|
||||
{ return access_flags().is_field_modification_watched(); }
|
||||
bool has_generic_signature() const { return access_flags().field_has_generic_signature(); }
|
||||
{ return access_flags().is_field_modification_watched(); }
|
||||
bool has_generic_signature() const { return access_flags().field_has_generic_signature(); }
|
||||
|
||||
void set_is_field_access_watched(const bool value) {
|
||||
_access_flags.set_is_field_access_watched(value);
|
||||
|
@ -3596,6 +3596,15 @@ class CommandLineFlags {
|
||||
product(uintx, StringTableSize, 1009, \
|
||||
"Number of buckets in the interned String table") \
|
||||
\
|
||||
develop(bool, TraceDefaultMethods, false, \
|
||||
"Trace the default method processing steps") \
|
||||
\
|
||||
develop(bool, ParseAllGenericSignatures, false, \
|
||||
"Parse all generic signatures while classloading") \
|
||||
\
|
||||
develop(bool, VerifyGenericSignatures, false, \
|
||||
"Abort VM on erroneous or inconsistent generic signatures") \
|
||||
\
|
||||
product(bool, UseVMInterruptibleIO, false, \
|
||||
"(Unstable, Solaris-specific) Thread interrupt before or with " \
|
||||
"EINTR for I/O operations results in OS_INTRPT. The default value"\
|
||||
|
@ -189,7 +189,7 @@ void JavaCalls::call_default_constructor(JavaThread* thread, methodHandle method
|
||||
assert(method->name() == vmSymbols::object_initializer_name(), "Should only be called for default constructor");
|
||||
assert(method->signature() == vmSymbols::void_method_signature(), "Should only be called for default constructor");
|
||||
|
||||
InstanceKlass* ik = InstanceKlass::cast(method->method_holder());
|
||||
InstanceKlass* ik = method->method_holder();
|
||||
if (ik->is_initialized() && ik->has_vanilla_constructor()) {
|
||||
// safe to skip constructor call
|
||||
} else {
|
||||
@ -344,11 +344,11 @@ void JavaCalls::call_helper(JavaValue* result, methodHandle* m, JavaCallArgument
|
||||
|
||||
|
||||
#ifdef ASSERT
|
||||
{ Klass* holder = method->method_holder();
|
||||
{ InstanceKlass* holder = method->method_holder();
|
||||
// A klass might not be initialized since JavaCall's might be used during the executing of
|
||||
// the <clinit>. For example, a Thread.start might start executing on an object that is
|
||||
// not fully initialized! (bad Java programming style)
|
||||
assert(InstanceKlass::cast(holder)->is_linked(), "rewritting must have taken place");
|
||||
assert(holder->is_linked(), "rewritting must have taken place");
|
||||
}
|
||||
#endif
|
||||
|
||||
|
@ -140,6 +140,7 @@ Monitor* JfrQuery_lock = NULL;
|
||||
Monitor* JfrMsg_lock = NULL;
|
||||
Mutex* JfrBuffer_lock = NULL;
|
||||
Mutex* JfrStream_lock = NULL;
|
||||
Monitor* PeriodicTask_lock = NULL;
|
||||
|
||||
#define MAX_NUM_MUTEX 128
|
||||
static Monitor * _mutex_array[MAX_NUM_MUTEX];
|
||||
@ -285,6 +286,7 @@ void mutex_init() {
|
||||
def(JfrMsg_lock , Monitor, nonleaf+2, true);
|
||||
def(JfrBuffer_lock , Mutex, nonleaf+3, true);
|
||||
def(JfrStream_lock , Mutex, nonleaf+4, true);
|
||||
def(PeriodicTask_lock , Monitor, nonleaf+5, true);
|
||||
}
|
||||
|
||||
GCMutexLocker::GCMutexLocker(Monitor * mutex) {
|
||||
|
@ -142,6 +142,7 @@ extern Monitor* JfrQuery_lock; // protects JFR use
|
||||
extern Monitor* JfrMsg_lock; // protects JFR messaging
|
||||
extern Mutex* JfrBuffer_lock; // protects JFR buffer operations
|
||||
extern Mutex* JfrStream_lock; // protects JFR stream access
|
||||
extern Monitor* PeriodicTask_lock; // protects the periodic task structure
|
||||
|
||||
// A MutexLocker provides mutual exclusion with respect to a given mutex
|
||||
// for the scope which contains the locker. The lock is an OS lock, not
|
||||
|
@ -56,14 +56,14 @@ static void trace_class_resolution(Klass* to_class) {
|
||||
vframeStream vfst(jthread);
|
||||
// skip over any frames belonging to java.lang.Class
|
||||
while (!vfst.at_end() &&
|
||||
InstanceKlass::cast(vfst.method()->method_holder())->name() == vmSymbols::java_lang_Class()) {
|
||||
vfst.method()->method_holder()->name() == vmSymbols::java_lang_Class()) {
|
||||
vfst.next();
|
||||
}
|
||||
if (!vfst.at_end()) {
|
||||
// this frame is a likely suspect
|
||||
caller = vfst.method()->method_holder();
|
||||
line_number = vfst.method()->line_number_from_bci(vfst.bci());
|
||||
Symbol* s = InstanceKlass::cast(vfst.method()->method_holder())->source_file_name();
|
||||
Symbol* s = vfst.method()->method_holder()->source_file_name();
|
||||
if (s != NULL) {
|
||||
source_file = s->as_C_string();
|
||||
}
|
||||
@ -472,6 +472,12 @@ bool Reflection::verify_class_access(Klass* current_class, Klass* new_class, boo
|
||||
return true;
|
||||
}
|
||||
|
||||
// Also allow all accesses from
|
||||
// java/lang/invoke/MagicLambdaImpl subclasses to succeed trivially.
|
||||
if (current_class->is_subclass_of(SystemDictionary::lambda_MagicLambdaImpl_klass())) {
|
||||
return true;
|
||||
}
|
||||
|
||||
return can_relax_access_check_for(current_class, new_class, classloader_only);
|
||||
}
|
||||
|
||||
@ -564,6 +570,12 @@ bool Reflection::verify_field_access(Klass* current_class,
|
||||
return true;
|
||||
}
|
||||
|
||||
// Also allow all accesses from
|
||||
// java/lang/invoke/MagicLambdaImpl subclasses to succeed trivially.
|
||||
if (current_class->is_subclass_of(SystemDictionary::lambda_MagicLambdaImpl_klass())) {
|
||||
return true;
|
||||
}
|
||||
|
||||
return can_relax_access_check_for(
|
||||
current_class, field_class, classloader_only);
|
||||
}
|
||||
@ -630,8 +642,8 @@ oop get_mirror_from_signature(methodHandle method, SignatureStream* ss, TRAPS) {
|
||||
case T_OBJECT:
|
||||
case T_ARRAY:
|
||||
Symbol* name = ss->as_symbol(CHECK_NULL);
|
||||
oop loader = InstanceKlass::cast(method->method_holder())->class_loader();
|
||||
oop protection_domain = InstanceKlass::cast(method->method_holder())->protection_domain();
|
||||
oop loader = method->method_holder()->class_loader();
|
||||
oop protection_domain = method->method_holder()->protection_domain();
|
||||
Klass* k = SystemDictionary::resolve_or_fail(
|
||||
name,
|
||||
Handle(THREAD, loader),
|
||||
@ -702,7 +714,7 @@ oop Reflection::new_method(methodHandle method, bool intern_name, bool for_const
|
||||
assert(!method()->is_initializer() ||
|
||||
(for_constant_pool_access && method()->is_static()) ||
|
||||
(method()->name() == vmSymbols::class_initializer_name()
|
||||
&& Klass::cast(method()->method_holder())->is_interface() && JDK_Version::is_jdk12x_version()), "should call new_constructor instead");
|
||||
&& method()->method_holder()->is_interface() && JDK_Version::is_jdk12x_version()), "should call new_constructor instead");
|
||||
instanceKlassHandle holder (THREAD, method->method_holder());
|
||||
int slot = method->method_idnum();
|
||||
|
||||
@ -820,7 +832,7 @@ oop Reflection::new_field(fieldDescriptor* fd, bool intern_name, TRAPS) {
|
||||
Handle type = new_type(signature, holder, CHECK_NULL);
|
||||
Handle rh = java_lang_reflect_Field::create(CHECK_NULL);
|
||||
|
||||
java_lang_reflect_Field::set_clazz(rh(), Klass::cast(fd->field_holder())->java_mirror());
|
||||
java_lang_reflect_Field::set_clazz(rh(), fd->field_holder()->java_mirror());
|
||||
java_lang_reflect_Field::set_slot(rh(), fd->index());
|
||||
java_lang_reflect_Field::set_name(rh(), name());
|
||||
java_lang_reflect_Field::set_type(rh(), type());
|
||||
@ -888,7 +900,7 @@ oop Reflection::invoke(instanceKlassHandle klass, methodHandle reflected_method,
|
||||
method = reflected_method;
|
||||
} else {
|
||||
// resolve based on the receiver
|
||||
if (InstanceKlass::cast(reflected_method->method_holder())->is_interface()) {
|
||||
if (reflected_method->method_holder()->is_interface()) {
|
||||
// resolve interface call
|
||||
if (ReflectionWrapResolutionErrors) {
|
||||
// new default: 6531596
|
||||
|
@ -61,7 +61,7 @@ void PeriodicTask::print_intervals() {
|
||||
}
|
||||
#endif
|
||||
|
||||
void PeriodicTask::real_time_tick(size_t delay_time) {
|
||||
void PeriodicTask::real_time_tick(int delay_time) {
|
||||
#ifndef PRODUCT
|
||||
if (ProfilerCheckIntervals) {
|
||||
_ticks++;
|
||||
@ -73,19 +73,39 @@ void PeriodicTask::real_time_tick(size_t delay_time) {
|
||||
_intervalHistogram[ms]++;
|
||||
}
|
||||
#endif
|
||||
int orig_num_tasks = _num_tasks;
|
||||
for(int index = 0; index < _num_tasks; index++) {
|
||||
_tasks[index]->execute_if_pending(delay_time);
|
||||
if (_num_tasks < orig_num_tasks) { // task dis-enrolled itself
|
||||
index--; // re-do current slot as it has changed
|
||||
orig_num_tasks = _num_tasks;
|
||||
|
||||
{
|
||||
MutexLockerEx ml(PeriodicTask_lock, Mutex::_no_safepoint_check_flag);
|
||||
int orig_num_tasks = _num_tasks;
|
||||
|
||||
for(int index = 0; index < _num_tasks; index++) {
|
||||
_tasks[index]->execute_if_pending(delay_time);
|
||||
if (_num_tasks < orig_num_tasks) { // task dis-enrolled itself
|
||||
index--; // re-do current slot as it has changed
|
||||
orig_num_tasks = _num_tasks;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
int PeriodicTask::time_to_wait() {
|
||||
MutexLockerEx ml(PeriodicTask_lock->owned_by_self() ?
|
||||
NULL : PeriodicTask_lock, Mutex::_no_safepoint_check_flag);
|
||||
|
||||
if (_num_tasks == 0) {
|
||||
return 0; // sleep until shutdown or a task is enrolled
|
||||
}
|
||||
|
||||
int delay = _tasks[0]->time_to_next_interval();
|
||||
for (int index = 1; index < _num_tasks; index++) {
|
||||
delay = MIN2(delay, _tasks[index]->time_to_next_interval());
|
||||
}
|
||||
return delay;
|
||||
}
|
||||
|
||||
|
||||
PeriodicTask::PeriodicTask(size_t interval_time) :
|
||||
_counter(0), _interval(interval_time) {
|
||||
_counter(0), _interval((int) interval_time) {
|
||||
// Sanity check the interval time
|
||||
assert(_interval >= PeriodicTask::min_interval &&
|
||||
_interval <= PeriodicTask::max_interval &&
|
||||
@ -94,33 +114,40 @@ PeriodicTask::PeriodicTask(size_t interval_time) :
|
||||
}
|
||||
|
||||
PeriodicTask::~PeriodicTask() {
|
||||
if (is_enrolled())
|
||||
disenroll();
|
||||
}
|
||||
|
||||
bool PeriodicTask::is_enrolled() const {
|
||||
for(int index = 0; index < _num_tasks; index++)
|
||||
if (_tasks[index] == this) return true;
|
||||
return false;
|
||||
disenroll();
|
||||
}
|
||||
|
||||
void PeriodicTask::enroll() {
|
||||
assert(WatcherThread::watcher_thread() == NULL, "dynamic enrollment of tasks not yet supported");
|
||||
MutexLockerEx ml(PeriodicTask_lock->owned_by_self() ?
|
||||
NULL : PeriodicTask_lock, Mutex::_no_safepoint_check_flag);
|
||||
|
||||
if (_num_tasks == PeriodicTask::max_tasks)
|
||||
if (_num_tasks == PeriodicTask::max_tasks) {
|
||||
fatal("Overflow in PeriodicTask table");
|
||||
}
|
||||
_tasks[_num_tasks++] = this;
|
||||
|
||||
WatcherThread* thread = WatcherThread::watcher_thread();
|
||||
if (thread) {
|
||||
thread->unpark();
|
||||
} else {
|
||||
WatcherThread::start();
|
||||
}
|
||||
}
|
||||
|
||||
void PeriodicTask::disenroll() {
|
||||
assert(WatcherThread::watcher_thread() == NULL ||
|
||||
Thread::current() == WatcherThread::watcher_thread(),
|
||||
"dynamic disenrollment currently only handled from WatcherThread from within task() method");
|
||||
MutexLockerEx ml(PeriodicTask_lock->owned_by_self() ?
|
||||
NULL : PeriodicTask_lock, Mutex::_no_safepoint_check_flag);
|
||||
|
||||
int index;
|
||||
for(index = 0; index < _num_tasks && _tasks[index] != this; index++);
|
||||
if (index == _num_tasks) return;
|
||||
for(index = 0; index < _num_tasks && _tasks[index] != this; index++)
|
||||
;
|
||||
|
||||
if (index == _num_tasks) {
|
||||
return;
|
||||
}
|
||||
|
||||
_num_tasks--;
|
||||
|
||||
for (; index < _num_tasks; index++) {
|
||||
_tasks[index] = _tasks[index+1];
|
||||
}
|
||||
|
@ -49,12 +49,12 @@ class PeriodicTask: public CHeapObj<mtInternal> {
|
||||
static int num_tasks() { return _num_tasks; }
|
||||
|
||||
private:
|
||||
size_t _counter;
|
||||
const size_t _interval;
|
||||
int _counter;
|
||||
const int _interval;
|
||||
|
||||
static int _num_tasks;
|
||||
static PeriodicTask* _tasks[PeriodicTask::max_tasks];
|
||||
static void real_time_tick(size_t delay_time);
|
||||
static void real_time_tick(int delay_time);
|
||||
|
||||
#ifndef PRODUCT
|
||||
static elapsedTimer _timer; // measures time between ticks
|
||||
@ -69,51 +69,36 @@ class PeriodicTask: public CHeapObj<mtInternal> {
|
||||
PeriodicTask(size_t interval_time); // interval is in milliseconds of elapsed time
|
||||
~PeriodicTask();
|
||||
|
||||
// Tells whether is enrolled
|
||||
bool is_enrolled() const;
|
||||
|
||||
// Make the task active
|
||||
// NOTE: this may only be called before the WatcherThread has been started
|
||||
// For dynamic enrollment at the time T, the task will execute somewhere
|
||||
// between T and T + interval_time.
|
||||
void enroll();
|
||||
|
||||
// Make the task deactive
|
||||
// NOTE: this may only be called either while the WatcherThread is
|
||||
// inactive or by a task from within its task() method. One-shot or
|
||||
// several-shot tasks may be implemented this way.
|
||||
void disenroll();
|
||||
|
||||
void execute_if_pending(size_t delay_time) {
|
||||
_counter += delay_time;
|
||||
if (_counter >= _interval) {
|
||||
void execute_if_pending(int delay_time) {
|
||||
// make sure we don't overflow
|
||||
jlong tmp = (jlong) _counter + (jlong) delay_time;
|
||||
|
||||
if (tmp >= (jlong) _interval) {
|
||||
_counter = 0;
|
||||
task();
|
||||
} else {
|
||||
_counter += delay_time;
|
||||
}
|
||||
}
|
||||
|
||||
// Returns how long (time in milliseconds) before the next time we should
|
||||
// execute this task.
|
||||
size_t time_to_next_interval() const {
|
||||
int time_to_next_interval() const {
|
||||
assert(_interval > _counter, "task counter greater than interval?");
|
||||
return _interval - _counter;
|
||||
}
|
||||
|
||||
// Calculate when the next periodic task will fire.
|
||||
// Called by the WatcherThread's run method.
|
||||
// This assumes that periodic tasks aren't entering the system
|
||||
// dynamically, except for during startup.
|
||||
static size_t time_to_wait() {
|
||||
if (_num_tasks == 0) {
|
||||
// Don't wait any more; shut down the thread since we don't
|
||||
// currently support dynamic enrollment.
|
||||
return 0;
|
||||
}
|
||||
|
||||
size_t delay = _tasks[0]->time_to_next_interval();
|
||||
for (int index = 1; index < _num_tasks; index++) {
|
||||
delay = MIN2(delay, _tasks[index]->time_to_next_interval());
|
||||
}
|
||||
return delay;
|
||||
}
|
||||
static int time_to_wait();
|
||||
|
||||
// The task to perform at each period
|
||||
virtual void task() = 0;
|
||||
|
@ -1217,6 +1217,7 @@ void NamedThread::set_name(const char* format, ...) {
|
||||
// timer interrupts exists on the platform.
|
||||
|
||||
WatcherThread* WatcherThread::_watcher_thread = NULL;
|
||||
bool WatcherThread::_startable = false;
|
||||
volatile bool WatcherThread::_should_terminate = false;
|
||||
|
||||
WatcherThread::WatcherThread() : Thread() {
|
||||
@ -1237,6 +1238,55 @@ WatcherThread::WatcherThread() : Thread() {
|
||||
}
|
||||
}
|
||||
|
||||
int WatcherThread::sleep() const {
|
||||
MutexLockerEx ml(PeriodicTask_lock, Mutex::_no_safepoint_check_flag);
|
||||
|
||||
// remaining will be zero if there are no tasks,
|
||||
// causing the WatcherThread to sleep until a task is
|
||||
// enrolled
|
||||
int remaining = PeriodicTask::time_to_wait();
|
||||
int time_slept = 0;
|
||||
|
||||
// we expect this to timeout - we only ever get unparked when
|
||||
// we should terminate or when a new task has been enrolled
|
||||
OSThreadWaitState osts(this->osthread(), false /* not Object.wait() */);
|
||||
|
||||
jlong time_before_loop = os::javaTimeNanos();
|
||||
|
||||
for (;;) {
|
||||
bool timedout = PeriodicTask_lock->wait(Mutex::_no_safepoint_check_flag, remaining);
|
||||
jlong now = os::javaTimeNanos();
|
||||
|
||||
if (remaining == 0) {
|
||||
// if we didn't have any tasks we could have waited for a long time
|
||||
// consider the time_slept zero and reset time_before_loop
|
||||
time_slept = 0;
|
||||
time_before_loop = now;
|
||||
} else {
|
||||
// need to recalulate since we might have new tasks in _tasks
|
||||
time_slept = (int) ((now - time_before_loop) / 1000000);
|
||||
}
|
||||
|
||||
// Change to task list or spurious wakeup of some kind
|
||||
if (timedout || _should_terminate) {
|
||||
break;
|
||||
}
|
||||
|
||||
remaining = PeriodicTask::time_to_wait();
|
||||
if (remaining == 0) {
|
||||
// Last task was just disenrolled so loop around and wait until
|
||||
// another task gets enrolled
|
||||
continue;
|
||||
}
|
||||
|
||||
remaining -= time_slept;
|
||||
if (remaining <= 0)
|
||||
break;
|
||||
}
|
||||
|
||||
return time_slept;
|
||||
}
|
||||
|
||||
void WatcherThread::run() {
|
||||
assert(this == watcher_thread(), "just checking");
|
||||
|
||||
@ -1249,26 +1299,7 @@ void WatcherThread::run() {
|
||||
|
||||
// Calculate how long it'll be until the next PeriodicTask work
|
||||
// should be done, and sleep that amount of time.
|
||||
size_t time_to_wait = PeriodicTask::time_to_wait();
|
||||
|
||||
// we expect this to timeout - we only ever get unparked when
|
||||
// we should terminate
|
||||
{
|
||||
OSThreadWaitState osts(this->osthread(), false /* not Object.wait() */);
|
||||
|
||||
jlong prev_time = os::javaTimeNanos();
|
||||
for (;;) {
|
||||
int res= _SleepEvent->park(time_to_wait);
|
||||
if (res == OS_TIMEOUT || _should_terminate)
|
||||
break;
|
||||
// spurious wakeup of some kind
|
||||
jlong now = os::javaTimeNanos();
|
||||
time_to_wait -= (now - prev_time) / 1000000;
|
||||
if (time_to_wait <= 0)
|
||||
break;
|
||||
prev_time = now;
|
||||
}
|
||||
}
|
||||
int time_waited = sleep();
|
||||
|
||||
if (is_error_reported()) {
|
||||
// A fatal error has happened, the error handler(VMError::report_and_die)
|
||||
@ -1298,13 +1329,7 @@ void WatcherThread::run() {
|
||||
}
|
||||
}
|
||||
|
||||
PeriodicTask::real_time_tick(time_to_wait);
|
||||
|
||||
// If we have no more tasks left due to dynamic disenrollment,
|
||||
// shut down the thread since we don't currently support dynamic enrollment
|
||||
if (PeriodicTask::num_tasks() == 0) {
|
||||
_should_terminate = true;
|
||||
}
|
||||
PeriodicTask::real_time_tick(time_waited);
|
||||
}
|
||||
|
||||
// Signal that it is terminated
|
||||
@ -1319,22 +1344,33 @@ void WatcherThread::run() {
|
||||
}
|
||||
|
||||
void WatcherThread::start() {
|
||||
if (watcher_thread() == NULL) {
|
||||
assert(PeriodicTask_lock->owned_by_self(), "PeriodicTask_lock required");
|
||||
|
||||
if (watcher_thread() == NULL && _startable) {
|
||||
_should_terminate = false;
|
||||
// Create the single instance of WatcherThread
|
||||
new WatcherThread();
|
||||
}
|
||||
}
|
||||
|
||||
void WatcherThread::make_startable() {
|
||||
assert(PeriodicTask_lock->owned_by_self(), "PeriodicTask_lock required");
|
||||
_startable = true;
|
||||
}
|
||||
|
||||
void WatcherThread::stop() {
|
||||
{
|
||||
MutexLockerEx ml(PeriodicTask_lock, Mutex::_no_safepoint_check_flag);
|
||||
_should_terminate = true;
|
||||
OrderAccess::fence(); // ensure WatcherThread sees update in main loop
|
||||
|
||||
WatcherThread* watcher = watcher_thread();
|
||||
if (watcher != NULL)
|
||||
watcher->unpark();
|
||||
}
|
||||
|
||||
// it is ok to take late safepoints here, if needed
|
||||
MutexLocker mu(Terminator_lock);
|
||||
_should_terminate = true;
|
||||
OrderAccess::fence(); // ensure WatcherThread sees update in main loop
|
||||
|
||||
Thread* watcher = watcher_thread();
|
||||
if (watcher != NULL)
|
||||
watcher->_SleepEvent->unpark();
|
||||
|
||||
while(watcher_thread() != NULL) {
|
||||
// This wait should make safepoint checks, wait without a timeout,
|
||||
@ -1352,6 +1388,11 @@ void WatcherThread::stop() {
|
||||
}
|
||||
}
|
||||
|
||||
void WatcherThread::unpark() {
|
||||
MutexLockerEx ml(PeriodicTask_lock->owned_by_self() ? NULL : PeriodicTask_lock, Mutex::_no_safepoint_check_flag);
|
||||
PeriodicTask_lock->notify();
|
||||
}
|
||||
|
||||
void WatcherThread::print_on(outputStream* st) const {
|
||||
st->print("\"%s\" ", name());
|
||||
Thread::print_on(st);
|
||||
@ -3658,12 +3699,18 @@ jint Threads::create_vm(JavaVMInitArgs* args, bool* canTryAgain) {
|
||||
}
|
||||
}
|
||||
|
||||
// Start up the WatcherThread if there are any periodic tasks
|
||||
// NOTE: All PeriodicTasks should be registered by now. If they
|
||||
// aren't, late joiners might appear to start slowly (we might
|
||||
// take a while to process their first tick).
|
||||
if (PeriodicTask::num_tasks() > 0) {
|
||||
WatcherThread::start();
|
||||
{
|
||||
MutexLockerEx ml(PeriodicTask_lock, Mutex::_no_safepoint_check_flag);
|
||||
// Make sure the watcher thread can be started by WatcherThread::start()
|
||||
// or by dynamic enrollment.
|
||||
WatcherThread::make_startable();
|
||||
// Start up the WatcherThread if there are any periodic tasks
|
||||
// NOTE: All PeriodicTasks should be registered by now. If they
|
||||
// aren't, late joiners might appear to start slowly (we might
|
||||
// take a while to process their first tick).
|
||||
if (PeriodicTask::num_tasks() > 0) {
|
||||
WatcherThread::start();
|
||||
}
|
||||
}
|
||||
|
||||
// Give os specific code one last chance to start
|
||||
|
@ -722,6 +722,7 @@ class WatcherThread: public Thread {
|
||||
private:
|
||||
static WatcherThread* _watcher_thread;
|
||||
|
||||
static bool _startable;
|
||||
volatile static bool _should_terminate; // updated without holding lock
|
||||
public:
|
||||
enum SomeConstants {
|
||||
@ -738,6 +739,7 @@ class WatcherThread: public Thread {
|
||||
char* name() const { return (char*)"VM Periodic Task Thread"; }
|
||||
void print_on(outputStream* st) const;
|
||||
void print() const { print_on(tty); }
|
||||
void unpark();
|
||||
|
||||
// Returns the single instance of WatcherThread
|
||||
static WatcherThread* watcher_thread() { return _watcher_thread; }
|
||||
@ -745,6 +747,12 @@ class WatcherThread: public Thread {
|
||||
// Create and start the single instance of WatcherThread, or stop it on shutdown
|
||||
static void start();
|
||||
static void stop();
|
||||
// Only allow start once the VM is sufficiently initialized
|
||||
// Otherwise the first task to enroll will trigger the start
|
||||
static void make_startable();
|
||||
|
||||
private:
|
||||
int sleep() const;
|
||||
};
|
||||
|
||||
|
||||
|
@ -161,7 +161,7 @@ void javaVFrame::print_lock_info_on(outputStream* st, int frame_count) {
|
||||
// If this is the first frame, and java.lang.Object.wait(...) then print out the receiver.
|
||||
if (frame_count == 0) {
|
||||
if (method()->name() == vmSymbols::wait_name() &&
|
||||
InstanceKlass::cast(method()->method_holder())->name() == vmSymbols::java_lang_Object()) {
|
||||
method()->method_holder()->name() == vmSymbols::java_lang_Object()) {
|
||||
StackValueCollection* locs = locals();
|
||||
if (!locs->is_empty()) {
|
||||
StackValue* sv = locs->at(0);
|
||||
@ -407,7 +407,7 @@ void vframeStreamCommon::security_get_caller_frame(int depth) {
|
||||
if (Universe::reflect_invoke_cache()->is_same_method(method())) {
|
||||
// This is Method.invoke() -- skip it
|
||||
} else if (use_new_reflection &&
|
||||
Klass::cast(method()->method_holder())
|
||||
method()->method_holder()
|
||||
->is_subclass_of(SystemDictionary::reflect_MethodAccessorImpl_klass())) {
|
||||
// This is an auxilary frame -- skip it
|
||||
} else if (method()->is_method_handle_intrinsic() ||
|
||||
@ -471,8 +471,8 @@ void vframeStreamCommon::skip_prefixed_method_and_wrappers() {
|
||||
void vframeStreamCommon::skip_reflection_related_frames() {
|
||||
while (!at_end() &&
|
||||
(JDK_Version::is_gte_jdk14x_version() && UseNewReflection &&
|
||||
(Klass::cast(method()->method_holder())->is_subclass_of(SystemDictionary::reflect_MethodAccessorImpl_klass()) ||
|
||||
Klass::cast(method()->method_holder())->is_subclass_of(SystemDictionary::reflect_ConstructorAccessorImpl_klass())))) {
|
||||
(method()->method_holder()->is_subclass_of(SystemDictionary::reflect_MethodAccessorImpl_klass()) ||
|
||||
method()->method_holder()->is_subclass_of(SystemDictionary::reflect_ConstructorAccessorImpl_klass())))) {
|
||||
next();
|
||||
}
|
||||
}
|
||||
@ -547,13 +547,13 @@ void javaVFrame::print() {
|
||||
|
||||
void javaVFrame::print_value() const {
|
||||
Method* m = method();
|
||||
Klass* k = m->method_holder();
|
||||
InstanceKlass* k = m->method_holder();
|
||||
tty->print_cr("frame( sp=" INTPTR_FORMAT ", unextended_sp=" INTPTR_FORMAT ", fp=" INTPTR_FORMAT ", pc=" INTPTR_FORMAT ")",
|
||||
_fr.sp(), _fr.unextended_sp(), _fr.fp(), _fr.pc());
|
||||
tty->print("%s.%s", Klass::cast(k)->internal_name(), m->name()->as_C_string());
|
||||
|
||||
if (!m->is_native()) {
|
||||
Symbol* source_name = InstanceKlass::cast(k)->source_file_name();
|
||||
Symbol* source_name = k->source_file_name();
|
||||
int line_number = m->line_number_from_bci(bci());
|
||||
if (source_name != NULL && (line_number != -1)) {
|
||||
tty->print("(%s:%d)", source_name->as_C_string(), line_number);
|
||||
|
@ -289,7 +289,7 @@ typedef BinaryTreeDictionary<Metablock, FreeList> MetablockTreeDictionary;
|
||||
nonstatic_field(CompiledICHolder, _holder_klass, Klass*) \
|
||||
nonstatic_field(ConstantPool, _tags, Array<u1>*) \
|
||||
nonstatic_field(ConstantPool, _cache, ConstantPoolCache*) \
|
||||
nonstatic_field(ConstantPool, _pool_holder, Klass*) \
|
||||
nonstatic_field(ConstantPool, _pool_holder, InstanceKlass*) \
|
||||
nonstatic_field(ConstantPool, _operands, Array<u2>*) \
|
||||
nonstatic_field(ConstantPool, _length, int) \
|
||||
nonstatic_field(ConstantPool, _resolved_references, jobject) \
|
||||
|
@ -1117,8 +1117,8 @@ void DumperSupport::dump_stack_frame(DumpWriter* writer,
|
||||
writer->write_symbolID(m->name()); // method's name
|
||||
writer->write_symbolID(m->signature()); // method's signature
|
||||
|
||||
assert(Klass::cast(m->method_holder())->oop_is_instance(), "not InstanceKlass");
|
||||
writer->write_symbolID(InstanceKlass::cast(m->method_holder())->source_file_name()); // source file name
|
||||
assert(m->method_holder()->oop_is_instance(), "not InstanceKlass");
|
||||
writer->write_symbolID(m->method_holder()->source_file_name()); // source file name
|
||||
writer->write_u4(class_serial_num); // class serial number
|
||||
writer->write_u4((u4) line_number); // line number
|
||||
}
|
||||
|
@ -311,6 +311,17 @@ public:
|
||||
inline bool contains_address(address add) const {
|
||||
return (addr() <= add && addr() + size() > add);
|
||||
}
|
||||
|
||||
// if this memory region overlaps another region
|
||||
inline bool overlaps_region(const MemPointerRecord* other) const {
|
||||
assert(other != NULL, "Just check");
|
||||
assert(size() > 0 && other->size() > 0, "empty range");
|
||||
return contains_address(other->addr()) ||
|
||||
contains_address(other->addr() + other->size() - 1) || // exclude end address
|
||||
other->contains_address(addr()) ||
|
||||
other->contains_address(addr() + size() - 1); // exclude end address
|
||||
}
|
||||
|
||||
};
|
||||
|
||||
// MemPointerRecordEx also records callsite pc, from where
|
||||
|
@ -31,6 +31,69 @@
|
||||
#include "services/memSnapshot.hpp"
|
||||
#include "services/memTracker.hpp"
|
||||
|
||||
#ifdef ASSERT
|
||||
|
||||
void decode_pointer_record(MemPointerRecord* rec) {
|
||||
tty->print("Pointer: [" PTR_FORMAT " - " PTR_FORMAT "] size = %d bytes", rec->addr(),
|
||||
rec->addr() + rec->size(), (int)rec->size());
|
||||
tty->print(" type = %s", MemBaseline::type2name(FLAGS_TO_MEMORY_TYPE(rec->flags())));
|
||||
if (rec->is_vm_pointer()) {
|
||||
if (rec->is_allocation_record()) {
|
||||
tty->print_cr(" (reserve)");
|
||||
} else if (rec->is_commit_record()) {
|
||||
tty->print_cr(" (commit)");
|
||||
} else if (rec->is_uncommit_record()) {
|
||||
tty->print_cr(" (uncommit)");
|
||||
} else if (rec->is_deallocation_record()) {
|
||||
tty->print_cr(" (release)");
|
||||
} else {
|
||||
tty->print_cr(" (tag)");
|
||||
}
|
||||
} else {
|
||||
if (rec->is_arena_size_record()) {
|
||||
tty->print_cr(" (arena size)");
|
||||
} else if (rec->is_allocation_record()) {
|
||||
tty->print_cr(" (malloc)");
|
||||
} else {
|
||||
tty->print_cr(" (free)");
|
||||
}
|
||||
}
|
||||
if (MemTracker::track_callsite()) {
|
||||
char buf[1024];
|
||||
address pc = ((MemPointerRecordEx*)rec)->pc();
|
||||
if (pc != NULL && os::dll_address_to_function_name(pc, buf, sizeof(buf), NULL)) {
|
||||
tty->print_cr("\tfrom %s", buf);
|
||||
} else {
|
||||
tty->print_cr("\tcould not decode pc = " PTR_FORMAT "", pc);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
void decode_vm_region_record(VMMemRegion* rec) {
|
||||
tty->print("VM Region [" PTR_FORMAT " - " PTR_FORMAT "]", rec->addr(),
|
||||
rec->addr() + rec->size());
|
||||
tty->print(" type = %s", MemBaseline::type2name(FLAGS_TO_MEMORY_TYPE(rec->flags())));
|
||||
if (rec->is_allocation_record()) {
|
||||
tty->print_cr(" (reserved)");
|
||||
} else if (rec->is_commit_record()) {
|
||||
tty->print_cr(" (committed)");
|
||||
} else {
|
||||
ShouldNotReachHere();
|
||||
}
|
||||
if (MemTracker::track_callsite()) {
|
||||
char buf[1024];
|
||||
address pc = ((VMMemRegionEx*)rec)->pc();
|
||||
if (pc != NULL && os::dll_address_to_function_name(pc, buf, sizeof(buf), NULL)) {
|
||||
tty->print_cr("\tfrom %s", buf);
|
||||
} else {
|
||||
tty->print_cr("\tcould not decode pc = " PTR_FORMAT "", pc);
|
||||
}
|
||||
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
||||
|
||||
bool VMMemPointerIterator::insert_record(MemPointerRecord* rec) {
|
||||
VMMemRegionEx new_rec;
|
||||
@ -73,52 +136,61 @@ bool VMMemPointerIterator::add_reserved_region(MemPointerRecord* rec) {
|
||||
return true;
|
||||
}
|
||||
assert(cur->base() > rec->addr(), "Just check: locate()");
|
||||
assert(rec->addr() + rec->size() <= cur->base(), "Can not overlap");
|
||||
assert(!cur->overlaps_region(rec), "overlapping reserved regions");
|
||||
return insert_record(rec);
|
||||
}
|
||||
|
||||
// we do consolidate committed regions
|
||||
bool VMMemPointerIterator::add_committed_region(MemPointerRecord* rec) {
|
||||
assert(rec->is_commit_record(), "Sanity check");
|
||||
VMMemRegion* cur;
|
||||
cur = (VMMemRegion*)current();
|
||||
assert(cur->is_reserved_region() && cur->contains_region(rec),
|
||||
VMMemRegion* reserved_rgn = (VMMemRegion*)current();
|
||||
assert(reserved_rgn->is_reserved_region() && reserved_rgn->contains_region(rec),
|
||||
"Sanity check");
|
||||
|
||||
// thread's native stack is always marked as "committed", ignore
|
||||
// the "commit" operation for creating stack guard pages
|
||||
if (FLAGS_TO_MEMORY_TYPE(cur->flags()) == mtThreadStack &&
|
||||
if (FLAGS_TO_MEMORY_TYPE(reserved_rgn->flags()) == mtThreadStack &&
|
||||
FLAGS_TO_MEMORY_TYPE(rec->flags()) != mtThreadStack) {
|
||||
return true;
|
||||
}
|
||||
|
||||
cur = (VMMemRegion*)next();
|
||||
while (cur != NULL && cur->is_committed_region()) {
|
||||
// if the reserved region has any committed regions
|
||||
VMMemRegion* committed_rgn = (VMMemRegion*)next();
|
||||
while (committed_rgn != NULL && committed_rgn->is_committed_region()) {
|
||||
// duplicated commit records
|
||||
if(cur->contains_region(rec)) {
|
||||
if(committed_rgn->contains_region(rec)) {
|
||||
return true;
|
||||
}
|
||||
if (cur->base() > rec->addr()) {
|
||||
// committed regions can not overlap
|
||||
assert(rec->addr() + rec->size() <= cur->base(), "Can not overlap");
|
||||
if (rec->addr() + rec->size() == cur->base()) {
|
||||
cur->expand_region(rec->addr(), rec->size());
|
||||
return true;
|
||||
} else if (committed_rgn->overlaps_region(rec)) {
|
||||
// overlaps front part
|
||||
if (rec->addr() < committed_rgn->addr()) {
|
||||
committed_rgn->expand_region(rec->addr(),
|
||||
committed_rgn->addr() - rec->addr());
|
||||
} else {
|
||||
return insert_record(rec);
|
||||
// overlaps tail part
|
||||
address committed_rgn_end = committed_rgn->addr() +
|
||||
committed_rgn->size();
|
||||
assert(committed_rgn_end < rec->addr() + rec->size(),
|
||||
"overlap tail part");
|
||||
committed_rgn->expand_region(committed_rgn_end,
|
||||
(rec->addr() + rec->size()) - committed_rgn_end);
|
||||
}
|
||||
} else if (cur->base() + cur->size() == rec->addr()) {
|
||||
cur->expand_region(rec->addr(), rec->size());
|
||||
} else if (committed_rgn->base() + committed_rgn->size() == rec->addr()) {
|
||||
// adjunct each other
|
||||
committed_rgn->expand_region(rec->addr(), rec->size());
|
||||
VMMemRegion* next_reg = (VMMemRegion*)next();
|
||||
// see if we can consolidate next committed region
|
||||
if (next_reg != NULL && next_reg->is_committed_region() &&
|
||||
next_reg->base() == cur->base() + cur->size()) {
|
||||
cur->expand_region(next_reg->base(), next_reg->size());
|
||||
next_reg->base() == committed_rgn->base() + committed_rgn->size()) {
|
||||
committed_rgn->expand_region(next_reg->base(), next_reg->size());
|
||||
// delete merged region
|
||||
remove();
|
||||
}
|
||||
return true;
|
||||
} else if (committed_rgn->base() > rec->addr()) {
|
||||
// found the location, insert this committed region
|
||||
return insert_record(rec);
|
||||
}
|
||||
cur = (VMMemRegion*)next();
|
||||
committed_rgn = (VMMemRegion*)next();
|
||||
}
|
||||
return insert_record(rec);
|
||||
}
|
||||
|
@ -217,7 +217,12 @@ template<class E> class GrowableArray : public GenericGrowableArray {
|
||||
return missed;
|
||||
}
|
||||
|
||||
E at(int i) const {
|
||||
E& at(int i) {
|
||||
assert(0 <= i && i < _len, "illegal index");
|
||||
return _data[i];
|
||||
}
|
||||
|
||||
E const& at(int i) const {
|
||||
assert(0 <= i && i < _len, "illegal index");
|
||||
return _data[i];
|
||||
}
|
||||
|
42
hotspot/src/share/vm/utilities/pair.hpp
Normal file
42
hotspot/src/share/vm/utilities/pair.hpp
Normal file
@ -0,0 +1,42 @@
|
||||
/*
|
||||
* Copyright (c) 2012, Oracle and/or its affiliates. All rights reserved.
|
||||
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
||||
*
|
||||
* This code is free software; you can redistribute it and/or modify it
|
||||
* under the terms of the GNU General Public License version 2 only, as
|
||||
* published by the Free Software Foundation.
|
||||
*
|
||||
* This code is distributed in the hope that it will be useful, but WITHOUT
|
||||
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
||||
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
||||
* version 2 for more details (a copy is included in the LICENSE file that
|
||||
* accompanied this code).
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License version
|
||||
* 2 along with this work; if not, write to the Free Software Foundation,
|
||||
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
||||
*
|
||||
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
||||
* or visit www.oracle.com if you need additional information or have any
|
||||
* questions.
|
||||
*
|
||||
*/
|
||||
|
||||
#ifndef SHARE_VM_UTILITIES_PAIR_HPP
|
||||
#define SHARE_VM_UTILITIES_PAIR_HPP
|
||||
|
||||
#include "memory/allocation.hpp"
|
||||
#include "utilities/top.hpp"
|
||||
|
||||
template<typename T, typename V, typename ALLOC_BASE = ResourceObj>
|
||||
class Pair : public ALLOC_BASE {
|
||||
public:
|
||||
T first;
|
||||
V second;
|
||||
|
||||
Pair() {}
|
||||
Pair(T t, V v) : first(t), second(v) {}
|
||||
};
|
||||
|
||||
|
||||
#endif // SHARE_VM_UTILITIES_PAIR_HPP
|
134
hotspot/src/share/vm/utilities/resourceHash.hpp
Normal file
134
hotspot/src/share/vm/utilities/resourceHash.hpp
Normal file
@ -0,0 +1,134 @@
|
||||
/*
|
||||
* Copyright (c) 2012, Oracle and/or its affiliates. All rights reserved.
|
||||
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
||||
*
|
||||
* This code is free software; you can redistribute it and/or modify it
|
||||
* under the terms of the GNU General Public License version 2 only, as
|
||||
* published by the Free Software Foundation.
|
||||
*
|
||||
* This code is distributed in the hope that it will be useful, but WITHOUT
|
||||
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
||||
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
||||
* version 2 for more details (a copy is included in the LICENSE file that
|
||||
* accompanied this code).
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License version
|
||||
* 2 along with this work; if not, write to the Free Software Foundation,
|
||||
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
||||
*
|
||||
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
||||
* or visit www.oracle.com if you need additional information or have any
|
||||
* questions.
|
||||
*
|
||||
*/
|
||||
|
||||
#ifndef SHARE_VM_UTILITIES_RESOURCEHASH_HPP
|
||||
#define SHARE_VM_UTILITIES_RESOURCEHASH_HPP
|
||||
|
||||
#include "memory/allocation.hpp"
|
||||
#include "utilities/top.hpp"
|
||||
|
||||
template<typename K> struct ResourceHashtableFns {
|
||||
typedef unsigned (*hash_fn)(K const&);
|
||||
typedef bool (*equals_fn)(K const&, K const&);
|
||||
};
|
||||
|
||||
template<typename K> unsigned primitive_hash(const K& k) {
|
||||
unsigned hash = (unsigned)((uintptr_t)k);
|
||||
return hash ^ (hash > 3); // just in case we're dealing with aligned ptrs
|
||||
}
|
||||
|
||||
template<typename K> bool primitive_equals(const K& k0, const K& k1) {
|
||||
return k0 == k1;
|
||||
}
|
||||
|
||||
template<
|
||||
typename K, typename V,
|
||||
typename ResourceHashtableFns<K>::hash_fn HASH = primitive_hash<K>,
|
||||
typename ResourceHashtableFns<K>::equals_fn EQUALS = primitive_equals<K>,
|
||||
unsigned SIZE = 256
|
||||
>
|
||||
class ResourceHashtable : public ResourceObj {
|
||||
private:
|
||||
|
||||
class Node : public ResourceObj {
|
||||
public:
|
||||
unsigned _hash;
|
||||
K _key;
|
||||
V _value;
|
||||
Node* _next;
|
||||
|
||||
Node(unsigned hash, K const& key, V const& value) :
|
||||
_hash(hash), _key(key), _value(value), _next(NULL) {}
|
||||
};
|
||||
|
||||
Node* _table[SIZE];
|
||||
|
||||
// Returns a pointer to where the node where the value would reside if
|
||||
// it's in the table.
|
||||
Node** lookup_node(unsigned hash, K const& key) {
|
||||
unsigned index = hash % SIZE;
|
||||
Node** ptr = &_table[index];
|
||||
while (*ptr != NULL) {
|
||||
Node* node = *ptr;
|
||||
if (node->_hash == hash && EQUALS(key, node->_key)) {
|
||||
break;
|
||||
}
|
||||
ptr = &(node->_next);
|
||||
}
|
||||
return ptr;
|
||||
}
|
||||
|
||||
Node const** lookup_node(unsigned hash, K const& key) const {
|
||||
return const_cast<Node const**>(
|
||||
const_cast<ResourceHashtable*>(this)->lookup_node(hash, key));
|
||||
}
|
||||
|
||||
public:
|
||||
ResourceHashtable() { memset(_table, 0, SIZE * sizeof(Node*)); }
|
||||
|
||||
bool contains(K const& key) const {
|
||||
return get(key) != NULL;
|
||||
}
|
||||
|
||||
V* get(K const& key) const {
|
||||
unsigned hv = HASH(key);
|
||||
Node const** ptr = lookup_node(hv, key);
|
||||
if (*ptr != NULL) {
|
||||
return const_cast<V*>(&(*ptr)->_value);
|
||||
} else {
|
||||
return NULL;
|
||||
}
|
||||
}
|
||||
|
||||
// Inserts or replaces a value in the table
|
||||
void put(K const& key, V const& value) {
|
||||
unsigned hv = HASH(key);
|
||||
Node** ptr = lookup_node(hv, key);
|
||||
if (*ptr != NULL) {
|
||||
(*ptr)->_value = value;
|
||||
} else {
|
||||
*ptr = new Node(hv, key, value);
|
||||
}
|
||||
}
|
||||
|
||||
// ITER contains bool do_entry(K const&, V const&), which will be
|
||||
// called for each entry in the table. If do_entry() returns false,
|
||||
// the iteration is cancelled.
|
||||
template<class ITER>
|
||||
void iterate(ITER* iter) const {
|
||||
Node* const* bucket = _table;
|
||||
while (bucket < &_table[SIZE]) {
|
||||
Node* node = *bucket;
|
||||
while (node != NULL) {
|
||||
bool cont = iter->do_entry(node->_key, node->_value);
|
||||
if (!cont) { return; }
|
||||
node = node->_next;
|
||||
}
|
||||
++bucket;
|
||||
}
|
||||
}
|
||||
};
|
||||
|
||||
|
||||
#endif // SHARE_VM_UTILITIES_RESOURCEHASH_HPP
|
98
hotspot/test/compiler/8002069/Test8002069.java
Normal file
98
hotspot/test/compiler/8002069/Test8002069.java
Normal file
@ -0,0 +1,98 @@
|
||||
/*
|
||||
* Copyright (c) 2012, Oracle and/or its affiliates. All rights reserved.
|
||||
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
||||
*
|
||||
* This code is free software; you can redistribute it and/or modify it
|
||||
* under the terms of the GNU General Public License version 2 only, as
|
||||
* published by the Free Software Foundation.
|
||||
*
|
||||
* This code is distributed in the hope that it will be useful, but WITHOUT
|
||||
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
||||
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
||||
* version 2 for more details (a copy is included in the LICENSE file that
|
||||
* accompanied this code).
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License version
|
||||
* 2 along with this work; if not, write to the Free Software Foundation,
|
||||
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
||||
*
|
||||
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
||||
* or visit www.oracle.com if you need additional information or have any
|
||||
* questions.
|
||||
*
|
||||
*/
|
||||
|
||||
/**
|
||||
* @test
|
||||
* @bug 8002069
|
||||
* @summary Assert failed in C2: assert(field->edge_count() > 0) failed: sanity
|
||||
*
|
||||
* @run main/othervm -Xmx32m -XX:+IgnoreUnrecognizedVMOptions -Xbatch -XX:CompileCommand=exclude,Test8002069.dummy Test8002069
|
||||
*/
|
||||
|
||||
abstract class O {
|
||||
int f;
|
||||
public O() { f = 5; }
|
||||
abstract void put(int i);
|
||||
public int foo(int i) {
|
||||
put(i);
|
||||
return i;
|
||||
}
|
||||
};
|
||||
|
||||
class A extends O {
|
||||
int[] a;
|
||||
public A(int s) {
|
||||
a = new int[s];
|
||||
}
|
||||
public void put(int i) {
|
||||
a[i%a.length] = i;
|
||||
}
|
||||
}
|
||||
|
||||
class B extends O {
|
||||
int sz;
|
||||
int[] a;
|
||||
public B(int s) {
|
||||
sz = s;
|
||||
a = new int[s];
|
||||
}
|
||||
public void put(int i) {
|
||||
a[i%sz] = i;
|
||||
}
|
||||
}
|
||||
|
||||
public class Test8002069 {
|
||||
public static void main(String args[]) {
|
||||
int sum = 0;
|
||||
for (int i=0; i<8000; i++) {
|
||||
sum += test1(i);
|
||||
}
|
||||
for (int i=0; i<100000; i++) {
|
||||
sum += test2(i);
|
||||
}
|
||||
System.out.println("PASSED. sum = " + sum);
|
||||
}
|
||||
|
||||
private O o;
|
||||
|
||||
private int foo(int i) {
|
||||
return o.foo(i);
|
||||
}
|
||||
static int test1(int i) {
|
||||
Test8002069 t = new Test8002069();
|
||||
t.o = new A(5);
|
||||
return t.foo(i);
|
||||
}
|
||||
static int test2(int i) {
|
||||
Test8002069 t = new Test8002069();
|
||||
t.o = new B(5);
|
||||
dummy(i);
|
||||
return t.foo(i);
|
||||
}
|
||||
|
||||
static int dummy(int i) {
|
||||
return i*2;
|
||||
}
|
||||
}
|
||||
|
@ -185,3 +185,4 @@ af9e8b0f1900b631a8a0fcccff9f1514fe58c808 jdk8-b59
|
||||
6b1db0b41d2f6e2a7b3bdbc8a8db823b47752906 jdk8-b61
|
||||
5d0fa0108d028c05753a47bcf2a598357dabf0c0 jdk8-b62
|
||||
192d8a244bc36427757866e9fb3a08938c0e674c jdk8-b63
|
||||
27ab79568c34abf80958d5fa8c04fd1740d243da jdk8-b64
|
||||
|
@ -185,3 +185,4 @@ ae107401be116f9e384d3a23192f543828e03da5 jdk8-b59
|
||||
97e5e74e2a341d9142ce28043912a3c255e28e03 jdk8-b61
|
||||
d265b9b4c0f55c23a1c9fda02a8052fd9df2eec5 jdk8-b62
|
||||
86989f702267debe16d13720d5ae7ae9839796f4 jdk8-b63
|
||||
5ded18a14bcc80b2a253f2b84da0073a0ecac665 jdk8-b64
|
||||
|
@ -185,3 +185,4 @@ cec8fa02f15634acd7d02d04b0b2d8c044cdbaaa jdk8-b60
|
||||
61ddb3fd000a09ab05bff1940b0ac211661e94cf jdk8-b61
|
||||
50b8b17449d200c66bfd68fb4f3a9197432c9e2b jdk8-b62
|
||||
f117a3e06f78a258074674ad17601f99bcb1ce0d jdk8-b63
|
||||
26dbd73fb7662a29b3e47179fdc88a0bfa4e231e jdk8-b64
|
||||
|
@ -111,21 +111,18 @@ _JUNK_ := $(shell \
|
||||
# since objcopy is optional, we set ZIP_DEBUGINFO_FILES later
|
||||
|
||||
ifeq ($(ENABLE_FULL_DEBUG_SYMBOLS),1)
|
||||
# Default OBJCOPY comes from GNU Binutils on Linux:
|
||||
DEF_OBJCOPY=/usr/bin/objcopy
|
||||
ifdef CROSS_COMPILE_ARCH
|
||||
# don't try to generate .debuginfo files when cross compiling
|
||||
_JUNK_ := $(shell \
|
||||
echo >&2 "INFO: cross compiling for ARCH $(CROSS_COMPILE_ARCH)," \
|
||||
"skipping .debuginfo generation.")
|
||||
OBJCOPY=
|
||||
ifndef CROSS_COMPILE_ARCH
|
||||
# Default OBJCOPY comes from GNU Binutils on Linux:
|
||||
DEF_OBJCOPY=/usr/bin/objcopy
|
||||
else
|
||||
OBJCOPY=$(shell test -x $(DEF_OBJCOPY) && echo $(DEF_OBJCOPY))
|
||||
ifneq ($(ALT_OBJCOPY),)
|
||||
_JUNK_ := $(shell echo >&2 "INFO: ALT_OBJCOPY=$(ALT_OBJCOPY)")
|
||||
# disable .debuginfo support by setting ALT_OBJCOPY to a non-existent path
|
||||
OBJCOPY=$(shell test -x $(ALT_OBJCOPY) && echo $(ALT_OBJCOPY))
|
||||
endif
|
||||
# Assume objcopy is part of the cross-compilation toolkit
|
||||
DEF_OBJCOPY=$(COMPILER_PATH)/objcopy
|
||||
endif
|
||||
OBJCOPY=$(shell test -x $(DEF_OBJCOPY) && echo $(DEF_OBJCOPY))
|
||||
ifneq ($(ALT_OBJCOPY),)
|
||||
_JUNK_ := $(shell echo >&2 "INFO: ALT_OBJCOPY=$(ALT_OBJCOPY)")
|
||||
# disable .debuginfo support by setting ALT_OBJCOPY to a non-existent path
|
||||
OBJCOPY=$(shell test -x $(ALT_OBJCOPY) && echo $(ALT_OBJCOPY))
|
||||
endif
|
||||
|
||||
# Setting ENABLE_FULL_DEBUG_SYMBOLS=1 (and OBJCOPY) above enables the
|
||||
@ -137,7 +134,7 @@ ifeq ($(ENABLE_FULL_DEBUG_SYMBOLS),1)
|
||||
|
||||
ifeq ($(OBJCOPY),)
|
||||
_JUNK_ := $(shell \
|
||||
echo >&2 "INFO: no objcopy cmd found so cannot create .debuginfo files.")
|
||||
echo >&2 "INFO: no objcopy cmd found so cannot create .debuginfo files. You may need to set ALT_OBJCOPY.")
|
||||
ENABLE_FULL_DEBUG_SYMBOLS=0
|
||||
else
|
||||
_JUNK_ := $(shell \
|
||||
|
@ -1,5 +1,5 @@
|
||||
#
|
||||
# Copyright (c) 1995, 2011, Oracle and/or its affiliates. All rights reserved.
|
||||
# Copyright (c) 1995, 2012, Oracle and/or its affiliates. All rights reserved.
|
||||
# DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
||||
#
|
||||
# This code is free software; you can redistribute it and/or modify it
|
||||
@ -88,9 +88,9 @@ ABS_TEMP_DIR = $(ABS_OUTPUTDIR)/tmp
|
||||
dummy := $(shell $(MKDIR) -p $(TEMP_DIR))
|
||||
|
||||
# The language version we want for this jdk build
|
||||
SOURCE_LANGUAGE_VERSION=7
|
||||
SOURCE_LANGUAGE_VERSION=8
|
||||
# The class version we want for this jdk build
|
||||
TARGET_CLASS_VERSION=7
|
||||
TARGET_CLASS_VERSION=8
|
||||
|
||||
# The MESSAGE, WARNING and ERROR files are used to store sanity check and
|
||||
# source check messages, warnings and errors.
|
||||
|
@ -143,12 +143,12 @@ ifeq ($(wildcard $(SHARE_SRC)/classes/javax/crypto/Cipher.java),)
|
||||
endif
|
||||
|
||||
# Add the source level
|
||||
SOURCE_LANGUAGE_VERSION = 7
|
||||
SOURCE_LANGUAGE_VERSION = 8
|
||||
LANGUAGE_VERSION = -source $(SOURCE_LANGUAGE_VERSION)
|
||||
JAVACFLAGS += $(LANGUAGE_VERSION)
|
||||
|
||||
# Add the class version we want
|
||||
TARGET_CLASS_VERSION = 7
|
||||
TARGET_CLASS_VERSION = 8
|
||||
CLASS_VERSION = -target $(TARGET_CLASS_VERSION)
|
||||
JAVACFLAGS += $(CLASS_VERSION)
|
||||
JAVACFLAGS += -encoding ascii
|
||||
|
@ -1,5 +1,5 @@
|
||||
#
|
||||
# Copyright (c) 2008, 2011, Oracle and/or its affiliates. All rights reserved.
|
||||
# Copyright (c) 2008, 2012, Oracle and/or its affiliates. All rights reserved.
|
||||
# DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
||||
#
|
||||
# This code is free software; you can redistribute it and/or modify it
|
||||
@ -36,7 +36,7 @@ FILES_java = \
|
||||
|
||||
# The sources built here use new language syntax to generate
|
||||
# method handle calls. Let's be sure we are using that format.
|
||||
LANGUAGE_VERSION = -source 7
|
||||
CLASS_VERSION = -target 7
|
||||
LANGUAGE_VERSION = -source 8
|
||||
CLASS_VERSION = -target 8
|
||||
|
||||
include $(BUILDDIR)/common/Classes.gmk
|
||||
|
@ -21,4 +21,4 @@
|
||||
# or visit www.oracle.com if you need additional information or have any
|
||||
# questions.
|
||||
#
|
||||
tzdata2012c
|
||||
tzdata2012i
|
||||
|
@ -260,7 +260,7 @@ Rule Egypt 2006 only - Sep 21 23:00s 0 -
|
||||
# I received a mail from an airline which says that the daylight
|
||||
# saving time in Egypt will end in the night of 2007-09-06 to 2007-09-07.
|
||||
# From Jesper Norgaard Welen (2007-08-15): [The following agree:]
|
||||
# http://www.nentjes.info/Bill/bill5.htm
|
||||
# http://www.nentjes.info/Bill/bill5.htm
|
||||
# http://www.timeanddate.com/worldclock/city.html?n=53
|
||||
# From Steffen Thorsen (2007-09-04): The official information...:
|
||||
# http://www.sis.gov.eg/En/EgyptOnline/Miscellaneous/000002/0207000000000000001580.htm
|
||||
@ -314,18 +314,18 @@ Rule Egypt 2007 only - Sep Thu>=1 23:00s 0 -
|
||||
# in September.
|
||||
|
||||
# From Steffen Thorsen (2009-08-11):
|
||||
# We have been able to confirm the August change with the Egyptian Cabinet
|
||||
# We have been able to confirm the August change with the Egyptian Cabinet
|
||||
# Information and Decision Support Center:
|
||||
# <a href="http://www.timeanddate.com/news/time/egypt-dst-ends-2009.html">
|
||||
# http://www.timeanddate.com/news/time/egypt-dst-ends-2009.html
|
||||
# </a>
|
||||
#
|
||||
#
|
||||
# The Middle East News Agency
|
||||
# <a href="http://www.mena.org.eg/index.aspx">
|
||||
# http://www.mena.org.eg/index.aspx
|
||||
# </a>
|
||||
# also reports "Egypt starts winter time on August 21"
|
||||
# today in article numbered "71, 11/08/2009 12:25 GMT."
|
||||
# today in article numbered "71, 11/08/2009 12:25 GMT."
|
||||
# Only the title above is available without a subscription to their service,
|
||||
# and can be found by searching for "winter" in their search engine
|
||||
# (at least today).
|
||||
@ -504,7 +504,7 @@ Zone Africa/Nouakchott -1:03:48 - LMT 1912
|
||||
# From Steffen Thorsen (2008-06-25):
|
||||
# Mauritius plans to observe DST from 2008-11-01 to 2009-03-31 on a trial
|
||||
# basis....
|
||||
# It seems that Mauritius observed daylight saving time from 1982-10-10 to
|
||||
# It seems that Mauritius observed daylight saving time from 1982-10-10 to
|
||||
# 1983-03-20 as well, but that was not successful....
|
||||
# http://www.timeanddate.com/news/time/mauritius-daylight-saving-time.html
|
||||
|
||||
@ -528,12 +528,12 @@ Zone Africa/Nouakchott -1:03:48 - LMT 1912
|
||||
# than previously announced (2008-11-01 to 2009-03-31). The new start
|
||||
# date is 2008-10-26 at 02:00 and the new end date is 2009-03-27 (no time
|
||||
# given, but it is probably at either 2 or 3 wall clock time).
|
||||
#
|
||||
# A little strange though, since the article says that they moved the date
|
||||
# to align itself with Europe and USA which also change time on that date,
|
||||
# but that means they have not paid attention to what happened in
|
||||
# USA/Canada last year (DST ends first Sunday in November). I also wonder
|
||||
# why that they end on a Friday, instead of aligning with Europe which
|
||||
#
|
||||
# A little strange though, since the article says that they moved the date
|
||||
# to align itself with Europe and USA which also change time on that date,
|
||||
# but that means they have not paid attention to what happened in
|
||||
# USA/Canada last year (DST ends first Sunday in November). I also wonder
|
||||
# why that they end on a Friday, instead of aligning with Europe which
|
||||
# changes two days later.
|
||||
|
||||
# From Alex Krivenyshev (2008-07-11):
|
||||
@ -592,7 +592,7 @@ Zone Africa/Nouakchott -1:03:48 - LMT 1912
|
||||
# </a>
|
||||
|
||||
# From Arthur David Olson (2009-07-11):
|
||||
# The "mauritius-dst-will-not-repeat" wrapup includes this:
|
||||
# The "mauritius-dst-will-not-repeat" wrapup includes this:
|
||||
# "The trial ended on March 29, 2009, when the clocks moved back by one hour
|
||||
# at 2am (or 02:00) local time..."
|
||||
|
||||
@ -686,8 +686,8 @@ Zone Indian/Mayotte 3:00:56 - LMT 1911 Jul # Mamoutzou
|
||||
# XXX--guess that it is only Morocco for now; guess only 2008 for now.
|
||||
|
||||
# From Steffen Thorsen (2008-08-27):
|
||||
# Morocco will change the clocks back on the midnight between August 31
|
||||
# and September 1. They originally planned to observe DST to near the end
|
||||
# Morocco will change the clocks back on the midnight between August 31
|
||||
# and September 1. They originally planned to observe DST to near the end
|
||||
# of September:
|
||||
#
|
||||
# One article about it (in French):
|
||||
@ -821,6 +821,23 @@ Zone Indian/Mayotte 3:00:56 - LMT 1911 Jul # Mamoutzou
|
||||
# "...à partir du dernier dimance d'avril et non fins mars,
|
||||
# comme annoncé précédemment."
|
||||
|
||||
# From Milamber Space Network (2012-07-17):
|
||||
# The official return to GMT is announced by the Moroccan government:
|
||||
# <a href="http://www.mmsp.gov.ma/fr/actualites.aspx?id=288">
|
||||
# http://www.mmsp.gov.ma/fr/actualites.aspx?id=288 [in French]
|
||||
# </a>
|
||||
#
|
||||
# Google translation, lightly edited:
|
||||
# Back to the standard time of the Kingdom (GMT)
|
||||
# Pursuant to Decree No. 2-12-126 issued on 26 Jumada (I) 1433 (April 18,
|
||||
# 2012) and in accordance with the order of Mr. President of the
|
||||
# Government No. 3-47-12 issued on 24 Sha'ban (11 July 2012), the Ministry
|
||||
# of Public Service and Administration Modernization announces the return
|
||||
# of the legal time of the Kingdom (GMT) from Friday, July 20, 2012 until
|
||||
# Monday, August 20, 2012. So the time will be delayed by 60 minutes from
|
||||
# 3:00 am Friday, July 20, 2012 and will again be advanced by 60 minutes
|
||||
# August 20, 2012 from 2:00 am.
|
||||
|
||||
# RULE NAME FROM TO TYPE IN ON AT SAVE LETTER/S
|
||||
|
||||
Rule Morocco 1939 only - Sep 12 0:00 1:00 S
|
||||
@ -848,6 +865,8 @@ Rule Morocco 2011 only - Apr 3 0:00 1:00 S
|
||||
Rule Morocco 2011 only - Jul 31 0 0 -
|
||||
Rule Morocco 2012 max - Apr lastSun 2:00 1:00 S
|
||||
Rule Morocco 2012 max - Sep lastSun 3:00 0 -
|
||||
Rule Morocco 2012 only - Jul 20 3:00 0 -
|
||||
Rule Morocco 2012 only - Aug 20 2:00 1:00 S
|
||||
|
||||
# Zone NAME GMTOFF RULES FORMAT [UNTIL]
|
||||
Zone Africa/Casablanca -0:30:20 - LMT 1913 Oct 26
|
||||
@ -876,7 +895,7 @@ Zone Africa/Maputo 2:10:20 - LMT 1903 Mar
|
||||
# Forecasting Riaan van Zyl explained that the far eastern parts of
|
||||
# the country are close to 40 minutes earlier in sunrise than the rest
|
||||
# of the country.
|
||||
#
|
||||
#
|
||||
# From Paul Eggert (2007-03-31):
|
||||
# Apparently the Caprivi Strip informally observes Botswana time, but
|
||||
# we have no details. In the meantime people there can use Africa/Gaborone.
|
||||
|
@ -124,7 +124,7 @@ Zone Asia/Kabul 4:36:48 - LMT 1890
|
||||
# From Alexander Krivenyshev (2012-02-10):
|
||||
# According to News Armenia, on Feb 9, 2012,
|
||||
# http://newsarmenia.ru/society/20120209/42609695.html
|
||||
#
|
||||
#
|
||||
# The Armenia National Assembly adopted final reading of Amendments to the
|
||||
# Law "On procedure of calculation time on the territory of the Republic of
|
||||
# Armenia" according to which Armenia [is] abolishing Daylight Saving Time.
|
||||
@ -204,15 +204,15 @@ Zone Asia/Bahrain 3:22:20 - LMT 1920 # Al Manamah
|
||||
# </a>
|
||||
|
||||
# From A. N. M. Kamrus Saadat (2009-06-15):
|
||||
# Finally we've got the official mail regarding DST start time where DST start
|
||||
# time is mentioned as Jun 19 2009, 23:00 from BTRC (Bangladesh
|
||||
# Telecommunication Regulatory Commission).
|
||||
# Finally we've got the official mail regarding DST start time where DST start
|
||||
# time is mentioned as Jun 19 2009, 23:00 from BTRC (Bangladesh
|
||||
# Telecommunication Regulatory Commission).
|
||||
#
|
||||
# No DST end date has been announced yet.
|
||||
|
||||
# From Alexander Krivenyshev (2009-09-25):
|
||||
# Bangladesh won't go back to Standard Time from October 1, 2009,
|
||||
# instead it will continue DST measure till the cabinet makes a fresh decision.
|
||||
# Bangladesh won't go back to Standard Time from October 1, 2009,
|
||||
# instead it will continue DST measure till the cabinet makes a fresh decision.
|
||||
#
|
||||
# Following report by same newspaper-"The Daily Star Friday":
|
||||
# "DST change awaits cabinet decision-Clock won't go back by 1-hr from Oct 1"
|
||||
@ -226,8 +226,8 @@ Zone Asia/Bahrain 3:22:20 - LMT 1920 # Al Manamah
|
||||
|
||||
# From Steffen Thorsen (2009-10-13):
|
||||
# IANS (Indo-Asian News Service) now reports:
|
||||
# Bangladesh has decided that the clock advanced by an hour to make
|
||||
# maximum use of daylight hours as an energy saving measure would
|
||||
# Bangladesh has decided that the clock advanced by an hour to make
|
||||
# maximum use of daylight hours as an energy saving measure would
|
||||
# "continue for an indefinite period."
|
||||
#
|
||||
# One of many places where it is published:
|
||||
@ -255,7 +255,7 @@ Zone Asia/Bahrain 3:22:20 - LMT 1920 # Al Manamah
|
||||
|
||||
# From Alexander Krivenyshev (2010-03-22):
|
||||
# According to Bangladesh newspaper "The Daily Star,"
|
||||
# Cabinet cancels Daylight Saving Time
|
||||
# Cabinet cancels Daylight Saving Time
|
||||
# <a href="http://www.thedailystar.net/newDesign/latest_news.php?nid=22817">
|
||||
# http://www.thedailystar.net/newDesign/latest_news.php?nid=22817
|
||||
# </a>
|
||||
@ -383,11 +383,11 @@ Rule PRC 1987 1991 - Apr Sun>=10 0:00 1:00 D
|
||||
# observing daylight saving time in 1986.
|
||||
#
|
||||
# From Thomas S. Mullaney (2008-02-11):
|
||||
# I think you're combining two subjects that need to treated
|
||||
# separately: daylight savings (which, you're correct, wasn't
|
||||
# implemented until the 1980s) and the unified time zone centered near
|
||||
# Beijing (which was implemented in 1949). Briefly, there was also a
|
||||
# "Lhasa Time" in Tibet and "Urumqi Time" in Xinjiang. The first was
|
||||
# I think you're combining two subjects that need to treated
|
||||
# separately: daylight savings (which, you're correct, wasn't
|
||||
# implemented until the 1980s) and the unified time zone centered near
|
||||
# Beijing (which was implemented in 1949). Briefly, there was also a
|
||||
# "Lhasa Time" in Tibet and "Urumqi Time" in Xinjiang. The first was
|
||||
# ceased, and the second eventually recognized (again, in the 1980s).
|
||||
#
|
||||
# From Paul Eggert (2008-06-30):
|
||||
@ -524,7 +524,7 @@ Zone Asia/Kashgar 5:03:56 - LMT 1928 # or Kashi or Kaxgar
|
||||
# as of 2009-10-28:
|
||||
# Year Period
|
||||
# 1941 1 Apr to 30 Sep
|
||||
# 1942 Whole year
|
||||
# 1942 Whole year
|
||||
# 1943 Whole year
|
||||
# 1944 Whole year
|
||||
# 1945 Whole year
|
||||
@ -615,16 +615,16 @@ Zone Asia/Hong_Kong 7:36:36 - LMT 1904 Oct 30
|
||||
# From Arthur David Olson (2010-04-07):
|
||||
# Here's Google's translation of the table at the bottom of the "summert.htm" page:
|
||||
# Decade Name Start and end date
|
||||
# Republic of China 34 years to 40 years (AD 1945-1951 years) Summer Time May 1 to September 30
|
||||
# 41 years of the Republic of China (AD 1952) Daylight Saving Time March 1 to October 31
|
||||
# Republic of China 42 years to 43 years (AD 1953-1954 years) Daylight Saving Time April 1 to October 31
|
||||
# In the 44 years to 45 years (AD 1955-1956 years) Daylight Saving Time April 1 to September 30
|
||||
# Republic of China 46 years to 48 years (AD 1957-1959) Summer Time April 1 to September 30
|
||||
# Republic of China 49 years to 50 years (AD 1960-1961) Summer Time June 1 to September 30
|
||||
# Republic of China 51 years to 62 years (AD 1962-1973 years) Stop Summer Time
|
||||
# Republic of China 63 years to 64 years (1974-1975 AD) Daylight Saving Time April 1 to September 30
|
||||
# Republic of China 65 years to 67 years (1976-1978 AD) Stop Daylight Saving Time
|
||||
# Republic of China 68 years (AD 1979) Daylight Saving Time July 1 to September 30
|
||||
# Republic of China 34 years to 40 years (AD 1945-1951 years) Summer Time May 1 to September 30
|
||||
# 41 years of the Republic of China (AD 1952) Daylight Saving Time March 1 to October 31
|
||||
# Republic of China 42 years to 43 years (AD 1953-1954 years) Daylight Saving Time April 1 to October 31
|
||||
# In the 44 years to 45 years (AD 1955-1956 years) Daylight Saving Time April 1 to September 30
|
||||
# Republic of China 46 years to 48 years (AD 1957-1959) Summer Time April 1 to September 30
|
||||
# Republic of China 49 years to 50 years (AD 1960-1961) Summer Time June 1 to September 30
|
||||
# Republic of China 51 years to 62 years (AD 1962-1973 years) Stop Summer Time
|
||||
# Republic of China 63 years to 64 years (1974-1975 AD) Daylight Saving Time April 1 to September 30
|
||||
# Republic of China 65 years to 67 years (1976-1978 AD) Stop Daylight Saving Time
|
||||
# Republic of China 68 years (AD 1979) Daylight Saving Time July 1 to September 30
|
||||
# Republic of China since 69 years (AD 1980) Stop Daylight Saving Time
|
||||
|
||||
# Rule NAME FROM TO TYPE IN ON AT SAVE LETTER/S
|
||||
@ -1193,15 +1193,15 @@ Rule Zion 2004 only - Sep 22 1:00 0 S
|
||||
#
|
||||
# ftp://ftp.cs.huji.ac.il/pub/tz/announcements/2005+beyond.ps
|
||||
|
||||
# From Paul Eggert (2005-02-22):
|
||||
# From Paul Eggert (2012-10-26):
|
||||
# I used Ephraim Silverberg's dst-israel.el program
|
||||
# <ftp://ftp.cs.huji.ac.il/pub/tz/software/dst-israel.el> (2005-02-20)
|
||||
# along with Ed Reingold's cal-hebrew in GNU Emacs 21.4,
|
||||
# to generate the transitions in this list.
|
||||
# to generate the transitions from 2005 through 2012.
|
||||
# (I replaced "lastFri" with "Fri>=26" by hand.)
|
||||
# The spring transitions below all correspond to the following Rule:
|
||||
# The spring transitions all correspond to the following Rule:
|
||||
#
|
||||
# Rule Zion 2005 max - Mar Fri>=26 2:00 1:00 D
|
||||
# Rule Zion 2005 2012 - Mar Fri>=26 2:00 1:00 D
|
||||
#
|
||||
# but older zic implementations (e.g., Solaris 8) do not support
|
||||
# "Fri>=26" to mean April 1 in years like 2005, so for now we list the
|
||||
@ -1218,39 +1218,36 @@ Rule Zion 2009 only - Sep 27 2:00 0 S
|
||||
Rule Zion 2010 only - Sep 12 2:00 0 S
|
||||
Rule Zion 2011 only - Apr 1 2:00 1:00 D
|
||||
Rule Zion 2011 only - Oct 2 2:00 0 S
|
||||
Rule Zion 2012 2015 - Mar Fri>=26 2:00 1:00 D
|
||||
Rule Zion 2012 only - Mar Fri>=26 2:00 1:00 D
|
||||
Rule Zion 2012 only - Sep 23 2:00 0 S
|
||||
Rule Zion 2013 only - Sep 8 2:00 0 S
|
||||
Rule Zion 2014 only - Sep 28 2:00 0 S
|
||||
Rule Zion 2015 only - Sep 20 2:00 0 S
|
||||
Rule Zion 2016 only - Apr 1 2:00 1:00 D
|
||||
Rule Zion 2016 only - Oct 9 2:00 0 S
|
||||
Rule Zion 2017 2021 - Mar Fri>=26 2:00 1:00 D
|
||||
Rule Zion 2017 only - Sep 24 2:00 0 S
|
||||
Rule Zion 2018 only - Sep 16 2:00 0 S
|
||||
Rule Zion 2019 only - Oct 6 2:00 0 S
|
||||
Rule Zion 2020 only - Sep 27 2:00 0 S
|
||||
Rule Zion 2021 only - Sep 12 2:00 0 S
|
||||
Rule Zion 2022 only - Apr 1 2:00 1:00 D
|
||||
Rule Zion 2022 only - Oct 2 2:00 0 S
|
||||
Rule Zion 2023 2032 - Mar Fri>=26 2:00 1:00 D
|
||||
Rule Zion 2023 only - Sep 24 2:00 0 S
|
||||
Rule Zion 2024 only - Oct 6 2:00 0 S
|
||||
Rule Zion 2025 only - Sep 28 2:00 0 S
|
||||
Rule Zion 2026 only - Sep 20 2:00 0 S
|
||||
Rule Zion 2027 only - Oct 10 2:00 0 S
|
||||
Rule Zion 2028 only - Sep 24 2:00 0 S
|
||||
Rule Zion 2029 only - Sep 16 2:00 0 S
|
||||
Rule Zion 2030 only - Oct 6 2:00 0 S
|
||||
Rule Zion 2031 only - Sep 21 2:00 0 S
|
||||
Rule Zion 2032 only - Sep 12 2:00 0 S
|
||||
Rule Zion 2033 only - Apr 1 2:00 1:00 D
|
||||
Rule Zion 2033 only - Oct 2 2:00 0 S
|
||||
Rule Zion 2034 2037 - Mar Fri>=26 2:00 1:00 D
|
||||
Rule Zion 2034 only - Sep 17 2:00 0 S
|
||||
Rule Zion 2035 only - Oct 7 2:00 0 S
|
||||
Rule Zion 2036 only - Sep 28 2:00 0 S
|
||||
Rule Zion 2037 only - Sep 13 2:00 0 S
|
||||
|
||||
# From Ephraim Silverberg (2012-10-18):
|
||||
|
||||
# Yesterday, the Interior Ministry Committee, after more than a year
|
||||
# past, approved sending the proposed June 2011 changes to the Time
|
||||
# Decree Law back to the Knesset for second and third (final) votes
|
||||
# before the upcoming elections on Jan. 22, 2013. Hence, although the
|
||||
# changes are not yet law, they are expected to be so before February 2013.
|
||||
#
|
||||
# As of 2013, DST starts at 02:00 on the Friday before the last Sunday in March.
|
||||
# DST ends at 02:00 on the first Sunday after October 1, unless it occurs on the
|
||||
# second day of the Jewish Rosh Hashana holiday, in which case DST ends a day
|
||||
# later (i.e. at 02:00 the first Monday after October 2).
|
||||
# [Rosh Hashana holidays are factored in until 2100.]
|
||||
|
||||
# Rule NAME FROM TO TYPE IN ON AT SAVE LETTER/S
|
||||
Rule Zion 2013 max - Mar Fri>=23 2:00 1:00 D
|
||||
Rule Zion 2013 2026 - Oct Sun>=2 2:00 0 S
|
||||
Rule Zion 2027 only - Oct Mon>=3 2:00 0 S
|
||||
Rule Zion 2028 max - Oct Sun>=2 2:00 0 S
|
||||
# The following rules are commented out for now, as they break older
|
||||
# versions of zic that support only signed 32-bit timestamps, i.e.,
|
||||
# through 2038-01-19 03:14:07 UTC.
|
||||
#Rule Zion 2028 2053 - Oct Sun>=2 2:00 0 S
|
||||
#Rule Zion 2054 only - Oct Mon>=3 2:00 0 S
|
||||
#Rule Zion 2055 2080 - Oct Sun>=2 2:00 0 S
|
||||
#Rule Zion 2081 only - Oct Mon>=3 2:00 0 S
|
||||
#Rule Zion 2082 max - Oct Sun>=2 2:00 0 S
|
||||
|
||||
# Zone NAME GMTOFF RULES FORMAT [UNTIL]
|
||||
Zone Asia/Jerusalem 2:20:56 - LMT 1880
|
||||
@ -1385,6 +1382,16 @@ Zone Asia/Tokyo 9:18:59 - LMT 1887 Dec 31 15:00u
|
||||
# From Arthur David Olson (2009-04-06):
|
||||
# We still have Jordan switching to DST on Thursdays in 2000 and 2001.
|
||||
|
||||
# From Steffen Thorsen (2012-10-25):
|
||||
# Yesterday the government in Jordan announced that they will not
|
||||
# switch back to standard time this winter, so the will stay on DST
|
||||
# until about the same time next year (at least).
|
||||
# http://www.petra.gov.jo/Public_News/Nws_NewsDetails.aspx?NewsID=88950
|
||||
#
|
||||
# From Paul Eggert (2012-10-25):
|
||||
# For now, assume this is just a one-year measure. If it becomes
|
||||
# permanent, we should move Jordan from EET to AST effective tomorrow.
|
||||
|
||||
# Rule NAME FROM TO TYPE IN ON AT SAVE LETTER/S
|
||||
Rule Jordan 1973 only - Jun 6 0:00 1:00 S
|
||||
Rule Jordan 1973 1975 - Oct 1 0:00 0 -
|
||||
@ -1413,7 +1420,8 @@ Rule Jordan 2002 max - Mar lastThu 24:00 1:00 S
|
||||
Rule Jordan 2003 only - Oct 24 0:00s 0 -
|
||||
Rule Jordan 2004 only - Oct 15 0:00s 0 -
|
||||
Rule Jordan 2005 only - Sep lastFri 0:00s 0 -
|
||||
Rule Jordan 2006 max - Oct lastFri 0:00s 0 -
|
||||
Rule Jordan 2006 2011 - Oct lastFri 0:00s 0 -
|
||||
Rule Jordan 2013 max - Oct lastFri 0:00s 0 -
|
||||
# Zone NAME GMTOFF RULES FORMAT [UNTIL]
|
||||
Zone Asia/Amman 2:23:44 - LMT 1931
|
||||
2:00 Jordan EE%sT
|
||||
@ -1858,15 +1866,15 @@ Zone Asia/Muscat 3:54:20 - LMT 1920
|
||||
# shown 8 per cent higher consumption of electricity.
|
||||
|
||||
# From Alex Krivenyshev (2008-05-15):
|
||||
#
|
||||
# Here is an article that Pakistan plan to introduce Daylight Saving Time
|
||||
#
|
||||
# Here is an article that Pakistan plan to introduce Daylight Saving Time
|
||||
# on June 1, 2008 for 3 months.
|
||||
#
|
||||
# "... The federal cabinet on Wednesday announced a new conservation plan to help
|
||||
# reduce load shedding by approving the closure of commercial centres at 9pm and
|
||||
# moving clocks forward by one hour for the next three months.
|
||||
#
|
||||
# "... The federal cabinet on Wednesday announced a new conservation plan to help
|
||||
# reduce load shedding by approving the closure of commercial centres at 9pm and
|
||||
# moving clocks forward by one hour for the next three months.
|
||||
# ...."
|
||||
#
|
||||
#
|
||||
# <a href="http://www.worldtimezone.net/dst_news/dst_news_pakistan01.html">
|
||||
# http://www.worldtimezone.net/dst_news/dst_news_pakistan01.html
|
||||
# </a>
|
||||
@ -1926,7 +1934,7 @@ Zone Asia/Muscat 3:54:20 - LMT 1920
|
||||
# Government has decided to restore the previous time by moving the
|
||||
# clocks backward by one hour from October 1. A formal announcement to
|
||||
# this effect will be made after the Prime Minister grants approval in
|
||||
# this regard."
|
||||
# this regard."
|
||||
# <a href="http://www.thenews.com.pk/updates.asp?id=87168">
|
||||
# http://www.thenews.com.pk/updates.asp?id=87168
|
||||
# </a>
|
||||
@ -2222,7 +2230,7 @@ Zone Asia/Karachi 4:28:12 - LMT 1907
|
||||
# <a href="http://www.maannews.net/eng/ViewDetails.aspx?ID=306795">
|
||||
# http://www.maannews.net/eng/ViewDetails.aspx?ID=306795
|
||||
# </a>
|
||||
# the clocks were set back one hour at 2010-08-11 00:00:00 local time in
|
||||
# the clocks were set back one hour at 2010-08-11 00:00:00 local time in
|
||||
# Gaza and the West Bank.
|
||||
# Some more background info:
|
||||
# <a href="http://www.timeanddate.com/news/time/westbank-gaza-end-dst-2010.html">
|
||||
@ -2261,7 +2269,7 @@ Zone Asia/Karachi 4:28:12 - LMT 1907
|
||||
# The rules for Egypt are stolen from the `africa' file.
|
||||
|
||||
# From Steffen Thorsen (2011-09-30):
|
||||
# West Bank did end Daylight Saving Time this morning/midnight (2011-09-30
|
||||
# West Bank did end Daylight Saving Time this morning/midnight (2011-09-30
|
||||
# 00:00).
|
||||
# So West Bank and Gaza now have the same time again.
|
||||
#
|
||||
@ -2316,6 +2324,8 @@ Rule Palestine 2010 only - Aug 11 0:00 0 -
|
||||
|
||||
# From Arthur David Olson (2011-09-20):
|
||||
# 2011 transitions per http://www.timeanddate.com as of 2011-09-20.
|
||||
# From Paul Eggert (2012-10-12):
|
||||
# 2012 transitions per http://www.timeanddate.com as of 2012-10-12.
|
||||
|
||||
# Zone NAME GMTOFF RULES FORMAT [UNTIL]
|
||||
Zone Asia/Gaza 2:17:52 - LMT 1900 Oct
|
||||
@ -2326,7 +2336,7 @@ Zone Asia/Gaza 2:17:52 - LMT 1900 Oct
|
||||
2:00 Palestine EE%sT 2011 Apr 2 12:01
|
||||
2:00 1:00 EEST 2011 Aug 1
|
||||
2:00 - EET 2012 Mar 30
|
||||
2:00 1:00 EEST 2012 Sep 28
|
||||
2:00 1:00 EEST 2012 Sep 21 1:00
|
||||
2:00 - EET
|
||||
|
||||
Zone Asia/Hebron 2:20:23 - LMT 1900 Oct
|
||||
@ -2341,7 +2351,7 @@ Zone Asia/Hebron 2:20:23 - LMT 1900 Oct
|
||||
2:00 - EET 2011 Aug 30
|
||||
2:00 1:00 EEST 2011 Sep 30 3:00
|
||||
2:00 - EET 2012 Mar 30
|
||||
2:00 1:00 EEST 2012 Sep 28 3:00
|
||||
2:00 1:00 EEST 2012 Sep 21 1:00
|
||||
2:00 - EET
|
||||
|
||||
# Paracel Is
|
||||
@ -2535,19 +2545,19 @@ Rule Syria 2007 only - Mar lastFri 0:00 1:00 S
|
||||
# having it between Wednesday and Thursday (two workdays in Syria) since the
|
||||
# weekend in Syria is not Saturday and Sunday, but Friday and Saturday. So now
|
||||
# it is implemented at midnight of the last workday before weekend...
|
||||
#
|
||||
#
|
||||
# From Steffen Thorsen (2007-10-27):
|
||||
# Jesper Norgaard Welen wrote:
|
||||
#
|
||||
#
|
||||
# > "Winter local time in Syria will be observed at midnight of Thursday 1
|
||||
# > November 2007, and the clock will be put back 1 hour."
|
||||
#
|
||||
#
|
||||
# I found confirmation on this in this gov.sy-article (Arabic):
|
||||
# http://wehda.alwehda.gov.sy/_print_veiw.asp?FileName=12521710520070926111247
|
||||
#
|
||||
#
|
||||
# which using Google's translate tools says:
|
||||
# Council of Ministers also approved the commencement of work on
|
||||
# identifying the winter time as of Friday, 2/11/2007 where the 60th
|
||||
# Council of Ministers also approved the commencement of work on
|
||||
# identifying the winter time as of Friday, 2/11/2007 where the 60th
|
||||
# minute delay at midnight Thursday 1/11/2007.
|
||||
Rule Syria 2007 only - Nov Fri>=1 0:00 0 -
|
||||
|
||||
@ -2613,8 +2623,8 @@ Rule Syria 2007 only - Nov Fri>=1 0:00 0 -
|
||||
# </a>
|
||||
|
||||
# From Steffen Thorsen (2009-10-27):
|
||||
# The Syrian Arab News Network on 2009-09-29 reported that Syria will
|
||||
# revert back to winter (standard) time on midnight between Thursday
|
||||
# The Syrian Arab News Network on 2009-09-29 reported that Syria will
|
||||
# revert back to winter (standard) time on midnight between Thursday
|
||||
# 2009-10-29 and Friday 2009-10-30:
|
||||
# <a href="http://www.sana.sy/ara/2/2009/09/29/247012.htm">
|
||||
# http://www.sana.sy/ara/2/2009/09/29/247012.htm (Arabic)
|
||||
|
@ -306,9 +306,9 @@ Zone Indian/Cocos 6:27:40 - LMT 1900
|
||||
# </a>
|
||||
|
||||
# From Alexander Krivenyshev (2010-10-24):
|
||||
# According to Radio Fiji and Fiji Times online, Fiji will end DST 3
|
||||
# According to Radio Fiji and Fiji Times online, Fiji will end DST 3
|
||||
# weeks earlier than expected - on March 6, 2011, not March 27, 2011...
|
||||
# Here is confirmation from Government of the Republic of the Fiji Islands,
|
||||
# Here is confirmation from Government of the Republic of the Fiji Islands,
|
||||
# Ministry of Information (fiji.gov.fj) web site:
|
||||
# <a href="http://www.fiji.gov.fj/index.php?option=com_content&view=article&id=2608:daylight-savings&catid=71:press-releases&Itemid=155">
|
||||
# http://www.fiji.gov.fj/index.php?option=com_content&view=article&id=2608:daylight-savings&catid=71:press-releases&Itemid=155
|
||||
@ -319,15 +319,15 @@ Zone Indian/Cocos 6:27:40 - LMT 1900
|
||||
# </a>
|
||||
|
||||
# From Steffen Thorsen (2011-10-03):
|
||||
# Now the dates have been confirmed, and at least our start date
|
||||
# Now the dates have been confirmed, and at least our start date
|
||||
# assumption was correct (end date was one week wrong).
|
||||
#
|
||||
# <a href="http://www.fiji.gov.fj/index.php?option=com_content&view=article&id=4966:daylight-saving-starts-in-fiji&catid=71:press-releases&Itemid=155">
|
||||
# www.fiji.gov.fj/index.php?option=com_content&view=article&id=4966:daylight-saving-starts-in-fiji&catid=71:press-releases&Itemid=155
|
||||
# </a>
|
||||
# which says
|
||||
# Members of the public are reminded to change their time to one hour in
|
||||
# advance at 2am to 3am on October 23, 2011 and one hour back at 3am to
|
||||
# Members of the public are reminded to change their time to one hour in
|
||||
# advance at 2am to 3am on October 23, 2011 and one hour back at 3am to
|
||||
# 2am on February 26 next year.
|
||||
|
||||
# From Ken Rylander (2011-10-24)
|
||||
@ -344,15 +344,23 @@ Zone Indian/Cocos 6:27:40 - LMT 1900
|
||||
# The commencement of daylight saving will remain unchanged and start
|
||||
# on the 23rd of October, 2011.
|
||||
|
||||
# From the Fiji Government Online Portal (2012-08-21) via Steffen Thorsen:
|
||||
# The Minister for Labour, Industrial Relations and Employment Mr Jone Usamate
|
||||
# today confirmed that Fiji will start daylight savings at 2 am on Sunday 21st
|
||||
# October 2012 and end at 3 am on Sunday 20th January 2013.
|
||||
# http://www.fiji.gov.fj/index.php?option=com_content&view=article&id=6702&catid=71&Itemid=155
|
||||
#
|
||||
# From Paul Eggert (2012-08-31):
|
||||
# For now, guess a pattern of the penultimate Sundays in October and January.
|
||||
|
||||
# Rule NAME FROM TO TYPE IN ON AT SAVE LETTER/S
|
||||
Rule Fiji 1998 1999 - Nov Sun>=1 2:00 1:00 S
|
||||
Rule Fiji 1999 2000 - Feb lastSun 3:00 0 -
|
||||
Rule Fiji 2009 only - Nov 29 2:00 1:00 S
|
||||
Rule Fiji 2010 only - Mar lastSun 3:00 0 -
|
||||
Rule Fiji 2010 only - Oct 24 2:00 1:00 S
|
||||
Rule Fiji 2010 max - Oct Sun>=18 2:00 1:00 S
|
||||
Rule Fiji 2011 only - Mar Sun>=1 3:00 0 -
|
||||
Rule Fiji 2011 only - Oct 23 2:00 1:00 S
|
||||
Rule Fiji 2012 only - Jan 22 3:00 0 -
|
||||
Rule Fiji 2012 max - Jan Sun>=18 3:00 0 -
|
||||
# Zone NAME GMTOFF RULES FORMAT [UNTIL]
|
||||
Zone Pacific/Fiji 11:53:40 - LMT 1915 Oct 26 # Suva
|
||||
12:00 Fiji FJ%sT # Fiji Time
|
||||
@ -581,7 +589,7 @@ Zone Pacific/Pago_Pago 12:37:12 - LMT 1879 Jul 5
|
||||
|
||||
# From David Zuelke (2011-05-09):
|
||||
# Subject: Samoa to move timezone from east to west of international date line
|
||||
#
|
||||
#
|
||||
# <a href="http://www.morningstar.co.uk/uk/markets/newsfeeditem.aspx?id=138501958347963">
|
||||
# http://www.morningstar.co.uk/uk/markets/newsfeeditem.aspx?id=138501958347963
|
||||
# </a>
|
||||
@ -643,6 +651,23 @@ Zone Pacific/Pago_Pago 12:37:12 - LMT 1879 Jul 5
|
||||
# Although Samoa has used Daylight Saving Time in the 2010-2011 and 2011-2012
|
||||
# seasons, there is not yet any indication that this trend will continue on
|
||||
# a regular basis. For now, we have explicitly listed the transitions below.
|
||||
#
|
||||
# From Nicky (2012-09-10):
|
||||
# Daylight Saving Time commences on Sunday 30th September 2012 and
|
||||
# ends on Sunday 7th of April 2013.
|
||||
#
|
||||
# Please find link below for more information.
|
||||
# http://www.mcil.gov.ws/mcil_publications.html
|
||||
#
|
||||
# That publication also includes dates for Summer of 2013/4 as well
|
||||
# which give the impression of a pattern in selecting dates for the
|
||||
# future, so for now, we will guess this will continue.
|
||||
|
||||
# Western Samoa
|
||||
# Rule NAME FROM TO TYPE IN ON AT SAVE LETTER/S
|
||||
Rule WS 2012 max - Sep lastSun 3:00 1 D
|
||||
Rule WS 2012 max - Apr Sun>=1 4:00 0 -
|
||||
# Zone NAME GMTOFF RULES FORMAT [UNTIL]
|
||||
Zone Pacific/Apia 12:33:04 - LMT 1879 Jul 5
|
||||
-11:26:56 - LMT 1911
|
||||
-11:30 - SAMT 1950 # Samoa Time
|
||||
@ -650,8 +675,8 @@ Zone Pacific/Apia 12:33:04 - LMT 1879 Jul 5
|
||||
-11:00 1:00 WSDT 2011 Apr 2 4:00
|
||||
-11:00 - WST 2011 Sep 24 3:00
|
||||
-11:00 1:00 WSDT 2011 Dec 30
|
||||
13:00 1:00 WSDT 2012 Apr 1 4:00
|
||||
13:00 - WST
|
||||
13:00 1:00 WSDT 2012 Apr Sun>=1 4:00
|
||||
13:00 WS WS%sT
|
||||
|
||||
# Solomon Is
|
||||
# excludes Bougainville, for which see Papua New Guinea
|
||||
@ -663,25 +688,25 @@ Zone Pacific/Guadalcanal 10:39:48 - LMT 1912 Oct # Honiara
|
||||
#
|
||||
# From Gwillim Law (2011-12-29)
|
||||
# A correspondent informed me that Tokelau, like Samoa, will be skipping
|
||||
# December 31 this year, thereby changing its time zone from UTC-10 to
|
||||
# UTC+14. When I tried to verify this statement, I found a confirming
|
||||
# article in Time magazine online
|
||||
# <a href="http://www.time.com/time/world/article/0,8599,2103243,00.html">
|
||||
# (http://www.time.com/time/world/article/0,8599,2103243,00.html).
|
||||
# </a>
|
||||
# December 31 this year ...
|
||||
#
|
||||
# From Jonathan Leffler (2011-12-29)
|
||||
# Information from the BBC to the same effect:
|
||||
# <a href="http://www.bbc.co.uk/news/world-asia-16351377">
|
||||
# http://www.bbc.co.uk/news/world-asia-16351377
|
||||
# </a>
|
||||
# From Steffen Thorsen (2012-07-25)
|
||||
# ... we double checked by calling hotels and offices based in Tokelau asking
|
||||
# about the time there, and they all told a time that agrees with UTC+13....
|
||||
# Shanks says UTC-10 from 1901 [but] ... there is a good chance the change
|
||||
# actually was to UTC-11 back then.
|
||||
#
|
||||
# Patch supplied by Tim Parenti (2011-12-29)
|
||||
# From Paul Eggert (2012-07-25)
|
||||
# A Google Books snippet of Appendix to the Journals of the House of
|
||||
# Representatives of New Zealand, Session 1948,
|
||||
# <http://books.google.com/books?id=ZaVCAQAAIAAJ>, page 65, says Tokelau
|
||||
# was "11 hours slow on G.M.T." Go with Thorsen and assume Shanks & Pottenger
|
||||
# are off by an hour starting in 1901.
|
||||
|
||||
# Zone NAME GMTOFF RULES FORMAT [UNTIL]
|
||||
Zone Pacific/Fakaofo -11:24:56 - LMT 1901
|
||||
-10:00 - TKT 2011 Dec 30 # Tokelau Time
|
||||
14:00 - TKT
|
||||
-11:00 - TKT 2011 Dec 30 # Tokelau Time
|
||||
13:00 - TKT
|
||||
|
||||
# Tonga
|
||||
# Rule NAME FROM TO TYPE IN ON AT SAVE LETTER/S
|
||||
@ -1362,22 +1387,22 @@ Zone Pacific/Wallis 12:15:20 - LMT 1901
|
||||
# See "southeast Australia" above for 2008 and later.
|
||||
|
||||
# From Steffen Thorsen (2009-04-28):
|
||||
# According to the official press release, South Australia's extended daylight
|
||||
# saving period will continue with the same rules as used during the 2008-2009
|
||||
# According to the official press release, South Australia's extended daylight
|
||||
# saving period will continue with the same rules as used during the 2008-2009
|
||||
# summer (southern hemisphere).
|
||||
#
|
||||
#
|
||||
# From
|
||||
# <a href="http://www.safework.sa.gov.au/uploaded_files/DaylightDatesSet.pdf">
|
||||
# http://www.safework.sa.gov.au/uploaded_files/DaylightDatesSet.pdf
|
||||
# </a>
|
||||
# The extended daylight saving period that South Australia has been trialling
|
||||
# The extended daylight saving period that South Australia has been trialling
|
||||
# for over the last year is now set to be ongoing.
|
||||
# Daylight saving will continue to start on the first Sunday in October each
|
||||
# Daylight saving will continue to start on the first Sunday in October each
|
||||
# year and finish on the first Sunday in April the following year.
|
||||
# Industrial Relations Minister, Paul Caica, says this provides South Australia
|
||||
# with a consistent half hour time difference with NSW, Victoria, Tasmania and
|
||||
# Industrial Relations Minister, Paul Caica, says this provides South Australia
|
||||
# with a consistent half hour time difference with NSW, Victoria, Tasmania and
|
||||
# the ACT for all 52 weeks of the year...
|
||||
#
|
||||
#
|
||||
# We have a wrap-up here:
|
||||
# <a href="http://www.timeanddate.com/news/time/south-australia-extends-dst.html">
|
||||
# http://www.timeanddate.com/news/time/south-australia-extends-dst.html
|
||||
|
@ -597,12 +597,12 @@ Rule Russia 1996 2010 - Oct lastSun 2:00s 0 -
|
||||
# According to Kremlin press service, Russian President Dmitry Medvedev
|
||||
# signed a federal law "On calculation of time" on June 9, 2011.
|
||||
# According to the law Russia is abolishing daylight saving time.
|
||||
#
|
||||
# Medvedev signed a law "On the Calculation of Time" (in russian):
|
||||
#
|
||||
# Medvedev signed a law "On the Calculation of Time" (in russian):
|
||||
# <a href="http://bmockbe.ru/events/?ID=7583">
|
||||
# http://bmockbe.ru/events/?ID=7583
|
||||
# </a>
|
||||
#
|
||||
#
|
||||
# Medvedev signed a law on the calculation of the time (in russian):
|
||||
# <a href="http://www.regnum.ru/news/polit/1413906.html">
|
||||
# http://www.regnum.ru/news/polit/1413906.html
|
||||
@ -1710,7 +1710,7 @@ Zone Europe/Malta 0:58:04 - LMT 1893 Nov 2 0:00s # Valletta
|
||||
# From Alexander Krivenyshev (2011-10-26)
|
||||
# NO need to divide Moldova into two timezones at this point.
|
||||
# As of today, Transnistria (Pridnestrovie)- Tiraspol reversed its own
|
||||
# decision to abolish DST this winter.
|
||||
# decision to abolish DST this winter.
|
||||
# Following Moldova and neighboring Ukraine- Transnistria (Pridnestrovie)-
|
||||
# Tiraspol will go back to winter time on October 30, 2011.
|
||||
# News from Moldova (in russian):
|
||||
@ -2600,11 +2600,11 @@ Zone Europe/Zurich 0:34:08 - LMT 1848 Sep 12
|
||||
# http://www.alomaliye.com/bkk_2002_3769.htm
|
||||
|
||||
# From Gökdeniz Karadağ (2011-03-10):
|
||||
#
|
||||
#
|
||||
# According to the articles linked below, Turkey will change into summer
|
||||
# time zone (GMT+3) on March 28, 2011 at 3:00 a.m. instead of March 27.
|
||||
# This change is due to a nationwide exam on 27th.
|
||||
#
|
||||
#
|
||||
# <a href="http://www.worldbulletin.net/?aType=haber&ArticleID=70872">
|
||||
# http://www.worldbulletin.net/?aType=haber&ArticleID=70872
|
||||
# </a>
|
||||
@ -2721,7 +2721,7 @@ Link Europe/Istanbul Asia/Istanbul # Istanbul is in both continents.
|
||||
# time this year after all.
|
||||
#
|
||||
# From Udo Schwedt (2011-10-18):
|
||||
# As far as I understand, the recent change to the Ukranian time zone
|
||||
# As far as I understand, the recent change to the Ukranian time zone
|
||||
# (Europe/Kiev) to introduce permanent daylight saving time (similar
|
||||
# to Russia) was reverted today:
|
||||
#
|
||||
|
Some files were not shown because too many files have changed in this diff Show More
Loading…
Reference in New Issue
Block a user