|
|
@@ -1,98 +1,131 @@
|
|
|
#pragma once
|
|
|
|
|
|
-#include "ceval.h"
|
|
|
+#include "cffi.h"
|
|
|
+#include "common.h"
|
|
|
#include "frame.h"
|
|
|
|
|
|
namespace pkpy{
|
|
|
|
|
|
-class RangeIter final: public BaseIter {
|
|
|
+struct RangeIter{
|
|
|
+ PY_CLASS(RangeIter, builtins, "_range_iterator")
|
|
|
+ Range r;
|
|
|
i64 current;
|
|
|
- Range r; // copy by value, so we don't need to keep ref
|
|
|
-public:
|
|
|
- RangeIter(VM* vm, PyObject* ref) : BaseIter(vm) {
|
|
|
- this->r = OBJ_GET(Range, ref);
|
|
|
- this->current = r.start;
|
|
|
- }
|
|
|
+ RangeIter(Range r) : r(r), current(r.start) {}
|
|
|
|
|
|
- bool _has_next(){
|
|
|
- return r.step > 0 ? current < r.stop : current > r.stop;
|
|
|
+ static void _register(VM* vm, PyObject* mod, PyObject* type){
|
|
|
+ vm->_all_types[OBJ_GET(Type, type)].subclass_enabled = false;
|
|
|
+ vm->bind_notimplemented_constructor<RangeIter>(type);
|
|
|
+ vm->bind__iter__(OBJ_GET(Type, type), [](VM* vm, PyObject* obj){ return obj; });
|
|
|
+ vm->bind__next__(OBJ_GET(Type, type), [](VM* vm, PyObject* obj){
|
|
|
+ RangeIter& self = _CAST(RangeIter&, obj);
|
|
|
+ bool has_next = self.r.step > 0 ? self.current < self.r.stop : self.current > self.r.stop;
|
|
|
+ if(!has_next) return vm->StopIteration;
|
|
|
+ self.current += self.r.step;
|
|
|
+ return VAR(self.current - self.r.step);
|
|
|
+ });
|
|
|
}
|
|
|
+};
|
|
|
+
|
|
|
+struct ArrayIter{
|
|
|
+ PY_CLASS(ArrayIter, builtins, "_array_iterator")
|
|
|
+ PyObject* ref;
|
|
|
+ PyObject** begin;
|
|
|
+ PyObject** end;
|
|
|
+ PyObject** current;
|
|
|
+
|
|
|
+ ArrayIter(PyObject* ref, PyObject** begin, PyObject** end)
|
|
|
+ : ref(ref), begin(begin), end(end), current(begin) {}
|
|
|
|
|
|
- PyObject* next(){
|
|
|
- if(!_has_next()) return vm->StopIteration;
|
|
|
- current += r.step;
|
|
|
- return VAR(current-r.step);
|
|
|
+ void _gc_mark() const{ OBJ_MARK(ref); }
|
|
|
+
|
|
|
+ static void _register(VM* vm, PyObject* mod, PyObject* type){
|
|
|
+ vm->_all_types[OBJ_GET(Type, type)].subclass_enabled = false;
|
|
|
+ vm->bind_notimplemented_constructor<ArrayIter>(type);
|
|
|
+ vm->bind__iter__(OBJ_GET(Type, type), [](VM* vm, PyObject* obj){ return obj; });
|
|
|
+ vm->bind__next__(OBJ_GET(Type, type), [](VM* vm, PyObject* obj){
|
|
|
+ ArrayIter& self = _CAST(ArrayIter&, obj);
|
|
|
+ if(self.current == self.end) return vm->StopIteration;
|
|
|
+ return *self.current++;
|
|
|
+ });
|
|
|
}
|
|
|
};
|
|
|
|
|
|
-template <typename T>
|
|
|
-class ArrayIter final: public BaseIter {
|
|
|
+struct StringIter{
|
|
|
+ PY_CLASS(StringIter, builtins, "_string_iterator")
|
|
|
PyObject* ref;
|
|
|
- T* array;
|
|
|
+ Str* str;
|
|
|
int index;
|
|
|
-public:
|
|
|
- ArrayIter(VM* vm, PyObject* ref) : BaseIter(vm), ref(ref) {
|
|
|
- array = &OBJ_GET(T, ref);
|
|
|
- index = 0;
|
|
|
- }
|
|
|
|
|
|
- PyObject* next() override{
|
|
|
- if(index >= array->size()) return vm->StopIteration;
|
|
|
- return array->operator[](index++);
|
|
|
- }
|
|
|
+ StringIter(PyObject* ref) : ref(ref), str(&OBJ_GET(Str, ref)), index(0) {}
|
|
|
|
|
|
- void _gc_mark() const{
|
|
|
- OBJ_MARK(ref);
|
|
|
+ void _gc_mark() const{ OBJ_MARK(ref); }
|
|
|
+
|
|
|
+ static void _register(VM* vm, PyObject* mod, PyObject* type){
|
|
|
+ vm->_all_types[OBJ_GET(Type, type)].subclass_enabled = false;
|
|
|
+ vm->bind_notimplemented_constructor<StringIter>(type);
|
|
|
+ vm->bind__iter__(OBJ_GET(Type, type), [](VM* vm, PyObject* obj){ return obj; });
|
|
|
+ vm->bind__next__(OBJ_GET(Type, type), [](VM* vm, PyObject* obj){
|
|
|
+ StringIter& self = _CAST(StringIter&, obj);
|
|
|
+ // TODO: optimize this... operator[] is of O(n) complexity
|
|
|
+ if(self.index == self.str->u8_length()) return vm->StopIteration;
|
|
|
+ return VAR(self.str->u8_getitem(self.index++));
|
|
|
+ });
|
|
|
}
|
|
|
};
|
|
|
|
|
|
-class StringIter final: public BaseIter {
|
|
|
- PyObject* ref;
|
|
|
- int index;
|
|
|
-public:
|
|
|
- StringIter(VM* vm, PyObject* ref) : BaseIter(vm), ref(ref), index(0) {}
|
|
|
-
|
|
|
- PyObject* next() override{
|
|
|
- // TODO: optimize this to use iterator
|
|
|
- // operator[] is O(n) complexity
|
|
|
- Str* str = &OBJ_GET(Str, ref);
|
|
|
- if(index == str->u8_length()) return vm->StopIteration;
|
|
|
- return VAR(str->u8_getitem(index++));
|
|
|
+struct Generator{
|
|
|
+ PY_CLASS(Generator, builtins, "_generator")
|
|
|
+ Frame frame;
|
|
|
+ int state; // 0,1,2
|
|
|
+ List s_backup;
|
|
|
+
|
|
|
+ Generator(Frame&& frame, ArgsView buffer): frame(std::move(frame)), state(0) {
|
|
|
+ for(PyObject* obj: buffer) s_backup.push_back(obj);
|
|
|
}
|
|
|
|
|
|
void _gc_mark() const{
|
|
|
- OBJ_MARK(ref);
|
|
|
+ frame._gc_mark();
|
|
|
+ for(PyObject* obj: s_backup) OBJ_MARK(obj);
|
|
|
}
|
|
|
-};
|
|
|
|
|
|
-inline PyObject* Generator::next(){
|
|
|
- if(state == 2) return vm->StopIteration;
|
|
|
- // reset frame._sp_base
|
|
|
- frame._sp_base = frame._s->_sp;
|
|
|
- frame._locals.a = frame._s->_sp;
|
|
|
- // restore the context
|
|
|
- for(PyObject* obj: s_backup) frame._s->push(obj);
|
|
|
- s_backup.clear();
|
|
|
- vm->callstack.push(std::move(frame));
|
|
|
- PyObject* ret = vm->_run_top_frame();
|
|
|
- if(ret == PY_OP_YIELD){
|
|
|
- // backup the context
|
|
|
- frame = std::move(vm->callstack.top());
|
|
|
- PyObject* ret = frame._s->popx();
|
|
|
- for(PyObject* obj: frame.stack_view()) s_backup.push_back(obj);
|
|
|
- vm->_pop_frame();
|
|
|
- state = 1;
|
|
|
- if(ret == vm->StopIteration) state = 2;
|
|
|
- return ret;
|
|
|
- }else{
|
|
|
- state = 2;
|
|
|
- return vm->StopIteration;
|
|
|
+ PyObject* next(VM* vm){
|
|
|
+ if(state == 2) return vm->StopIteration;
|
|
|
+ // reset frame._sp_base
|
|
|
+ frame._sp_base = frame._s->_sp;
|
|
|
+ frame._locals.a = frame._s->_sp;
|
|
|
+ // restore the context
|
|
|
+ for(PyObject* obj: s_backup) frame._s->push(obj);
|
|
|
+ s_backup.clear();
|
|
|
+ vm->callstack.push(std::move(frame));
|
|
|
+ PyObject* ret = vm->_run_top_frame();
|
|
|
+ if(ret == PY_OP_YIELD){
|
|
|
+ // backup the context
|
|
|
+ frame = std::move(vm->callstack.top());
|
|
|
+ PyObject* ret = frame._s->popx();
|
|
|
+ for(PyObject* obj: frame.stack_view()) s_backup.push_back(obj);
|
|
|
+ vm->_pop_frame();
|
|
|
+ state = 1;
|
|
|
+ if(ret == vm->StopIteration) state = 2;
|
|
|
+ return ret;
|
|
|
+ }else{
|
|
|
+ state = 2;
|
|
|
+ return vm->StopIteration;
|
|
|
+ }
|
|
|
}
|
|
|
-}
|
|
|
|
|
|
-inline void Generator::_gc_mark() const{
|
|
|
- frame._gc_mark();
|
|
|
- for(PyObject* obj: s_backup) OBJ_MARK(obj);
|
|
|
+ static void _register(VM* vm, PyObject* mod, PyObject* type){
|
|
|
+ vm->_all_types[OBJ_GET(Type, type)].subclass_enabled = false;
|
|
|
+ vm->bind_notimplemented_constructor<Generator>(type);
|
|
|
+ vm->bind__iter__(OBJ_GET(Type, type), [](VM* vm, PyObject* obj){ return obj; });
|
|
|
+ vm->bind__next__(OBJ_GET(Type, type), [](VM* vm, PyObject* obj){
|
|
|
+ Generator& self = _CAST(Generator&, obj);
|
|
|
+ return self.next(vm);
|
|
|
+ });
|
|
|
+ }
|
|
|
+};
|
|
|
+
|
|
|
+inline PyObject* VM::_py_generator(Frame&& frame, ArgsView buffer){
|
|
|
+ return VAR_T(Generator, std::move(frame), buffer);
|
|
|
}
|
|
|
|
|
|
} // namespace pkpy
|