Commit 3a0704f7 authored by Mircea Trofin's avatar Mircea Trofin Committed by Commit Bot

Revert "Revert "Revert "[wasm] Throttle the amount of unfinished work to avoid OOM"""

This reverts commit 1835b4b1.

Reason for revert: This has a perf regression, wasn't ready just yet.

Original change's description:
> Revert "Revert "[wasm] Throttle the amount of unfinished work to avoid OOM""
> 
> This reverts commit 4ee49181.
> 
> Reason for revert: Fix: in d8, blocking all the bg threads starves the GC.
> 
> Original change's description:
> > Revert "[wasm] Throttle the amount of unfinished work to avoid OOM"
> > 
> > This reverts commit 1280954d.
> > 
> > Reason for revert: Speculative, GC stress bots started taking much longer after this change.
> > 
> > Original change's description:
> > > [wasm] Throttle the amount of unfinished work to avoid OOM
> > > 
> > > It is possible that the foreground task is unable to clear the
> > > scheduled unfinished work, eventually leading to an OOM.
> > > 
> > > We use either code_range on 64 bit, or the capacity of the code space,
> > > as a heuristic for how much memory to use for compilation.
> > > 
> > > Bug: v8:6492, chromium:732010
> > > Change-Id: I1e4c0825351a42fa0b8369ccc41800ac3445563d
> > > Reviewed-on: https://chromium-review.googlesource.com/535017
> > > Commit-Queue: Brad Nelson <bradnelson@chromium.org>
> > > Reviewed-by: Brad Nelson <bradnelson@chromium.org>
> > > Cr-Commit-Position: refs/heads/master@{#46017}
> > 
> > TBR=bradnelson@chromium.org,mtrofin@chromium.org,ahaas@chromium.org
> > 
> > Change-Id: I8883cee7f77667530bc50f91bfb468c485e6f7f2
> > No-Presubmit: true
> > No-Tree-Checks: true
> > No-Try: true
> > Bug: v8:6492, chromium:732010
> > Reviewed-on: https://chromium-review.googlesource.com/540270
> > Reviewed-by: Bill Budge <bbudge@chromium.org>
> > Commit-Queue: Bill Budge <bbudge@chromium.org>
> > Cr-Commit-Position: refs/heads/master@{#46020}
> 
> TBR=bradnelson@chromium.org,bbudge@chromium.org,mtrofin@chromium.org,ahaas@chromium.org
> 
> Change-Id: I1e7a1d0202c3161f9a7139e8895eebf472473ad3
> No-Presubmit: true
> No-Tree-Checks: true
> No-Try: true
> Bug: v8:6492, chromium:732010
> Reviewed-on: https://chromium-review.googlesource.com/540841
> Reviewed-by: Brad Nelson <bradnelson@chromium.org>
> Reviewed-by: Mircea Trofin <mtrofin@chromium.org>
> Commit-Queue: Brad Nelson <bradnelson@chromium.org>
> Cr-Commit-Position: refs/heads/master@{#46022}

TBR=bradnelson@chromium.org,bbudge@chromium.org,mtrofin@chromium.org,mtrofin@google.com,ahaas@chromium.org

Change-Id: Ic1351325173b233be3972ff3c159c035838fa963
No-Presubmit: true
No-Tree-Checks: true
No-Try: true
Bug: v8:6492, chromium:732010
Reviewed-on: https://chromium-review.googlesource.com/540842Reviewed-by: 's avatarMircea Trofin <mtrofin@chromium.org>
Commit-Queue: Mircea Trofin <mtrofin@chromium.org>
Cr-Commit-Position: refs/heads/master@{#46023}
parent 1835b4b1
......@@ -208,7 +208,6 @@ class V8_EXPORT_PRIVATE CompilationJob {
State state() const { return state_; }
CompilationInfo* info() const { return info_; }
Isolate* isolate() const;
virtual size_t AllocatedMemory() const { return 0; }
protected:
// Overridden by the actual implementation.
......
......@@ -690,8 +690,6 @@ class PipelineWasmCompilationJob final : public CompilationJob {
Status FinalizeJobImpl() final;
private:
size_t AllocatedMemory() const override;
ZoneStats zone_stats_;
std::unique_ptr<PipelineStatistics> pipeline_statistics_;
PipelineData data_;
......@@ -738,10 +736,6 @@ PipelineWasmCompilationJob::ExecuteJobImpl() {
return SUCCEEDED;
}
size_t PipelineWasmCompilationJob::AllocatedMemory() const {
return pipeline_.data_->zone_stats()->GetCurrentAllocatedBytes();
}
PipelineWasmCompilationJob::Status
PipelineWasmCompilationJob::FinalizeJobImpl() {
pipeline_.AssembleCode(&linkage_);
......
......@@ -3975,12 +3975,6 @@ void WasmCompilationUnit::ExecuteCompilation() {
isolate_->counters()->wasm_compile_function_time());
}
ExecuteCompilationInternal();
// Record the memory cost this unit places on the system until
// it is finalized. That may be "0" in error cases.
if (job_) {
size_t cost = job_->AllocatedMemory();
set_memory_cost(cost);
}
}
void WasmCompilationUnit::ExecuteCompilationInternal() {
......
......@@ -64,9 +64,6 @@ class WasmCompilationUnit final {
wasm::ModuleBytesEnv* module_env,
const wasm::WasmFunction* function);
void set_memory_cost(size_t memory_cost) { memory_cost_ = memory_cost; }
size_t memory_cost() const { return memory_cost_; }
private:
SourcePositionTable* BuildGraphForWasmFunction(double* decode_ms);
......@@ -88,7 +85,7 @@ class WasmCompilationUnit final {
int func_index_;
wasm::Result<wasm::DecodeStruct*> graph_construction_result_;
bool ok_ = true;
size_t memory_cost_ = 0;
void ExecuteCompilationInternal();
DISALLOW_COPY_AND_ASSIGN(WasmCompilationUnit);
......
......@@ -68,11 +68,11 @@ ZoneStats::~ZoneStats() {
DCHECK(stats_.empty());
}
size_t ZoneStats::GetMaxAllocatedBytes() const {
size_t ZoneStats::GetMaxAllocatedBytes() {
return std::max(max_allocated_bytes_, GetCurrentAllocatedBytes());
}
size_t ZoneStats::GetCurrentAllocatedBytes() const {
size_t ZoneStats::GetCurrentAllocatedBytes() {
size_t total = 0;
for (Zone* zone : zones_) {
total += static_cast<size_t>(zone->allocation_size());
......@@ -80,7 +80,7 @@ size_t ZoneStats::GetCurrentAllocatedBytes() const {
return total;
}
size_t ZoneStats::GetTotalAllocatedBytes() const {
size_t ZoneStats::GetTotalAllocatedBytes() {
return total_deleted_bytes_ + GetCurrentAllocatedBytes();
}
......
......@@ -66,9 +66,9 @@ class V8_EXPORT_PRIVATE ZoneStats final {
explicit ZoneStats(AccountingAllocator* allocator);
~ZoneStats();
size_t GetMaxAllocatedBytes() const;
size_t GetTotalAllocatedBytes() const;
size_t GetCurrentAllocatedBytes() const;
size_t GetMaxAllocatedBytes();
size_t GetTotalAllocatedBytes();
size_t GetCurrentAllocatedBytes();
private:
Zone* NewEmptyZone(const char* zone_name);
......
......@@ -39,22 +39,14 @@ namespace internal {
namespace wasm {
ModuleCompiler::CodeGenerationSchedule::CodeGenerationSchedule(
base::RandomNumberGenerator* random_number_generator, size_t max_memory)
: random_number_generator_(random_number_generator),
max_memory_(max_memory) {
base::RandomNumberGenerator* random_number_generator)
: random_number_generator_(random_number_generator) {
DCHECK_NOT_NULL(random_number_generator_);
DCHECK_GT(max_memory_, 0);
}
void ModuleCompiler::CodeGenerationSchedule::Schedule(
std::unique_ptr<compiler::WasmCompilationUnit>&& item) {
size_t cost = item->memory_cost();
schedule_.push_back(std::move(item));
allocated_memory_.Increment(cost);
}
bool ModuleCompiler::CodeGenerationSchedule::CanAcceptWork() {
return (!throttle_ || allocated_memory_.Value() <= max_memory_);
}
std::unique_ptr<compiler::WasmCompilationUnit>
......@@ -81,66 +73,24 @@ ModuleCompiler::ModuleCompiler(Isolate* isolate,
module_(std::move(module)),
counters_shared_(isolate->counters_shared()),
is_sync_(is_sync),
executed_units_(
isolate->random_number_generator(),
(isolate->heap()->memory_allocator()->code_range()->valid()
? isolate->heap()->memory_allocator()->code_range()->size()
: isolate->heap()->code_space()->Capacity()) /
2),
num_background_tasks_(
Min(static_cast<size_t>(FLAG_wasm_num_compilation_tasks),
V8::GetCurrentPlatform()->NumberOfAvailableBackgroundThreads())),
stopped_compilation_tasks_{num_background_tasks_} {
executed_units_(isolate->random_number_generator()) {
counters_ = counters_shared_.get();
}
bool ModuleCompiler::GetNextUncompiledFunctionId(size_t* index) {
DCHECK_NOT_NULL(index);
// - 1 because AtomicIncrement returns the value after the atomic increment.
*index = next_unit_.Increment(1) - 1;
return *index < compilation_units_.size();
}
// The actual runnable task that performs compilations in the background.
ModuleCompiler::CompilationTask::CompilationTask(ModuleCompiler* compiler)
: CancelableTask(compiler->isolate_), compiler_(compiler) {}
void ModuleCompiler::CompilationTask::RunInternal() {
size_t index = 0;
while (compiler_->executed_units_.CanAcceptWork() &&
compiler_->GetNextUncompiledFunctionId(&index)) {
compiler_->CompileAndSchedule(index);
while (compiler_->FetchAndExecuteCompilationUnit()) {
}
compiler_->OnBackgroundTaskStopped();
compiler_->module_->pending_tasks.get()->Signal();
}
void ModuleCompiler::OnBackgroundTaskStopped() {
size_t num_stopped = stopped_compilation_tasks_.Increment(1);
DCHECK_LE(num_stopped, num_background_tasks_);
if (num_stopped == num_background_tasks_) {
compilation_tasks_cv_.NotifyOne();
}
}
void ModuleCompiler::CompileAndSchedule(size_t index) {
DisallowHeapAllocation no_allocation;
DisallowHandleAllocation no_handles;
DisallowHandleDereference no_deref;
DisallowCodeDependencyChange no_dependency_change;
DCHECK_LT(index, compilation_units_.size());
std::unique_ptr<compiler::WasmCompilationUnit> unit =
std::move(compilation_units_.at(index));
unit->ExecuteCompilation();
{
base::LockGuard<base::Mutex> guard(&result_mutex_);
executed_units_.Schedule(std::move(unit));
}
}
// Run by each compilation task The no_finisher_callback is called
// within the result_mutex_ lock when no finishing task is running,
// i.e. when the finisher_is_running_ flag is not set.
// Run by each compilation task and by the main thread. The
// no_finisher_callback is called within the result_mutex_ lock when no
// finishing task is running, i.e. when the finisher_is_running_ flag is not
// set.
bool ModuleCompiler::FetchAndExecuteCompilationUnit(
std::function<void()> no_finisher_callback) {
DisallowHeapAllocation no_allocation;
......@@ -149,7 +99,6 @@ bool ModuleCompiler::FetchAndExecuteCompilationUnit(
DisallowCodeDependencyChange no_dependency_change;
// - 1 because AtomicIncrement returns the value after the atomic increment.
// Bail out fast if there's no work to do.
size_t index = next_unit_.Increment(1) - 1;
if (index >= compilation_units_.size()) {
return false;
......@@ -187,35 +136,41 @@ size_t ModuleCompiler::InitializeParallelCompilation(
return funcs_to_compile;
}
void ModuleCompiler::RestartCompilationTasks() {
size_t current_stopped_tasks = stopped_compilation_tasks_.Value();
stopped_compilation_tasks_.Decrement(current_stopped_tasks);
for (size_t i = 0; i < current_stopped_tasks; ++i) {
uint32_t* ModuleCompiler::StartCompilationTasks() {
num_background_tasks_ =
Min(static_cast<size_t>(FLAG_wasm_num_compilation_tasks),
V8::GetCurrentPlatform()->NumberOfAvailableBackgroundThreads());
uint32_t* task_ids = new uint32_t[num_background_tasks_];
for (size_t i = 0; i < num_background_tasks_; ++i) {
CompilationTask* task = new CompilationTask(this);
task_ids[i] = task->id();
V8::GetCurrentPlatform()->CallOnBackgroundThread(
new CompilationTask(this),
v8::Platform::ExpectedRuntime::kShortRunningTask);
task, v8::Platform::kShortRunningTask);
}
return task_ids;
}
void ModuleCompiler::WaitForCompilationTasks() {
base::LockGuard<base::Mutex> guard(&cv_mutex_);
while (stopped_compilation_tasks_.Value() < num_background_tasks_) {
compilation_tasks_cv_.Wait(&cv_mutex_);
void ModuleCompiler::WaitForCompilationTasks(uint32_t* task_ids) {
for (size_t i = 0; i < num_background_tasks_; ++i) {
// If the task has not started yet, then we abort it. Otherwise we wait
// for it to finish.
if (isolate_->cancelable_task_manager()->TryAbort(task_ids[i]) !=
CancelableTaskManager::kTaskAborted) {
module_->pending_tasks.get()->Wait();
}
}
}
size_t ModuleCompiler::FinishCompilationUnits(
std::vector<Handle<Code>>& results, ErrorThrower* thrower) {
size_t finished = 0;
void ModuleCompiler::FinishCompilationUnits(std::vector<Handle<Code>>& results,
ErrorThrower* thrower) {
SetFinisherIsRunning(true);
while (true) {
int func_index = -1;
Handle<Code> result = FinishCompilationUnit(thrower, &func_index);
if (func_index < 0) break;
results[func_index] = result;
++finished;
}
RestartCompilationTasks();
return finished;
SetFinisherIsRunning(false);
}
void ModuleCompiler::SetFinisherIsRunning(bool value) {
......@@ -266,35 +221,30 @@ void ModuleCompiler::CompileInParallel(ModuleBytesEnv* module_env,
// and stores them in the vector {compilation_units}.
InitializeParallelCompilation(module->functions, *module_env);
executed_units_.EnableThrottling();
// Objects for the synchronization with the background threads.
base::AtomicNumber<size_t> next_unit(
static_cast<size_t>(FLAG_skip_compiling_wasm_funcs));
// 2) The main thread spawns {CompilationTask} instances which run on
// the background threads.
RestartCompilationTasks();
std::unique_ptr<uint32_t[]> task_ids(StartCompilationTasks());
size_t finished_functions = 0;
while (finished_functions < compilation_units_.size()) {
// 3.a) The background threads and the main thread pick one compilation
// unit at a time and execute the parallel phase of the compilation
// unit. After finishing the execution of the parallel phase, the
// result is enqueued in {executed_units}.
// The foreground task bypasses waiting on memory threshold, because
// its results will immediately be converted to code (below).
size_t index = 0;
if (GetNextUncompiledFunctionId(&index)) {
CompileAndSchedule(index);
}
while (FetchAndExecuteCompilationUnit()) {
// 3.b) If {executed_units} contains a compilation unit, the main thread
// dequeues it and finishes the compilation unit. Compilation units
// are finished concurrently to the background threads to save
// memory.
finished_functions += FinishCompilationUnits(results, thrower);
FinishCompilationUnits(results, thrower);
}
// 4) After the parallel phase of all compilation units has started, the
// main thread waits for all {CompilationTask} instances to finish - which
// happens once they all realize there's no next work item to process.
WaitForCompilationTasks();
// main thread waits for all {CompilationTask} instances to finish.
WaitForCompilationTasks(task_ids.get());
// Finish the compilation of the remaining compilation units.
FinishCompilationUnits(results, thrower);
}
void ModuleCompiler::CompileSequentially(ModuleBytesEnv* module_env,
......
......@@ -42,8 +42,7 @@ class ModuleCompiler {
class CodeGenerationSchedule {
public:
explicit CodeGenerationSchedule(
base::RandomNumberGenerator* random_number_generator,
size_t max_memory = 0);
base::RandomNumberGenerator* random_number_generator);
void Schedule(std::unique_ptr<compiler::WasmCompilationUnit>&& item);
......@@ -51,18 +50,11 @@ class ModuleCompiler {
std::unique_ptr<compiler::WasmCompilationUnit> GetNext();
bool CanAcceptWork();
void EnableThrottling() { throttle_ = true; }
private:
size_t GetRandomIndexInSchedule();
base::RandomNumberGenerator* random_number_generator_ = nullptr;
std::vector<std::unique_ptr<compiler::WasmCompilationUnit>> schedule_;
const size_t max_memory_;
bool throttle_ = false;
base::AtomicNumber<size_t> allocated_memory_{0};
};
Isolate* isolate_;
......@@ -75,7 +67,7 @@ class ModuleCompiler {
CodeGenerationSchedule executed_units_;
base::Mutex result_mutex_;
base::AtomicNumber<size_t> next_unit_;
const size_t num_background_tasks_;
size_t num_background_tasks_ = 0;
// This flag should only be set while holding result_mutex_.
bool finisher_is_running_ = false;
......@@ -86,18 +78,14 @@ class ModuleCompiler {
bool FetchAndExecuteCompilationUnit(
std::function<void()> no_finisher_callback = [] {});
void CompileAndSchedule(size_t index);
bool GetNextUncompiledFunctionId(size_t* index);
void OnBackgroundTaskStopped();
size_t InitializeParallelCompilation(
const std::vector<WasmFunction>& functions, ModuleBytesEnv& module_env);
void RestartCompilationTasks();
uint32_t* StartCompilationTasks();
void WaitForCompilationTasks();
void WaitForCompilationTasks(uint32_t* task_ids);
size_t FinishCompilationUnits(std::vector<Handle<Code>>& results,
void FinishCompilationUnits(std::vector<Handle<Code>>& results,
ErrorThrower* thrower);
void SetFinisherIsRunning(bool value);
......@@ -126,10 +114,6 @@ class ModuleCompiler {
Vector<const byte> asm_js_offset_table_bytes, Factory* factory,
WasmInstance* temp_instance, Handle<FixedArray>* function_tables,
Handle<FixedArray>* signature_tables);
base::AtomicNumber<size_t> stopped_compilation_tasks_{0};
base::Mutex cv_mutex_;
base::ConditionVariable compilation_tasks_cv_;
};
class JSToWasmWrapperCache {
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment