1 /*
2 * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
3 * Copyright (c) 2021, Azul Systems, Inc. All rights reserved.
4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
5 *
6 * This code is free software; you can redistribute it and/or modify it
7 * under the terms of the GNU General Public License version 2 only, as
8 * published by the Free Software Foundation.
9 *
10 * This code is distributed in the hope that it will be useful, but WITHOUT
11 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
12 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
13 * version 2 for more details (a copy is included in the LICENSE file that
14 * accompanied this code).
15 *
16 * You should have received a copy of the GNU General Public License version
17 * 2 along with this work; if not, write to the Free Software Foundation,
18 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
19 *
20 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
21 * or visit www.oracle.com if you need additional information or have any
22 * questions.
23 *
24 */
25
26 #include "cds/cdsConfig.hpp"
27 #include "classfile/javaClasses.hpp"
28 #include "classfile/javaThreadStatus.hpp"
29 #include "gc/shared/barrierSet.hpp"
30 #include "jfr/jfrEvents.hpp"
31 #include "jvm.h"
32 #include "jvmtifiles/jvmtiEnv.hpp"
33 #include "logging/log.hpp"
34 #include "memory/allocation.inline.hpp"
35 #include "memory/iterator.hpp"
36 #include "memory/resourceArea.hpp"
37 #include "nmt/memTracker.hpp"
38 #include "oops/oop.inline.hpp"
39 #include "runtime/atomicAccess.hpp"
40 #include "runtime/handles.inline.hpp"
41 #include "runtime/javaThread.inline.hpp"
42 #include "runtime/nonJavaThread.hpp"
43 #include "runtime/orderAccess.hpp"
44 #include "runtime/osThread.hpp"
45 #include "runtime/safepoint.hpp"
46 #include "runtime/safepointMechanism.inline.hpp"
47 #include "runtime/thread.inline.hpp"
48 #include "runtime/threadSMR.inline.hpp"
49 #include "utilities/macros.hpp"
50 #include "utilities/spinYield.hpp"
51 #if INCLUDE_JFR
52 #include "jfr/jfr.hpp"
53 #endif
54
55 THREAD_LOCAL Thread* Thread::_thr_current = nullptr;
56
57 // ======= Thread ========
58 // Base class for all threads: VMThread, WatcherThread, ConcurrentMarkSweepThread,
59 // JavaThread
60
61 Thread::Thread(MemTag mem_tag) {
62
63 DEBUG_ONLY(_run_state = PRE_CALL_RUN;)
64
65 // stack and get_thread
66 set_stack_base(nullptr);
67 set_stack_size(0);
68 DEBUG_ONLY(clear_suspendible_thread();)
69 DEBUG_ONLY(clear_indirectly_suspendible_thread();)
70 DEBUG_ONLY(clear_indirectly_safepoint_thread();)
71
72 // allocated data structures
73 set_osthread(nullptr);
74 set_resource_area(new (mem_tag) ResourceArea(mem_tag));
75 DEBUG_ONLY(_current_resource_mark = nullptr;)
76 set_handle_area(new (mem_tag) HandleArea(mem_tag));
77 set_metadata_handles(new (mtClass) GrowableArray<Metadata*>(30, mtClass));
78 set_last_handle_mark(nullptr);
79
80 // Initial value of zero ==> never claimed.
81 _threads_do_token = 0;
82 _threads_hazard_ptr = nullptr;
83 _threads_list_ptr = nullptr;
84 _nested_threads_hazard_ptr_cnt = 0;
85 _rcu_counter = 0;
86
87 // the handle mark links itself to last_handle_mark
88 new HandleMark(this);
89
90 // plain initialization
91 DEBUG_ONLY(_owned_locks = nullptr;)
92 NOT_PRODUCT(_skip_gcalot = false;)
93 _jvmti_env_iteration_count = 0;
94 set_allocated_bytes(0);
95 _current_pending_raw_monitor = nullptr;
96 _vm_error_callbacks = nullptr;
97
98 // thread-specific hashCode stream generator state - Marsaglia shift-xor form
99 // If we are dumping, keep ihashes constant. Note that during dumping we only
100 // ever run one java thread, and no other thread should generate ihashes either,
101 // so using a constant seed should work fine.
102 _hashStateX = CDSConfig::is_dumping_static_archive() ? 0x12345678 : os::random();
103 _hashStateY = 842502087;
104 _hashStateZ = 0x8767; // (int)(3579807591LL & 0xffff) ;
105 _hashStateW = 273326509;
106
107 // Many of the following fields are effectively final - immutable
108 // Note that nascent threads can't use the Native Monitor-Mutex
109 // construct until the _MutexEvent is initialized ...
110 // CONSIDER: instead of using a fixed set of purpose-dedicated ParkEvents
111 // we might instead use a stack of ParkEvents that we could provision on-demand.
112 // The stack would act as a cache to avoid calls to ParkEvent::Allocate()
113 // and ::Release()
114 _ParkEvent = ParkEvent::Allocate(this);
115
116 #ifdef CHECK_UNHANDLED_OOPS
117 if (CheckUnhandledOops) {
118 _unhandled_oops = new UnhandledOops(this);
119 }
120 #endif // CHECK_UNHANDLED_OOPS
121
122 // Notify the barrier set that a thread is being created. The initial
123 // thread is created before the barrier set is available. The call to
124 // BarrierSet::on_thread_create() for this thread is therefore deferred
125 // to BarrierSet::set_barrier_set().
126 BarrierSet* const barrier_set = BarrierSet::barrier_set();
127 if (barrier_set != nullptr) {
128 barrier_set->on_thread_create(this);
129 } else {
130 // Only the main thread should be created before the barrier set
131 // and that happens just before Thread::current is set. No other thread
132 // can attach as the VM is not created yet, so they can't execute this code.
133 // If the main thread creates other threads before the barrier set that is an error.
134 assert(Thread::current_or_null() == nullptr, "creating thread before barrier set");
135 }
136
137 MACOS_AARCH64_ONLY(DEBUG_ONLY(_wx_init = false));
138 }
139
140 #ifdef ASSERT
141 address Thread::stack_base() const {
142 // Note: can't report Thread::name() here as that can require a ResourceMark which we
143 // can't use because this gets called too early in the thread initialization.
144 assert(_stack_base != nullptr, "Stack base not yet set for thread id:%d (0 if not set)",
145 osthread() != nullptr ? osthread()->thread_id() : 0);
146 return _stack_base;
147 }
148 #endif
149
150 void Thread::initialize_tlab() {
151 if (UseTLAB) {
152 tlab().initialize();
153 }
154 }
155
156 void Thread::retire_tlab(ThreadLocalAllocStats* stats) {
157 // Sampling and serviceability support
158 if (tlab().end() != nullptr) {
159 incr_allocated_bytes(tlab().used_bytes());
160 heap_sampler().retire_tlab(tlab().top());
161 }
162
163 // Retire the TLAB
164 tlab().retire(stats);
165 }
166
167 void Thread::fill_tlab(HeapWord* start, size_t pre_reserved, size_t new_size) {
168 // Thread allocation sampling support
169 heap_sampler().set_tlab_top_at_sample_start(start);
170
171 // Fill the TLAB
172 tlab().fill(start, start + pre_reserved, new_size);
173 }
174
175 void Thread::initialize_thread_current() {
176 assert(_thr_current == nullptr, "Thread::current already initialized");
177 _thr_current = this;
178 assert(ThreadLocalStorage::thread() == nullptr, "ThreadLocalStorage::thread already initialized");
179 ThreadLocalStorage::set_thread(this);
180 assert(Thread::current() == ThreadLocalStorage::thread(), "TLS mismatch!");
181 }
182
183 void Thread::clear_thread_current() {
184 assert(Thread::current() == ThreadLocalStorage::thread(), "TLS mismatch!");
185 _thr_current = nullptr;
186 ThreadLocalStorage::set_thread(nullptr);
187 }
188
189 void Thread::record_stack_base_and_size() {
190 // Note: at this point, Thread object is not yet initialized. Do not rely on
191 // any members being initialized. Do not rely on Thread::current() being set.
192 // If possible, refrain from doing anything which may crash or assert since
193 // quite probably those crash dumps will be useless.
194 address base;
195 size_t size;
196 os::current_stack_base_and_size(&base, &size);
197 set_stack_base(base);
198 set_stack_size(size);
199
200 // Set stack limits after thread is initialized.
201 if (is_Java_thread()) {
202 JavaThread::cast(this)->stack_overflow_state()->initialize(stack_base(), stack_end());
203 }
204 }
205
206 void Thread::register_thread_stack_with_NMT() {
207 MemTracker::record_thread_stack(stack_end(), stack_size());
208 }
209
210 void Thread::unregister_thread_stack_with_NMT() {
211 MemTracker::release_thread_stack(stack_end(), stack_size());
212 }
213
214 void Thread::call_run() {
215 DEBUG_ONLY(_run_state = CALL_RUN;)
216
217 // At this point, Thread object should be fully initialized and
218 // Thread::current() should be set.
219
220 assert(Thread::current_or_null() != nullptr, "current thread is unset");
221 assert(Thread::current_or_null() == this, "current thread is wrong");
222
223 // Perform common initialization actions
224
225 MACOS_AARCH64_ONLY(this->init_wx());
226
227 register_thread_stack_with_NMT();
228
229 JFR_ONLY(Jfr::on_thread_start(this);)
230
231 log_debug(os, thread)("Thread %zu stack dimensions: "
232 PTR_FORMAT "-" PTR_FORMAT " (%zuk).",
233 os::current_thread_id(), p2i(stack_end()),
234 p2i(stack_base()), stack_size()/1024);
235
236 // Perform <ChildClass> initialization actions
237 DEBUG_ONLY(_run_state = PRE_RUN;)
238 this->pre_run();
239
240 // Invoke <ChildClass>::run()
241 DEBUG_ONLY(_run_state = RUN;)
242 this->run();
243 // Returned from <ChildClass>::run(). Thread finished.
244
245 // Perform common tear-down actions
246
247 assert(Thread::current_or_null() != nullptr, "current thread is unset");
248 assert(Thread::current_or_null() == this, "current thread is wrong");
249
250 // Perform <ChildClass> tear-down actions
251 DEBUG_ONLY(_run_state = POST_RUN;)
252 this->post_run();
253
254 // Note: at this point the thread object may already have deleted itself,
255 // so from here on do not dereference *this*. Not all thread types currently
256 // delete themselves when they terminate. But no thread should ever be deleted
257 // asynchronously with respect to its termination - that is what _run_state can
258 // be used to check.
259
260 // Logically we should do this->unregister_thread_stack_with_NMT() here, but we
261 // had to move that into post_run() because of the `this` deletion issue.
262
263 assert(Thread::current_or_null() == nullptr, "current thread still present");
264 }
265
266 Thread::~Thread() {
267
268 // Attached threads will remain in PRE_CALL_RUN, as will threads that don't actually
269 // get started due to errors etc. Any active thread should at least reach post_run
270 // before it is deleted (usually in post_run()).
271 assert(_run_state == PRE_CALL_RUN ||
272 _run_state == POST_RUN, "Active Thread deleted before post_run(): "
273 "_run_state=%d", (int)_run_state);
274
275 // Notify the barrier set that a thread is being destroyed. Note that a barrier
276 // set might not be available if we encountered errors during bootstrapping.
277 BarrierSet* const barrier_set = BarrierSet::barrier_set();
278 if (barrier_set != nullptr) {
279 barrier_set->on_thread_destroy(this);
280 }
281
282 // deallocate data structures
283 delete resource_area();
284 // since the handle marks are using the handle area, we have to deallocated the root
285 // handle mark before deallocating the thread's handle area,
286 assert(last_handle_mark() != nullptr, "check we have an element");
287 delete last_handle_mark();
288 assert(last_handle_mark() == nullptr, "check we have reached the end");
289
290 ParkEvent::Release(_ParkEvent);
291 // Set to null as a termination indicator for has_terminated().
292 AtomicAccess::store(&_ParkEvent, (ParkEvent*)nullptr);
293
294 delete handle_area();
295 delete metadata_handles();
296
297 // osthread() can be null, if creation of thread failed.
298 if (osthread() != nullptr) os::free_thread(osthread());
299
300 // Clear Thread::current if thread is deleting itself and it has not
301 // already been done. This must be done before the memory is deallocated.
302 // Needed to ensure JNI correctly detects non-attached threads.
303 if (this == Thread::current_or_null()) {
304 Thread::clear_thread_current();
305 }
306
307 CHECK_UNHANDLED_OOPS_ONLY(if (CheckUnhandledOops) delete unhandled_oops();)
308 }
309
310 #ifdef ASSERT
311 // A JavaThread is considered dangling if it not handshake-safe with respect to
312 // the current thread, it is not on a ThreadsList, or not at safepoint.
313 void Thread::check_for_dangling_thread_pointer(Thread *thread) {
314 assert(!thread->is_Java_thread() ||
315 JavaThread::cast(thread)->is_handshake_safe_for(Thread::current()) ||
316 !JavaThread::cast(thread)->on_thread_list() ||
317 SafepointSynchronize::is_at_safepoint() ||
318 ThreadsSMRSupport::is_a_protected_JavaThread_with_lock(JavaThread::cast(thread)),
319 "possibility of dangling Thread pointer");
320 }
321 #endif
322
323 // Is the target JavaThread protected by the calling Thread or by some other
324 // mechanism?
325 //
326 bool Thread::is_JavaThread_protected(const JavaThread* target) {
327 Thread* current_thread = Thread::current();
328
329 // Do the simplest check first:
330 if (SafepointSynchronize::is_at_safepoint()) {
331 // The target is protected since JavaThreads cannot exit
332 // while we're at a safepoint.
333 return true;
334 }
335
336 // If the target hasn't been started yet then it is trivially
337 // "protected". We assume the caller is the thread that will do
338 // the starting.
339 if (target->osthread() == nullptr || target->osthread()->get_state() <= INITIALIZED) {
340 return true;
341 }
342
343 // Now make the simple checks based on who the caller is:
344 if (current_thread == target || Threads_lock->owner() == current_thread) {
345 // Target JavaThread is self or calling thread owns the Threads_lock.
346 // Second check is the same as Threads_lock->owner_is_self(),
347 // but we already have the current thread so check directly.
348 return true;
349 }
350
351 // Check the ThreadsLists associated with the calling thread (if any)
352 // to see if one of them protects the target JavaThread:
353 if (is_JavaThread_protected_by_TLH(target)) {
354 return true;
355 }
356
357 // Use this debug code with -XX:+UseNewCode to diagnose locations that
358 // are missing a ThreadsListHandle or other protection mechanism:
359 // guarantee(!UseNewCode, "current_thread=" INTPTR_FORMAT " is not protecting target="
360 // INTPTR_FORMAT, p2i(current_thread), p2i(target));
361
362 // Note: Since 'target' isn't protected by a TLH, the call to
363 // target->is_handshake_safe_for() may crash, but we have debug bits so
364 // we'll be able to figure out what protection mechanism is missing.
365 assert(target->is_handshake_safe_for(current_thread), "JavaThread=" INTPTR_FORMAT
366 " is not protected and not handshake safe.", p2i(target));
367
368 // The target JavaThread is not protected so it is not safe to query:
369 return false;
370 }
371
372 // Is the target JavaThread protected by a ThreadsListHandle (TLH) associated
373 // with the calling Thread?
374 //
375 bool Thread::is_JavaThread_protected_by_TLH(const JavaThread* target) {
376 Thread* current_thread = Thread::current();
377
378 // Check the ThreadsLists associated with the calling thread (if any)
379 // to see if one of them protects the target JavaThread:
380 for (SafeThreadsListPtr* stlp = current_thread->_threads_list_ptr;
381 stlp != nullptr; stlp = stlp->previous()) {
382 if (stlp->list()->includes(target)) {
383 // The target JavaThread is protected by this ThreadsList:
384 return true;
385 }
386 }
387
388 // The target JavaThread is not protected by a TLH so it is not safe to query:
389 return false;
390 }
391
392 void Thread::set_priority(Thread* thread, ThreadPriority priority) {
393 DEBUG_ONLY(check_for_dangling_thread_pointer(thread);)
394 // Can return an error!
395 (void)os::set_priority(thread, priority);
396 }
397
398
399 void Thread::start(Thread* thread) {
400 // Start is different from resume in that its safety is guaranteed by context or
401 // being called from a Java method synchronized on the Thread object.
402 if (thread->is_Java_thread()) {
403 // Initialize the thread state to RUNNABLE before starting this thread.
404 // Can not set it after the thread started because we do not know the
405 // exact thread state at that time. It could be in MONITOR_WAIT or
406 // in SLEEPING or some other state.
407 java_lang_Thread::set_thread_status(JavaThread::cast(thread)->threadObj(),
408 JavaThreadStatus::RUNNABLE);
409 }
410 os::start_thread(thread);
411 }
412
413 // GC Support
414 bool Thread::claim_par_threads_do(uintx claim_token) {
415 uintx token = _threads_do_token;
416 if (token != claim_token) {
417 uintx res = AtomicAccess::cmpxchg(&_threads_do_token, token, claim_token);
418 if (res == token) {
419 return true;
420 }
421 guarantee(res == claim_token, "invariant");
422 }
423 return false;
424 }
425
426 void Thread::oops_do_no_frames(OopClosure* f, NMethodClosure* cf) {
427 // Do oop for ThreadShadow
428 f->do_oop((oop*)&_pending_exception);
429 handle_area()->oops_do(f);
430 }
431
432 // If the caller is a NamedThread, then remember, in the current scope,
433 // the given JavaThread in its _processed_thread field.
434 class RememberProcessedThread: public StackObj {
435 NamedThread* _cur_thr;
436 public:
437 RememberProcessedThread(Thread* thread) {
438 Thread* self = Thread::current();
439 if (self->is_Named_thread()) {
440 _cur_thr = (NamedThread *)self;
441 assert(_cur_thr->processed_thread() == nullptr, "nesting not supported");
442 _cur_thr->set_processed_thread(thread);
443 } else {
444 _cur_thr = nullptr;
445 }
446 }
447
448 ~RememberProcessedThread() {
449 if (_cur_thr) {
450 assert(_cur_thr->processed_thread() != nullptr, "nesting not supported");
451 _cur_thr->set_processed_thread(nullptr);
452 }
453 }
454 };
455
456 void Thread::oops_do(OopClosure* f, NMethodClosure* cf) {
457 // Record JavaThread to GC thread
458 RememberProcessedThread rpt(this);
459 oops_do_no_frames(f, cf);
460 oops_do_frames(f, cf);
461 }
462
463 void Thread::metadata_handles_do(void f(Metadata*)) {
464 // Only walk the Handles in Thread.
465 if (metadata_handles() != nullptr) {
466 for (int i = 0; i< metadata_handles()->length(); i++) {
467 f(metadata_handles()->at(i));
468 }
469 }
470 }
471
472 void Thread::print_on(outputStream* st, bool print_extended_info) const {
473 // get_priority assumes osthread initialized
474 if (osthread() != nullptr) {
475 int os_prio;
476 if (os::get_native_priority(this, &os_prio) == OS_OK) {
477 st->print("os_prio=%d ", os_prio);
478 }
479
480 st->print("cpu=%.2fms ",
481 (double)os::thread_cpu_time(const_cast<Thread*>(this), true) / 1000000.0
482 );
483 st->print("elapsed=%.2fs ",
484 (double)_statistical_info.getElapsedTime() / 1000.0
485 );
486 if (is_Java_thread() && (PrintExtendedThreadInfo || print_extended_info)) {
487 size_t allocated_bytes = (size_t) const_cast<Thread*>(this)->cooked_allocated_bytes();
488 st->print("allocated=%zu%s ",
489 byte_size_in_proper_unit(allocated_bytes),
490 proper_unit_for_byte_size(allocated_bytes)
491 );
492 st->print("defined_classes=" INT64_FORMAT " ", _statistical_info.getDefineClassCount());
493 }
494
495 st->print("tid=" INTPTR_FORMAT " ", p2i(this));
496 if (!is_Java_thread() || !JavaThread::cast(this)->is_vthread_mounted()) {
497 osthread()->print_on(st);
498 }
499 }
500 ThreadsSMRSupport::print_info_on(this, st);
501 st->print(" ");
502 DEBUG_ONLY(if (WizardMode) print_owned_locks_on(st);)
503 }
504
505 void Thread::print() const { print_on(tty); }
506
507 // Thread::print_on_error() is called by fatal error handler. Don't use
508 // any lock or allocate memory.
509 void Thread::print_on_error(outputStream* st, char* buf, int buflen) const {
510 assert(!(is_Compiler_thread() || is_Java_thread()), "Can't call name() here if it allocates");
511
512 st->print("%s \"%s\"", type_name(), name());
513
514 OSThread* os_thr = osthread();
515 if (os_thr != nullptr) {
516 st->fill_to(67);
517 if (os_thr->get_state() != ZOMBIE) {
518 // Use raw field members for stack base/size as this could be
519 // called before a thread has run enough to initialize them.
520 st->print(" [id=%d, stack(" PTR_FORMAT "," PTR_FORMAT ") (" PROPERFMT ")]",
521 osthread()->thread_id(), p2i(_stack_base - _stack_size), p2i(_stack_base),
522 PROPERFMTARGS(_stack_size));
523 } else {
524 st->print(" terminated");
525 }
526 } else {
527 st->print(" unknown state (no osThread)");
528 }
529 ThreadsSMRSupport::print_info_on(this, st);
530 }
531
532 void Thread::print_value_on(outputStream* st) const {
533 if (is_Named_thread()) {
534 st->print(" \"%s\" ", name());
535 }
536 st->print(INTPTR_FORMAT, p2i(this)); // print address
537 }
538
539 #ifdef ASSERT
540 void Thread::print_owned_locks_on(outputStream* st) const {
541 Mutex* cur = _owned_locks;
542 if (cur == nullptr) {
543 st->print(" (no locks) ");
544 } else {
545 st->print_cr(" Locks owned:");
546 while (cur) {
547 cur->print_on(st);
548 cur = cur->next();
549 }
550 }
551 }
552
553 Thread* Thread::_starting_thread = nullptr;
554
555 bool Thread::is_starting_thread(const Thread* t) {
556 assert(_starting_thread != nullptr, "invariant");
557 return t == _starting_thread;
558 }
559 #endif // ASSERT
560
561 bool Thread::set_as_starting_thread(JavaThread* jt) {
562 assert(jt != nullptr, "invariant");
563 assert(_starting_thread == nullptr, "already initialized: "
564 "_starting_thread=" INTPTR_FORMAT, p2i(_starting_thread));
565 // NOTE: this must be called from Threads::create_vm().
566 DEBUG_ONLY(_starting_thread = jt;)
567 return os::create_main_thread(jt);
568 }
569
570 // Ad-hoc mutual exclusion primitive: spin lock
571 //
572 // We employ a spin lock _only for low-contention, fixed-length
573 // short-duration critical sections where we're concerned
574 // about native mutex_t or HotSpot Mutex:: latency.
575
576 void Thread::SpinAcquire(volatile int * adr) {
577 if (AtomicAccess::cmpxchg(adr, 0, 1) == 0) {
578 return; // normal fast-path return
579 }
580
581 // Slow-path : We've encountered contention -- Spin/Yield/Block strategy.
582 int ctr = 0;
583 int Yields = 0;
584 for (;;) {
585 while (*adr != 0) {
586 ++ctr;
587 if ((ctr & 0xFFF) == 0 || !os::is_MP()) {
588 if (Yields > 5) {
589 os::naked_short_sleep(1);
590 } else {
591 os::naked_yield();
592 ++Yields;
593 }
594 } else {
595 SpinPause();
596 }
597 }
598 if (AtomicAccess::cmpxchg(adr, 0, 1) == 0) return;
599 }
600 }
601
602 void Thread::SpinRelease(volatile int * adr) {
603 assert(*adr != 0, "invariant");
604 // Roach-motel semantics.
605 // It's safe if subsequent LDs and STs float "up" into the critical section,
606 // but prior LDs and STs within the critical section can't be allowed
607 // to reorder or float past the ST that releases the lock.
608 // Loads and stores in the critical section - which appear in program
609 // order before the store that releases the lock - must also appear
610 // before the store that releases the lock in memory visibility order.
611 // So we need a #loadstore|#storestore "release" memory barrier before
612 // the ST of 0 into the lock-word which releases the lock.
613 AtomicAccess::release_store(adr, 0);
614 }