#if 0
==ArrayNew 8035a460 80335db8 9c
==ArrayFree 8035a4fc 80335e54 94
==ArrayLength 8035a590 80025100 8
==ArrayNth 8035a598 80335ef0 30
==ArrayAppend 8035a5c8 80335f20 124
ArrayInsertSorted 8035a6ec 80336044 180
ArrayRemoveAt 8035a86c 803361c4 ac
ArrayDeleteAt 8035a918 80336270 f0
ArrayReplaceAt 8035aa08 80336360 b8
# ArraySort 80336418 18
ArraySearch 8035aad8 80336430 198
ArrayMapBackwards 8035ac70 803365c8 9c
ArrayMapBackwards2 8035ad0c 80336664 a4
ArrayClear 8035adb0 80336708 104
#endif

DArray *ArrayNew(u32 p1, s32 p2, s32 p3)
{
    DArray *darray = gsimalloc(sizeof(DArray)); // r31
    if (p2 == 0)
        p2 = 8; // r29
    darray->size = 0;
    darray->capacity = p2;
    darray->elementSz = p1;
    darray->growAmount = p2;
    darray->unk10 = p3;
    if (p2 != 0) {
        darray->buf = gsimalloc(p2 * darray->elementSz);
    } else {
        darray->buf = NULL;
    }
    return darray;
}

void ArrayFree(DArray *p1)
{
    for (s32 i = 0; i < p1->size; i++) {
        func f = p1->unk10;
        if (p1->unk10) {
            if (i < 0 || i >= p1->size) {
                f(NULL);
            } else {
                f(&p1->buf[i * p1->elementSz]);
            }
        }
    }
    gsifree(p1->buf);
    gsifree(p1);
}

s32 ArrayLength(DArray *p1)
{
    return p1->size;
}

void *ArrayNth(DArray *p1, s32 p2)
{
    if (p2 < 0 || p2 >= p1->size)
        return NULL;
    return &p1->buf[i * p1->elementSz];
}

// params in r29, r30
void ArrayAppend(DArray *p1, void *elem)
{
    if (p1) {
        const s32 origSize = p1->size; // r31
        if (origSize == p1->capacity) {
            s32 newCap = p1->capacity + p1->growAmount;
            p1->capacity = newCap;
            p1->buf = gsirealloc(p1->buf, newCap * p1->elementSz);
        }
        s32 newSize = p1->size + 1; // r5
        s32 decNewSize = newSize - 1;
        p1->size = newSize;
        void *r3, *r4;
        // TODO: this whole condition could be an inlined func
        if (origSize < decNewSize) {
            // TODO: inlined function calls to ArrayNth
            s32 incOrigSize = origSize + 1;
            if (incOrigSize < 0 || incOrigSize >= newSize) {
                r3 = 0;
            } else {
                r3 = &p1->buf[p1->elementSz * incOrigSize];
            }
            // fb8
            if (origSize < 0 || origSize >= newSize) {
                r4 = 0;
            } else {
                r4 = &p1->buf[p1->elementSz * origSize];
            }
            memmove(r3, r4, (decNewSize - origSize) * p1->elementSz);
        }
        // 5ff0
        if (origSize < 0 || origSize >= p1->size) {
            r3 = 0;
        } else {
            r3 = &p1->buf[p1->elementSz * origSize];
        }
        memcpy(r3, elem, p1->elementSz);
    }
}

ArrayInsertSorted()
{
    
}

ArrayRemoveAt()
{
    
}

ArrayDeleteAt()
{
    
}

ArrayReplaceAt()
{
    
}

ArraySort()
{
    
}

ArraySearch()
{
    
}

ArrayMapBackwards()
{
    
}

ArrayMapBackwards2()
{
    
}

ArrayClear()
{
    
}