代码拉取完成,页面将自动刷新
同步操作将从 hinus/pythonvm 强制同步,此操作会覆盖自 Fork 仓库以来所做的任何修改,且无法恢复!!!
确定后同步将在后台操作,完成时将刷新页面,请耐心等待。
#include "runtime/universe.hpp"
#include "runtime/stringTable.hpp"
#include "runtime/interpreter.hpp"
#include "memory/oopClosure.hpp"
#include "memory/heap.hpp"
#include "util/handles.hpp"
#include "util/stack.hpp"
#include "util/map.hpp"
#include "object/hiObject.hpp"
ScavengeOopClosure::ScavengeOopClosure(Space* from, Space* to, Space* meta) {
_from = from;
_to = to;
_meta = meta;
_oop_stack = new Stack<HiObject*>(1024);
}
ScavengeOopClosure::~ScavengeOopClosure() {
_from = NULL;
_to = NULL;
delete _oop_stack;
_oop_stack = NULL;
}
void ScavengeOopClosure::do_oop(HiObject** oop) {
if (oop == NULL || *oop == NULL)
return;
// this oop has been handled, since it may be
// refered by Klass
if(!_from->has_obj((char*)*oop))
return;
(*oop) = copy_and_push(*oop);
}
void ScavengeOopClosure::do_array_list(ArrayList<Klass*>** alist) {
if (alist == NULL || *alist == NULL)
return;
// no chance to visit list more than once.
assert(_from->has_obj((char*)*alist));
size_t size = sizeof(ArrayList<Klass*>);
char* target = (char*)_to->allocate(size);
memcpy(target, (*alist), size);
(*(char**)alist) = target;
(*alist)->oops_do(this);
}
void ScavengeOopClosure::do_array_list(ArrayList<HiObject*>** alist) {
if (alist == NULL || *alist == NULL)
return;
assert(_from->has_obj((char*)*alist));
size_t size = sizeof(ArrayList<HiObject*>);
char* target = (char*)_to->allocate(size);
memcpy(target, (*alist), size);
(*(char**)alist) = target;
(*alist)->oops_do(this);
}
void ScavengeOopClosure::do_map(Map<HiObject*, HiObject*>** amap) {
if (amap == NULL || *amap == NULL)
return;
assert(_from->has_obj((char*)*amap));
size_t size = sizeof(Map<HiObject*, HiObject*>);
char* target = (char*)_to->allocate(size);
memcpy(target, (*amap), size);
(*(char**)amap) = target;
(*amap)->oops_do(this);
}
void ScavengeOopClosure::do_raw_mem(char** mem, int length) {
if (*mem == NULL)
return;
char* target = (char*)_to->allocate(length);
memcpy(target, (*mem), length);
(*mem) = target;
}
// we do not move klass
void ScavengeOopClosure::do_klass(Klass** k) {
if (k == NULL || *k == NULL)
return;
(*k)->oops_do(this);
}
HiObject* ScavengeOopClosure::copy_and_push(HiObject* obj) {
char* target = obj->new_address();
if (target) {
return (HiObject*)target;
}
// copy
size_t size = obj->size();
target = (char*)_to->allocate(size);
memcpy(target, obj, size);
obj->set_new_address(target);
// push
_oop_stack->push((HiObject*)target);
return (HiObject*)target;
}
void ScavengeOopClosure::scavenge() {
// TODO : step 1, mark roots
process_roots();
// step2, process all objects;
while (!_oop_stack->empty()) {
_oop_stack->pop()->oops_do(this);
}
}
void ScavengeOopClosure::process_roots() {
Universe::oops_do(this);
Interpreter::get_instance()->oops_do(this);
HandleMark::get_instance()->oops_do(this);
StringTable::get_instance()->oops_do(this);
}
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。