|
|
|
@ -1,11 +1,11 @@
|
|
|
|
/* ----------------------------------------------------------------------------
|
|
|
|
/* ----------------------------------------------------------------------------
|
|
|
|
* This file was automatically generated by SWIG (http://www.swig.org).
|
|
|
|
* This file was automatically generated by SWIG (http://www.swig.org).
|
|
|
|
* Version 2.0.7
|
|
|
|
* Version 2.0.12
|
|
|
|
*
|
|
|
|
*
|
|
|
|
* This file is not intended to be easily readable and contains a number of
|
|
|
|
* This file is not intended to be easily readable and contains a number of
|
|
|
|
* coding conventions designed to improve portability and efficiency. Do not make
|
|
|
|
* coding conventions designed to improve portability and efficiency. Do not make
|
|
|
|
* changes to this file unless you know what you are doing--modify the SWIG
|
|
|
|
* changes to this file unless you know what you are doing--modify the SWIG
|
|
|
|
* interface file instead.
|
|
|
|
* interface file instead.
|
|
|
|
* ----------------------------------------------------------------------------- */
|
|
|
|
* ----------------------------------------------------------------------------- */
|
|
|
|
|
|
|
|
|
|
|
|
#define SWIGPYTHON
|
|
|
|
#define SWIGPYTHON
|
|
|
|
@ -43,28 +43,28 @@
|
|
|
|
#ifndef SWIGUNUSED
|
|
|
|
#ifndef SWIGUNUSED
|
|
|
|
# if defined(__GNUC__)
|
|
|
|
# if defined(__GNUC__)
|
|
|
|
# if !(defined(__cplusplus)) || (__GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4))
|
|
|
|
# if !(defined(__cplusplus)) || (__GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4))
|
|
|
|
# define SWIGUNUSED __attribute__ ((__unused__))
|
|
|
|
# define SWIGUNUSED __attribute__ ((__unused__))
|
|
|
|
# else
|
|
|
|
# else
|
|
|
|
# define SWIGUNUSED
|
|
|
|
# define SWIGUNUSED
|
|
|
|
# endif
|
|
|
|
# endif
|
|
|
|
# elif defined(__ICC)
|
|
|
|
# elif defined(__ICC)
|
|
|
|
# define SWIGUNUSED __attribute__ ((__unused__))
|
|
|
|
# define SWIGUNUSED __attribute__ ((__unused__))
|
|
|
|
# else
|
|
|
|
# else
|
|
|
|
# define SWIGUNUSED
|
|
|
|
# define SWIGUNUSED
|
|
|
|
# endif
|
|
|
|
# endif
|
|
|
|
#endif
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
#ifndef SWIG_MSC_UNSUPPRESS_4505
|
|
|
|
#ifndef SWIG_MSC_UNSUPPRESS_4505
|
|
|
|
# if defined(_MSC_VER)
|
|
|
|
# if defined(_MSC_VER)
|
|
|
|
# pragma warning(disable : 4505) /* unreferenced local function has been removed */
|
|
|
|
# pragma warning(disable : 4505) /* unreferenced local function has been removed */
|
|
|
|
# endif
|
|
|
|
# endif
|
|
|
|
#endif
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
#ifndef SWIGUNUSEDPARM
|
|
|
|
#ifndef SWIGUNUSEDPARM
|
|
|
|
# ifdef __cplusplus
|
|
|
|
# ifdef __cplusplus
|
|
|
|
# define SWIGUNUSEDPARM(p)
|
|
|
|
# define SWIGUNUSEDPARM(p)
|
|
|
|
# else
|
|
|
|
# else
|
|
|
|
# define SWIGUNUSEDPARM(p) p SWIGUNUSED
|
|
|
|
# define SWIGUNUSEDPARM(p) p SWIGUNUSED
|
|
|
|
# endif
|
|
|
|
# endif
|
|
|
|
#endif
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
@ -107,7 +107,7 @@
|
|
|
|
# define SWIGSTDCALL __stdcall
|
|
|
|
# define SWIGSTDCALL __stdcall
|
|
|
|
# else
|
|
|
|
# else
|
|
|
|
# define SWIGSTDCALL
|
|
|
|
# define SWIGSTDCALL
|
|
|
|
# endif
|
|
|
|
# endif
|
|
|
|
#endif
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
/* Deal with Microsoft's attempt at deprecating C standard runtime functions */
|
|
|
|
/* Deal with Microsoft's attempt at deprecating C standard runtime functions */
|
|
|
|
@ -122,8 +122,14 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Python.h has to appear first */
|
|
|
|
#if defined(_DEBUG) && defined(SWIG_PYTHON_INTERPRETER_NO_DEBUG)
|
|
|
|
#include <Python.h>
|
|
|
|
/* Use debug wrappers with the Python release dll */
|
|
|
|
|
|
|
|
# undef _DEBUG
|
|
|
|
|
|
|
|
# include <Python.h>
|
|
|
|
|
|
|
|
# define _DEBUG
|
|
|
|
|
|
|
|
#else
|
|
|
|
|
|
|
|
# include <Python.h>
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
/* -----------------------------------------------------------------------------
|
|
|
|
/* -----------------------------------------------------------------------------
|
|
|
|
* swigrun.swg
|
|
|
|
* swigrun.swg
|
|
|
|
@ -149,7 +155,7 @@
|
|
|
|
You can use the SWIGRUNTIME and SWIGRUNTIMEINLINE macros for
|
|
|
|
You can use the SWIGRUNTIME and SWIGRUNTIMEINLINE macros for
|
|
|
|
creating a static or dynamic library from the SWIG runtime code.
|
|
|
|
creating a static or dynamic library from the SWIG runtime code.
|
|
|
|
In 99.9% of the cases, SWIG just needs to declare them as 'static'.
|
|
|
|
In 99.9% of the cases, SWIG just needs to declare them as 'static'.
|
|
|
|
|
|
|
|
|
|
|
|
But only do this if strictly necessary, ie, if you have problems
|
|
|
|
But only do this if strictly necessary, ie, if you have problems
|
|
|
|
with your compiler or suchlike.
|
|
|
|
with your compiler or suchlike.
|
|
|
|
*/
|
|
|
|
*/
|
|
|
|
@ -175,16 +181,16 @@
|
|
|
|
#define SWIG_POINTER_OWN 0x1
|
|
|
|
#define SWIG_POINTER_OWN 0x1
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
/*
|
|
|
|
Flags/methods for returning states.
|
|
|
|
Flags/methods for returning states.
|
|
|
|
|
|
|
|
|
|
|
|
The SWIG conversion methods, as ConvertPtr, return an integer
|
|
|
|
The SWIG conversion methods, as ConvertPtr, return an integer
|
|
|
|
that tells if the conversion was successful or not. And if not,
|
|
|
|
that tells if the conversion was successful or not. And if not,
|
|
|
|
an error code can be returned (see swigerrors.swg for the codes).
|
|
|
|
an error code can be returned (see swigerrors.swg for the codes).
|
|
|
|
|
|
|
|
|
|
|
|
Use the following macros/flags to set or process the returning
|
|
|
|
Use the following macros/flags to set or process the returning
|
|
|
|
states.
|
|
|
|
states.
|
|
|
|
|
|
|
|
|
|
|
|
In old versions of SWIG, code such as the following was usually written:
|
|
|
|
In old versions of SWIG, code such as the following was usually written:
|
|
|
|
|
|
|
|
|
|
|
|
if (SWIG_ConvertPtr(obj,vptr,ty.flags) != -1) {
|
|
|
|
if (SWIG_ConvertPtr(obj,vptr,ty.flags) != -1) {
|
|
|
|
@ -217,23 +223,23 @@
|
|
|
|
} else {
|
|
|
|
} else {
|
|
|
|
// fail code
|
|
|
|
// fail code
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
I.e., now SWIG_ConvertPtr can return new objects and you can
|
|
|
|
I.e., now SWIG_ConvertPtr can return new objects and you can
|
|
|
|
identify the case and take care of the deallocation. Of course that
|
|
|
|
identify the case and take care of the deallocation. Of course that
|
|
|
|
also requires SWIG_ConvertPtr to return new result values, such as
|
|
|
|
also requires SWIG_ConvertPtr to return new result values, such as
|
|
|
|
|
|
|
|
|
|
|
|
int SWIG_ConvertPtr(obj, ptr,...) {
|
|
|
|
int SWIG_ConvertPtr(obj, ptr,...) {
|
|
|
|
if (<obj is ok>) {
|
|
|
|
if (<obj is ok>) {
|
|
|
|
if (<need new object>) {
|
|
|
|
if (<need new object>) {
|
|
|
|
*ptr = <ptr to new allocated object>;
|
|
|
|
*ptr = <ptr to new allocated object>;
|
|
|
|
return SWIG_NEWOBJ;
|
|
|
|
return SWIG_NEWOBJ;
|
|
|
|
} else {
|
|
|
|
} else {
|
|
|
|
*ptr = <ptr to old object>;
|
|
|
|
*ptr = <ptr to old object>;
|
|
|
|
return SWIG_OLDOBJ;
|
|
|
|
return SWIG_OLDOBJ;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
} else {
|
|
|
|
return SWIG_BADOBJ;
|
|
|
|
return SWIG_BADOBJ;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
Of course, returning the plain '0(success)/-1(fail)' still works, but you can be
|
|
|
|
Of course, returning the plain '0(success)/-1(fail)' still works, but you can be
|
|
|
|
@ -247,17 +253,17 @@
|
|
|
|
int fooi(int);
|
|
|
|
int fooi(int);
|
|
|
|
|
|
|
|
|
|
|
|
and you call
|
|
|
|
and you call
|
|
|
|
|
|
|
|
|
|
|
|
food(1) // cast rank '1' (1 -> 1.0)
|
|
|
|
food(1) // cast rank '1' (1 -> 1.0)
|
|
|
|
fooi(1) // cast rank '0'
|
|
|
|
fooi(1) // cast rank '0'
|
|
|
|
|
|
|
|
|
|
|
|
just use the SWIG_AddCast()/SWIG_CheckState()
|
|
|
|
just use the SWIG_AddCast()/SWIG_CheckState()
|
|
|
|
*/
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
#define SWIG_OK (0)
|
|
|
|
#define SWIG_OK (0)
|
|
|
|
#define SWIG_ERROR (-1)
|
|
|
|
#define SWIG_ERROR (-1)
|
|
|
|
#define SWIG_IsOK(r) (r >= 0)
|
|
|
|
#define SWIG_IsOK(r) (r >= 0)
|
|
|
|
#define SWIG_ArgError(r) ((r != SWIG_ERROR) ? r : SWIG_TypeError)
|
|
|
|
#define SWIG_ArgError(r) ((r != SWIG_ERROR) ? r : SWIG_TypeError)
|
|
|
|
|
|
|
|
|
|
|
|
/* The CastRankLimit says how many bits are used for the cast rank */
|
|
|
|
/* The CastRankLimit says how many bits are used for the cast rank */
|
|
|
|
#define SWIG_CASTRANKLIMIT (1 << 8)
|
|
|
|
#define SWIG_CASTRANKLIMIT (1 << 8)
|
|
|
|
@ -288,14 +294,14 @@
|
|
|
|
# endif
|
|
|
|
# endif
|
|
|
|
# define SWIG_CASTRANKMASK ((SWIG_CASTRANKLIMIT) -1)
|
|
|
|
# define SWIG_CASTRANKMASK ((SWIG_CASTRANKLIMIT) -1)
|
|
|
|
# define SWIG_CastRank(r) (r & SWIG_CASTRANKMASK)
|
|
|
|
# define SWIG_CastRank(r) (r & SWIG_CASTRANKMASK)
|
|
|
|
SWIGINTERNINLINE int SWIG_AddCast(int r) {
|
|
|
|
SWIGINTERNINLINE int SWIG_AddCast(int r) {
|
|
|
|
return SWIG_IsOK(r) ? ((SWIG_CastRank(r) < SWIG_MAXCASTRANK) ? (r + 1) : SWIG_ERROR) : r;
|
|
|
|
return SWIG_IsOK(r) ? ((SWIG_CastRank(r) < SWIG_MAXCASTRANK) ? (r + 1) : SWIG_ERROR) : r;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
SWIGINTERNINLINE int SWIG_CheckState(int r) {
|
|
|
|
SWIGINTERNINLINE int SWIG_CheckState(int r) {
|
|
|
|
return SWIG_IsOK(r) ? SWIG_CastRank(r) + 1 : 0;
|
|
|
|
return SWIG_IsOK(r) ? SWIG_CastRank(r) + 1 : 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#else /* no cast-rank mode */
|
|
|
|
#else /* no cast-rank mode */
|
|
|
|
# define SWIG_AddCast
|
|
|
|
# define SWIG_AddCast(r) (r)
|
|
|
|
# define SWIG_CheckState(r) (SWIG_IsOK(r) ? 1 : 0)
|
|
|
|
# define SWIG_CheckState(r) (SWIG_IsOK(r) ? 1 : 0)
|
|
|
|
#endif
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
@ -339,7 +345,7 @@ typedef struct swig_module_info {
|
|
|
|
void *clientdata; /* Language specific module data */
|
|
|
|
void *clientdata; /* Language specific module data */
|
|
|
|
} swig_module_info;
|
|
|
|
} swig_module_info;
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
/*
|
|
|
|
Compare two type names skipping the space characters, therefore
|
|
|
|
Compare two type names skipping the space characters, therefore
|
|
|
|
"char*" == "char *" and "Class<int>" == "Class<int >", etc.
|
|
|
|
"char*" == "char *" and "Class<int>" == "Class<int >", etc.
|
|
|
|
|
|
|
|
|
|
|
|
@ -359,18 +365,18 @@ SWIG_TypeNameComp(const char *f1, const char *l1,
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
/*
|
|
|
|
Check type equivalence in a name list like <name1>|<name2>|...
|
|
|
|
Check type equivalence in a name list like <name1>|<name2>|...
|
|
|
|
Return 0 if not equal, 1 if equal
|
|
|
|
Return 0 if equal, -1 if nb < tb, 1 if nb > tb
|
|
|
|
*/
|
|
|
|
*/
|
|
|
|
SWIGRUNTIME int
|
|
|
|
SWIGRUNTIME int
|
|
|
|
SWIG_TypeEquiv(const char *nb, const char *tb) {
|
|
|
|
SWIG_TypeCmp(const char *nb, const char *tb) {
|
|
|
|
int equiv = 0;
|
|
|
|
int equiv = 1;
|
|
|
|
const char* te = tb + strlen(tb);
|
|
|
|
const char* te = tb + strlen(tb);
|
|
|
|
const char* ne = nb;
|
|
|
|
const char* ne = nb;
|
|
|
|
while (!equiv && *ne) {
|
|
|
|
while (equiv != 0 && *ne) {
|
|
|
|
for (nb = ne; *ne; ++ne) {
|
|
|
|
for (nb = ne; *ne; ++ne) {
|
|
|
|
if (*ne == '|') break;
|
|
|
|
if (*ne == '|') break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
equiv = (SWIG_TypeNameComp(nb, ne, tb, te) == 0) ? 1 : 0;
|
|
|
|
equiv = SWIG_TypeNameComp(nb, ne, tb, te);
|
|
|
|
if (*ne) ++ne;
|
|
|
|
if (*ne) ++ne;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return equiv;
|
|
|
|
return equiv;
|
|
|
|
@ -378,24 +384,13 @@ SWIG_TypeEquiv(const char *nb, const char *tb) {
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
/*
|
|
|
|
Check type equivalence in a name list like <name1>|<name2>|...
|
|
|
|
Check type equivalence in a name list like <name1>|<name2>|...
|
|
|
|
Return 0 if equal, -1 if nb < tb, 1 if nb > tb
|
|
|
|
Return 0 if not equal, 1 if equal
|
|
|
|
*/
|
|
|
|
*/
|
|
|
|
SWIGRUNTIME int
|
|
|
|
SWIGRUNTIME int
|
|
|
|
SWIG_TypeCompare(const char *nb, const char *tb) {
|
|
|
|
SWIG_TypeEquiv(const char *nb, const char *tb) {
|
|
|
|
int equiv = 0;
|
|
|
|
return SWIG_TypeCmp(nb, tb) == 0 ? 1 : 0;
|
|
|
|
const char* te = tb + strlen(tb);
|
|
|
|
|
|
|
|
const char* ne = nb;
|
|
|
|
|
|
|
|
while (!equiv && *ne) {
|
|
|
|
|
|
|
|
for (nb = ne; *ne; ++ne) {
|
|
|
|
|
|
|
|
if (*ne == '|') break;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
equiv = (SWIG_TypeNameComp(nb, ne, tb, te) == 0) ? 1 : 0;
|
|
|
|
|
|
|
|
if (*ne) ++ne;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
return equiv;
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
/*
|
|
|
|
Check the typename
|
|
|
|
Check the typename
|
|
|
|
*/
|
|
|
|
*/
|
|
|
|
@ -423,7 +418,7 @@ SWIG_TypeCheck(const char *c, swig_type_info *ty) {
|
|
|
|
return 0;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
/*
|
|
|
|
Identical to SWIG_TypeCheck, except strcmp is replaced with a pointer comparison
|
|
|
|
Identical to SWIG_TypeCheck, except strcmp is replaced with a pointer comparison
|
|
|
|
*/
|
|
|
|
*/
|
|
|
|
SWIGRUNTIME swig_cast_info *
|
|
|
|
SWIGRUNTIME swig_cast_info *
|
|
|
|
@ -458,7 +453,7 @@ SWIG_TypeCast(swig_cast_info *ty, void *ptr, int *newmemory) {
|
|
|
|
return ((!ty) || (!ty->converter)) ? ptr : (*ty->converter)(ptr, newmemory);
|
|
|
|
return ((!ty) || (!ty->converter)) ? ptr : (*ty->converter)(ptr, newmemory);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
/*
|
|
|
|
Dynamic pointer casting. Down an inheritance hierarchy
|
|
|
|
Dynamic pointer casting. Down an inheritance hierarchy
|
|
|
|
*/
|
|
|
|
*/
|
|
|
|
SWIGRUNTIME swig_type_info *
|
|
|
|
SWIGRUNTIME swig_type_info *
|
|
|
|
@ -502,7 +497,7 @@ SWIG_TypePrettyName(const swig_type_info *type) {
|
|
|
|
return type->name;
|
|
|
|
return type->name;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
/*
|
|
|
|
Set the clientdata field for a type
|
|
|
|
Set the clientdata field for a type
|
|
|
|
*/
|
|
|
|
*/
|
|
|
|
SWIGRUNTIME void
|
|
|
|
SWIGRUNTIME void
|
|
|
|
@ -510,14 +505,14 @@ SWIG_TypeClientData(swig_type_info *ti, void *clientdata) {
|
|
|
|
swig_cast_info *cast = ti->cast;
|
|
|
|
swig_cast_info *cast = ti->cast;
|
|
|
|
/* if (ti->clientdata == clientdata) return; */
|
|
|
|
/* if (ti->clientdata == clientdata) return; */
|
|
|
|
ti->clientdata = clientdata;
|
|
|
|
ti->clientdata = clientdata;
|
|
|
|
|
|
|
|
|
|
|
|
while (cast) {
|
|
|
|
while (cast) {
|
|
|
|
if (!cast->converter) {
|
|
|
|
if (!cast->converter) {
|
|
|
|
swig_type_info *tc = cast->type;
|
|
|
|
swig_type_info *tc = cast->type;
|
|
|
|
if (!tc->clientdata) {
|
|
|
|
if (!tc->clientdata) {
|
|
|
|
SWIG_TypeClientData(tc, clientdata);
|
|
|
|
SWIG_TypeClientData(tc, clientdata);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
cast = cast->next;
|
|
|
|
cast = cast->next;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
@ -526,18 +521,18 @@ SWIG_TypeNewClientData(swig_type_info *ti, void *clientdata) {
|
|
|
|
SWIG_TypeClientData(ti, clientdata);
|
|
|
|
SWIG_TypeClientData(ti, clientdata);
|
|
|
|
ti->owndata = 1;
|
|
|
|
ti->owndata = 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
/*
|
|
|
|
Search for a swig_type_info structure only by mangled name
|
|
|
|
Search for a swig_type_info structure only by mangled name
|
|
|
|
Search is a O(log #types)
|
|
|
|
Search is a O(log #types)
|
|
|
|
|
|
|
|
|
|
|
|
We start searching at module start, and finish searching when start == end.
|
|
|
|
We start searching at module start, and finish searching when start == end.
|
|
|
|
Note: if start == end at the beginning of the function, we go all the way around
|
|
|
|
Note: if start == end at the beginning of the function, we go all the way around
|
|
|
|
the circular list.
|
|
|
|
the circular list.
|
|
|
|
*/
|
|
|
|
*/
|
|
|
|
SWIGRUNTIME swig_type_info *
|
|
|
|
SWIGRUNTIME swig_type_info *
|
|
|
|
SWIG_MangledTypeQueryModule(swig_module_info *start,
|
|
|
|
SWIG_MangledTypeQueryModule(swig_module_info *start,
|
|
|
|
swig_module_info *end,
|
|
|
|
swig_module_info *end,
|
|
|
|
const char *name) {
|
|
|
|
const char *name) {
|
|
|
|
swig_module_info *iter = start;
|
|
|
|
swig_module_info *iter = start;
|
|
|
|
do {
|
|
|
|
do {
|
|
|
|
@ -546,11 +541,11 @@ SWIG_MangledTypeQueryModule(swig_module_info *start,
|
|
|
|
register size_t r = iter->size - 1;
|
|
|
|
register size_t r = iter->size - 1;
|
|
|
|
do {
|
|
|
|
do {
|
|
|
|
/* since l+r >= 0, we can (>> 1) instead (/ 2) */
|
|
|
|
/* since l+r >= 0, we can (>> 1) instead (/ 2) */
|
|
|
|
register size_t i = (l + r) >> 1;
|
|
|
|
register size_t i = (l + r) >> 1;
|
|
|
|
const char *iname = iter->types[i]->name;
|
|
|
|
const char *iname = iter->types[i]->name;
|
|
|
|
if (iname) {
|
|
|
|
if (iname) {
|
|
|
|
register int compare = strcmp(name, iname);
|
|
|
|
register int compare = strcmp(name, iname);
|
|
|
|
if (compare == 0) {
|
|
|
|
if (compare == 0) {
|
|
|
|
return iter->types[i];
|
|
|
|
return iter->types[i];
|
|
|
|
} else if (compare < 0) {
|
|
|
|
} else if (compare < 0) {
|
|
|
|
if (i) {
|
|
|
|
if (i) {
|
|
|
|
@ -575,14 +570,14 @@ SWIG_MangledTypeQueryModule(swig_module_info *start,
|
|
|
|
Search for a swig_type_info structure for either a mangled name or a human readable name.
|
|
|
|
Search for a swig_type_info structure for either a mangled name or a human readable name.
|
|
|
|
It first searches the mangled names of the types, which is a O(log #types)
|
|
|
|
It first searches the mangled names of the types, which is a O(log #types)
|
|
|
|
If a type is not found it then searches the human readable names, which is O(#types).
|
|
|
|
If a type is not found it then searches the human readable names, which is O(#types).
|
|
|
|
|
|
|
|
|
|
|
|
We start searching at module start, and finish searching when start == end.
|
|
|
|
We start searching at module start, and finish searching when start == end.
|
|
|
|
Note: if start == end at the beginning of the function, we go all the way around
|
|
|
|
Note: if start == end at the beginning of the function, we go all the way around
|
|
|
|
the circular list.
|
|
|
|
the circular list.
|
|
|
|
*/
|
|
|
|
*/
|
|
|
|
SWIGRUNTIME swig_type_info *
|
|
|
|
SWIGRUNTIME swig_type_info *
|
|
|
|
SWIG_TypeQueryModule(swig_module_info *start,
|
|
|
|
SWIG_TypeQueryModule(swig_module_info *start,
|
|
|
|
swig_module_info *end,
|
|
|
|
swig_module_info *end,
|
|
|
|
const char *name) {
|
|
|
|
const char *name) {
|
|
|
|
/* STEP 1: Search the name field using binary search */
|
|
|
|
/* STEP 1: Search the name field using binary search */
|
|
|
|
swig_type_info *ret = SWIG_MangledTypeQueryModule(start, end, name);
|
|
|
|
swig_type_info *ret = SWIG_MangledTypeQueryModule(start, end, name);
|
|
|
|
@ -601,12 +596,12 @@ SWIG_TypeQueryModule(swig_module_info *start,
|
|
|
|
iter = iter->next;
|
|
|
|
iter = iter->next;
|
|
|
|
} while (iter != end);
|
|
|
|
} while (iter != end);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* neither found a match */
|
|
|
|
/* neither found a match */
|
|
|
|
return 0;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
/*
|
|
|
|
Pack binary data into a string
|
|
|
|
Pack binary data into a string
|
|
|
|
*/
|
|
|
|
*/
|
|
|
|
SWIGRUNTIME char *
|
|
|
|
SWIGRUNTIME char *
|
|
|
|
@ -622,7 +617,7 @@ SWIG_PackData(char *c, void *ptr, size_t sz) {
|
|
|
|
return c;
|
|
|
|
return c;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
/*
|
|
|
|
Unpack binary data from a string
|
|
|
|
Unpack binary data from a string
|
|
|
|
*/
|
|
|
|
*/
|
|
|
|
SWIGRUNTIME const char *
|
|
|
|
SWIGRUNTIME const char *
|
|
|
|
@ -636,21 +631,21 @@ SWIG_UnpackData(const char *c, void *ptr, size_t sz) {
|
|
|
|
uu = ((d - '0') << 4);
|
|
|
|
uu = ((d - '0') << 4);
|
|
|
|
else if ((d >= 'a') && (d <= 'f'))
|
|
|
|
else if ((d >= 'a') && (d <= 'f'))
|
|
|
|
uu = ((d - ('a'-10)) << 4);
|
|
|
|
uu = ((d - ('a'-10)) << 4);
|
|
|
|
else
|
|
|
|
else
|
|
|
|
return (char *) 0;
|
|
|
|
return (char *) 0;
|
|
|
|
d = *(c++);
|
|
|
|
d = *(c++);
|
|
|
|
if ((d >= '0') && (d <= '9'))
|
|
|
|
if ((d >= '0') && (d <= '9'))
|
|
|
|
uu |= (d - '0');
|
|
|
|
uu |= (d - '0');
|
|
|
|
else if ((d >= 'a') && (d <= 'f'))
|
|
|
|
else if ((d >= 'a') && (d <= 'f'))
|
|
|
|
uu |= (d - ('a'-10));
|
|
|
|
uu |= (d - ('a'-10));
|
|
|
|
else
|
|
|
|
else
|
|
|
|
return (char *) 0;
|
|
|
|
return (char *) 0;
|
|
|
|
*u = uu;
|
|
|
|
*u = uu;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return c;
|
|
|
|
return c;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
/*
|
|
|
|
Pack 'void *' into a string buffer.
|
|
|
|
Pack 'void *' into a string buffer.
|
|
|
|
*/
|
|
|
|
*/
|
|
|
|
SWIGRUNTIME char *
|
|
|
|
SWIGRUNTIME char *
|
|
|
|
@ -710,18 +705,18 @@ SWIG_UnpackDataName(const char *c, void *ptr, size_t sz, const char *name) {
|
|
|
|
#endif
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
/* Errors in SWIG */
|
|
|
|
/* Errors in SWIG */
|
|
|
|
#define SWIG_UnknownError -1
|
|
|
|
#define SWIG_UnknownError -1
|
|
|
|
#define SWIG_IOError -2
|
|
|
|
#define SWIG_IOError -2
|
|
|
|
#define SWIG_RuntimeError -3
|
|
|
|
#define SWIG_RuntimeError -3
|
|
|
|
#define SWIG_IndexError -4
|
|
|
|
#define SWIG_IndexError -4
|
|
|
|
#define SWIG_TypeError -5
|
|
|
|
#define SWIG_TypeError -5
|
|
|
|
#define SWIG_DivisionByZero -6
|
|
|
|
#define SWIG_DivisionByZero -6
|
|
|
|
#define SWIG_OverflowError -7
|
|
|
|
#define SWIG_OverflowError -7
|
|
|
|
#define SWIG_SyntaxError -8
|
|
|
|
#define SWIG_SyntaxError -8
|
|
|
|
#define SWIG_ValueError -9
|
|
|
|
#define SWIG_ValueError -9
|
|
|
|
#define SWIG_SystemError -10
|
|
|
|
#define SWIG_SystemError -10
|
|
|
|
#define SWIG_AttributeError -11
|
|
|
|
#define SWIG_AttributeError -11
|
|
|
|
#define SWIG_MemoryError -12
|
|
|
|
#define SWIG_MemoryError -12
|
|
|
|
#define SWIG_NullReferenceError -13
|
|
|
|
#define SWIG_NullReferenceError -13
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
@ -903,6 +898,10 @@ static long PyNumber_AsSsize_t (PyObject *x, void *SWIGUNUSEDPARM(exc))
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#if PY_VERSION_HEX < 0x02050000
|
|
|
|
|
|
|
|
#define PyInt_FromSize_t(x) PyInt_FromLong((long)x)
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
#if PY_VERSION_HEX < 0x02040000
|
|
|
|
#if PY_VERSION_HEX < 0x02040000
|
|
|
|
#define Py_VISIT(op) \
|
|
|
|
#define Py_VISIT(op) \
|
|
|
|
do { \
|
|
|
|
do { \
|
|
|
|
@ -1174,7 +1173,7 @@ SWIGRUNTIME PyObject* SWIG_PyInstanceMethod_New(PyObject *SWIGUNUSEDPARM(self),
|
|
|
|
|
|
|
|
|
|
|
|
/* Runtime API */
|
|
|
|
/* Runtime API */
|
|
|
|
|
|
|
|
|
|
|
|
#define SWIG_GetModule(clientdata) SWIG_Python_GetModule()
|
|
|
|
#define SWIG_GetModule(clientdata) SWIG_Python_GetModule(clientdata)
|
|
|
|
#define SWIG_SetModule(clientdata, pointer) SWIG_Python_SetModule(pointer)
|
|
|
|
#define SWIG_SetModule(clientdata, pointer) SWIG_Python_SetModule(pointer)
|
|
|
|
#define SWIG_NewClientData(obj) SwigPyClientData_New(obj)
|
|
|
|
#define SWIG_NewClientData(obj) SwigPyClientData_New(obj)
|
|
|
|
|
|
|
|
|
|
|
|
@ -1577,34 +1576,6 @@ SwigPyObject_repr(SwigPyObject *v, PyObject *args)
|
|
|
|
return repr;
|
|
|
|
return repr;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
SWIGRUNTIME int
|
|
|
|
|
|
|
|
SwigPyObject_print(SwigPyObject *v, FILE *fp, int SWIGUNUSEDPARM(flags))
|
|
|
|
|
|
|
|
{
|
|
|
|
|
|
|
|
char *str;
|
|
|
|
|
|
|
|
#ifdef METH_NOARGS
|
|
|
|
|
|
|
|
PyObject *repr = SwigPyObject_repr(v);
|
|
|
|
|
|
|
|
#else
|
|
|
|
|
|
|
|
PyObject *repr = SwigPyObject_repr(v, NULL);
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
if (repr) {
|
|
|
|
|
|
|
|
str = SWIG_Python_str_AsChar(repr);
|
|
|
|
|
|
|
|
fputs(str, fp);
|
|
|
|
|
|
|
|
SWIG_Python_str_DelForPy3(str);
|
|
|
|
|
|
|
|
Py_DECREF(repr);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
} else {
|
|
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
SWIGRUNTIME PyObject *
|
|
|
|
|
|
|
|
SwigPyObject_str(SwigPyObject *v)
|
|
|
|
|
|
|
|
{
|
|
|
|
|
|
|
|
char result[SWIG_BUFFER_SIZE];
|
|
|
|
|
|
|
|
return SWIG_PackVoidPtr(result, v->ptr, v->ty->name, sizeof(result)) ?
|
|
|
|
|
|
|
|
SWIG_Python_str_FromChar(result) : 0;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
SWIGRUNTIME int
|
|
|
|
SWIGRUNTIME int
|
|
|
|
SwigPyObject_compare(SwigPyObject *v, SwigPyObject *w)
|
|
|
|
SwigPyObject_compare(SwigPyObject *v, SwigPyObject *w)
|
|
|
|
{
|
|
|
|
{
|
|
|
|
@ -1797,7 +1768,7 @@ SwigPyObject_own(PyObject *v, PyObject *args)
|
|
|
|
static PyMethodDef
|
|
|
|
static PyMethodDef
|
|
|
|
swigobject_methods[] = {
|
|
|
|
swigobject_methods[] = {
|
|
|
|
{(char *)"disown", (PyCFunction)SwigPyObject_disown, METH_NOARGS, (char *)"releases ownership of the pointer"},
|
|
|
|
{(char *)"disown", (PyCFunction)SwigPyObject_disown, METH_NOARGS, (char *)"releases ownership of the pointer"},
|
|
|
|
{(char *)"acquire", (PyCFunction)SwigPyObject_acquire, METH_NOARGS, (char *)"aquires ownership of the pointer"},
|
|
|
|
{(char *)"acquire", (PyCFunction)SwigPyObject_acquire, METH_NOARGS, (char *)"acquires ownership of the pointer"},
|
|
|
|
{(char *)"own", (PyCFunction)SwigPyObject_own, METH_VARARGS, (char *)"returns/sets ownership of the pointer"},
|
|
|
|
{(char *)"own", (PyCFunction)SwigPyObject_own, METH_VARARGS, (char *)"returns/sets ownership of the pointer"},
|
|
|
|
{(char *)"append", (PyCFunction)SwigPyObject_append, METH_O, (char *)"appends another 'this' object"},
|
|
|
|
{(char *)"append", (PyCFunction)SwigPyObject_append, METH_O, (char *)"appends another 'this' object"},
|
|
|
|
{(char *)"next", (PyCFunction)SwigPyObject_next, METH_NOARGS, (char *)"returns the next 'this' object"},
|
|
|
|
{(char *)"next", (PyCFunction)SwigPyObject_next, METH_NOARGS, (char *)"returns the next 'this' object"},
|
|
|
|
@ -1890,7 +1861,7 @@ SwigPyObject_TypeOnce(void) {
|
|
|
|
sizeof(SwigPyObject), /* tp_basicsize */
|
|
|
|
sizeof(SwigPyObject), /* tp_basicsize */
|
|
|
|
0, /* tp_itemsize */
|
|
|
|
0, /* tp_itemsize */
|
|
|
|
(destructor)SwigPyObject_dealloc, /* tp_dealloc */
|
|
|
|
(destructor)SwigPyObject_dealloc, /* tp_dealloc */
|
|
|
|
(printfunc)SwigPyObject_print, /* tp_print */
|
|
|
|
0, /* tp_print */
|
|
|
|
#if PY_VERSION_HEX < 0x02020000
|
|
|
|
#if PY_VERSION_HEX < 0x02020000
|
|
|
|
(getattrfunc)SwigPyObject_getattr, /* tp_getattr */
|
|
|
|
(getattrfunc)SwigPyObject_getattr, /* tp_getattr */
|
|
|
|
#else
|
|
|
|
#else
|
|
|
|
@ -1908,7 +1879,7 @@ SwigPyObject_TypeOnce(void) {
|
|
|
|
0, /* tp_as_mapping */
|
|
|
|
0, /* tp_as_mapping */
|
|
|
|
(hashfunc)0, /* tp_hash */
|
|
|
|
(hashfunc)0, /* tp_hash */
|
|
|
|
(ternaryfunc)0, /* tp_call */
|
|
|
|
(ternaryfunc)0, /* tp_call */
|
|
|
|
(reprfunc)SwigPyObject_str, /* tp_str */
|
|
|
|
0, /* tp_str */
|
|
|
|
PyObject_GenericGetAttr, /* tp_getattro */
|
|
|
|
PyObject_GenericGetAttr, /* tp_getattro */
|
|
|
|
0, /* tp_setattro */
|
|
|
|
0, /* tp_setattro */
|
|
|
|
0, /* tp_as_buffer */
|
|
|
|
0, /* tp_as_buffer */
|
|
|
|
@ -2285,10 +2256,11 @@ SWIGRUNTIME int
|
|
|
|
SWIG_Python_ConvertPtrAndOwn(PyObject *obj, void **ptr, swig_type_info *ty, int flags, int *own) {
|
|
|
|
SWIG_Python_ConvertPtrAndOwn(PyObject *obj, void **ptr, swig_type_info *ty, int flags, int *own) {
|
|
|
|
int res;
|
|
|
|
int res;
|
|
|
|
SwigPyObject *sobj;
|
|
|
|
SwigPyObject *sobj;
|
|
|
|
|
|
|
|
int implicit_conv = (flags & SWIG_POINTER_IMPLICIT_CONV) != 0;
|
|
|
|
|
|
|
|
|
|
|
|
if (!obj)
|
|
|
|
if (!obj)
|
|
|
|
return SWIG_ERROR;
|
|
|
|
return SWIG_ERROR;
|
|
|
|
if (obj == Py_None) {
|
|
|
|
if (obj == Py_None && !implicit_conv) {
|
|
|
|
if (ptr)
|
|
|
|
if (ptr)
|
|
|
|
*ptr = 0;
|
|
|
|
*ptr = 0;
|
|
|
|
return SWIG_OK;
|
|
|
|
return SWIG_OK;
|
|
|
|
@ -2337,7 +2309,7 @@ SWIG_Python_ConvertPtrAndOwn(PyObject *obj, void **ptr, swig_type_info *ty, int
|
|
|
|
}
|
|
|
|
}
|
|
|
|
res = SWIG_OK;
|
|
|
|
res = SWIG_OK;
|
|
|
|
} else {
|
|
|
|
} else {
|
|
|
|
if (flags & SWIG_POINTER_IMPLICIT_CONV) {
|
|
|
|
if (implicit_conv) {
|
|
|
|
SwigPyClientData *data = ty ? (SwigPyClientData *) ty->clientdata : 0;
|
|
|
|
SwigPyClientData *data = ty ? (SwigPyClientData *) ty->clientdata : 0;
|
|
|
|
if (data && !data->implicitconv) {
|
|
|
|
if (data && !data->implicitconv) {
|
|
|
|
PyObject *klass = data->klass;
|
|
|
|
PyObject *klass = data->klass;
|
|
|
|
@ -2372,6 +2344,13 @@ SWIG_Python_ConvertPtrAndOwn(PyObject *obj, void **ptr, swig_type_info *ty, int
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!SWIG_IsOK(res) && obj == Py_None) {
|
|
|
|
|
|
|
|
if (ptr)
|
|
|
|
|
|
|
|
*ptr = 0;
|
|
|
|
|
|
|
|
if (PyErr_Occurred())
|
|
|
|
|
|
|
|
PyErr_Clear();
|
|
|
|
|
|
|
|
res = SWIG_OK;
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return res;
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
@ -2460,23 +2439,29 @@ SWIG_Python_NewShadowInstance(SwigPyClientData *data, PyObject *swig_this)
|
|
|
|
} else {
|
|
|
|
} else {
|
|
|
|
#if PY_VERSION_HEX >= 0x03000000
|
|
|
|
#if PY_VERSION_HEX >= 0x03000000
|
|
|
|
inst = PyBaseObject_Type.tp_new((PyTypeObject*) data->newargs, Py_None, Py_None);
|
|
|
|
inst = PyBaseObject_Type.tp_new((PyTypeObject*) data->newargs, Py_None, Py_None);
|
|
|
|
PyObject_SetAttr(inst, SWIG_This(), swig_this);
|
|
|
|
if (inst) {
|
|
|
|
Py_TYPE(inst)->tp_flags &= ~Py_TPFLAGS_VALID_VERSION_TAG;
|
|
|
|
PyObject_SetAttr(inst, SWIG_This(), swig_this);
|
|
|
|
|
|
|
|
Py_TYPE(inst)->tp_flags &= ~Py_TPFLAGS_VALID_VERSION_TAG;
|
|
|
|
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
#else
|
|
|
|
PyObject *dict = PyDict_New();
|
|
|
|
PyObject *dict = PyDict_New();
|
|
|
|
PyDict_SetItem(dict, SWIG_This(), swig_this);
|
|
|
|
if (dict) {
|
|
|
|
inst = PyInstance_NewRaw(data->newargs, dict);
|
|
|
|
PyDict_SetItem(dict, SWIG_This(), swig_this);
|
|
|
|
Py_DECREF(dict);
|
|
|
|
inst = PyInstance_NewRaw(data->newargs, dict);
|
|
|
|
|
|
|
|
Py_DECREF(dict);
|
|
|
|
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return inst;
|
|
|
|
return inst;
|
|
|
|
#else
|
|
|
|
#else
|
|
|
|
#if (PY_VERSION_HEX >= 0x02010000)
|
|
|
|
#if (PY_VERSION_HEX >= 0x02010000)
|
|
|
|
PyObject *inst;
|
|
|
|
PyObject *inst = 0;
|
|
|
|
PyObject *dict = PyDict_New();
|
|
|
|
PyObject *dict = PyDict_New();
|
|
|
|
PyDict_SetItem(dict, SWIG_This(), swig_this);
|
|
|
|
if (dict) {
|
|
|
|
inst = PyInstance_NewRaw(data->newargs, dict);
|
|
|
|
PyDict_SetItem(dict, SWIG_This(), swig_this);
|
|
|
|
Py_DECREF(dict);
|
|
|
|
inst = PyInstance_NewRaw(data->newargs, dict);
|
|
|
|
|
|
|
|
Py_DECREF(dict);
|
|
|
|
|
|
|
|
}
|
|
|
|
return (PyObject *) inst;
|
|
|
|
return (PyObject *) inst;
|
|
|
|
#else
|
|
|
|
#else
|
|
|
|
PyInstanceObject *inst = PyObject_NEW(PyInstanceObject, &PyInstance_Type);
|
|
|
|
PyInstanceObject *inst = PyObject_NEW(PyInstanceObject, &PyInstance_Type);
|
|
|
|
@ -2583,12 +2568,10 @@ SWIG_Python_NewPointerObj(PyObject *self, void *ptr, swig_type_info *type, int f
|
|
|
|
assert(!(flags & SWIG_BUILTIN_TP_INIT));
|
|
|
|
assert(!(flags & SWIG_BUILTIN_TP_INIT));
|
|
|
|
|
|
|
|
|
|
|
|
robj = SwigPyObject_New(ptr, type, own);
|
|
|
|
robj = SwigPyObject_New(ptr, type, own);
|
|
|
|
if (clientdata && !(flags & SWIG_POINTER_NOSHADOW)) {
|
|
|
|
if (robj && clientdata && !(flags & SWIG_POINTER_NOSHADOW)) {
|
|
|
|
PyObject *inst = SWIG_Python_NewShadowInstance(clientdata, robj);
|
|
|
|
PyObject *inst = SWIG_Python_NewShadowInstance(clientdata, robj);
|
|
|
|
if (inst) {
|
|
|
|
Py_DECREF(robj);
|
|
|
|
Py_DECREF(robj);
|
|
|
|
robj = inst;
|
|
|
|
robj = inst;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return robj;
|
|
|
|
return robj;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
@ -2609,7 +2592,7 @@ void *SWIG_ReturnGlobalTypeList(void *);
|
|
|
|
#endif
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
SWIGRUNTIME swig_module_info *
|
|
|
|
SWIGRUNTIME swig_module_info *
|
|
|
|
SWIG_Python_GetModule(void) {
|
|
|
|
SWIG_Python_GetModule(void *SWIGUNUSEDPARM(clientdata)) {
|
|
|
|
static void *type_pointer = (void *)0;
|
|
|
|
static void *type_pointer = (void *)0;
|
|
|
|
/* first check if module already created */
|
|
|
|
/* first check if module already created */
|
|
|
|
if (!type_pointer) {
|
|
|
|
if (!type_pointer) {
|
|
|
|
@ -2735,7 +2718,7 @@ SWIG_Python_TypeQuery(const char *type)
|
|
|
|
descriptor = (swig_type_info *) PyCObject_AsVoidPtr(obj);
|
|
|
|
descriptor = (swig_type_info *) PyCObject_AsVoidPtr(obj);
|
|
|
|
#endif
|
|
|
|
#endif
|
|
|
|
} else {
|
|
|
|
} else {
|
|
|
|
swig_module_info *swig_module = SWIG_Python_GetModule();
|
|
|
|
swig_module_info *swig_module = SWIG_GetModule(0);
|
|
|
|
descriptor = SWIG_TypeQueryModule(swig_module, swig_module, type);
|
|
|
|
descriptor = SWIG_TypeQueryModule(swig_module, swig_module, type);
|
|
|
|
if (descriptor) {
|
|
|
|
if (descriptor) {
|
|
|
|
#ifdef SWIGPY_USE_CAPSULE
|
|
|
|
#ifdef SWIGPY_USE_CAPSULE
|
|
|
|
@ -2867,7 +2850,7 @@ SWIG_Python_NonDynamicSetAttr(PyObject *obj, PyObject *name, PyObject *value) {
|
|
|
|
PyObject *descr;
|
|
|
|
PyObject *descr;
|
|
|
|
PyObject *encoded_name;
|
|
|
|
PyObject *encoded_name;
|
|
|
|
descrsetfunc f;
|
|
|
|
descrsetfunc f;
|
|
|
|
int res;
|
|
|
|
int res = -1;
|
|
|
|
|
|
|
|
|
|
|
|
# ifdef Py_USING_UNICODE
|
|
|
|
# ifdef Py_USING_UNICODE
|
|
|
|
if (PyString_Check(name)) {
|
|
|
|
if (PyString_Check(name)) {
|
|
|
|
@ -2890,7 +2873,6 @@ SWIG_Python_NonDynamicSetAttr(PyObject *obj, PyObject *name, PyObject *value) {
|
|
|
|
goto done;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
res = -1;
|
|
|
|
|
|
|
|
descr = _PyType_Lookup(tp, name);
|
|
|
|
descr = _PyType_Lookup(tp, name);
|
|
|
|
f = NULL;
|
|
|
|
f = NULL;
|
|
|
|
if (descr != NULL)
|
|
|
|
if (descr != NULL)
|
|
|
|
@ -2959,7 +2941,7 @@ static swig_module_info swig_module = {swig_types, 5, 0, 0, 0, 0};
|
|
|
|
#endif
|
|
|
|
#endif
|
|
|
|
#define SWIG_name "_wiringpi2"
|
|
|
|
#define SWIG_name "_wiringpi2"
|
|
|
|
|
|
|
|
|
|
|
|
#define SWIGVERSION 0x020007
|
|
|
|
#define SWIGVERSION 0x020012
|
|
|
|
#define SWIG_VERSION SWIGVERSION
|
|
|
|
#define SWIG_VERSION SWIGVERSION
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
@ -3431,6 +3413,7 @@ SWIGINTERNINLINE PyObject*
|
|
|
|
SWIGINTERN int
|
|
|
|
SWIGINTERN int
|
|
|
|
SWIG_AsVal_unsigned_SS_long (PyObject *obj, unsigned long *val)
|
|
|
|
SWIG_AsVal_unsigned_SS_long (PyObject *obj, unsigned long *val)
|
|
|
|
{
|
|
|
|
{
|
|
|
|
|
|
|
|
#if PY_VERSION_HEX < 0x03000000
|
|
|
|
if (PyInt_Check(obj)) {
|
|
|
|
if (PyInt_Check(obj)) {
|
|
|
|
long v = PyInt_AsLong(obj);
|
|
|
|
long v = PyInt_AsLong(obj);
|
|
|
|
if (v >= 0) {
|
|
|
|
if (v >= 0) {
|
|
|
|
@ -3439,13 +3422,27 @@ SWIG_AsVal_unsigned_SS_long (PyObject *obj, unsigned long *val)
|
|
|
|
} else {
|
|
|
|
} else {
|
|
|
|
return SWIG_OverflowError;
|
|
|
|
return SWIG_OverflowError;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} else if (PyLong_Check(obj)) {
|
|
|
|
} else
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
if (PyLong_Check(obj)) {
|
|
|
|
unsigned long v = PyLong_AsUnsignedLong(obj);
|
|
|
|
unsigned long v = PyLong_AsUnsignedLong(obj);
|
|
|
|
if (!PyErr_Occurred()) {
|
|
|
|
if (!PyErr_Occurred()) {
|
|
|
|
if (val) *val = v;
|
|
|
|
if (val) *val = v;
|
|
|
|
return SWIG_OK;
|
|
|
|
return SWIG_OK;
|
|
|
|
} else {
|
|
|
|
} else {
|
|
|
|
PyErr_Clear();
|
|
|
|
PyErr_Clear();
|
|
|
|
|
|
|
|
#if PY_VERSION_HEX >= 0x03000000
|
|
|
|
|
|
|
|
{
|
|
|
|
|
|
|
|
long v = PyLong_AsLong(obj);
|
|
|
|
|
|
|
|
if (!PyErr_Occurred()) {
|
|
|
|
|
|
|
|
if (v < 0) {
|
|
|
|
|
|
|
|
return SWIG_OverflowError;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
} else {
|
|
|
|
|
|
|
|
PyErr_Clear();
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#ifdef SWIG_PYTHON_CAST_MODE
|
|
|
|
#ifdef SWIG_PYTHON_CAST_MODE
|
|
|
|
@ -3576,7 +3573,7 @@ SWIGINTERN PyObject *_wrap_wiringPiFailure(PyObject *SWIGUNUSEDPARM(self), PyObj
|
|
|
|
PyObject *newargs;
|
|
|
|
PyObject *newargs;
|
|
|
|
|
|
|
|
|
|
|
|
newargs = PyTuple_GetSlice(args,0,2);
|
|
|
|
newargs = PyTuple_GetSlice(args,0,2);
|
|
|
|
varargs = PyTuple_GetSlice(args,2,PyTuple_Size(args)+1);
|
|
|
|
varargs = PyTuple_GetSlice(args,2,PyTuple_Size(args));
|
|
|
|
resultobj = _wrap_wiringPiFailure__varargs__(NULL,newargs,varargs);
|
|
|
|
resultobj = _wrap_wiringPiFailure__varargs__(NULL,newargs,varargs);
|
|
|
|
Py_XDECREF(newargs);
|
|
|
|
Py_XDECREF(newargs);
|
|
|
|
Py_XDECREF(varargs);
|
|
|
|
Py_XDECREF(varargs);
|
|
|
|
@ -5979,7 +5976,7 @@ SWIGINTERN PyObject *_wrap_lcdPrintf(PyObject *SWIGUNUSEDPARM(self), PyObject *a
|
|
|
|
PyObject *newargs;
|
|
|
|
PyObject *newargs;
|
|
|
|
|
|
|
|
|
|
|
|
newargs = PyTuple_GetSlice(args,0,2);
|
|
|
|
newargs = PyTuple_GetSlice(args,0,2);
|
|
|
|
varargs = PyTuple_GetSlice(args,2,PyTuple_Size(args)+1);
|
|
|
|
varargs = PyTuple_GetSlice(args,2,PyTuple_Size(args));
|
|
|
|
resultobj = _wrap_lcdPrintf__varargs__(NULL,newargs,varargs);
|
|
|
|
resultobj = _wrap_lcdPrintf__varargs__(NULL,newargs,varargs);
|
|
|
|
Py_XDECREF(newargs);
|
|
|
|
Py_XDECREF(newargs);
|
|
|
|
Py_XDECREF(varargs);
|
|
|
|
Py_XDECREF(varargs);
|
|
|
|
@ -7352,6 +7349,9 @@ SWIGINTERN PyObject *_wrap_wiringPiSPIDataRW(PyObject *SWIGUNUSEDPARM(self), PyO
|
|
|
|
SWIG_PYTHON_THREAD_END_ALLOW;
|
|
|
|
SWIG_PYTHON_THREAD_END_ALLOW;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
resultobj = SWIG_From_int((int)(result));
|
|
|
|
resultobj = SWIG_From_int((int)(result));
|
|
|
|
|
|
|
|
{
|
|
|
|
|
|
|
|
resultobj = SWIG_Python_AppendOutput(resultobj, PyString_FromStringAndSize((char *) arg2, result));
|
|
|
|
|
|
|
|
}
|
|
|
|
return resultobj;
|
|
|
|
return resultobj;
|
|
|
|
fail:
|
|
|
|
fail:
|
|
|
|
return NULL;
|
|
|
|
return NULL;
|
|
|
|
@ -7879,7 +7879,7 @@ SWIGINTERN PyObject *_wrap_serialPrintf(PyObject *SWIGUNUSEDPARM(self), PyObject
|
|
|
|
PyObject *newargs;
|
|
|
|
PyObject *newargs;
|
|
|
|
|
|
|
|
|
|
|
|
newargs = PyTuple_GetSlice(args,0,2);
|
|
|
|
newargs = PyTuple_GetSlice(args,0,2);
|
|
|
|
varargs = PyTuple_GetSlice(args,2,PyTuple_Size(args)+1);
|
|
|
|
varargs = PyTuple_GetSlice(args,2,PyTuple_Size(args));
|
|
|
|
resultobj = _wrap_serialPrintf__varargs__(NULL,newargs,varargs);
|
|
|
|
resultobj = _wrap_serialPrintf__varargs__(NULL,newargs,varargs);
|
|
|
|
Py_XDECREF(newargs);
|
|
|
|
Py_XDECREF(newargs);
|
|
|
|
Py_XDECREF(varargs);
|
|
|
|
Py_XDECREF(varargs);
|
|
|
|
@ -8210,18 +8210,18 @@ static swig_const_info swig_const_table[] = {
|
|
|
|
#endif
|
|
|
|
#endif
|
|
|
|
/* -----------------------------------------------------------------------------
|
|
|
|
/* -----------------------------------------------------------------------------
|
|
|
|
* Type initialization:
|
|
|
|
* Type initialization:
|
|
|
|
* This problem is tough by the requirement that no dynamic
|
|
|
|
* This problem is tough by the requirement that no dynamic
|
|
|
|
* memory is used. Also, since swig_type_info structures store pointers to
|
|
|
|
* memory is used. Also, since swig_type_info structures store pointers to
|
|
|
|
* swig_cast_info structures and swig_cast_info structures store pointers back
|
|
|
|
* swig_cast_info structures and swig_cast_info structures store pointers back
|
|
|
|
* to swig_type_info structures, we need some lookup code at initialization.
|
|
|
|
* to swig_type_info structures, we need some lookup code at initialization.
|
|
|
|
* The idea is that swig generates all the structures that are needed.
|
|
|
|
* The idea is that swig generates all the structures that are needed.
|
|
|
|
* The runtime then collects these partially filled structures.
|
|
|
|
* The runtime then collects these partially filled structures.
|
|
|
|
* The SWIG_InitializeModule function takes these initial arrays out of
|
|
|
|
* The SWIG_InitializeModule function takes these initial arrays out of
|
|
|
|
* swig_module, and does all the lookup, filling in the swig_module.types
|
|
|
|
* swig_module, and does all the lookup, filling in the swig_module.types
|
|
|
|
* array with the correct data and linking the correct swig_cast_info
|
|
|
|
* array with the correct data and linking the correct swig_cast_info
|
|
|
|
* structures together.
|
|
|
|
* structures together.
|
|
|
|
*
|
|
|
|
*
|
|
|
|
* The generated swig_type_info structures are assigned staticly to an initial
|
|
|
|
* The generated swig_type_info structures are assigned staticly to an initial
|
|
|
|
* array. We just loop through that array, and handle each type individually.
|
|
|
|
* array. We just loop through that array, and handle each type individually.
|
|
|
|
* First we lookup if this type has been already loaded, and if so, use the
|
|
|
|
* First we lookup if this type has been already loaded, and if so, use the
|
|
|
|
* loaded structure instead of the generated one. Then we have to fill in the
|
|
|
|
* loaded structure instead of the generated one. Then we have to fill in the
|
|
|
|
@ -8231,17 +8231,17 @@ static swig_const_info swig_const_table[] = {
|
|
|
|
* a column is one of the swig_cast_info structures for that type.
|
|
|
|
* a column is one of the swig_cast_info structures for that type.
|
|
|
|
* The cast_initial array is actually an array of arrays, because each row has
|
|
|
|
* The cast_initial array is actually an array of arrays, because each row has
|
|
|
|
* a variable number of columns. So to actually build the cast linked list,
|
|
|
|
* a variable number of columns. So to actually build the cast linked list,
|
|
|
|
* we find the array of casts associated with the type, and loop through it
|
|
|
|
* we find the array of casts associated with the type, and loop through it
|
|
|
|
* adding the casts to the list. The one last trick we need to do is making
|
|
|
|
* adding the casts to the list. The one last trick we need to do is making
|
|
|
|
* sure the type pointer in the swig_cast_info struct is correct.
|
|
|
|
* sure the type pointer in the swig_cast_info struct is correct.
|
|
|
|
*
|
|
|
|
*
|
|
|
|
* First off, we lookup the cast->type name to see if it is already loaded.
|
|
|
|
* First off, we lookup the cast->type name to see if it is already loaded.
|
|
|
|
* There are three cases to handle:
|
|
|
|
* There are three cases to handle:
|
|
|
|
* 1) If the cast->type has already been loaded AND the type we are adding
|
|
|
|
* 1) If the cast->type has already been loaded AND the type we are adding
|
|
|
|
* casting info to has not been loaded (it is in this module), THEN we
|
|
|
|
* casting info to has not been loaded (it is in this module), THEN we
|
|
|
|
* replace the cast->type pointer with the type pointer that has already
|
|
|
|
* replace the cast->type pointer with the type pointer that has already
|
|
|
|
* been loaded.
|
|
|
|
* been loaded.
|
|
|
|
* 2) If BOTH types (the one we are adding casting info to, and the
|
|
|
|
* 2) If BOTH types (the one we are adding casting info to, and the
|
|
|
|
* cast->type) are loaded, THEN the cast info has already been loaded by
|
|
|
|
* cast->type) are loaded, THEN the cast info has already been loaded by
|
|
|
|
* the previous module so we just ignore it.
|
|
|
|
* the previous module so we just ignore it.
|
|
|
|
* 3) Finally, if cast->type has not already been loaded, then we add that
|
|
|
|
* 3) Finally, if cast->type has not already been loaded, then we add that
|
|
|
|
@ -8267,8 +8267,6 @@ SWIG_InitializeModule(void *clientdata) {
|
|
|
|
swig_module_info *module_head, *iter;
|
|
|
|
swig_module_info *module_head, *iter;
|
|
|
|
int found, init;
|
|
|
|
int found, init;
|
|
|
|
|
|
|
|
|
|
|
|
clientdata = clientdata;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* check to see if the circular list has been setup, if not, set it up */
|
|
|
|
/* check to see if the circular list has been setup, if not, set it up */
|
|
|
|
if (swig_module.next==0) {
|
|
|
|
if (swig_module.next==0) {
|
|
|
|
/* Initialize the swig_module */
|
|
|
|
/* Initialize the swig_module */
|
|
|
|
@ -8306,7 +8304,7 @@ SWIG_InitializeModule(void *clientdata) {
|
|
|
|
module_head->next = &swig_module;
|
|
|
|
module_head->next = &swig_module;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* When multiple interpeters are used, a module could have already been initialized in
|
|
|
|
/* When multiple interpreters are used, a module could have already been initialized in
|
|
|
|
a different interpreter, but not yet have a pointer in this interpreter.
|
|
|
|
a different interpreter, but not yet have a pointer in this interpreter.
|
|
|
|
In this case, we do not want to continue adding types... everything should be
|
|
|
|
In this case, we do not want to continue adding types... everything should be
|
|
|
|
set up already */
|
|
|
|
set up already */
|
|
|
|
@ -8841,6 +8839,7 @@ SWIG_init(void) {
|
|
|
|
m = Py_InitModule((char *) SWIG_name, SwigMethods);
|
|
|
|
m = Py_InitModule((char *) SWIG_name, SwigMethods);
|
|
|
|
#endif
|
|
|
|
#endif
|
|
|
|
md = d = PyModule_GetDict(m);
|
|
|
|
md = d = PyModule_GetDict(m);
|
|
|
|
|
|
|
|
(void)md;
|
|
|
|
|
|
|
|
|
|
|
|
SWIG_InitializeModule(0);
|
|
|
|
SWIG_InitializeModule(0);
|
|
|
|
|
|
|
|
|
|
|
|
|