stan/jdk-24
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

8284191: Replace usages of 'a the' in hotspot and java.base

Browse Source 
Reviewed-by: lancea, wetmore, naoto, iris, kevinw, xuelei
This commit is contained in:
Alexey Ivanov 2022-05-24 11:25:13 +00:00
parent 9473c383c6
commit e0d361cea9
162 changed files with 292 additions and 303 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
src/hotspot/cpu/aarch64/frame_aarch64.cpp
View File

@ -420,7 +420,7 @@ void frame::verify_deopt_original_pc(CompiledMethod* nm, intptr_t* unextended_sp
address original_pc = nm->get_original_pc(&fr);
assert(nm->insts_contains_inclusive(original_pc),
"original PC must be in the main code section of the the compiled method (or must be immediately following it)");
"original PC must be in the main code section of the compiled method (or must be immediately following it)");
}
#endif

2
src/hotspot/cpu/aarch64/frame_aarch64.inline.hpp
View File

@ -77,7 +77,7 @@ inline void frame::setup(address pc) {
_pc = original_pc;
_deopt_state = is_deoptimized;
assert(_cb == NULL || _cb->as_compiled_method()->insts_contains_inclusive(_pc),
"original PC must be in the main code section of the the compiled method (or must be immediately following it)");
"original PC must be in the main code section of the compiled method (or must be immediately following it)");
} else {
if (_cb == SharedRuntime::deopt_blob()) {
_deopt_state = is_deoptimized;

5
src/hotspot/cpu/aarch64/sharedRuntime_aarch64.cpp
View File

@ -1978,7 +1978,7 @@ void SharedRuntime::generate_deopt_blob() {
// -------------
// This code enters when returning to a de-optimized nmethod. A return
// address has been pushed on the the stack, and return values are in
// address has been pushed on the stack, and return values are in
// registers.
// If we are doing a normal deopt then we were called from the patched
// nmethod from the point we returned to the nmethod. So the return
@ -2729,7 +2729,7 @@ RuntimeStub* SharedRuntime::generate_resolve_blob(address destination, const cha
__ str(r0, Address(sp, reg_save.rscratch1_offset_in_bytes()));
reg_save.restore_live_registers(masm);
// We are back the the original state on entry and ready to go.
// We are back to the original state on entry and ready to go.
__ br(rscratch1);
@ -2892,4 +2892,3 @@ void OptoRuntime::generate_exception_blob() {
}
#endif // COMPILER2

2
src/hotspot/cpu/arm/frame_arm.cpp
View File

@ -338,7 +338,7 @@ void frame::verify_deopt_original_pc(CompiledMethod* nm, intptr_t* unextended_sp
address original_pc = nm->get_original_pc(&fr);
assert(nm->insts_contains_inclusive(original_pc),
"original PC must be in the main code section of the the compiled method (or must be immediately following it)");
"original PC must be in the main code section of the compiled method (or must be immediately following it)");
assert(nm->is_method_handle_return(original_pc) == is_method_handle_return, "must be");
}
#endif

2
src/hotspot/cpu/arm/frame_arm.inline.hpp
View File

@ -85,7 +85,7 @@ inline frame::frame(intptr_t* sp, intptr_t* unextended_sp, intptr_t* fp, address
if (original_pc != NULL) {
_pc = original_pc;
assert(_cb->as_compiled_method()->insts_contains_inclusive(_pc),
"original PC must be in the main code section of the the compiled method (or must be immediately following it)");
"original PC must be in the main code section of the compiled method (or must be immediately following it)");
_deopt_state = is_deoptimized;
} else {
_deopt_state = not_deoptimized;

2
src/hotspot/cpu/arm/stubGenerator_arm.cpp
View File

@ -1788,7 +1788,7 @@ class StubGenerator: public StubCodeGenerator {
// 'count' must not be less then the returned value
// 'to' must be aligned by bytes_per_count but must not be aligned by wordSize
// shifts 'to' by the number of written bytes (so that it becomes the bound of memory to be written)
// decreases 'count' by the the number of elements written
// decreases 'count' by the number of elements written
// Rval's MSBs or LSBs remain to be written further by generate_{forward,backward}_shifted_copy_loop
int align_dst(Register to, Register count, Register Rval, Register tmp,
int to_remainder, int bytes_per_count, bool forward) {

2
src/hotspot/cpu/ppc/stubGenerator_ppc.cpp
View File

@ -3613,7 +3613,7 @@ class StubGenerator: public StubCodeGenerator {
#define BLK_OFFSETOF(x) (offsetof(constant_block, x))
// In little-endian mode, the lxv instruction loads the element at EA into
// element 15 of the the vector register, EA+1 goes into element 14, and so
// element 15 of the vector register, EA+1 goes into element 14, and so
// on.
//
// To make a look-up table easier to read, ARRAY_TO_LXV_ORDER reverses the

2
src/hotspot/cpu/ppc/templateInterpreterGenerator_ppc.cpp
View File

@ -1584,7 +1584,7 @@ address TemplateInterpreterGenerator::generate_native_entry(bool synchronized) {
return_pc /* return pc */);
__ merge_frames(/*top_frame_sp*/ R21_sender_SP, noreg, R11_scratch1, R12_scratch2);
// Load the PC of the the exception handler into LR.
// Load the PC of the exception handler into LR.
__ mtlr(R3_RET);
// Load exception into R3_ARG1 and clear pending exception in thread.

2
src/hotspot/cpu/riscv/frame_riscv.cpp
View File

@ -375,7 +375,7 @@ void frame::verify_deopt_original_pc(CompiledMethod* nm, intptr_t* unextended_sp
assert_cond(nm != NULL);
address original_pc = nm->get_original_pc(&fr);
assert(nm->insts_contains_inclusive(original_pc),
"original PC must be in the main code section of the the compiled method (or must be immediately following it)");
"original PC must be in the main code section of the compiled method (or must be immediately following it)");
}
#endif

6
src/hotspot/cpu/riscv/sharedRuntime_riscv.cpp
View File

@ -822,7 +822,7 @@ static void object_move(MacroAssembler* masm,
__ bind(notZero1);
} else {
// Oop is in an a register we must store it to the space we reserve
// Oop is in a register we must store it to the space we reserve
// on the stack for oop_handles and pass a handle if oop is non-NULL
const Register rOop = src.first()->as_Register();
@ -1898,7 +1898,7 @@ void SharedRuntime::generate_deopt_blob() {
// -------------
// This code enters when returning to a de-optimized nmethod. A return
// address has been pushed on the the stack, and return values are in
// address has been pushed on the stack, and return values are in
// registers.
// If we are doing a normal deopt then we were called from the patched
// nmethod from the point we returned to the nmethod. So the return
@ -2591,7 +2591,7 @@ RuntimeStub* SharedRuntime::generate_resolve_blob(address destination, const cha
__ sd(x10, Address(sp, reg_saver.reg_offset_in_bytes(t0)));
reg_saver.restore_live_registers(masm);
// We are back the the original state on entry and ready to go.
// We are back to the original state on entry and ready to go.
__ jr(t0);

4
src/hotspot/cpu/s390/c1_CodeStubs_s390.cpp
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2016, 2020, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2016, 2022, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2016, 2018 SAP SE. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
@ -373,7 +373,7 @@ void PatchingStub::emit_code(LIR_Assembler* ce) {
// Now emit the patch record telling the runtime how to find the
// pieces of the patch. We only need 3 bytes but to help the disassembler
// we make the data look like a the following add instruction:
// we make the data look like the following add instruction:
// A R1, D2(X2, B2)
// which requires 4 bytes.
int sizeof_patch_record = 4;

2
src/hotspot/cpu/s390/sharedRuntime_s390.cpp
View File

@ -3001,7 +3001,7 @@ RuntimeStub* SharedRuntime::generate_resolve_blob(address destination, const cha
// get the returned method
__ get_vm_result_2(Z_method);
// We are back the the original state on entry and ready to go.
// We are back to the original state on entry and ready to go.
__ z_br(Z_R1_scratch);
// Pending exception after the safepoint

2
src/hotspot/cpu/x86/frame_x86.cpp
View File

@ -414,7 +414,7 @@ void frame::verify_deopt_original_pc(CompiledMethod* nm, intptr_t* unextended_sp
address original_pc = nm->get_original_pc(&fr);
assert(nm->insts_contains_inclusive(original_pc),
"original PC must be in the main code section of the the compiled method (or must be immediately following it) original_pc: " INTPTR_FORMAT " unextended_sp: " INTPTR_FORMAT " name: %s", p2i(original_pc), p2i(unextended_sp), nm->name());
"original PC must be in the main code section of the compiled method (or must be immediately following it) original_pc: " INTPTR_FORMAT " unextended_sp: " INTPTR_FORMAT " name: %s", p2i(original_pc), p2i(unextended_sp), nm->name());
}
#endif

2
src/hotspot/cpu/x86/frame_x86.inline.hpp
View File

@ -72,7 +72,7 @@ inline void frame::setup(address pc) {
_pc = original_pc;
_deopt_state = is_deoptimized;
assert(_cb == NULL || _cb->as_compiled_method()->insts_contains_inclusive(_pc),
"original PC must be in the main code section of the the compiled method (or must be immediately following it)");
"original PC must be in the main code section of the compiled method (or must be immediately following it)");
} else {
if (_cb == SharedRuntime::deopt_blob()) {
_deopt_state = is_deoptimized;

4
src/hotspot/cpu/x86/globals_x86.hpp
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2000, 2022, 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
@ -40,7 +40,7 @@ define_pd_global(uintx, CodeCacheSegmentSize, 64 COMPILER1_AND_COMPILER2_PRES
// assign a different value for C2 without touching a number of files. Use
// #ifdef to minimize the change as it's late in Mantis. -- FIXME.
// c1 doesn't have this problem because the fix to 4858033 assures us
// the the vep is aligned at CodeEntryAlignment whereas c2 only aligns
// the vep is aligned at CodeEntryAlignment whereas c2 only aligns
// the uep and the vep doesn't get real alignment but just slops on by
// only assured that the entry instruction meets the 5 byte size requirement.
#if COMPILER2_OR_JVMCI

2
src/hotspot/cpu/x86/macroAssembler_x86.cpp
View File

@ -1068,7 +1068,7 @@ void MacroAssembler::object_move(OopMap* map,
cmovptr(Assembler::equal, rHandle, Address(rbp, reg2offset_in(src.first())));
} else {
// Oop is in an a register we must store it to the space we reserve
// Oop is in a register we must store it to the space we reserve
// on the stack for oop_handles and pass a handle if oop is non-NULL
const Register rOop = src.first()->as_Register();

8
src/hotspot/cpu/x86/sharedRuntime_x86_32.cpp
View File

@ -1108,7 +1108,7 @@ static void object_move(MacroAssembler* masm,
*receiver_offset = (offset_in_older_frame + framesize_in_slots) * VMRegImpl::stack_slot_size;
}
} else {
// Oop is in an a register we must store it to the space we reserve
// Oop is in a register we must store it to the space we reserve
// on the stack for oop_handles
const Register rOop = src.first()->as_Register();
const Register rHandle = rax;
@ -1653,7 +1653,7 @@ nmethod* SharedRuntime::generate_native_wrapper(MacroAssembler* masm,
}
// Change state to native (we save the return address in the thread, since it might not
// be pushed on the stack when we do a a stack traversal). It is enough that the pc()
// be pushed on the stack when we do a stack traversal). It is enough that the pc()
// points into the right code segment. It does not have to be the correct return pc.
// We use the same pc/oopMap repeatedly when we call out
@ -2107,7 +2107,7 @@ void SharedRuntime::generate_deopt_blob() {
// -------------
// This code enters when returning to a de-optimized nmethod. A return
// address has been pushed on the the stack, and return values are in
// address has been pushed on the stack, and return values are in
// registers.
// If we are doing a normal deopt then we were called from the patched
// nmethod from the point we returned to the nmethod. So the return
@ -2835,7 +2835,7 @@ RuntimeStub* SharedRuntime::generate_resolve_blob(address destination, const cha
RegisterSaver::restore_live_registers(masm);
// We are back the the original state on entry and ready to go.
// We are back to the original state on entry and ready to go.
__ jmp(rax);

6
src/hotspot/cpu/x86/sharedRuntime_x86_64.cpp
View File

@ -1815,7 +1815,7 @@ nmethod* SharedRuntime::generate_native_wrapper(MacroAssembler* masm,
}
// Change state to native (we save the return address in the thread, since it might not
// be pushed on the stack when we do a a stack traversal). It is enough that the pc()
// be pushed on the stack when we do a stack traversal). It is enough that the pc()
// points into the right code segment. It does not have to be the correct return pc.
// We use the same pc/oopMap repeatedly when we call out
@ -2253,7 +2253,7 @@ void SharedRuntime::generate_deopt_blob() {
// -------------
// This code enters when returning to a de-optimized nmethod. A return
// address has been pushed on the the stack, and return values are in
// address has been pushed on the stack, and return values are in
// registers.
// If we are doing a normal deopt then we were called from the patched
// nmethod from the point we returned to the nmethod. So the return
@ -3003,7 +3003,7 @@ RuntimeStub* SharedRuntime::generate_resolve_blob(address destination, const cha
RegisterSaver::restore_live_registers(masm);
// We are back the the original state on entry and ready to go.
// We are back to the original state on entry and ready to go.
__ jmp(rax);

5
src/hotspot/os/posix/jvm_posix.cpp
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 1999, 2018, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 1999, 2022, 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
@ -67,7 +67,7 @@ JVM_ENTRY_NO_ENV(void*, JVM_RegisterSignal(jint sig, void* handler))
/* The following signals are used for Shutdown Hooks support. However, if
ReduceSignalUsage (-Xrs) is set, Shutdown Hooks must be invoked via
System.exit(), Java is not allowed to use these signals, and the the
System.exit(), Java is not allowed to use these signals, and the
user is allowed to set his own _native_ handler for these signals and
invoke System.exit() as needed. Terminator.setup() is avoiding
registration of these signals when -Xrs is present.
@ -114,4 +114,3 @@ JVM_ENTRY_NO_ENV(jboolean, JVM_RaiseSignal(jint sig))
os::signal_raise(sig);
return JNI_TRUE;
JVM_END

6
src/hotspot/os/windows/jvm_windows.cpp
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 1998, 2010, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 1998, 2022, 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
@ -56,7 +56,7 @@ JVM_ENTRY_NO_ENV(void*, JVM_RegisterSignal(jint sig, void* handler))
/* The following signals are used for Shutdown Hooks support. However, if
ReduceSignalUsage (-Xrs) is set, Shutdown Hooks must be invoked via
System.exit(), Java is not allowed to use these signals, and the the
System.exit(), Java is not allowed to use these signals, and the
user is allowed to set his own _native_ handler for these signals and
invoke System.exit() as needed. Terminator.setup() is avoiding
registration of these signals when -Xrs is present. */
@ -87,5 +87,3 @@ JVM_ENTRY_NO_ENV(jboolean, JVM_RaiseSignal(jint sig))
os::signal_raise(sig);
return JNI_TRUE;
JVM_END

4
src/hotspot/os/windows/perfMemory_windows.cpp
View File

@ -667,7 +667,7 @@ static void cleanup_sharedmem_resources(const char* dirname) {
// indicates that it is still running, the file file resources
// are not removed. If the process id is invalid, or if we don't
// have permissions to check the process status, or if the process
// id is valid and the process has terminated, the the file resources
// id is valid and the process has terminated, the file resources
// are assumed to be stale and are removed.
//
if (pid == os::current_process_id() || !is_alive(pid)) {
@ -1663,7 +1663,7 @@ static void open_file_mapping(int vmid, char** addrp, size_t* sizep, TRAPS) {
INTPTR_FORMAT, size, vmid, mapAddress);
}
// this method unmaps the the mapped view of the the
// this method unmaps the mapped view of the
// file mapping object.
//
static void remove_file_mapping(char* addr) {

8
src/hotspot/os_cpu/aix_ppc/atomic_aix_ppc.hpp
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 1997, 2019, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 1997, 2022, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2012, 2019 SAP SE. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
@ -242,7 +242,7 @@ inline T Atomic::PlatformCmpxchg<1>::operator()(T volatile* dest,
STATIC_ASSERT(1 == sizeof(T));
// Note that cmpxchg guarantees a two-way memory barrier across
// the cmpxchg, so it's really a a 'fence_cmpxchg_fence' if not
// the cmpxchg, so it's really a 'fence_cmpxchg_fence' if not
// specified otherwise (see atomic.hpp).
// Using 32 bit internally.
@ -312,7 +312,7 @@ inline T Atomic::PlatformCmpxchg<4>::operator()(T volatile* dest,
STATIC_ASSERT(4 == sizeof(T));
// Note that cmpxchg guarantees a two-way memory barrier across
// the cmpxchg, so it's really a a 'fence_cmpxchg_fence' if not
// the cmpxchg, so it's really a 'fence_cmpxchg_fence' if not
// specified otherwise (see atomic.hpp).
T old_value;
@ -362,7 +362,7 @@ inline T Atomic::PlatformCmpxchg<8>::operator()(T volatile* dest,
STATIC_ASSERT(8 == sizeof(T));
// Note that cmpxchg guarantees a two-way memory barrier across
// the cmpxchg, so it's really a a 'fence_cmpxchg_fence' if not
// the cmpxchg, so it's really a 'fence_cmpxchg_fence' if not
// specified otherwise (see atomic.hpp).
T old_value;

8
src/hotspot/os_cpu/linux_ppc/atomic_linux_ppc.hpp
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 1997, 2019, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 1997, 2022, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2012, 2019 SAP SE. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
@ -242,7 +242,7 @@ inline T Atomic::PlatformCmpxchg<1>::operator()(T volatile* dest,
STATIC_ASSERT(1 == sizeof(T));
// Note that cmpxchg guarantees a two-way memory barrier across
// the cmpxchg, so it's really a a 'fence_cmpxchg_fence' if not
// the cmpxchg, so it's really a 'fence_cmpxchg_fence' if not
// specified otherwise (see atomic.hpp).
// Using 32 bit internally.
@ -312,7 +312,7 @@ inline T Atomic::PlatformCmpxchg<4>::operator()(T volatile* dest,
STATIC_ASSERT(4 == sizeof(T));
// Note that cmpxchg guarantees a two-way memory barrier across
// the cmpxchg, so it's really a a 'fence_cmpxchg_fence' if not
// the cmpxchg, so it's really a 'fence_cmpxchg_fence' if not
// specified otherwise (see atomic.hpp).
T old_value;
@ -362,7 +362,7 @@ inline T Atomic::PlatformCmpxchg<8>::operator()(T volatile* dest,
STATIC_ASSERT(8 == sizeof(T));
// Note that cmpxchg guarantees a two-way memory barrier across
// the cmpxchg, so it's really a a 'fence_cmpxchg_fence' if not
// the cmpxchg, so it's really a 'fence_cmpxchg_fence' if not
// specified otherwise (see atomic.hpp).
T old_value;

2
src/hotspot/share/asm/assembler.hpp
View File

@ -120,7 +120,7 @@ class Label {
#endif // PRODUCT
/**
* Returns the position of the the Label in the code buffer
* Returns the position of the Label in the code buffer
* The position is a 'locator', which encodes both offset and section.
*/
int loc() const {

6
src/hotspot/share/c1/c1_GraphBuilder.cpp
View File

@ -3139,7 +3139,7 @@ BlockBegin* GraphBuilder::setup_start_block(int osr_bci, BlockBegin* std_entry,
// necessary if std_entry is also a backward branch target because
// then phi functions may be necessary in the header block. It's
// also necessary when profiling so that there's a single block that
// can increment the the counters.
// can increment the counters.
// In addition, with range check elimination, we may need a valid block
// that dominates all the rest to insert range predicates.
BlockBegin* new_header_block;
@ -3326,7 +3326,7 @@ GraphBuilder::GraphBuilder(Compilation* compilation, IRScope* scope)
// Compiles where the root method is an intrinsic need a special
// compilation environment because the bytecodes for the method
// shouldn't be parsed during the compilation, only the special
// Intrinsic node should be emitted. If this isn't done the the
// Intrinsic node should be emitted. If this isn't done the
// code for the inlined version will be different than the root
// compiled version which could lead to monotonicity problems on
// intel.
@ -3844,7 +3844,7 @@ void GraphBuilder::fill_sync_handler(Value lock, BlockBegin* sync_handler, bool
}
}
// perform the throw as if at the the call site
// perform the throw as if at the call site
apush(exception);
throw_op(bci);

4
src/hotspot/share/c1/c1_LinearScan.hpp
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2005, 2021, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2005, 2022, 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
@ -690,7 +690,7 @@ class IntervalWalker : public CompilationResourceObj {
void walk_to(IntervalState state, int from);
// activate_current() is called when an unhandled interval becomes active (in current(), current_kind()).
// Return false if current() should not be moved the the active interval list.
// Return false if current() should not be moved the active interval list.
// It is safe to append current to any interval list but the unhandled list.
virtual bool activate_current() { return true; }

4
src/hotspot/share/cds/filemap.cpp
View File

@ -1906,12 +1906,12 @@ bool FileMapInfo::relocate_pointers_in_core_regions(intx addr_delta) {
BitMapView ptrmap((BitMap::bm_word_t*)bitmap_base, ptrmap_size_in_bits);
// Patch all pointers in the the mapped region that are marked by ptrmap.
// Patch all pointers in the mapped region that are marked by ptrmap.
address patch_base = (address)mapped_base();
address patch_end = (address)mapped_end();
// the current value of the pointers to be patched must be within this
// range (i.e., must be between the requesed base address, and the of the current archive).
// range (i.e., must be between the requested base address and the address of the current archive).
// Note: top archive may point to objects in the base archive, but not the other way around.
address valid_old_base = (address)header()->requested_base_address();
address valid_old_end = valid_old_base + mapping_end_offset();

4
src/hotspot/share/classfile/javaAssertions.cpp
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2000, 2022, 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
@ -58,7 +58,7 @@ int JavaAssertions::OptionList::count(OptionList* p) {
void JavaAssertions::addOption(const char* name, bool enable) {
assert(name != 0, "must have a name");
// Copy the name. The storage needs to exist for the the lifetime of the vm;
// Copy the name. The storage needs to exist for the lifetime of the vm;
// it is never freed, so will be leaked (along with other option strings -
// e.g., bootclasspath) if a process creates/destroys multiple VMs.
int len = (int)strlen(name);

4
src/hotspot/share/classfile/stackMapTable.hpp
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2003, 2019, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2003, 2022, 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
@ -125,7 +125,7 @@ class StackMapReader : StackObj {
int32_t size, int32_t max_size, TRAPS) {
if (size < 0 || size > max_size) {
// Since this error could be caused someone rewriting the method
// but not knowing to update the stackmap data, we call the the
// but not knowing to update the stackmap data, we call the
// verifier's error method, which may not throw an exception and
// failover to the old verifier instead.
_verifier->class_format_error(

2
src/hotspot/share/code/nmethod.cpp
View File

@ -3230,7 +3230,7 @@ const char* nmethod::reloc_string_for(u_char* begin, u_char* end) {
return have_one ? "other" : NULL;
}
// Return a the last scope in (begin..end]
// Return the last scope in (begin..end]
ScopeDesc* nmethod::scope_desc_in(address begin, address end) {
PcDesc* p = pc_desc_near(begin+1);
if (p != NULL && p->real_pc(this) <= end) {

4
src/hotspot/share/compiler/disassembler.cpp
View File

@ -212,7 +212,7 @@ class decode_env {
decode_env(address start, address end, outputStream* output
NOT_PRODUCT(COMMA const AsmRemarks* remarks = NULL COMMA ptrdiff_t disp = 0));
// Add 'original_start' argument which is the the original address
// Add 'original_start' argument which is the original address
// the instructions were located at (if this is not equal to 'start').
address decode_instructions(address start, address end, address original_start = NULL);
@ -695,7 +695,7 @@ static int printf_to_env(void* env_pv, const char* format, ...) {
return (int)(cnt1 - cnt0);
}
// The 'original_start' argument holds the the original address where
// The 'original_start' argument holds the original address where
// the instructions were located in the originating system. If zero (NULL)
// is passed in, there is no original address.
address decode_env::decode_instructions(address start, address end, address original_start /* = 0*/) {

2
src/hotspot/share/gc/g1/g1AllocRegion.hpp
View File

@ -92,7 +92,7 @@ protected:
// The memory node index this allocation region belongs to.
uint _node_index;
// Reset the alloc region to point a the dummy region.
// Reset the alloc region to point the dummy region.
void reset_alloc_region();
// Perform a non-MT-safe allocation out of the given region.

4
src/hotspot/share/gc/g1/g1BatchedTask.hpp
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2021, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2021, 2022, 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
@ -68,7 +68,7 @@ public:
// Called by G1BatchedTask to determine total number of workers.
virtual double worker_cost() const = 0;
// Called by G1BatchedTask to provide information about the the maximum
// Called by G1BatchedTask to provide information about the maximum
// number of workers for all subtasks after it has been determined.
virtual void set_max_workers(uint max_workers) { }

4
src/hotspot/share/gc/g1/g1BlockOffsetTable.cpp
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2001, 2021, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2001, 2022, 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
@ -133,7 +133,7 @@ void G1BlockOffsetTablePart::set_remainder_to_point_to_start_incl(size_t start_c
size_t start_card_for_region = start_card;
u_char offset = max_jubyte;
for (uint i = 0; i < BOTConstants::N_powers; i++) {
// -1 so that the the card with the actual offset is counted. Another -1
// -1 so that the card with the actual offset is counted. Another -1
// so that the reach ends in this region and not at the start
// of the next.
size_t reach = start_card - 1 + (BOTConstants::power_to_cards_back(i+1) - 1);

2
src/hotspot/share/gc/g1/g1CollectedHeap.cpp
View File

@ -3398,7 +3398,7 @@ void G1CollectedHeap::update_used_after_gc(bool evacuation_failed) {
assert(_archive_allocator == nullptr, "must be, should not contribute to used");
} else {
// The "used" of the the collection set have already been subtracted
// The "used" of the collection set have already been subtracted
// when they were freed. Add in the bytes used.
increase_used(_bytes_used_during_gc);
}

2
src/hotspot/share/gc/g1/g1ConcurrentMark.cpp
View File

@ -1554,7 +1554,7 @@ class G1CMDrainMarkingStackClosure : public VoidClosure {
//
// G1CMTask::do_marking_step() is called in a loop, which we'll exit
// if there's nothing more to do (i.e. we've completely drained the
// entries that were pushed as a a result of applying the 'keep alive'
// entries that were pushed as a result of applying the 'keep alive'
// closure to the entries on the discovered ref lists) or we overflow
// the global marking stack.
//

4
src/hotspot/share/gc/g1/g1YoungGCPostEvacuateTasks.cpp
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2021, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2021, 2022, 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
@ -167,7 +167,7 @@ class G1FreeHumongousRegionClosure : public HeapRegionClosure {
//
// Other implementation considerations:
// - never consider object arrays at this time because they would pose
// considerable effort for cleaning up the the remembered sets. This is
// considerable effort for cleaning up the remembered sets. This is
// required because stale remembered sets might reference locations that
// are currently allocated into.
bool is_reclaimable(uint region_idx) const {

4
src/hotspot/share/gc/g1/g1YoungGenSizer.hpp
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2016, 2019, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2016, 2022, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
@ -36,7 +36,7 @@
// internally work with a number of regions instead. So, some rounding
// will occur.
//
// If nothing related to the the young gen size is set on the command
// If nothing related to the young gen size is set on the command
// line we should allow the young gen to be between G1NewSizePercent
// and G1MaxNewSizePercent of the heap size. This means that every time
// the heap size changes, the limits for the young gen size will be

4
src/hotspot/share/gc/parallel/mutableNUMASpace.cpp
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2006, 2021, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2006, 2022, 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
@ -728,7 +728,7 @@ void MutableNUMASpace::initialize(MemRegion mr,
}
// Set the top of the whole space.
// Mark the the holes in chunks below the top() as invalid.
// Mark the holes in chunks below the top() as invalid.
void MutableNUMASpace::set_top(HeapWord* value) {
bool found_top = false;
for (int i = 0; i < lgrp_spaces()->length();) {

4
src/hotspot/share/gc/parallel/parallelScavengeHeap.inline.hpp
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2006, 2020, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2006, 2022, 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,7 +44,7 @@ inline void ParallelScavengeHeap::invoke_scavenge() {
}
inline bool ParallelScavengeHeap::is_in_young(const oop p) const {
// Assumes the the old gen address range is lower than that of the young gen.
// Assumes the old gen address range is lower than that of the young gen.
bool result = cast_from_oop<HeapWord*>(p) >= young_gen()->reserved().start();
assert(result == young_gen()->is_in_reserved(p),
"incorrect test - result=%d, p=" PTR_FORMAT, result, p2i((void*)p));

4
src/hotspot/share/gc/parallel/psParallelCompact.hpp
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2005, 2021, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2005, 2022, 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
@ -1116,7 +1116,7 @@ class PSParallelCompact : AllStatic {
idx_t bit);
// Summary phase utility routine to fill dead space (if any) at the dense
// prefix boundary. Should only be called if the the dense prefix is
// prefix boundary. Should only be called if the dense prefix is
// non-empty.
static void fill_dense_prefix_end(SpaceId id);

4
src/hotspot/share/gc/shared/adaptiveSizePolicy.hpp
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2004, 2019, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2004, 2022, 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
@ -153,7 +153,7 @@ class AdaptiveSizePolicy : public CHeapObj<mtGC> {
// increase the tenuring threshold because of the total major GC cost
// is greater than the total minor GC cost
bool _increment_tenuring_threshold_for_gc_cost;
// decrease the tenuring threshold because of the the total minor GC
// decrease the tenuring threshold because of the total minor GC
// cost is greater than the total major GC cost
bool _decrement_tenuring_threshold_for_gc_cost;
// decrease due to survivor size limit

4
src/hotspot/share/gc/shared/blockOffsetTable.cpp
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2000, 2019, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2000, 2022, 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
@ -193,7 +193,7 @@ BlockOffsetArray::set_remainder_to_point_to_start_incl(size_t start_card, size_t
size_t start_card_for_region = start_card;
u_char offset = max_jubyte;
for (uint i = 0; i < BOTConstants::N_powers; i++) {
// -1 so that the the card with the actual offset is counted. Another -1
// -1 so that the card with the actual offset is counted. Another -1
// so that the reach ends in this region and not at the start
// of the next.
size_t reach = start_card - 1 + (BOTConstants::power_to_cards_back(i+1) - 1);

2
src/hotspot/share/gc/shared/genCollectedHeap.hpp
View File

@ -204,7 +204,7 @@ public:
// Returns true if the reference is to an object in the reserved space
// for the young generation.
// Assumes the the young gen address range is less than that of the old gen.
// Assumes the young gen address range is less than that of the old gen.
bool is_in_young(oop p) const;
virtual bool requires_barriers(stackChunkOop obj) const;

2
src/hotspot/share/gc/shared/generation.cpp
View File

@ -50,7 +50,7 @@ Generation::Generation(ReservedSpace rs, size_t initial_size) :
vm_exit_during_initialization("Could not reserve enough space for "
"object heap");
}
// Mangle all of the the initial generation.
// Mangle all of the initial generation.
if (ZapUnusedHeapArea) {
MemRegion mangle_region((HeapWord*)_virtual_space.low(),
(HeapWord*)_virtual_space.high());

4
src/hotspot/share/gc/shared/space.hpp
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 1997, 2020, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 1997, 2022, 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
@ -446,7 +446,7 @@ class ContiguousSpace: public CompactibleSpace {
// In debug mode mangle (write it with a particular bit
// pattern) the unused part of a space.
// Used to save the an address in a space for later use during mangling.
// Used to save the address in a space for later use during mangling.
void set_top_for_allocations(HeapWord* v) PRODUCT_RETURN;
// Used to save the space's current top for later use during mangling.
void set_top_for_allocations() PRODUCT_RETURN;

2
src/hotspot/share/gc/shared/spaceDecorator.hpp
View File

@ -98,7 +98,7 @@ class SpaceMangler: public CHeapObj<mtGC> {
// Return true if q matches the mangled pattern.
static bool is_mangled(HeapWord* q) PRODUCT_RETURN0;
// Used to save the an address in a space for later use during mangling.
// Used to save the address in a space for later use during mangling.
void set_top_for_allocations(HeapWord* v);
// Overwrites the unused portion of this space.

2
src/hotspot/share/gc/shenandoah/shenandoahEvacOOMHandler.hpp
View File

@ -37,7 +37,7 @@
* load-reference-barrier (i.e. it cannot copy the object to to-space), it does not
* necessarily follow we can return immediately from the LRB (and store to from-space).
*
* In very basic case, on such failure we may wait until the the evacuation is over,
* In very basic case, on such failure we may wait until the evacuation is over,
* and then resolve the forwarded copy, and to the store there. This is possible
* because other threads might still have space in their GCLABs, and successfully
* evacuate the object.

4
src/hotspot/share/interpreter/bytecodeUtils.cpp
View File

@ -183,7 +183,7 @@ class ExceptionMessageBuilder : public StackObj {
static const int _max_cause_detail = 5;
// Merges the stack the the given bci with the given stack. If there
// Merges the stack at the given bci with the given stack. If there
// is no stack at the bci, we just put the given stack there. This
// method doesn't takes ownership of the stack.
void merge(int bci, SimulatedOperandStack* stack);
@ -1149,7 +1149,7 @@ int ExceptionMessageBuilder::get_NPE_null_slot(int bci) {
int name_index = cp->name_ref_index_at(name_and_type_index);
Symbol* name = cp->symbol_at(name_index);
// Assume the the call of a constructor can never cause a NullPointerException
// Assume the call of a constructor can never cause a NullPointerException
// (which is true in Java). This is mainly used to avoid generating wrong
// messages for NullPointerExceptions created explicitly by new in Java code.
if (name != vmSymbols::object_initializer_name()) {

2
src/hotspot/share/interpreter/zero/bytecodeInterpreter.cpp
View File

@ -3176,7 +3176,7 @@ run:
// If we notify it again JVMDI will be all confused about how many frames
// are still on the stack (4340444).
//
// NOTE Further! It turns out the the JVMTI spec in fact expects to see
// NOTE Further! It turns out the JVMTI spec in fact expects to see
// method_exit events whenever we leave an activation unless it was done
// for popframe. This is nothing like jvmdi. However we are passing the
// tests at the moment (apparently because they are jvmdi based) so rather

4
src/hotspot/share/jfr/recorder/checkpoint/types/traceid/jfrTraceIdKlassQueue.hpp
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2020, 2022, 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
@ -57,7 +57,7 @@ class JfrEpochQueueKlassPolicy : public JfrCHeapObj {
void store_element(const Klass* klass, BufferPtr buffer);
// Element size is a function of the traceid value.
size_t element_size(const Klass* klass);
// Storage associated with the the queue is distributed and cached in thread locals.
// Storage associated with the queue is distributed and cached in thread locals.
BufferPtr thread_local_storage(Thread* thread) const;
void set_thread_local_storage(BufferPtr buffer, Thread* thread);
// Klasses are validated for liveness before being forwarded to the user provided callback.

4
src/hotspot/share/jfr/recorder/storage/jfrVirtualMemory.cpp
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2017, 2020, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2017, 2022, 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
@ -298,7 +298,7 @@ bool JfrVirtualMemoryManager::expand_by(size_t block_size_request_words, size_t
assert(is_aligned(reservation_size_request_words * BytesPerWord, os::vm_page_size()), "invariant");
assert(is_aligned(reservation_size_request_words * BytesPerWord, os::vm_allocation_granularity()), "invariant");
assert(block_size_request_words <= reservation_size_request_words, "invariant");
// Attempt to commit more memory from the the current virtual space reservation.
// Attempt to commit more memory from the current virtual space reservation.
if (expand_segment_by(current(), block_size_request_words)) {
return true;
}

6
src/hotspot/share/memory/heap.cpp
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 1997, 2021, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 1997, 2022, 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
@ -113,7 +113,7 @@ void CodeHeap::mark_segmap_as_used(size_t beg, size_t end, bool is_FreeBlock_joi
// are appended to the right.
// 3 - Take full advantage of the segmap being almost correct with
// the two blocks combined. Lets assume the left block consists
// of m segments. The the segmap looks like
// of m segments. The segmap looks like
// ... (m-2) (m-1) (m) 0 1 2 3 ...
// By substituting the '0' by '1', we create a valid, but
// suboptimal, segmap range covering the two blocks combined.
@ -375,7 +375,7 @@ void CodeHeap::deallocate(void* p) {
}
/**
* The segment map is used to quickly find the the start (header) of a
* The segment map is used to quickly find the start (header) of a
* code block (e.g. nmethod) when only a pointer to a location inside the
* code block is known. This works as follows:
* - The storage reserved for the code heap is divided into 'segments'.

2
src/hotspot/share/opto/block.cpp
View File

@ -1755,7 +1755,7 @@ bool Trace::backedge(CFGEdge *e) {
// Backbranch to the top of a trace
// Scroll forward through the trace from the targ_block. If we find
// a loop head before another loop top, use the the loop head alignment.
// a loop head before another loop top, use the loop head alignment.
for (Block *b = targ_block; b != NULL; b = next(b)) {
if (b->has_loop_alignment()) {
break;

2
src/hotspot/share/opto/escape.cpp
View File

@ -3532,7 +3532,7 @@ void ConnectionGraph::split_unique_types(GrowableArray<Node *> &alloc_worklist,
// Phase 3: Process MergeMem nodes from mergemem_worklist.
// Walk each memory slice moving the first node encountered of each
// instance type to the the input corresponding to its alias index.
// instance type to the input corresponding to its alias index.
uint length = mergemem_worklist.length();
for( uint next = 0; next < length; ++next ) {
MergeMemNode* nmm = mergemem_worklist.at(next);

2
src/hotspot/share/opto/graphKit.cpp
View File

@ -3623,7 +3623,7 @@ Node* GraphKit::set_output_for_allocation(AllocateNode* alloc,
// the type to a constant.
// The optional arguments are for specialized use by intrinsics:
// - If 'extra_slow_test' if not null is an extra condition for the slow-path.
// - If 'return_size_val', report the the total object size to the caller.
// - If 'return_size_val', report the total object size to the caller.
// - deoptimize_on_exception controls how Java exceptions are handled (rethrow vs deoptimize)
Node* GraphKit::new_instance(Node* klass_node,
Node* extra_slow_test,

2
src/hotspot/share/opto/loopTransform.cpp
View File

@ -3791,7 +3791,7 @@ bool PhaseIdealLoop::do_intrinsify_fill() {
}
// Examine an inner loop looking for a a single store of an invariant
// Examine an inner loop looking for a single store of an invariant
// value in a unit stride loop,
bool PhaseIdealLoop::match_fill_loop(IdealLoopTree* lpt, Node*& store, Node*& store_value,
Node*& shift, Node*& con) {

2
src/hotspot/share/opto/loopnode.hpp
View File

@ -1760,7 +1760,7 @@ private:
// By default the reserved copy (clone) of the loop is created as dead code - it is
// dominated in the outer loop by this node chain:
// intcon(1)->If->IfFalse->reserved_copy.
// The original loop is dominated by the the same node chain but IfTrue projection:
// The original loop is dominated by the same node chain but IfTrue projection:
// intcon(0)->If->IfTrue->original_loop.
//
// In this implementation of CountedLoopReserveKit the ctor includes create_reserve()

2
src/hotspot/share/opto/output.cpp
View File

@ -860,7 +860,7 @@ void PhaseOutput::FillLocArray( int idx, MachSafePointNode* sfpt, Node *local,
array->append(new ConstantIntValue((jint)0));
array->append(new_loc_value( C->regalloc(), regnum, Location::lng ));
} else if ( t->base() == Type::RawPtr ) {
// jsr/ret return address which must be restored into a the full
// jsr/ret return address which must be restored into the full
// width 64-bit stack slot.
array->append(new_loc_value( C->regalloc(), regnum, Location::lng ));
}

4
src/hotspot/share/opto/phaseX.cpp
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 1997, 2021, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 1997, 2022, 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
@ -1507,7 +1507,7 @@ void PhaseIterGVN::add_users_to_worklist0( Node *n ) {
}
// Return counted loop Phi if as a counted loop exit condition, cmp
// compares the the induction variable with n
// compares the induction variable with n
static PhiNode* countedloop_phi_from_cmp(CmpNode* cmp, Node* n) {
for (DUIterator_Fast imax, i = cmp->fast_outs(imax); i < imax; i++) {
Node* bol = cmp->fast_out(i);

2
src/hotspot/share/prims/jvmti.xml
View File

@ -9519,7 +9519,7 @@ myInit() {
As a result, all future JNI calls are directed to the specified functions.
Use <functionlink id="GetJNIFunctionTable"></functionlink> to get the
function table to pass to this function.
For this function to take effect the the updated table entries must be
For this function to take effect the updated table entries must be
used by the JNI clients.
Since the table is defined <code>const</code> some compilers may optimize
away the access to the table, thus preventing this function from taking

4
src/hotspot/share/prims/jvmtiCodeBlobEvents.cpp
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2003, 2020, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2003, 2022, 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 @@ void CodeBlobCollector::do_vtable_stub(VtableStub* vs) {
//
// The created list is growable array of JvmtiCodeBlobDesc - each one describes
// a CodeBlob. Note that the list is static - this is because CodeBlob::blobs_do
// requires a a C or static function so we can't use an instance function. This
// requires a C or static function so we can't use an instance function. This
// isn't a problem as the iteration is serial anyway as we need the CodeCache_lock
// to iterate over the code cache.
//

4
src/hotspot/share/prims/unsafe.cpp
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2000, 2022, 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
@ -529,7 +529,7 @@ UNSAFE_ENTRY(jobject, Unsafe_StaticFieldBase0(JNIEnv *env, jobject unsafe, jobje
assert(field != NULL, "field must not be NULL");
// Note: In this VM implementation, a field address is always a short
// offset from the base of a a klass metaobject. Thus, the full dynamic
// offset from the base of a klass metaobject. Thus, the full dynamic
// range of the return type is never used. However, some implementations
// might put the static field inside an array shared by many classes,
// or even at a fixed address, in which case the address could be quite

2
src/hotspot/share/runtime/frame.hpp
View File

@ -228,7 +228,7 @@ class frame {
// returns the sender, but skips conversion frames
frame real_sender(RegisterMap* map) const;
// returns the the sending Java frame, skipping any intermediate C frames
// returns the sending Java frame, skipping any intermediate C frames
// NB: receiver must not be first frame
frame java_sender() const;

2
src/hotspot/share/runtime/objectMonitor.cpp
View File

@ -1486,7 +1486,7 @@ void ObjectMonitor::wait(jlong millis, bool interruptible, TRAPS) {
// Enter the waiting queue, which is a circular doubly linked list in this case
// but it could be a priority queue or any data structure.
// _WaitSetLock protects the wait queue. Normally the wait queue is accessed only
// by the the owner of the monitor *except* in the case where park()
// by the owner of the monitor *except* in the case where park()
// returns because of a timeout of interrupt. Contention is exceptionally rare
// so we use a simple spin-lock instead of a heavier-weight blocking lock.

6
src/hotspot/share/runtime/perfData.hpp
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2001, 2021, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2001, 2022, 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
@ -78,7 +78,7 @@ enum CounterNS {
* by accessor methods to make algorithmic decisions as they are potentially
* extracted from a shared memory region. Although any shared memory region
* created is with appropriate access restrictions, allowing read-write access
* only to the principal that created the JVM, it is believed that a the
* only to the principal that created the JVM, it is believed that the
* shared memory region facilitates an easier attack path than attacks
* launched through mechanisms such as /proc. For this reason, it is
* recommended that data returned by PerfData accessor methods be used
@ -907,7 +907,7 @@ class PerfTraceTime : public StackObj {
};
/* The PerfTraceTimedEvent class is responsible for counting the
* occurrence of some event and measuring the the elapsed time of
* occurrence of some event and measuring the elapsed time of
* the event in two separate PerfCounter instances.
*
* Example:

2
src/hotspot/share/runtime/sweeper.cpp
View File

@ -598,7 +598,7 @@ void NMethodSweeper::possibly_flush(nmethod* nm) {
} else if (MethodCounters::is_nmethod_age_unset(age)) {
// No counters were used before. Set the counters to the detection
// limit value. If the method is going to be used again it will be compiled
// with counters that we're going to use for analysis the the next time.
// with counters that we're going to use for analysis the next time.
mc->reset_nmethod_age();
} else {
// Method was totally idle for 10 sweeps

2
src/hotspot/share/runtime/vframe.hpp
View File

@ -248,7 +248,7 @@ class entryVFrame: public externalVFrame {
};
// A MonitorInfo is a ResourceObject that describes a the pair:
// A MonitorInfo is a ResourceObject that describes the pair:
// 1) the owner of the monitor
// 2) the monitor lock
class MonitorInfo : public ResourceObj {

4
src/hotspot/share/runtime/vmOperations.hpp
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 1997, 2021, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 1997, 2022, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
@ -36,7 +36,7 @@ class VM_EmptyOperation : public VM_Operation {
public:
virtual void doit() final {}
virtual bool skip_thread_oop_barriers() const final {
// Neither the doit function nor the the safepoint
// Neither the doit function nor the safepoint
// cleanup tasks read oops in the Java threads.
return true;
}

2
src/hotspot/share/utilities/bitMap.cpp
View File

@ -343,7 +343,7 @@ void BitMap::at_put(idx_t offset, bool value) {
// if no other thread is executing an action to
// change the requested bit to a state other than
// the one that this thread is trying to set it to,
// then the the bit is in the expected state
// then the bit is in the expected state
// at exit from this method. However, rather than
// make such a strong assertion here, based on
// assuming such constrained use (which though true

2
src/hotspot/share/utilities/bitMap.hpp
View File

@ -354,7 +354,7 @@ class BitMap {
#endif
};
// A concrete implementation of the the "abstract" BitMap class.
// A concrete implementation of the "abstract" BitMap class.
//
// The BitMapView is used when the backing storage is managed externally.
class BitMapView : public BitMap {

2
src/java.base/share/classes/java/lang/ModuleLayer.java
View File

@ -742,7 +742,7 @@ public final class ModuleLayer {
}
/**
* Creates a LayerInstantiationException with the a message formatted from
* Creates a LayerInstantiationException with the message formatted from
* the given format string and arguments.
*/
private static LayerInstantiationException fail(String fmt, Object ... args) {

4
src/java.base/share/classes/java/lang/VirtualMachineError.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 1995, 2019, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 1995, 2022, 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
@ -73,7 +73,7 @@ public abstract class VirtualMachineError extends Error {
}
/**
* Constructs an a {@code VirtualMachineError} with the specified
* Constructs a {@code VirtualMachineError} with the specified
* cause and a detail message of {@code (cause==null ? null :
* cause.toString())} (which typically contains the class and
* detail message of {@code cause}).

2
src/java.base/share/classes/java/util/Locale.java
View File

@ -2319,7 +2319,7 @@ public final class Locale implements Cloneable, Serializable {
/**
* Format a list using given pattern strings.
* If either of the patterns is null, then a the list is
* If either of the patterns is null, then the list is
* formatted by concatenation with the delimiter ','.
* @param stringList the list of strings to be formatted.
* and formatting them into a list.

2
src/java.base/share/classes/jdk/internal/org/objectweb/asm/RecordComponentWriter.java
View File

@ -69,7 +69,7 @@ final class RecordComponentWriter extends RecordComponentVisitor {
/** The name_index field of the Record attribute. */
private final int nameIndex;
/** The descriptor_index field of the the Record attribute. */
/** The descriptor_index field of the Record attribute. */
private final int descriptorIndex;
/**

2
src/java.base/share/classes/jdk/internal/org/objectweb/asm/util/CheckMethodAdapter.java
View File

@ -1378,7 +1378,7 @@ public class CheckMethodAdapter extends MethodVisitor {
}
/**
* Checks that a the given substring is a valid type descriptor.
* Checks that the given substring is a valid type descriptor.
*
* @param version the class version.
* @param descriptor the string to be checked.

2
src/java.base/share/classes/jdk/internal/org/objectweb/asm/util/Printer.java
View File

@ -1298,7 +1298,7 @@ public abstract class Printer {
}
/**
* Prints a the given class to the given output.
* Prints the given class to the given output.
*
* <p>Command line arguments: [-nodebug] &lt;binary class name or class file name &gt;
*

4
src/java.base/share/classes/jdk/internal/util/Preconditions.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2016, 2021, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2016, 2022, 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
@ -79,7 +79,7 @@ public class Preconditions {
* to the name of one of the range check methods, checkIndex,
* checkFromToIndex, checkFromIndexSize
* @param args the out-of-bounds arguments that failed the range check.
* If the checkKind corresponds a the name of a range check method
* If the checkKind corresponds to the name of a range check method
* then the bounds arguments are those that can be passed in order
* to the method.
* @param oobef the exception formatter that when applied with a checkKind

4
src/java.base/share/classes/sun/security/provider/SHA.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 1996, 2021, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 1996, 2022, 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
@ -121,7 +121,7 @@ public final class SHA extends DigestBase {
private static final int round4_kt = 0xca62c1d6;
/**
* Compute a the hash for the current block.
* Compute the hash for the current block.
*
* This is in the same vein as Peter Gutmann's algorithm listed in
* the back of Applied Cryptography, Compact implementation of

4
src/java.base/share/classes/sun/security/util/DerOutputStream.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 1996, 2021, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 1996, 2022, 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
@ -381,7 +381,7 @@ extends ByteArrayOutputStream implements DerEncoder {
private static ByteArrayTagOrder tagOrder = new ByteArrayTagOrder();
/**
* Marshals a the contents of a set on the output stream with the
* Marshals the contents of a set on the output stream with the
* encodings of its sorted in increasing order.
*
* @param order the order to use when sorting encodings of components.

4
src/java.base/share/classes/sun/security/util/ECKeySizeParameterSpec.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2012, 2013, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2012, 2022, 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
@ -31,7 +31,7 @@ import sun.security.util.ObjectIdentifier;
/**
* This immutable class is used when randomly generating a key pair and the
* consumer only specifies the length of the key and therefore a curve for that
* key size must be picked from a the list of supported curves using this spec.
* key size must be picked from the list of supported curves using this spec.
*
* @see AlgorithmParameterSpec
* @see ECGenParameterSpec

4
src/java.base/windows/native/libnio/ch/wepoll.c
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2020, 2021, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2020, 2022, 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
@ -1906,7 +1906,7 @@ int sock_feed_event(port_state_t* port_state,
if (epoll_events == 0)
return 0;
/* If the the socket has the EPOLLONESHOT flag set, unmonitor all events,
/* If the socket has the EPOLLONESHOT flag set, unmonitor all events,
* even EPOLLERR and EPOLLHUP. But always keep looking for closed sockets. */
if (sock_state->user_events & EPOLLONESHOT)
sock_state->user_events = 0;

2
src/java.net.http/share/classes/jdk/internal/net/http/ResponseSubscribers.java
View File

@ -78,7 +78,7 @@ public class ResponseSubscribers {
* might be called and might block before the last bit is
* received (for instance, if a mapping subscriber is used with
* a mapper function that maps an InputStream to a GZIPInputStream,
* as the the constructor of GZIPInputStream calls read()).
* as the constructor of GZIPInputStream calls read()).
* @param <T> The response type.
*/
public interface TrustedSubscriber<T> extends BodySubscriber<T> {

2
src/java.se/share/data/jdwp/jdwp.spec
View File

@ -2648,7 +2648,7 @@ JDWP "Java(tm) Debug Wire Protocol"
"signature without access to the local variable table information.) "
"<p>"
"If the thread is a virtual thread then this command can be used to set "
"the value of local variables in the the top-most frame when the thread is "
"the value of local variables in the top-most frame when the thread is "
"suspended at a breakpoint or single step event. The target VM may support "
"setting local variables in other cases."
(Out

4
src/java.security.sasl/share/classes/com/sun/security/sasl/digest/DigestMD5Client.java
View File

@ -261,8 +261,8 @@ final class DigestMD5Client extends DigestMD5Base implements SaslClient {
* Check directive values that are multi-valued and ensure that mandatory
* directives not missing from the digest-challenge.
*
* @throws SaslException if a sasl is a the mechanism cannot
* correctly handle a callbacks or if a violation in the
* @throws SaslException if a sasl mechanism cannot
* correctly handle callbacks or if a violation in the
* digest challenge format is detected.
*/
private void processChallenge(byte[][] challengeVal, List<byte[]> realmChoices)

6
src/jdk.crypto.cryptoki/share/classes/sun/security/pkcs11/wrapper/PKCS11Exception.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2003, 2021, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2003, 2022, Oracle and/or its affiliates. All rights reserved.
*/
/* Copyright (c) 2002 Graz University of Technology. All rights reserved.
@ -228,8 +228,8 @@ public class PKCS11Exception extends Exception {
}
/**
* Returns true if the error code matches the the specified enum value.
* @return true if the error code matches the the specified enum value.
* Returns true if the error code matches the specified enum value.
* @return true if the error code matches the specified enum value.
* @preconditions
* @postconditions
*/

2
src/jdk.crypto.ec/share/classes/sun/security/ec/ECDHKeyAgreement.java
View File

@ -205,7 +205,7 @@ public final class ECDHKeyAgreement extends KeyAgreementSpi {
// Check the order of the point.
//
// Compute nQ (using elliptic curve arithmetic), and verify that
// nQ is the the identity element.
// nQ is the identity element.
ImmutableIntegerModuloP xElem = ops.getField().getElement(x);
ImmutableIntegerModuloP yElem = ops.getField().getElement(y);
AffinePoint affP = new AffinePoint(xElem, yElem);

4
src/jdk.hotspot.agent/linux/native/libsaproc/ps_core.c
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2003, 2021, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2003, 2022, 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
@ -454,7 +454,7 @@ static bool read_interp_segments(struct ps_prochandle* ph) {
return true;
}
// process segments of a a.out
// process segments of an a.out
// returns base address of executable.
static uintptr_t read_exec_segments(struct ps_prochandle* ph, ELF_EHDR* exec_ehdr) {
int i = 0;

2
src/jdk.hotspot.agent/macosx/native/libsaproc/ps_core.c
View File

@ -1035,7 +1035,7 @@ static bool read_interp_segments(struct ps_prochandle* ph) {
return true;
}
// process segments of a a.out
// process segments of an a.out
static bool read_exec_segments(struct ps_prochandle* ph, ELF_EHDR* exec_ehdr) {
int i = 0;
ELF_PHDR* phbuf = NULL;

4
src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/code/NMethod.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2000, 2022, 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
@ -387,7 +387,7 @@ public class NMethod extends CompiledMethod {
// pc_desc_near returns the first PCDesc at or after the givne pc.
PCDesc pc_desc_near(long pc) { return find_pc_desc(pc, true); }
// Return a the last scope in (begin..end]
// Return the last scope in (begin..end]
public ScopeDesc scope_desc_in(long begin, long end) {
PCDesc p = pc_desc_near(begin+1);
if (p != null && VM.getAddressValue(p.getRealPC(this)) <= end) {

4
src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/bsd/SharedObject.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2003, 2020, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2003, 2022, 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
@ -28,7 +28,7 @@ import sun.jvm.hotspot.debugger.*;
import sun.jvm.hotspot.debugger.cdbg.*;
import sun.jvm.hotspot.debugger.posix.*;
/** A Object can represent either a .so or an a.out file. */
/** An Object can represent either a .so or an a.out file. */
class SharedObject extends DSO {
SharedObject(BsdDebugger dbg, String filename, long size, Address relocation) {

4
src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/linux/SharedObject.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2003, 2020, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2003, 2022, 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
@ -28,7 +28,7 @@ import sun.jvm.hotspot.debugger.*;
import sun.jvm.hotspot.debugger.cdbg.*;
import sun.jvm.hotspot.debugger.posix.*;
/** A Object can represent either a .so or an a.out file. */
/** An Object can represent either a .so or an a.out file. */
class SharedObject extends DSO {
SharedObject(LinuxDebugger dbg, String filename, long size, Address relocation) {

4
src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/proc/SharedObject.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2003, 2020, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2003, 2022, 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
@ -28,7 +28,7 @@ import sun.jvm.hotspot.debugger.*;
import sun.jvm.hotspot.debugger.cdbg.*;
import sun.jvm.hotspot.debugger.posix.*;
/** A Object can represent either a .so or an a.out file. */
/** An Object can represent either a .so or an a.out file. */
class SharedObject extends DSO {
SharedObject(ProcDebugger dbg, String filename, long size, Address relocation) {

4
src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/win32/coff/DebugVC50SymbolIterator.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2001, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2001, 2022, 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
@ -374,7 +374,7 @@ public interface DebugVC50SymbolIterator
/** Segment portion of the procedure address. */
public short getLGProcSegment();
/** Value defined by bitwise or of the the PROCFLAGS enumeration in
/** Value defined by bitwise or of the PROCFLAGS enumeration in
{@link
sun.jvm.hotspot.debugger.win32.coff.DebugVC50SymbolEnums}. */
public byte getLGProcFlags();

2
src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/ui/treetable/TreeTableModel.java
View File

@ -61,7 +61,7 @@ public interface TreeTableModel extends TreeModel
public Object getValueAt(Object node, int column);
/**
* Indicates whether the the value for node <code>node</code>,
* Indicates whether the value for node <code>node</code>,
* at column number <code>column</code> is editable.
*/
public boolean isCellEditable(Object node, int column);

6
src/jdk.httpserver/share/classes/com/sun/net/httpserver/HttpContext.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2005, 2020, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2005, 2022, 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
@ -95,7 +95,7 @@ public abstract class HttpContext {
/**
* Returns this context's {@link List} of {@linkplain Filter filters}. This
* is the actual list used by the server when dispatching requests so
* modifications to this list immediately affect the the handling of exchanges.
* modifications to this list immediately affect the handling of exchanges.
*
* @return a {@link List} containing the filters of this context
*/
@ -103,7 +103,7 @@ public abstract class HttpContext {
/**
* Sets the {@link Authenticator} for this {@code HttpContext}. Once an authenticator
* is establised on a context, all client requests must be authenticated,
* is established on a context, all client requests must be authenticated,
* and the given object will be invoked to validate each request. Each call
* to this method replaces any previous value set.
*

4
src/jdk.internal.jvmstat/share/classes/sun/jvmstat/monitor/MonitoredVm.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2004, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2004, 2022, 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
@ -123,7 +123,7 @@ public interface MonitoredVm {
*
* Polling implementations may choose to poll asynchronously. This
* method allows an asynchronous task to communicate any polling related
* exceptions with the application. When an a non-null exception is reported
* exceptions with the application. When a non-null exception is reported
* through this interface, the MonitoredVm instance is considered to
* be in the <em>errored</em> state.
*

4
src/jdk.internal.jvmstat/share/classes/sun/jvmstat/perfdata/monitor/PerfIntegerMonitor.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2004, 2010, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2004, 2022, 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
@ -73,7 +73,7 @@ public class PerfIntegerMonitor extends AbstractMonitor
/**
* Return the current value of the IntegerInstrument as an int.
*
* @return int - a the current value of the IntegerInstrument.
* @return int - the current value of the IntegerInstrument.
*/
public int intValue() {
return ib.get(0);

2
src/jdk.jdi/share/classes/com/sun/jdi/ClassType.java
View File

@ -345,7 +345,7 @@ public interface ClassType extends ReferenceType {
InvocationException;
/**
* Returns a the single non-abstract {@link Method} visible from
* Returns a single non-abstract {@link Method} visible from
* this class that has the given name and signature.
* See {@link ReferenceType#methodsByName(java.lang.String, java.lang.String)}
* for information on signature format.

4
src/jdk.jdi/share/classes/com/sun/jdi/VMMismatchException.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 1999, 2017, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 1999, 2022, 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,7 +27,7 @@ package com.sun.jdi;
/**
* Thrown to indicate that the requested operation cannot be
* completed because the a mirror from one target VM is being
* completed because the mirror from one target VM is being
* combined with a mirror from another target VM.
*
* @author Gordon Hirsch

Some files were not shown because too many files have changed in this diff Show More