Instead of replicating the RGSS Disposable interface in C++ and merely binding it, redefine the 'disposed' state as the entire core object being deleted (and the binding object's private pointer being null). This makes the behavior more accurate in regard to RMXP. It is now for example possible to subclass disposable classes and access their 'dispose'/'disposed?' methods without initializing the base class first (because the internal pointer is simply null before initialization). Accessing any other base methods will still raise an exception. There are some quirks and irregular behavior in RMXP; eg. most nullable bitmap attributes of disposable classes (Sprite, Plane etc.) can still be queried afterwards, but some cannot (Tilemap#tileset), and disposing certain attributes crashes RMXP entirely (Tilemap#autotiles[n]). mkxp tries to behave as close possible, but will be more lenient some circumstances. To the core, disposed bitmap attributes will look identically to null, which slightly diverges from RMXP (where they're treated as still existing, but aren't drawn). The Disposable interface has been retained containing a single signal, for the binding to inform core when objects are disposed (so active attributes can be set to null).
332 lines
5.5 KiB
C++
332 lines
5.5 KiB
C++
/*
|
|
** binding-util.cpp
|
|
**
|
|
** This file is part of mkxp.
|
|
**
|
|
** Copyright (C) 2013 Jonas Kulla <Nyocurio@gmail.com>
|
|
**
|
|
** mkxp is free software: you can redistribute it and/or modify
|
|
** it under the terms of the GNU General Public License as published by
|
|
** the Free Software Foundation, either version 2 of the License, or
|
|
** (at your option) any later version.
|
|
**
|
|
** mkxp is distributed in the hope that it will be useful,
|
|
** but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
** GNU General Public License for more details.
|
|
**
|
|
** You should have received a copy of the GNU General Public License
|
|
** along with mkxp. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#include "binding-util.h"
|
|
|
|
#include "sharedstate.h"
|
|
#include "exception.h"
|
|
#include "util.h"
|
|
|
|
#include <stdarg.h>
|
|
#include <string.h>
|
|
#include <assert.h>
|
|
|
|
void initType(rb_data_type_struct &type,
|
|
const char *name,
|
|
void (*freeInst)(void *))
|
|
{
|
|
type.wrap_struct_name = name;
|
|
type.function.dmark = 0;
|
|
type.function.dsize = 0;
|
|
type.function.dfree = freeInst;
|
|
type.function.reserved[0] =
|
|
type.function.reserved[1] = 0;
|
|
type.parent = 0;
|
|
}
|
|
|
|
RbData *getRbData()
|
|
{
|
|
return static_cast<RbData*>(shState->bindingData());
|
|
}
|
|
|
|
struct
|
|
{
|
|
RbException id;
|
|
const char *name;
|
|
} static customExc[] =
|
|
{
|
|
{ MKXP, "MKXPError" },
|
|
{ RGSS, "RGSSError" },
|
|
{ PHYSFS, "PHYSFSError" },
|
|
{ SDL, "SDLError" }
|
|
};
|
|
|
|
RbData::RbData()
|
|
{
|
|
for (size_t i = 0; i < ARRAY_SIZE(customExc); ++i)
|
|
exc[customExc[i].id] = rb_define_class(customExc[i].name, rb_eException);
|
|
|
|
exc[ErrnoENOENT] = rb_const_get(rb_const_get(rb_cObject, rb_intern("Errno")), rb_intern("ENOENT"));
|
|
exc[IOError] = rb_eIOError;
|
|
exc[TypeError] = rb_eTypeError;
|
|
exc[ArgumentError] = rb_eArgError;
|
|
}
|
|
|
|
RbData::~RbData()
|
|
{
|
|
|
|
}
|
|
|
|
/* Indexed with Exception::Type */
|
|
static const RbException excToRbExc[] =
|
|
{
|
|
RGSS, /* RGSSError */
|
|
ErrnoENOENT, /* NoFileError */
|
|
IOError,
|
|
|
|
TypeError,
|
|
ArgumentError,
|
|
|
|
PHYSFS, /* PHYSFSError */
|
|
SDL, /* SDLError */
|
|
MKXP /* MKXPError */
|
|
};
|
|
|
|
void raiseRbExc(const Exception &exc)
|
|
{
|
|
RbData *data = getRbData();
|
|
VALUE excClass = data->exc[excToRbExc[exc.type]];
|
|
|
|
rb_raise(excClass, "%s", exc.msg.c_str());
|
|
}
|
|
|
|
void
|
|
raiseDisposedAccess(VALUE self)
|
|
{
|
|
const char *klassName = RTYPEDDATA_TYPE(self)->wrap_struct_name;
|
|
char buf[32];
|
|
|
|
strncpy(buf, klassName, sizeof(buf));
|
|
buf[0] = tolower(buf[0]);
|
|
|
|
rb_raise(getRbData()->exc[RGSS], "disposed %s", buf);
|
|
}
|
|
|
|
int
|
|
rb_get_args(int argc, VALUE *argv, const char *format, ...)
|
|
{
|
|
char c;
|
|
VALUE *arg = argv;
|
|
va_list ap;
|
|
bool opt = false;
|
|
int argI = 0;
|
|
|
|
va_start(ap, format);
|
|
|
|
while ((c = *format++))
|
|
{
|
|
switch (c)
|
|
{
|
|
case '|' :
|
|
break;
|
|
default:
|
|
// FIXME print num of needed args vs provided
|
|
if (argc <= argI && !opt)
|
|
rb_raise(rb_eArgError, "wrong number of arguments");
|
|
|
|
break;
|
|
}
|
|
|
|
if (argI >= argc)
|
|
break;
|
|
|
|
switch (c)
|
|
{
|
|
case 'o' :
|
|
{
|
|
if (argI >= argc)
|
|
break;
|
|
|
|
VALUE *obj = va_arg(ap, VALUE*);
|
|
|
|
*obj = *arg++;
|
|
++argI;
|
|
|
|
break;
|
|
}
|
|
|
|
case 'S' :
|
|
{
|
|
if (argI >= argc)
|
|
break;
|
|
|
|
VALUE *str = va_arg(ap, VALUE*);
|
|
VALUE tmp = *arg;
|
|
|
|
if (!(rb_type(tmp) == RUBY_T_STRING))
|
|
rb_raise(rb_eTypeError, "Argument %d: Expected string", argI);
|
|
|
|
*str = tmp;
|
|
++argI;
|
|
|
|
break;
|
|
}
|
|
|
|
case 's' :
|
|
{
|
|
if (argI >= argc)
|
|
break;
|
|
|
|
const char **s = va_arg(ap, const char**);
|
|
int *len = va_arg(ap, int*);
|
|
|
|
VALUE tmp = *arg;
|
|
|
|
if (!(rb_type(tmp) == RUBY_T_STRING))
|
|
rb_raise(rb_eTypeError, "Argument %d: Expected string", argI);
|
|
|
|
*s = RSTRING_PTR(tmp);
|
|
*len = RSTRING_LEN(tmp);
|
|
++argI;
|
|
|
|
break;
|
|
}
|
|
|
|
case 'z' :
|
|
{
|
|
if (argI >= argc)
|
|
break;
|
|
|
|
const char **s = va_arg(ap, const char**);
|
|
|
|
VALUE tmp = *arg++;
|
|
|
|
if (!(rb_type(tmp) == RUBY_T_STRING))
|
|
rb_raise(rb_eTypeError, "Argument %d: Expected string", argI);
|
|
|
|
*s = RSTRING_PTR(tmp);
|
|
++argI;
|
|
|
|
break;
|
|
}
|
|
|
|
case 'f' :
|
|
{
|
|
if (argI >= argc)
|
|
break;
|
|
|
|
double *f = va_arg(ap, double*);
|
|
VALUE fVal = *arg++;
|
|
|
|
rb_float_arg(fVal, f, argI);
|
|
|
|
++argI;
|
|
break;
|
|
}
|
|
|
|
case 'i' :
|
|
{
|
|
if (argI >= argc)
|
|
break;
|
|
|
|
int *i = va_arg(ap, int*);
|
|
VALUE iVal = *arg++;
|
|
|
|
rb_int_arg(iVal, i, argI);
|
|
|
|
++argI;
|
|
break;
|
|
}
|
|
|
|
case 'b' :
|
|
{
|
|
if (argI >= argc)
|
|
break;
|
|
|
|
bool *b = va_arg(ap, bool*);
|
|
VALUE bVal = *arg++;
|
|
|
|
rb_bool_arg(bVal, b, argI);
|
|
|
|
++argI;
|
|
break;
|
|
}
|
|
|
|
case 'n' :
|
|
{
|
|
if (argI >= argc)
|
|
break;
|
|
|
|
ID *sym = va_arg(ap, ID*);
|
|
|
|
VALUE symVal = *arg++;
|
|
|
|
if (!SYMBOL_P(symVal))
|
|
rb_raise(rb_eTypeError, "Argument %d: Expected symbol", argI);
|
|
|
|
*sym = SYM2ID(symVal);
|
|
++argI;
|
|
|
|
break;
|
|
}
|
|
|
|
case '|' :
|
|
opt = true;
|
|
break;
|
|
|
|
default:
|
|
rb_raise(rb_eFatal, "invalid argument specifier %c", c);
|
|
}
|
|
}
|
|
|
|
#ifndef NDEBUG
|
|
|
|
/* Pop remaining arg pointers off
|
|
* the stack to check for RB_ARG_END */
|
|
format--;
|
|
|
|
while ((c = *format++))
|
|
{
|
|
switch (c)
|
|
{
|
|
case 'o' :
|
|
case 'S' :
|
|
va_arg(ap, VALUE*);
|
|
break;
|
|
|
|
case 's' :
|
|
va_arg(ap, const char**);
|
|
va_arg(ap, int*);
|
|
break;
|
|
|
|
case 'z' :
|
|
va_arg(ap, const char**);
|
|
break;
|
|
|
|
case 'f' :
|
|
va_arg(ap, double*);
|
|
break;
|
|
|
|
case 'i' :
|
|
va_arg(ap, int*);
|
|
break;
|
|
|
|
case 'b' :
|
|
va_arg(ap, bool*);
|
|
break;
|
|
}
|
|
}
|
|
|
|
// FIXME print num of needed args vs provided
|
|
if (!c && argc > argI)
|
|
rb_raise(rb_eArgError, "wrong number of arguments");
|
|
|
|
/* Verify correct termination */
|
|
void *argEnd = va_arg(ap, void*);
|
|
(void) argEnd;
|
|
assert(argEnd == RB_ARG_END_VAL);
|
|
|
|
#endif
|
|
|
|
va_end(ap);
|
|
|
|
return argI;
|
|
}
|