factor/vm/tuples.cpp

38 lines
874 B
C++
Raw Normal View History

2009-05-02 05:04:19 -04:00
#include "master.hpp"
2009-05-04 02:46:13 -04:00
namespace factor
{
2009-05-02 05:04:19 -04:00
/* push a new tuple on the stack */
2009-05-02 10:19:09 -04:00
F_TUPLE *allot_tuple(CELL layout_)
2009-05-02 05:04:19 -04:00
{
2009-05-02 10:19:09 -04:00
gc_root<F_TUPLE_LAYOUT> layout(layout_);
gc_root<F_TUPLE> tuple(allot<F_TUPLE>(tuple_size(layout.untagged())));
tuple->layout = layout.value();
return tuple.untagged();
2009-05-02 05:04:19 -04:00
}
PRIMITIVE(tuple)
2009-05-02 05:04:19 -04:00
{
2009-05-02 10:19:09 -04:00
gc_root<F_TUPLE_LAYOUT> layout(dpop());
F_TUPLE *tuple = allot_tuple(layout.value());
2009-05-02 05:04:19 -04:00
F_FIXNUM i;
2009-05-02 10:19:09 -04:00
for(i = tuple_size(layout.untagged()) - 1; i >= 0; i--)
tuple->data()[i] = F;
2009-05-02 05:04:19 -04:00
dpush(tag<F_TUPLE>(tuple));
2009-05-02 05:04:19 -04:00
}
/* push a new tuple on the stack, filling its slots from the stack */
PRIMITIVE(tuple_boa)
2009-05-02 05:04:19 -04:00
{
2009-05-02 10:19:09 -04:00
gc_root<F_TUPLE_LAYOUT> layout(dpop());
gc_root<F_TUPLE> tuple(allot_tuple(layout.value()));
CELL size = untag_fixnum(layout.untagged()->size) * CELLS;
memcpy(tuple->data(),(CELL *)(ds - (size - CELLS)),size);
2009-05-02 10:19:09 -04:00
ds -= size;
dpush(tuple.value());
2009-05-02 05:04:19 -04:00
}
2009-05-04 02:46:13 -04:00
}