Merging array changes from pxt-microbit

This commit is contained in:
Brahma Giri Abhijith Chatra 2017-01-19 11:30:06 -08:00
parent 9c140a5e6f
commit b359411058
3 changed files with 379 additions and 68 deletions

View File

@ -81,7 +81,7 @@ namespace Boolean_ {
} }
//% //%
bool bang(bool v) { return !v; } bool bang(int v) { return v == 0; }
} }
namespace Number_ { namespace Number_ {
@ -158,13 +158,19 @@ namespace Array_ {
//% //%
int length(RefCollection *c) { return c->length(); } int length(RefCollection *c) { return c->length(); }
//% //%
void setLength(RefCollection *c, int newLength) { c->setLength(newLength); }
//%
void push(RefCollection *c, uint32_t x) { c->push(x); } void push(RefCollection *c, uint32_t x) { c->push(x); }
//% //%
uint32_t pop(RefCollection *c) { return c->pop(); }
//%
uint32_t getAt(RefCollection *c, int x) { return c->getAt(x); } uint32_t getAt(RefCollection *c, int x) { return c->getAt(x); }
//% //%
void removeAt(RefCollection *c, int x) { c->removeAt(x); } void setAt(RefCollection *c, int x, uint32_t y) { c->setAt(x, y); }
//% //%
void setAt(RefCollection *c, int x, uint32_t y) { c->setAt(x, y); } uint32_t removeAt(RefCollection *c, int x) { return c->removeAt(x); }
//%
void insertAt(RefCollection *c, int x, uint32_t value) { c->insertAt(x, value); }
//% //%
int indexOf(RefCollection *c, uint32_t x, int start) { return c->indexOf(x, start); } int indexOf(RefCollection *c, uint32_t x, int start) { return c->indexOf(x, start); }
//% //%

View File

@ -141,63 +141,327 @@ namespace pxt {
printf("RefRecord %p r=%d size=%d bytes\n", r, r->refcnt, r->getVTable()->numbytes); printf("RefRecord %p r=%d size=%d bytes\n", r, r->refcnt, r->getVTable()->numbytes);
} }
void RefCollection::push(uint32_t x) { uint32_t Segment::get(uint32_t i)
if (isRef()) incr(x); {
data.push_back(x); #ifdef DEBUG_BUILD
} printf("In Segment::get index:%u\n", i);
this->print();
uint32_t RefCollection::getAt(int x) { #endif
if (in_range(x)) {
uint32_t tmp = data.at(x); if (i < length)
if (isRef()) incr(tmp); {
return tmp; return data[i];
}
else {
error(ERR_OUT_OF_BOUNDS);
return 0;
} }
return Segment::DefaultValue;
} }
void RefCollection::removeAt(int x) { void Segment::set(uint32_t i, uint32_t value)
if (!in_range(x)) {
return; if (i < size)
{
if (isRef()) decr(data.at(x)); data[i] = value;
data.erase(data.begin()+x);
}
void RefCollection::setAt(int x, uint32_t y) {
if (!in_range(x))
return;
if (isRef()) {
decr(data.at(x));
incr(y);
}
data.at(x) = y;
}
int RefCollection::indexOf(uint32_t x, int start) {
if (!in_range(start))
return -1;
if (isString()) {
StringData *xx = (StringData*)x;
for (uint32_t i = start; i < data.size(); ++i) {
StringData *ee = (StringData*)data.at(i);
if (xx->len == ee->len && memcmp(xx->data, ee->data, xx->len) == 0)
return (int)i;
} }
} else { else if (i < Segment::MaxSize)
for (uint32_t i = start; i < data.size(); ++i) {
if (data.at(i) == x) growByMin(i + 1);
data[i] = value;
}
if (length <= i)
{
length = i + 1;
}
#ifdef DEBUG_BUILD
printf("In Segment::set\n");
this->print();
#endif
return;
}
uint16_t Segment::growthFactor(uint16_t size)
{
if (size == 0)
{
return 4;
}
if (size < 64)
{
return size * 2; // Double
}
if (size < 512)
{
return size * 5/3; //Grow by 1.66 rate
}
return size + 256; //Grow by constant rate
}
void Segment::growByMin(uint16_t minSize)
{
growBy(max(minSize, growthFactor(size)));
}
void Segment::growBy(uint16_t newSize)
{
#ifdef DEBUG_BUILD
printf("growBy: %d\n", newSize);
this->print();
#endif
if (size < newSize)
{
//this will throw if unable to allocate
uint32_t *tmp = (uint32_t*)(::operator new(newSize * sizeof(uint32_t)));
//Copy existing data
if (size)
{
memcpy(tmp, data, size * sizeof(uint32_t));
}
//fill the rest with default value
memset(tmp + size, Segment::DefaultValue, (newSize - size) * sizeof(uint32_t));
//free older segment;
::operator delete(data);
data = tmp;
size = newSize;
#ifdef DEBUG_BUILD
printf("growBy - after reallocation\n");
this->print();
#endif
}
//else { no shrinking yet; }
return;
}
void Segment::ensure(uint16_t newSize)
{
if (newSize < size)
{
return;
}
growByMin(newSize);
}
void Segment::setLength(uint32_t newLength)
{
if (newLength > size)
{
ensure(length);
}
length = newLength;
return;
}
void Segment::push(uint32_t value)
{
this->set(length, value);
}
uint32_t Segment::pop()
{
#ifdef DEBUG_BUILD
printf("In Segment::pop\n");
this->print();
#endif
if (length > 0)
{
uint32_t value = data[length];
data[length] = Segment::DefaultValue;
--length;
return value;
}
return Segment::DefaultValue;
}
//this function removes an element at index i and shifts the rest of the elements to
//left to fill the gap
uint32_t Segment::remove(uint32_t i)
{
#ifdef DEBUG_BUILD
printf("In Segment::remove index:%u\n", i);
this->print();
#endif
if (i < length)
{
//value to return
uint32_t ret = data[i];
if (i + 1 < length)
{
//Move the rest of the elements to fill in the gap.
memmove(data + i, data + i + 1, (length - i - 1) * sizeof(uint32_t));
}
length--;
data[length] = Segment::DefaultValue;
#ifdef DEBUG_BUILD
printf("After Segment::remove index:%u\n", i);
this->print();
#endif
return ret;
}
return Segment::DefaultValue;
}
//this function inserts element value at index i by shifting the rest of the elements right.
void Segment::insert(uint32_t i, uint32_t value)
{
#ifdef DEBUG_BUILD
printf("In Segment::insert index:%u value:%u\n", i, value);
this->print();
#endif
if (i < length)
{
ensure(length + 1);
if (i + 1 < length)
{
//Move the rest of the elements to fill in the gap.
memmove(data + i + 1, data + i, (length - i) * sizeof(uint32_t));
}
data[i] = value;
length++;
}
else
{
//This is insert beyond the length, just call set which will adjust the length
set(i, value);
}
#ifdef DEBUG_BUILD
printf("After Segment::insert index:%u\n", i);
this->print();
#endif
}
void Segment::print()
{
printf("Segment: %x, length: %u, size: %u\n", data, (uint32_t)length, (uint32_t)size);
for(uint32_t i = 0; i < size; i++)
{
printf("%d ",(uint32_t)data[i]);
}
printf("\n");
}
bool Segment::isValidIndex(uint32_t i)
{
if (i > length)
{
return false;
}
return true;
}
void Segment::destroy()
{
#ifdef DEBUG_BUILD
printf("In Segment::destroy\n");
this->print();
#endif
length = size = 0;
::operator delete(data);
data = nullptr;
}
void RefCollection::push(uint32_t x)
{
if (isRef()) incr(x);
head.push(x);
}
uint32_t RefCollection::pop()
{
uint32_t ret = head.pop();
if (isRef())
{
incr(ret);
}
return ret;
}
uint32_t RefCollection::getAt(int i)
{
uint32_t tmp = head.get(i);
if (isRef())
{
incr(tmp);
}
return tmp;
}
uint32_t RefCollection::removeAt(int i)
{
if (isRef())
{
decr(head.get(i));
}
return head.remove(i);
}
void RefCollection::insertAt(int i, uint32_t value)
{
head.insert(i, value);
if (isRef())
{
incr(value);
}
}
void RefCollection::setAt(int i, uint32_t value)
{
if (isRef())
{
if (head.isValidIndex((uint32_t)i))
{
decr(head.get(i));
}
incr(value);
}
head.set(i, value);
}
int RefCollection::indexOf(uint32_t x, int start)
{
if (isString())
{
StringData *xx = (StringData*)x;
uint32_t i = start;
while(head.isValidIndex(i))
{
StringData *ee = (StringData*)head.get(i);
if (ee == xx)
{
//handles ee being null
return (int) i;
}
if (ee && xx->len == ee->len && memcmp(xx->data, ee->data, xx->len) == 0)
{
return (int)i; return (int)i;
}
i++;
}
}
else
{
uint32_t i = start;
while(head.isValidIndex(i))
{
if (head.get(i) == x)
{
return (int)i;
}
i++;
}
} }
return -1; return -1;
} }
int RefCollection::removeElement(uint32_t x) { int RefCollection::removeElement(uint32_t x)
{
int idx = indexOf(x, 0); int idx = indexOf(x, 0);
if (idx >= 0) { if (idx >= 0) {
removeAt(idx); removeAt(idx);
@ -239,17 +503,20 @@ namespace pxt {
void RefCollection::destroy() void RefCollection::destroy()
{ {
if (this->isRef()) if (this->isRef())
for (uint32_t i = 0; i < this->data.size(); ++i) { {
decr(this->data[i]); for(uint32_t i = 0; i < this->head.getLength(); i++)
this->data[i] = 0; {
decr(this->head.get(i));
} }
this->data.resize(0); }
this->head.destroy();
delete this; delete this;
} }
void RefCollection::print() void RefCollection::print()
{ {
printf("RefCollection %p r=%d flags=%d size=%d [%p, ...]\n", this, refcnt, getFlags(), data.size(), data.size() > 0 ? data[0] : 0); printf("RefCollection %p r=%d flags=%d size=%d\n", this, refcnt, getFlags(), head.getLength());
head.print();
} }
PXT_VTABLE_CTOR(RefAction) {} PXT_VTABLE_CTOR(RefAction) {}

View File

@ -1,7 +1,7 @@
#ifndef __PXT_H #ifndef __PXT_H
#define __PXT_H #define __PXT_H
// #define DEBUG_MEMLEAKS 1 //#define DEBUG_MEMLEAKS 1
#pragma GCC diagnostic ignored "-Wunused-parameter" #pragma GCC diagnostic ignored "-Wunused-parameter"
@ -63,7 +63,7 @@ namespace pxt {
int templateHash(); int templateHash();
int programHash(); int programHash();
uint32_t programSize(); uint32_t programSize();
uint32_t afterProgramPage(); uint32_t afterProgramPage();
int getNumGlobals(); int getNumGlobals();
RefRecord* mkClassInstance(int vtableOffset); RefRecord* mkClassInstance(int vtableOffset);
@ -167,11 +167,49 @@ namespace pxt {
} }
}; };
class Segment {
private:
uint32_t* data;
uint16_t length;
uint16_t size;
static const uint16_t MaxSize = 0xFFFF;
static const uint32_t DefaultValue = 0x0;
static uint16_t growthFactor(uint16_t size);
void growByMin(uint16_t minSize);
void growBy(uint16_t newSize);
void ensure(uint16_t newSize);
public:
Segment() : data (nullptr), length(0), size(0) {};
uint32_t get(uint32_t i);
void set(uint32_t i, uint32_t value);
uint32_t getLength() { return length;};
void setLength(uint32_t newLength);
void push(uint32_t value);
uint32_t pop();
uint32_t remove(uint32_t i);
void insert(uint32_t i, uint32_t value);
bool isValidIndex(uint32_t i);
void destroy();
void print();
};
// A ref-counted collection of either primitive or ref-counted objects (String, Image, // A ref-counted collection of either primitive or ref-counted objects (String, Image,
// user-defined record, another collection) // user-defined record, another collection)
class RefCollection class RefCollection
: public RefObject : public RefObject
{ {
private:
Segment head;
public: public:
// 1 - collection of refs (need decr) // 1 - collection of refs (need decr)
// 2 - collection of strings (in fact we always have 3, never 2 alone) // 2 - collection of strings (in fact we always have 3, never 2 alone)
@ -179,23 +217,23 @@ namespace pxt {
inline bool isRef() { return getFlags() & 1; } inline bool isRef() { return getFlags() & 1; }
inline bool isString() { return getFlags() & 2; } inline bool isString() { return getFlags() & 2; }
std::vector<uint32_t> data;
RefCollection(uint16_t f); RefCollection(uint16_t f);
inline bool in_range(int x) {
return (0 <= x && x < (int)data.size());
}
inline int length() { return data.size(); }
void destroy(); void destroy();
void print(); void print();
uint32_t length() { return head.getLength();}
void setLength(uint32_t newLength) { head.setLength(newLength); }
void push(uint32_t x); void push(uint32_t x);
uint32_t getAt(int x); uint32_t pop();
void removeAt(int x); uint32_t getAt(int i);
void setAt(int x, uint32_t y); void setAt(int i, uint32_t x);
//removes the element at index i and shifts the other elements left
uint32_t removeAt(int i);
//inserts the element at index i and moves the other elements right.
void insertAt(int i, uint32_t x);
int indexOf(uint32_t x, int start); int indexOf(uint32_t x, int start);
int removeElement(uint32_t x); int removeElement(uint32_t x);
}; };