Function DoCheckTable

engine/script/src/script_table.cpp:486–785

    }

    static uint32_t DoCheckTable(lua_State* L, TableHeader& header, const char* original_buffer, char* buffer, uint32_t buffer_size, int index, dmArray<const void*>& table_stack)
    {
        int top = lua_gettop(L);
        (void)top;

        char* buffer_start = buffer;
        char* buffer_end = buffer + buffer_size;
        luaL_checktype(L, index, LUA_TTABLE);

        const void* table_data = (const void*)lua_topointer(L, index);
        if (StackContains(table_stack, table_data))
        {
            table_stack.SetCapacity(0);
            return luaL_error(L, "Save table is recursive!");
        }
        StackPush(table_stack, table_data);

        lua_pushvalue(L, index);
        lua_pushnil(L);

        if (buffer_size < 4)
        {
            table_stack.SetCapacity(0);
            luaL_error(L, "table too large");
        }
        // Make room for count (4 bytes)
        buffer += 4;

        uint32_t count = 0;
        while (lua_next(L, -2) != 0)
        {
            // Check overflow
            if (count == (uint32_t)0xffffffff)
            {
                table_stack.SetCapacity(0);
                luaL_error(L, "too many values in table, %d is max", 0xffffffff);
            }

            count++;

            int key_type = lua_type(L, -2);
            dmhash_t* key_hash = ToHash(L, -2);
            int value_type = lua_type(L, -1);

            if (key_type != LUA_TSTRING && key_type != LUA_TNUMBER && !key_hash)
            {
                table_stack.SetCapacity(0);
                luaL_error(L, "keys in table must be of type number, string or hash (found %s)", lua_typename(L, key_type));
            }

            if (buffer_end - buffer < 2)
            {
                table_stack.SetCapacity(0);
                luaL_error(L, "buffer (%d bytes) too small for table, exceeded at key for element #%d", buffer_size, count);
            }

            if (key_type == LUA_TSTRING)
            {