1 /* ----------------------------------------------------------------------------
2 * This file was automatically generated by SWIG (http://www.swig.org).
3 * Version 4.0.1
4 *
5 * This file is not intended to be easily readable and contains a number of
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.
9 * ----------------------------------------------------------------------------- */
10
11
12 #ifndef SWIGPERL
13 #define SWIGPERL
14 #endif
15
16 #define SWIG_CASTRANK_MODE
17
18 /* -----------------------------------------------------------------------------
19 * This section contains generic SWIG labels for method/variable
20 * declarations/attributes, and other compiler dependent labels.
21 * ----------------------------------------------------------------------------- */
22
23 /* template workaround for compilers that cannot correctly implement the C++ standard */
24 #ifndef SWIGTEMPLATEDISAMBIGUATOR
25 # if defined(__SUNPRO_CC) && (__SUNPRO_CC <= 0x560)
26 # define SWIGTEMPLATEDISAMBIGUATOR template
27 # elif defined(__HP_aCC)
28 /* Needed even with `aCC -AA' when `aCC -V' reports HP ANSI C++ B3910B A.03.55 */
29 /* If we find a maximum version that requires this, the test would be __HP_aCC <= 35500 for A.03.55 */
30 # define SWIGTEMPLATEDISAMBIGUATOR template
31 # else
32 # define SWIGTEMPLATEDISAMBIGUATOR
33 # endif
34 #endif
35
36 /* inline attribute */
37 #ifndef SWIGINLINE
38 # if defined(__cplusplus) || (defined(__GNUC__) && !defined(__STRICT_ANSI__))
39 # define SWIGINLINE inline
40 # else
41 # define SWIGINLINE
42 # endif
43 #endif
44
45 /* attribute recognised by some compilers to avoid 'unused' warnings */
46 #ifndef SWIGUNUSED
47 # if defined(__GNUC__)
48 # if !(defined(__cplusplus)) || (__GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4))
49 # define SWIGUNUSED __attribute__ ((__unused__))
50 # else
51 # define SWIGUNUSED
52 # endif
53 # elif defined(__ICC)
54 # define SWIGUNUSED __attribute__ ((__unused__))
55 # else
56 # define SWIGUNUSED
57 # endif
58 #endif
59
60 #ifndef SWIG_MSC_UNSUPPRESS_4505
61 # if defined(_MSC_VER)
62 # pragma warning(disable : 4505) /* unreferenced local function has been removed */
63 # endif
64 #endif
65
66 #ifndef SWIGUNUSEDPARM
67 # ifdef __cplusplus
68 # define SWIGUNUSEDPARM(p)
69 # else
70 # define SWIGUNUSEDPARM(p) p SWIGUNUSED
71 # endif
72 #endif
73
74 /* internal SWIG method */
75 #ifndef SWIGINTERN
76 # define SWIGINTERN static SWIGUNUSED
77 #endif
78
79 /* internal inline SWIG method */
80 #ifndef SWIGINTERNINLINE
81 # define SWIGINTERNINLINE SWIGINTERN SWIGINLINE
82 #endif
83
84 /* exporting methods */
85 #if defined(__GNUC__)
86 # if (__GNUC__ >= 4) || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4)
87 # ifndef GCC_HASCLASSVISIBILITY
88 # define GCC_HASCLASSVISIBILITY
89 # endif
90 # endif
91 #endif
92
93 #ifndef SWIGEXPORT
94 # if defined(_WIN32) || defined(__WIN32__) || defined(__CYGWIN__)
95 # if defined(STATIC_LINKED)
96 # define SWIGEXPORT
97 # else
98 # define SWIGEXPORT __declspec(dllexport)
99 # endif
100 # else
101 # if defined(__GNUC__) && defined(GCC_HASCLASSVISIBILITY)
102 # define SWIGEXPORT __attribute__ ((visibility("default")))
103 # else
104 # define SWIGEXPORT
105 # endif
106 # endif
107 #endif
108
109 /* calling conventions for Windows */
110 #ifndef SWIGSTDCALL
111 # if defined(_WIN32) || defined(__WIN32__) || defined(__CYGWIN__)
112 # define SWIGSTDCALL __stdcall
113 # else
114 # define SWIGSTDCALL
115 # endif
116 #endif
117
118 /* Deal with Microsoft's attempt at deprecating C standard runtime functions */
119 #if !defined(SWIG_NO_CRT_SECURE_NO_DEPRECATE) && defined(_MSC_VER) && !defined(_CRT_SECURE_NO_DEPRECATE)
120 # define _CRT_SECURE_NO_DEPRECATE
121 #endif
122
123 /* Deal with Microsoft's attempt at deprecating methods in the standard C++ library */
124 #if !defined(SWIG_NO_SCL_SECURE_NO_DEPRECATE) && defined(_MSC_VER) && !defined(_SCL_SECURE_NO_DEPRECATE)
125 # define _SCL_SECURE_NO_DEPRECATE
126 #endif
127
128 /* Deal with Apple's deprecated 'AssertMacros.h' from Carbon-framework */
129 #if defined(__APPLE__) && !defined(__ASSERT_MACROS_DEFINE_VERSIONS_WITHOUT_UNDERSCORES)
130 # define __ASSERT_MACROS_DEFINE_VERSIONS_WITHOUT_UNDERSCORES 0
131 #endif
132
133 /* Intel's compiler complains if a variable which was never initialised is
134 * cast to void, which is a common idiom which we use to indicate that we
135 * are aware a variable isn't used. So we just silence that warning.
136 * See: https://github.com/swig/swig/issues/192 for more discussion.
137 */
138 #ifdef __INTEL_COMPILER
139 # pragma warning disable 592
140 #endif
141
142 /* -----------------------------------------------------------------------------
143 * swigrun.swg
144 *
145 * This file contains generic C API SWIG runtime support for pointer
146 * type checking.
147 * ----------------------------------------------------------------------------- */
148
149 /* This should only be incremented when either the layout of swig_type_info changes,
150 or for whatever reason, the runtime changes incompatibly */
151 #define SWIG_RUNTIME_VERSION "4"
152
153 /* define SWIG_TYPE_TABLE_NAME as "SWIG_TYPE_TABLE" */
154 #ifdef SWIG_TYPE_TABLE
155 # define SWIG_QUOTE_STRING(x) #x
156 # define SWIG_EXPAND_AND_QUOTE_STRING(x) SWIG_QUOTE_STRING(x)
157 # define SWIG_TYPE_TABLE_NAME SWIG_EXPAND_AND_QUOTE_STRING(SWIG_TYPE_TABLE)
158 #else
159 # define SWIG_TYPE_TABLE_NAME
160 #endif
161
162 /*
163 You can use the SWIGRUNTIME and SWIGRUNTIMEINLINE macros for
164 creating a static or dynamic library from the SWIG runtime code.
165 In 99.9% of the cases, SWIG just needs to declare them as 'static'.
166
167 But only do this if strictly necessary, ie, if you have problems
168 with your compiler or suchlike.
169 */
170
171 #ifndef SWIGRUNTIME
172 # define SWIGRUNTIME SWIGINTERN
173 #endif
174
175 #ifndef SWIGRUNTIMEINLINE
176 # define SWIGRUNTIMEINLINE SWIGRUNTIME SWIGINLINE
177 #endif
178
179 /* Generic buffer size */
180 #ifndef SWIG_BUFFER_SIZE
181 # define SWIG_BUFFER_SIZE 1024
182 #endif
183
184 /* Flags for pointer conversions */
185 #define SWIG_POINTER_DISOWN 0x1
186 #define SWIG_CAST_NEW_MEMORY 0x2
187 #define SWIG_POINTER_NO_NULL 0x4
188
189 /* Flags for new pointer objects */
190 #define SWIG_POINTER_OWN 0x1
191
192
193 /*
194 Flags/methods for returning states.
195
196 The SWIG conversion methods, as ConvertPtr, return an integer
197 that tells if the conversion was successful or not. And if not,
198 an error code can be returned (see swigerrors.swg for the codes).
199
200 Use the following macros/flags to set or process the returning
201 states.
202
203 In old versions of SWIG, code such as the following was usually written:
204
205 if (SWIG_ConvertPtr(obj,vptr,ty.flags) != -1) {
206 // success code
207 } else {
208 //fail code
209 }
210
211 Now you can be more explicit:
212
213 int res = SWIG_ConvertPtr(obj,vptr,ty.flags);
214 if (SWIG_IsOK(res)) {
215 // success code
216 } else {
217 // fail code
218 }
219
220 which is the same really, but now you can also do
221
222 Type *ptr;
223 int res = SWIG_ConvertPtr(obj,(void **)(&ptr),ty.flags);
224 if (SWIG_IsOK(res)) {
225 // success code
226 if (SWIG_IsNewObj(res) {
227 ...
228 delete *ptr;
229 } else {
230 ...
231 }
232 } else {
233 // fail code
234 }
235
236 I.e., now SWIG_ConvertPtr can return new objects and you can
237 identify the case and take care of the deallocation. Of course that
238 also requires SWIG_ConvertPtr to return new result values, such as
239
240 int SWIG_ConvertPtr(obj, ptr,...) {
241 if (<obj is ok>) {
242 if (<need new object>) {
243 *ptr = <ptr to new allocated object>;
244 return SWIG_NEWOBJ;
245 } else {
246 *ptr = <ptr to old object>;
247 return SWIG_OLDOBJ;
248 }
249 } else {
250 return SWIG_BADOBJ;
251 }
252 }
253
254 Of course, returning the plain '0(success)/-1(fail)' still works, but you can be
255 more explicit by returning SWIG_BADOBJ, SWIG_ERROR or any of the
256 SWIG errors code.
257
258 Finally, if the SWIG_CASTRANK_MODE is enabled, the result code
259 allows to return the 'cast rank', for example, if you have this
260
261 int food(double)
262 int fooi(int);
263
264 and you call
265
266 food(1) // cast rank '1' (1 -> 1.0)
267 fooi(1) // cast rank '0'
268
269 just use the SWIG_AddCast()/SWIG_CheckState()
270 */
271
272 #define SWIG_OK (0)
273 #define SWIG_ERROR (-1)
274 #define SWIG_IsOK(r) (r >= 0)
275 #define SWIG_ArgError(r) ((r != SWIG_ERROR) ? r : SWIG_TypeError)
276
277 /* The CastRankLimit says how many bits are used for the cast rank */
278 #define SWIG_CASTRANKLIMIT (1 << 8)
279 /* The NewMask denotes the object was created (using new/malloc) */
280 #define SWIG_NEWOBJMASK (SWIG_CASTRANKLIMIT << 1)
281 /* The TmpMask is for in/out typemaps that use temporal objects */
282 #define SWIG_TMPOBJMASK (SWIG_NEWOBJMASK << 1)
283 /* Simple returning values */
284 #define SWIG_BADOBJ (SWIG_ERROR)
285 #define SWIG_OLDOBJ (SWIG_OK)
286 #define SWIG_NEWOBJ (SWIG_OK | SWIG_NEWOBJMASK)
287 #define SWIG_TMPOBJ (SWIG_OK | SWIG_TMPOBJMASK)
288 /* Check, add and del mask methods */
289 #define SWIG_AddNewMask(r) (SWIG_IsOK(r) ? (r | SWIG_NEWOBJMASK) : r)
290 #define SWIG_DelNewMask(r) (SWIG_IsOK(r) ? (r & ~SWIG_NEWOBJMASK) : r)
291 #define SWIG_IsNewObj(r) (SWIG_IsOK(r) && (r & SWIG_NEWOBJMASK))
292 #define SWIG_AddTmpMask(r) (SWIG_IsOK(r) ? (r | SWIG_TMPOBJMASK) : r)
293 #define SWIG_DelTmpMask(r) (SWIG_IsOK(r) ? (r & ~SWIG_TMPOBJMASK) : r)
294 #define SWIG_IsTmpObj(r) (SWIG_IsOK(r) && (r & SWIG_TMPOBJMASK))
295
296 /* Cast-Rank Mode */
297 #if defined(SWIG_CASTRANK_MODE)
298 # ifndef SWIG_TypeRank
299 # define SWIG_TypeRank unsigned long
300 # endif
301 # ifndef SWIG_MAXCASTRANK /* Default cast allowed */
302 # define SWIG_MAXCASTRANK (2)
303 # endif
304 # define SWIG_CASTRANKMASK ((SWIG_CASTRANKLIMIT) -1)
305 # define SWIG_CastRank(r) (r & SWIG_CASTRANKMASK)
SWIG_AddCast(int r)306 SWIGINTERNINLINE int SWIG_AddCast(int r) {
307 return SWIG_IsOK(r) ? ((SWIG_CastRank(r) < SWIG_MAXCASTRANK) ? (r + 1) : SWIG_ERROR) : r;
308 }
SWIG_CheckState(int r)309 SWIGINTERNINLINE int SWIG_CheckState(int r) {
310 return SWIG_IsOK(r) ? SWIG_CastRank(r) + 1 : 0;
311 }
312 #else /* no cast-rank mode */
313 # define SWIG_AddCast(r) (r)
314 # define SWIG_CheckState(r) (SWIG_IsOK(r) ? 1 : 0)
315 #endif
316
317
318 #include <string.h>
319
320 #ifdef __cplusplus
321 extern "C" {
322 #endif
323
324 typedef void *(*swig_converter_func)(void *, int *);
325 typedef struct swig_type_info *(*swig_dycast_func)(void **);
326
327 /* Structure to store information on one type */
328 typedef struct swig_type_info {
329 const char *name; /* mangled name of this type */
330 const char *str; /* human readable name of this type */
331 swig_dycast_func dcast; /* dynamic cast function down a hierarchy */
332 struct swig_cast_info *cast; /* linked list of types that can cast into this type */
333 void *clientdata; /* language specific type data */
334 int owndata; /* flag if the structure owns the clientdata */
335 } swig_type_info;
336
337 /* Structure to store a type and conversion function used for casting */
338 typedef struct swig_cast_info {
339 swig_type_info *type; /* pointer to type that is equivalent to this type */
340 swig_converter_func converter; /* function to cast the void pointers */
341 struct swig_cast_info *next; /* pointer to next cast in linked list */
342 struct swig_cast_info *prev; /* pointer to the previous cast */
343 } swig_cast_info;
344
345 /* Structure used to store module information
346 * Each module generates one structure like this, and the runtime collects
347 * all of these structures and stores them in a circularly linked list.*/
348 typedef struct swig_module_info {
349 swig_type_info **types; /* Array of pointers to swig_type_info structures that are in this module */
350 size_t size; /* Number of types in this module */
351 struct swig_module_info *next; /* Pointer to next element in circularly linked list */
352 swig_type_info **type_initial; /* Array of initially generated type structures */
353 swig_cast_info **cast_initial; /* Array of initially generated casting structures */
354 void *clientdata; /* Language specific module data */
355 } swig_module_info;
356
357 /*
358 Compare two type names skipping the space characters, therefore
359 "char*" == "char *" and "Class<int>" == "Class<int >", etc.
360
361 Return 0 when the two name types are equivalent, as in
362 strncmp, but skipping ' '.
363 */
364 SWIGRUNTIME int
SWIG_TypeNameComp(const char * f1,const char * l1,const char * f2,const char * l2)365 SWIG_TypeNameComp(const char *f1, const char *l1,
366 const char *f2, const char *l2) {
367 for (;(f1 != l1) && (f2 != l2); ++f1, ++f2) {
368 while ((*f1 == ' ') && (f1 != l1)) ++f1;
369 while ((*f2 == ' ') && (f2 != l2)) ++f2;
370 if (*f1 != *f2) return (*f1 > *f2) ? 1 : -1;
371 }
372 return (int)((l1 - f1) - (l2 - f2));
373 }
374
375 /*
376 Check type equivalence in a name list like <name1>|<name2>|...
377 Return 0 if equal, -1 if nb < tb, 1 if nb > tb
378 */
379 SWIGRUNTIME int
SWIG_TypeCmp(const char * nb,const char * tb)380 SWIG_TypeCmp(const char *nb, const char *tb) {
381 int equiv = 1;
382 const char* te = tb + strlen(tb);
383 const char* ne = nb;
384 while (equiv != 0 && *ne) {
385 for (nb = ne; *ne; ++ne) {
386 if (*ne == '|') break;
387 }
388 equiv = SWIG_TypeNameComp(nb, ne, tb, te);
389 if (*ne) ++ne;
390 }
391 return equiv;
392 }
393
394 /*
395 Check type equivalence in a name list like <name1>|<name2>|...
396 Return 0 if not equal, 1 if equal
397 */
398 SWIGRUNTIME int
SWIG_TypeEquiv(const char * nb,const char * tb)399 SWIG_TypeEquiv(const char *nb, const char *tb) {
400 return SWIG_TypeCmp(nb, tb) == 0 ? 1 : 0;
401 }
402
403 /*
404 Check the typename
405 */
406 SWIGRUNTIME swig_cast_info *
SWIG_TypeCheck(const char * c,swig_type_info * ty)407 SWIG_TypeCheck(const char *c, swig_type_info *ty) {
408 if (ty) {
409 swig_cast_info *iter = ty->cast;
410 while (iter) {
411 if (strcmp(iter->type->name, c) == 0) {
412 if (iter == ty->cast)
413 return iter;
414 /* Move iter to the top of the linked list */
415 iter->prev->next = iter->next;
416 if (iter->next)
417 iter->next->prev = iter->prev;
418 iter->next = ty->cast;
419 iter->prev = 0;
420 if (ty->cast) ty->cast->prev = iter;
421 ty->cast = iter;
422 return iter;
423 }
424 iter = iter->next;
425 }
426 }
427 return 0;
428 }
429
430 /*
431 Identical to SWIG_TypeCheck, except strcmp is replaced with a pointer comparison
432 */
433 SWIGRUNTIME swig_cast_info *
SWIG_TypeCheckStruct(swig_type_info * from,swig_type_info * ty)434 SWIG_TypeCheckStruct(swig_type_info *from, swig_type_info *ty) {
435 if (ty) {
436 swig_cast_info *iter = ty->cast;
437 while (iter) {
438 if (iter->type == from) {
439 if (iter == ty->cast)
440 return iter;
441 /* Move iter to the top of the linked list */
442 iter->prev->next = iter->next;
443 if (iter->next)
444 iter->next->prev = iter->prev;
445 iter->next = ty->cast;
446 iter->prev = 0;
447 if (ty->cast) ty->cast->prev = iter;
448 ty->cast = iter;
449 return iter;
450 }
451 iter = iter->next;
452 }
453 }
454 return 0;
455 }
456
457 /*
458 Cast a pointer up an inheritance hierarchy
459 */
460 SWIGRUNTIMEINLINE void *
SWIG_TypeCast(swig_cast_info * ty,void * ptr,int * newmemory)461 SWIG_TypeCast(swig_cast_info *ty, void *ptr, int *newmemory) {
462 return ((!ty) || (!ty->converter)) ? ptr : (*ty->converter)(ptr, newmemory);
463 }
464
465 /*
466 Dynamic pointer casting. Down an inheritance hierarchy
467 */
468 SWIGRUNTIME swig_type_info *
SWIG_TypeDynamicCast(swig_type_info * ty,void ** ptr)469 SWIG_TypeDynamicCast(swig_type_info *ty, void **ptr) {
470 swig_type_info *lastty = ty;
471 if (!ty || !ty->dcast) return ty;
472 while (ty && (ty->dcast)) {
473 ty = (*ty->dcast)(ptr);
474 if (ty) lastty = ty;
475 }
476 return lastty;
477 }
478
479 /*
480 Return the name associated with this type
481 */
482 SWIGRUNTIMEINLINE const char *
SWIG_TypeName(const swig_type_info * ty)483 SWIG_TypeName(const swig_type_info *ty) {
484 return ty->name;
485 }
486
487 /*
488 Return the pretty name associated with this type,
489 that is an unmangled type name in a form presentable to the user.
490 */
491 SWIGRUNTIME const char *
SWIG_TypePrettyName(const swig_type_info * type)492 SWIG_TypePrettyName(const swig_type_info *type) {
493 /* The "str" field contains the equivalent pretty names of the
494 type, separated by vertical-bar characters. We choose
495 to print the last name, as it is often (?) the most
496 specific. */
497 if (!type) return NULL;
498 if (type->str != NULL) {
499 const char *last_name = type->str;
500 const char *s;
501 for (s = type->str; *s; s++)
502 if (*s == '|') last_name = s+1;
503 return last_name;
504 }
505 else
506 return type->name;
507 }
508
509 /*
510 Set the clientdata field for a type
511 */
512 SWIGRUNTIME void
SWIG_TypeClientData(swig_type_info * ti,void * clientdata)513 SWIG_TypeClientData(swig_type_info *ti, void *clientdata) {
514 swig_cast_info *cast = ti->cast;
515 /* if (ti->clientdata == clientdata) return; */
516 ti->clientdata = clientdata;
517
518 while (cast) {
519 if (!cast->converter) {
520 swig_type_info *tc = cast->type;
521 if (!tc->clientdata) {
522 SWIG_TypeClientData(tc, clientdata);
523 }
524 }
525 cast = cast->next;
526 }
527 }
528 SWIGRUNTIME void
SWIG_TypeNewClientData(swig_type_info * ti,void * clientdata)529 SWIG_TypeNewClientData(swig_type_info *ti, void *clientdata) {
530 SWIG_TypeClientData(ti, clientdata);
531 ti->owndata = 1;
532 }
533
534 /*
535 Search for a swig_type_info structure only by mangled name
536 Search is a O(log #types)
537
538 We start searching at module start, and finish searching when start == end.
539 Note: if start == end at the beginning of the function, we go all the way around
540 the circular list.
541 */
542 SWIGRUNTIME swig_type_info *
SWIG_MangledTypeQueryModule(swig_module_info * start,swig_module_info * end,const char * name)543 SWIG_MangledTypeQueryModule(swig_module_info *start,
544 swig_module_info *end,
545 const char *name) {
546 swig_module_info *iter = start;
547 do {
548 if (iter->size) {
549 size_t l = 0;
550 size_t r = iter->size - 1;
551 do {
552 /* since l+r >= 0, we can (>> 1) instead (/ 2) */
553 size_t i = (l + r) >> 1;
554 const char *iname = iter->types[i]->name;
555 if (iname) {
556 int compare = strcmp(name, iname);
557 if (compare == 0) {
558 return iter->types[i];
559 } else if (compare < 0) {
560 if (i) {
561 r = i - 1;
562 } else {
563 break;
564 }
565 } else if (compare > 0) {
566 l = i + 1;
567 }
568 } else {
569 break; /* should never happen */
570 }
571 } while (l <= r);
572 }
573 iter = iter->next;
574 } while (iter != end);
575 return 0;
576 }
577
578 /*
579 Search for a swig_type_info structure for either a mangled name or a human readable name.
580 It first searches the mangled names of the types, which is a O(log #types)
581 If a type is not found it then searches the human readable names, which is O(#types).
582
583 We start searching at module start, and finish searching when start == end.
584 Note: if start == end at the beginning of the function, we go all the way around
585 the circular list.
586 */
587 SWIGRUNTIME swig_type_info *
SWIG_TypeQueryModule(swig_module_info * start,swig_module_info * end,const char * name)588 SWIG_TypeQueryModule(swig_module_info *start,
589 swig_module_info *end,
590 const char *name) {
591 /* STEP 1: Search the name field using binary search */
592 swig_type_info *ret = SWIG_MangledTypeQueryModule(start, end, name);
593 if (ret) {
594 return ret;
595 } else {
596 /* STEP 2: If the type hasn't been found, do a complete search
597 of the str field (the human readable name) */
598 swig_module_info *iter = start;
599 do {
600 size_t i = 0;
601 for (; i < iter->size; ++i) {
602 if (iter->types[i]->str && (SWIG_TypeEquiv(iter->types[i]->str, name)))
603 return iter->types[i];
604 }
605 iter = iter->next;
606 } while (iter != end);
607 }
608
609 /* neither found a match */
610 return 0;
611 }
612
613 /*
614 Pack binary data into a string
615 */
616 SWIGRUNTIME char *
SWIG_PackData(char * c,void * ptr,size_t sz)617 SWIG_PackData(char *c, void *ptr, size_t sz) {
618 static const char hex[17] = "0123456789abcdef";
619 const unsigned char *u = (unsigned char *) ptr;
620 const unsigned char *eu = u + sz;
621 for (; u != eu; ++u) {
622 unsigned char uu = *u;
623 *(c++) = hex[(uu & 0xf0) >> 4];
624 *(c++) = hex[uu & 0xf];
625 }
626 return c;
627 }
628
629 /*
630 Unpack binary data from a string
631 */
632 SWIGRUNTIME const char *
SWIG_UnpackData(const char * c,void * ptr,size_t sz)633 SWIG_UnpackData(const char *c, void *ptr, size_t sz) {
634 unsigned char *u = (unsigned char *) ptr;
635 const unsigned char *eu = u + sz;
636 for (; u != eu; ++u) {
637 char d = *(c++);
638 unsigned char uu;
639 if ((d >= '0') && (d <= '9'))
640 uu = (unsigned char)((d - '0') << 4);
641 else if ((d >= 'a') && (d <= 'f'))
642 uu = (unsigned char)((d - ('a'-10)) << 4);
643 else
644 return (char *) 0;
645 d = *(c++);
646 if ((d >= '0') && (d <= '9'))
647 uu |= (unsigned char)(d - '0');
648 else if ((d >= 'a') && (d <= 'f'))
649 uu |= (unsigned char)(d - ('a'-10));
650 else
651 return (char *) 0;
652 *u = uu;
653 }
654 return c;
655 }
656
657 /*
658 Pack 'void *' into a string buffer.
659 */
660 SWIGRUNTIME char *
SWIG_PackVoidPtr(char * buff,void * ptr,const char * name,size_t bsz)661 SWIG_PackVoidPtr(char *buff, void *ptr, const char *name, size_t bsz) {
662 char *r = buff;
663 if ((2*sizeof(void *) + 2) > bsz) return 0;
664 *(r++) = '_';
665 r = SWIG_PackData(r,&ptr,sizeof(void *));
666 if (strlen(name) + 1 > (bsz - (r - buff))) return 0;
667 strcpy(r,name);
668 return buff;
669 }
670
671 SWIGRUNTIME const char *
SWIG_UnpackVoidPtr(const char * c,void ** ptr,const char * name)672 SWIG_UnpackVoidPtr(const char *c, void **ptr, const char *name) {
673 if (*c != '_') {
674 if (strcmp(c,"NULL") == 0) {
675 *ptr = (void *) 0;
676 return name;
677 } else {
678 return 0;
679 }
680 }
681 return SWIG_UnpackData(++c,ptr,sizeof(void *));
682 }
683
684 SWIGRUNTIME char *
SWIG_PackDataName(char * buff,void * ptr,size_t sz,const char * name,size_t bsz)685 SWIG_PackDataName(char *buff, void *ptr, size_t sz, const char *name, size_t bsz) {
686 char *r = buff;
687 size_t lname = (name ? strlen(name) : 0);
688 if ((2*sz + 2 + lname) > bsz) return 0;
689 *(r++) = '_';
690 r = SWIG_PackData(r,ptr,sz);
691 if (lname) {
692 strncpy(r,name,lname+1);
693 } else {
694 *r = 0;
695 }
696 return buff;
697 }
698
699 SWIGRUNTIME const char *
SWIG_UnpackDataName(const char * c,void * ptr,size_t sz,const char * name)700 SWIG_UnpackDataName(const char *c, void *ptr, size_t sz, const char *name) {
701 if (*c != '_') {
702 if (strcmp(c,"NULL") == 0) {
703 memset(ptr,0,sz);
704 return name;
705 } else {
706 return 0;
707 }
708 }
709 return SWIG_UnpackData(++c,ptr,sz);
710 }
711
712 #ifdef __cplusplus
713 }
714 #endif
715
716 /* Errors in SWIG */
717 #define SWIG_UnknownError -1
718 #define SWIG_IOError -2
719 #define SWIG_RuntimeError -3
720 #define SWIG_IndexError -4
721 #define SWIG_TypeError -5
722 #define SWIG_DivisionByZero -6
723 #define SWIG_OverflowError -7
724 #define SWIG_SyntaxError -8
725 #define SWIG_ValueError -9
726 #define SWIG_SystemError -10
727 #define SWIG_AttributeError -11
728 #define SWIG_MemoryError -12
729 #define SWIG_NullReferenceError -13
730
731
732
733 #ifdef __cplusplus
734 /* Needed on some windows machines---since MS plays funny games with the header files under C++ */
735 #include <math.h>
736 #include <stdlib.h>
737 extern "C" {
738 #endif
739 #include "EXTERN.h"
740 #include "perl.h"
741 #include "XSUB.h"
742
743 /* Add in functionality missing in older versions of Perl. Much of this is based on Devel-PPPort on cpan. */
744
745 /* Add PERL_REVISION, PERL_VERSION, PERL_SUBVERSION if missing */
746 #ifndef PERL_REVISION
747 # if !defined(__PATCHLEVEL_H_INCLUDED__) && !(defined(PATCHLEVEL) && defined(SUBVERSION))
748 # define PERL_PATCHLEVEL_H_IMPLICIT
749 # include <patchlevel.h>
750 # endif
751 # if !(defined(PERL_VERSION) || (defined(SUBVERSION) && defined(PATCHLEVEL)))
752 # include <could_not_find_Perl_patchlevel.h>
753 # endif
754 # ifndef PERL_REVISION
755 # define PERL_REVISION (5)
756 # define PERL_VERSION PATCHLEVEL
757 # define PERL_SUBVERSION SUBVERSION
758 # endif
759 #endif
760
761 #if defined(WIN32) && defined(PERL_OBJECT) && !defined(PerlIO_exportFILE)
762 #define PerlIO_exportFILE(fh,fl) (FILE*)(fh)
763 #endif
764
765 #ifndef SvIOK_UV
766 # define SvIOK_UV(sv) (SvIOK(sv) && (SvUVX(sv) == SvIVX(sv)))
767 #endif
768
769 #ifndef SvUOK
770 # define SvUOK(sv) SvIOK_UV(sv)
771 #endif
772
773 #if ((PERL_VERSION < 4) || ((PERL_VERSION == 4) && (PERL_SUBVERSION <= 5)))
774 # define PL_sv_undef sv_undef
775 # define PL_na na
776 # define PL_errgv errgv
777 # define PL_sv_no sv_no
778 # define PL_sv_yes sv_yes
779 # define PL_markstack_ptr markstack_ptr
780 #endif
781
782 #ifndef IVSIZE
783 # ifdef LONGSIZE
784 # define IVSIZE LONGSIZE
785 # else
786 # define IVSIZE 4 /* A bold guess, but the best we can make. */
787 # endif
788 #endif
789
790 #ifndef INT2PTR
791 # if (IVSIZE == PTRSIZE) && (UVSIZE == PTRSIZE)
792 # define PTRV UV
793 # define INT2PTR(any,d) (any)(d)
794 # else
795 # if PTRSIZE == LONGSIZE
796 # define PTRV unsigned long
797 # else
798 # define PTRV unsigned
799 # endif
800 # define INT2PTR(any,d) (any)(PTRV)(d)
801 # endif
802
803 # define NUM2PTR(any,d) (any)(PTRV)(d)
804 # define PTR2IV(p) INT2PTR(IV,p)
805 # define PTR2UV(p) INT2PTR(UV,p)
806 # define PTR2NV(p) NUM2PTR(NV,p)
807
808 # if PTRSIZE == LONGSIZE
809 # define PTR2ul(p) (unsigned long)(p)
810 # else
811 # define PTR2ul(p) INT2PTR(unsigned long,p)
812 # endif
813 #endif /* !INT2PTR */
814
815 #ifndef SvPV_nolen
816 # define SvPV_nolen(x) SvPV(x,PL_na)
817 #endif
818
819 #ifndef get_sv
820 # define get_sv perl_get_sv
821 #endif
822
823 #ifndef ERRSV
824 # define ERRSV get_sv("@",FALSE)
825 #endif
826
827 #ifndef pTHX_
828 #define pTHX_
829 #endif
830
831 #include <string.h>
832 #ifdef __cplusplus
833 }
834 #endif
835
836 /* -----------------------------------------------------------------------------
837 * error manipulation
838 * ----------------------------------------------------------------------------- */
839
840 SWIGINTERN const char*
SWIG_Perl_ErrorType(int code)841 SWIG_Perl_ErrorType(int code) {
842 switch(code) {
843 case SWIG_MemoryError:
844 return "MemoryError";
845 case SWIG_IOError:
846 return "IOError";
847 case SWIG_RuntimeError:
848 return "RuntimeError";
849 case SWIG_IndexError:
850 return "IndexError";
851 case SWIG_TypeError:
852 return "TypeError";
853 case SWIG_DivisionByZero:
854 return "ZeroDivisionError";
855 case SWIG_OverflowError:
856 return "OverflowError";
857 case SWIG_SyntaxError:
858 return "SyntaxError";
859 case SWIG_ValueError:
860 return "ValueError";
861 case SWIG_SystemError:
862 return "SystemError";
863 case SWIG_AttributeError:
864 return "AttributeError";
865 default:
866 return "RuntimeError";
867 }
868 }
869
870
871 /* -----------------------------------------------------------------------------
872 * perlrun.swg
873 *
874 * This file contains the runtime support for Perl modules
875 * and includes code for managing global variables and pointer
876 * type checking.
877 * ----------------------------------------------------------------------------- */
878
879 #ifdef PERL_OBJECT
880 #define SWIG_PERL_OBJECT_DECL CPerlObj *SWIGUNUSEDPARM(pPerl),
881 #define SWIG_PERL_OBJECT_CALL pPerl,
882 #else
883 #define SWIG_PERL_OBJECT_DECL
884 #define SWIG_PERL_OBJECT_CALL
885 #endif
886
887 /* Common SWIG API */
888
889 /* for raw pointers */
890 #define SWIG_ConvertPtr(obj, pp, type, flags) SWIG_Perl_ConvertPtr(SWIG_PERL_OBJECT_CALL obj, pp, type, flags)
891 #define SWIG_ConvertPtrAndOwn(obj, pp, type, flags,own) SWIG_Perl_ConvertPtrAndOwn(SWIG_PERL_OBJECT_CALL obj, pp, type, flags, own)
892 #define SWIG_NewPointerObj(p, type, flags) SWIG_Perl_NewPointerObj(SWIG_PERL_OBJECT_CALL p, type, flags)
893 #define SWIG_AcquirePtr(ptr, src) SWIG_Perl_AcquirePtr(ptr, src)
894 #define swig_owntype int
895
896 /* for raw packed data */
897 #define SWIG_ConvertPacked(obj, p, s, type) SWIG_Perl_ConvertPacked(SWIG_PERL_OBJECT_CALL obj, p, s, type)
898 #define SWIG_NewPackedObj(p, s, type) SWIG_Perl_NewPackedObj(SWIG_PERL_OBJECT_CALL p, s, type)
899
900 /* for class or struct pointers */
901 #define SWIG_ConvertInstance(obj, pptr, type, flags) SWIG_ConvertPtr(obj, pptr, type, flags)
902 #define SWIG_NewInstanceObj(ptr, type, flags) SWIG_NewPointerObj(ptr, type, flags)
903
904 /* for C or C++ function pointers */
905 #define SWIG_ConvertFunctionPtr(obj, pptr, type) SWIG_ConvertPtr(obj, pptr, type, 0)
906 #define SWIG_NewFunctionPtrObj(ptr, type) SWIG_NewPointerObj(ptr, type, 0)
907
908 /* for C++ member pointers, ie, member methods */
909 #define SWIG_ConvertMember(obj, ptr, sz, ty) SWIG_ConvertPacked(obj, ptr, sz, ty)
910 #define SWIG_NewMemberObj(ptr, sz, type) SWIG_NewPackedObj(ptr, sz, type)
911
912
913 /* Runtime API */
914
915 #define SWIG_GetModule(clientdata) SWIG_Perl_GetModule(clientdata)
916 #define SWIG_SetModule(clientdata, pointer) SWIG_Perl_SetModule(pointer)
917
918
919 /* Error manipulation */
920
921 #define SWIG_ErrorType(code) SWIG_Perl_ErrorType(code)
922 #define SWIG_Error(code, msg) sv_setpvf(get_sv("@", GV_ADD), "%s %s", SWIG_ErrorType(code), msg)
923 #define SWIG_fail goto fail
924
925 /* Perl-specific SWIG API */
926
927 #define SWIG_MakePtr(sv, ptr, type, flags) SWIG_Perl_MakePtr(SWIG_PERL_OBJECT_CALL sv, ptr, type, flags)
928 #define SWIG_MakePackedObj(sv, p, s, type) SWIG_Perl_MakePackedObj(SWIG_PERL_OBJECT_CALL sv, p, s, type)
929 #define SWIG_SetError(str) SWIG_Error(SWIG_RuntimeError, str)
930
931
932 #define SWIG_PERL_DECL_ARGS_1(arg1) (SWIG_PERL_OBJECT_DECL arg1)
933 #define SWIG_PERL_CALL_ARGS_1(arg1) (SWIG_PERL_OBJECT_CALL arg1)
934 #define SWIG_PERL_DECL_ARGS_2(arg1, arg2) (SWIG_PERL_OBJECT_DECL arg1, arg2)
935 #define SWIG_PERL_CALL_ARGS_2(arg1, arg2) (SWIG_PERL_OBJECT_CALL arg1, arg2)
936
937 /* -----------------------------------------------------------------------------
938 * pointers/data manipulation
939 * ----------------------------------------------------------------------------- */
940
941 /* For backward compatibility only */
942 #define SWIG_POINTER_EXCEPTION 0
943
944 #ifdef __cplusplus
945 extern "C" {
946 #endif
947
948 #define SWIG_OWNER SWIG_POINTER_OWN
949 #define SWIG_SHADOW SWIG_OWNER << 1
950
951 #define SWIG_MAYBE_PERL_OBJECT SWIG_PERL_OBJECT_DECL
952
953 /* SWIG Perl macros */
954
955 /* Macro to declare an XS function */
956 #ifndef XSPROTO
957 # define XSPROTO(name) void name(pTHX_ CV* cv)
958 #endif
959
960 /* Macro to call an XS function */
961 #ifdef PERL_OBJECT
962 # define SWIG_CALLXS(_name) _name(cv,pPerl)
963 #else
964 # ifndef MULTIPLICITY
965 # define SWIG_CALLXS(_name) _name(cv)
966 # else
967 # define SWIG_CALLXS(_name) _name(PERL_GET_THX, cv)
968 # endif
969 #endif
970
971 #ifdef PERL_OBJECT
972 #define MAGIC_PPERL CPerlObj *pPerl = (CPerlObj *) this;
973
974 #ifdef __cplusplus
975 extern "C" {
976 #endif
977 typedef int (CPerlObj::*SwigMagicFunc)(SV *, MAGIC *);
978 #ifdef __cplusplus
979 }
980 #endif
981
982 #define SWIG_MAGIC(a,b) (SV *a, MAGIC *b)
983 #define SWIGCLASS_STATIC
984
985 #else /* PERL_OBJECT */
986
987 #define MAGIC_PPERL
988 #define SWIGCLASS_STATIC static SWIGUNUSED
989
990 #ifndef MULTIPLICITY
991 #define SWIG_MAGIC(a,b) (SV *a, MAGIC *b)
992
993 #ifdef __cplusplus
994 extern "C" {
995 #endif
996 typedef int (*SwigMagicFunc)(SV *, MAGIC *);
997 #ifdef __cplusplus
998 }
999 #endif
1000
1001 #else /* MULTIPLICITY */
1002
1003 #define SWIG_MAGIC(a,b) (struct interpreter *interp, SV *a, MAGIC *b)
1004
1005 #ifdef __cplusplus
1006 extern "C" {
1007 #endif
1008 typedef int (*SwigMagicFunc)(struct interpreter *, SV *, MAGIC *);
1009 #ifdef __cplusplus
1010 }
1011 #endif
1012
1013 #endif /* MULTIPLICITY */
1014 #endif /* PERL_OBJECT */
1015
1016 # ifdef PERL_OBJECT
1017 # define SWIG_croak_null() SWIG_Perl_croak_null(pPerl)
SWIG_Perl_croak_null(CPerlObj * pPerl)1018 static void SWIGUNUSED SWIG_Perl_croak_null(CPerlObj *pPerl)
1019 # else
1020 static void SWIGUNUSED SWIG_croak_null()
1021 # endif
1022 {
1023 SV *err = get_sv("@", GV_ADD);
1024 # if (PERL_VERSION < 6)
1025 croak("%_", err);
1026 # else
1027 if (sv_isobject(err))
1028 croak(0);
1029 else
1030 croak("%s", SvPV_nolen(err));
1031 # endif
1032 }
1033
1034
1035 /*
1036 Define how strict is the cast between strings and integers/doubles
1037 when overloading between these types occurs.
1038
1039 The default is making it as strict as possible by using SWIG_AddCast
1040 when needed.
1041
1042 You can use -DSWIG_PERL_NO_STRICT_STR2NUM at compilation time to
1043 disable the SWIG_AddCast, making the casting between string and
1044 numbers less strict.
1045
1046 In the end, we try to solve the overloading between strings and
1047 numerical types in the more natural way, but if you can avoid it,
1048 well, avoid it using %rename, for example.
1049 */
1050 #ifndef SWIG_PERL_NO_STRICT_STR2NUM
1051 # ifndef SWIG_PERL_STRICT_STR2NUM
1052 # define SWIG_PERL_STRICT_STR2NUM
1053 # endif
1054 #endif
1055 #ifdef SWIG_PERL_STRICT_STR2NUM
1056 /* string takes precedence */
1057 #define SWIG_Str2NumCast(x) SWIG_AddCast(x)
1058 #else
1059 /* number takes precedence */
1060 #define SWIG_Str2NumCast(x) x
1061 #endif
1062
1063
1064
1065 #include <stdlib.h>
1066
1067 SWIGRUNTIME const char *
SWIG_Perl_TypeProxyName(const swig_type_info * type)1068 SWIG_Perl_TypeProxyName(const swig_type_info *type) {
1069 if (!type) return NULL;
1070 if (type->clientdata != NULL) {
1071 return (const char*) type->clientdata;
1072 }
1073 else {
1074 return type->name;
1075 }
1076 }
1077
1078 /* Identical to SWIG_TypeCheck, except for strcmp comparison */
1079 SWIGRUNTIME swig_cast_info *
SWIG_TypeProxyCheck(const char * c,swig_type_info * ty)1080 SWIG_TypeProxyCheck(const char *c, swig_type_info *ty) {
1081 if (ty) {
1082 swig_cast_info *iter = ty->cast;
1083 while (iter) {
1084 if (strcmp(SWIG_Perl_TypeProxyName(iter->type), c) == 0) {
1085 if (iter == ty->cast)
1086 return iter;
1087 /* Move iter to the top of the linked list */
1088 iter->prev->next = iter->next;
1089 if (iter->next)
1090 iter->next->prev = iter->prev;
1091 iter->next = ty->cast;
1092 iter->prev = 0;
1093 if (ty->cast) ty->cast->prev = iter;
1094 ty->cast = iter;
1095 return iter;
1096 }
1097 iter = iter->next;
1098 }
1099 }
1100 return 0;
1101 }
1102
1103 /* Acquire a pointer value */
1104
1105 SWIGRUNTIME int
SWIG_Perl_AcquirePtr(SWIG_MAYBE_PERL_OBJECT SV * sv,int own)1106 SWIG_Perl_AcquirePtr(SWIG_MAYBE_PERL_OBJECT SV *sv, int own) {
1107 /* TODO */
1108 return 0;
1109 }
1110
1111 /* Function for getting a pointer value */
1112
1113 SWIGRUNTIME int
SWIG_Perl_ConvertPtrAndOwn(SWIG_MAYBE_PERL_OBJECT SV * sv,void ** ptr,swig_type_info * _t,int flags,int * own)1114 SWIG_Perl_ConvertPtrAndOwn(SWIG_MAYBE_PERL_OBJECT SV *sv, void **ptr, swig_type_info *_t, int flags, int *own) {
1115 swig_cast_info *tc;
1116 void *voidptr = (void *)0;
1117 SV *tsv = 0;
1118
1119 if (own)
1120 *own = 0;
1121
1122 /* If magical, apply more magic */
1123 if (SvGMAGICAL(sv))
1124 mg_get(sv);
1125
1126 /* Check to see if this is an object */
1127 if (sv_isobject(sv)) {
1128 IV tmp = 0;
1129 tsv = (SV*) SvRV(sv);
1130 if ((SvTYPE(tsv) == SVt_PVHV)) {
1131 MAGIC *mg;
1132 if (SvMAGICAL(tsv)) {
1133 mg = mg_find(tsv,'P');
1134 if (mg) {
1135 sv = mg->mg_obj;
1136 if (sv_isobject(sv)) {
1137 tsv = (SV*)SvRV(sv);
1138 tmp = SvIV(tsv);
1139 }
1140 }
1141 } else {
1142 return SWIG_ERROR;
1143 }
1144 } else {
1145 tmp = SvIV(tsv);
1146 }
1147 voidptr = INT2PTR(void *,tmp);
1148 } else if (! SvOK(sv)) { /* Check for undef */
1149 *(ptr) = (void *) 0;
1150 return (flags & SWIG_POINTER_NO_NULL) ? SWIG_NullReferenceError : SWIG_OK;
1151 } else if (SvTYPE(sv) == SVt_RV) { /* Check for NULL pointer */
1152 if (!SvROK(sv)) {
1153 /* In Perl 5.12 and later, SVt_RV == SVt_IV, so sv could be a valid integer value. */
1154 if (SvIOK(sv)) {
1155 return SWIG_ERROR;
1156 } else {
1157 /* NULL pointer (reference to undef). */
1158 *(ptr) = (void *) 0;
1159 return SWIG_OK;
1160 }
1161 } else {
1162 return SWIG_ERROR;
1163 }
1164 } else { /* Don't know what it is */
1165 return SWIG_ERROR;
1166 }
1167 if (_t) {
1168 /* Now see if the types match */
1169 char *_c = HvNAME(SvSTASH(SvRV(sv)));
1170 tc = SWIG_TypeProxyCheck(_c,_t);
1171 #ifdef SWIG_DIRECTORS
1172 if (!tc && !sv_derived_from(sv,SWIG_Perl_TypeProxyName(_t))) {
1173 #else
1174 if (!tc) {
1175 #endif
1176 return SWIG_ERROR;
1177 }
1178 {
1179 int newmemory = 0;
1180 *ptr = SWIG_TypeCast(tc,voidptr,&newmemory);
1181 if (newmemory == SWIG_CAST_NEW_MEMORY) {
1182 assert(own); /* badly formed typemap which will lead to a memory leak - it must set and use own to delete *ptr */
1183 if (own)
1184 *own = *own | SWIG_CAST_NEW_MEMORY;
1185 }
1186 }
1187 } else {
1188 *ptr = voidptr;
1189 }
1190
1191 /*
1192 * DISOWN implementation: we need a perl guru to check this one.
1193 */
1194 if (tsv && (flags & SWIG_POINTER_DISOWN)) {
1195 /*
1196 * almost copy paste code from below SWIG_POINTER_OWN setting
1197 */
1198 SV *obj = sv;
1199 HV *stash = SvSTASH(SvRV(obj));
1200 GV *gv = *(GV**)hv_fetch(stash, "OWNER", 5, TRUE);
1201 if (isGV(gv)) {
1202 HV *hv = GvHVn(gv);
1203 /*
1204 * To set ownership (see below), a newSViv(1) entry is added.
1205 * Hence, to remove ownership, we delete the entry.
1206 */
1207 if (hv_exists_ent(hv, obj, 0)) {
1208 hv_delete_ent(hv, obj, 0, 0);
1209 }
1210 }
1211 }
1212 return SWIG_OK;
1213 }
1214
1215 SWIGRUNTIME int
1216 SWIG_Perl_ConvertPtr(SWIG_MAYBE_PERL_OBJECT SV *sv, void **ptr, swig_type_info *_t, int flags) {
1217 return SWIG_Perl_ConvertPtrAndOwn(sv, ptr, _t, flags, 0);
1218 }
1219
1220 SWIGRUNTIME void
1221 SWIG_Perl_MakePtr(SWIG_MAYBE_PERL_OBJECT SV *sv, void *ptr, swig_type_info *t, int flags) {
1222 if (ptr && (flags & (SWIG_SHADOW | SWIG_POINTER_OWN))) {
1223 SV *self;
1224 SV *obj=newSV(0);
1225 HV *hash=newHV();
1226 HV *stash;
1227 sv_setref_pv(obj, SWIG_Perl_TypeProxyName(t), ptr);
1228 stash=SvSTASH(SvRV(obj));
1229 if (flags & SWIG_POINTER_OWN) {
1230 HV *hv;
1231 GV *gv = *(GV**)hv_fetch(stash, "OWNER", 5, TRUE);
1232 if (!isGV(gv))
1233 gv_init(gv, stash, "OWNER", 5, FALSE);
1234 hv=GvHVn(gv);
1235 hv_store_ent(hv, obj, newSViv(1), 0);
1236 }
1237 sv_magic((SV *)hash, (SV *)obj, 'P', Nullch, 0);
1238 SvREFCNT_dec(obj);
1239 self=newRV_noinc((SV *)hash);
1240 sv_setsv(sv, self);
1241 SvREFCNT_dec((SV *)self);
1242 sv_bless(sv, stash);
1243 }
1244 else {
1245 sv_setref_pv(sv, SWIG_Perl_TypeProxyName(t), ptr);
1246 }
1247 }
1248
1249 SWIGRUNTIMEINLINE SV *
1250 SWIG_Perl_NewPointerObj(SWIG_MAYBE_PERL_OBJECT void *ptr, swig_type_info *t, int flags) {
1251 SV *result = sv_newmortal();
1252 SWIG_MakePtr(result, ptr, t, flags);
1253 return result;
1254 }
1255
1256 SWIGRUNTIME void
1257 SWIG_Perl_MakePackedObj(SWIG_MAYBE_PERL_OBJECT SV *sv, void *ptr, int sz, swig_type_info *type) {
1258 char result[1024];
1259 char *r = result;
1260 if ((2*sz + 1 + strlen(SWIG_Perl_TypeProxyName(type))) > 1000) return;
1261 *(r++) = '_';
1262 r = SWIG_PackData(r,ptr,sz);
1263 strcpy(r,SWIG_Perl_TypeProxyName(type));
1264 sv_setpv(sv, result);
1265 }
1266
1267 SWIGRUNTIME SV *
1268 SWIG_Perl_NewPackedObj(SWIG_MAYBE_PERL_OBJECT void *ptr, int sz, swig_type_info *type) {
1269 SV *result = sv_newmortal();
1270 SWIG_Perl_MakePackedObj(result, ptr, sz, type);
1271 return result;
1272 }
1273
1274 /* Convert a packed pointer value */
1275 SWIGRUNTIME int
1276 SWIG_Perl_ConvertPacked(SWIG_MAYBE_PERL_OBJECT SV *obj, void *ptr, int sz, swig_type_info *ty) {
1277 swig_cast_info *tc;
1278 const char *c = 0;
1279
1280 if ((!obj) || (!SvOK(obj))) return SWIG_ERROR;
1281 c = SvPV_nolen(obj);
1282 /* Pointer values must start with leading underscore */
1283 if (*c != '_') return SWIG_ERROR;
1284 c++;
1285 c = SWIG_UnpackData(c,ptr,sz);
1286 if (ty) {
1287 tc = SWIG_TypeCheck(c,ty);
1288 if (!tc) return SWIG_ERROR;
1289 }
1290 return SWIG_OK;
1291 }
1292
1293
1294 /* Macros for low-level exception handling */
1295 #define SWIG_croak(x) { SWIG_Error(SWIG_RuntimeError, x); SWIG_fail; }
1296
1297
1298 typedef XSPROTO(SwigPerlWrapper);
1299 typedef SwigPerlWrapper *SwigPerlWrapperPtr;
1300
1301 /* Structure for command table */
1302 typedef struct {
1303 const char *name;
1304 SwigPerlWrapperPtr wrapper;
1305 } swig_command_info;
1306
1307 /* Information for constant table */
1308
1309 #define SWIG_INT 1
1310 #define SWIG_FLOAT 2
1311 #define SWIG_STRING 3
1312 #define SWIG_POINTER 4
1313 #define SWIG_BINARY 5
1314
1315 /* Constant information structure */
1316 typedef struct swig_constant_info {
1317 int type;
1318 const char *name;
1319 long lvalue;
1320 double dvalue;
1321 void *pvalue;
1322 swig_type_info **ptype;
1323 } swig_constant_info;
1324
1325
1326 /* Structure for variable table */
1327 typedef struct {
1328 const char *name;
1329 SwigMagicFunc set;
1330 SwigMagicFunc get;
1331 swig_type_info **type;
1332 } swig_variable_info;
1333
1334 /* Magic variable code */
1335 #ifndef PERL_OBJECT
1336 # ifdef __cplusplus
1337 # define swig_create_magic(s,a,b,c) _swig_create_magic(s,const_cast<char*>(a),b,c)
1338 # else
1339 # define swig_create_magic(s,a,b,c) _swig_create_magic(s,(char*)(a),b,c)
1340 # endif
1341 # ifndef MULTIPLICITY
1342 SWIGRUNTIME void _swig_create_magic(SV *sv, char *name, int (*set)(SV *, MAGIC *), int (*get)(SV *,MAGIC *))
1343 # else
1344 SWIGRUNTIME void _swig_create_magic(SV *sv, char *name, int (*set)(struct interpreter*, SV *, MAGIC *), int (*get)(struct interpreter*, SV *,MAGIC *))
1345 # endif
1346 #else
1347 # define swig_create_magic(s,a,b,c) _swig_create_magic(pPerl,s,a,b,c)
1348 SWIGRUNTIME void _swig_create_magic(CPerlObj *pPerl, SV *sv, const char *name, int (CPerlObj::*set)(SV *, MAGIC *), int (CPerlObj::*get)(SV *, MAGIC *))
1349 #endif
1350 {
1351 MAGIC *mg;
1352 sv_magic(sv,sv,'U',name,strlen(name));
1353 mg = mg_find(sv,'U');
1354 mg->mg_virtual = (MGVTBL *) malloc(sizeof(MGVTBL));
1355 mg->mg_virtual->svt_get = (SwigMagicFunc) get;
1356 mg->mg_virtual->svt_set = (SwigMagicFunc) set;
1357 mg->mg_virtual->svt_len = 0;
1358 mg->mg_virtual->svt_clear = 0;
1359 mg->mg_virtual->svt_free = 0;
1360 }
1361
1362
1363 SWIGRUNTIME swig_module_info *
1364 SWIG_Perl_GetModule(void *SWIGUNUSEDPARM(clientdata)) {
1365 static void *type_pointer = (void *)0;
1366 SV *pointer;
1367
1368 /* first check if pointer already created */
1369 if (!type_pointer) {
1370 pointer = get_sv("swig_runtime_data::type_pointer" SWIG_RUNTIME_VERSION SWIG_TYPE_TABLE_NAME, FALSE | GV_ADDMULTI);
1371 if (pointer && SvOK(pointer)) {
1372 type_pointer = INT2PTR(swig_type_info **, SvIV(pointer));
1373 }
1374 }
1375
1376 return (swig_module_info *) type_pointer;
1377 }
1378
1379 SWIGRUNTIME void
1380 SWIG_Perl_SetModule(swig_module_info *module) {
1381 SV *pointer;
1382
1383 /* create a new pointer */
1384 pointer = get_sv("swig_runtime_data::type_pointer" SWIG_RUNTIME_VERSION SWIG_TYPE_TABLE_NAME, TRUE | GV_ADDMULTI);
1385 sv_setiv(pointer, PTR2IV(module));
1386 }
1387
1388 #ifdef __cplusplus
1389 }
1390 #endif
1391
1392 /* Workaround perl5 global namespace pollution. Note that undefining library
1393 * functions like fopen will not solve the problem on all platforms as fopen
1394 * might be a macro on Windows but not necessarily on other operating systems. */
1395 #ifdef do_open
1396 #undef do_open
1397 #endif
1398 #ifdef do_close
1399 #undef do_close
1400 #endif
1401 #ifdef do_exec
1402 #undef do_exec
1403 #endif
1404 #ifdef scalar
1405 #undef scalar
1406 #endif
1407 #ifdef list
1408 #undef list
1409 #endif
1410 #ifdef apply
1411 #undef apply
1412 #endif
1413 #ifdef convert
1414 #undef convert
1415 #endif
1416 #ifdef Error
1417 #undef Error
1418 #endif
1419 #ifdef form
1420 #undef form
1421 #endif
1422 #ifdef vform
1423 #undef vform
1424 #endif
1425 #ifdef LABEL
1426 #undef LABEL
1427 #endif
1428 #ifdef METHOD
1429 #undef METHOD
1430 #endif
1431 #ifdef Move
1432 #undef Move
1433 #endif
1434 #ifdef yylex
1435 #undef yylex
1436 #endif
1437 #ifdef yyparse
1438 #undef yyparse
1439 #endif
1440 #ifdef yyerror
1441 #undef yyerror
1442 #endif
1443 #ifdef invert
1444 #undef invert
1445 #endif
1446 #ifdef ref
1447 #undef ref
1448 #endif
1449 #ifdef read
1450 #undef read
1451 #endif
1452 #ifdef write
1453 #undef write
1454 #endif
1455 #ifdef eof
1456 #undef eof
1457 #endif
1458 #ifdef close
1459 #undef close
1460 #endif
1461 #ifdef rewind
1462 #undef rewind
1463 #endif
1464 #ifdef free
1465 #undef free
1466 #endif
1467 #ifdef malloc
1468 #undef malloc
1469 #endif
1470 #ifdef calloc
1471 #undef calloc
1472 #endif
1473 #ifdef Stat
1474 #undef Stat
1475 #endif
1476 #ifdef check
1477 #undef check
1478 #endif
1479 #ifdef seekdir
1480 #undef seekdir
1481 #endif
1482 #ifdef open
1483 #undef open
1484 #endif
1485 #ifdef readdir
1486 #undef readdir
1487 #endif
1488 #ifdef bind
1489 #undef bind
1490 #endif
1491 #ifdef access
1492 #undef access
1493 #endif
1494 #ifdef stat
1495 #undef stat
1496 #endif
1497 #ifdef seed
1498 #undef seed
1499 #endif
1500
1501 #ifdef bool
1502 /* Leave if macro is from C99 stdbool.h */
1503 #ifndef __bool_true_false_are_defined
1504 #undef bool
1505 #endif
1506 #endif
1507
1508
1509
1510
1511 #define SWIG_exception_fail(code, msg) do { SWIG_Error(code, msg); SWIG_fail; } while(0)
1512
1513 #define SWIG_contract_assert(expr, msg) if (!(expr)) { SWIG_Error(SWIG_RuntimeError, msg); SWIG_fail; } else
1514
1515
1516
1517 /* -------- TYPES TABLE (BEGIN) -------- */
1518
1519 #define SWIGTYPE_p_FILE swig_types[0]
1520 #define SWIGTYPE_p_char swig_types[1]
1521 #define SWIGTYPE_p_f_p_q_const__char_p_q_const__char_int_int__void swig_types[2]
1522 #define SWIGTYPE_p_f_p_q_const__char_p_q_const__char_int_p_q_const__char__void swig_types[3]
1523 static swig_type_info *swig_types[5];
1524 static swig_module_info swig_module = {swig_types, 4, 0, 0, 0, 0};
1525 #define SWIG_TypeQuery(name) SWIG_TypeQueryModule(&swig_module, &swig_module, name)
1526 #define SWIG_MangledTypeQuery(name) SWIG_MangledTypeQueryModule(&swig_module, &swig_module, name)
1527
1528 /* -------- TYPES TABLE (END) -------- */
1529
1530 #define SWIG_init boot_Math__GSL__Errno
1531
1532 #define SWIG_name "Math::GSL::Errnoc::boot_Math__GSL__Errno"
1533 #define SWIG_prefix "Math::GSL::Errnoc::"
1534
1535 #define SWIGVERSION 0x040001
1536 #define SWIG_VERSION SWIGVERSION
1537
1538
1539 #define SWIG_as_voidptr(a) (void *)((const void *)(a))
1540 #define SWIG_as_voidptrptr(a) ((void)SWIG_as_voidptr(*a),(void**)(a))
1541
1542
1543 #ifdef __cplusplus
1544 extern "C"
1545 #endif
1546 #ifndef PERL_OBJECT
1547 #ifndef MULTIPLICITY
1548 SWIGEXPORT void SWIG_init (CV* cv);
1549 #else
1550 SWIGEXPORT void SWIG_init (pTHXo_ CV* cv);
1551 #endif
1552 #else
1553 SWIGEXPORT void SWIG_init (CV *cv, CPerlObj *);
1554 #endif
1555
1556
1557 SWIGINTERNINLINE SV *
SWIG_PERL_DECL_ARGS_1(double value)1558 SWIG_From_double SWIG_PERL_DECL_ARGS_1(double value)
1559 {
1560 return sv_2mortal(newSVnv(value));
1561 }
1562
1563
1564 SWIGINTERNINLINE SV *
SWIG_PERL_DECL_ARGS_1(long value)1565 SWIG_From_long SWIG_PERL_DECL_ARGS_1(long value)
1566 {
1567 SV *sv;
1568 if (IVSIZE >= sizeof(value) || (value >= IV_MIN && value <= IV_MAX))
1569 sv = newSViv(value);
1570 else
1571 sv = newSVpvf("%ld", value);
1572 return sv_2mortal(sv);
1573 }
1574
1575
1576 SWIGINTERNINLINE SV *
SWIG_PERL_DECL_ARGS_1(int value)1577 SWIG_From_int SWIG_PERL_DECL_ARGS_1(int value)
1578 {
1579 return SWIG_From_long SWIG_PERL_CALL_ARGS_1(value);
1580 }
1581
1582
1583 SWIGINTERN swig_type_info*
SWIG_pchar_descriptor(void)1584 SWIG_pchar_descriptor(void)
1585 {
1586 static int init = 0;
1587 static swig_type_info* info = 0;
1588 if (!init) {
1589 info = SWIG_TypeQuery("_p_char");
1590 init = 1;
1591 }
1592 return info;
1593 }
1594
1595
1596 SWIGINTERN int
SWIG_AsCharPtrAndSize(SV * obj,char ** cptr,size_t * psize,int * alloc)1597 SWIG_AsCharPtrAndSize(SV *obj, char** cptr, size_t* psize, int *alloc)
1598 {
1599 if (SvMAGICAL(obj)) {
1600 SV *tmp = sv_newmortal();
1601 SvSetSV(tmp, obj);
1602 obj = tmp;
1603 }
1604 if (SvPOK(obj)) {
1605 STRLEN len = 0;
1606 char *cstr = SvPV(obj, len);
1607 size_t size = len + 1;
1608 if (cptr) {
1609 if (alloc) {
1610 if (*alloc == SWIG_NEWOBJ) {
1611 *cptr = (char *)memcpy(malloc((size)*sizeof(char)), cstr, sizeof(char)*(size));
1612 } else {
1613 *cptr = cstr;
1614 *alloc = SWIG_OLDOBJ;
1615 }
1616 }
1617 }
1618 if (psize) *psize = size;
1619 return SWIG_OK;
1620 } else {
1621 swig_type_info* pchar_descriptor = SWIG_pchar_descriptor();
1622 if (pchar_descriptor) {
1623 char* vptr = 0;
1624 if (SWIG_ConvertPtr(obj, (void**)&vptr, pchar_descriptor, 0) == SWIG_OK) {
1625 if (cptr) *cptr = vptr;
1626 if (psize) *psize = vptr ? (strlen(vptr) + 1) : 0;
1627 if (alloc) *alloc = SWIG_OLDOBJ;
1628 return SWIG_OK;
1629 }
1630 }
1631 }
1632 return SWIG_TypeError;
1633 }
1634
1635
1636
1637
1638
1639 #include <limits.h>
1640 #if !defined(SWIG_NO_LLONG_MAX)
1641 # if !defined(LLONG_MAX) && defined(__GNUC__) && defined (__LONG_LONG_MAX__)
1642 # define LLONG_MAX __LONG_LONG_MAX__
1643 # define LLONG_MIN (-LLONG_MAX - 1LL)
1644 # define ULLONG_MAX (LLONG_MAX * 2ULL + 1ULL)
1645 # endif
1646 #endif
1647
1648
1649 #include <stdlib.h>
1650 #ifdef _MSC_VER
1651 # ifndef strtoull
1652 # define strtoull _strtoui64
1653 # endif
1654 # ifndef strtoll
1655 # define strtoll _strtoi64
1656 # endif
1657 #endif
1658
1659
1660 SWIGINTERN int
SWIG_PERL_DECL_ARGS_2(SV * obj,double * val)1661 SWIG_AsVal_double SWIG_PERL_DECL_ARGS_2(SV *obj, double *val)
1662 {
1663 if (SvNIOK(obj)) {
1664 if (val) *val = SvNV(obj);
1665 return SWIG_OK;
1666 } else if (SvIOK(obj)) {
1667 if (val) *val = (double) SvIV(obj);
1668 return SWIG_AddCast(SWIG_OK);
1669 } else {
1670 const char *nptr = SvPV_nolen(obj);
1671 if (nptr) {
1672 char *endptr;
1673 double v;
1674 errno = 0;
1675 v = strtod(nptr, &endptr);
1676 if (errno == ERANGE) {
1677 errno = 0;
1678 return SWIG_OverflowError;
1679 } else {
1680 if (*endptr == '\0') {
1681 if (val) *val = v;
1682 return SWIG_Str2NumCast(SWIG_OK);
1683 }
1684 }
1685 }
1686 }
1687 return SWIG_TypeError;
1688 }
1689
1690
1691 #include <float.h>
1692
1693
1694 #include <math.h>
1695
1696
1697 SWIGINTERNINLINE int
SWIG_CanCastAsInteger(double * d,double min,double max)1698 SWIG_CanCastAsInteger(double *d, double min, double max) {
1699 double x = *d;
1700 if ((min <= x && x <= max)) {
1701 double fx = floor(x);
1702 double cx = ceil(x);
1703 double rd = ((x - fx) < 0.5) ? fx : cx; /* simple rint */
1704 if ((errno == EDOM) || (errno == ERANGE)) {
1705 errno = 0;
1706 } else {
1707 double summ, reps, diff;
1708 if (rd < x) {
1709 diff = x - rd;
1710 } else if (rd > x) {
1711 diff = rd - x;
1712 } else {
1713 return 1;
1714 }
1715 summ = rd + x;
1716 reps = diff/summ;
1717 if (reps < 8*DBL_EPSILON) {
1718 *d = rd;
1719 return 1;
1720 }
1721 }
1722 }
1723 return 0;
1724 }
1725
1726
1727 SWIGINTERN int
SWIG_PERL_DECL_ARGS_2(SV * obj,long * val)1728 SWIG_AsVal_long SWIG_PERL_DECL_ARGS_2(SV *obj, long* val)
1729 {
1730 if (SvUOK(obj)) {
1731 UV v = SvUV(obj);
1732 if (UVSIZE < sizeof(*val) || v <= LONG_MAX) {
1733 if (val) *val = v;
1734 return SWIG_OK;
1735 }
1736 return SWIG_OverflowError;
1737 } else if (SvIOK(obj)) {
1738 IV v = SvIV(obj);
1739 if (IVSIZE <= sizeof(*val) || (v >= LONG_MIN && v <= LONG_MAX)) {
1740 if(val) *val = v;
1741 return SWIG_OK;
1742 }
1743 return SWIG_OverflowError;
1744 } else {
1745 int dispatch = 0;
1746 const char *nptr = SvPV_nolen(obj);
1747 if (nptr) {
1748 char *endptr;
1749 long v;
1750 errno = 0;
1751 v = strtol(nptr, &endptr,0);
1752 if (errno == ERANGE) {
1753 errno = 0;
1754 return SWIG_OverflowError;
1755 } else {
1756 if (*endptr == '\0') {
1757 if (val) *val = v;
1758 return SWIG_Str2NumCast(SWIG_OK);
1759 }
1760 }
1761 }
1762 if (!dispatch) {
1763 double d;
1764 int res = SWIG_AddCast(SWIG_AsVal_double SWIG_PERL_CALL_ARGS_2(obj,&d));
1765 if (SWIG_IsOK(res) && SWIG_CanCastAsInteger(&d, LONG_MIN, LONG_MAX)) {
1766 if (val) *val = (long)(d);
1767 return res;
1768 }
1769 }
1770 }
1771 return SWIG_TypeError;
1772 }
1773
1774
1775 SWIGINTERN int
SWIG_PERL_DECL_ARGS_2(SV * obj,int * val)1776 SWIG_AsVal_int SWIG_PERL_DECL_ARGS_2(SV * obj, int *val)
1777 {
1778 long v;
1779 int res = SWIG_AsVal_long SWIG_PERL_CALL_ARGS_2(obj, &v);
1780 if (SWIG_IsOK(res)) {
1781 if ((v < INT_MIN || v > INT_MAX)) {
1782 return SWIG_OverflowError;
1783 } else {
1784 if (val) *val = (int)(v);
1785 }
1786 }
1787 return res;
1788 }
1789
1790
1791 SWIGINTERNINLINE SV *
SWIG_FromCharPtrAndSize(const char * carray,size_t size)1792 SWIG_FromCharPtrAndSize(const char* carray, size_t size)
1793 {
1794 SV *obj = sv_newmortal();
1795 if (carray) {
1796 sv_setpvn(obj, carray, size);
1797 } else {
1798 sv_setsv(obj, &PL_sv_undef);
1799 }
1800 return obj;
1801 }
1802
1803
1804 SWIGINTERNINLINE SV *
SWIG_FromCharPtr(const char * cptr)1805 SWIG_FromCharPtr(const char *cptr)
1806 {
1807 return SWIG_FromCharPtrAndSize(cptr, (cptr ? strlen(cptr) : 0));
1808 }
1809
1810
1811 #include "gsl/gsl_nan.h"
1812 #include "gsl/gsl_errno.h"
1813 #include "gsl/gsl_math.h"
1814 #include "gsl/gsl_monte.h"
1815
1816
1817 struct perl_array {
1818 I32 len;
1819 AV *array;
1820 };
1821
1822
1823
1824 enum awType { awDouble, awFloat, awInt, awUnsigned };
1825
1826 typedef struct {
1827 I32 size;
1828 enum awType type;
1829 void * data;
1830 } array_wrapper;
1831
array_wrapper_alloc(int numelem,enum awType type)1832 array_wrapper * array_wrapper_alloc(int numelem, enum awType type){
1833 array_wrapper * rv = malloc(sizeof(array_wrapper));
1834
1835 if (rv == NULL)
1836 croak("array_wrapper_alloc: can't malloc wrapper\n");
1837
1838 switch (type){
1839 case awDouble:
1840 rv->data = malloc(sizeof(double) * numelem);
1841 break;
1842 case awFloat:
1843 rv->data = malloc(sizeof(float) * numelem);
1844 break;
1845 case awInt:
1846 rv->data = malloc(sizeof(int) * numelem);
1847 break;
1848 case awUnsigned:
1849 rv->data = malloc(sizeof(unsigned int) * numelem);
1850 break;
1851 default:
1852 croak("array_wrapper_alloc: type should be awDouble, awFloat, awInt, or awUnsigned");
1853 }
1854
1855 if (rv->data == NULL)
1856 croak("array_wrapper_alloc: can't malloc data");
1857
1858 rv->size = numelem;
1859 rv->type = type;
1860 return rv;
1861 }
1862
array_wrapper_free(array_wrapper * daw)1863 void array_wrapper_free(array_wrapper * daw){
1864 free(daw->data);
1865 free(daw);
1866 }
1867
1868
1869 /* structure to hold required information while the gsl function call
1870 for each callback
1871 */
1872 struct gsl_function_perl {
1873 gsl_function C_gsl_function;
1874 SV * function;
1875 SV * params;
1876 };
1877
1878 struct gsl_function_fdf_perl {
1879 gsl_function_fdf C_gsl_function_fdf;
1880 SV * f;
1881 SV * df;
1882 SV * fdf;
1883 SV * params;
1884 };
1885
1886 struct gsl_monte_function_perl {
1887 gsl_monte_function C_gsl_monte_function;
1888 SV * f;
1889 SV * dim;
1890 SV * params;
1891 };
1892
gsl_function_perl_free(struct gsl_function_perl * perl_f)1893 void gsl_function_perl_free(struct gsl_function_perl * perl_f){
1894 if (perl_f != NULL) {
1895 SvREFCNT_dec(perl_f->function);
1896 SvREFCNT_dec(perl_f->params);
1897 Safefree(perl_f);
1898 }
1899 }
1900
gsl_function_fdf_perl_free(struct gsl_function_fdf_perl * perl_fdf)1901 void gsl_function_fdf_perl_free(struct gsl_function_fdf_perl * perl_fdf){
1902 if (perl_fdf != NULL) {
1903 SvREFCNT_dec(perl_fdf->f);
1904 SvREFCNT_dec(perl_fdf->df);
1905 SvREFCNT_dec(perl_fdf->fdf);
1906 SvREFCNT_dec(perl_fdf->params);
1907 Safefree(perl_fdf);
1908 }
1909 }
1910
1911 /* These functions (C callbacks) calls the perl callbacks.
1912 Info for perl callback can be found using the 'void*params' parameter
1913 */
call_gsl_function_x_params(SV * function,double x,SV * params)1914 double call_gsl_function_x_params(SV* function, double x, SV *params){
1915 unsigned int count;
1916 double y;
1917 dSP;
1918
1919 //fprintf(stderr, "LOOKUP CALLBACK\n");
1920 ENTER;
1921 SAVETMPS;
1922
1923 PUSHMARK(SP);
1924 XPUSHs(sv_2mortal(newSVnv((double)x)));
1925 XPUSHs(params);
1926 PUTBACK; /* make local stack pointer global */
1927
1928 count = call_sv(function, G_SCALAR);
1929 SPAGAIN;
1930
1931 if (count != 1)
1932 croak("Expected to call subroutine in scalar context!");
1933
1934 y = POPn;
1935
1936 PUTBACK; /* make local stack pointer global */
1937 FREETMPS;
1938 LEAVE;
1939
1940 return y;
1941 }
1942
call_gsl_function(double x,void * params)1943 double call_gsl_function(double x , void *params){
1944 struct gsl_function_perl *F=(struct gsl_function_perl*)params;
1945 return call_gsl_function_x_params( F->function, x, F->params );
1946 }
1947
call_gsl_function_fdf_f(double x,void * params)1948 double call_gsl_function_fdf_f(double x , void *params){
1949 struct gsl_function_fdf_perl *F=(struct gsl_function_fdf_perl*)params;
1950 return call_gsl_function_x_params( F->f, x, F->params );
1951 }
1952
call_gsl_function_fdf_df(double x,void * params)1953 double call_gsl_function_fdf_df(double x , void *params){
1954 struct gsl_function_fdf_perl *F=(struct gsl_function_fdf_perl*)params;
1955 return call_gsl_function_x_params( F->df, x, F->params );
1956 }
1957
call_gsl_function_fdf_fdf(double x,void * params,double * f,double * df)1958 void call_gsl_function_fdf_fdf(double x , void *params, double *f, double *df ){
1959 struct gsl_function_fdf_perl *F=(struct gsl_function_fdf_perl*)params;
1960
1961 dSP;
1962
1963 ENTER;
1964 SAVETMPS;
1965
1966 PUSHMARK(SP);
1967 EXTEND(SP, 2);
1968 PUSHs(sv_2mortal(newSVnv((double)x)));
1969 PUSHs(F->params);
1970 PUTBACK; /* make local stack pointer global */
1971
1972 {
1973 unsigned int count = call_sv(F->fdf, G_ARRAY);
1974 SPAGAIN;
1975
1976 if (count != 2)
1977 croak( "Expected two return values, got %d", count );
1978 }
1979
1980 *df = POPn;
1981 *f = POPn;
1982
1983 PUTBACK; /* make local stack pointer global */
1984 FREETMPS;
1985 LEAVE;
1986 }
1987
call_gsl_monte_function(double * x_array,size_t dim,void * params)1988 double call_gsl_monte_function(double *x_array , size_t dim, void *params){
1989 struct gsl_monte_function_perl *F=(struct gsl_monte_function_perl*)params;
1990 unsigned int count;
1991 unsigned int i;
1992 AV* perl_array;
1993 double y;
1994 dSP;
1995
1996 //fprintf(stderr, "LOOKUP CALLBACK\n");
1997 ENTER;
1998 SAVETMPS;
1999
2000 PUSHMARK(SP);
2001 perl_array=newAV();
2002 sv_2mortal((SV*)perl_array);
2003 XPUSHs(sv_2mortal(newRV((SV *)perl_array)));
2004 for(i=0; i<dim; i++) {
2005 /* no mortal : it is referenced by the array */
2006 av_push(perl_array, newSVnv(x_array[i]));
2007 }
2008 XPUSHs(sv_2mortal(newSViv(dim)));
2009 XPUSHs(F->params);
2010 PUTBACK; /* make local stack pointer global */
2011
2012 count = call_sv(F->f, G_SCALAR);
2013 SPAGAIN;
2014
2015 if (count != 1)
2016 croak("Expected to call subroutine in scalar context!");
2017
2018 y = POPn;
2019
2020 PUTBACK; /* make local stack pointer global */
2021 FREETMPS;
2022 LEAVE;
2023
2024 return y;
2025 }
2026
2027
gsl_function_fdf_extract(char * param_name,HV * hash,SV * func[])2028 void gsl_function_fdf_extract( char* param_name, HV* hash, SV* func[] ) {
2029 static const char *keys[3] = { "f", "df", "fdf" };
2030
2031 int ikey;
2032
2033 for ( ikey = 0 ; ikey < 3 ; ++ikey ) {
2034 func[ikey] = 0;
2035 const char* key = keys[ikey];
2036 /* it just so happens that strlen(keys[ikey]) == ikey + 1 */
2037 SV** pp_sv = hv_fetch( hash, key, ikey+1, 0 );
2038 SV* function;
2039
2040 if ( !pp_sv )
2041 croak("Math::GSL : %s: missing key %s!", param_name, key);
2042
2043 function = *pp_sv;
2044
2045 if ( SvPOK(function) || ( SvROK( function ) && SvTYPE(SvRV(function)) == SVt_PVCV ) ) {
2046 /* hold on to SV after the enclosing hash goes away */
2047 SvREFCNT_inc( function );
2048 func[ikey] = function;
2049 }
2050 else {
2051 croak( "Math::GSL : %s: key %s is not a reference to code!", param_name, key);
2052 }
2053 }
2054 }
2055
2056
2057
2058 #include "gsl/gsl_errno.h"
2059 #include "gsl/gsl_types.h"
2060
2061 #ifdef __cplusplus
2062 extern "C" {
2063 #endif
2064
2065 #ifdef PERL_OBJECT
2066 #define MAGIC_CLASS _wrap_Math__GSL__Errno_var::
2067 class _wrap_Math__GSL__Errno_var : public CPerlObj {
2068 public:
2069 #else
2070 #define MAGIC_CLASS
2071 #endif
swig_magic_readonly(pTHX_ SV * SWIGUNUSEDPARM (sv),MAGIC * SWIGUNUSEDPARM (mg))2072 SWIGCLASS_STATIC int swig_magic_readonly(pTHX_ SV *SWIGUNUSEDPARM(sv), MAGIC *SWIGUNUSEDPARM(mg)) {
2073 MAGIC_PPERL
2074 croak("Value is read-only.");
2075 return 0;
2076 }
2077
2078
2079 #ifdef PERL_OBJECT
2080 };
2081 #endif
2082
2083 #ifdef __cplusplus
2084 }
2085 #endif
2086
2087 #ifdef __cplusplus
2088 extern "C" {
2089 #endif
XS(_wrap_gsl_error)2090 XS(_wrap_gsl_error) {
2091 {
2092 char *arg1 = (char *) 0 ;
2093 char *arg2 = (char *) 0 ;
2094 int arg3 ;
2095 int arg4 ;
2096 int res1 ;
2097 char *buf1 = 0 ;
2098 int alloc1 = 0 ;
2099 int res2 ;
2100 char *buf2 = 0 ;
2101 int alloc2 = 0 ;
2102 int val3 ;
2103 int ecode3 = 0 ;
2104 int val4 ;
2105 int ecode4 = 0 ;
2106 int argvi = 0;
2107 dXSARGS;
2108
2109 if ((items < 4) || (items > 4)) {
2110 SWIG_croak("Usage: gsl_error(reason,file,line,gsl_errno);");
2111 }
2112 res1 = SWIG_AsCharPtrAndSize(ST(0), &buf1, NULL, &alloc1);
2113 if (!SWIG_IsOK(res1)) {
2114 SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_error" "', argument " "1"" of type '" "char const *""'");
2115 }
2116 arg1 = (char *)(buf1);
2117 res2 = SWIG_AsCharPtrAndSize(ST(1), &buf2, NULL, &alloc2);
2118 if (!SWIG_IsOK(res2)) {
2119 SWIG_exception_fail(SWIG_ArgError(res2), "in method '" "gsl_error" "', argument " "2"" of type '" "char const *""'");
2120 }
2121 arg2 = (char *)(buf2);
2122 ecode3 = SWIG_AsVal_int SWIG_PERL_CALL_ARGS_2(ST(2), &val3);
2123 if (!SWIG_IsOK(ecode3)) {
2124 SWIG_exception_fail(SWIG_ArgError(ecode3), "in method '" "gsl_error" "', argument " "3"" of type '" "int""'");
2125 }
2126 arg3 = (int)(val3);
2127 ecode4 = SWIG_AsVal_int SWIG_PERL_CALL_ARGS_2(ST(3), &val4);
2128 if (!SWIG_IsOK(ecode4)) {
2129 SWIG_exception_fail(SWIG_ArgError(ecode4), "in method '" "gsl_error" "', argument " "4"" of type '" "int""'");
2130 }
2131 arg4 = (int)(val4);
2132 gsl_error((char const *)arg1,(char const *)arg2,arg3,arg4);
2133 ST(argvi) = &PL_sv_undef;
2134 if (alloc1 == SWIG_NEWOBJ) free((char*)buf1);
2135 if (alloc2 == SWIG_NEWOBJ) free((char*)buf2);
2136
2137
2138 XSRETURN(argvi);
2139 fail:
2140 if (alloc1 == SWIG_NEWOBJ) free((char*)buf1);
2141 if (alloc2 == SWIG_NEWOBJ) free((char*)buf2);
2142
2143
2144 SWIG_croak_null();
2145 }
2146 }
2147
2148
XS(_wrap_gsl_stream_printf)2149 XS(_wrap_gsl_stream_printf) {
2150 {
2151 char *arg1 = (char *) 0 ;
2152 char *arg2 = (char *) 0 ;
2153 int arg3 ;
2154 char *arg4 = (char *) 0 ;
2155 int res1 ;
2156 char *buf1 = 0 ;
2157 int alloc1 = 0 ;
2158 int res2 ;
2159 char *buf2 = 0 ;
2160 int alloc2 = 0 ;
2161 int val3 ;
2162 int ecode3 = 0 ;
2163 int res4 ;
2164 char *buf4 = 0 ;
2165 int alloc4 = 0 ;
2166 int argvi = 0;
2167 dXSARGS;
2168
2169 if ((items < 4) || (items > 4)) {
2170 SWIG_croak("Usage: gsl_stream_printf(label,file,line,reason);");
2171 }
2172 res1 = SWIG_AsCharPtrAndSize(ST(0), &buf1, NULL, &alloc1);
2173 if (!SWIG_IsOK(res1)) {
2174 SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_stream_printf" "', argument " "1"" of type '" "char const *""'");
2175 }
2176 arg1 = (char *)(buf1);
2177 res2 = SWIG_AsCharPtrAndSize(ST(1), &buf2, NULL, &alloc2);
2178 if (!SWIG_IsOK(res2)) {
2179 SWIG_exception_fail(SWIG_ArgError(res2), "in method '" "gsl_stream_printf" "', argument " "2"" of type '" "char const *""'");
2180 }
2181 arg2 = (char *)(buf2);
2182 ecode3 = SWIG_AsVal_int SWIG_PERL_CALL_ARGS_2(ST(2), &val3);
2183 if (!SWIG_IsOK(ecode3)) {
2184 SWIG_exception_fail(SWIG_ArgError(ecode3), "in method '" "gsl_stream_printf" "', argument " "3"" of type '" "int""'");
2185 }
2186 arg3 = (int)(val3);
2187 res4 = SWIG_AsCharPtrAndSize(ST(3), &buf4, NULL, &alloc4);
2188 if (!SWIG_IsOK(res4)) {
2189 SWIG_exception_fail(SWIG_ArgError(res4), "in method '" "gsl_stream_printf" "', argument " "4"" of type '" "char const *""'");
2190 }
2191 arg4 = (char *)(buf4);
2192 gsl_stream_printf((char const *)arg1,(char const *)arg2,arg3,(char const *)arg4);
2193 ST(argvi) = &PL_sv_undef;
2194 if (alloc1 == SWIG_NEWOBJ) free((char*)buf1);
2195 if (alloc2 == SWIG_NEWOBJ) free((char*)buf2);
2196
2197 if (alloc4 == SWIG_NEWOBJ) free((char*)buf4);
2198 XSRETURN(argvi);
2199 fail:
2200 if (alloc1 == SWIG_NEWOBJ) free((char*)buf1);
2201 if (alloc2 == SWIG_NEWOBJ) free((char*)buf2);
2202
2203 if (alloc4 == SWIG_NEWOBJ) free((char*)buf4);
2204 SWIG_croak_null();
2205 }
2206 }
2207
2208
XS(_wrap_gsl_strerror)2209 XS(_wrap_gsl_strerror) {
2210 {
2211 int arg1 ;
2212 int val1 ;
2213 int ecode1 = 0 ;
2214 int argvi = 0;
2215 char *result = 0 ;
2216 dXSARGS;
2217
2218 if ((items < 1) || (items > 1)) {
2219 SWIG_croak("Usage: gsl_strerror(gsl_errno);");
2220 }
2221 ecode1 = SWIG_AsVal_int SWIG_PERL_CALL_ARGS_2(ST(0), &val1);
2222 if (!SWIG_IsOK(ecode1)) {
2223 SWIG_exception_fail(SWIG_ArgError(ecode1), "in method '" "gsl_strerror" "', argument " "1"" of type '" "int""'");
2224 }
2225 arg1 = (int)(val1);
2226 result = (char *)gsl_strerror(arg1);
2227 ST(argvi) = SWIG_FromCharPtr((const char *)result); argvi++ ;
2228
2229 XSRETURN(argvi);
2230 fail:
2231
2232 SWIG_croak_null();
2233 }
2234 }
2235
2236
XS(_wrap_gsl_set_error_handler)2237 XS(_wrap_gsl_set_error_handler) {
2238 {
2239 gsl_error_handler_t *arg1 = (gsl_error_handler_t *) 0 ;
2240 int argvi = 0;
2241 gsl_error_handler_t *result = 0 ;
2242 dXSARGS;
2243
2244 if ((items < 1) || (items > 1)) {
2245 SWIG_croak("Usage: gsl_set_error_handler(new_handler);");
2246 }
2247 {
2248 int res = SWIG_ConvertFunctionPtr(ST(0), (void**)(&arg1), SWIGTYPE_p_f_p_q_const__char_p_q_const__char_int_int__void);
2249 if (!SWIG_IsOK(res)) {
2250 SWIG_exception_fail(SWIG_ArgError(res), "in method '" "gsl_set_error_handler" "', argument " "1"" of type '" "gsl_error_handler_t *""'");
2251 }
2252 }
2253 result = (gsl_error_handler_t *)gsl_set_error_handler(arg1);
2254 ST(argvi) = SWIG_NewFunctionPtrObj((void *)(result), SWIGTYPE_p_f_p_q_const__char_p_q_const__char_int_int__void); argvi++ ;
2255
2256 XSRETURN(argvi);
2257 fail:
2258
2259 SWIG_croak_null();
2260 }
2261 }
2262
2263
XS(_wrap_gsl_set_error_handler_off)2264 XS(_wrap_gsl_set_error_handler_off) {
2265 {
2266 int argvi = 0;
2267 gsl_error_handler_t *result = 0 ;
2268 dXSARGS;
2269
2270 if ((items < 0) || (items > 0)) {
2271 SWIG_croak("Usage: gsl_set_error_handler_off();");
2272 }
2273 result = (gsl_error_handler_t *)gsl_set_error_handler_off();
2274 ST(argvi) = SWIG_NewFunctionPtrObj((void *)(result), SWIGTYPE_p_f_p_q_const__char_p_q_const__char_int_int__void); argvi++ ;
2275 XSRETURN(argvi);
2276 fail:
2277 SWIG_croak_null();
2278 }
2279 }
2280
2281
XS(_wrap_gsl_set_stream_handler)2282 XS(_wrap_gsl_set_stream_handler) {
2283 {
2284 gsl_stream_handler_t *arg1 = (gsl_stream_handler_t *) 0 ;
2285 int argvi = 0;
2286 gsl_stream_handler_t *result = 0 ;
2287 dXSARGS;
2288
2289 if ((items < 1) || (items > 1)) {
2290 SWIG_croak("Usage: gsl_set_stream_handler(new_handler);");
2291 }
2292 {
2293 int res = SWIG_ConvertFunctionPtr(ST(0), (void**)(&arg1), SWIGTYPE_p_f_p_q_const__char_p_q_const__char_int_p_q_const__char__void);
2294 if (!SWIG_IsOK(res)) {
2295 SWIG_exception_fail(SWIG_ArgError(res), "in method '" "gsl_set_stream_handler" "', argument " "1"" of type '" "gsl_stream_handler_t *""'");
2296 }
2297 }
2298 result = (gsl_stream_handler_t *)gsl_set_stream_handler(arg1);
2299 ST(argvi) = SWIG_NewFunctionPtrObj((void *)(result), SWIGTYPE_p_f_p_q_const__char_p_q_const__char_int_p_q_const__char__void); argvi++ ;
2300
2301 XSRETURN(argvi);
2302 fail:
2303
2304 SWIG_croak_null();
2305 }
2306 }
2307
2308
XS(_wrap_gsl_set_stream)2309 XS(_wrap_gsl_set_stream) {
2310 {
2311 FILE *arg1 = (FILE *) 0 ;
2312 void *argp1 = 0 ;
2313 int res1 = 0 ;
2314 int argvi = 0;
2315 FILE *result = 0 ;
2316 dXSARGS;
2317
2318 if ((items < 1) || (items > 1)) {
2319 SWIG_croak("Usage: gsl_set_stream(new_stream);");
2320 }
2321 res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_FILE, 0 | 0 );
2322 if (!SWIG_IsOK(res1)) {
2323 SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_set_stream" "', argument " "1"" of type '" "FILE *""'");
2324 }
2325 arg1 = (FILE *)(argp1);
2326 result = (FILE *)gsl_set_stream(arg1);
2327 ST(argvi) = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_FILE, 0 | 0); argvi++ ;
2328
2329 XSRETURN(argvi);
2330 fail:
2331
2332 SWIG_croak_null();
2333 }
2334 }
2335
2336
2337
2338 /* -------- TYPE CONVERSION AND EQUIVALENCE RULES (BEGIN) -------- */
2339
2340 static swig_type_info _swigt__p_FILE = {"_p_FILE", "FILE *", 0, 0, (void*)0, 0};
2341 static swig_type_info _swigt__p_char = {"_p_char", "char *", 0, 0, (void*)0, 0};
2342 static swig_type_info _swigt__p_f_p_q_const__char_p_q_const__char_int_int__void = {"_p_f_p_q_const__char_p_q_const__char_int_int__void", "void (*)(char const *,char const *,int,int)|gsl_error_handler_t *", 0, 0, (void*)0, 0};
2343 static swig_type_info _swigt__p_f_p_q_const__char_p_q_const__char_int_p_q_const__char__void = {"_p_f_p_q_const__char_p_q_const__char_int_p_q_const__char__void", "gsl_stream_handler_t *|void (*)(char const *,char const *,int,char const *)", 0, 0, (void*)0, 0};
2344
2345 static swig_type_info *swig_type_initial[] = {
2346 &_swigt__p_FILE,
2347 &_swigt__p_char,
2348 &_swigt__p_f_p_q_const__char_p_q_const__char_int_int__void,
2349 &_swigt__p_f_p_q_const__char_p_q_const__char_int_p_q_const__char__void,
2350 };
2351
2352 static swig_cast_info _swigc__p_FILE[] = { {&_swigt__p_FILE, 0, 0, 0},{0, 0, 0, 0}};
2353 static swig_cast_info _swigc__p_char[] = { {&_swigt__p_char, 0, 0, 0},{0, 0, 0, 0}};
2354 static swig_cast_info _swigc__p_f_p_q_const__char_p_q_const__char_int_int__void[] = { {&_swigt__p_f_p_q_const__char_p_q_const__char_int_int__void, 0, 0, 0},{0, 0, 0, 0}};
2355 static swig_cast_info _swigc__p_f_p_q_const__char_p_q_const__char_int_p_q_const__char__void[] = { {&_swigt__p_f_p_q_const__char_p_q_const__char_int_p_q_const__char__void, 0, 0, 0},{0, 0, 0, 0}};
2356
2357 static swig_cast_info *swig_cast_initial[] = {
2358 _swigc__p_FILE,
2359 _swigc__p_char,
2360 _swigc__p_f_p_q_const__char_p_q_const__char_int_int__void,
2361 _swigc__p_f_p_q_const__char_p_q_const__char_int_p_q_const__char__void,
2362 };
2363
2364
2365 /* -------- TYPE CONVERSION AND EQUIVALENCE RULES (END) -------- */
2366
2367 static swig_constant_info swig_constants[] = {
2368 {0,0,0,0,0,0}
2369 };
2370 #ifdef __cplusplus
2371 }
2372 #endif
2373 static swig_variable_info swig_variables[] = {
2374 {0,0,0,0}
2375 };
2376 static swig_command_info swig_commands[] = {
2377 {"Math::GSL::Errnoc::gsl_error", _wrap_gsl_error},
2378 {"Math::GSL::Errnoc::gsl_stream_printf", _wrap_gsl_stream_printf},
2379 {"Math::GSL::Errnoc::gsl_strerror", _wrap_gsl_strerror},
2380 {"Math::GSL::Errnoc::gsl_set_error_handler", _wrap_gsl_set_error_handler},
2381 {"Math::GSL::Errnoc::gsl_set_error_handler_off", _wrap_gsl_set_error_handler_off},
2382 {"Math::GSL::Errnoc::gsl_set_stream_handler", _wrap_gsl_set_stream_handler},
2383 {"Math::GSL::Errnoc::gsl_set_stream", _wrap_gsl_set_stream},
2384 {0,0}
2385 };
2386 /* -----------------------------------------------------------------------------
2387 * Type initialization:
2388 * This problem is tough by the requirement that no dynamic
2389 * memory is used. Also, since swig_type_info structures store pointers to
2390 * swig_cast_info structures and swig_cast_info structures store pointers back
2391 * to swig_type_info structures, we need some lookup code at initialization.
2392 * The idea is that swig generates all the structures that are needed.
2393 * The runtime then collects these partially filled structures.
2394 * The SWIG_InitializeModule function takes these initial arrays out of
2395 * swig_module, and does all the lookup, filling in the swig_module.types
2396 * array with the correct data and linking the correct swig_cast_info
2397 * structures together.
2398 *
2399 * The generated swig_type_info structures are assigned statically to an initial
2400 * array. We just loop through that array, and handle each type individually.
2401 * First we lookup if this type has been already loaded, and if so, use the
2402 * loaded structure instead of the generated one. Then we have to fill in the
2403 * cast linked list. The cast data is initially stored in something like a
2404 * two-dimensional array. Each row corresponds to a type (there are the same
2405 * number of rows as there are in the swig_type_initial array). Each entry in
2406 * a column is one of the swig_cast_info structures for that type.
2407 * The cast_initial array is actually an array of arrays, because each row has
2408 * a variable number of columns. So to actually build the cast linked list,
2409 * we find the array of casts associated with the type, and loop through it
2410 * adding the casts to the list. The one last trick we need to do is making
2411 * sure the type pointer in the swig_cast_info struct is correct.
2412 *
2413 * First off, we lookup the cast->type name to see if it is already loaded.
2414 * There are three cases to handle:
2415 * 1) If the cast->type has already been loaded AND the type we are adding
2416 * casting info to has not been loaded (it is in this module), THEN we
2417 * replace the cast->type pointer with the type pointer that has already
2418 * been loaded.
2419 * 2) If BOTH types (the one we are adding casting info to, and the
2420 * cast->type) are loaded, THEN the cast info has already been loaded by
2421 * the previous module so we just ignore it.
2422 * 3) Finally, if cast->type has not already been loaded, then we add that
2423 * swig_cast_info to the linked list (because the cast->type) pointer will
2424 * be correct.
2425 * ----------------------------------------------------------------------------- */
2426
2427 #ifdef __cplusplus
2428 extern "C" {
2429 #if 0
2430 } /* c-mode */
2431 #endif
2432 #endif
2433
2434 #if 0
2435 #define SWIGRUNTIME_DEBUG
2436 #endif
2437
2438
2439 SWIGRUNTIME void
SWIG_InitializeModule(void * clientdata)2440 SWIG_InitializeModule(void *clientdata) {
2441 size_t i;
2442 swig_module_info *module_head, *iter;
2443 int init;
2444
2445 /* check to see if the circular list has been setup, if not, set it up */
2446 if (swig_module.next==0) {
2447 /* Initialize the swig_module */
2448 swig_module.type_initial = swig_type_initial;
2449 swig_module.cast_initial = swig_cast_initial;
2450 swig_module.next = &swig_module;
2451 init = 1;
2452 } else {
2453 init = 0;
2454 }
2455
2456 /* Try and load any already created modules */
2457 module_head = SWIG_GetModule(clientdata);
2458 if (!module_head) {
2459 /* This is the first module loaded for this interpreter */
2460 /* so set the swig module into the interpreter */
2461 SWIG_SetModule(clientdata, &swig_module);
2462 } else {
2463 /* the interpreter has loaded a SWIG module, but has it loaded this one? */
2464 iter=module_head;
2465 do {
2466 if (iter==&swig_module) {
2467 /* Our module is already in the list, so there's nothing more to do. */
2468 return;
2469 }
2470 iter=iter->next;
2471 } while (iter!= module_head);
2472
2473 /* otherwise we must add our module into the list */
2474 swig_module.next = module_head->next;
2475 module_head->next = &swig_module;
2476 }
2477
2478 /* When multiple interpreters are used, a module could have already been initialized in
2479 a different interpreter, but not yet have a pointer in this interpreter.
2480 In this case, we do not want to continue adding types... everything should be
2481 set up already */
2482 if (init == 0) return;
2483
2484 /* Now work on filling in swig_module.types */
2485 #ifdef SWIGRUNTIME_DEBUG
2486 printf("SWIG_InitializeModule: size %lu\n", (unsigned long)swig_module.size);
2487 #endif
2488 for (i = 0; i < swig_module.size; ++i) {
2489 swig_type_info *type = 0;
2490 swig_type_info *ret;
2491 swig_cast_info *cast;
2492
2493 #ifdef SWIGRUNTIME_DEBUG
2494 printf("SWIG_InitializeModule: type %lu %s\n", (unsigned long)i, swig_module.type_initial[i]->name);
2495 #endif
2496
2497 /* if there is another module already loaded */
2498 if (swig_module.next != &swig_module) {
2499 type = SWIG_MangledTypeQueryModule(swig_module.next, &swig_module, swig_module.type_initial[i]->name);
2500 }
2501 if (type) {
2502 /* Overwrite clientdata field */
2503 #ifdef SWIGRUNTIME_DEBUG
2504 printf("SWIG_InitializeModule: found type %s\n", type->name);
2505 #endif
2506 if (swig_module.type_initial[i]->clientdata) {
2507 type->clientdata = swig_module.type_initial[i]->clientdata;
2508 #ifdef SWIGRUNTIME_DEBUG
2509 printf("SWIG_InitializeModule: found and overwrite type %s \n", type->name);
2510 #endif
2511 }
2512 } else {
2513 type = swig_module.type_initial[i];
2514 }
2515
2516 /* Insert casting types */
2517 cast = swig_module.cast_initial[i];
2518 while (cast->type) {
2519 /* Don't need to add information already in the list */
2520 ret = 0;
2521 #ifdef SWIGRUNTIME_DEBUG
2522 printf("SWIG_InitializeModule: look cast %s\n", cast->type->name);
2523 #endif
2524 if (swig_module.next != &swig_module) {
2525 ret = SWIG_MangledTypeQueryModule(swig_module.next, &swig_module, cast->type->name);
2526 #ifdef SWIGRUNTIME_DEBUG
2527 if (ret) printf("SWIG_InitializeModule: found cast %s\n", ret->name);
2528 #endif
2529 }
2530 if (ret) {
2531 if (type == swig_module.type_initial[i]) {
2532 #ifdef SWIGRUNTIME_DEBUG
2533 printf("SWIG_InitializeModule: skip old type %s\n", ret->name);
2534 #endif
2535 cast->type = ret;
2536 ret = 0;
2537 } else {
2538 /* Check for casting already in the list */
2539 swig_cast_info *ocast = SWIG_TypeCheck(ret->name, type);
2540 #ifdef SWIGRUNTIME_DEBUG
2541 if (ocast) printf("SWIG_InitializeModule: skip old cast %s\n", ret->name);
2542 #endif
2543 if (!ocast) ret = 0;
2544 }
2545 }
2546
2547 if (!ret) {
2548 #ifdef SWIGRUNTIME_DEBUG
2549 printf("SWIG_InitializeModule: adding cast %s\n", cast->type->name);
2550 #endif
2551 if (type->cast) {
2552 type->cast->prev = cast;
2553 cast->next = type->cast;
2554 }
2555 type->cast = cast;
2556 }
2557 cast++;
2558 }
2559 /* Set entry in modules->types array equal to the type */
2560 swig_module.types[i] = type;
2561 }
2562 swig_module.types[i] = 0;
2563
2564 #ifdef SWIGRUNTIME_DEBUG
2565 printf("**** SWIG_InitializeModule: Cast List ******\n");
2566 for (i = 0; i < swig_module.size; ++i) {
2567 int j = 0;
2568 swig_cast_info *cast = swig_module.cast_initial[i];
2569 printf("SWIG_InitializeModule: type %lu %s\n", (unsigned long)i, swig_module.type_initial[i]->name);
2570 while (cast->type) {
2571 printf("SWIG_InitializeModule: cast type %s\n", cast->type->name);
2572 cast++;
2573 ++j;
2574 }
2575 printf("---- Total casts: %d\n",j);
2576 }
2577 printf("**** SWIG_InitializeModule: Cast List ******\n");
2578 #endif
2579 }
2580
2581 /* This function will propagate the clientdata field of type to
2582 * any new swig_type_info structures that have been added into the list
2583 * of equivalent types. It is like calling
2584 * SWIG_TypeClientData(type, clientdata) a second time.
2585 */
2586 SWIGRUNTIME void
SWIG_PropagateClientData(void)2587 SWIG_PropagateClientData(void) {
2588 size_t i;
2589 swig_cast_info *equiv;
2590 static int init_run = 0;
2591
2592 if (init_run) return;
2593 init_run = 1;
2594
2595 for (i = 0; i < swig_module.size; i++) {
2596 if (swig_module.types[i]->clientdata) {
2597 equiv = swig_module.types[i]->cast;
2598 while (equiv) {
2599 if (!equiv->converter) {
2600 if (equiv->type && !equiv->type->clientdata)
2601 SWIG_TypeClientData(equiv->type, swig_module.types[i]->clientdata);
2602 }
2603 equiv = equiv->next;
2604 }
2605 }
2606 }
2607 }
2608
2609 #ifdef __cplusplus
2610 #if 0
2611 {
2612 /* c-mode */
2613 #endif
2614 }
2615 #endif
2616
2617
2618
2619 #if defined(__cplusplus) && ! defined(XSPROTO)
2620 extern "C"
2621 #endif
2622
XS(SWIG_init)2623 XS(SWIG_init) {
2624 dXSARGS;
2625 int i;
2626 (void)items;
2627
2628 SWIG_InitializeModule(0);
2629
2630 /* Install commands */
2631 for (i = 0; swig_commands[i].name; i++) {
2632 /* Casts only needed for Perl < 5.10. */
2633 #ifdef __cplusplus
2634 newXS(const_cast<char*>(swig_commands[i].name), swig_commands[i].wrapper, const_cast<char*>(__FILE__));
2635 #else
2636 newXS((char*)swig_commands[i].name, swig_commands[i].wrapper, (char*)__FILE__);
2637 #endif
2638 }
2639
2640 /* Install variables */
2641 for (i = 0; swig_variables[i].name; i++) {
2642 SV *sv;
2643 sv = get_sv(swig_variables[i].name, TRUE | 0x2 | GV_ADDMULTI);
2644 if (swig_variables[i].type) {
2645 SWIG_MakePtr(sv,(void *)1, *swig_variables[i].type,0);
2646 } else {
2647 sv_setiv(sv,(IV) 0);
2648 }
2649 swig_create_magic(sv, swig_variables[i].name, swig_variables[i].set, swig_variables[i].get);
2650 }
2651
2652 /* Install constant */
2653 for (i = 0; swig_constants[i].type; i++) {
2654 SV *sv;
2655 sv = get_sv(swig_constants[i].name, TRUE | 0x2 | GV_ADDMULTI);
2656 switch(swig_constants[i].type) {
2657 case SWIG_INT:
2658 sv_setiv(sv, (IV) swig_constants[i].lvalue);
2659 break;
2660 case SWIG_FLOAT:
2661 sv_setnv(sv, (double) swig_constants[i].dvalue);
2662 break;
2663 case SWIG_STRING:
2664 sv_setpv(sv, (const char *) swig_constants[i].pvalue);
2665 break;
2666 case SWIG_POINTER:
2667 SWIG_MakePtr(sv, swig_constants[i].pvalue, *(swig_constants[i].ptype),0);
2668 break;
2669 case SWIG_BINARY:
2670 SWIG_MakePackedObj(sv, swig_constants[i].pvalue, swig_constants[i].lvalue, *(swig_constants[i].ptype));
2671 break;
2672 default:
2673 break;
2674 }
2675 SvREADONLY_on(sv);
2676 }
2677
2678 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2679 SV *sv = get_sv((char*) SWIG_prefix "GSL_VERSION", TRUE | 0x2 | GV_ADDMULTI);
2680 sv_setsv(sv, SWIG_From_double SWIG_PERL_CALL_ARGS_1((double)(2.7)));
2681 SvREADONLY_on(sv);
2682 } while(0) /*@SWIG@*/;
2683 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2684 SV *sv = get_sv((char*) SWIG_prefix "GSL_MAJOR_VERSION", TRUE | 0x2 | GV_ADDMULTI);
2685 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(2)));
2686 SvREADONLY_on(sv);
2687 } while(0) /*@SWIG@*/;
2688 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2689 SV *sv = get_sv((char*) SWIG_prefix "GSL_MINOR_VERSION", TRUE | 0x2 | GV_ADDMULTI);
2690 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(7)));
2691 SvREADONLY_on(sv);
2692 } while(0) /*@SWIG@*/;
2693 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2694 SV *sv = get_sv((char*) SWIG_prefix "GSL_POSZERO", TRUE | 0x2 | GV_ADDMULTI);
2695 sv_setsv(sv, SWIG_From_double SWIG_PERL_CALL_ARGS_1((double)((+0.0))));
2696 SvREADONLY_on(sv);
2697 } while(0) /*@SWIG@*/;
2698 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2699 SV *sv = get_sv((char*) SWIG_prefix "GSL_NEGZERO", TRUE | 0x2 | GV_ADDMULTI);
2700 sv_setsv(sv, SWIG_From_double SWIG_PERL_CALL_ARGS_1((double)((-0.0))));
2701 SvREADONLY_on(sv);
2702 } while(0) /*@SWIG@*/;
2703 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2704 SV *sv = get_sv((char*) SWIG_prefix "GSL_SUCCESS", TRUE | 0x2 | GV_ADDMULTI);
2705 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_SUCCESS)));
2706 SvREADONLY_on(sv);
2707 } while(0) /*@SWIG@*/;
2708 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2709 SV *sv = get_sv((char*) SWIG_prefix "GSL_FAILURE", TRUE | 0x2 | GV_ADDMULTI);
2710 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_FAILURE)));
2711 SvREADONLY_on(sv);
2712 } while(0) /*@SWIG@*/;
2713 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2714 SV *sv = get_sv((char*) SWIG_prefix "GSL_CONTINUE", TRUE | 0x2 | GV_ADDMULTI);
2715 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_CONTINUE)));
2716 SvREADONLY_on(sv);
2717 } while(0) /*@SWIG@*/;
2718 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2719 SV *sv = get_sv((char*) SWIG_prefix "GSL_EDOM", TRUE | 0x2 | GV_ADDMULTI);
2720 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_EDOM)));
2721 SvREADONLY_on(sv);
2722 } while(0) /*@SWIG@*/;
2723 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2724 SV *sv = get_sv((char*) SWIG_prefix "GSL_ERANGE", TRUE | 0x2 | GV_ADDMULTI);
2725 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_ERANGE)));
2726 SvREADONLY_on(sv);
2727 } while(0) /*@SWIG@*/;
2728 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2729 SV *sv = get_sv((char*) SWIG_prefix "GSL_EFAULT", TRUE | 0x2 | GV_ADDMULTI);
2730 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_EFAULT)));
2731 SvREADONLY_on(sv);
2732 } while(0) /*@SWIG@*/;
2733 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2734 SV *sv = get_sv((char*) SWIG_prefix "GSL_EINVAL", TRUE | 0x2 | GV_ADDMULTI);
2735 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_EINVAL)));
2736 SvREADONLY_on(sv);
2737 } while(0) /*@SWIG@*/;
2738 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2739 SV *sv = get_sv((char*) SWIG_prefix "GSL_EFAILED", TRUE | 0x2 | GV_ADDMULTI);
2740 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_EFAILED)));
2741 SvREADONLY_on(sv);
2742 } while(0) /*@SWIG@*/;
2743 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2744 SV *sv = get_sv((char*) SWIG_prefix "GSL_EFACTOR", TRUE | 0x2 | GV_ADDMULTI);
2745 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_EFACTOR)));
2746 SvREADONLY_on(sv);
2747 } while(0) /*@SWIG@*/;
2748 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2749 SV *sv = get_sv((char*) SWIG_prefix "GSL_ESANITY", TRUE | 0x2 | GV_ADDMULTI);
2750 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_ESANITY)));
2751 SvREADONLY_on(sv);
2752 } while(0) /*@SWIG@*/;
2753 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2754 SV *sv = get_sv((char*) SWIG_prefix "GSL_ENOMEM", TRUE | 0x2 | GV_ADDMULTI);
2755 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_ENOMEM)));
2756 SvREADONLY_on(sv);
2757 } while(0) /*@SWIG@*/;
2758 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2759 SV *sv = get_sv((char*) SWIG_prefix "GSL_EBADFUNC", TRUE | 0x2 | GV_ADDMULTI);
2760 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_EBADFUNC)));
2761 SvREADONLY_on(sv);
2762 } while(0) /*@SWIG@*/;
2763 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2764 SV *sv = get_sv((char*) SWIG_prefix "GSL_ERUNAWAY", TRUE | 0x2 | GV_ADDMULTI);
2765 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_ERUNAWAY)));
2766 SvREADONLY_on(sv);
2767 } while(0) /*@SWIG@*/;
2768 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2769 SV *sv = get_sv((char*) SWIG_prefix "GSL_EMAXITER", TRUE | 0x2 | GV_ADDMULTI);
2770 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_EMAXITER)));
2771 SvREADONLY_on(sv);
2772 } while(0) /*@SWIG@*/;
2773 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2774 SV *sv = get_sv((char*) SWIG_prefix "GSL_EZERODIV", TRUE | 0x2 | GV_ADDMULTI);
2775 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_EZERODIV)));
2776 SvREADONLY_on(sv);
2777 } while(0) /*@SWIG@*/;
2778 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2779 SV *sv = get_sv((char*) SWIG_prefix "GSL_EBADTOL", TRUE | 0x2 | GV_ADDMULTI);
2780 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_EBADTOL)));
2781 SvREADONLY_on(sv);
2782 } while(0) /*@SWIG@*/;
2783 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2784 SV *sv = get_sv((char*) SWIG_prefix "GSL_ETOL", TRUE | 0x2 | GV_ADDMULTI);
2785 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_ETOL)));
2786 SvREADONLY_on(sv);
2787 } while(0) /*@SWIG@*/;
2788 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2789 SV *sv = get_sv((char*) SWIG_prefix "GSL_EUNDRFLW", TRUE | 0x2 | GV_ADDMULTI);
2790 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_EUNDRFLW)));
2791 SvREADONLY_on(sv);
2792 } while(0) /*@SWIG@*/;
2793 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2794 SV *sv = get_sv((char*) SWIG_prefix "GSL_EOVRFLW", TRUE | 0x2 | GV_ADDMULTI);
2795 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_EOVRFLW)));
2796 SvREADONLY_on(sv);
2797 } while(0) /*@SWIG@*/;
2798 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2799 SV *sv = get_sv((char*) SWIG_prefix "GSL_ELOSS", TRUE | 0x2 | GV_ADDMULTI);
2800 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_ELOSS)));
2801 SvREADONLY_on(sv);
2802 } while(0) /*@SWIG@*/;
2803 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2804 SV *sv = get_sv((char*) SWIG_prefix "GSL_EROUND", TRUE | 0x2 | GV_ADDMULTI);
2805 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_EROUND)));
2806 SvREADONLY_on(sv);
2807 } while(0) /*@SWIG@*/;
2808 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2809 SV *sv = get_sv((char*) SWIG_prefix "GSL_EBADLEN", TRUE | 0x2 | GV_ADDMULTI);
2810 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_EBADLEN)));
2811 SvREADONLY_on(sv);
2812 } while(0) /*@SWIG@*/;
2813 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2814 SV *sv = get_sv((char*) SWIG_prefix "GSL_ENOTSQR", TRUE | 0x2 | GV_ADDMULTI);
2815 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_ENOTSQR)));
2816 SvREADONLY_on(sv);
2817 } while(0) /*@SWIG@*/;
2818 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2819 SV *sv = get_sv((char*) SWIG_prefix "GSL_ESING", TRUE | 0x2 | GV_ADDMULTI);
2820 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_ESING)));
2821 SvREADONLY_on(sv);
2822 } while(0) /*@SWIG@*/;
2823 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2824 SV *sv = get_sv((char*) SWIG_prefix "GSL_EDIVERGE", TRUE | 0x2 | GV_ADDMULTI);
2825 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_EDIVERGE)));
2826 SvREADONLY_on(sv);
2827 } while(0) /*@SWIG@*/;
2828 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2829 SV *sv = get_sv((char*) SWIG_prefix "GSL_EUNSUP", TRUE | 0x2 | GV_ADDMULTI);
2830 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_EUNSUP)));
2831 SvREADONLY_on(sv);
2832 } while(0) /*@SWIG@*/;
2833 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2834 SV *sv = get_sv((char*) SWIG_prefix "GSL_EUNIMPL", TRUE | 0x2 | GV_ADDMULTI);
2835 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_EUNIMPL)));
2836 SvREADONLY_on(sv);
2837 } while(0) /*@SWIG@*/;
2838 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2839 SV *sv = get_sv((char*) SWIG_prefix "GSL_ECACHE", TRUE | 0x2 | GV_ADDMULTI);
2840 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_ECACHE)));
2841 SvREADONLY_on(sv);
2842 } while(0) /*@SWIG@*/;
2843 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2844 SV *sv = get_sv((char*) SWIG_prefix "GSL_ETABLE", TRUE | 0x2 | GV_ADDMULTI);
2845 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_ETABLE)));
2846 SvREADONLY_on(sv);
2847 } while(0) /*@SWIG@*/;
2848 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2849 SV *sv = get_sv((char*) SWIG_prefix "GSL_ENOPROG", TRUE | 0x2 | GV_ADDMULTI);
2850 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_ENOPROG)));
2851 SvREADONLY_on(sv);
2852 } while(0) /*@SWIG@*/;
2853 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2854 SV *sv = get_sv((char*) SWIG_prefix "GSL_ENOPROGJ", TRUE | 0x2 | GV_ADDMULTI);
2855 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_ENOPROGJ)));
2856 SvREADONLY_on(sv);
2857 } while(0) /*@SWIG@*/;
2858 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2859 SV *sv = get_sv((char*) SWIG_prefix "GSL_ETOLF", TRUE | 0x2 | GV_ADDMULTI);
2860 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_ETOLF)));
2861 SvREADONLY_on(sv);
2862 } while(0) /*@SWIG@*/;
2863 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2864 SV *sv = get_sv((char*) SWIG_prefix "GSL_ETOLX", TRUE | 0x2 | GV_ADDMULTI);
2865 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_ETOLX)));
2866 SvREADONLY_on(sv);
2867 } while(0) /*@SWIG@*/;
2868 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2869 SV *sv = get_sv((char*) SWIG_prefix "GSL_ETOLG", TRUE | 0x2 | GV_ADDMULTI);
2870 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_ETOLG)));
2871 SvREADONLY_on(sv);
2872 } while(0) /*@SWIG@*/;
2873 /*@SWIG:/usr/share/swig4.0/perl5/perltypemaps.swg,65,%set_constant@*/ do {
2874 SV *sv = get_sv((char*) SWIG_prefix "GSL_EOF", TRUE | 0x2 | GV_ADDMULTI);
2875 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_EOF)));
2876 SvREADONLY_on(sv);
2877 } while(0) /*@SWIG@*/;
2878 ST(0) = &PL_sv_yes;
2879 XSRETURN(1);
2880 }
2881
2882