2008-12-17 17:40:02 +00:00
|
|
|
// Copyright 2008 the V8 project authors. All rights reserved.
|
|
|
|
// Redistribution and use in source and binary forms, with or without
|
|
|
|
// modification, are permitted provided that the following conditions are
|
|
|
|
// met:
|
|
|
|
//
|
|
|
|
// * Redistributions of source code must retain the above copyright
|
|
|
|
// notice, this list of conditions and the following disclaimer.
|
|
|
|
// * Redistributions in binary form must reproduce the above
|
|
|
|
// copyright notice, this list of conditions and the following
|
|
|
|
// disclaimer in the documentation and/or other materials provided
|
|
|
|
// with the distribution.
|
|
|
|
// * Neither the name of Google Inc. nor the names of its
|
|
|
|
// contributors may be used to endorse or promote products derived
|
|
|
|
// from this software without specific prior written permission.
|
|
|
|
//
|
|
|
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
|
|
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
|
|
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
|
|
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
|
|
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
|
|
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
|
|
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
|
|
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
|
|
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
|
|
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
|
|
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
|
2014-06-20 08:40:11 +00:00
|
|
|
#include "test/cctest/cctest.h"
|
2008-12-17 17:40:02 +00:00
|
|
|
|
2019-05-22 07:55:37 +00:00
|
|
|
#include "src/execution/thread-id.h"
|
2008-12-17 17:40:02 +00:00
|
|
|
|
2019-03-11 09:35:40 +00:00
|
|
|
namespace v8 {
|
|
|
|
namespace internal {
|
|
|
|
|
|
|
|
// {ThreadId} must be trivially copyable to be stored in {std::atomic}.
|
|
|
|
ASSERT_TRIVIALLY_COPYABLE(i::ThreadId);
|
|
|
|
using AtomicThreadId = std::atomic<i::ThreadId>;
|
|
|
|
|
|
|
|
class ThreadIdValidationThread : public base::Thread {
|
2011-04-11 23:46:22 +00:00
|
|
|
public:
|
2019-03-11 09:35:40 +00:00
|
|
|
ThreadIdValidationThread(base::Thread* thread_to_start, AtomicThreadId* refs,
|
|
|
|
unsigned int thread_no, base::Semaphore* semaphore)
|
2014-08-12 13:33:35 +00:00
|
|
|
: Thread(Options("ThreadRefValidationThread")),
|
|
|
|
refs_(refs),
|
|
|
|
thread_no_(thread_no),
|
|
|
|
thread_to_start_(thread_to_start),
|
|
|
|
semaphore_(semaphore) {}
|
2011-04-11 23:46:22 +00:00
|
|
|
|
2018-09-14 15:34:02 +00:00
|
|
|
void Run() override {
|
2011-04-11 23:46:22 +00:00
|
|
|
i::ThreadId thread_id = i::ThreadId::Current();
|
2019-03-11 09:35:40 +00:00
|
|
|
CHECK(thread_id.IsValid());
|
2011-04-11 23:46:22 +00:00
|
|
|
for (int i = 0; i < thread_no_; i++) {
|
2019-03-11 09:35:40 +00:00
|
|
|
CHECK_NE(refs_[i].load(std::memory_order_relaxed), thread_id);
|
2011-04-11 23:46:22 +00:00
|
|
|
}
|
2019-03-11 09:35:40 +00:00
|
|
|
refs_[thread_no_].store(thread_id, std::memory_order_relaxed);
|
2017-10-13 16:33:03 +00:00
|
|
|
if (thread_to_start_ != nullptr) {
|
2011-04-11 23:46:22 +00:00
|
|
|
thread_to_start_->Start();
|
|
|
|
}
|
|
|
|
semaphore_->Signal();
|
|
|
|
}
|
2011-09-08 19:57:14 +00:00
|
|
|
|
2011-04-11 23:46:22 +00:00
|
|
|
private:
|
2019-03-11 09:35:40 +00:00
|
|
|
AtomicThreadId* const refs_;
|
|
|
|
const int thread_no_;
|
|
|
|
base::Thread* const thread_to_start_;
|
|
|
|
base::Semaphore* const semaphore_;
|
2011-04-11 23:46:22 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
TEST(ThreadIdValidation) {
|
2019-03-11 09:35:40 +00:00
|
|
|
constexpr int kNThreads = 100;
|
|
|
|
std::unique_ptr<ThreadIdValidationThread> threads[kNThreads];
|
|
|
|
AtomicThreadId refs[kNThreads];
|
|
|
|
base::Semaphore semaphore(0);
|
2011-04-11 23:46:22 +00:00
|
|
|
for (int i = kNThreads - 1; i >= 0; i--) {
|
2019-03-11 09:35:40 +00:00
|
|
|
ThreadIdValidationThread* prev =
|
|
|
|
i == kNThreads - 1 ? nullptr : threads[i + 1].get();
|
|
|
|
threads[i] =
|
|
|
|
base::make_unique<ThreadIdValidationThread>(prev, refs, i, &semaphore);
|
2011-04-11 23:46:22 +00:00
|
|
|
}
|
2019-03-11 09:35:40 +00:00
|
|
|
threads[0]->Start();
|
2011-04-11 23:46:22 +00:00
|
|
|
for (int i = 0; i < kNThreads; i++) {
|
2014-02-06 07:16:41 +00:00
|
|
|
semaphore.Wait();
|
2011-04-11 23:46:22 +00:00
|
|
|
}
|
|
|
|
}
|
2019-03-11 09:35:40 +00:00
|
|
|
|
|
|
|
} // namespace internal
|
|
|
|
} // namespace v8
|