1
1
/* ----------------------------------------------------------------------------
2
2
* This file was automatically generated by SWIG (http://www.swig.org).
5
* This file is not intended to be easily readable and contains a number of
5
* This file is not intended to be easily readable and contains a number of
6
6
* coding conventions designed to improve portability and efficiency. Do not make
7
* changes to this file unless you know what you are doing--modify the SWIG
8
* interface file instead.
7
* changes to this file unless you know what you are doing--modify the SWIG
8
* interface file instead.
9
9
* ----------------------------------------------------------------------------- */
43
43
# if defined(__GNUC__)
44
44
# if !(defined(__cplusplus)) || (__GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4))
45
# define SWIGUNUSED __attribute__ ((__unused__))
45
# define SWIGUNUSED __attribute__ ((__unused__))
47
47
# define SWIGUNUSED
49
49
# elif defined(__ICC)
50
# define SWIGUNUSED __attribute__ ((__unused__))
50
# define SWIGUNUSED __attribute__ ((__unused__))
56
56
#ifndef SWIG_MSC_UNSUPPRESS_4505
57
57
# if defined(_MSC_VER)
58
58
# pragma warning(disable : 4505) /* unreferenced local function has been removed */
62
62
#ifndef SWIGUNUSEDPARM
63
63
# ifdef __cplusplus
64
64
# define SWIGUNUSEDPARM(p)
66
# define SWIGUNUSEDPARM(p) p SWIGUNUSED
66
# define SWIGUNUSEDPARM(p) p SWIGUNUSED
144
144
You can use the SWIGRUNTIME and SWIGRUNTIMEINLINE macros for
145
145
creating a static or dynamic library from the SWIG runtime code.
146
146
In 99.9% of the cases, SWIG just needs to declare them as 'static'.
148
148
But only do this if strictly necessary, ie, if you have problems
149
149
with your compiler or suchlike.
170
170
#define SWIG_POINTER_OWN 0x1
174
174
Flags/methods for returning states.
176
The SWIG conversion methods, as ConvertPtr, return an integer
176
The SWIG conversion methods, as ConvertPtr, return an integer
177
177
that tells if the conversion was successful or not. And if not,
178
178
an error code can be returned (see swigerrors.swg for the codes).
180
180
Use the following macros/flags to set or process the returning
183
183
In old versions of SWIG, code such as the following was usually written:
185
185
if (SWIG_ConvertPtr(obj,vptr,ty.flags) != -1) {
216
216
I.e., now SWIG_ConvertPtr can return new objects and you can
217
217
identify the case and take care of the deallocation. Of course that
218
218
also requires SWIG_ConvertPtr to return new result values, such as
220
int SWIG_ConvertPtr(obj, ptr,...) {
222
if (<need new object>) {
223
*ptr = <ptr to new allocated object>;
226
*ptr = <ptr to old object>;
220
int SWIG_ConvertPtr(obj, ptr,...) {
222
if (<need new object>) {
223
*ptr = <ptr to new allocated object>;
226
*ptr = <ptr to old object>;
234
234
Of course, returning the plain '0(success)/-1(fail)' still works, but you can be
246
246
food(1) // cast rank '1' (1 -> 1.0)
247
247
fooi(1) // cast rank '0'
249
249
just use the SWIG_AddCast()/SWIG_CheckState()
253
253
#define SWIG_ERROR (-1)
254
254
#define SWIG_IsOK(r) (r >= 0)
255
#define SWIG_ArgError(r) ((r != SWIG_ERROR) ? r : SWIG_TypeError)
255
#define SWIG_ArgError(r) ((r != SWIG_ERROR) ? r : SWIG_TypeError)
257
257
/* The CastRankLimit says how many bits are used for the cast rank */
258
258
#define SWIG_CASTRANKLIMIT (1 << 8)
284
284
# define SWIG_CASTRANKMASK ((SWIG_CASTRANKLIMIT) -1)
285
285
# define SWIG_CastRank(r) (r & SWIG_CASTRANKMASK)
286
SWIGINTERNINLINE int SWIG_AddCast(int r) {
286
SWIGINTERNINLINE int SWIG_AddCast(int r) {
287
287
return SWIG_IsOK(r) ? ((SWIG_CastRank(r) < SWIG_MAXCASTRANK) ? (r + 1) : SWIG_ERROR) : r;
289
SWIGINTERNINLINE int SWIG_CheckState(int r) {
290
return SWIG_IsOK(r) ? SWIG_CastRank(r) + 1 : 0;
289
SWIGINTERNINLINE int SWIG_CheckState(int r) {
290
return SWIG_IsOK(r) ? SWIG_CastRank(r) + 1 : 0;
292
292
#else /* no cast-rank mode */
293
# define SWIG_AddCast
293
# define SWIG_AddCast(r) (r)
294
294
# define SWIG_CheckState(r) (SWIG_IsOK(r) ? 1 : 0)
356
356
Check type equivalence in a name list like <name1>|<name2>|...
357
Return 0 if equal, -1 if nb < tb, 1 if nb > tb
360
SWIG_TypeCmp(const char *nb, const char *tb) {
362
const char* te = tb + strlen(tb);
364
while (equiv != 0 && *ne) {
365
for (nb = ne; *ne; ++ne) {
366
if (*ne == '|') break;
368
equiv = SWIG_TypeNameComp(nb, ne, tb, te);
375
Check type equivalence in a name list like <name1>|<name2>|...
357
376
Return 0 if not equal, 1 if equal
360
379
SWIG_TypeEquiv(const char *nb, const char *tb) {
362
const char* te = tb + strlen(tb);
364
while (!equiv && *ne) {
365
for (nb = ne; *ne; ++ne) {
366
if (*ne == '|') break;
368
equiv = (SWIG_TypeNameComp(nb, ne, tb, te) == 0) ? 1 : 0;
375
Check type equivalence in a name list like <name1>|<name2>|...
376
Return 0 if equal, -1 if nb < tb, 1 if nb > tb
379
SWIG_TypeCompare(const char *nb, const char *tb) {
381
const char* te = tb + strlen(tb);
383
while (!equiv && *ne) {
384
for (nb = ne; *ne; ++ne) {
385
if (*ne == '|') break;
387
equiv = (SWIG_TypeNameComp(nb, ne, tb, te) == 0) ? 1 : 0;
380
return SWIG_TypeCmp(nb, tb) == 0 ? 1 : 0;
395
384
Check the typename
505
494
swig_cast_info *cast = ti->cast;
506
495
/* if (ti->clientdata == clientdata) return; */
507
496
ti->clientdata = clientdata;
510
499
if (!cast->converter) {
511
500
swig_type_info *tc = cast->type;
512
501
if (!tc->clientdata) {
513
502
SWIG_TypeClientData(tc, clientdata);
516
505
cast = cast->next;
521
510
SWIG_TypeClientData(ti, clientdata);
526
515
Search for a swig_type_info structure only by mangled name
527
516
Search is a O(log #types)
529
We start searching at module start, and finish searching when start == end.
518
We start searching at module start, and finish searching when start == end.
530
519
Note: if start == end at the beginning of the function, we go all the way around
531
520
the circular list.
533
522
SWIGRUNTIME swig_type_info *
534
SWIG_MangledTypeQueryModule(swig_module_info *start,
535
swig_module_info *end,
523
SWIG_MangledTypeQueryModule(swig_module_info *start,
524
swig_module_info *end,
536
525
const char *name) {
537
526
swig_module_info *iter = start;
541
530
register size_t r = iter->size - 1;
543
532
/* since l+r >= 0, we can (>> 1) instead (/ 2) */
544
register size_t i = (l + r) >> 1;
533
register size_t i = (l + r) >> 1;
545
534
const char *iname = iter->types[i]->name;
547
536
register int compare = strcmp(name, iname);
549
538
return iter->types[i];
550
539
} else if (compare < 0) {
570
559
Search for a swig_type_info structure for either a mangled name or a human readable name.
571
560
It first searches the mangled names of the types, which is a O(log #types)
572
561
If a type is not found it then searches the human readable names, which is O(#types).
574
We start searching at module start, and finish searching when start == end.
563
We start searching at module start, and finish searching when start == end.
575
564
Note: if start == end at the beginning of the function, we go all the way around
576
565
the circular list.
578
567
SWIGRUNTIME swig_type_info *
579
SWIG_TypeQueryModule(swig_module_info *start,
580
swig_module_info *end,
568
SWIG_TypeQueryModule(swig_module_info *start,
569
swig_module_info *end,
581
570
const char *name) {
582
571
/* STEP 1: Search the name field using binary search */
583
572
swig_type_info *ret = SWIG_MangledTypeQueryModule(start, end, name);
631
620
uu = ((d - '0') << 4);
632
621
else if ((d >= 'a') && (d <= 'f'))
633
622
uu = ((d - ('a'-10)) << 4);
635
624
return (char *) 0;
637
626
if ((d >= '0') && (d <= '9'))
639
628
else if ((d >= 'a') && (d <= 'f'))
640
629
uu |= (d - ('a'-10));
642
631
return (char *) 0;
649
638
Pack 'void *' into a string buffer.
651
640
SWIGRUNTIME char *
707
696
/* Errors in SWIG */
708
#define SWIG_UnknownError -1
709
#define SWIG_IOError -2
710
#define SWIG_RuntimeError -3
711
#define SWIG_IndexError -4
712
#define SWIG_TypeError -5
713
#define SWIG_DivisionByZero -6
714
#define SWIG_OverflowError -7
715
#define SWIG_SyntaxError -8
716
#define SWIG_ValueError -9
697
#define SWIG_UnknownError -1
698
#define SWIG_IOError -2
699
#define SWIG_RuntimeError -3
700
#define SWIG_IndexError -4
701
#define SWIG_TypeError -5
702
#define SWIG_DivisionByZero -6
703
#define SWIG_OverflowError -7
704
#define SWIG_SyntaxError -8
705
#define SWIG_ValueError -9
717
706
#define SWIG_SystemError -10
718
707
#define SWIG_AttributeError -11
719
#define SWIG_MemoryError -12
708
#define SWIG_MemoryError -12
720
709
#define SWIG_NullReferenceError -13
1574
1563
#define SWIG_name "SVN::_Diff::boot_SVN___Diff"
1575
1564
#define SWIG_prefix "SVN::_Diff::"
1577
#define SWIGVERSION 0x020009
1566
#define SWIGVERSION 0x020012
1578
1567
#define SWIG_VERSION SWIGVERSION
1936
1925
/* -----------------------------------------------------------------------------
1937
1926
* Type initialization:
1938
* This problem is tough by the requirement that no dynamic
1939
* memory is used. Also, since swig_type_info structures store pointers to
1927
* This problem is tough by the requirement that no dynamic
1928
* memory is used. Also, since swig_type_info structures store pointers to
1940
1929
* swig_cast_info structures and swig_cast_info structures store pointers back
1941
* to swig_type_info structures, we need some lookup code at initialization.
1942
* The idea is that swig generates all the structures that are needed.
1943
* The runtime then collects these partially filled structures.
1944
* The SWIG_InitializeModule function takes these initial arrays out of
1930
* to swig_type_info structures, we need some lookup code at initialization.
1931
* The idea is that swig generates all the structures that are needed.
1932
* The runtime then collects these partially filled structures.
1933
* The SWIG_InitializeModule function takes these initial arrays out of
1945
1934
* swig_module, and does all the lookup, filling in the swig_module.types
1946
1935
* array with the correct data and linking the correct swig_cast_info
1947
1936
* structures together.
1949
* The generated swig_type_info structures are assigned staticly to an initial
1938
* The generated swig_type_info structures are assigned staticly to an initial
1950
1939
* array. We just loop through that array, and handle each type individually.
1951
1940
* First we lookup if this type has been already loaded, and if so, use the
1952
1941
* loaded structure instead of the generated one. Then we have to fill in the
1956
1945
* a column is one of the swig_cast_info structures for that type.
1957
1946
* The cast_initial array is actually an array of arrays, because each row has
1958
1947
* a variable number of columns. So to actually build the cast linked list,
1959
* we find the array of casts associated with the type, and loop through it
1948
* we find the array of casts associated with the type, and loop through it
1960
1949
* adding the casts to the list. The one last trick we need to do is making
1961
1950
* sure the type pointer in the swig_cast_info struct is correct.
1963
* First off, we lookup the cast->type name to see if it is already loaded.
1952
* First off, we lookup the cast->type name to see if it is already loaded.
1964
1953
* There are three cases to handle:
1965
1954
* 1) If the cast->type has already been loaded AND the type we are adding
1966
1955
* casting info to has not been loaded (it is in this module), THEN we
1967
1956
* replace the cast->type pointer with the type pointer that has already
1969
* 2) If BOTH types (the one we are adding casting info to, and the
1958
* 2) If BOTH types (the one we are adding casting info to, and the
1970
1959
* cast->type) are loaded, THEN the cast info has already been loaded by
1971
1960
* the previous module so we just ignore it.
1972
1961
* 3) Finally, if cast->type has not already been loaded, then we add that
2029
2018
module_head->next = &swig_module;
2032
/* When multiple interpeters are used, a module could have already been initialized in
2021
/* When multiple interpreters are used, a module could have already been initialized in
2033
2022
a different interpreter, but not yet have a pointer in this interpreter.
2034
2023
In this case, we do not want to continue adding types... everything should be
2035
2024
set up already */