* Copyright (c) 2021 Huawei Device Co., Ltd.
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#ifndef ECMASCRIPT_MEM_MARK_STACK_H
#define ECMASCRIPT_MEM_MARK_STACK_H
#include "ecmascript/js_tagged_value.h"
#include "ecmascript/mem/area.h"
#include "ecmascript/mem/ecma_list.h"
#include "ecmascript/mem/native_area_allocator.h"
#include "ecmascript/mem/space.h"
namespace panda {
namespace ecmascript {
class Stack {
public:
Stack() = default;
virtual ~Stack() = default;
NO_COPY_SEMANTIC(Stack);
NO_MOVE_SEMANTIC(Stack);
uintptr_t GetBegin() const
{
return begin_;
}
uintptr_t PopBackChecked()
{
if (UNLIKELY(top_ <= reinterpret_cast<uintptr_t *>(begin_))) {
return 0;
}
return *--top_;
}
void PushBackUnchecked(uintptr_t obj)
{
*top_++ = obj;
}
uintptr_t PopBackUnchecked()
{
return *--top_;
}
bool PushBackChecked(uintptr_t obj)
{
if (UNLIKELY(top_ >= end_)) {
return false;
}
*top_++ = obj;
return true;
}
bool IsEmpty() const
{
return top_ == reinterpret_cast<uintptr_t *>(begin_);
}
void ResetBegin(uintptr_t begin, uintptr_t end)
{
begin_ = begin;
top_ = reinterpret_cast<uintptr_t *>(begin);
end_ = reinterpret_cast<uintptr_t *>(end);
}
void ResetTop(uintptr_t begin, uintptr_t end)
{
begin_ = begin;
top_ = end_ = reinterpret_cast<uintptr_t *>(end);
}
private:
template<class T>
friend class ContinuousStack;
uintptr_t begin_ {0};
uintptr_t *end_ {nullptr};
uintptr_t *top_ {nullptr};
};
template<class T>
class ContinuousStack : public Stack {
public:
ContinuousStack() = default;
~ContinuousStack() override = default;
NO_COPY_SEMANTIC(ContinuousStack);
NO_MOVE_SEMANTIC(ContinuousStack);
inline void BeginMarking(ContinuousStack<T> *other)
{
currentArea_ = other->currentArea_;
if (currentArea_ == nullptr) {
currentArea_ = NativeAreaAllocator::AllocateSpace(DEFAULT_MARK_STACK_SIZE);
}
ResetBegin(currentArea_->GetBegin(), currentArea_->GetEnd());
}
inline void FinishMarking(ContinuousStack<T> *other)
{
other->currentArea_ = currentArea_;
while (!areaList_.IsEmpty()) {
Area *node = areaList_.PopBack();
NativeAreaAllocator::FreeSpace(node);
}
while (!unusedList_.IsEmpty()) {
Area *node = unusedList_.PopBack();
NativeAreaAllocator::FreeSpace(node);
}
}
T *PopBack()
{
if (UNLIKELY(top_ <= reinterpret_cast<uintptr_t *>(begin_))) {
if (!areaList_.IsEmpty()) {
unusedList_.AddNode(currentArea_);
Area *last = areaList_.PopBack();
currentArea_ = last;
ResetTop(currentArea_->GetBegin(), currentArea_->GetEnd());
} else {
return nullptr;
}
}
return reinterpret_cast<T *>(PopBackUnchecked());
}
void PushBack(T *obj)
{
if (UNLIKELY(top_ >= end_)) {
Extend();
}
PushBackUnchecked(ToUintPtr(obj));
}
inline void Destroy()
{
if (currentArea_ != nullptr) {
NativeAreaAllocator::FreeSpace(currentArea_);
currentArea_ = nullptr;
}
}
private:
inline void Extend()
{
auto area = NativeAreaAllocator::AllocateSpace(DEFAULT_MARK_STACK_SIZE);
areaList_.AddNode(currentArea_);
currentArea_ = area;
ResetBegin(currentArea_->GetBegin(), currentArea_->GetEnd());
}
Area *currentArea_ {nullptr};
EcmaList<Area> areaList_ {};
EcmaList<Area> unusedList_ {};
};
using ProcessQueue = ContinuousStack<JSTaggedType>;
using WeakLinkedHashMapProcessQueue = ContinuousStack<TaggedObject>;
}
}
#endif