mirror of
https://github.com/openjdk/jdk.git
synced 2025-09-20 19:14:38 +02:00
Merge
This commit is contained in:
commit
b28f16c910
1351 changed files with 154246 additions and 6211 deletions
1
.hgtags
1
.hgtags
|
@ -195,3 +195,4 @@ adb5171c554e14cd86f618b5584f6e3d693d5889 jdk8-b69
|
|||
a41ada2ed4ef735449531c6ebe6cec593d890a1c jdk8-b71
|
||||
6725b3961f987cf40f446d1c11cd324a3bec545f jdk8-b72
|
||||
fe94b40ffd9390f6cffcdf51c0389b0e6dde0c13 jdk8-b73
|
||||
f627eff819628822a0777af8062244352f2a29cf jdk8-b74
|
||||
|
|
|
@ -195,3 +195,4 @@ cdb401a60cea6ad5ef3f498725ed1decf8dda1ea jdk8-b68
|
|||
51ad2a34342055333eb5f36e2fb514b027895708 jdk8-b71
|
||||
c1be681d80a1f1c848dc671d664fccb19e046a12 jdk8-b72
|
||||
93b9664f97eeb6f89397a8842318ebacaac9feb9 jdk8-b73
|
||||
b43aa5bd8ca5c8121336495382d35ecfa7a71536 jdk8-b74
|
||||
|
|
|
@ -3723,7 +3723,7 @@ fi
|
|||
#CUSTOM_AUTOCONF_INCLUDE
|
||||
|
||||
# Do not change or remove the following line, it is needed for consistency checks:
|
||||
DATE_WHEN_GENERATED=1358499442
|
||||
DATE_WHEN_GENERATED=1359376859
|
||||
|
||||
###############################################################################
|
||||
#
|
||||
|
|
|
@ -389,7 +389,8 @@ if test "x$with_milestone" = xyes; then
|
|||
AC_MSG_ERROR([Milestone must have a value])
|
||||
elif test "x$with_milestone" != x; then
|
||||
MILESTONE="$with_milestone"
|
||||
else
|
||||
fi
|
||||
if test "x$MILESTONE" = x; then
|
||||
MILESTONE=internal
|
||||
fi
|
||||
|
||||
|
|
|
@ -136,6 +136,12 @@ fi
|
|||
AC_PATH_X
|
||||
AC_PATH_XTRA
|
||||
|
||||
# AC_PATH_XTRA creates X_LIBS and sometimes adds -R flags. When cross compiling
|
||||
# this doesn't make sense so we remove it.
|
||||
if test "x$COMPILE_TYPE" = xcross; then
|
||||
X_LIBS=`$ECHO $X_LIBS | $SED 's/-R \{0,1\}[[^ ]]*//g'`
|
||||
fi
|
||||
|
||||
if test "x$no_x" = xyes && test "x$X11_NOT_NEEDED" != xyes; then
|
||||
HELP_MSG_MISSING_DEPENDENCY([x11])
|
||||
AC_MSG_ERROR([Could not find X11 libraries. $HELP_MSG])
|
||||
|
|
|
@ -350,9 +350,15 @@ compare_zip_file() {
|
|||
OTHER_DIR=$2
|
||||
WORK_DIR=$3
|
||||
ZIP_FILE=$4
|
||||
# Optionally provide different name for other zipfile
|
||||
OTHER_ZIP_FILE=$5
|
||||
|
||||
THIS_ZIP=$THIS_DIR/$ZIP_FILE
|
||||
OTHER_ZIP=$OTHER_DIR/$ZIP_FILE
|
||||
if [ -n "$OTHER_ZIP_FILE" ]; then
|
||||
OTHER_ZIP=$OTHER_DIR/$OTHER_ZIP_FILE
|
||||
else
|
||||
OTHER_ZIP=$OTHER_DIR/$ZIP_FILE
|
||||
fi
|
||||
|
||||
THIS_SUFFIX="${THIS_ZIP##*.}"
|
||||
OTHER_SUFFIX="${OTHER_ZIP##*.}"
|
||||
|
@ -962,6 +968,9 @@ if [ -z "$1" ] || [ "$1" = "-h" ] || [ "$1" = "-?" ] || [ "$1" = "/h" ] || [ "$1
|
|||
echo "[FILTER] List filenames in the image to compare, works for jars, zips, libs and execs"
|
||||
echo "Example:"
|
||||
echo "bash ./common/bin/compareimages.sh CodePointIM.jar"
|
||||
echo ""
|
||||
echo "-2zips <file1> <file2> Compare two zip files only"
|
||||
echo ""
|
||||
exit 10
|
||||
fi
|
||||
|
||||
|
@ -1023,6 +1032,13 @@ while [ -n "$1" ]; do
|
|||
-execs)
|
||||
CMP_EXECS=true
|
||||
;;
|
||||
-2zips)
|
||||
CMP_2_ZIPS=true
|
||||
THIS_FILE=$2
|
||||
OTHER_FILE=$3
|
||||
shift
|
||||
shift
|
||||
;;
|
||||
*)
|
||||
CMP_NAMES=false
|
||||
CMP_PERMS=false
|
||||
|
@ -1041,6 +1057,18 @@ while [ -n "$1" ]; do
|
|||
shift
|
||||
done
|
||||
|
||||
if [ "$CMP_2_ZIPS" = "true" ]; then
|
||||
THIS_DIR="$(dirname $THIS_FILE)"
|
||||
THIS_DIR="$(cd "$THIS_DIR" && pwd )"
|
||||
OTHER_DIR="$(dirname $OTHER_FILE)"
|
||||
OTHER_DIR="$(cd "$OTHER_DIR" && pwd )"
|
||||
THIS_FILE_NAME="$(basename $THIS_FILE)"
|
||||
OTHER_FILE_NAME="$(basename $OTHER_FILE)"
|
||||
echo Comparing $THIS_DIR/$THIS_FILE_NAME and $OTHER_DIR/$OTHER_FILE_NAME
|
||||
compare_zip_file $THIS_DIR $OTHER_DIR $COMPARE_ROOT/2zips $THIS_FILE_NAME $OTHER_FILE_NAME
|
||||
exit
|
||||
fi
|
||||
|
||||
if [ "$CMP_NAMES" = "false" ] && [ "$CMP_TYPES" = "false" ] && [ "$CMP_PERMS" = "false" ] && [ "$CMP_GENERAL" = "false" ] && [ "$CMP_ZIPS" = "false" ] && [ "$CMP_JARS" = "false" ] && [ "$CMP_LIBS" = "false" ] && [ "$CMP_EXECS" = "false" ]; then
|
||||
CMP_NAMES=true
|
||||
CMP_PERMS=true
|
||||
|
|
|
@ -887,6 +887,17 @@ ACCEPTED_SMALL_SIZE_DIFF="
|
|||
./jre/bin/unpack200.exe
|
||||
"
|
||||
|
||||
# jabswitch.exe is compiled and linked with incremental turned on in the old
|
||||
# build. This makes no sense, so it's turned off in the new build.
|
||||
ACCEPTED_SIZE_DIFF="
|
||||
./bin/jabswitch.exe
|
||||
./jre/bin/jabswitch.exe
|
||||
"
|
||||
ACCEPTED_DIS_DIFF="
|
||||
./bin/jabswitch.exe
|
||||
./jre/bin/jabswitch.exe
|
||||
"
|
||||
|
||||
# On windows, there are unavoidable allignment issues making
|
||||
# a perfect disasm diff impossible. Filter out the following:
|
||||
# * Random parts of C++ symbols (this is a bit greedy, but does the trick)
|
||||
|
|
|
@ -127,6 +127,11 @@ CORE_PKGS = \
|
|||
java.sql \
|
||||
java.text \
|
||||
java.text.spi \
|
||||
java.time \
|
||||
java.time.temporal \
|
||||
java.time.calendar \
|
||||
java.time.format \
|
||||
java.time.zone \
|
||||
java.util \
|
||||
java.util.concurrent \
|
||||
java.util.concurrent.atomic \
|
||||
|
|
|
@ -1,4 +1,4 @@
|
|||
# Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved.
|
||||
# Copyright (c) 1997, 2013, 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
|
||||
|
@ -269,6 +269,7 @@ COMMON_JAVADOCFLAGS = \
|
|||
-quiet \
|
||||
-use \
|
||||
-keywords \
|
||||
-Xdoclint:none \
|
||||
$(ADDITIONAL_JAVADOCFLAGS)
|
||||
|
||||
ifdef OPENJDK
|
||||
|
|
|
@ -195,3 +195,4 @@ d54dc53e223ed9ce7d5f4d2cd02ad9d5def3c2db jdk8-b59
|
|||
8171d23e914d758836527b80b06debcfdb718f2d jdk8-b71
|
||||
cb40427f47145b01b7e53c3e02b38ff7625efbda jdk8-b72
|
||||
191afde59e7be0e1a1d76d06f2a32ff17444f0ec jdk8-b73
|
||||
2132845cf5f717ff5c240a2431c0c0e03e66e3a5 jdk8-b74
|
||||
|
|
|
@ -309,3 +309,5 @@ d5cb5830f570d1304ea4b196dde672a291b55f29 jdk8-b72
|
|||
1e129851479e4f5df439109fca2c7be1f1613522 hs25-b15
|
||||
11619f33cd683c2f1d6ef72f1c6ff3dacf5a9f1c jdk8-b73
|
||||
70c89bd6b895a10d25ca70e08093c09ff2005fda hs25-b16
|
||||
1a3e54283c54aaa8b3437813e8507fbdc966e5b6 jdk8-b74
|
||||
b4391649e91ea8d37f66317a03d6d2573a93d10d hs25-b17
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
#
|
||||
# Copyright (c) 2005, 2012, Oracle and/or its affiliates. All rights reserved.
|
||||
# Copyright (c) 2005, 2013, 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
|
||||
|
@ -87,7 +87,6 @@ endif
|
|||
# Typical C1/C2 targets made available with this Makefile
|
||||
C1_VM_TARGETS=product1 fastdebug1 optimized1 jvmg1
|
||||
C2_VM_TARGETS=product fastdebug optimized jvmg
|
||||
KERNEL_VM_TARGETS=productkernel fastdebugkernel optimizedkernel jvmgkernel
|
||||
ZERO_VM_TARGETS=productzero fastdebugzero optimizedzero jvmgzero
|
||||
SHARK_VM_TARGETS=productshark fastdebugshark optimizedshark jvmgshark
|
||||
MINIMAL1_VM_TARGETS=productminimal1 fastdebugminimal1 jvmgminimal1
|
||||
|
@ -161,11 +160,6 @@ $(C2_VM_TARGETS):
|
|||
$(CD) $(GAMMADIR)/make; \
|
||||
$(MAKE) BUILD_FLAVOR=$@ VM_TARGET=$@ generic_build2 $(ALT_OUT)
|
||||
|
||||
$(KERNEL_VM_TARGETS):
|
||||
$(CD) $(GAMMADIR)/make; \
|
||||
$(MAKE) BUILD_FLAVOR=$(@:%kernel=%) VM_TARGET=$@ \
|
||||
generic_buildkernel $(ALT_OUT)
|
||||
|
||||
$(ZERO_VM_TARGETS):
|
||||
$(CD) $(GAMMADIR)/make; \
|
||||
$(MAKE) BUILD_FLAVOR=$(@:%zero=%) VM_TARGET=$@ \
|
||||
|
@ -223,24 +217,6 @@ else
|
|||
$(MAKE_ARGS) $(VM_TARGET)
|
||||
endif
|
||||
|
||||
generic_buildkernel:
|
||||
$(MKDIR) -p $(OUTPUTDIR)
|
||||
ifeq ($(OSNAME),windows)
|
||||
ifeq ($(ARCH_DATA_MODEL), 32)
|
||||
$(CD) $(OUTPUTDIR); \
|
||||
$(NMAKE) -f $(ABS_OS_MAKEFILE) \
|
||||
Variant=kernel \
|
||||
WorkSpace=$(ABS_GAMMADIR) \
|
||||
BootStrapDir=$(ABS_BOOTDIR) \
|
||||
BuildUser=$(USERNAME) \
|
||||
$(MAKE_ARGS) $(VM_TARGET:%kernel=%)
|
||||
else
|
||||
@$(ECHO) "No kernel ($(VM_TARGET)) for ARCH_DATA_MODEL=$(ARCH_DATA_MODEL)"
|
||||
endif
|
||||
else
|
||||
@$(ECHO) "No kernel ($(VM_TARGET)) for OS_NAME=$(OSNAME)"
|
||||
endif
|
||||
|
||||
generic_buildzero:
|
||||
$(MKDIR) -p $(OUTPUTDIR)
|
||||
$(CD) $(OUTPUTDIR); \
|
||||
|
@ -314,12 +290,10 @@ XUSAGE=$(HS_SRC_DIR)/share/vm/Xusage.txt
|
|||
DOCS_DIR=$(OUTPUTDIR)/$(VM_PLATFORM)_docs
|
||||
C1_BASE_DIR=$(OUTPUTDIR)/$(VM_PLATFORM)_compiler1
|
||||
C2_BASE_DIR=$(OUTPUTDIR)/$(VM_PLATFORM)_compiler2
|
||||
KERNEL_BASE_DIR=$(OUTPUTDIR)/$(VM_PLATFORM)_kernel
|
||||
ZERO_BASE_DIR=$(OUTPUTDIR)/$(VM_PLATFORM)_zero
|
||||
SHARK_BASE_DIR=$(OUTPUTDIR)/$(VM_PLATFORM)_shark
|
||||
C1_DIR=$(C1_BASE_DIR)/$(VM_SUBDIR)
|
||||
C2_DIR=$(C2_BASE_DIR)/$(VM_SUBDIR)
|
||||
KERNEL_DIR=$(KERNEL_BASE_DIR)/$(VM_SUBDIR)
|
||||
ZERO_DIR=$(ZERO_BASE_DIR)/$(VM_SUBDIR)
|
||||
SHARK_DIR=$(SHARK_BASE_DIR)/$(VM_SUBDIR)
|
||||
MINIMAL1_BASE_DIR=$(OUTPUTDIR)/$(VM_PLATFORM)_minimal1
|
||||
|
@ -333,10 +307,6 @@ ifeq ($(JVM_VARIANT_CLIENT), true)
|
|||
MISC_DIR=$(C1_DIR)
|
||||
GEN_DIR=$(C1_BASE_DIR)/generated
|
||||
endif
|
||||
ifeq ($(JVM_VARIANT_KERNEL), true)
|
||||
MISC_DIR=$(C2_DIR)
|
||||
GEN_DIR=$(C2_BASE_DIR)/generated
|
||||
endif
|
||||
ifeq ($(JVM_VARIANT_ZEROSHARK), true)
|
||||
MISC_DIR=$(SHARK_DIR)
|
||||
GEN_DIR=$(SHARK_BASE_DIR)/generated
|
||||
|
@ -386,16 +356,6 @@ $(EXPORT_SERVER_DIR)/%.pdb: $(C2_DIR)/%.pdb
|
|||
$(install-file)
|
||||
$(EXPORT_SERVER_DIR)/%.map: $(C2_DIR)/%.map
|
||||
$(install-file)
|
||||
|
||||
# Kernel files always come from kernel area
|
||||
$(EXPORT_KERNEL_DIR)/%.diz: $(KERNEL_DIR)/%.diz
|
||||
$(install-file)
|
||||
$(EXPORT_KERNEL_DIR)/%.dll: $(KERNEL_DIR)/%.dll
|
||||
$(install-file)
|
||||
$(EXPORT_KERNEL_DIR)/%.pdb: $(KERNEL_DIR)/%.pdb
|
||||
$(install-file)
|
||||
$(EXPORT_KERNEL_DIR)/%.map: $(KERNEL_DIR)/%.map
|
||||
$(install-file)
|
||||
endif
|
||||
|
||||
# Minimal JVM files always come from minimal area
|
||||
|
@ -538,7 +498,7 @@ $(EXPORT_DOCS_DIR)/platform/jvmti/%: $(DOCS_DIR)/%
|
|||
$(install-file)
|
||||
|
||||
# Xusage file
|
||||
$(EXPORT_SERVER_DIR)/Xusage.txt $(EXPORT_CLIENT_DIR)/Xusage.txt $(EXPORT_KERNEL_DIR)/Xusage.txt $(EXPORT_MINIMAL_DIR)/Xusage.txt: $(XUSAGE)
|
||||
$(EXPORT_SERVER_DIR)/Xusage.txt $(EXPORT_CLIENT_DIR)/Xusage.txt $(EXPORT_MINIMAL_DIR)/Xusage.txt: $(XUSAGE)
|
||||
$(prep-target)
|
||||
$(RM) $@.temp
|
||||
$(SED) 's/\(separated by \)[;:]/\1$(PATH_SEP)/g' $< > $@.temp
|
||||
|
@ -551,7 +511,6 @@ clobber clean: clean_build clean_export clean_jdk
|
|||
clean_build:
|
||||
$(RM) -r $(C1_DIR)
|
||||
$(RM) -r $(C2_DIR)
|
||||
$(RM) -r $(KERNEL_DIR)
|
||||
$(RM) -r $(ZERO_DIR)
|
||||
$(RM) -r $(SHARK_DIR)
|
||||
$(RM) -r $(MINIMAL1_DIR)
|
||||
|
@ -586,10 +545,6 @@ test_jdk:
|
|||
$(JDK_IMAGE_DIR)/bin/java -d$(ARCH_DATA_MODEL) -server -Xinternalversion
|
||||
$(JDK_IMAGE_DIR)/bin/java -d$(ARCH_DATA_MODEL) -server -version
|
||||
endif
|
||||
ifeq ($(JVM_VARIANT_KERNEL), true)
|
||||
$(JDK_IMAGE_DIR)/bin/java -d$(ARCH_DATA_MODEL) -kernel -Xinternalversion
|
||||
$(JDK_IMAGE_DIR)/bin/java -d$(ARCH_DATA_MODEL) -kernel -version
|
||||
endif
|
||||
|
||||
copy_product_jdk::
|
||||
$(RM) -r $(JDK_IMAGE_DIR)
|
||||
|
@ -665,7 +620,6 @@ target_help:
|
|||
@$(ECHO) "Other targets are:"
|
||||
@$(ECHO) " $(C1_VM_TARGETS)"
|
||||
@$(ECHO) " $(C2_VM_TARGETS)"
|
||||
@$(ECHO) " $(KERNEL_VM_TARGETS)"
|
||||
@$(ECHO) " $(MINIMAL1_VM_TARGETS)"
|
||||
|
||||
# Variable help (only common ones used by this workspace)
|
||||
|
@ -761,8 +715,8 @@ endif
|
|||
include $(GAMMADIR)/make/jprt.gmk
|
||||
|
||||
.PHONY: all world clobber clean help $(C1_VM_TARGETS) $(C2_VM_TARGETS) \
|
||||
$(KERNEL_VM_TARGETS) $(MINIMAL1_VM_TARGETS) \
|
||||
generic_build1 generic_build2 generic_buildkernel generic_buildminimal1 generic_export \
|
||||
$(MINIMAL1_VM_TARGETS) \
|
||||
generic_build1 generic_build2 generic_buildminimal1 generic_export \
|
||||
export_product export_fastdebug export_debug export_optimized \
|
||||
export_jdk_product export_jdk_fastdebug export_jdk_debug \
|
||||
create_jdk copy_jdk update_jdk test_jdk \
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
#
|
||||
# Copyright (c) 2005, 2012, Oracle and/or its affiliates. All rights reserved.
|
||||
# Copyright (c) 2005, 2013, 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
|
||||
|
@ -25,10 +25,9 @@
|
|||
# Rules to build jvm_db/dtrace, used by vm.make
|
||||
|
||||
# We build libjvm_dtrace/libjvm_db/dtrace for COMPILER1 and COMPILER2
|
||||
# but not for CORE or KERNEL configurations.
|
||||
# but not for CORE configuration.
|
||||
|
||||
ifneq ("${TYPE}", "CORE")
|
||||
ifneq ("${TYPE}", "KERNEL")
|
||||
|
||||
ifeq ($(OS_VENDOR), Darwin)
|
||||
# we build dtrace for macosx using USDT2 probes
|
||||
|
@ -280,13 +279,6 @@ endif # ifneq ("${dtraceFound}", "")
|
|||
endif # ifeq ($(OS_VENDOR), Darwin)
|
||||
|
||||
|
||||
else # KERNEL build
|
||||
|
||||
dtraceCheck:
|
||||
$(QUIETLY) echo "**NOTICE** Dtrace support disabled for KERNEL builds"
|
||||
|
||||
endif # ifneq ("${TYPE}", "KERNEL")
|
||||
|
||||
else # CORE build
|
||||
|
||||
dtraceCheck:
|
||||
|
|
|
@ -35,7 +35,7 @@ HOTSPOT_VM_COPYRIGHT=Copyright 2013
|
|||
|
||||
HS_MAJOR_VER=25
|
||||
HS_MINOR_VER=0
|
||||
HS_BUILD_NUMBER=17
|
||||
HS_BUILD_NUMBER=18
|
||||
|
||||
JDK_MAJOR_VER=1
|
||||
JDK_MINOR_VER=8
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
#
|
||||
# Copyright (c) 1998, 2012, Oracle and/or its affiliates. All rights reserved.
|
||||
# Copyright (c) 1998, 2013, 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
|
||||
|
@ -157,13 +157,11 @@ SUBDIRS_C1 = $(addprefix $(OSNAME)_$(BUILDARCH)_compiler1/,$(TARGETS))
|
|||
SUBDIRS_C2 = $(addprefix $(OSNAME)_$(BUILDARCH)_compiler2/,$(TARGETS))
|
||||
SUBDIRS_TIERED = $(addprefix $(OSNAME)_$(BUILDARCH)_tiered/,$(TARGETS))
|
||||
SUBDIRS_CORE = $(addprefix $(OSNAME)_$(BUILDARCH)_core/,$(TARGETS))
|
||||
SUBDIRS_KERNEL = $(addprefix $(OSNAME)_$(BUILDARCH)_kernel/,$(TARGETS))
|
||||
|
||||
TARGETS_C2 = $(TARGETS)
|
||||
TARGETS_C1 = $(addsuffix 1,$(TARGETS))
|
||||
TARGETS_TIERED = $(addsuffix tiered,$(TARGETS))
|
||||
TARGETS_CORE = $(addsuffix core,$(TARGETS))
|
||||
TARGETS_KERNEL = $(addsuffix kernel,$(TARGETS))
|
||||
|
||||
BUILDTREE_MAKE = $(GAMMADIR)/make/$(OSNAME)/makefiles/buildtree.make
|
||||
BUILDTREE_VARS = GAMMADIR=$(GAMMADIR) OS_FAMILY=$(OSNAME) ARCH=$(SRCARCH) BUILDARCH=$(BUILDARCH) LIBARCH=$(LIBARCH)
|
||||
|
@ -229,10 +227,6 @@ $(SUBDIRS_CORE): $(BUILDTREE_MAKE)
|
|||
$(QUIETLY) $(MAKE) -f $(GAMMADIR)/make/$(OSNAME)/Makefile checks
|
||||
$(BUILDTREE) VARIANT=core
|
||||
|
||||
$(SUBDIRS_KERNEL): $(BUILDTREE_MAKE)
|
||||
$(QUIETLY) $(MAKE) -f $(GAMMADIR)/make/$(OSNAME)/Makefile checks
|
||||
$(BUILDTREE) VARIANT=kernel
|
||||
|
||||
# Define INSTALL=y at command line to automatically copy JVM into JAVA_HOME
|
||||
|
||||
$(TARGETS_C2): $(SUBDIRS_C2)
|
||||
|
@ -271,20 +265,10 @@ ifdef INSTALL
|
|||
cd $(OSNAME)_$(BUILDARCH)_core/$(patsubst %core,%,$@) && $(MAKE) $(MFLAGS) install
|
||||
endif
|
||||
|
||||
$(TARGETS_KERNEL): $(SUBDIRS_KERNEL)
|
||||
cd $(OSNAME)_$(BUILDARCH)_kernel/$(patsubst %kernel,%,$@) && $(MAKE) $(MFLAGS)
|
||||
ifeq ($(TEST_IN_BUILD),true)
|
||||
cd $(OSNAME)_$(BUILDARCH)_kernel/$(patsubst %kernel,%,$@) && ./test_gamma
|
||||
endif
|
||||
ifdef INSTALL
|
||||
cd $(OSNAME)_$(BUILDARCH)_kernel/$(patsubst %kernel,%,$@) && $(MAKE) $(MFLAGS) install
|
||||
endif
|
||||
|
||||
# Just build the tree, and nothing else:
|
||||
tree: $(SUBDIRS_C2)
|
||||
tree1: $(SUBDIRS_C1)
|
||||
treecore: $(SUBDIRS_CORE)
|
||||
treekernel: $(SUBDIRS_KERNEL)
|
||||
|
||||
# Doc target. This is the same for all build options.
|
||||
# Hence create a docs directory beside ...$(ARCH)_[...]
|
||||
|
@ -304,10 +288,10 @@ core: jvmgcore productcore
|
|||
clean_docs:
|
||||
rm -rf $(SUBDIR_DOCS)
|
||||
|
||||
clean_compiler1 clean_compiler2 clean_core clean_kernel:
|
||||
clean_compiler1 clean_compiler2 clean_core:
|
||||
rm -rf $(OSNAME)_$(BUILDARCH)_$(subst clean_,,$@)
|
||||
|
||||
clean: clean_compiler2 clean_compiler1 clean_core clean_docs clean_kernel
|
||||
clean: clean_compiler2 clean_compiler1 clean_core clean_docs
|
||||
|
||||
include $(GAMMADIR)/make/cscope.make
|
||||
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
#
|
||||
# Copyright (c) 2005, 2012, Oracle and/or its affiliates. All rights reserved.
|
||||
# Copyright (c) 2005, 2013, 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
|
||||
|
@ -25,10 +25,9 @@
|
|||
# Rules to build jvm_db/dtrace, used by vm.make
|
||||
|
||||
# We build libjvm_dtrace/libjvm_db/dtrace for COMPILER1 and COMPILER2
|
||||
# but not for CORE or KERNEL configurations.
|
||||
# but not for CORE configuration.
|
||||
|
||||
ifneq ("${TYPE}", "CORE")
|
||||
ifneq ("${TYPE}", "KERNEL")
|
||||
|
||||
ifdef USE_GCC
|
||||
|
||||
|
@ -362,13 +361,6 @@ endif # ifneq ("${dtraceFound}", "")
|
|||
|
||||
endif # ifdef USE_GCC
|
||||
|
||||
else # KERNEL build
|
||||
|
||||
dtraceCheck:
|
||||
$(QUIETLY) echo "**NOTICE** Dtrace support disabled for KERNEL builds"
|
||||
|
||||
endif # ifneq ("${TYPE}", "KERNEL")
|
||||
|
||||
else # CORE build
|
||||
|
||||
dtraceCheck:
|
||||
|
|
|
@ -1,6 +1,6 @@
|
|||
@echo off
|
||||
REM
|
||||
REM Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved.
|
||||
REM Copyright (c) 1997, 2013, Oracle and/or its affiliates. All rights reserved.
|
||||
REM DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
||||
REM
|
||||
REM This code is free software; you can redistribute it and/or modify it
|
||||
|
@ -67,7 +67,6 @@ goto usage
|
|||
|
||||
:test1
|
||||
if "%2" == "core" goto test2
|
||||
if "%2" == "kernel" goto test2
|
||||
if "%2" == "compiler1" goto test2
|
||||
if "%2" == "compiler2" goto test2
|
||||
if "%2" == "tiered" goto test2
|
||||
|
@ -109,7 +108,7 @@ echo Usage: build flavor version workspace bootstrap_dir [build_id] [windbg_home
|
|||
echo.
|
||||
echo where:
|
||||
echo flavor is "product", "debug" or "fastdebug",
|
||||
echo version is "core", "kernel", "compiler1", "compiler2", or "tiered",
|
||||
echo version is "core", "compiler1", "compiler2", or "tiered",
|
||||
echo workspace is source directory without trailing slash,
|
||||
echo bootstrap_dir is a full path to a JDK in which bin/java
|
||||
echo and bin/javac are present and working, and build_id is an
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
#
|
||||
# Copyright (c) 2010, 2012, Oracle and/or its affiliates. All rights reserved.
|
||||
# Copyright (c) 2010, 2013, 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
|
||||
|
@ -107,7 +107,6 @@ COMPILER2_PATHS="${COMPILER2_PATHS} ${GENERATED}/adfiles"
|
|||
# Include dirs per type.
|
||||
case "${TYPE}" in
|
||||
"core") Src_Dirs="${CORE_PATHS}" ;;
|
||||
"kernel") Src_Dirs="${BASE_PATHS} ${COMPILER1_PATHS}" ;;
|
||||
"compiler1") Src_Dirs="${CORE_PATHS} ${COMPILER1_PATHS}" ;;
|
||||
"compiler2") Src_Dirs="${CORE_PATHS} ${COMPILER2_PATHS}" ;;
|
||||
"tiered") Src_Dirs="${CORE_PATHS} ${COMPILER1_PATHS} ${COMPILER2_PATHS}" ;;
|
||||
|
@ -120,16 +119,12 @@ COMPILER1_SPECIFIC_FILES="c1_*"
|
|||
SHARK_SPECIFIC_FILES="shark"
|
||||
ZERO_SPECIFIC_FILES="zero"
|
||||
|
||||
# These files need to be excluded when building the kernel target.
|
||||
KERNEL_EXCLUDED_FILES="attachListener.cpp attachListener_windows.cpp metaspaceShared_${Platform_arch_model}.cpp forte.cpp fprofiler.cpp heapDumper.cpp heapInspection.cpp jniCheck.cpp jvmtiCodeBlobEvents.cpp jvmtiExtensions.cpp jvmtiImpl.cpp jvmtiRawMonitor.cpp jvmtiTagMap.cpp jvmtiTrace.cpp vmStructs.cpp g1MemoryPool.cpp psMemoryPool.cpp gcAdaptivePolicyCounters.cpp concurrentGCThread.cpp metaspaceShared.cpp mutableNUMASpace.cpp allocationStats.cpp gSpaceCounters.cpp immutableSpace.cpp mutableSpace.cpp spaceCounters.cpp yieldingWorkgroup.cpp"
|
||||
|
||||
# Always exclude these.
|
||||
Src_Files_EXCLUDE="jsig.c jvmtiEnvRecommended.cpp jvmtiEnvStub.cpp"
|
||||
|
||||
# Exclude per type.
|
||||
case "${TYPE}" in
|
||||
"core") Src_Files_EXCLUDE="${Src_Files_EXCLUDE} ${COMPILER1_SPECIFIC_FILES} ${COMPILER2_SPECIFIC_FILES} ${ZERO_SPECIFIC_FILES} ${SHARK_SPECIFIC_FILES} ciTypeFlow.cpp" ;;
|
||||
"kernel") Src_Files_EXCLUDE="${Src_Files_EXCLUDE} ${COMPILER2_SPECIFIC_FILES} ${ZERO_SPECIFIC_FILES} ${SHARK_SPECIFIC_FILES} ${KERNEL_EXCLUDED_FILES} ciTypeFlow.cpp" ;;
|
||||
"compiler1") Src_Files_EXCLUDE="${Src_Files_EXCLUDE} ${COMPILER2_SPECIFIC_FILES} ${ZERO_SPECIFIC_FILES} ${SHARK_SPECIFIC_FILES} ciTypeFlow.cpp" ;;
|
||||
"compiler2") Src_Files_EXCLUDE="${Src_Files_EXCLUDE} ${COMPILER1_SPECIFIC_FILES} ${ZERO_SPECIFIC_FILES} ${SHARK_SPECIFIC_FILES}" ;;
|
||||
"tiered") Src_Files_EXCLUDE="${Src_Files_EXCLUDE} ${ZERO_SPECIFIC_FILES} ${SHARK_SPECIFIC_FILES}" ;;
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
#
|
||||
# Copyright (c) 2006, 2012, Oracle and/or its affiliates. All rights reserved.
|
||||
# Copyright (c) 2006, 2013, 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
|
||||
|
@ -157,7 +157,7 @@ endif
|
|||
MAKE_ARGS += RM="$(RM)"
|
||||
MAKE_ARGS += ZIPEXE=$(ZIPEXE)
|
||||
|
||||
# On 32 bit windows we build server, client and kernel, on 64 bit just server.
|
||||
# On 32 bit windows we build server and client, on 64 bit just server.
|
||||
ifeq ($(JVM_VARIANTS),)
|
||||
ifeq ($(ARCH_DATA_MODEL), 32)
|
||||
JVM_VARIANTS:=client,server
|
||||
|
@ -250,7 +250,6 @@ endif
|
|||
|
||||
EXPORT_SERVER_DIR = $(EXPORT_JRE_BIN_DIR)/server
|
||||
EXPORT_CLIENT_DIR = $(EXPORT_JRE_BIN_DIR)/client
|
||||
EXPORT_KERNEL_DIR = $(EXPORT_JRE_BIN_DIR)/kernel
|
||||
|
||||
ifeq ($(JVM_VARIANT_SERVER),true)
|
||||
EXPORT_LIST += $(EXPORT_SERVER_DIR)/Xusage.txt
|
||||
|
@ -277,18 +276,6 @@ ifeq ($(JVM_VARIANT_CLIENT),true)
|
|||
endif
|
||||
endif
|
||||
endif
|
||||
ifeq ($(JVM_VARIANT_KERNEL),true)
|
||||
EXPORT_LIST += $(EXPORT_KERNEL_DIR)/Xusage.txt
|
||||
EXPORT_LIST += $(EXPORT_KERNEL_DIR)/jvm.$(LIBRARY_SUFFIX)
|
||||
ifeq ($(ENABLE_FULL_DEBUG_SYMBOLS),1)
|
||||
ifeq ($(ZIP_DEBUGINFO_FILES),1)
|
||||
EXPORT_LIST += $(EXPORT_KERNEL_DIR)/jvm.diz
|
||||
else
|
||||
EXPORT_LIST += $(EXPORT_KERNEL_DIR)/jvm.pdb
|
||||
EXPORT_LIST += $(EXPORT_KERNEL_DIR)/jvm.map
|
||||
endif
|
||||
endif
|
||||
endif
|
||||
|
||||
EXPORT_LIST += $(EXPORT_JRE_LIB_DIR)/wb.jar
|
||||
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
#
|
||||
# Copyright (c) 1999, 2012, Oracle and/or its affiliates. All rights reserved.
|
||||
# Copyright (c) 1999, 2013, 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
|
||||
|
@ -166,63 +166,6 @@ ProjectCreatorIDEOptions=$(ProjectCreatorIDEOptions) \
|
|||
$(ProjectCreatorIDEOptionsIgnoreCompiler1:TARGET=core) \
|
||||
$(ProjectCreatorIDEOptionsIgnoreCompiler2:TARGET=core)
|
||||
|
||||
##################################################
|
||||
# JKERNEL specific options
|
||||
##################################################
|
||||
ProjectCreatorIDEOptions=$(ProjectCreatorIDEOptions) \
|
||||
-define_kernel KERNEL \
|
||||
$(ProjectCreatorIDEOptionsIgnoreCompiler2:TARGET=kernel) \
|
||||
-ignorePath_kernel src/share/vm/gc_implementation/parallelScavenge \
|
||||
-ignorePath_kernel src/share/vm/gc_implementation/parNew \
|
||||
-ignorePath_kernel src/share/vm/gc_implementation/concurrentMarkSweep \
|
||||
-ignorePath_kernel src/share/vm/gc_implementation/g1 \
|
||||
-ignoreFile_kernel attachListener.cpp \
|
||||
-ignoreFile_kernel attachListener_windows.cpp \
|
||||
-ignoreFile_kernel dump.cpp \
|
||||
-ignoreFile_kernel dump_$(Platform_arch_model).cpp \
|
||||
-ignoreFile_kernel forte.cpp \
|
||||
-ignoreFile_kernel fprofiler.cpp \
|
||||
-ignoreFile_kernel heapDumper.cpp \
|
||||
-ignoreFile_kernel heapInspection.cpp \
|
||||
-ignoreFile_kernel jniCheck.cpp \
|
||||
-ignoreFile_kernel jvmtiCodeBlobEvents.cpp \
|
||||
-ignoreFile_kernel jvmtiExtensions.cpp \
|
||||
-ignoreFile_kernel jvmtiImpl.cpp \
|
||||
-ignoreFile_kernel jvmtiRawMonitor.cpp \
|
||||
-ignoreFile_kernel jvmtiTagMap.cpp \
|
||||
-ignoreFile_kernel jvmtiTrace.cpp \
|
||||
-ignoreFile_kernel jvmtiTrace.hpp \
|
||||
-ignoreFile_kernel restore.cpp \
|
||||
-ignoreFile_kernel serialize.cpp \
|
||||
-ignoreFile_kernel vmStructs.cpp \
|
||||
-ignoreFile_kernel g1MemoryPool.cpp \
|
||||
-ignoreFile_kernel g1MemoryPool.hpp \
|
||||
-ignoreFile_kernel psMemoryPool.cpp \
|
||||
-ignoreFile_kernel psMemoryPool.hpp \
|
||||
-ignoreFile_kernel gcAdaptivePolicyCounters.cpp \
|
||||
-ignoreFile_kernel concurrentGCThread.cpp \
|
||||
-ignoreFile_kernel mutableNUMASpace.cpp \
|
||||
-ignoreFile_kernel ciTypeFlow.cpp \
|
||||
-ignoreFile_kernel ciTypeFlow.hpp \
|
||||
-ignoreFile_kernel oop.pcgc.inline.hpp \
|
||||
-ignoreFile_kernel oop.psgc.inline.hpp \
|
||||
-ignoreFile_kernel allocationStats.cpp \
|
||||
-ignoreFile_kernel allocationStats.hpp \
|
||||
-ignoreFile_kernel concurrentGCThread.hpp \
|
||||
-ignoreFile_kernel gSpaceCounters.cpp \
|
||||
-ignoreFile_kernel gSpaceCounters.hpp \
|
||||
-ignoreFile_kernel gcAdaptivePolicyCounters.hpp \
|
||||
-ignoreFile_kernel immutableSpace.cpp \
|
||||
-ignoreFile_kernel mutableNUMASpace.hpp \
|
||||
-ignoreFile_kernel mutableSpace.cpp \
|
||||
-ignoreFile_kernel spaceCounters.cpp \
|
||||
-ignoreFile_kernel spaceCounters.hpp \
|
||||
-ignoreFile_kernel yieldingWorkgroup.cpp \
|
||||
-ignoreFile_kernel yieldingWorkgroup.hpp \
|
||||
-ignorePath_kernel vmStructs_ \
|
||||
-ignoreFile_kernel $(Platform_arch_model).ad \
|
||||
-additionalFile_kernel gcTaskManager.hpp
|
||||
|
||||
##################################################
|
||||
# Client(C1) compiler specific options
|
||||
##################################################
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
#
|
||||
# Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved.
|
||||
# Copyright (c) 1997, 2013, 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
|
||||
|
@ -44,10 +44,6 @@ CXX_FLAGS=$(CXX_FLAGS) /D "ASSERT"
|
|||
# No need to define anything, CORE is defined as !COMPILER1 && !COMPILER2
|
||||
!endif
|
||||
|
||||
!if "$(Variant)" == "kernel"
|
||||
CXX_FLAGS=$(CXX_FLAGS) /D "KERNEL"
|
||||
!endif
|
||||
|
||||
!if "$(Variant)" == "compiler1"
|
||||
CXX_FLAGS=$(CXX_FLAGS) /D "COMPILER1"
|
||||
!endif
|
||||
|
|
|
@ -2263,6 +2263,18 @@ void Assembler::packuswb(XMMRegister dst, XMMRegister src) {
|
|||
emit_simd_arith(0x67, dst, src, VEX_SIMD_66);
|
||||
}
|
||||
|
||||
void Assembler::vpackuswb(XMMRegister dst, XMMRegister nds, XMMRegister src, bool vector256) {
|
||||
assert(VM_Version::supports_avx() && !vector256 || VM_Version::supports_avx2(), "256 bit integer vectors requires AVX2");
|
||||
emit_vex_arith(0x67, dst, nds, src, VEX_SIMD_66, vector256);
|
||||
}
|
||||
|
||||
void Assembler::vpermq(XMMRegister dst, XMMRegister src, int imm8, bool vector256) {
|
||||
int encode = simd_prefix_and_encode(dst, xnoreg, src, VEX_SIMD_66, VEX_OPCODE_0F_3A, true, vector256);
|
||||
emit_int8(0x00);
|
||||
emit_int8(0xC0 | encode);
|
||||
emit_int8(imm8);
|
||||
}
|
||||
|
||||
void Assembler::pcmpestri(XMMRegister dst, Address src, int imm8) {
|
||||
assert(VM_Version::supports_sse4_2(), "");
|
||||
InstructionMark im(this);
|
||||
|
@ -2475,7 +2487,7 @@ void Assembler::vptest(XMMRegister dst, Address src) {
|
|||
assert(dst != xnoreg, "sanity");
|
||||
int dst_enc = dst->encoding();
|
||||
// swap src<->dst for encoding
|
||||
vex_prefix(src, dst_enc, dst_enc, VEX_SIMD_66, VEX_OPCODE_0F_38, false, vector256);
|
||||
vex_prefix(src, 0, dst_enc, VEX_SIMD_66, VEX_OPCODE_0F_38, false, vector256);
|
||||
emit_int8(0x17);
|
||||
emit_operand(dst, src);
|
||||
}
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
/*
|
||||
* Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved.
|
||||
* Copyright (c) 1997, 2013, 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
|
||||
|
@ -543,7 +543,7 @@ class Assembler : public AbstractAssembler {
|
|||
// of instructions are freely declared without the need for wrapping them an ifdef.
|
||||
// (Some dangerous instructions are ifdef's out of inappropriate jvm's.)
|
||||
// In the .cpp file the implementations are wrapped so that they are dropped out
|
||||
// of the resulting jvm. This is done mostly to keep the footprint of KERNEL
|
||||
// of the resulting jvm. This is done mostly to keep the footprint of MINIMAL
|
||||
// to the size it was prior to merging up the 32bit and 64bit assemblers.
|
||||
//
|
||||
// This does mean you'll get a linker/runtime error if you use a 64bit only instruction
|
||||
|
@ -1395,6 +1395,10 @@ private:
|
|||
// Pack with unsigned saturation
|
||||
void packuswb(XMMRegister dst, XMMRegister src);
|
||||
void packuswb(XMMRegister dst, Address src);
|
||||
void vpackuswb(XMMRegister dst, XMMRegister nds, XMMRegister src, bool vector256);
|
||||
|
||||
// Pemutation of 64bit words
|
||||
void vpermq(XMMRegister dst, XMMRegister src, int imm8, bool vector256);
|
||||
|
||||
// SSE4.2 string instructions
|
||||
void pcmpestri(XMMRegister xmm1, XMMRegister xmm2, int imm8);
|
||||
|
|
|
@ -6209,6 +6209,128 @@ void MacroAssembler::generate_fill(BasicType t, bool aligned,
|
|||
}
|
||||
BIND(L_exit);
|
||||
}
|
||||
|
||||
// encode char[] to byte[] in ISO_8859_1
|
||||
void MacroAssembler::encode_iso_array(Register src, Register dst, Register len,
|
||||
XMMRegister tmp1Reg, XMMRegister tmp2Reg,
|
||||
XMMRegister tmp3Reg, XMMRegister tmp4Reg,
|
||||
Register tmp5, Register result) {
|
||||
// rsi: src
|
||||
// rdi: dst
|
||||
// rdx: len
|
||||
// rcx: tmp5
|
||||
// rax: result
|
||||
ShortBranchVerifier sbv(this);
|
||||
assert_different_registers(src, dst, len, tmp5, result);
|
||||
Label L_done, L_copy_1_char, L_copy_1_char_exit;
|
||||
|
||||
// set result
|
||||
xorl(result, result);
|
||||
// check for zero length
|
||||
testl(len, len);
|
||||
jcc(Assembler::zero, L_done);
|
||||
movl(result, len);
|
||||
|
||||
// Setup pointers
|
||||
lea(src, Address(src, len, Address::times_2)); // char[]
|
||||
lea(dst, Address(dst, len, Address::times_1)); // byte[]
|
||||
negptr(len);
|
||||
|
||||
if (UseSSE42Intrinsics || UseAVX >= 2) {
|
||||
Label L_chars_8_check, L_copy_8_chars, L_copy_8_chars_exit;
|
||||
Label L_chars_16_check, L_copy_16_chars, L_copy_16_chars_exit;
|
||||
|
||||
if (UseAVX >= 2) {
|
||||
Label L_chars_32_check, L_copy_32_chars, L_copy_32_chars_exit;
|
||||
movl(tmp5, 0xff00ff00); // create mask to test for Unicode chars in vector
|
||||
movdl(tmp1Reg, tmp5);
|
||||
vpbroadcastd(tmp1Reg, tmp1Reg);
|
||||
jmpb(L_chars_32_check);
|
||||
|
||||
bind(L_copy_32_chars);
|
||||
vmovdqu(tmp3Reg, Address(src, len, Address::times_2, -64));
|
||||
vmovdqu(tmp4Reg, Address(src, len, Address::times_2, -32));
|
||||
vpor(tmp2Reg, tmp3Reg, tmp4Reg, /* vector256 */ true);
|
||||
vptest(tmp2Reg, tmp1Reg); // check for Unicode chars in vector
|
||||
jccb(Assembler::notZero, L_copy_32_chars_exit);
|
||||
vpackuswb(tmp3Reg, tmp3Reg, tmp4Reg, /* vector256 */ true);
|
||||
vpermq(tmp4Reg, tmp3Reg, 0xD8, /* vector256 */ true);
|
||||
vmovdqu(Address(dst, len, Address::times_1, -32), tmp4Reg);
|
||||
|
||||
bind(L_chars_32_check);
|
||||
addptr(len, 32);
|
||||
jccb(Assembler::lessEqual, L_copy_32_chars);
|
||||
|
||||
bind(L_copy_32_chars_exit);
|
||||
subptr(len, 16);
|
||||
jccb(Assembler::greater, L_copy_16_chars_exit);
|
||||
|
||||
} else if (UseSSE42Intrinsics) {
|
||||
movl(tmp5, 0xff00ff00); // create mask to test for Unicode chars in vector
|
||||
movdl(tmp1Reg, tmp5);
|
||||
pshufd(tmp1Reg, tmp1Reg, 0);
|
||||
jmpb(L_chars_16_check);
|
||||
}
|
||||
|
||||
bind(L_copy_16_chars);
|
||||
if (UseAVX >= 2) {
|
||||
vmovdqu(tmp2Reg, Address(src, len, Address::times_2, -32));
|
||||
vptest(tmp2Reg, tmp1Reg);
|
||||
jccb(Assembler::notZero, L_copy_16_chars_exit);
|
||||
vpackuswb(tmp2Reg, tmp2Reg, tmp1Reg, /* vector256 */ true);
|
||||
vpermq(tmp3Reg, tmp2Reg, 0xD8, /* vector256 */ true);
|
||||
} else {
|
||||
if (UseAVX > 0) {
|
||||
movdqu(tmp3Reg, Address(src, len, Address::times_2, -32));
|
||||
movdqu(tmp4Reg, Address(src, len, Address::times_2, -16));
|
||||
vpor(tmp2Reg, tmp3Reg, tmp4Reg, /* vector256 */ false);
|
||||
} else {
|
||||
movdqu(tmp3Reg, Address(src, len, Address::times_2, -32));
|
||||
por(tmp2Reg, tmp3Reg);
|
||||
movdqu(tmp4Reg, Address(src, len, Address::times_2, -16));
|
||||
por(tmp2Reg, tmp4Reg);
|
||||
}
|
||||
ptest(tmp2Reg, tmp1Reg); // check for Unicode chars in vector
|
||||
jccb(Assembler::notZero, L_copy_16_chars_exit);
|
||||
packuswb(tmp3Reg, tmp4Reg);
|
||||
}
|
||||
movdqu(Address(dst, len, Address::times_1, -16), tmp3Reg);
|
||||
|
||||
bind(L_chars_16_check);
|
||||
addptr(len, 16);
|
||||
jccb(Assembler::lessEqual, L_copy_16_chars);
|
||||
|
||||
bind(L_copy_16_chars_exit);
|
||||
subptr(len, 8);
|
||||
jccb(Assembler::greater, L_copy_8_chars_exit);
|
||||
|
||||
bind(L_copy_8_chars);
|
||||
movdqu(tmp3Reg, Address(src, len, Address::times_2, -16));
|
||||
ptest(tmp3Reg, tmp1Reg);
|
||||
jccb(Assembler::notZero, L_copy_8_chars_exit);
|
||||
packuswb(tmp3Reg, tmp1Reg);
|
||||
movq(Address(dst, len, Address::times_1, -8), tmp3Reg);
|
||||
addptr(len, 8);
|
||||
jccb(Assembler::lessEqual, L_copy_8_chars);
|
||||
|
||||
bind(L_copy_8_chars_exit);
|
||||
subptr(len, 8);
|
||||
jccb(Assembler::zero, L_done);
|
||||
}
|
||||
|
||||
bind(L_copy_1_char);
|
||||
load_unsigned_short(tmp5, Address(src, len, Address::times_2, 0));
|
||||
testl(tmp5, 0xff00); // check if Unicode char
|
||||
jccb(Assembler::notZero, L_copy_1_char_exit);
|
||||
movb(Address(dst, len, Address::times_1, 0), tmp5);
|
||||
addptr(len, 1);
|
||||
jccb(Assembler::less, L_copy_1_char);
|
||||
|
||||
bind(L_copy_1_char_exit);
|
||||
addptr(result, len); // len is negative count of not processed elements
|
||||
bind(L_done);
|
||||
}
|
||||
|
||||
#undef BIND
|
||||
#undef BLOCK_COMMENT
|
||||
|
||||
|
|
|
@ -1135,6 +1135,10 @@ public:
|
|||
Register to, Register value, Register count,
|
||||
Register rtmp, XMMRegister xtmp);
|
||||
|
||||
void encode_iso_array(Register src, Register dst, Register len,
|
||||
XMMRegister tmp1, XMMRegister tmp2, XMMRegister tmp3,
|
||||
XMMRegister tmp4, Register tmp5, Register result);
|
||||
|
||||
#undef VIRTUAL
|
||||
|
||||
};
|
||||
|
|
|
@ -661,6 +661,14 @@ void VM_Version::get_processor_features() {
|
|||
}
|
||||
}
|
||||
}
|
||||
#if defined(COMPILER2) && defined(_ALLBSD_SOURCE)
|
||||
if (MaxVectorSize > 16) {
|
||||
// Limit vectors size to 16 bytes on BSD until it fixes
|
||||
// restoring upper 128bit of YMM registers on return
|
||||
// from signal handler.
|
||||
FLAG_SET_DEFAULT(MaxVectorSize, 16);
|
||||
}
|
||||
#endif // COMPILER2
|
||||
|
||||
// Use population count instruction if available.
|
||||
if (supports_popcnt()) {
|
||||
|
|
|
@ -11687,6 +11687,23 @@ instruct array_equals(eDIRegP ary1, eSIRegP ary2, eAXRegI result,
|
|||
ins_pipe( pipe_slow );
|
||||
%}
|
||||
|
||||
// encode char[] to byte[] in ISO_8859_1
|
||||
instruct encode_iso_array(eSIRegP src, eDIRegP dst, eDXRegI len,
|
||||
regD tmp1, regD tmp2, regD tmp3, regD tmp4,
|
||||
eCXRegI tmp5, eAXRegI result, eFlagsReg cr) %{
|
||||
match(Set result (EncodeISOArray src (Binary dst len)));
|
||||
effect(TEMP tmp1, TEMP tmp2, TEMP tmp3, TEMP tmp4, USE_KILL src, USE_KILL dst, USE_KILL len, KILL tmp5, KILL cr);
|
||||
|
||||
format %{ "Encode array $src,$dst,$len -> $result // KILL ECX, EDX, $tmp1, $tmp2, $tmp3, $tmp4, ESI, EDI " %}
|
||||
ins_encode %{
|
||||
__ encode_iso_array($src$$Register, $dst$$Register, $len$$Register,
|
||||
$tmp1$$XMMRegister, $tmp2$$XMMRegister, $tmp3$$XMMRegister,
|
||||
$tmp4$$XMMRegister, $tmp5$$Register, $result$$Register);
|
||||
%}
|
||||
ins_pipe( pipe_slow );
|
||||
%}
|
||||
|
||||
|
||||
//----------Control Flow Instructions------------------------------------------
|
||||
// Signed compare Instructions
|
||||
instruct compI_eReg(eFlagsReg cr, rRegI op1, rRegI op2) %{
|
||||
|
|
|
@ -10495,6 +10495,23 @@ instruct array_equals(rdi_RegP ary1, rsi_RegP ary2, rax_RegI result,
|
|||
ins_pipe( pipe_slow );
|
||||
%}
|
||||
|
||||
// encode char[] to byte[] in ISO_8859_1
|
||||
instruct encode_iso_array(rsi_RegP src, rdi_RegP dst, rdx_RegI len,
|
||||
regD tmp1, regD tmp2, regD tmp3, regD tmp4,
|
||||
rcx_RegI tmp5, rax_RegI result, rFlagsReg cr) %{
|
||||
match(Set result (EncodeISOArray src (Binary dst len)));
|
||||
effect(TEMP tmp1, TEMP tmp2, TEMP tmp3, TEMP tmp4, USE_KILL src, USE_KILL dst, USE_KILL len, KILL tmp5, KILL cr);
|
||||
|
||||
format %{ "Encode array $src,$dst,$len -> $result // KILL RCX, RDX, $tmp1, $tmp2, $tmp3, $tmp4, RSI, RDI " %}
|
||||
ins_encode %{
|
||||
__ encode_iso_array($src$$Register, $dst$$Register, $len$$Register,
|
||||
$tmp1$$XMMRegister, $tmp2$$XMMRegister, $tmp3$$XMMRegister,
|
||||
$tmp4$$XMMRegister, $tmp5$$Register, $result$$Register);
|
||||
%}
|
||||
ins_pipe( pipe_slow );
|
||||
%}
|
||||
|
||||
|
||||
//----------Control Flow Instructions------------------------------------------
|
||||
// Signed compare Instructions
|
||||
|
||||
|
|
|
@ -862,8 +862,10 @@ uint InstructForm::oper_input_base(FormDict &globals) {
|
|||
( strcmp(_matrule->_rChild->_opType,"AryEq" )==0 ||
|
||||
strcmp(_matrule->_rChild->_opType,"StrComp" )==0 ||
|
||||
strcmp(_matrule->_rChild->_opType,"StrEquals" )==0 ||
|
||||
strcmp(_matrule->_rChild->_opType,"StrIndexOf")==0 )) {
|
||||
strcmp(_matrule->_rChild->_opType,"StrIndexOf")==0 ||
|
||||
strcmp(_matrule->_rChild->_opType,"EncodeISOArray")==0)) {
|
||||
// String.(compareTo/equals/indexOf) and Arrays.equals
|
||||
// and sun.nio.cs.iso8859_1$Encoder.EncodeISOArray
|
||||
// take 1 control and 1 memory edges.
|
||||
return 2;
|
||||
}
|
||||
|
|
|
@ -1802,11 +1802,9 @@ ClassFileParser::AnnotationCollector::ID
|
|||
ClassFileParser::AnnotationCollector::annotation_index(ClassLoaderData* loader_data,
|
||||
Symbol* name) {
|
||||
vmSymbols::SID sid = vmSymbols::find_sid(name);
|
||||
bool privileged = false;
|
||||
if (loader_data->is_the_null_class_loader_data()) {
|
||||
// Privileged code can use all annotations. Other code silently drops some.
|
||||
privileged = true;
|
||||
}
|
||||
// Privileged code can use all annotations. Other code silently drops some.
|
||||
bool privileged = loader_data->is_the_null_class_loader_data() ||
|
||||
loader_data->is_anonymous();
|
||||
switch (sid) {
|
||||
case vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_invoke_ForceInline_signature):
|
||||
if (_location != _in_method) break; // only allow for methods
|
||||
|
|
|
@ -1199,66 +1199,6 @@ instanceKlassHandle SystemDictionary::load_shared_class(
|
|||
return ik;
|
||||
}
|
||||
|
||||
#ifdef KERNEL
|
||||
// Some classes on the bootstrap class path haven't been installed on the
|
||||
// system yet. Call the DownloadManager method to make them appear in the
|
||||
// bootstrap class path and try again to load the named class.
|
||||
// Note that with delegation class loaders all classes in another loader will
|
||||
// first try to call this so it'd better be fast!!
|
||||
static instanceKlassHandle download_and_retry_class_load(
|
||||
Symbol* class_name,
|
||||
TRAPS) {
|
||||
|
||||
Klass* dlm = SystemDictionary::DownloadManager_klass();
|
||||
instanceKlassHandle nk;
|
||||
|
||||
// If download manager class isn't loaded just return.
|
||||
if (dlm == NULL) return nk;
|
||||
|
||||
{ HandleMark hm(THREAD);
|
||||
ResourceMark rm(THREAD);
|
||||
Handle s = java_lang_String::create_from_symbol(class_name, CHECK_(nk));
|
||||
Handle class_string = java_lang_String::externalize_classname(s, CHECK_(nk));
|
||||
|
||||
// return value
|
||||
JavaValue result(T_OBJECT);
|
||||
|
||||
// Call the DownloadManager. We assume that it has a lock because
|
||||
// multiple classes could be not found and downloaded at the same time.
|
||||
// class sun.misc.DownloadManager;
|
||||
// public static String getBootClassPathEntryForClass(String className);
|
||||
JavaCalls::call_static(&result,
|
||||
KlassHandle(THREAD, dlm),
|
||||
vmSymbols::getBootClassPathEntryForClass_name(),
|
||||
vmSymbols::string_string_signature(),
|
||||
class_string,
|
||||
CHECK_(nk));
|
||||
|
||||
// Get result.string and add to bootclasspath
|
||||
assert(result.get_type() == T_OBJECT, "just checking");
|
||||
oop obj = (oop) result.get_jobject();
|
||||
if (obj == NULL) { return nk; }
|
||||
|
||||
Handle h_obj(THREAD, obj);
|
||||
char* new_class_name = java_lang_String::as_platform_dependent_str(h_obj,
|
||||
CHECK_(nk));
|
||||
|
||||
// lock the loader
|
||||
// we use this lock because JVMTI does.
|
||||
Handle loader_lock(THREAD, SystemDictionary::system_loader_lock());
|
||||
|
||||
ObjectLocker ol(loader_lock, THREAD);
|
||||
// add the file to the bootclasspath
|
||||
ClassLoader::update_class_path_entry_list(new_class_name, true);
|
||||
} // end HandleMark
|
||||
|
||||
if (TraceClassLoading) {
|
||||
ClassLoader::print_bootclasspath();
|
||||
}
|
||||
return ClassLoader::load_classfile(class_name, CHECK_(nk));
|
||||
}
|
||||
#endif // KERNEL
|
||||
|
||||
|
||||
instanceKlassHandle SystemDictionary::load_instance_class(Symbol* class_name, Handle class_loader, TRAPS) {
|
||||
instanceKlassHandle nh = instanceKlassHandle(); // null Handle
|
||||
|
@ -1278,15 +1218,6 @@ instanceKlassHandle SystemDictionary::load_instance_class(Symbol* class_name, Ha
|
|||
k = ClassLoader::load_classfile(class_name, CHECK_(nh));
|
||||
}
|
||||
|
||||
#ifdef KERNEL
|
||||
// If the VM class loader has failed to load the class, call the
|
||||
// DownloadManager class to make it magically appear on the classpath
|
||||
// and try again. This is only configured with the Kernel VM.
|
||||
if (k.is_null()) {
|
||||
k = download_and_retry_class_load(class_name, CHECK_(nh));
|
||||
}
|
||||
#endif // KERNEL
|
||||
|
||||
// find_or_define_instance_class may return a different InstanceKlass
|
||||
if (!k.is_null()) {
|
||||
k = find_or_define_instance_class(class_name, class_loader, k, CHECK_(nh));
|
||||
|
@ -1822,13 +1753,7 @@ bool SystemDictionary::initialize_wk_klass(WKID id, int init_opt, TRAPS) {
|
|||
Symbol* symbol = vmSymbols::symbol_at((vmSymbols::SID)sid);
|
||||
Klass** klassp = &_well_known_klasses[id];
|
||||
bool must_load = (init_opt < SystemDictionary::Opt);
|
||||
bool try_load = true;
|
||||
if (init_opt == SystemDictionary::Opt_Kernel) {
|
||||
#ifndef KERNEL
|
||||
try_load = false;
|
||||
#endif //KERNEL
|
||||
}
|
||||
if ((*klassp) == NULL && try_load) {
|
||||
if ((*klassp) == NULL) {
|
||||
if (must_load) {
|
||||
(*klassp) = resolve_or_fail(symbol, true, CHECK_0); // load required class
|
||||
} else {
|
||||
|
@ -1918,12 +1843,6 @@ void SystemDictionary::initialize_preloaded_classes(TRAPS) {
|
|||
//_box_klasses[T_OBJECT] = WK_KLASS(object_klass);
|
||||
//_box_klasses[T_ARRAY] = WK_KLASS(object_klass);
|
||||
|
||||
#ifdef KERNEL
|
||||
if (DownloadManager_klass() == NULL) {
|
||||
warning("Cannot find sun/jkernel/DownloadManager");
|
||||
}
|
||||
#endif // KERNEL
|
||||
|
||||
{ // Compute whether we should use loadClass or loadClassInternal when loading classes.
|
||||
Method* method = InstanceKlass::cast(ClassLoader_klass())->find_method(vmSymbols::loadClassInternal_name(), vmSymbols::string_class_signature());
|
||||
_has_loadClassInternal = (method != NULL);
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
/*
|
||||
* Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved.
|
||||
* Copyright (c) 1997, 2013, 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
|
||||
|
@ -168,8 +168,6 @@ class SymbolPropertyTable;
|
|||
/* It's okay if this turns out to be NULL in non-1.4 JDKs. */ \
|
||||
do_klass(nio_Buffer_klass, java_nio_Buffer, Opt ) \
|
||||
\
|
||||
do_klass(DownloadManager_klass, sun_jkernel_DownloadManager, Opt_Kernel ) \
|
||||
\
|
||||
do_klass(PostVMInitHook_klass, sun_misc_PostVMInitHook, Opt ) \
|
||||
\
|
||||
/* Preload boxing klasses */ \
|
||||
|
@ -211,7 +209,6 @@ class SystemDictionary : AllStatic {
|
|||
Opt, // preload tried; NULL if not present
|
||||
Opt_Only_JDK14NewRef, // preload tried; use only with NewReflection
|
||||
Opt_Only_JDK15, // preload tried; use only with JDK1.5+
|
||||
Opt_Kernel, // preload tried only #ifdef KERNEL
|
||||
OPTION_LIMIT,
|
||||
CEIL_LG_OPTION_LIMIT = 4 // OPTION_LIMIT <= (1<<CEIL_LG_OPTION_LIMIT)
|
||||
};
|
||||
|
@ -394,7 +391,6 @@ public:
|
|||
static Klass* check_klass_Pre( Klass* k) { return check_klass(k); }
|
||||
static Klass* check_klass_Pre_JSR292(Klass* k) { return EnableInvokeDynamic ? check_klass(k) : k; }
|
||||
static Klass* check_klass_Opt( Klass* k) { return k; }
|
||||
static Klass* check_klass_Opt_Kernel(Klass* k) { return k; } //== Opt
|
||||
static Klass* check_klass_Opt_Only_JDK15(Klass* k) {
|
||||
assert(JDK_Version::is_gte_jdk15x_version(), "JDK 1.5 only");
|
||||
return k;
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
/*
|
||||
* Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved.
|
||||
* Copyright (c) 1997, 2013, 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
|
||||
|
@ -108,7 +108,6 @@
|
|||
template(java_lang_Compiler, "java/lang/Compiler") \
|
||||
template(sun_misc_Signal, "sun/misc/Signal") \
|
||||
template(java_lang_AssertionStatusDirectives, "java/lang/AssertionStatusDirectives") \
|
||||
template(sun_jkernel_DownloadManager, "sun/jkernel/DownloadManager") \
|
||||
template(getBootClassPathEntryForClass_name, "getBootClassPathEntryForClass") \
|
||||
template(sun_misc_PostVMInitHook, "sun/misc/PostVMInitHook") \
|
||||
template(sun_misc_Launcher_ExtClassLoader, "sun/misc/Launcher$ExtClassLoader") \
|
||||
|
@ -735,6 +734,11 @@
|
|||
do_intrinsic(_checkIndex, java_nio_Buffer, checkIndex_name, int_int_signature, F_R) \
|
||||
do_name( checkIndex_name, "checkIndex") \
|
||||
\
|
||||
do_class(sun_nio_cs_iso8859_1_Encoder, "sun/nio/cs/ISO_8859_1$Encoder") \
|
||||
do_intrinsic(_encodeISOArray, sun_nio_cs_iso8859_1_Encoder, encodeISOArray_name, encodeISOArray_signature, F_S) \
|
||||
do_name( encodeISOArray_name, "encodeISOArray") \
|
||||
do_signature(encodeISOArray_signature, "([CI[BII)I") \
|
||||
\
|
||||
/* java/lang/ref/Reference */ \
|
||||
do_intrinsic(_Reference_get, java_lang_ref_Reference, get_name, void_object_signature, F_R) \
|
||||
\
|
||||
|
|
|
@ -542,17 +542,17 @@ void print_register_type(OopMapValue::oop_types x, VMReg optional,
|
|||
st->print("Oop");
|
||||
break;
|
||||
case OopMapValue::value_value:
|
||||
st->print("Value" );
|
||||
st->print("Value");
|
||||
break;
|
||||
case OopMapValue::narrowoop_value:
|
||||
tty->print("NarrowOop" );
|
||||
st->print("NarrowOop");
|
||||
break;
|
||||
case OopMapValue::callee_saved_value:
|
||||
st->print("Callers_" );
|
||||
st->print("Callers_");
|
||||
optional->print_on(st);
|
||||
break;
|
||||
case OopMapValue::derived_oop_value:
|
||||
st->print("Derived_oop_" );
|
||||
st->print("Derived_oop_");
|
||||
optional->print_on(st);
|
||||
break;
|
||||
default:
|
||||
|
|
|
@ -131,17 +131,23 @@ void WorkerDataArray<T>::print(int level, const char* title) {
|
|||
|
||||
#ifndef PRODUCT
|
||||
|
||||
template <> const int WorkerDataArray<int>::_uninitialized = -1;
|
||||
template <> const double WorkerDataArray<double>::_uninitialized = -1.0;
|
||||
template <> const size_t WorkerDataArray<size_t>::_uninitialized = (size_t)-1;
|
||||
|
||||
template <class T>
|
||||
void WorkerDataArray<T>::reset() {
|
||||
for (uint i = 0; i < _length; i++) {
|
||||
_data[i] = (T)-1;
|
||||
_data[i] = (T)_uninitialized;
|
||||
}
|
||||
}
|
||||
|
||||
template <class T>
|
||||
void WorkerDataArray<T>::verify() {
|
||||
for (uint i = 0; i < _length; i++) {
|
||||
assert(_data[i] >= (T)0, err_msg("Invalid data for worker %d", i));
|
||||
assert(_data[i] != _uninitialized,
|
||||
err_msg("Invalid data for worker " UINT32_FORMAT ", data: %lf, uninitialized: %lf",
|
||||
i, (double)_data[i], (double)_uninitialized));
|
||||
}
|
||||
}
|
||||
|
||||
|
@ -201,20 +207,20 @@ void G1GCPhaseTimes::note_gc_end() {
|
|||
_last_termination_attempts.verify();
|
||||
_last_gc_worker_end_times_ms.verify();
|
||||
|
||||
for (uint i = 0; i < _active_gc_threads; i++) {
|
||||
double worker_time = _last_gc_worker_end_times_ms.get(i) - _last_gc_worker_start_times_ms.get(i);
|
||||
_last_gc_worker_times_ms.set(i, worker_time);
|
||||
for (uint i = 0; i < _active_gc_threads; i++) {
|
||||
double worker_time = _last_gc_worker_end_times_ms.get(i) - _last_gc_worker_start_times_ms.get(i);
|
||||
_last_gc_worker_times_ms.set(i, worker_time);
|
||||
|
||||
double worker_known_time = _last_ext_root_scan_times_ms.get(i) +
|
||||
_last_satb_filtering_times_ms.get(i) +
|
||||
_last_update_rs_times_ms.get(i) +
|
||||
_last_scan_rs_times_ms.get(i) +
|
||||
_last_obj_copy_times_ms.get(i) +
|
||||
_last_termination_times_ms.get(i);
|
||||
double worker_known_time = _last_ext_root_scan_times_ms.get(i) +
|
||||
_last_satb_filtering_times_ms.get(i) +
|
||||
_last_update_rs_times_ms.get(i) +
|
||||
_last_scan_rs_times_ms.get(i) +
|
||||
_last_obj_copy_times_ms.get(i) +
|
||||
_last_termination_times_ms.get(i);
|
||||
|
||||
double worker_other_time = worker_time - worker_known_time;
|
||||
_last_gc_worker_other_times_ms.set(i, worker_other_time);
|
||||
}
|
||||
double worker_other_time = worker_time - worker_known_time;
|
||||
_last_gc_worker_other_times_ms.set(i, worker_other_time);
|
||||
}
|
||||
|
||||
_last_gc_worker_times_ms.verify();
|
||||
_last_gc_worker_other_times_ms.verify();
|
||||
|
|
|
@ -35,6 +35,8 @@ class WorkerDataArray : public CHeapObj<mtGC> {
|
|||
const char* _print_format;
|
||||
bool _print_sum;
|
||||
|
||||
NOT_PRODUCT(static const T _uninitialized;)
|
||||
|
||||
// We are caching the sum and average to only have to calculate them once.
|
||||
// This is not done in an MT-safe way. It is intetened to allow single
|
||||
// threaded code to call sum() and average() multiple times in any order
|
||||
|
|
|
@ -1099,32 +1099,9 @@ bool ConstantPool::compare_entry_to(int index1, constantPoolHandle cp2,
|
|||
} // end compare_entry_to()
|
||||
|
||||
|
||||
// Copy this constant pool's entries at start_i to end_i (inclusive)
|
||||
// to the constant pool to_cp's entries starting at to_i. A total of
|
||||
// (end_i - start_i) + 1 entries are copied.
|
||||
void ConstantPool::copy_cp_to_impl(constantPoolHandle from_cp, int start_i, int end_i,
|
||||
constantPoolHandle to_cp, int to_i, TRAPS) {
|
||||
|
||||
int dest_i = to_i; // leave original alone for debug purposes
|
||||
|
||||
for (int src_i = start_i; src_i <= end_i; /* see loop bottom */ ) {
|
||||
copy_entry_to(from_cp, src_i, to_cp, dest_i, CHECK);
|
||||
|
||||
switch (from_cp->tag_at(src_i).value()) {
|
||||
case JVM_CONSTANT_Double:
|
||||
case JVM_CONSTANT_Long:
|
||||
// double and long take two constant pool entries
|
||||
src_i += 2;
|
||||
dest_i += 2;
|
||||
break;
|
||||
|
||||
default:
|
||||
// all others take one constant pool entry
|
||||
src_i++;
|
||||
dest_i++;
|
||||
break;
|
||||
}
|
||||
}
|
||||
void ConstantPool::copy_operands(constantPoolHandle from_cp,
|
||||
constantPoolHandle to_cp,
|
||||
TRAPS) {
|
||||
|
||||
int from_oplen = operand_array_length(from_cp->operands());
|
||||
int old_oplen = operand_array_length(to_cp->operands());
|
||||
|
@ -1180,8 +1157,39 @@ void ConstantPool::copy_cp_to_impl(constantPoolHandle from_cp, int start_i, int
|
|||
to_cp->set_operands(new_operands);
|
||||
}
|
||||
}
|
||||
} // end copy_operands()
|
||||
|
||||
} // end copy_cp_to()
|
||||
|
||||
// Copy this constant pool's entries at start_i to end_i (inclusive)
|
||||
// to the constant pool to_cp's entries starting at to_i. A total of
|
||||
// (end_i - start_i) + 1 entries are copied.
|
||||
void ConstantPool::copy_cp_to_impl(constantPoolHandle from_cp, int start_i, int end_i,
|
||||
constantPoolHandle to_cp, int to_i, TRAPS) {
|
||||
|
||||
|
||||
int dest_i = to_i; // leave original alone for debug purposes
|
||||
|
||||
for (int src_i = start_i; src_i <= end_i; /* see loop bottom */ ) {
|
||||
copy_entry_to(from_cp, src_i, to_cp, dest_i, CHECK);
|
||||
|
||||
switch (from_cp->tag_at(src_i).value()) {
|
||||
case JVM_CONSTANT_Double:
|
||||
case JVM_CONSTANT_Long:
|
||||
// double and long take two constant pool entries
|
||||
src_i += 2;
|
||||
dest_i += 2;
|
||||
break;
|
||||
|
||||
default:
|
||||
// all others take one constant pool entry
|
||||
src_i++;
|
||||
dest_i++;
|
||||
break;
|
||||
}
|
||||
}
|
||||
copy_operands(from_cp, to_cp, CHECK);
|
||||
|
||||
} // end copy_cp_to_impl()
|
||||
|
||||
|
||||
// Copy this constant pool's entry at from_i to the constant pool
|
||||
|
|
|
@ -786,6 +786,7 @@ class ConstantPool : public Metadata {
|
|||
}
|
||||
static void copy_cp_to_impl(constantPoolHandle from_cp, int start_i, int end_i, constantPoolHandle to_cp, int to_i, TRAPS);
|
||||
static void copy_entry_to(constantPoolHandle from_cp, int from_i, constantPoolHandle to_cp, int to_i, TRAPS);
|
||||
static void copy_operands(constantPoolHandle from_cp, constantPoolHandle to_cp, TRAPS);
|
||||
int find_matching_entry(int pattern_i, constantPoolHandle search_cp, TRAPS);
|
||||
int version() const { return _saved._version; }
|
||||
void set_version(int version) { _saved._version = version; }
|
||||
|
|
|
@ -516,6 +516,9 @@
|
|||
develop(bool, SpecialArraysEquals, true, \
|
||||
"special version of Arrays.equals(char[],char[])") \
|
||||
\
|
||||
product(bool, SpecialEncodeISOArray, true, \
|
||||
"special version of ISO_8859_1$Encoder.encodeISOArray") \
|
||||
\
|
||||
develop(bool, BailoutToInterpreterForThrows, false, \
|
||||
"Compiled methods which throws/catches exceptions will be " \
|
||||
"deopt and intp.") \
|
||||
|
|
|
@ -165,13 +165,13 @@ uint ReturnNode::match_edge(uint idx) const {
|
|||
|
||||
|
||||
#ifndef PRODUCT
|
||||
void ReturnNode::dump_req() const {
|
||||
void ReturnNode::dump_req(outputStream *st) const {
|
||||
// Dump the required inputs, enclosed in '(' and ')'
|
||||
uint i; // Exit value of loop
|
||||
for( i=0; i<req(); i++ ) { // For all required inputs
|
||||
if( i == TypeFunc::Parms ) tty->print("returns");
|
||||
if( in(i) ) tty->print("%c%d ", Compile::current()->node_arena()->contains(in(i)) ? ' ' : 'o', in(i)->_idx);
|
||||
else tty->print("_ ");
|
||||
for (i = 0; i < req(); i++) { // For all required inputs
|
||||
if (i == TypeFunc::Parms) st->print("returns");
|
||||
if (in(i)) st->print("%c%d ", Compile::current()->node_arena()->contains(in(i)) ? ' ' : 'o', in(i)->_idx);
|
||||
else st->print("_ ");
|
||||
}
|
||||
}
|
||||
#endif
|
||||
|
@ -208,13 +208,13 @@ uint RethrowNode::match_edge(uint idx) const {
|
|||
}
|
||||
|
||||
#ifndef PRODUCT
|
||||
void RethrowNode::dump_req() const {
|
||||
void RethrowNode::dump_req(outputStream *st) const {
|
||||
// Dump the required inputs, enclosed in '(' and ')'
|
||||
uint i; // Exit value of loop
|
||||
for( i=0; i<req(); i++ ) { // For all required inputs
|
||||
if( i == TypeFunc::Parms ) tty->print("exception");
|
||||
if( in(i) ) tty->print("%c%d ", Compile::current()->node_arena()->contains(in(i)) ? ' ' : 'o', in(i)->_idx);
|
||||
else tty->print("_ ");
|
||||
for (i = 0; i < req(); i++) { // For all required inputs
|
||||
if (i == TypeFunc::Parms) st->print("exception");
|
||||
if (in(i)) st->print("%c%d ", Compile::current()->node_arena()->contains(in(i)) ? ' ' : 'o', in(i)->_idx);
|
||||
else st->print("_ ");
|
||||
}
|
||||
}
|
||||
#endif
|
||||
|
@ -330,7 +330,8 @@ static void format_helper( PhaseRegAlloc *regalloc, outputStream* st, Node *n, c
|
|||
st->print(" %s%d]=#ScObj" INT32_FORMAT, msg, i, sco_n);
|
||||
return;
|
||||
}
|
||||
if( OptoReg::is_valid(regalloc->get_reg_first(n))) { // Check for undefined
|
||||
if (regalloc->node_regs_max_index() > 0 &&
|
||||
OptoReg::is_valid(regalloc->get_reg_first(n))) { // Check for undefined
|
||||
char buf[50];
|
||||
regalloc->dump_register(n,buf);
|
||||
st->print(" %s%d]=%s",msg,i,buf);
|
||||
|
@ -381,7 +382,7 @@ static void format_helper( PhaseRegAlloc *regalloc, outputStream* st, Node *n, c
|
|||
//------------------------------format-----------------------------------------
|
||||
void JVMState::format(PhaseRegAlloc *regalloc, const Node *n, outputStream* st) const {
|
||||
st->print(" #");
|
||||
if( _method ) {
|
||||
if (_method) {
|
||||
_method->print_short_name(st);
|
||||
st->print(" @ bci:%d ",_bci);
|
||||
} else {
|
||||
|
@ -393,21 +394,22 @@ void JVMState::format(PhaseRegAlloc *regalloc, const Node *n, outputStream* st)
|
|||
MachSafePointNode *mcall = n->as_MachSafePoint();
|
||||
uint i;
|
||||
// Print locals
|
||||
for( i = 0; i < (uint)loc_size(); i++ )
|
||||
format_helper( regalloc, st, mcall->local(this, i), "L[", i, &scobjs );
|
||||
for (i = 0; i < (uint)loc_size(); i++)
|
||||
format_helper(regalloc, st, mcall->local(this, i), "L[", i, &scobjs);
|
||||
// Print stack
|
||||
for (i = 0; i < (uint)stk_size(); i++) {
|
||||
if ((uint)(_stkoff + i) >= mcall->len())
|
||||
st->print(" oob ");
|
||||
else
|
||||
format_helper( regalloc, st, mcall->stack(this, i), "STK[", i, &scobjs );
|
||||
format_helper(regalloc, st, mcall->stack(this, i), "STK[", i, &scobjs);
|
||||
}
|
||||
for (i = 0; (int)i < nof_monitors(); i++) {
|
||||
Node *box = mcall->monitor_box(this, i);
|
||||
Node *obj = mcall->monitor_obj(this, i);
|
||||
if ( OptoReg::is_valid(regalloc->get_reg_first(box)) ) {
|
||||
if (regalloc->node_regs_max_index() > 0 &&
|
||||
OptoReg::is_valid(regalloc->get_reg_first(box))) {
|
||||
box = BoxLockNode::box_node(box);
|
||||
format_helper( regalloc, st, box, "MON-BOX[", i, &scobjs );
|
||||
format_helper(regalloc, st, box, "MON-BOX[", i, &scobjs);
|
||||
} else {
|
||||
OptoReg::Name box_reg = BoxLockNode::reg(box);
|
||||
st->print(" MON-BOX%d=%s+%d",
|
||||
|
@ -420,7 +422,7 @@ void JVMState::format(PhaseRegAlloc *regalloc, const Node *n, outputStream* st)
|
|||
if (BoxLockNode::box_node(box)->is_eliminated())
|
||||
obj_msg = "MON-OBJ(LOCK ELIMINATED)[";
|
||||
}
|
||||
format_helper( regalloc, st, obj, obj_msg, i, &scobjs );
|
||||
format_helper(regalloc, st, obj, obj_msg, i, &scobjs);
|
||||
}
|
||||
|
||||
for (i = 0; i < (uint)scobjs.length(); i++) {
|
||||
|
@ -463,9 +465,9 @@ void JVMState::format(PhaseRegAlloc *regalloc, const Node *n, outputStream* st)
|
|||
st->print(" [");
|
||||
cifield = iklass->nonstatic_field_at(0);
|
||||
cifield->print_name_on(st);
|
||||
format_helper( regalloc, st, fld_node, ":", 0, &scobjs );
|
||||
format_helper(regalloc, st, fld_node, ":", 0, &scobjs);
|
||||
} else {
|
||||
format_helper( regalloc, st, fld_node, "[", 0, &scobjs );
|
||||
format_helper(regalloc, st, fld_node, "[", 0, &scobjs);
|
||||
}
|
||||
for (uint j = 1; j < nf; j++) {
|
||||
fld_node = mcall->in(first_ind+j);
|
||||
|
@ -473,9 +475,9 @@ void JVMState::format(PhaseRegAlloc *regalloc, const Node *n, outputStream* st)
|
|||
st->print(", [");
|
||||
cifield = iklass->nonstatic_field_at(j);
|
||||
cifield->print_name_on(st);
|
||||
format_helper( regalloc, st, fld_node, ":", j, &scobjs );
|
||||
format_helper(regalloc, st, fld_node, ":", j, &scobjs);
|
||||
} else {
|
||||
format_helper( regalloc, st, fld_node, ", [", j, &scobjs );
|
||||
format_helper(regalloc, st, fld_node, ", [", j, &scobjs);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
@ -483,7 +485,7 @@ void JVMState::format(PhaseRegAlloc *regalloc, const Node *n, outputStream* st)
|
|||
}
|
||||
}
|
||||
st->print_cr("");
|
||||
if (caller() != NULL) caller()->format(regalloc, n, st);
|
||||
if (caller() != NULL) caller()->format(regalloc, n, st);
|
||||
}
|
||||
|
||||
|
||||
|
@ -586,15 +588,15 @@ JVMState* JVMState::clone_deep(Compile* C) const {
|
|||
uint CallNode::cmp( const Node &n ) const
|
||||
{ return _tf == ((CallNode&)n)._tf && _jvms == ((CallNode&)n)._jvms; }
|
||||
#ifndef PRODUCT
|
||||
void CallNode::dump_req() const {
|
||||
void CallNode::dump_req(outputStream *st) const {
|
||||
// Dump the required inputs, enclosed in '(' and ')'
|
||||
uint i; // Exit value of loop
|
||||
for( i=0; i<req(); i++ ) { // For all required inputs
|
||||
if( i == TypeFunc::Parms ) tty->print("(");
|
||||
if( in(i) ) tty->print("%c%d ", Compile::current()->node_arena()->contains(in(i)) ? ' ' : 'o', in(i)->_idx);
|
||||
else tty->print("_ ");
|
||||
for (i = 0; i < req(); i++) { // For all required inputs
|
||||
if (i == TypeFunc::Parms) st->print("(");
|
||||
if (in(i)) st->print("%c%d ", Compile::current()->node_arena()->contains(in(i)) ? ' ' : 'o', in(i)->_idx);
|
||||
else st->print("_ ");
|
||||
}
|
||||
tty->print(")");
|
||||
st->print(")");
|
||||
}
|
||||
|
||||
void CallNode::dump_spec(outputStream *st) const {
|
||||
|
|
|
@ -126,7 +126,7 @@ public:
|
|||
virtual uint ideal_reg() const { return NotAMachineReg; }
|
||||
virtual uint match_edge(uint idx) const;
|
||||
#ifndef PRODUCT
|
||||
virtual void dump_req() const;
|
||||
virtual void dump_req(outputStream *st = tty) const;
|
||||
#endif
|
||||
};
|
||||
|
||||
|
@ -147,7 +147,7 @@ class RethrowNode : public Node {
|
|||
virtual uint match_edge(uint idx) const;
|
||||
virtual uint ideal_reg() const { return NotAMachineReg; }
|
||||
#ifndef PRODUCT
|
||||
virtual void dump_req() const;
|
||||
virtual void dump_req(outputStream *st = tty) const;
|
||||
#endif
|
||||
};
|
||||
|
||||
|
@ -579,7 +579,7 @@ public:
|
|||
virtual uint match_edge(uint idx) const;
|
||||
|
||||
#ifndef PRODUCT
|
||||
virtual void dump_req() const;
|
||||
virtual void dump_req(outputStream *st = tty) const;
|
||||
virtual void dump_spec(outputStream *st) const;
|
||||
#endif
|
||||
};
|
||||
|
|
|
@ -127,6 +127,7 @@ macro(DivL)
|
|||
macro(DivMod)
|
||||
macro(DivModI)
|
||||
macro(DivModL)
|
||||
macro(EncodeISOArray)
|
||||
macro(EncodeP)
|
||||
macro(EncodePKlass)
|
||||
macro(ExpD)
|
||||
|
|
|
@ -523,7 +523,8 @@ void ConnectionGraph::add_node_to_connection_graph(Node *n, Unique_Node_List *de
|
|||
case Op_AryEq:
|
||||
case Op_StrComp:
|
||||
case Op_StrEquals:
|
||||
case Op_StrIndexOf: {
|
||||
case Op_StrIndexOf:
|
||||
case Op_EncodeISOArray: {
|
||||
add_local_var(n, PointsToNode::ArgEscape);
|
||||
delayed_worklist->push(n); // Process it later.
|
||||
break;
|
||||
|
@ -701,7 +702,8 @@ void ConnectionGraph::add_final_edges(Node *n) {
|
|||
case Op_AryEq:
|
||||
case Op_StrComp:
|
||||
case Op_StrEquals:
|
||||
case Op_StrIndexOf: {
|
||||
case Op_StrIndexOf:
|
||||
case Op_EncodeISOArray: {
|
||||
// char[] arrays passed to string intrinsic do not escape but
|
||||
// they are not scalar replaceable. Adjust escape state for them.
|
||||
// Start from in(2) edge since in(1) is memory edge.
|
||||
|
@ -2581,15 +2583,22 @@ Node* ConnectionGraph::find_inst_mem(Node *orig_mem, int alias_idx, GrowableArra
|
|||
}
|
||||
// Otherwise skip it (the call updated 'result' value).
|
||||
} else if (result->Opcode() == Op_SCMemProj) {
|
||||
assert(result->in(0)->is_LoadStore(), "sanity");
|
||||
const Type *at = igvn->type(result->in(0)->in(MemNode::Address));
|
||||
Node* mem = result->in(0);
|
||||
Node* adr = NULL;
|
||||
if (mem->is_LoadStore()) {
|
||||
adr = mem->in(MemNode::Address);
|
||||
} else {
|
||||
assert(mem->Opcode() == Op_EncodeISOArray, "sanity");
|
||||
adr = mem->in(3); // Memory edge corresponds to destination array
|
||||
}
|
||||
const Type *at = igvn->type(adr);
|
||||
if (at != Type::TOP) {
|
||||
assert (at->isa_ptr() != NULL, "pointer type required.");
|
||||
int idx = C->get_alias_index(at->is_ptr());
|
||||
assert(idx != alias_idx, "Object is not scalar replaceable if a LoadStore node access its field");
|
||||
break;
|
||||
}
|
||||
result = result->in(0)->in(MemNode::Memory);
|
||||
result = mem->in(MemNode::Memory);
|
||||
}
|
||||
}
|
||||
if (result->is_Phi()) {
|
||||
|
@ -2927,6 +2936,11 @@ void ConnectionGraph::split_unique_types(GrowableArray<Node *> &alloc_worklist)
|
|||
if (m->is_MergeMem()) {
|
||||
assert(_mergemem_worklist.contains(m->as_MergeMem()), "EA: missing MergeMem node in the worklist");
|
||||
}
|
||||
} else if (use->Opcode() == Op_EncodeISOArray) {
|
||||
if (use->in(MemNode::Memory) == n || use->in(3) == n) {
|
||||
// EncodeISOArray overwrites destination array
|
||||
memnode_worklist.append_if_missing(use);
|
||||
}
|
||||
} else {
|
||||
uint op = use->Opcode();
|
||||
if (!(op == Op_CmpP || op == Op_Conv2B ||
|
||||
|
@ -2962,6 +2976,16 @@ void ConnectionGraph::split_unique_types(GrowableArray<Node *> &alloc_worklist)
|
|||
n = n->as_MemBar()->proj_out(TypeFunc::Memory);
|
||||
if (n == NULL)
|
||||
continue;
|
||||
} else if (n->Opcode() == Op_EncodeISOArray) {
|
||||
// get the memory projection
|
||||
for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) {
|
||||
Node *use = n->fast_out(i);
|
||||
if (use->Opcode() == Op_SCMemProj) {
|
||||
n = use;
|
||||
break;
|
||||
}
|
||||
}
|
||||
assert(n->Opcode() == Op_SCMemProj, "memory projection required");
|
||||
} else {
|
||||
assert(n->is_Mem(), "memory node required.");
|
||||
Node *addr = n->in(MemNode::Address);
|
||||
|
@ -2999,7 +3023,7 @@ void ConnectionGraph::split_unique_types(GrowableArray<Node *> &alloc_worklist)
|
|||
Node *use = n->fast_out(i);
|
||||
if (use->is_Phi() || use->is_ClearArray()) {
|
||||
memnode_worklist.append_if_missing(use);
|
||||
} else if(use->is_Mem() && use->in(MemNode::Memory) == n) {
|
||||
} else if (use->is_Mem() && use->in(MemNode::Memory) == n) {
|
||||
if (use->Opcode() == Op_StoreCM) // Ignore cardmark stores
|
||||
continue;
|
||||
memnode_worklist.append_if_missing(use);
|
||||
|
@ -3010,6 +3034,11 @@ void ConnectionGraph::split_unique_types(GrowableArray<Node *> &alloc_worklist)
|
|||
assert(use->in(MemNode::Memory) != n, "EA: missing memory path");
|
||||
} else if (use->is_MergeMem()) {
|
||||
assert(_mergemem_worklist.contains(use->as_MergeMem()), "EA: missing MergeMem node in the worklist");
|
||||
} else if (use->Opcode() == Op_EncodeISOArray) {
|
||||
if (use->in(MemNode::Memory) == n || use->in(3) == n) {
|
||||
// EncodeISOArray overwrites destination array
|
||||
memnode_worklist.append_if_missing(use);
|
||||
}
|
||||
} else {
|
||||
uint op = use->Opcode();
|
||||
if (!(op == Op_StoreCM ||
|
||||
|
|
|
@ -175,6 +175,7 @@ void Block::implicit_null_check(PhaseCFG *cfg, Node *proj, Node *val, int allowe
|
|||
case Op_StrEquals:
|
||||
case Op_StrIndexOf:
|
||||
case Op_AryEq:
|
||||
case Op_EncodeISOArray:
|
||||
// Not a legit memory op for implicit null check regardless of
|
||||
// embedded loads
|
||||
continue;
|
||||
|
|
|
@ -290,6 +290,7 @@ class LibraryCallKit : public GraphKit {
|
|||
bool inline_cipherBlockChaining_AESCrypt(vmIntrinsics::ID id);
|
||||
Node* inline_cipherBlockChaining_AESCrypt_predicate(bool decrypting);
|
||||
Node* get_key_start_from_aescrypt_object(Node* aescrypt_object);
|
||||
bool inline_encodeISOArray();
|
||||
};
|
||||
|
||||
|
||||
|
@ -381,6 +382,10 @@ CallGenerator* Compile::make_vm_intrinsic(ciMethod* m, bool is_virtual) {
|
|||
// These also use the arraycopy intrinsic mechanism:
|
||||
if (!InlineArrayCopy) return NULL;
|
||||
break;
|
||||
case vmIntrinsics::_encodeISOArray:
|
||||
if (!SpecialEncodeISOArray) return NULL;
|
||||
if (!Matcher::match_rule_supported(Op_EncodeISOArray)) return NULL;
|
||||
break;
|
||||
case vmIntrinsics::_checkIndex:
|
||||
// We do not intrinsify this. The optimizer does fine with it.
|
||||
return NULL;
|
||||
|
@ -799,6 +804,9 @@ bool LibraryCallKit::try_to_inline() {
|
|||
case vmIntrinsics::_cipherBlockChaining_decryptAESCrypt:
|
||||
return inline_cipherBlockChaining_AESCrypt(intrinsic_id());
|
||||
|
||||
case vmIntrinsics::_encodeISOArray:
|
||||
return inline_encodeISOArray();
|
||||
|
||||
default:
|
||||
// If you get here, it may be that someone has added a new intrinsic
|
||||
// to the list in vmSymbols.hpp without implementing it here.
|
||||
|
@ -5368,6 +5376,47 @@ LibraryCallKit::generate_unchecked_arraycopy(const TypePtr* adr_type,
|
|||
src_start, dest_start, copy_length XTOP);
|
||||
}
|
||||
|
||||
//-------------inline_encodeISOArray-----------------------------------
|
||||
// encode char[] to byte[] in ISO_8859_1
|
||||
bool LibraryCallKit::inline_encodeISOArray() {
|
||||
assert(callee()->signature()->size() == 5, "encodeISOArray has 5 parameters");
|
||||
// no receiver since it is static method
|
||||
Node *src = argument(0);
|
||||
Node *src_offset = argument(1);
|
||||
Node *dst = argument(2);
|
||||
Node *dst_offset = argument(3);
|
||||
Node *length = argument(4);
|
||||
|
||||
const Type* src_type = src->Value(&_gvn);
|
||||
const Type* dst_type = dst->Value(&_gvn);
|
||||
const TypeAryPtr* top_src = src_type->isa_aryptr();
|
||||
const TypeAryPtr* top_dest = dst_type->isa_aryptr();
|
||||
if (top_src == NULL || top_src->klass() == NULL ||
|
||||
top_dest == NULL || top_dest->klass() == NULL) {
|
||||
// failed array check
|
||||
return false;
|
||||
}
|
||||
|
||||
// Figure out the size and type of the elements we will be copying.
|
||||
BasicType src_elem = src_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
|
||||
BasicType dst_elem = dst_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
|
||||
if (src_elem != T_CHAR || dst_elem != T_BYTE) {
|
||||
return false;
|
||||
}
|
||||
Node* src_start = array_element_address(src, src_offset, src_elem);
|
||||
Node* dst_start = array_element_address(dst, dst_offset, dst_elem);
|
||||
// 'src_start' points to src array + scaled offset
|
||||
// 'dst_start' points to dst array + scaled offset
|
||||
|
||||
const TypeAryPtr* mtype = TypeAryPtr::BYTES;
|
||||
Node* enc = new (C) EncodeISOArrayNode(control(), memory(mtype), src_start, dst_start, length);
|
||||
enc = _gvn.transform(enc);
|
||||
Node* res_mem = _gvn.transform(new (C) SCMemProjNode(enc));
|
||||
set_memory(res_mem, mtype);
|
||||
set_result(enc);
|
||||
return true;
|
||||
}
|
||||
|
||||
//----------------------------inline_reference_get----------------------------
|
||||
// public T java.lang.ref.Reference.get();
|
||||
bool LibraryCallKit::inline_reference_get() {
|
||||
|
|
|
@ -613,6 +613,7 @@ bool IdealLoopTree::policy_maximally_unroll( PhaseIdealLoop *phase ) const {
|
|||
case Op_StrComp:
|
||||
case Op_StrEquals:
|
||||
case Op_StrIndexOf:
|
||||
case Op_EncodeISOArray:
|
||||
case Op_AryEq: {
|
||||
return false;
|
||||
}
|
||||
|
@ -717,6 +718,7 @@ bool IdealLoopTree::policy_unroll( PhaseIdealLoop *phase ) const {
|
|||
case Op_StrComp:
|
||||
case Op_StrEquals:
|
||||
case Op_StrIndexOf:
|
||||
case Op_EncodeISOArray:
|
||||
case Op_AryEq: {
|
||||
// Do not unroll a loop with String intrinsics code.
|
||||
// String intrinsics are large and have loops.
|
||||
|
|
|
@ -506,7 +506,7 @@ int MachConstantNode::constant_offset() {
|
|||
#ifndef PRODUCT
|
||||
void MachNullCheckNode::format( PhaseRegAlloc *ra_, outputStream *st ) const {
|
||||
int reg = ra_->get_reg_first(in(1)->in(_vidx));
|
||||
tty->print("%s %s", Name(), Matcher::regName[reg]);
|
||||
st->print("%s %s", Name(), Matcher::regName[reg]);
|
||||
}
|
||||
#endif
|
||||
|
||||
|
|
|
@ -361,14 +361,21 @@ static Node *scan_mem_chain(Node *mem, int alias_idx, int offset, Node *start_me
|
|||
}
|
||||
// Otherwise skip it (the call updated 'mem' value).
|
||||
} else if (mem->Opcode() == Op_SCMemProj) {
|
||||
assert(mem->in(0)->is_LoadStore(), "sanity");
|
||||
const TypePtr* atype = mem->in(0)->in(MemNode::Address)->bottom_type()->is_ptr();
|
||||
mem = mem->in(0);
|
||||
Node* adr = NULL;
|
||||
if (mem->is_LoadStore()) {
|
||||
adr = mem->in(MemNode::Address);
|
||||
} else {
|
||||
assert(mem->Opcode() == Op_EncodeISOArray, "sanity");
|
||||
adr = mem->in(3); // Destination array
|
||||
}
|
||||
const TypePtr* atype = adr->bottom_type()->is_ptr();
|
||||
int adr_idx = Compile::current()->get_alias_index(atype);
|
||||
if (adr_idx == alias_idx) {
|
||||
assert(false, "Object is not scalar replaceable if a LoadStore node access its field");
|
||||
return NULL;
|
||||
}
|
||||
mem = mem->in(0)->in(MemNode::Memory);
|
||||
mem = mem->in(MemNode::Memory);
|
||||
} else {
|
||||
return mem;
|
||||
}
|
||||
|
@ -445,7 +452,7 @@ Node *PhaseMacroExpand::value_from_mem_phi(Node *mem, BasicType ft, const Type *
|
|||
}
|
||||
values.at_put(j, val);
|
||||
} else if (val->Opcode() == Op_SCMemProj) {
|
||||
assert(val->in(0)->is_LoadStore(), "sanity");
|
||||
assert(val->in(0)->is_LoadStore() || val->in(0)->Opcode() == Op_EncodeISOArray, "sanity");
|
||||
assert(false, "Object is not scalar replaceable if a LoadStore node access its field");
|
||||
return NULL;
|
||||
} else {
|
||||
|
|
|
@ -919,6 +919,7 @@ static void match_alias_type(Compile* C, Node* n, Node* m) {
|
|||
case Op_AryEq:
|
||||
case Op_MemBarVolatile:
|
||||
case Op_MemBarCPUOrder: // %%% these ideals should have narrower adr_type?
|
||||
case Op_EncodeISOArray:
|
||||
nidx = Compile::AliasIdxTop;
|
||||
nat = NULL;
|
||||
break;
|
||||
|
@ -1982,6 +1983,7 @@ void Matcher::find_shared( Node *n ) {
|
|||
case Op_StrEquals:
|
||||
case Op_StrIndexOf:
|
||||
case Op_AryEq:
|
||||
case Op_EncodeISOArray:
|
||||
set_shared(n); // Force result into register (it will be anyways)
|
||||
break;
|
||||
case Op_ConP: { // Convert pointers above the centerline to NUL
|
||||
|
@ -2183,6 +2185,13 @@ void Matcher::find_shared( Node *n ) {
|
|||
n->del_req(4);
|
||||
break;
|
||||
}
|
||||
case Op_EncodeISOArray: {
|
||||
// Restructure into a binary tree for Matching.
|
||||
Node* pair = new (C) BinaryNode(n->in(3), n->in(4));
|
||||
n->set_req(3, pair);
|
||||
n->del_req(4);
|
||||
break;
|
||||
}
|
||||
default:
|
||||
break;
|
||||
}
|
||||
|
|
|
@ -2796,6 +2796,26 @@ const Type *StrIntrinsicNode::Value( PhaseTransform *phase ) const {
|
|||
return bottom_type();
|
||||
}
|
||||
|
||||
//=============================================================================
|
||||
//------------------------------match_edge-------------------------------------
|
||||
// Do not match memory edge
|
||||
uint EncodeISOArrayNode::match_edge(uint idx) const {
|
||||
return idx == 2 || idx == 3; // EncodeISOArray src (Binary dst len)
|
||||
}
|
||||
|
||||
//------------------------------Ideal------------------------------------------
|
||||
// Return a node which is more "ideal" than the current node. Strip out
|
||||
// control copies
|
||||
Node *EncodeISOArrayNode::Ideal(PhaseGVN *phase, bool can_reshape) {
|
||||
return remove_dead_region(phase, can_reshape) ? this : NULL;
|
||||
}
|
||||
|
||||
//------------------------------Value------------------------------------------
|
||||
const Type *EncodeISOArrayNode::Value(PhaseTransform *phase) const {
|
||||
if (in(0) && phase->type(in(0)) == Type::TOP) return Type::TOP;
|
||||
return bottom_type();
|
||||
}
|
||||
|
||||
//=============================================================================
|
||||
MemBarNode::MemBarNode(Compile* C, int alias_idx, Node* precedent)
|
||||
: MultiNode(TypeFunc::Parms + (precedent == NULL? 0: 1)),
|
||||
|
|
|
@ -888,6 +888,22 @@ public:
|
|||
virtual const Type* bottom_type() const { return TypeInt::BOOL; }
|
||||
};
|
||||
|
||||
|
||||
//------------------------------EncodeISOArray--------------------------------
|
||||
// encode char[] to byte[] in ISO_8859_1
|
||||
class EncodeISOArrayNode: public Node {
|
||||
public:
|
||||
EncodeISOArrayNode(Node *control, Node* arymem, Node* s1, Node* s2, Node* c): Node(control, arymem, s1, s2, c) {};
|
||||
virtual int Opcode() const;
|
||||
virtual bool depends_only_on_test() const { return false; }
|
||||
virtual const Type* bottom_type() const { return TypeInt::INT; }
|
||||
virtual const TypePtr* adr_type() const { return TypePtr::BOTTOM; }
|
||||
virtual uint match_edge(uint idx) const;
|
||||
virtual uint ideal_reg() const { return Op_RegI; }
|
||||
virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
|
||||
virtual const Type *Value(PhaseTransform *phase) const;
|
||||
};
|
||||
|
||||
//------------------------------MemBar-----------------------------------------
|
||||
// There are different flavors of Memory Barriers to match the Java Memory
|
||||
// Model. Monitor-enter and volatile-load act as Aquires: no following ref
|
||||
|
|
|
@ -1476,35 +1476,35 @@ static bool is_disconnected(const Node* n) {
|
|||
}
|
||||
|
||||
#ifdef ASSERT
|
||||
static void dump_orig(Node* orig) {
|
||||
static void dump_orig(Node* orig, outputStream *st) {
|
||||
Compile* C = Compile::current();
|
||||
if (NotANode(orig)) orig = NULL;
|
||||
if (orig != NULL && !C->node_arena()->contains(orig)) orig = NULL;
|
||||
if (orig == NULL) return;
|
||||
tty->print(" !orig=");
|
||||
if (NotANode(orig)) orig = NULL;
|
||||
if (orig != NULL && !C->node_arena()->contains(orig)) orig = NULL;
|
||||
if (orig == NULL) return;
|
||||
st->print(" !orig=");
|
||||
Node* fast = orig->debug_orig(); // tortoise & hare algorithm to detect loops
|
||||
if (NotANode(fast)) fast = NULL;
|
||||
if (NotANode(fast)) fast = NULL;
|
||||
while (orig != NULL) {
|
||||
bool discon = is_disconnected(orig); // if discon, print [123] else 123
|
||||
if (discon) tty->print("[");
|
||||
if (discon) st->print("[");
|
||||
if (!Compile::current()->node_arena()->contains(orig))
|
||||
tty->print("o");
|
||||
tty->print("%d", orig->_idx);
|
||||
if (discon) tty->print("]");
|
||||
st->print("o");
|
||||
st->print("%d", orig->_idx);
|
||||
if (discon) st->print("]");
|
||||
orig = orig->debug_orig();
|
||||
if (NotANode(orig)) orig = NULL;
|
||||
if (orig != NULL && !C->node_arena()->contains(orig)) orig = NULL;
|
||||
if (orig != NULL) tty->print(",");
|
||||
if (NotANode(orig)) orig = NULL;
|
||||
if (orig != NULL && !C->node_arena()->contains(orig)) orig = NULL;
|
||||
if (orig != NULL) st->print(",");
|
||||
if (fast != NULL) {
|
||||
// Step fast twice for each single step of orig:
|
||||
fast = fast->debug_orig();
|
||||
if (NotANode(fast)) fast = NULL;
|
||||
if (NotANode(fast)) fast = NULL;
|
||||
if (fast != NULL && fast != orig) {
|
||||
fast = fast->debug_orig();
|
||||
if (NotANode(fast)) fast = NULL;
|
||||
if (NotANode(fast)) fast = NULL;
|
||||
}
|
||||
if (fast == orig) {
|
||||
tty->print("...");
|
||||
st->print("...");
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
@ -1531,35 +1531,34 @@ void Node::set_debug_orig(Node* orig) {
|
|||
|
||||
//------------------------------dump------------------------------------------
|
||||
// Dump a Node
|
||||
void Node::dump() const {
|
||||
void Node::dump(const char* suffix, outputStream *st) const {
|
||||
Compile* C = Compile::current();
|
||||
bool is_new = C->node_arena()->contains(this);
|
||||
_in_dump_cnt++;
|
||||
tty->print("%c%d\t%s\t=== ",
|
||||
is_new ? ' ' : 'o', _idx, Name());
|
||||
st->print("%c%d\t%s\t=== ", is_new ? ' ' : 'o', _idx, Name());
|
||||
|
||||
// Dump the required and precedence inputs
|
||||
dump_req();
|
||||
dump_prec();
|
||||
dump_req(st);
|
||||
dump_prec(st);
|
||||
// Dump the outputs
|
||||
dump_out();
|
||||
dump_out(st);
|
||||
|
||||
if (is_disconnected(this)) {
|
||||
#ifdef ASSERT
|
||||
tty->print(" [%d]",debug_idx());
|
||||
dump_orig(debug_orig());
|
||||
st->print(" [%d]",debug_idx());
|
||||
dump_orig(debug_orig(), st);
|
||||
#endif
|
||||
tty->cr();
|
||||
st->cr();
|
||||
_in_dump_cnt--;
|
||||
return; // don't process dead nodes
|
||||
}
|
||||
|
||||
// Dump node-specific info
|
||||
dump_spec(tty);
|
||||
dump_spec(st);
|
||||
#ifdef ASSERT
|
||||
// Dump the non-reset _debug_idx
|
||||
if( Verbose && WizardMode ) {
|
||||
tty->print(" [%d]",debug_idx());
|
||||
if (Verbose && WizardMode) {
|
||||
st->print(" [%d]",debug_idx());
|
||||
}
|
||||
#endif
|
||||
|
||||
|
@ -1569,88 +1568,88 @@ void Node::dump() const {
|
|||
const TypeInstPtr *toop = t->isa_instptr();
|
||||
const TypeKlassPtr *tkls = t->isa_klassptr();
|
||||
ciKlass* klass = toop ? toop->klass() : (tkls ? tkls->klass() : NULL );
|
||||
if( klass && klass->is_loaded() && klass->is_interface() ) {
|
||||
tty->print(" Interface:");
|
||||
} else if( toop ) {
|
||||
tty->print(" Oop:");
|
||||
} else if( tkls ) {
|
||||
tty->print(" Klass:");
|
||||
if (klass && klass->is_loaded() && klass->is_interface()) {
|
||||
st->print(" Interface:");
|
||||
} else if (toop) {
|
||||
st->print(" Oop:");
|
||||
} else if (tkls) {
|
||||
st->print(" Klass:");
|
||||
}
|
||||
t->dump();
|
||||
} else if( t == Type::MEMORY ) {
|
||||
tty->print(" Memory:");
|
||||
MemNode::dump_adr_type(this, adr_type(), tty);
|
||||
} else if( Verbose || WizardMode ) {
|
||||
tty->print(" Type:");
|
||||
if( t ) {
|
||||
t->dump();
|
||||
t->dump_on(st);
|
||||
} else if (t == Type::MEMORY) {
|
||||
st->print(" Memory:");
|
||||
MemNode::dump_adr_type(this, adr_type(), st);
|
||||
} else if (Verbose || WizardMode) {
|
||||
st->print(" Type:");
|
||||
if (t) {
|
||||
t->dump_on(st);
|
||||
} else {
|
||||
tty->print("no type");
|
||||
st->print("no type");
|
||||
}
|
||||
} else if (t->isa_vect() && this->is_MachSpillCopy()) {
|
||||
// Dump MachSpillcopy vector type.
|
||||
t->dump();
|
||||
t->dump_on(st);
|
||||
}
|
||||
if (is_new) {
|
||||
debug_only(dump_orig(debug_orig()));
|
||||
debug_only(dump_orig(debug_orig(), st));
|
||||
Node_Notes* nn = C->node_notes_at(_idx);
|
||||
if (nn != NULL && !nn->is_clear()) {
|
||||
if (nn->jvms() != NULL) {
|
||||
tty->print(" !jvms:");
|
||||
nn->jvms()->dump_spec(tty);
|
||||
st->print(" !jvms:");
|
||||
nn->jvms()->dump_spec(st);
|
||||
}
|
||||
}
|
||||
}
|
||||
tty->cr();
|
||||
if (suffix) st->print(suffix);
|
||||
_in_dump_cnt--;
|
||||
}
|
||||
|
||||
//------------------------------dump_req--------------------------------------
|
||||
void Node::dump_req() const {
|
||||
void Node::dump_req(outputStream *st) const {
|
||||
// Dump the required input edges
|
||||
for (uint i = 0; i < req(); i++) { // For all required inputs
|
||||
Node* d = in(i);
|
||||
if (d == NULL) {
|
||||
tty->print("_ ");
|
||||
st->print("_ ");
|
||||
} else if (NotANode(d)) {
|
||||
tty->print("NotANode "); // uninitialized, sentinel, garbage, etc.
|
||||
st->print("NotANode "); // uninitialized, sentinel, garbage, etc.
|
||||
} else {
|
||||
tty->print("%c%d ", Compile::current()->node_arena()->contains(d) ? ' ' : 'o', d->_idx);
|
||||
st->print("%c%d ", Compile::current()->node_arena()->contains(d) ? ' ' : 'o', d->_idx);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
//------------------------------dump_prec-------------------------------------
|
||||
void Node::dump_prec() const {
|
||||
void Node::dump_prec(outputStream *st) const {
|
||||
// Dump the precedence edges
|
||||
int any_prec = 0;
|
||||
for (uint i = req(); i < len(); i++) { // For all precedence inputs
|
||||
Node* p = in(i);
|
||||
if (p != NULL) {
|
||||
if( !any_prec++ ) tty->print(" |");
|
||||
if (NotANode(p)) { tty->print("NotANode "); continue; }
|
||||
tty->print("%c%d ", Compile::current()->node_arena()->contains(in(i)) ? ' ' : 'o', in(i)->_idx);
|
||||
if (!any_prec++) st->print(" |");
|
||||
if (NotANode(p)) { st->print("NotANode "); continue; }
|
||||
st->print("%c%d ", Compile::current()->node_arena()->contains(in(i)) ? ' ' : 'o', in(i)->_idx);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
//------------------------------dump_out--------------------------------------
|
||||
void Node::dump_out() const {
|
||||
void Node::dump_out(outputStream *st) const {
|
||||
// Delimit the output edges
|
||||
tty->print(" [[");
|
||||
st->print(" [[");
|
||||
// Dump the output edges
|
||||
for (uint i = 0; i < _outcnt; i++) { // For all outputs
|
||||
Node* u = _out[i];
|
||||
if (u == NULL) {
|
||||
tty->print("_ ");
|
||||
st->print("_ ");
|
||||
} else if (NotANode(u)) {
|
||||
tty->print("NotANode ");
|
||||
st->print("NotANode ");
|
||||
} else {
|
||||
tty->print("%c%d ", Compile::current()->node_arena()->contains(u) ? ' ' : 'o', u->_idx);
|
||||
st->print("%c%d ", Compile::current()->node_arena()->contains(u) ? ' ' : 'o', u->_idx);
|
||||
}
|
||||
}
|
||||
tty->print("]] ");
|
||||
st->print("]] ");
|
||||
}
|
||||
|
||||
//------------------------------dump_nodes-------------------------------------
|
||||
|
|
|
@ -994,12 +994,13 @@ public:
|
|||
#ifndef PRODUCT
|
||||
Node* find(int idx) const; // Search the graph for the given idx.
|
||||
Node* find_ctrl(int idx) const; // Search control ancestors for the given idx.
|
||||
void dump() const; // Print this node,
|
||||
void dump() const { dump("\n"); } // Print this node.
|
||||
void dump(const char* suffix, outputStream *st = tty) const;// Print this node.
|
||||
void dump(int depth) const; // Print this node, recursively to depth d
|
||||
void dump_ctrl(int depth) const; // Print control nodes, to depth d
|
||||
virtual void dump_req() const; // Print required-edge info
|
||||
virtual void dump_prec() const; // Print precedence-edge info
|
||||
virtual void dump_out() const; // Print the output edge info
|
||||
virtual void dump_req(outputStream *st = tty) const; // Print required-edge info
|
||||
virtual void dump_prec(outputStream *st = tty) const; // Print precedence-edge info
|
||||
virtual void dump_out(outputStream *st = tty) const; // Print the output edge info
|
||||
virtual void dump_spec(outputStream *st) const {}; // Print per-node info
|
||||
void verify_edges(Unique_Node_List &visited); // Verify bi-directional edges
|
||||
void verify() const; // Check Def-Use info for my subgraph
|
||||
|
|
|
@ -77,7 +77,7 @@ class OptoReg VALUE_OBJ_CLASS_SPEC {
|
|||
// (We would like to have an operator+ for RegName, but it is not
|
||||
// a class, so this would be illegal in C++.)
|
||||
|
||||
static void dump( int );
|
||||
static void dump(int, outputStream *st = tty);
|
||||
|
||||
// Get the stack slot number of an OptoReg::Name
|
||||
static unsigned int reg2stack( OptoReg::Name r) {
|
||||
|
|
|
@ -40,6 +40,7 @@ PhaseRegAlloc::PhaseRegAlloc( uint unique, PhaseCFG &cfg,
|
|||
Phase(Register_Allocation), _cfg(cfg), _matcher(matcher),
|
||||
_node_oops(Thread::current()->resource_area()),
|
||||
_node_regs(0),
|
||||
_node_regs_max_index(0),
|
||||
_framesize(0xdeadbeef)
|
||||
{
|
||||
int i;
|
||||
|
|
|
@ -108,13 +108,13 @@ int find_hihghest_bit( uint32 mask ) {
|
|||
//------------------------------dump-------------------------------------------
|
||||
|
||||
#ifndef PRODUCT
|
||||
void OptoReg::dump( int r ) {
|
||||
switch( r ) {
|
||||
case Special: tty->print("r---"); break;
|
||||
case Bad: tty->print("rBAD"); break;
|
||||
void OptoReg::dump(int r, outputStream *st) {
|
||||
switch (r) {
|
||||
case Special: st->print("r---"); break;
|
||||
case Bad: st->print("rBAD"); break;
|
||||
default:
|
||||
if( r < _last_Mach_Reg ) tty->print(Matcher::regName[r]);
|
||||
else tty->print("rS%d",r);
|
||||
if (r < _last_Mach_Reg) st->print(Matcher::regName[r]);
|
||||
else st->print("rS%d",r);
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
@ -404,53 +404,53 @@ uint RegMask::Size() const {
|
|||
|
||||
#ifndef PRODUCT
|
||||
//------------------------------print------------------------------------------
|
||||
void RegMask::dump( ) const {
|
||||
tty->print("[");
|
||||
void RegMask::dump(outputStream *st) const {
|
||||
st->print("[");
|
||||
RegMask rm = *this; // Structure copy into local temp
|
||||
|
||||
OptoReg::Name start = rm.find_first_elem(); // Get a register
|
||||
if( OptoReg::is_valid(start) ) { // Check for empty mask
|
||||
if (OptoReg::is_valid(start)) { // Check for empty mask
|
||||
rm.Remove(start); // Yank from mask
|
||||
OptoReg::dump(start); // Print register
|
||||
OptoReg::dump(start, st); // Print register
|
||||
OptoReg::Name last = start;
|
||||
|
||||
// Now I have printed an initial register.
|
||||
// Print adjacent registers as "rX-rZ" instead of "rX,rY,rZ".
|
||||
// Begin looping over the remaining registers.
|
||||
while( 1 ) { //
|
||||
while (1) { //
|
||||
OptoReg::Name reg = rm.find_first_elem(); // Get a register
|
||||
if( !OptoReg::is_valid(reg) )
|
||||
if (!OptoReg::is_valid(reg))
|
||||
break; // Empty mask, end loop
|
||||
rm.Remove(reg); // Yank from mask
|
||||
|
||||
if( last+1 == reg ) { // See if they are adjacent
|
||||
if (last+1 == reg) { // See if they are adjacent
|
||||
// Adjacent registers just collect into long runs, no printing.
|
||||
last = reg;
|
||||
} else { // Ending some kind of run
|
||||
if( start == last ) { // 1-register run; no special printing
|
||||
} else if( start+1 == last ) {
|
||||
tty->print(","); // 2-register run; print as "rX,rY"
|
||||
OptoReg::dump(last);
|
||||
if (start == last) { // 1-register run; no special printing
|
||||
} else if (start+1 == last) {
|
||||
st->print(","); // 2-register run; print as "rX,rY"
|
||||
OptoReg::dump(last, st);
|
||||
} else { // Multi-register run; print as "rX-rZ"
|
||||
tty->print("-");
|
||||
OptoReg::dump(last);
|
||||
st->print("-");
|
||||
OptoReg::dump(last, st);
|
||||
}
|
||||
tty->print(","); // Seperate start of new run
|
||||
st->print(","); // Seperate start of new run
|
||||
start = last = reg; // Start a new register run
|
||||
OptoReg::dump(start); // Print register
|
||||
OptoReg::dump(start, st); // Print register
|
||||
} // End of if ending a register run or not
|
||||
} // End of while regmask not empty
|
||||
|
||||
if( start == last ) { // 1-register run; no special printing
|
||||
} else if( start+1 == last ) {
|
||||
tty->print(","); // 2-register run; print as "rX,rY"
|
||||
OptoReg::dump(last);
|
||||
if (start == last) { // 1-register run; no special printing
|
||||
} else if (start+1 == last) {
|
||||
st->print(","); // 2-register run; print as "rX,rY"
|
||||
OptoReg::dump(last, st);
|
||||
} else { // Multi-register run; print as "rX-rZ"
|
||||
tty->print("-");
|
||||
OptoReg::dump(last);
|
||||
st->print("-");
|
||||
OptoReg::dump(last, st);
|
||||
}
|
||||
if( rm.is_AllStack() ) tty->print("...");
|
||||
if (rm.is_AllStack()) st->print("...");
|
||||
}
|
||||
tty->print("]");
|
||||
st->print("]");
|
||||
}
|
||||
#endif
|
||||
|
|
|
@ -310,7 +310,7 @@ public:
|
|||
|
||||
#ifndef PRODUCT
|
||||
void print() const { dump(); }
|
||||
void dump() const; // Print a mask
|
||||
void dump(outputStream *st = tty) const; // Print a mask
|
||||
#endif
|
||||
|
||||
static const RegMask Empty; // Common empty mask
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
/*
|
||||
* Copyright (c) 2003, 2012, Oracle and/or its affiliates. All rights reserved.
|
||||
* Copyright (c) 2003, 2013, 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
|
||||
|
@ -25,9 +25,7 @@
|
|||
#ifndef SHARE_VM_PRIMS_JNICHECK_HPP
|
||||
#define SHARE_VM_PRIMS_JNICHECK_HPP
|
||||
|
||||
#ifndef KERNEL
|
||||
#include "runtime/thread.hpp"
|
||||
#endif
|
||||
|
||||
extern "C" {
|
||||
// Report a JNI failure caught by -Xcheck:jni. Perform a core dump.
|
||||
|
|
|
@ -4519,10 +4519,6 @@ JVM_ENTRY(void, JVM_GetVersionInfo(JNIEnv* env, jvm_version_info* info, size_t i
|
|||
// consider to expose this new capability in the sun.rt.jvmCapabilities jvmstat
|
||||
// counter defined in runtimeService.cpp.
|
||||
info->is_attachable = AttachListener::is_attach_supported();
|
||||
#ifdef KERNEL
|
||||
info->is_kernel_jvm = 1; // true;
|
||||
#else // KERNEL
|
||||
info->is_kernel_jvm = 0; // false;
|
||||
#endif // KERNEL
|
||||
}
|
||||
JVM_END
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
/*
|
||||
* Copyright (c) 2003, 2010, Oracle and/or its affiliates. All rights reserved.
|
||||
* Copyright (c) 2003, 2013, 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
|
||||
|
@ -25,9 +25,7 @@
|
|||
#ifndef SHARE_VM_PRIMS_JVMTICODEBLOBEVENTS_HPP
|
||||
#define SHARE_VM_PRIMS_JVMTICODEBLOBEVENTS_HPP
|
||||
|
||||
#ifndef JVMTI_KERNEL
|
||||
#include "jvmtifiles/jvmti.h"
|
||||
#endif
|
||||
|
||||
// forward declaration
|
||||
class JvmtiEnv;
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
/*
|
||||
* Copyright (c) 2003, 2012, Oracle and/or its affiliates. All rights reserved.
|
||||
* Copyright (c) 2003, 2013, 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
|
||||
|
@ -647,8 +647,6 @@ JvmtiEnv::GetJLocationFormat(jvmtiJlocationFormat* format_ptr) {
|
|||
return JVMTI_ERROR_NONE;
|
||||
} /* end GetJLocationFormat */
|
||||
|
||||
#ifndef JVMTI_KERNEL
|
||||
|
||||
//
|
||||
// Thread functions
|
||||
//
|
||||
|
@ -3436,5 +3434,3 @@ JvmtiEnv::SetSystemProperty(const char* property, const char* value_ptr) {
|
|||
}
|
||||
return err;
|
||||
} /* end SetSystemProperty */
|
||||
|
||||
#endif // !JVMTI_KERNEL
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
/*
|
||||
* Copyright (c) 2003, 2012, Oracle and/or its affiliates. All rights reserved.
|
||||
* Copyright (c) 2003, 2013, 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
|
||||
|
@ -74,10 +74,8 @@ JvmtiEnvBase::globally_initialize() {
|
|||
|
||||
JvmtiManageCapabilities::initialize();
|
||||
|
||||
#ifndef JVMTI_KERNEL
|
||||
// register extension functions and events
|
||||
JvmtiExtensions::register_extensions();
|
||||
#endif // !JVMTI_KERNEL
|
||||
|
||||
#ifdef JVMTI_TRACE
|
||||
JvmtiTrace::initialize();
|
||||
|
@ -236,14 +234,12 @@ JvmtiEnvBase::env_dispose() {
|
|||
// Same situation as with events (see above)
|
||||
set_native_method_prefixes(0, NULL);
|
||||
|
||||
#ifndef JVMTI_KERNEL
|
||||
JvmtiTagMap* tag_map_to_deallocate = _tag_map;
|
||||
set_tag_map(NULL);
|
||||
// A tag map can be big, deallocate it now
|
||||
if (tag_map_to_deallocate != NULL) {
|
||||
delete tag_map_to_deallocate;
|
||||
}
|
||||
#endif // !JVMTI_KERNEL
|
||||
|
||||
_needs_clean_up = true;
|
||||
}
|
||||
|
@ -255,14 +251,12 @@ JvmtiEnvBase::~JvmtiEnvBase() {
|
|||
// There is a small window of time during which the tag map of a
|
||||
// disposed environment could have been reallocated.
|
||||
// Make sure it is gone.
|
||||
#ifndef JVMTI_KERNEL
|
||||
JvmtiTagMap* tag_map_to_deallocate = _tag_map;
|
||||
set_tag_map(NULL);
|
||||
// A tag map can be big, deallocate it now
|
||||
if (tag_map_to_deallocate != NULL) {
|
||||
delete tag_map_to_deallocate;
|
||||
}
|
||||
#endif // !JVMTI_KERNEL
|
||||
|
||||
_magic = BAD_MAGIC;
|
||||
}
|
||||
|
@ -593,8 +587,6 @@ JvmtiEnvBase::get_jni_class_non_null(Klass* k) {
|
|||
return (jclass)jni_reference(k->java_mirror());
|
||||
}
|
||||
|
||||
#ifndef JVMTI_KERNEL
|
||||
|
||||
//
|
||||
// Field Information
|
||||
//
|
||||
|
@ -1482,5 +1474,3 @@ JvmtiMonitorClosure::do_monitor(ObjectMonitor* mon) {
|
|||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif // !JVMTI_KERNEL
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
/*
|
||||
* Copyright (c) 2003, 2012, Oracle and/or its affiliates. All rights reserved.
|
||||
* Copyright (c) 2003, 2013, 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
|
||||
|
@ -677,7 +677,6 @@ void JvmtiExport::report_unsupported(bool on) {
|
|||
}
|
||||
|
||||
|
||||
#ifndef JVMTI_KERNEL
|
||||
static inline Klass* oop_to_klass(oop obj) {
|
||||
Klass* k = obj->klass();
|
||||
|
||||
|
@ -2178,7 +2177,6 @@ extern "C" {
|
|||
typedef jint (JNICALL *OnAttachEntry_t)(JavaVM*, char *, void *);
|
||||
}
|
||||
|
||||
#ifndef SERVICES_KERNEL
|
||||
jint JvmtiExport::load_agent_library(AttachOperation* op, outputStream* st) {
|
||||
char ebuf[1024];
|
||||
char buffer[JVM_MAXPATHLEN];
|
||||
|
@ -2259,7 +2257,6 @@ jint JvmtiExport::load_agent_library(AttachOperation* op, outputStream* st) {
|
|||
}
|
||||
return result;
|
||||
}
|
||||
#endif // SERVICES_KERNEL
|
||||
|
||||
////////////////////////////////////////////////////////////////////////////////////////////////
|
||||
|
||||
|
@ -2457,4 +2454,3 @@ JvmtiGCMarker::~JvmtiGCMarker() {
|
|||
JvmtiExport::post_garbage_collection_finish();
|
||||
}
|
||||
}
|
||||
#endif // JVMTI_KERNEL
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
/*
|
||||
* Copyright (c) 2003, 2010, Oracle and/or its affiliates. All rights reserved.
|
||||
* Copyright (c) 2003, 2013, 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
|
||||
|
@ -25,11 +25,9 @@
|
|||
#ifndef SHARE_VM_PRIMS_JVMTIEXTENSIONS_HPP
|
||||
#define SHARE_VM_PRIMS_JVMTIEXTENSIONS_HPP
|
||||
|
||||
#ifndef JVMTI_KERNEL
|
||||
#include "jvmtifiles/jvmti.h"
|
||||
#include "jvmtifiles/jvmtiEnv.hpp"
|
||||
#include "memory/allocation.hpp"
|
||||
#endif
|
||||
|
||||
// JvmtiExtensions
|
||||
//
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
/*
|
||||
* Copyright (c) 2003, 2012, Oracle and/or its affiliates. All rights reserved.
|
||||
* Copyright (c) 2003, 2013, 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
|
||||
|
@ -905,8 +905,6 @@ void JvmtiSuspendControl::print() {
|
|||
#endif
|
||||
}
|
||||
|
||||
#ifndef KERNEL
|
||||
|
||||
JvmtiDeferredEvent JvmtiDeferredEvent::compiled_method_load_event(
|
||||
nmethod* nm) {
|
||||
JvmtiDeferredEvent event = JvmtiDeferredEvent(TYPE_COMPILED_METHOD_LOAD);
|
||||
|
@ -1098,5 +1096,3 @@ void JvmtiDeferredEventQueue::process_pending_events() {
|
|||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif // ndef KERNEL
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
/*
|
||||
* Copyright (c) 1999, 2012, Oracle and/or its affiliates. All rights reserved.
|
||||
* Copyright (c) 1999, 2013, 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
|
||||
|
@ -25,8 +25,6 @@
|
|||
#ifndef SHARE_VM_PRIMS_JVMTIIMPL_HPP
|
||||
#define SHARE_VM_PRIMS_JVMTIIMPL_HPP
|
||||
|
||||
#ifndef JVMTI_KERNEL
|
||||
|
||||
#include "classfile/systemDictionary.hpp"
|
||||
#include "jvmtifiles/jvmti.h"
|
||||
#include "oops/objArrayOop.hpp"
|
||||
|
@ -435,7 +433,6 @@ public:
|
|||
static void print();
|
||||
};
|
||||
|
||||
#endif // !JVMTI_KERNEL
|
||||
|
||||
/**
|
||||
* When a thread (such as the compiler thread or VM thread) cannot post a
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
/*
|
||||
* Copyright (c) 1999, 2010, Oracle and/or its affiliates. All rights reserved.
|
||||
* Copyright (c) 1999, 2013, 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
|
||||
|
@ -25,10 +25,8 @@
|
|||
#ifndef SHARE_VM_PRIMS_JVMTIRAWMONITOR_HPP
|
||||
#define SHARE_VM_PRIMS_JVMTIRAWMONITOR_HPP
|
||||
|
||||
#ifndef JVMTI_KERNEL
|
||||
#include "runtime/objectMonitor.hpp"
|
||||
#include "utilities/growableArray.hpp"
|
||||
#endif
|
||||
|
||||
//
|
||||
// class JvmtiRawMonitor
|
||||
|
|
|
@ -1122,6 +1122,8 @@ bool VM_RedefineClasses::merge_constant_pools(constantPoolHandle old_cp,
|
|||
}
|
||||
} // end for each old_cp entry
|
||||
|
||||
ConstantPool::copy_operands(old_cp, *merge_cp_p, CHECK_0);
|
||||
|
||||
// We don't need to sanity check that *merge_cp_length_p is within
|
||||
// *merge_cp_p bounds since we have the minimum on-entry check above.
|
||||
(*merge_cp_length_p) = old_i;
|
||||
|
@ -1305,8 +1307,12 @@ jvmtiError VM_RedefineClasses::merge_cp_and_rewrite(
|
|||
_index_map_count = 0;
|
||||
_index_map_p = new intArray(scratch_cp->length(), -1);
|
||||
|
||||
// reference to the cp holder is needed for copy_operands()
|
||||
merge_cp->set_pool_holder(scratch_class());
|
||||
bool result = merge_constant_pools(old_cp, scratch_cp, &merge_cp,
|
||||
&merge_cp_length, THREAD);
|
||||
merge_cp->set_pool_holder(NULL);
|
||||
|
||||
if (!result) {
|
||||
// The merge can fail due to memory allocation failure or due
|
||||
// to robustness checks.
|
||||
|
@ -2380,13 +2386,14 @@ void VM_RedefineClasses::set_new_constant_pool(
|
|||
assert(version != 0, "sanity check");
|
||||
smaller_cp->set_version(version);
|
||||
|
||||
// attach klass to new constant pool
|
||||
// reference to the cp holder is needed for copy_operands()
|
||||
smaller_cp->set_pool_holder(scratch_class());
|
||||
|
||||
scratch_cp->copy_cp_to(1, scratch_cp_length - 1, smaller_cp, 1, THREAD);
|
||||
scratch_cp = smaller_cp;
|
||||
|
||||
// attach new constant pool to klass
|
||||
scratch_cp->set_pool_holder(scratch_class());
|
||||
|
||||
// attach klass to new constant pool
|
||||
scratch_class->set_constants(scratch_cp());
|
||||
|
||||
int i; // for portability
|
||||
|
@ -3104,11 +3111,9 @@ void VM_RedefineClasses::redefine_single_class(jclass the_jclass,
|
|||
Klass* the_class_oop = java_lang_Class::as_Klass(the_class_mirror);
|
||||
instanceKlassHandle the_class = instanceKlassHandle(THREAD, the_class_oop);
|
||||
|
||||
#ifndef JVMTI_KERNEL
|
||||
// Remove all breakpoints in methods of this class
|
||||
JvmtiBreakpoints& jvmti_breakpoints = JvmtiCurrentBreakpoints::get_jvmti_breakpoints();
|
||||
jvmti_breakpoints.clearall_in_class_at_safepoint(the_class_oop);
|
||||
#endif // !JVMTI_KERNEL
|
||||
|
||||
if (the_class_oop == Universe::reflect_invoke_cache()->klass()) {
|
||||
// We are redefining java.lang.reflect.Method. Method.invoke() is
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
/*
|
||||
* Copyright (c) 2003, 2012, Oracle and/or its affiliates. All rights reserved.
|
||||
* Copyright (c) 2003, 2013, 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
|
||||
|
@ -27,14 +27,12 @@
|
|||
#ifndef SHARE_VM_PRIMS_JVMTITAGMAP_HPP
|
||||
#define SHARE_VM_PRIMS_JVMTITAGMAP_HPP
|
||||
|
||||
#ifndef JVMTI_KERNEL
|
||||
#include "gc_interface/collectedHeap.hpp"
|
||||
#include "jvmtifiles/jvmti.h"
|
||||
#include "jvmtifiles/jvmtiEnv.hpp"
|
||||
#include "memory/allocation.hpp"
|
||||
#include "memory/genCollectedHeap.hpp"
|
||||
#include "memory/universe.hpp"
|
||||
#endif
|
||||
|
||||
// forward references
|
||||
class JvmtiTagHashmap;
|
||||
|
|
|
@ -2472,10 +2472,7 @@ jint Arguments::parse_each_vm_init_arg(const JavaVMInitArgs* args,
|
|||
|
||||
// -Xshare:dump
|
||||
} else if (match_option(option, "-Xshare:dump", &tail)) {
|
||||
#if defined(KERNEL)
|
||||
vm_exit_during_initialization(
|
||||
"Dumping a shared archive is not supported on the Kernel JVM.", NULL);
|
||||
#elif !INCLUDE_CDS
|
||||
#if !INCLUDE_CDS
|
||||
vm_exit_during_initialization(
|
||||
"Dumping a shared archive is not supported in this VM.", NULL);
|
||||
#else
|
||||
|
@ -3463,36 +3460,6 @@ void Arguments::PropertyList_unique_add(SystemProperty** plist, const char* k, c
|
|||
PropertyList_add(plist, k, v);
|
||||
}
|
||||
|
||||
#ifdef KERNEL
|
||||
char *Arguments::get_kernel_properties() {
|
||||
// Find properties starting with kernel and append them to string
|
||||
// We need to find out how long they are first because the URL's that they
|
||||
// might point to could get long.
|
||||
int length = 0;
|
||||
SystemProperty* prop;
|
||||
for (prop = _system_properties; prop != NULL; prop = prop->next()) {
|
||||
if (strncmp(prop->key(), "kernel.", 7 ) == 0) {
|
||||
length += (strlen(prop->key()) + strlen(prop->value()) + 5); // "-D ="
|
||||
}
|
||||
}
|
||||
// Add one for null terminator.
|
||||
char *props = AllocateHeap(length + 1, mtInternal);
|
||||
if (length != 0) {
|
||||
int pos = 0;
|
||||
for (prop = _system_properties; prop != NULL; prop = prop->next()) {
|
||||
if (strncmp(prop->key(), "kernel.", 7 ) == 0) {
|
||||
jio_snprintf(&props[pos], length-pos,
|
||||
"-D%s=%s ", prop->key(), prop->value());
|
||||
pos = strlen(props);
|
||||
}
|
||||
}
|
||||
}
|
||||
// null terminate props in case of null
|
||||
props[length] = '\0';
|
||||
return props;
|
||||
}
|
||||
#endif // KERNEL
|
||||
|
||||
// Copies src into buf, replacing "%%" with "%" and "%p" with pid
|
||||
// Returns true if all of the source pointed by src has been copied over to
|
||||
// the destination buffer pointed by buf. Otherwise, returns false.
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
/*
|
||||
* Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved.
|
||||
* Copyright (c) 1997, 2013, 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
|
||||
|
@ -540,11 +540,6 @@ class Arguments : AllStatic {
|
|||
|
||||
// Utility: copies src into buf, replacing "%%" with "%" and "%p" with pid.
|
||||
static bool copy_expand_pid(const char* src, size_t srclen, char* buf, size_t buflen);
|
||||
|
||||
#ifdef KERNEL
|
||||
// For java kernel vm, return property string for kernel properties.
|
||||
static char *get_kernel_properties();
|
||||
#endif // KERNEL
|
||||
};
|
||||
|
||||
#endif // SHARE_VM_RUNTIME_ARGUMENTS_HPP
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
/*
|
||||
* Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved.
|
||||
* Copyright (c) 1997, 2013, 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
|
||||
|
@ -3739,28 +3739,6 @@ static OnLoadEntry_t lookup_on_load(AgentLibrary* agent, const char *on_load_sym
|
|||
name)) {
|
||||
library = os::dll_load(buffer, ebuf, sizeof ebuf);
|
||||
}
|
||||
#ifdef KERNEL
|
||||
// Download instrument dll
|
||||
if (library == NULL && strcmp(name, "instrument") == 0) {
|
||||
char *props = Arguments::get_kernel_properties();
|
||||
char *home = Arguments::get_java_home();
|
||||
const char *fmt = "%s/bin/java %s -Dkernel.background.download=false"
|
||||
" sun.jkernel.DownloadManager -download client_jvm";
|
||||
size_t length = strlen(props) + strlen(home) + strlen(fmt) + 1;
|
||||
char *cmd = NEW_C_HEAP_ARRAY(char, length, mtThread);
|
||||
jio_snprintf(cmd, length, fmt, home, props);
|
||||
int status = os::fork_and_exec(cmd);
|
||||
FreeHeap(props);
|
||||
if (status == -1) {
|
||||
warning(cmd);
|
||||
vm_exit_during_initialization("fork_and_exec failed: %s",
|
||||
strerror(errno));
|
||||
}
|
||||
FREE_C_HEAP_ARRAY(char, cmd, mtThread);
|
||||
// when this comes back the instrument.dll should be where it belongs.
|
||||
library = os::dll_load(buffer, ebuf, sizeof ebuf);
|
||||
}
|
||||
#endif // KERNEL
|
||||
if (library == NULL) { // Try the local directory
|
||||
char ns[1] = {0};
|
||||
if (os::dll_build_name(buffer, sizeof(buffer), ns, name)) {
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
/*
|
||||
* Copyright (c) 2000, 2012, Oracle and/or its affiliates. All rights reserved.
|
||||
* Copyright (c) 2000, 2013, 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
|
||||
|
@ -25,9 +25,7 @@
|
|||
#ifndef SHARE_VM_RUNTIME_VMSTRUCTS_HPP
|
||||
#define SHARE_VM_RUNTIME_VMSTRUCTS_HPP
|
||||
|
||||
#ifndef VM_STRUCTS_KERNEL
|
||||
#include "utilities/debug.hpp"
|
||||
#endif
|
||||
#ifdef COMPILER1
|
||||
#include "c1/c1_Runtime1.hpp"
|
||||
#endif
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
/*
|
||||
* Copyright (c) 1998, 2012, Oracle and/or its affiliates. All rights reserved.
|
||||
* Copyright (c) 1998, 2013, 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
|
||||
|
@ -111,9 +111,6 @@ void Abstract_VM_Version::initialize() {
|
|||
#endif
|
||||
|
||||
#ifndef VMTYPE
|
||||
#ifdef KERNEL
|
||||
#define VMTYPE "Kernel"
|
||||
#else // KERNEL
|
||||
#ifdef TIERED
|
||||
#define VMTYPE "Server"
|
||||
#else // TIERED
|
||||
|
@ -128,7 +125,6 @@ void Abstract_VM_Version::initialize() {
|
|||
COMPILER2_PRESENT("Server")
|
||||
#endif // ZERO
|
||||
#endif // TIERED
|
||||
#endif // KERNEL
|
||||
#endif
|
||||
|
||||
#ifndef HOTSPOT_VM_DISTRO
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
/*
|
||||
* Copyright (c) 2005, 2012, Oracle and/or its affiliates. All rights reserved.
|
||||
* Copyright (c) 2005, 2013, 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
|
||||
|
@ -170,7 +170,6 @@ static jint jcmd(AttachOperation* op, outputStream* out) {
|
|||
return JNI_OK;
|
||||
}
|
||||
|
||||
#ifndef SERVICES_KERNEL // Heap dumping not supported
|
||||
// Implementation of "dumpheap" command.
|
||||
// See also: HeapDumpDCmd class
|
||||
//
|
||||
|
@ -212,7 +211,6 @@ jint dump_heap(AttachOperation* op, outputStream* out) {
|
|||
}
|
||||
return JNI_OK;
|
||||
}
|
||||
#endif // SERVICES_KERNEL
|
||||
|
||||
// Implementation of "inspectheap" command
|
||||
// See also: ClassHistogramDCmd class
|
||||
|
@ -382,9 +380,7 @@ static jint print_flag(AttachOperation* op, outputStream* out) {
|
|||
static AttachOperationFunctionInfo funcs[] = {
|
||||
{ "agentProperties", get_agent_properties },
|
||||
{ "datadump", data_dump },
|
||||
#ifndef SERVICES_KERNEL
|
||||
{ "dumpheap", dump_heap },
|
||||
#endif // SERVICES_KERNEL
|
||||
{ "load", JvmtiExport::load_agent_library },
|
||||
{ "properties", get_system_properties },
|
||||
{ "threaddump", thread_dump },
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
/*
|
||||
* Copyright (c) 2005, 2012, Oracle and/or its affiliates. All rights reserved.
|
||||
* Copyright (c) 2005, 2013, 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
|
||||
|
@ -38,8 +38,6 @@
|
|||
// complets the result value and any result data is returned to the client
|
||||
// tool.
|
||||
|
||||
#ifndef SERVICES_KERNEL
|
||||
|
||||
class AttachOperation;
|
||||
|
||||
typedef jint (*AttachOperationFunction)(AttachOperation* op, outputStream* out);
|
||||
|
@ -48,7 +46,6 @@ struct AttachOperationFunctionInfo {
|
|||
const char* name;
|
||||
AttachOperationFunction func;
|
||||
};
|
||||
#endif // SERVICES_KERNEL
|
||||
|
||||
class AttachListener: AllStatic {
|
||||
public:
|
||||
|
|
|
@ -189,9 +189,9 @@ jtreg_tests: prep $(JT_HOME) $(PRODUCT_HOME) $(JTREG)
|
|||
$(JTREG) -a -v:fail,error \
|
||||
$(JTREG_KEY_OPTION) \
|
||||
$(EXTRA_JTREG_OPTIONS) \
|
||||
-r:$(ABS_TEST_OUTPUT_DIR)/JTreport \
|
||||
-w:$(ABS_TEST_OUTPUT_DIR)/JTwork \
|
||||
-jdk:$(PRODUCT_HOME) \
|
||||
-r:$(shell $(GETMIXEDPATH) "$(ABS_TEST_OUTPUT_DIR)")/JTreport \
|
||||
-w:$(shell $(GETMIXEDPATH) "$(ABS_TEST_OUTPUT_DIR)")/JTwork \
|
||||
-jdk:$(shell $(GETMIXEDPATH) "$(PRODUCT_HOME)") \
|
||||
$(JAVA_OPTIONS:%=-vmoption:%) \
|
||||
$(JTREG_TESTDIRS) \
|
||||
|| $(BUNDLE_UP_FAILED)
|
||||
|
|
331
hotspot/test/compiler/6896617/Test6896617.java
Normal file
331
hotspot/test/compiler/6896617/Test6896617.java
Normal file
|
@ -0,0 +1,331 @@
|
|||
/*
|
||||
* Copyright (c) 2013, 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 6896617
|
||||
* @summary Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() with SSE instructions on x86
|
||||
* @run main/othervm/timeout=1200 -Xbatch -Xmx256m Test6896617
|
||||
*
|
||||
*/
|
||||
|
||||
import java.util.*;
|
||||
import java.nio.*;
|
||||
import java.nio.charset.*;
|
||||
|
||||
public class Test6896617 {
|
||||
final static int SIZE = 256;
|
||||
|
||||
public static void main(String[] args) {
|
||||
String csn = "ISO-8859-1";
|
||||
Charset cs = Charset.forName(csn);
|
||||
CharsetEncoder enc = cs.newEncoder();
|
||||
enc.onMalformedInput(CodingErrorAction.REPLACE)
|
||||
.onUnmappableCharacter(CodingErrorAction.REPLACE);
|
||||
CharsetDecoder dec = cs.newDecoder();
|
||||
dec.onMalformedInput(CodingErrorAction.REPLACE)
|
||||
.onUnmappableCharacter(CodingErrorAction.REPLACE);
|
||||
|
||||
byte repl = (byte)'?';
|
||||
enc.replaceWith(new byte[] { repl });
|
||||
|
||||
// Use internal API for tests.
|
||||
sun.nio.cs.ArrayEncoder arrenc = (sun.nio.cs.ArrayEncoder)enc;
|
||||
sun.nio.cs.ArrayDecoder arrdec = (sun.nio.cs.ArrayDecoder)dec;
|
||||
|
||||
// Populate char[] with chars which can be encoded by ISO_8859_1 (<= 0xFF)
|
||||
Random rnd = new Random(0);
|
||||
int maxchar = 0xFF;
|
||||
char[] a = new char[SIZE];
|
||||
byte[] b = new byte[SIZE];
|
||||
char[] at = new char[SIZE];
|
||||
byte[] bt = new byte[SIZE];
|
||||
for (int i = 0; i < SIZE; i++) {
|
||||
char c = (char) rnd.nextInt(maxchar);
|
||||
if (!enc.canEncode(c)) {
|
||||
System.out.printf("Something wrong: can't encode c=%03x\n", (int)c);
|
||||
System.exit(97);
|
||||
}
|
||||
a[i] = c;
|
||||
b[i] = (byte)c;
|
||||
at[i] = (char)-1;
|
||||
bt[i] = (byte)-1;
|
||||
}
|
||||
if (arrenc.encode(a, 0, SIZE, bt) != SIZE || !Arrays.equals(b, bt)) {
|
||||
System.out.println("Something wrong: ArrayEncoder.encode failed");
|
||||
System.exit(97);
|
||||
}
|
||||
if (arrdec.decode(b, 0, SIZE, at) != SIZE || !Arrays.equals(a, at)) {
|
||||
System.out.println("Something wrong: ArrayDecoder.decode failed");
|
||||
System.exit(97);
|
||||
}
|
||||
for (int i = 0; i < SIZE; i++) {
|
||||
at[i] = (char)-1;
|
||||
bt[i] = (byte)-1;
|
||||
}
|
||||
|
||||
ByteBuffer bb = ByteBuffer.wrap(b);
|
||||
CharBuffer ba = CharBuffer.wrap(a);
|
||||
ByteBuffer bbt = ByteBuffer.wrap(bt);
|
||||
CharBuffer bat = CharBuffer.wrap(at);
|
||||
if (!enc.encode(ba, bbt, true).isUnderflow() || !Arrays.equals(b, bt)) {
|
||||
System.out.println("Something wrong: Encoder.encode failed");
|
||||
System.exit(97);
|
||||
}
|
||||
if (!dec.decode(bb, bat, true).isUnderflow() || !Arrays.equals(a, at)) {
|
||||
System.out.println("Something wrong: Decoder.decode failed");
|
||||
System.exit(97);
|
||||
}
|
||||
for (int i = 0; i < SIZE; i++) {
|
||||
at[i] = (char)-1;
|
||||
bt[i] = (byte)-1;
|
||||
}
|
||||
|
||||
// Warm up
|
||||
boolean failed = false;
|
||||
int result = 0;
|
||||
for (int i = 0; i < 10000; i++) {
|
||||
result += arrenc.encode(a, 0, SIZE, bt);
|
||||
result -= arrdec.decode(b, 0, SIZE, at);
|
||||
}
|
||||
for (int i = 0; i < 10000; i++) {
|
||||
result += arrenc.encode(a, 0, SIZE, bt);
|
||||
result -= arrdec.decode(b, 0, SIZE, at);
|
||||
}
|
||||
for (int i = 0; i < 10000; i++) {
|
||||
result += arrenc.encode(a, 0, SIZE, bt);
|
||||
result -= arrdec.decode(b, 0, SIZE, at);
|
||||
}
|
||||
if (result != 0 || !Arrays.equals(b, bt) || !Arrays.equals(a, at)) {
|
||||
failed = true;
|
||||
System.out.println("Failed: ArrayEncoder.encode char[" + SIZE + "] and ArrayDecoder.decode byte[" + SIZE + "]");
|
||||
}
|
||||
for (int i = 0; i < SIZE; i++) {
|
||||
at[i] = (char)-1;
|
||||
bt[i] = (byte)-1;
|
||||
}
|
||||
|
||||
boolean is_underflow = true;
|
||||
for (int i = 0; i < 10000; i++) {
|
||||
ba.clear(); bb.clear(); bat.clear(); bbt.clear();
|
||||
boolean enc_res = enc.encode(ba, bbt, true).isUnderflow();
|
||||
boolean dec_res = dec.decode(bb, bat, true).isUnderflow();
|
||||
is_underflow = is_underflow && enc_res && dec_res;
|
||||
}
|
||||
for (int i = 0; i < SIZE; i++) {
|
||||
at[i] = (char)-1;
|
||||
bt[i] = (byte)-1;
|
||||
}
|
||||
for (int i = 0; i < 10000; i++) {
|
||||
ba.clear(); bb.clear(); bat.clear(); bbt.clear();
|
||||
boolean enc_res = enc.encode(ba, bbt, true).isUnderflow();
|
||||
boolean dec_res = dec.decode(bb, bat, true).isUnderflow();
|
||||
is_underflow = is_underflow && enc_res && dec_res;
|
||||
}
|
||||
for (int i = 0; i < SIZE; i++) {
|
||||
at[i] = (char)-1;
|
||||
bt[i] = (byte)-1;
|
||||
}
|
||||
for (int i = 0; i < 10000; i++) {
|
||||
ba.clear(); bb.clear(); bat.clear(); bbt.clear();
|
||||
boolean enc_res = enc.encode(ba, bbt, true).isUnderflow();
|
||||
boolean dec_res = dec.decode(bb, bat, true).isUnderflow();
|
||||
is_underflow = is_underflow && enc_res && dec_res;
|
||||
}
|
||||
if (!is_underflow || !Arrays.equals(b, bt) || !Arrays.equals(a, at)) {
|
||||
failed = true;
|
||||
System.out.println("Failed: Encoder.encode char[" + SIZE + "] and Decoder.decode byte[" + SIZE + "]");
|
||||
}
|
||||
|
||||
// Test encoder with different source and destination sizes
|
||||
System.out.println("Testing different source and destination sizes");
|
||||
for (int i = 1; i <= SIZE; i++) {
|
||||
for (int j = 1; j <= SIZE; j++) {
|
||||
bt = new byte[j];
|
||||
// very source's SIZE
|
||||
result = arrenc.encode(a, 0, i, bt);
|
||||
int l = Math.min(i, j);
|
||||
if (result != l) {
|
||||
failed = true;
|
||||
System.out.println("Failed: encode char[" + i + "] to byte[" + j + "]: result = " + result + ", expected " + l);
|
||||
}
|
||||
for (int k = 0; k < l; k++) {
|
||||
if (bt[k] != b[k]) {
|
||||
failed = true;
|
||||
System.out.println("Failed: encoded byte[" + k + "] (" + bt[k] + ") != " + b[k]);
|
||||
}
|
||||
}
|
||||
// very source's offset
|
||||
int sz = SIZE - i + 1;
|
||||
result = arrenc.encode(a, i-1, sz, bt);
|
||||
l = Math.min(sz, j);
|
||||
if (result != l) {
|
||||
failed = true;
|
||||
System.out.println("Failed: encode char[" + sz + "] to byte[" + j + "]: result = " + result + ", expected " + l);
|
||||
}
|
||||
for (int k = 0; k < l; k++) {
|
||||
if (bt[k] != b[i+k-1]) {
|
||||
failed = true;
|
||||
System.out.println("Failed: encoded byte[" + k + "] (" + bt[k] + ") != " + b[i+k-1]);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// Test encoder with char > 0xFF
|
||||
System.out.println("Testing big char");
|
||||
|
||||
byte orig = (byte)'A';
|
||||
bt = new byte[SIZE];
|
||||
for (int i = 1; i <= SIZE; i++) {
|
||||
for (int j = 0; j < i; j++) {
|
||||
a[j] += 0x100;
|
||||
// make sure to replace a different byte
|
||||
bt[j] = orig;
|
||||
result = arrenc.encode(a, 0, i, bt);
|
||||
if (result != i) {
|
||||
failed = true;
|
||||
System.out.println("Failed: encode char[" + i + "] to byte[" + i + "]: result = " + result + ", expected " + i);
|
||||
}
|
||||
if (bt[j] != repl) {
|
||||
failed = true;
|
||||
System.out.println("Failed: encoded replace byte[" + j + "] (" + bt[j] + ") != " + repl);
|
||||
}
|
||||
bt[j] = b[j]; // Restore to compare whole array
|
||||
for (int k = 0; k < i; k++) {
|
||||
if (bt[k] != b[k]) {
|
||||
failed = true;
|
||||
System.out.println("Failed: encoded byte[" + k + "] (" + bt[k] + ") != " + b[k]);
|
||||
}
|
||||
}
|
||||
a[j] -= 0x100; // Restore
|
||||
}
|
||||
}
|
||||
|
||||
// Test sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() performance.
|
||||
|
||||
int itrs = Integer.getInteger("iterations", 1000000);
|
||||
int size = Integer.getInteger("size", 256);
|
||||
a = new char[size];
|
||||
b = new byte[size];
|
||||
bt = new byte[size];
|
||||
for (int i = 0; i < size; i++) {
|
||||
char c = (char) rnd.nextInt(maxchar);
|
||||
if (!enc.canEncode(c)) {
|
||||
System.out.printf("Something wrong: can't encode c=%03x\n", (int)c);
|
||||
System.exit(97);
|
||||
}
|
||||
a[i] = c;
|
||||
b[i] = (byte)-1;
|
||||
bt[i] = (byte)c;
|
||||
}
|
||||
ba = CharBuffer.wrap(a);
|
||||
bb = ByteBuffer.wrap(b);
|
||||
boolean enc_res = enc.encode(ba, bb, true).isUnderflow();
|
||||
if (!enc_res || !Arrays.equals(b, bt)) {
|
||||
failed = true;
|
||||
System.out.println("Failed 1: Encoder.encode char[" + size + "]");
|
||||
}
|
||||
for (int i = 0; i < size; i++) {
|
||||
b[i] = (byte)-1;
|
||||
}
|
||||
|
||||
// Make sure to recompile method if needed before performance run.
|
||||
for (int i = 0; i < 10000; i++) {
|
||||
ba.clear(); bb.clear();
|
||||
enc_res = enc_res && enc.encode(ba, bb, true).isUnderflow();
|
||||
}
|
||||
for (int i = 0; i < size; i++) {
|
||||
b[i] = (byte)-1;
|
||||
}
|
||||
for (int i = 0; i < 10000; i++) {
|
||||
ba.clear(); bb.clear();
|
||||
enc_res = enc_res && enc.encode(ba, bb, true).isUnderflow();
|
||||
}
|
||||
if (!enc_res || !Arrays.equals(b, bt)) {
|
||||
failed = true;
|
||||
System.out.println("Failed 2: Encoder.encode char[" + size + "]");
|
||||
}
|
||||
for (int i = 0; i < size; i++) {
|
||||
b[i] = (byte)-1;
|
||||
}
|
||||
|
||||
System.out.println("Testing ISO_8859_1$Encode.encodeArrayLoop() performance");
|
||||
long start = System.currentTimeMillis();
|
||||
for (int i = 0; i < itrs; i++) {
|
||||
ba.clear(); bb.clear();
|
||||
enc_res = enc_res && enc.encode(ba, bb, true).isUnderflow();
|
||||
}
|
||||
long end = System.currentTimeMillis();
|
||||
if (!enc_res || !Arrays.equals(b, bt)) {
|
||||
failed = true;
|
||||
System.out.println("Failed 3: Encoder.encode char[" + size + "]");
|
||||
} else {
|
||||
System.out.println("size: " + size + " time: " + (end - start));
|
||||
}
|
||||
|
||||
// Test sun.nio.cs.ISO_8859_1$Encode.encode() performance.
|
||||
|
||||
// Make sure to recompile method if needed before performance run.
|
||||
result = 0;
|
||||
for (int i = 0; i < size; i++) {
|
||||
b[i] = (byte)-1;
|
||||
}
|
||||
for (int i = 0; i < 10000; i++) {
|
||||
result += arrenc.encode(a, 0, size, b);
|
||||
}
|
||||
for (int i = 0; i < size; i++) {
|
||||
b[i] = (byte)-1;
|
||||
}
|
||||
for (int i = 0; i < 10000; i++) {
|
||||
result += arrenc.encode(a, 0, size, b);
|
||||
}
|
||||
if (result != size*20000 || !Arrays.equals(b, bt)) {
|
||||
failed = true;
|
||||
System.out.println("Failed 1: ArrayEncoder.encode char[" + SIZE + "]");
|
||||
}
|
||||
for (int i = 0; i < size; i++) {
|
||||
b[i] = (byte)-1;
|
||||
}
|
||||
|
||||
System.out.println("Testing ISO_8859_1$Encode.encode() performance");
|
||||
result = 0;
|
||||
start = System.currentTimeMillis();
|
||||
for (int i = 0; i < itrs; i++) {
|
||||
result += arrenc.encode(a, 0, size, b);
|
||||
}
|
||||
end = System.currentTimeMillis();
|
||||
if (!Arrays.equals(b, bt)) {
|
||||
failed = true;
|
||||
System.out.println("Failed 2: ArrayEncoder.encode char[" + size + "]");
|
||||
} else {
|
||||
System.out.println("size: " + size + " time: " + (end - start));
|
||||
}
|
||||
|
||||
if (failed) {
|
||||
System.out.println("FAILED");
|
||||
System.exit(97);
|
||||
}
|
||||
System.out.println("PASSED");
|
||||
}
|
||||
}
|
|
@ -195,3 +195,4 @@ b854e70084214e9dcf1b37373f6e4b1a68760e03 jdk8-b68
|
|||
499be952a291cec1dc774a84a238941d6faf772d jdk8-b71
|
||||
bdf2af722a6b54fca47d8c51d17a1b8f41dd7a3e jdk8-b72
|
||||
84946404d1e1de003ed2bf218ef8d48906a90e37 jdk8-b73
|
||||
2087e24a4357eceb6432e94918e75fdc706a27d6 jdk8-b74
|
||||
|
|
|
@ -746,27 +746,29 @@ public interface Constants {
|
|||
|
||||
/** Attributes and their corresponding names.
|
||||
*/
|
||||
public static final byte ATTR_UNKNOWN = -1;
|
||||
public static final byte ATTR_SOURCE_FILE = 0;
|
||||
public static final byte ATTR_CONSTANT_VALUE = 1;
|
||||
public static final byte ATTR_CODE = 2;
|
||||
public static final byte ATTR_EXCEPTIONS = 3;
|
||||
public static final byte ATTR_LINE_NUMBER_TABLE = 4;
|
||||
public static final byte ATTR_LOCAL_VARIABLE_TABLE = 5;
|
||||
public static final byte ATTR_INNER_CLASSES = 6;
|
||||
public static final byte ATTR_SYNTHETIC = 7;
|
||||
public static final byte ATTR_DEPRECATED = 8;
|
||||
public static final byte ATTR_PMG = 9;
|
||||
public static final byte ATTR_SIGNATURE = 10;
|
||||
public static final byte ATTR_STACK_MAP = 11;
|
||||
public static final byte ATTR_UNKNOWN = -1;
|
||||
public static final byte ATTR_SOURCE_FILE = 0;
|
||||
public static final byte ATTR_CONSTANT_VALUE = 1;
|
||||
public static final byte ATTR_CODE = 2;
|
||||
public static final byte ATTR_EXCEPTIONS = 3;
|
||||
public static final byte ATTR_LINE_NUMBER_TABLE = 4;
|
||||
public static final byte ATTR_LOCAL_VARIABLE_TABLE = 5;
|
||||
public static final byte ATTR_INNER_CLASSES = 6;
|
||||
public static final byte ATTR_SYNTHETIC = 7;
|
||||
public static final byte ATTR_DEPRECATED = 8;
|
||||
public static final byte ATTR_PMG = 9;
|
||||
public static final byte ATTR_SIGNATURE = 10;
|
||||
public static final byte ATTR_STACK_MAP = 11;
|
||||
public static final byte ATTR_LOCAL_VARIABLE_TYPE_TABLE = 12;
|
||||
|
||||
public static final short KNOWN_ATTRIBUTES = 12;
|
||||
public static final short KNOWN_ATTRIBUTES = 13;
|
||||
|
||||
public static final String[] ATTRIBUTE_NAMES = {
|
||||
"SourceFile", "ConstantValue", "Code", "Exceptions",
|
||||
"LineNumberTable", "LocalVariableTable",
|
||||
"InnerClasses", "Synthetic", "Deprecated",
|
||||
"PMGClass", "Signature", "StackMap"
|
||||
"PMGClass", "Signature", "StackMap",
|
||||
"LocalVariableTypeTable"
|
||||
};
|
||||
|
||||
/** Constants used in the StackMap attribute.
|
||||
|
|
|
@ -206,6 +206,9 @@ public abstract class Attribute implements Cloneable, Node, Serializable {
|
|||
case Constants.ATTR_LOCAL_VARIABLE_TABLE:
|
||||
return new LocalVariableTable(name_index, length, file, constant_pool);
|
||||
|
||||
case Constants.ATTR_LOCAL_VARIABLE_TYPE_TABLE:
|
||||
return new LocalVariableTypeTable(name_index, length, file, constant_pool);
|
||||
|
||||
case Constants.ATTR_INNER_CLASSES:
|
||||
return new InnerClasses(name_index, length, file, constant_pool);
|
||||
|
||||
|
|
|
@ -210,6 +210,12 @@ public class DescendingVisitor implements Visitor {
|
|||
stack.pop();
|
||||
}
|
||||
|
||||
public void visitLocalVariableTypeTable(LocalVariableTypeTable obj) {
|
||||
stack.push(obj);
|
||||
obj.accept(visitor);
|
||||
stack.pop();
|
||||
}
|
||||
|
||||
public void visitStackMap(StackMap table) {
|
||||
stack.push(table);
|
||||
table.accept(visitor);
|
||||
|
|
|
@ -98,6 +98,7 @@ public class EmptyVisitor implements Visitor {
|
|||
public void visitLineNumberTable(LineNumberTable obj) {}
|
||||
public void visitLocalVariable(LocalVariable obj) {}
|
||||
public void visitLocalVariableTable(LocalVariableTable obj) {}
|
||||
public void visitLocalVariableTypeTable(LocalVariableTypeTable obj) {}
|
||||
public void visitMethod(Method obj) {}
|
||||
public void visitSignature(Signature obj) {}
|
||||
public void visitSourceFile(SourceFile obj) {}
|
||||
|
|
|
@ -0,0 +1,146 @@
|
|||
/*
|
||||
* reserved comment block
|
||||
* DO NOT REMOVE OR ALTER!
|
||||
*/
|
||||
package com.sun.org.apache.bcel.internal.classfile;
|
||||
/**
|
||||
* Licensed to the Apache Software Foundation (ASF) under one or more
|
||||
* contributor license agreements. See the NOTICE file distributed with
|
||||
* this work for additional information regarding copyright ownership.
|
||||
* The ASF licenses this file to You under the Apache License, Version 2.0
|
||||
* (the "License"); you may not use this file except in compliance with
|
||||
* the License. You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
import com.sun.org.apache.bcel.internal.Constants;
|
||||
import java.io.*;
|
||||
|
||||
// The new table is used when generic types are about...
|
||||
|
||||
//LocalVariableTable_attribute {
|
||||
// u2 attribute_name_index;
|
||||
// u4 attribute_length;
|
||||
// u2 local_variable_table_length;
|
||||
// { u2 start_pc;
|
||||
// u2 length;
|
||||
// u2 name_index;
|
||||
// u2 descriptor_index;
|
||||
// u2 index;
|
||||
// } local_variable_table[local_variable_table_length];
|
||||
// }
|
||||
|
||||
//LocalVariableTypeTable_attribute {
|
||||
// u2 attribute_name_index;
|
||||
// u4 attribute_length;
|
||||
// u2 local_variable_type_table_length;
|
||||
// {
|
||||
// u2 start_pc;
|
||||
// u2 length;
|
||||
// u2 name_index;
|
||||
// u2 signature_index;
|
||||
// u2 index;
|
||||
// } local_variable_type_table[local_variable_type_table_length];
|
||||
// }
|
||||
// J5TODO: Needs some testing !
|
||||
public class LocalVariableTypeTable extends Attribute {
|
||||
private static final long serialVersionUID = -1082157891095177114L;
|
||||
private int local_variable_type_table_length; // Table of local
|
||||
private LocalVariable[] local_variable_type_table; // variables
|
||||
|
||||
public LocalVariableTypeTable(LocalVariableTypeTable c) {
|
||||
this(c.getNameIndex(), c.getLength(), c.getLocalVariableTypeTable(),
|
||||
c.getConstantPool());
|
||||
}
|
||||
|
||||
public LocalVariableTypeTable(int name_index, int length,
|
||||
LocalVariable[] local_variable_table,
|
||||
ConstantPool constant_pool)
|
||||
{
|
||||
super(Constants.ATTR_LOCAL_VARIABLE_TYPE_TABLE, name_index, length, constant_pool);
|
||||
setLocalVariableTable(local_variable_table);
|
||||
}
|
||||
|
||||
LocalVariableTypeTable(int nameIdx, int len, DataInputStream dis,ConstantPool cpool) throws IOException {
|
||||
this(nameIdx, len, (LocalVariable[])null, cpool);
|
||||
|
||||
local_variable_type_table_length = (dis.readUnsignedShort());
|
||||
local_variable_type_table = new LocalVariable[local_variable_type_table_length];
|
||||
|
||||
for(int i=0; i < local_variable_type_table_length; i++)
|
||||
local_variable_type_table[i] = new LocalVariable(dis, cpool);
|
||||
}
|
||||
|
||||
@Override
|
||||
public void accept(Visitor v) {
|
||||
v.visitLocalVariableTypeTable(this);
|
||||
}
|
||||
|
||||
@Override
|
||||
public final void dump(DataOutputStream file) throws IOException
|
||||
{
|
||||
super.dump(file);
|
||||
file.writeShort(local_variable_type_table_length);
|
||||
for(int i=0; i < local_variable_type_table_length; i++)
|
||||
local_variable_type_table[i].dump(file);
|
||||
}
|
||||
|
||||
public final LocalVariable[] getLocalVariableTypeTable() {
|
||||
return local_variable_type_table;
|
||||
}
|
||||
|
||||
public final LocalVariable getLocalVariable(int index) {
|
||||
for(int i=0; i < local_variable_type_table_length; i++)
|
||||
if(local_variable_type_table[i].getIndex() == index)
|
||||
return local_variable_type_table[i];
|
||||
|
||||
return null;
|
||||
}
|
||||
|
||||
public final void setLocalVariableTable(LocalVariable[] local_variable_table)
|
||||
{
|
||||
this.local_variable_type_table = local_variable_table;
|
||||
local_variable_type_table_length = (local_variable_table == null)? 0 :
|
||||
local_variable_table.length;
|
||||
}
|
||||
|
||||
/**
|
||||
* @return String representation.
|
||||
*/
|
||||
@Override
|
||||
public final String toString() {
|
||||
StringBuilder buf = new StringBuilder();
|
||||
|
||||
for(int i=0; i < local_variable_type_table_length; i++) {
|
||||
buf.append(local_variable_type_table[i].toString());
|
||||
|
||||
if(i < local_variable_type_table_length - 1) buf.append('\n');
|
||||
}
|
||||
|
||||
return buf.toString();
|
||||
}
|
||||
|
||||
/**
|
||||
* @return deep copy of this attribute
|
||||
*/
|
||||
@Override
|
||||
public Attribute copy(ConstantPool constant_pool) {
|
||||
LocalVariableTypeTable c = (LocalVariableTypeTable)clone();
|
||||
|
||||
c.local_variable_type_table = new LocalVariable[local_variable_type_table_length];
|
||||
for(int i=0; i < local_variable_type_table_length; i++)
|
||||
c.local_variable_type_table[i] = local_variable_type_table[i].copy();
|
||||
|
||||
c.constant_pool = constant_pool;
|
||||
return c;
|
||||
}
|
||||
|
||||
public final int getTableLength() { return local_variable_type_table_length; }
|
||||
}
|
|
@ -94,6 +94,7 @@ public interface Visitor {
|
|||
public void visitLineNumberTable(LineNumberTable obj);
|
||||
public void visitLocalVariable(LocalVariable obj);
|
||||
public void visitLocalVariableTable(LocalVariableTable obj);
|
||||
public void visitLocalVariableTypeTable(LocalVariableTypeTable obj);
|
||||
public void visitMethod(Method obj);
|
||||
public void visitSignature(Signature obj);
|
||||
public void visitSourceFile(SourceFile obj);
|
||||
|
|
|
@ -258,6 +258,23 @@ public class MethodGen extends FieldGenOrMethodGen {
|
|||
addLocalVariable(l.getName(), Type.getType(l.getSignature()),
|
||||
l.getIndex(), start, end);
|
||||
}
|
||||
} else if (a instanceof LocalVariableTypeTable) {
|
||||
LocalVariable[] lv = ((LocalVariableTypeTable) a).getLocalVariableTypeTable();
|
||||
removeLocalVariables();
|
||||
for (int k = 0; k < lv.length; k++) {
|
||||
LocalVariable l = lv[k];
|
||||
InstructionHandle start = il.findHandle(l.getStartPC());
|
||||
InstructionHandle end = il.findHandle(l.getStartPC() + l.getLength());
|
||||
// Repair malformed handles
|
||||
if (null == start) {
|
||||
start = il.getStart();
|
||||
}
|
||||
if (null == end) {
|
||||
end = il.getEnd();
|
||||
}
|
||||
addLocalVariable(l.getName(), Type.getType(l.getSignature()), l
|
||||
.getIndex(), start, end);
|
||||
}
|
||||
} else
|
||||
addCodeAttribute(a);
|
||||
}
|
||||
|
|
|
@ -195,3 +195,4 @@ d3fe408f3a9ad250bc9a4e9365bdfc3f28c1d3f4 jdk8-b68
|
|||
f577a39c9fb3d5820248c13c2cc74a192a9313e0 jdk8-b71
|
||||
d9707230294d54e695e745a90de6112909100f12 jdk8-b72
|
||||
c606f644a5d9118c14b5822738bf23c300f14f24 jdk8-b73
|
||||
12db3c5a3393b03eeb09ff26f418c4420c21aaab jdk8-b74
|
||||
|
|
|
@ -195,3 +195,4 @@ a996b57e554198f4592a5f3c30f2f9f4075e545d jdk8-b70
|
|||
2a5af0f766d0acd68a81fb08fe11fd66795f86af jdk8-b71
|
||||
32a57e645e012a1f0665c075969ca598e0dbb948 jdk8-b72
|
||||
733885f57e14cc27f5a5ff0dffe641d2fa3c704a jdk8-b73
|
||||
57d5d954462831ac353a1f40d3bb05ddb4620952 jdk8-b74
|
||||
|
|
|
@ -237,6 +237,9 @@ SUBDIRS = tools java javax sun com jdk
|
|||
ifeq ($(PLATFORM), macosx)
|
||||
SUBDIRS += apple
|
||||
endif
|
||||
ifeq ($(PLATFORM), windows)
|
||||
SUBDIRS += bridge
|
||||
endif
|
||||
SUBDIRS_tools = launchers
|
||||
SUBDIRS_misc = org jpda
|
||||
|
||||
|
|
93
jdk/make/bridge/AccessBridgeJava/Makefile
Normal file
93
jdk/make/bridge/AccessBridgeJava/Makefile
Normal file
|
@ -0,0 +1,93 @@
|
|||
#
|
||||
# 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. Oracle designates this
|
||||
# particular file as subject to the "Classpath" exception as provided
|
||||
# by Oracle in the LICENSE file that accompanied this code.
|
||||
#
|
||||
# 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.
|
||||
#
|
||||
|
||||
#
|
||||
# Makefile for building AccessBridge
|
||||
#
|
||||
BUILDDIR = ../..
|
||||
PRODUCT = java
|
||||
PACKAGE = com.sun.java.accessibility
|
||||
|
||||
include $(BUILDDIR)/common/Defs.gmk
|
||||
JARFILE = $(EXTDIR)/access-bridge$(ABSUFFIX).jar
|
||||
|
||||
ifeq ($(ARCH_DATA_MODEL), 64)
|
||||
ABPLATFORM = 64bit
|
||||
ABSUFFIX = -64
|
||||
else
|
||||
ifeq ($(ARCH_DATA_MODEL), 32)
|
||||
ifdef ABLEGACY
|
||||
ABSUFFIX =
|
||||
ABPLATFORM = legacy
|
||||
else
|
||||
ABPLATFORM = 32bit
|
||||
ABSUFFIX = -32
|
||||
endif
|
||||
endif
|
||||
endif
|
||||
|
||||
#
|
||||
# Java files to compile.
|
||||
#
|
||||
FILES_java = com/sun/java/accessibility/AccessBridge.java
|
||||
|
||||
#
|
||||
# Location for the newly built classfiles.
|
||||
#
|
||||
CLASSDESTDIR = $(TEMPDIR)/classes
|
||||
|
||||
#
|
||||
# Rules
|
||||
#
|
||||
CLASSDESTDIR = $(TEMPDIR)/classes
|
||||
|
||||
FILES_class = $(FILES_java:%.java=$(CLASSDESTDIR)/%.class)
|
||||
|
||||
build: prebuild
|
||||
|
||||
prebuild:
|
||||
$(CP) $(CLOSED_PLATFORM_SRC)/classes/com/sun/java/accessibility/$(ABPLATFORM)/AccessBridge.java \
|
||||
$(CLOSED_PLATFORM_SRC)/classes/com/sun/java/accessibility
|
||||
|
||||
all : build $(JARFILE)
|
||||
|
||||
#
|
||||
# JAR file
|
||||
#
|
||||
$(JARFILE): \
|
||||
$(FILES_class)
|
||||
$(BOOT_JAR_CMD) -cf $(JARFILE) \
|
||||
-C $(CLASSDESTDIR) com \
|
||||
$(BOOT_JAR_JFLAGS)
|
||||
@$(java-vm-cleanup)
|
||||
|
||||
#
|
||||
# Rules
|
||||
#
|
||||
include $(BUILDDIR)/common/Classes.gmk
|
||||
|
||||
clean clobber::
|
||||
$(RM) -r $(CLASSDESTDIR) \
|
||||
$(EXTDIR)/$(JARFILE)
|
|
@ -1,32 +1,29 @@
|
|||
#
|
||||
# Copyright (c) 2007, Oracle and/or its affiliates. All rights reserved.
|
||||
# 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.
|
||||
#
|
||||
# published by the Free Software Foundation. Oracle designates this
|
||||
# particular file as subject to the "Classpath" exception as provided
|
||||
# by Oracle in the LICENSE file that accompanied this code.
|
||||
#
|
||||
# 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.
|
||||
#
|
||||
#
|
||||
#
|
||||
# Sets make macros for making kernel version of VM.
|
||||
# This target on solaris is just tempoarily for debugging the kernel build.
|
||||
|
||||
TYPE=KERNEL
|
||||
|
||||
VM_SUBDIR = client
|
||||
|
||||
CFLAGS += -DKERNEL
|
||||
#
|
||||
# Native files to compile.
|
||||
FILES_cpp = \
|
||||
JAWTAccessBridge.cpp
|
69
jdk/make/bridge/JAWTAccessBridge/Makefile
Normal file
69
jdk/make/bridge/JAWTAccessBridge/Makefile
Normal file
|
@ -0,0 +1,69 @@
|
|||
#
|
||||
# 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. Oracle designates this
|
||||
# particular file as subject to the "Classpath" exception as provided
|
||||
# by Oracle in the LICENSE file that accompanied this code.
|
||||
#
|
||||
# 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.
|
||||
#
|
||||
|
||||
#
|
||||
# Makefile for building JAWTAccessBridge
|
||||
#
|
||||
|
||||
BUILDDIR = ../..
|
||||
LIBRARY = JAWTAccessBridge$(ABSUFFIX)
|
||||
include $(BUILDDIR)/common/Defs.gmk
|
||||
|
||||
# Indicate we want the C++ compiler to do the linking.
|
||||
CPLUSPLUSLIBRARY=true
|
||||
|
||||
ifeq ($(ARCH_DATA_MODEL), 64)
|
||||
ABSUFFIX = -64
|
||||
ACCESSBRIDGE_ARCH = ACCESSBRIDGE_ARCH_64
|
||||
ABRIDGE_MACHINE=X64
|
||||
else
|
||||
ifeq ($(ARCH_DATA_MODEL), 32)
|
||||
ABRIDGE_MACHINE=I386
|
||||
ifdef ABLEGACY
|
||||
ABSUFFIX =
|
||||
ACCESSBRIDGE_ARCH = ACCESSBRIDGE_ARCH_LEGACY
|
||||
else
|
||||
ABSUFFIX = -32
|
||||
ACCESSBRIDGE_ARCH = ACCESSBRIDGE_ARCH_32
|
||||
endif
|
||||
endif
|
||||
endif
|
||||
|
||||
include FILES_cpp.gmk
|
||||
|
||||
VERSIONINFO_RESOURCE = $(CLOSED_PLATFORM_SRC)/native/sun/bridge/AccessBridgeStatusWindow.rc
|
||||
|
||||
OTHER_CPPFLAGS += -D$(ACCESSBRIDGE_ARCH) -I "$(INCLUDEDIR)" -I "$(PLATFORM_INCLUDE)"
|
||||
LDLIBS += kernel32.lib user32.lib gdi32.lib winspool.lib jawt.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib \
|
||||
uuid.lib odbc32.lib odbccp32.lib /subsystem:windows /dll /incremental:no /machine:$(ABRIDGE_MACHINE) \
|
||||
/def:$(CLOSED_PLATFORM_SRC)/native/sun/bridge/JAWTAccessBridge.DEF /libpath:"$(LIBDIR)"
|
||||
|
||||
#
|
||||
# Rules
|
||||
#
|
||||
include $(BUILDDIR)/common/Library.gmk
|
||||
|
||||
vpath %.cpp $(CLOSED_PLATFORM_SRC)/native/sun/bridge
|
||||
vpath %.RC $(CLOSED_PLATFORM_SRC)/native/sun/bridge
|
63
jdk/make/bridge/Jabswitch/Makefile
Normal file
63
jdk/make/bridge/Jabswitch/Makefile
Normal file
|
@ -0,0 +1,63 @@
|
|||
#
|
||||
# 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. Oracle designates this
|
||||
# particular file as subject to the "Classpath" exception as provided
|
||||
# by Oracle in the LICENSE file that accompanied this code.
|
||||
#
|
||||
# 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.
|
||||
#
|
||||
|
||||
#
|
||||
# Makefile for building jabswitch.exe
|
||||
#
|
||||
|
||||
BUILDDIR = ../..
|
||||
PROGRAM = jabswitch
|
||||
include $(BUILDDIR)/common/Defs.gmk
|
||||
|
||||
# Indicate we want the C++ compiler to do the linking.
|
||||
CPLUSPLUSLIBRARY=true
|
||||
|
||||
VERSIONINFO_RESOURCE = $(CLOSED_PLATFORM_SRC)/native/sun/bridge/AccessBridgeStatusWindow.rc
|
||||
VERSIONRES = $(TEMPDIR)/AccessBridgeStatusWindow.res
|
||||
|
||||
JAB_EXE= $(TEMPDIR)/jabswitch.exe
|
||||
|
||||
JAB_SRC = $(CLOSED_PLATFORM_SRC)/native/sun/bridge/jabswitch.cpp
|
||||
|
||||
JAB_MANIFEST_INP = $(CLOSED_PLATFORM_SRC)/native/sun/bridge/jabswitch.manifest
|
||||
JAB_MANIFEST_OUT = $(TEMPDIR)/jabswitch.exe.intermediate.manifest
|
||||
|
||||
RC_FLAGS += /fo "$(VERSIONRES)"
|
||||
OTHER_CPPFLAGS += /MD /Fo"$(TEMPDIR)/" /Fd"$(TEMPDIR)/" /analyze- /Od /Gd /nologo /D "WIN32" /D "_WINDOWS" /D "_UNICODE" /D "UNICODE" /RTC1 /W3 /ZI /Zc:wchar_t /EHsc
|
||||
LDDFLAGS += Advapi32.lib Version.lib User32.lib
|
||||
|
||||
all: buildexe copyfilejab
|
||||
|
||||
buildexe :
|
||||
$(CD) $(TEMPDIR)
|
||||
$(RC) $(RC_FLAGS) $(VERSIONINFO_RESOURCE)
|
||||
$(CC) $(CPPFLAGS) $(JAB_SRC) $(LDDFLAGS) $(VERSIONRES) -o $(JAB_EXE)
|
||||
$(MT) /nologo /verbose /manifest $(JAB_MANIFEST_INP) /outputresource:$(JAB_EXE)
|
||||
|
||||
copyfilejab :
|
||||
$(CP) $(JAB_EXE) $(BINDIR)
|
||||
|
||||
vpath %.cpp $(CLOSED_PLATFORM_SRC)/native/sun/bridge
|
||||
vpath %.rc $(CLOSED_PLATFORM_SRC)/native/sun/bridge
|
85
jdk/make/bridge/Jaccess/Makefile
Normal file
85
jdk/make/bridge/Jaccess/Makefile
Normal file
|
@ -0,0 +1,85 @@
|
|||
#
|
||||
# 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. Oracle designates this
|
||||
# particular file as subject to the "Classpath" exception as provided
|
||||
# by Oracle in the LICENSE file that accompanied this code.
|
||||
#
|
||||
# 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.
|
||||
#
|
||||
|
||||
#
|
||||
# Makefile for building jaccess
|
||||
#
|
||||
BUILDDIR = ../..
|
||||
PRODUCT = java
|
||||
PACKAGE = com.sun.java.accessibility.jaccess
|
||||
|
||||
include $(BUILDDIR)/common/Defs.gmk
|
||||
JARFILE = $(EXTDIR)/jaccess.jar
|
||||
|
||||
#
|
||||
# Java files to compile.
|
||||
#
|
||||
#AUTO_FILES_JAVA_DIRS = $(CLOSED_PLATFORM_SRC)/bridge
|
||||
FILES_java = \
|
||||
com/sun/java/accessibility/util/AccessibilityEventMonitor.java \
|
||||
com/sun/java/accessibility/util/AccessibilityListenerList.java \
|
||||
com/sun/java/accessibility/util/AWTEventMonitor.java \
|
||||
com/sun/java/accessibility/util/EventID.java \
|
||||
com/sun/java/accessibility/util/EventQueueMonitor.java \
|
||||
com/sun/java/accessibility/util/GUIInitializedListener.java \
|
||||
com/sun/java/accessibility/util/GUIInitializedMulticaster.java \
|
||||
com/sun/java/accessibility/util/SwingEventMonitor.java \
|
||||
com/sun/java/accessibility/util/TopLevelWindowListener.java \
|
||||
com/sun/java/accessibility/util/TopLevelWindowMulticaster.java \
|
||||
com/sun/java/accessibility/util/Translator.java \
|
||||
com/sun/java/accessibility/util/java/awt/ButtonTranslator.java \
|
||||
com/sun/java/accessibility/util/java/awt/CheckboxTranslator.java \
|
||||
com/sun/java/accessibility/util/java/awt/LabelTranslator.java \
|
||||
com/sun/java/accessibility/util/java/awt/ListTranslator.java \
|
||||
com/sun/java/accessibility/util/java/awt/TextComponentTranslator.java
|
||||
|
||||
#
|
||||
# Rules
|
||||
#
|
||||
CLASSDESTDIR = $(TEMPDIR)/classes
|
||||
|
||||
FILES_class = $(FILES_java:%.java=$(CLASSDESTDIR)/%.class)
|
||||
|
||||
all : build $(JARFILE)
|
||||
|
||||
#
|
||||
# JAR file
|
||||
#
|
||||
$(JARFILE): \
|
||||
$(FILES_class)
|
||||
$(BOOT_JAR_CMD) -cf $(JARFILE) \
|
||||
-C $(CLASSDESTDIR) com \
|
||||
$(BOOT_JAR_JFLAGS)
|
||||
@$(java-vm-cleanup)
|
||||
|
||||
|
||||
#
|
||||
# Rules
|
||||
#
|
||||
include $(BUILDDIR)/common/Classes.gmk
|
||||
|
||||
clean clobber::
|
||||
$(RM) -r $(CLASSDESTDIR) \
|
||||
$(EXTDIR)/$(JARFILE)
|
33
jdk/make/bridge/JavaAccessBridge/Files_cpp.gmk
Normal file
33
jdk/make/bridge/JavaAccessBridge/Files_cpp.gmk
Normal file
|
@ -0,0 +1,33 @@
|
|||
#
|
||||
# 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. Oracle designates this
|
||||
# particular file as subject to the "Classpath" exception as provided
|
||||
# by Oracle in the LICENSE file that accompanied this code.
|
||||
#
|
||||
# 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.
|
||||
#
|
||||
|
||||
#
|
||||
# Native files to compile.
|
||||
FILES_cpp = \
|
||||
AccessBridgeATInstance.cpp \
|
||||
AccessBridgeDebug.cpp \
|
||||
AccessBridgeJavaEntryPoints.cpp \
|
||||
AccessBridgeMessages.cpp \
|
||||
JavaAccessBridge.cpp
|
90
jdk/make/bridge/JavaAccessBridge/Makefile
Normal file
90
jdk/make/bridge/JavaAccessBridge/Makefile
Normal file
|
@ -0,0 +1,90 @@
|
|||
#
|
||||
# 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. Oracle designates this
|
||||
# particular file as subject to the "Classpath" exception as provided
|
||||
# by Oracle in the LICENSE file that accompanied this code.
|
||||
#
|
||||
# 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.
|
||||
#
|
||||
|
||||
#
|
||||
# Makefile for building JavaAccessBridge.DLL
|
||||
#
|
||||
|
||||
BUILDDIR = ../..
|
||||
LIBRARY = JavaAccessBridge$(ABSUFFIX)
|
||||
include $(BUILDDIR)/common/Defs.gmk
|
||||
|
||||
# Indicate we want the C++ compiler to do the linking.
|
||||
CPLUSPLUSLIBRARY=true
|
||||
|
||||
ifeq ($(ARCH_DATA_MODEL), 64)
|
||||
ABSUFFIX = -64
|
||||
ACCESSBRIDGE_ARCH = ACCESSBRIDGE_ARCH_64
|
||||
ABRIDGE_MACHINE=X64
|
||||
else
|
||||
ifeq ($(ARCH_DATA_MODEL), 32)
|
||||
ABRIDGE_MACHINE=I386
|
||||
ifdef ABLEGACY
|
||||
ABSUFFIX =
|
||||
ACCESSBRIDGE_ARCH = ACCESSBRIDGE_ARCH_LEGACY
|
||||
else
|
||||
ABSUFFIX = -32
|
||||
ACCESSBRIDGE_ARCH = ACCESSBRIDGE_ARCH_32
|
||||
endif
|
||||
endif
|
||||
endif
|
||||
|
||||
include FILES_cpp.gmk
|
||||
|
||||
PLATFORM_INCLUDE_BRIDGE = $(PLATFORM_INCLUDE)/bridge
|
||||
|
||||
VERSIONINFO_RESOURCE = $(CLOSED_PLATFORM_SRC)/native/sun/bridge/AccessBridgeStatusWindow.rc
|
||||
|
||||
OTHER_CPPFLAGS += -D$(ACCESSBRIDGE_ARCH) -I "$(INCLUDEDIR)" -I "$(PLATFORM_INCLUDE)"
|
||||
LDLIBS += kernel32.lib user32.lib gdi32.lib winspool.lib jawt.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib \
|
||||
odbc32.lib odbccp32.lib /subsystem:windows /dll /incremental:no /machine:$(ABRIDGE_MACHINE) \
|
||||
/def:$(CLOSED_PLATFORM_SRC)/native/sun/bridge/JavaAccessBridge.DEF /libpath:"$(LIBDIR)"
|
||||
|
||||
all : build postbuild
|
||||
|
||||
postbuild :
|
||||
$(MKDIR) -p $(PLATFORM_INCLUDE_BRIDGE)
|
||||
$(CP) $(CLOSED_PLATFORM_SRC)/native/sun/bridge/accessibility.properties $(LIBDIR)
|
||||
$(CP) $(CLOSED_PLATFORM_SRC)/native/sun/bridge/AccessBridgeCallbacks.h $(PLATFORM_INCLUDE_BRIDGE)
|
||||
$(CP) $(CLOSED_PLATFORM_SRC)/native/sun/bridge/AccessBridgeCalls.h $(PLATFORM_INCLUDE_BRIDGE)
|
||||
$(CP) $(CLOSED_PLATFORM_SRC)/native/sun/bridge/AccessBridgePackages.h $(PLATFORM_INCLUDE_BRIDGE)
|
||||
$(CP) $(CLOSED_PLATFORM_SRC)/native/sun/bridge/AccessBridgeCalls.c $(PLATFORM_INCLUDE_BRIDGE)
|
||||
|
||||
#
|
||||
# Rules
|
||||
#
|
||||
include $(BUILDDIR)/common/Library.gmk
|
||||
|
||||
vpath %.cpp $(CLOSED_PLATFORM_SRC)/native/sun/bridge
|
||||
vpath %.DEF $(CLOSED_PLATFORM_SRC)/native/sun/bridge
|
||||
vpath %.rc $(CLOSED_PLATFORM_SRC)/native/sun/bridge
|
||||
vpath %.c $(CLOSED_PLATFORM_SRC)/native/sun/bridge
|
||||
vpath %.h $(CLOSED_PLATFORM_SRC)/native/sun/bridge
|
||||
|
||||
#
|
||||
# Extra clean rule.
|
||||
#
|
||||
clean clobber::
|
||||
$(RM) $(FILES_h)
|
65
jdk/make/bridge/Makefile
Normal file
65
jdk/make/bridge/Makefile
Normal file
|
@ -0,0 +1,65 @@
|
|||
#
|
||||
# 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. Oracle designates this
|
||||
# particular file as subject to the "Classpath" exception as provided
|
||||
# by Oracle in the LICENSE file that accompanied this code.
|
||||
#
|
||||
# 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.
|
||||
#
|
||||
|
||||
#
|
||||
# Makefile for building Java Access Bridge
|
||||
#
|
||||
|
||||
BUILDDIR = ..
|
||||
include $(BUILDDIR)/common/Defs.gmk
|
||||
|
||||
#
|
||||
#
|
||||
ifndef OPENJDK
|
||||
ifeq ($(PLATFORM), windows)
|
||||
include $(BUILDDIR)/common/Subdirs.gmk
|
||||
|
||||
#
|
||||
# build for 32 and 64 bit (new api)
|
||||
#
|
||||
SUBDIRS = Jaccess JavaAccessBridge WindowsAccessBridge JAWTAccessBridge AccessBridgeJava Jabswitch
|
||||
#
|
||||
# build for legacy
|
||||
#
|
||||
ifeq ($(ARCH_DATA_MODEL), 32)
|
||||
OTHERSUBDIRS_MAKEFLAGS += ABLEGACY=true
|
||||
OTHERSUBDIRS = JavaAccessBridge WindowsAccessBridge JAWTAccessBridge AccessBridgeJava
|
||||
endif
|
||||
|
||||
ifeq ($(ARCH_DATA_MODEL), 32)
|
||||
all build clean clobber ::
|
||||
$(SUBDIRS-loop)
|
||||
$(OTHERSUBDIRS-loop)
|
||||
else
|
||||
all build clean clobber ::
|
||||
$(SUBDIRS-loop)
|
||||
endif
|
||||
|
||||
clean::
|
||||
$(RM) -r $(CLASSBINDIR) $(CLASSBINDIR)
|
||||
|
||||
endif # PLATFORM
|
||||
endif #OPENJDK
|
||||
|
35
jdk/make/bridge/WindowsAccessBridge/Files_cpp.gmk
Normal file
35
jdk/make/bridge/WindowsAccessBridge/Files_cpp.gmk
Normal file
|
@ -0,0 +1,35 @@
|
|||
#
|
||||
# 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. Oracle designates this
|
||||
# particular file as subject to the "Classpath" exception as provided
|
||||
# by Oracle in the LICENSE file that accompanied this code.
|
||||
#
|
||||
# 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.
|
||||
#
|
||||
|
||||
#
|
||||
# Native files to compile.
|
||||
FILES_cpp = \
|
||||
AccessBridgeJavaVMInstance.cpp \
|
||||
AccessBridgeMessageQueue.cpp \
|
||||
AccessBridgeMessages.cpp \
|
||||
AccessBridgeWindowsEntryPoints.cpp \
|
||||
WinAccessBridge.cpp \
|
||||
AccessBridgeDebug.cpp \
|
||||
AccessBridgeEventHandler.cpp
|
71
jdk/make/bridge/WindowsAccessBridge/Makefile
Normal file
71
jdk/make/bridge/WindowsAccessBridge/Makefile
Normal file
|
@ -0,0 +1,71 @@
|
|||
#
|
||||
# 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. Oracle designates this
|
||||
# particular file as subject to the "Classpath" exception as provided
|
||||
# by Oracle in the LICENSE file that accompanied this code.
|
||||
#
|
||||
# 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.
|
||||
#
|
||||
|
||||
#
|
||||
# Makefile for building WindowsAccessBridge.dll
|
||||
#
|
||||
|
||||
BUILDDIR = ../..
|
||||
LIBRARY = WindowsAccessBridge$(ABSUFFIX)
|
||||
include $(BUILDDIR)/common/Defs.gmk
|
||||
|
||||
# Indicate we want the C++ compiler to do the linking.
|
||||
CPLUSPLUSLIBRARY=true
|
||||
|
||||
ifeq ($(ARCH_DATA_MODEL), 64)
|
||||
ABSUFFIX = -64
|
||||
ACCESSBRIDGE_ARCH = ACCESSBRIDGE_ARCH_64
|
||||
ABRIDGE_MACHINE=X64
|
||||
else
|
||||
ifeq ($(ARCH_DATA_MODEL), 32)
|
||||
ABRIDGE_MACHINE=I386
|
||||
ifdef ABLEGACY
|
||||
ABSUFFIX =
|
||||
ACCESSBRIDGE_ARCH = ACCESSBRIDGE_ARCH_LEGACY
|
||||
else
|
||||
ABSUFFIX = -32
|
||||
ACCESSBRIDGE_ARCH = ACCESSBRIDGE_ARCH_32
|
||||
endif
|
||||
endif
|
||||
endif
|
||||
|
||||
include FILES_cpp.gmk
|
||||
|
||||
VERSIONINFO_RESOURCE = $(CLOSED_PLATFORM_SRC)/native/sun/bridge/AccessBridgeStatusWindow.rc
|
||||
|
||||
OTHER_CPPFLAGS += -MT -D$(ACCESSBRIDGE_ARCH) -I "$(INCLUDEDIR)" -I "$(PLATFORM_INCLUDE)"
|
||||
LDLIBS += kernel32.lib user32.lib gdi32.lib winspool.lib jawt.lib comdlg32.lib advapi32.lib shell32.lib \
|
||||
ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /subsystem:windows /dll /incremental:no /machine:$(ABRIDGE_MACHINE) \
|
||||
/def:$(CLOSED_PLATFORM_SRC)/native/sun/bridge/WinAccessBridge.DEF /libpath:"$(LIBDIR)"
|
||||
|
||||
|
||||
#
|
||||
# Rules
|
||||
#
|
||||
include $(BUILDDIR)/common/Library.gmk
|
||||
|
||||
vpath %.cpp $(CLOSED_PLATFORM_SRC)/native/sun/bridge
|
||||
vpath %.DEF $(CLOSED_PLATFORM_SRC)/native/sun/bridge
|
||||
vpath %.rc $(CLOSED_PLATFORM_SRC)/native/sun/bridge
|
|
@ -127,6 +127,11 @@ CORE_PKGS = \
|
|||
java.sql \
|
||||
java.text \
|
||||
java.text.spi \
|
||||
java.time \
|
||||
java.time.temporal \
|
||||
java.time.calendar \
|
||||
java.time.format \
|
||||
java.time.zone \
|
||||
java.util \
|
||||
java.util.concurrent \
|
||||
java.util.concurrent.atomic \
|
||||
|
|
Some files were not shown because too many files have changed in this diff Show more
Loading…
Add table
Add a link
Reference in a new issue