1 /* ----------------------------------------------------------------------------
2 * This file was automatically generated by SWIG (http://www.swig.org).
5 * This file is not intended to be easily readable and contains a number of
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 * ----------------------------------------------------------------------------- */
12 #define SWIG_CASTRANK_MODE
14 /* -----------------------------------------------------------------------------
15 * This section contains generic SWIG labels for method/variable
16 * declarations/attributes, and other compiler dependent labels.
17 * ----------------------------------------------------------------------------- */
19 /* template workaround for compilers that cannot correctly implement the C++ standard */
20 #ifndef SWIGTEMPLATEDISAMBIGUATOR
21 # if defined(__SUNPRO_CC) && (__SUNPRO_CC <= 0x560)
22 # define SWIGTEMPLATEDISAMBIGUATOR template
23 # elif defined(__HP_aCC)
24 /* Needed even with `aCC -AA' when `aCC -V' reports HP ANSI C++ B3910B A.03.55 */
25 /* If we find a maximum version that requires this, the test would be __HP_aCC <= 35500 for A.03.55 */
26 # define SWIGTEMPLATEDISAMBIGUATOR template
28 # define SWIGTEMPLATEDISAMBIGUATOR
32 /* inline attribute */
34 # if defined(__cplusplus) || (defined(__GNUC__) && !defined(__STRICT_ANSI__))
35 # define SWIGINLINE inline
41 /* attribute recognised by some compilers to avoid 'unused' warnings */
43 # if defined(__GNUC__)
44 # if !(defined(__cplusplus)) || (__GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4))
45 # define SWIGUNUSED __attribute__ ((__unused__))
50 # define SWIGUNUSED __attribute__ ((__unused__))
56 #ifndef SWIG_MSC_UNSUPPRESS_4505
57 # if defined(_MSC_VER)
58 # pragma warning(disable : 4505) /* unreferenced local function has been removed */
62 #ifndef SWIGUNUSEDPARM
64 # define SWIGUNUSEDPARM(p)
66 # define SWIGUNUSEDPARM(p) p SWIGUNUSED
70 /* internal SWIG method */
72 # define SWIGINTERN static SWIGUNUSED
75 /* internal inline SWIG method */
76 #ifndef SWIGINTERNINLINE
77 # define SWIGINTERNINLINE SWIGINTERN SWIGINLINE
80 /* exporting methods */
81 #if (__GNUC__ >= 4) || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4)
82 # ifndef GCC_HASCLASSVISIBILITY
83 # define GCC_HASCLASSVISIBILITY
88 # if defined(_WIN32) || defined(__WIN32__) || defined(__CYGWIN__)
89 # if defined(STATIC_LINKED)
92 # define SWIGEXPORT __declspec(dllexport)
95 # if defined(__GNUC__) && defined(GCC_HASCLASSVISIBILITY)
96 # define SWIGEXPORT __attribute__ ((visibility("default")))
103 /* calling conventions for Windows */
105 # if defined(_WIN32) || defined(__WIN32__) || defined(__CYGWIN__)
106 # define SWIGSTDCALL __stdcall
112 /* Deal with Microsoft's attempt at deprecating C standard runtime functions */
113 #if !defined(SWIG_NO_CRT_SECURE_NO_DEPRECATE) && defined(_MSC_VER) && !defined(_CRT_SECURE_NO_DEPRECATE)
114 # define _CRT_SECURE_NO_DEPRECATE
117 /* Deal with Microsoft's attempt at deprecating methods in the standard C++ library */
118 #if !defined(SWIG_NO_SCL_SECURE_NO_DEPRECATE) && defined(_MSC_VER) && !defined(_SCL_SECURE_NO_DEPRECATE)
119 # define _SCL_SECURE_NO_DEPRECATE
123 /* -----------------------------------------------------------------------------
126 * This file contains generic C API SWIG runtime support for pointer
128 * ----------------------------------------------------------------------------- */
130 /* This should only be incremented when either the layout of swig_type_info changes,
131 or for whatever reason, the runtime changes incompatibly */
132 #define SWIG_RUNTIME_VERSION "4"
134 /* define SWIG_TYPE_TABLE_NAME as "SWIG_TYPE_TABLE" */
135 #ifdef SWIG_TYPE_TABLE
136 # define SWIG_QUOTE_STRING(x) #x
137 # define SWIG_EXPAND_AND_QUOTE_STRING(x) SWIG_QUOTE_STRING(x)
138 # define SWIG_TYPE_TABLE_NAME SWIG_EXPAND_AND_QUOTE_STRING(SWIG_TYPE_TABLE)
140 # define SWIG_TYPE_TABLE_NAME
144 You can use the SWIGRUNTIME and SWIGRUNTIMEINLINE macros for
145 creating a static or dynamic library from the SWIG runtime code.
146 In 99.9% of the cases, SWIG just needs to declare them as 'static'.
148 But only do this if strictly necessary, ie, if you have problems
149 with your compiler or suchlike.
153 # define SWIGRUNTIME SWIGINTERN
156 #ifndef SWIGRUNTIMEINLINE
157 # define SWIGRUNTIMEINLINE SWIGRUNTIME SWIGINLINE
160 /* Generic buffer size */
161 #ifndef SWIG_BUFFER_SIZE
162 # define SWIG_BUFFER_SIZE 1024
165 /* Flags for pointer conversions */
166 #define SWIG_POINTER_DISOWN 0x1
167 #define SWIG_CAST_NEW_MEMORY 0x2
169 /* Flags for new pointer objects */
170 #define SWIG_POINTER_OWN 0x1
174 Flags/methods for returning states.
176 The SWIG conversion methods, as ConvertPtr, return and integer
177 that tells if the conversion was successful or not. And if not,
178 an error code can be returned (see swigerrors.swg for the codes).
180 Use the following macros/flags to set or process the returning
183 In old versions of SWIG, code such as the following was usually written:
185 if (SWIG_ConvertPtr(obj,vptr,ty.flags) != -1) {
191 Now you can be more explicit:
193 int res = SWIG_ConvertPtr(obj,vptr,ty.flags);
194 if (SWIG_IsOK(res)) {
200 which is the same really, but now you can also do
203 int res = SWIG_ConvertPtr(obj,(void **)(&ptr),ty.flags);
204 if (SWIG_IsOK(res)) {
206 if (SWIG_IsNewObj(res) {
216 I.e., now SWIG_ConvertPtr can return new objects and you can
217 identify the case and take care of the deallocation. Of course that
218 also requires SWIG_ConvertPtr to return new result values, such as
220 int SWIG_ConvertPtr(obj, ptr,...) {
222 if (<need new object>) {
223 *ptr = <ptr to new allocated object>;
226 *ptr = <ptr to old object>;
234 Of course, returning the plain '0(success)/-1(fail)' still works, but you can be
235 more explicit by returning SWIG_BADOBJ, SWIG_ERROR or any of the
238 Finally, if the SWIG_CASTRANK_MODE is enabled, the result code
239 allows to return the 'cast rank', for example, if you have this
246 food(1) // cast rank '1' (1 -> 1.0)
247 fooi(1) // cast rank '0'
249 just use the SWIG_AddCast()/SWIG_CheckState()
253 #define SWIG_ERROR (-1)
254 #define SWIG_IsOK(r) (r >= 0)
255 #define SWIG_ArgError(r) ((r != SWIG_ERROR) ? r : SWIG_TypeError)
257 /* The CastRankLimit says how many bits are used for the cast rank */
258 #define SWIG_CASTRANKLIMIT (1 << 8)
259 /* The NewMask denotes the object was created (using new/malloc) */
260 #define SWIG_NEWOBJMASK (SWIG_CASTRANKLIMIT << 1)
261 /* The TmpMask is for in/out typemaps that use temporal objects */
262 #define SWIG_TMPOBJMASK (SWIG_NEWOBJMASK << 1)
263 /* Simple returning values */
264 #define SWIG_BADOBJ (SWIG_ERROR)
265 #define SWIG_OLDOBJ (SWIG_OK)
266 #define SWIG_NEWOBJ (SWIG_OK | SWIG_NEWOBJMASK)
267 #define SWIG_TMPOBJ (SWIG_OK | SWIG_TMPOBJMASK)
268 /* Check, add and del mask methods */
269 #define SWIG_AddNewMask(r) (SWIG_IsOK(r) ? (r | SWIG_NEWOBJMASK) : r)
270 #define SWIG_DelNewMask(r) (SWIG_IsOK(r) ? (r & ~SWIG_NEWOBJMASK) : r)
271 #define SWIG_IsNewObj(r) (SWIG_IsOK(r) && (r & SWIG_NEWOBJMASK))
272 #define SWIG_AddTmpMask(r) (SWIG_IsOK(r) ? (r | SWIG_TMPOBJMASK) : r)
273 #define SWIG_DelTmpMask(r) (SWIG_IsOK(r) ? (r & ~SWIG_TMPOBJMASK) : r)
274 #define SWIG_IsTmpObj(r) (SWIG_IsOK(r) && (r & SWIG_TMPOBJMASK))
277 #if defined(SWIG_CASTRANK_MODE)
278 # ifndef SWIG_TypeRank
279 # define SWIG_TypeRank unsigned long
281 # ifndef SWIG_MAXCASTRANK /* Default cast allowed */
282 # define SWIG_MAXCASTRANK (2)
284 # define SWIG_CASTRANKMASK ((SWIG_CASTRANKLIMIT) -1)
285 # define SWIG_CastRank(r) (r & SWIG_CASTRANKMASK)
286 SWIGINTERNINLINE int SWIG_AddCast(int r) {
287 return SWIG_IsOK(r) ? ((SWIG_CastRank(r) < SWIG_MAXCASTRANK) ? (r + 1) : SWIG_ERROR) : r;
289 SWIGINTERNINLINE int SWIG_CheckState(int r) {
290 return SWIG_IsOK(r) ? SWIG_CastRank(r) + 1 : 0;
292 #else /* no cast-rank mode */
293 # define SWIG_AddCast
294 # define SWIG_CheckState(r) (SWIG_IsOK(r) ? 1 : 0)
304 typedef void *(*swig_converter_func)(void *, int *);
305 typedef struct swig_type_info *(*swig_dycast_func)(void **);
307 /* Structure to store information on one type */
308 typedef struct swig_type_info {
309 const char *name; /* mangled name of this type */
310 const char *str; /* human readable name of this type */
311 swig_dycast_func dcast; /* dynamic cast function down a hierarchy */
312 struct swig_cast_info *cast; /* linked list of types that can cast into this type */
313 void *clientdata; /* language specific type data */
314 int owndata; /* flag if the structure owns the clientdata */
317 /* Structure to store a type and conversion function used for casting */
318 typedef struct swig_cast_info {
319 swig_type_info *type; /* pointer to type that is equivalent to this type */
320 swig_converter_func converter; /* function to cast the void pointers */
321 struct swig_cast_info *next; /* pointer to next cast in linked list */
322 struct swig_cast_info *prev; /* pointer to the previous cast */
325 /* Structure used to store module information
326 * Each module generates one structure like this, and the runtime collects
327 * all of these structures and stores them in a circularly linked list.*/
328 typedef struct swig_module_info {
329 swig_type_info **types; /* Array of pointers to swig_type_info structures that are in this module */
330 size_t size; /* Number of types in this module */
331 struct swig_module_info *next; /* Pointer to next element in circularly linked list */
332 swig_type_info **type_initial; /* Array of initially generated type structures */
333 swig_cast_info **cast_initial; /* Array of initially generated casting structures */
334 void *clientdata; /* Language specific module data */
338 Compare two type names skipping the space characters, therefore
339 "char*" == "char *" and "Class<int>" == "Class<int >", etc.
341 Return 0 when the two name types are equivalent, as in
342 strncmp, but skipping ' '.
345 SWIG_TypeNameComp(const char *f1, const char *l1,
346 const char *f2, const char *l2) {
347 for (;(f1 != l1) && (f2 != l2); ++f1, ++f2) {
348 while ((*f1 == ' ') && (f1 != l1)) ++f1;
349 while ((*f2 == ' ') && (f2 != l2)) ++f2;
350 if (*f1 != *f2) return (*f1 > *f2) ? 1 : -1;
352 return (int)((l1 - f1) - (l2 - f2));
356 Check type equivalence in a name list like <name1>|<name2>|...
357 Return 0 if not equal, 1 if equal
360 SWIG_TypeEquiv(const char *nb, const char *tb) {
362 const char* te = tb + strlen(tb);
364 while (!equiv && *ne) {
365 for (nb = ne; *ne; ++ne) {
366 if (*ne == '|') break;
368 equiv = (SWIG_TypeNameComp(nb, ne, tb, te) == 0) ? 1 : 0;
375 Check type equivalence in a name list like <name1>|<name2>|...
376 Return 0 if equal, -1 if nb < tb, 1 if nb > tb
379 SWIG_TypeCompare(const char *nb, const char *tb) {
381 const char* te = tb + strlen(tb);
383 while (!equiv && *ne) {
384 for (nb = ne; *ne; ++ne) {
385 if (*ne == '|') break;
387 equiv = (SWIG_TypeNameComp(nb, ne, tb, te) == 0) ? 1 : 0;
397 SWIGRUNTIME swig_cast_info *
398 SWIG_TypeCheck(const char *c, swig_type_info *ty) {
400 swig_cast_info *iter = ty->cast;
402 if (strcmp(iter->type->name, c) == 0) {
403 if (iter == ty->cast)
405 /* Move iter to the top of the linked list */
406 iter->prev->next = iter->next;
408 iter->next->prev = iter->prev;
409 iter->next = ty->cast;
411 if (ty->cast) ty->cast->prev = iter;
422 Identical to SWIG_TypeCheck, except strcmp is replaced with a pointer comparison
424 SWIGRUNTIME swig_cast_info *
425 SWIG_TypeCheckStruct(swig_type_info *from, swig_type_info *ty) {
427 swig_cast_info *iter = ty->cast;
429 if (iter->type == from) {
430 if (iter == ty->cast)
432 /* Move iter to the top of the linked list */
433 iter->prev->next = iter->next;
435 iter->next->prev = iter->prev;
436 iter->next = ty->cast;
438 if (ty->cast) ty->cast->prev = iter;
449 Cast a pointer up an inheritance hierarchy
451 SWIGRUNTIMEINLINE void *
452 SWIG_TypeCast(swig_cast_info *ty, void *ptr, int *newmemory) {
453 return ((!ty) || (!ty->converter)) ? ptr : (*ty->converter)(ptr, newmemory);
457 Dynamic pointer casting. Down an inheritance hierarchy
459 SWIGRUNTIME swig_type_info *
460 SWIG_TypeDynamicCast(swig_type_info *ty, void **ptr) {
461 swig_type_info *lastty = ty;
462 if (!ty || !ty->dcast) return ty;
463 while (ty && (ty->dcast)) {
464 ty = (*ty->dcast)(ptr);
471 Return the name associated with this type
473 SWIGRUNTIMEINLINE const char *
474 SWIG_TypeName(const swig_type_info *ty) {
479 Return the pretty name associated with this type,
480 that is an unmangled type name in a form presentable to the user.
482 SWIGRUNTIME const char *
483 SWIG_TypePrettyName(const swig_type_info *type) {
484 /* The "str" field contains the equivalent pretty names of the
485 type, separated by vertical-bar characters. We choose
486 to print the last name, as it is often (?) the most
488 if (!type) return NULL;
489 if (type->str != NULL) {
490 const char *last_name = type->str;
492 for (s = type->str; *s; s++)
493 if (*s == '|') last_name = s+1;
501 Set the clientdata field for a type
504 SWIG_TypeClientData(swig_type_info *ti, void *clientdata) {
505 swig_cast_info *cast = ti->cast;
506 /* if (ti->clientdata == clientdata) return; */
507 ti->clientdata = clientdata;
510 if (!cast->converter) {
511 swig_type_info *tc = cast->type;
512 if (!tc->clientdata) {
513 SWIG_TypeClientData(tc, clientdata);
520 SWIG_TypeNewClientData(swig_type_info *ti, void *clientdata) {
521 SWIG_TypeClientData(ti, clientdata);
526 Search for a swig_type_info structure only by mangled name
527 Search is a O(log #types)
529 We start searching at module start, and finish searching when start == end.
530 Note: if start == end at the beginning of the function, we go all the way around
533 SWIGRUNTIME swig_type_info *
534 SWIG_MangledTypeQueryModule(swig_module_info *start,
535 swig_module_info *end,
537 swig_module_info *iter = start;
540 register size_t l = 0;
541 register size_t r = iter->size - 1;
543 /* since l+r >= 0, we can (>> 1) instead (/ 2) */
544 register size_t i = (l + r) >> 1;
545 const char *iname = iter->types[i]->name;
547 register int compare = strcmp(name, iname);
549 return iter->types[i];
550 } else if (compare < 0) {
556 } else if (compare > 0) {
560 break; /* should never happen */
565 } while (iter != end);
570 Search for a swig_type_info structure for either a mangled name or a human readable name.
571 It first searches the mangled names of the types, which is a O(log #types)
572 If a type is not found it then searches the human readable names, which is O(#types).
574 We start searching at module start, and finish searching when start == end.
575 Note: if start == end at the beginning of the function, we go all the way around
578 SWIGRUNTIME swig_type_info *
579 SWIG_TypeQueryModule(swig_module_info *start,
580 swig_module_info *end,
582 /* STEP 1: Search the name field using binary search */
583 swig_type_info *ret = SWIG_MangledTypeQueryModule(start, end, name);
587 /* STEP 2: If the type hasn't been found, do a complete search
588 of the str field (the human readable name) */
589 swig_module_info *iter = start;
591 register size_t i = 0;
592 for (; i < iter->size; ++i) {
593 if (iter->types[i]->str && (SWIG_TypeEquiv(iter->types[i]->str, name)))
594 return iter->types[i];
597 } while (iter != end);
600 /* neither found a match */
605 Pack binary data into a string
608 SWIG_PackData(char *c, void *ptr, size_t sz) {
609 static const char hex[17] = "0123456789abcdef";
610 register const unsigned char *u = (unsigned char *) ptr;
611 register const unsigned char *eu = u + sz;
612 for (; u != eu; ++u) {
613 register unsigned char uu = *u;
614 *(c++) = hex[(uu & 0xf0) >> 4];
615 *(c++) = hex[uu & 0xf];
621 Unpack binary data from a string
623 SWIGRUNTIME const char *
624 SWIG_UnpackData(const char *c, void *ptr, size_t sz) {
625 register unsigned char *u = (unsigned char *) ptr;
626 register const unsigned char *eu = u + sz;
627 for (; u != eu; ++u) {
628 register char d = *(c++);
629 register unsigned char uu;
630 if ((d >= '0') && (d <= '9'))
631 uu = ((d - '0') << 4);
632 else if ((d >= 'a') && (d <= 'f'))
633 uu = ((d - ('a'-10)) << 4);
637 if ((d >= '0') && (d <= '9'))
639 else if ((d >= 'a') && (d <= 'f'))
640 uu |= (d - ('a'-10));
649 Pack 'void *' into a string buffer.
652 SWIG_PackVoidPtr(char *buff, void *ptr, const char *name, size_t bsz) {
654 if ((2*sizeof(void *) + 2) > bsz) return 0;
656 r = SWIG_PackData(r,&ptr,sizeof(void *));
657 if (strlen(name) + 1 > (bsz - (r - buff))) return 0;
662 SWIGRUNTIME const char *
663 SWIG_UnpackVoidPtr(const char *c, void **ptr, const char *name) {
665 if (strcmp(c,"NULL") == 0) {
672 return SWIG_UnpackData(++c,ptr,sizeof(void *));
676 SWIG_PackDataName(char *buff, void *ptr, size_t sz, const char *name, size_t bsz) {
678 size_t lname = (name ? strlen(name) : 0);
679 if ((2*sz + 2 + lname) > bsz) return 0;
681 r = SWIG_PackData(r,ptr,sz);
683 strncpy(r,name,lname+1);
690 SWIGRUNTIME const char *
691 SWIG_UnpackDataName(const char *c, void *ptr, size_t sz, const char *name) {
693 if (strcmp(c,"NULL") == 0) {
700 return SWIG_UnpackData(++c,ptr,sz);
708 #define SWIG_UnknownError -1
709 #define SWIG_IOError -2
710 #define SWIG_RuntimeError -3
711 #define SWIG_IndexError -4
712 #define SWIG_TypeError -5
713 #define SWIG_DivisionByZero -6
714 #define SWIG_OverflowError -7
715 #define SWIG_SyntaxError -8
716 #define SWIG_ValueError -9
717 #define SWIG_SystemError -10
718 #define SWIG_AttributeError -11
719 #define SWIG_MemoryError -12
720 #define SWIG_NullReferenceError -13
725 /* Needed on some windows machines---since MS plays funny games with the header files under C++ */
734 /* Add in functionality missing in older versions of Perl. Much of this is based on Devel-PPPort on cpan. */
736 /* Add PERL_REVISION, PERL_VERSION, PERL_SUBVERSION if missing */
737 #ifndef PERL_REVISION
738 # if !defined(__PATCHLEVEL_H_INCLUDED__) && !(defined(PATCHLEVEL) && defined(SUBVERSION))
739 # define PERL_PATCHLEVEL_H_IMPLICIT
740 # include <patchlevel.h>
742 # if !(defined(PERL_VERSION) || (defined(SUBVERSION) && defined(PATCHLEVEL)))
743 # include <could_not_find_Perl_patchlevel.h>
745 # ifndef PERL_REVISION
746 # define PERL_REVISION (5)
747 # define PERL_VERSION PATCHLEVEL
748 # define PERL_SUBVERSION SUBVERSION
752 #if defined(WIN32) && defined(PERL_OBJECT) && !defined(PerlIO_exportFILE)
753 #define PerlIO_exportFILE(fh,fl) (FILE*)(fh)
757 # define SvIOK_UV(sv) (SvIOK(sv) && (SvUVX(sv) == SvIVX(sv)))
761 # define SvUOK(sv) SvIOK_UV(sv)
764 #if ((PERL_VERSION < 4) || ((PERL_VERSION == 4) && (PERL_SUBVERSION <= 5)))
765 # define PL_sv_undef sv_undef
767 # define PL_errgv errgv
768 # define PL_sv_no sv_no
769 # define PL_sv_yes sv_yes
770 # define PL_markstack_ptr markstack_ptr
775 # define IVSIZE LONGSIZE
777 # define IVSIZE 4 /* A bold guess, but the best we can make. */
782 # if (IVSIZE == PTRSIZE) && (UVSIZE == PTRSIZE)
784 # define INT2PTR(any,d) (any)(d)
786 # if PTRSIZE == LONGSIZE
787 # define PTRV unsigned long
789 # define PTRV unsigned
791 # define INT2PTR(any,d) (any)(PTRV)(d)
794 # define NUM2PTR(any,d) (any)(PTRV)(d)
795 # define PTR2IV(p) INT2PTR(IV,p)
796 # define PTR2UV(p) INT2PTR(UV,p)
797 # define PTR2NV(p) NUM2PTR(NV,p)
799 # if PTRSIZE == LONGSIZE
800 # define PTR2ul(p) (unsigned long)(p)
802 # define PTR2ul(p) INT2PTR(unsigned long,p)
804 #endif /* !INT2PTR */
807 # define SvPV_nolen(x) SvPV(x,PL_na)
811 # define get_sv perl_get_sv
815 # define ERRSV get_sv("@",FALSE)
827 /* -----------------------------------------------------------------------------
829 * ----------------------------------------------------------------------------- */
831 SWIGINTERN const char*
832 SWIG_Perl_ErrorType(int code) {
833 const char* type = 0;
835 case SWIG_MemoryError:
836 type = "MemoryError";
841 case SWIG_RuntimeError:
842 type = "RuntimeError";
844 case SWIG_IndexError:
850 case SWIG_DivisionByZero:
851 type = "ZeroDivisionError";
853 case SWIG_OverflowError:
854 type = "OverflowError";
856 case SWIG_SyntaxError:
857 type = "SyntaxError";
859 case SWIG_ValueError:
862 case SWIG_SystemError:
863 type = "SystemError";
865 case SWIG_AttributeError:
866 type = "AttributeError";
869 type = "RuntimeError";
877 /* -----------------------------------------------------------------------------
880 * This file contains the runtime support for Perl modules
881 * and includes code for managing global variables and pointer
883 * ----------------------------------------------------------------------------- */
886 #define SWIG_PERL_OBJECT_DECL CPerlObj *SWIGUNUSEDPARM(pPerl),
887 #define SWIG_PERL_OBJECT_CALL pPerl,
889 #define SWIG_PERL_OBJECT_DECL
890 #define SWIG_PERL_OBJECT_CALL
893 /* Common SWIG API */
895 /* for raw pointers */
896 #define SWIG_ConvertPtr(obj, pp, type, flags) SWIG_Perl_ConvertPtr(SWIG_PERL_OBJECT_CALL obj, pp, type, flags)
897 #define SWIG_NewPointerObj(p, type, flags) SWIG_Perl_NewPointerObj(SWIG_PERL_OBJECT_CALL p, type, flags)
899 /* for raw packed data */
900 #define SWIG_ConvertPacked(obj, p, s, type) SWIG_Perl_ConvertPacked(SWIG_PERL_OBJECT_CALL obj, p, s, type)
901 #define SWIG_NewPackedObj(p, s, type) SWIG_Perl_NewPackedObj(SWIG_PERL_OBJECT_CALL p, s, type)
903 /* for class or struct pointers */
904 #define SWIG_ConvertInstance(obj, pptr, type, flags) SWIG_ConvertPtr(obj, pptr, type, flags)
905 #define SWIG_NewInstanceObj(ptr, type, flags) SWIG_NewPointerObj(ptr, type, flags)
907 /* for C or C++ function pointers */
908 #define SWIG_ConvertFunctionPtr(obj, pptr, type) SWIG_ConvertPtr(obj, pptr, type, 0)
909 #define SWIG_NewFunctionPtrObj(ptr, type) SWIG_NewPointerObj(ptr, type, 0)
911 /* for C++ member pointers, ie, member methods */
912 #define SWIG_ConvertMember(obj, ptr, sz, ty) SWIG_ConvertPacked(obj, ptr, sz, ty)
913 #define SWIG_NewMemberObj(ptr, sz, type) SWIG_NewPackedObj(ptr, sz, type)
918 #define SWIG_GetModule(clientdata) SWIG_Perl_GetModule()
919 #define SWIG_SetModule(clientdata, pointer) SWIG_Perl_SetModule(pointer)
922 /* Error manipulation */
924 #define SWIG_ErrorType(code) SWIG_Perl_ErrorType(code)
925 #define SWIG_Error(code, msg) sv_setpvf(GvSV(PL_errgv),"%s %s\n", SWIG_ErrorType(code), msg)
926 #define SWIG_fail goto fail
928 /* Perl-specific SWIG API */
930 #define SWIG_MakePtr(sv, ptr, type, flags) SWIG_Perl_MakePtr(SWIG_PERL_OBJECT_CALL sv, ptr, type, flags)
931 #define SWIG_MakePackedObj(sv, p, s, type) SWIG_Perl_MakePackedObj(SWIG_PERL_OBJECT_CALL sv, p, s, type)
932 #define SWIG_SetError(str) SWIG_Error(SWIG_RuntimeError, str)
935 #define SWIG_PERL_DECL_ARGS_1(arg1) (SWIG_PERL_OBJECT_DECL arg1)
936 #define SWIG_PERL_CALL_ARGS_1(arg1) (SWIG_PERL_OBJECT_CALL arg1)
937 #define SWIG_PERL_DECL_ARGS_2(arg1, arg2) (SWIG_PERL_OBJECT_DECL arg1, arg2)
938 #define SWIG_PERL_CALL_ARGS_2(arg1, arg2) (SWIG_PERL_OBJECT_CALL arg1, arg2)
940 /* -----------------------------------------------------------------------------
941 * pointers/data manipulation
942 * ----------------------------------------------------------------------------- */
944 /* For backward compatibility only */
945 #define SWIG_POINTER_EXCEPTION 0
951 #define SWIG_OWNER SWIG_POINTER_OWN
952 #define SWIG_SHADOW SWIG_OWNER << 1
954 #define SWIG_MAYBE_PERL_OBJECT SWIG_PERL_OBJECT_DECL
956 /* SWIG Perl macros */
958 /* Macro to declare an XS function */
960 # define XSPROTO(name) void name(pTHX_ CV* cv)
963 /* Macro to call an XS function */
965 # define SWIG_CALLXS(_name) _name(cv,pPerl)
967 # ifndef MULTIPLICITY
968 # define SWIG_CALLXS(_name) _name(cv)
970 # define SWIG_CALLXS(_name) _name(PERL_GET_THX, cv)
975 #define MAGIC_PPERL CPerlObj *pPerl = (CPerlObj *) this;
980 typedef int (CPerlObj::*SwigMagicFunc)(SV *, MAGIC *);
985 #define SWIG_MAGIC(a,b) (SV *a, MAGIC *b)
986 #define SWIGCLASS_STATIC
988 #else /* PERL_OBJECT */
991 #define SWIGCLASS_STATIC static SWIGUNUSED
994 #define SWIG_MAGIC(a,b) (SV *a, MAGIC *b)
999 typedef int (*SwigMagicFunc)(SV *, MAGIC *);
1004 #else /* MULTIPLICITY */
1006 #define SWIG_MAGIC(a,b) (struct interpreter *interp, SV *a, MAGIC *b)
1011 typedef int (*SwigMagicFunc)(struct interpreter *, SV *, MAGIC *);
1016 #endif /* MULTIPLICITY */
1017 #endif /* PERL_OBJECT */
1019 /* Workaround for bug in perl 5.6.x croak and earlier */
1020 #if (PERL_VERSION < 8)
1022 # define SWIG_croak_null() SWIG_Perl_croak_null(pPerl)
1023 static void SWIG_Perl_croak_null(CPerlObj *pPerl)
1025 static void SWIG_croak_null()
1029 # if (PERL_VERSION < 6)
1032 if (SvOK(err) && !SvROK(err)) croak("%_", err);
1037 # define SWIG_croak_null() croak(Nullch)
1042 Define how strict is the cast between strings and integers/doubles
1043 when overloading between these types occurs.
1045 The default is making it as strict as possible by using SWIG_AddCast
1048 You can use -DSWIG_PERL_NO_STRICT_STR2NUM at compilation time to
1049 disable the SWIG_AddCast, making the casting between string and
1050 numbers less strict.
1052 In the end, we try to solve the overloading between strings and
1053 numerical types in the more natural way, but if you can avoid it,
1054 well, avoid it using %rename, for example.
1056 #ifndef SWIG_PERL_NO_STRICT_STR2NUM
1057 # ifndef SWIG_PERL_STRICT_STR2NUM
1058 # define SWIG_PERL_STRICT_STR2NUM
1061 #ifdef SWIG_PERL_STRICT_STR2NUM
1062 /* string takes precedence */
1063 #define SWIG_Str2NumCast(x) SWIG_AddCast(x)
1065 /* number takes precedence */
1066 #define SWIG_Str2NumCast(x) x
1073 SWIGRUNTIME const char *
1074 SWIG_Perl_TypeProxyName(const swig_type_info *type) {
1075 if (!type) return NULL;
1076 if (type->clientdata != NULL) {
1077 return (const char*) type->clientdata;
1084 /* Identical to SWIG_TypeCheck, except for strcmp comparison */
1085 SWIGRUNTIME swig_cast_info *
1086 SWIG_TypeProxyCheck(const char *c, swig_type_info *ty) {
1088 swig_cast_info *iter = ty->cast;
1090 if ( (!iter->type->clientdata && (strcmp(iter->type->name, c) == 0)) ||
1091 (iter->type->clientdata && (strcmp((char*)iter->type->clientdata, c) == 0)) ) {
1092 if (iter == ty->cast)
1094 /* Move iter to the top of the linked list */
1095 iter->prev->next = iter->next;
1097 iter->next->prev = iter->prev;
1098 iter->next = ty->cast;
1100 if (ty->cast) ty->cast->prev = iter;
1110 /* Function for getting a pointer value */
1113 SWIG_Perl_ConvertPtr(SWIG_MAYBE_PERL_OBJECT SV *sv, void **ptr, swig_type_info *_t, int flags) {
1115 void *voidptr = (void *)0;
1117 /* If magical, apply more magic */
1121 /* Check to see if this is an object */
1122 if (sv_isobject(sv)) {
1124 tsv = (SV*) SvRV(sv);
1125 if ((SvTYPE(tsv) == SVt_PVHV)) {
1127 if (SvMAGICAL(tsv)) {
1128 mg = mg_find(tsv,'P');
1131 if (sv_isobject(sv)) {
1132 tsv = (SV*)SvRV(sv);
1142 voidptr = INT2PTR(void *,tmp);
1143 } else if (! SvOK(sv)) { /* Check for undef */
1144 *(ptr) = (void *) 0;
1146 } else if (SvTYPE(sv) == SVt_RV) { /* Check for NULL pointer */
1148 *(ptr) = (void *) 0;
1153 } else { /* Don't know what it is */
1157 /* Now see if the types match */
1158 char *_c = HvNAME(SvSTASH(SvRV(sv)));
1159 tc = SWIG_TypeProxyCheck(_c,_t);
1165 *ptr = SWIG_TypeCast(tc,voidptr,&newmemory);
1166 assert(!newmemory); /* newmemory handling not yet implemented */
1173 * DISOWN implementation: we need a perl guru to check this one.
1175 if (tsv && (flags & SWIG_POINTER_DISOWN)) {
1177 * almost copy paste code from below SWIG_POINTER_OWN setting
1180 HV *stash = SvSTASH(SvRV(obj));
1181 GV *gv = *(GV**) hv_fetch(stash, "OWNER", 5, TRUE);
1185 * To set ownership (see below), a newSViv(1) entry is added.
1186 * Hence, to remove ownership, we delete the entry.
1188 if (hv_exists_ent(hv, obj, 0)) {
1189 hv_delete_ent(hv, obj, 0, 0);
1197 SWIG_Perl_MakePtr(SWIG_MAYBE_PERL_OBJECT SV *sv, void *ptr, swig_type_info *t, int flags) {
1198 if (ptr && (flags & SWIG_SHADOW)) {
1203 sv_setref_pv(obj, (char *) SWIG_Perl_TypeProxyName(t), ptr);
1204 stash=SvSTASH(SvRV(obj));
1205 if (flags & SWIG_POINTER_OWN) {
1207 GV *gv=*(GV**)hv_fetch(stash, "OWNER", 5, TRUE);
1209 gv_init(gv, stash, "OWNER", 5, FALSE);
1211 hv_store_ent(hv, obj, newSViv(1), 0);
1213 sv_magic((SV *)hash, (SV *)obj, 'P', Nullch, 0);
1215 self=newRV_noinc((SV *)hash);
1217 SvREFCNT_dec((SV *)self);
1218 sv_bless(sv, stash);
1221 sv_setref_pv(sv, (char *) SWIG_Perl_TypeProxyName(t), ptr);
1225 SWIGRUNTIMEINLINE SV *
1226 SWIG_Perl_NewPointerObj(SWIG_MAYBE_PERL_OBJECT void *ptr, swig_type_info *t, int flags) {
1227 SV *result = sv_newmortal();
1228 SWIG_MakePtr(result, ptr, t, flags);
1233 SWIG_Perl_MakePackedObj(SWIG_MAYBE_PERL_OBJECT SV *sv, void *ptr, int sz, swig_type_info *type) {
1236 if ((2*sz + 1 + strlen(SWIG_Perl_TypeProxyName(type))) > 1000) return;
1238 r = SWIG_PackData(r,ptr,sz);
1239 strcpy(r,SWIG_Perl_TypeProxyName(type));
1240 sv_setpv(sv, result);
1244 SWIG_Perl_NewPackedObj(SWIG_MAYBE_PERL_OBJECT void *ptr, int sz, swig_type_info *type) {
1245 SV *result = sv_newmortal();
1246 SWIG_Perl_MakePackedObj(result, ptr, sz, type);
1250 /* Convert a packed value value */
1252 SWIG_Perl_ConvertPacked(SWIG_MAYBE_PERL_OBJECT SV *obj, void *ptr, int sz, swig_type_info *ty) {
1256 if ((!obj) || (!SvOK(obj))) return SWIG_ERROR;
1257 c = SvPV_nolen(obj);
1258 /* Pointer values must start with leading underscore */
1259 if (*c != '_') return SWIG_ERROR;
1261 c = SWIG_UnpackData(c,ptr,sz);
1263 tc = SWIG_TypeCheck(c,ty);
1264 if (!tc) return SWIG_ERROR;
1270 /* Macros for low-level exception handling */
1271 #define SWIG_croak(x) { SWIG_Error(SWIG_RuntimeError, x); SWIG_fail; }
1274 typedef XSPROTO(SwigPerlWrapper);
1275 typedef SwigPerlWrapper *SwigPerlWrapperPtr;
1277 /* Structure for command table */
1280 SwigPerlWrapperPtr wrapper;
1281 } swig_command_info;
1283 /* Information for constant table */
1286 #define SWIG_FLOAT 2
1287 #define SWIG_STRING 3
1288 #define SWIG_POINTER 4
1289 #define SWIG_BINARY 5
1291 /* Constant information structure */
1292 typedef struct swig_constant_info {
1298 swig_type_info **ptype;
1299 } swig_constant_info;
1302 /* Structure for variable table */
1307 swig_type_info **type;
1308 } swig_variable_info;
1310 /* Magic variable code */
1312 #define swig_create_magic(s,a,b,c) _swig_create_magic(s,a,b,c)
1313 #ifndef MULTIPLICITY
1314 SWIGRUNTIME void _swig_create_magic(SV *sv, char *name, int (*set)(SV *, MAGIC *), int (*get)(SV *,MAGIC *))
1316 SWIGRUNTIME void _swig_create_magic(SV *sv, char *name, int (*set)(struct interpreter*, SV *, MAGIC *), int (*get)(struct interpreter*, SV *,MAGIC *))
1319 # define swig_create_magic(s,a,b,c) _swig_create_magic(pPerl,s,a,b,c)
1320 SWIGRUNTIME void _swig_create_magic(CPerlObj *pPerl, SV *sv, const char *name, int (CPerlObj::*set)(SV *, MAGIC *), int (CPerlObj::*get)(SV *, MAGIC *))
1324 sv_magic(sv,sv,'U',(char *) name,strlen(name));
1325 mg = mg_find(sv,'U');
1326 mg->mg_virtual = (MGVTBL *) malloc(sizeof(MGVTBL));
1327 mg->mg_virtual->svt_get = (SwigMagicFunc) get;
1328 mg->mg_virtual->svt_set = (SwigMagicFunc) set;
1329 mg->mg_virtual->svt_len = 0;
1330 mg->mg_virtual->svt_clear = 0;
1331 mg->mg_virtual->svt_free = 0;
1335 SWIGRUNTIME swig_module_info *
1336 SWIG_Perl_GetModule(void) {
1337 static void *type_pointer = (void *)0;
1340 /* first check if pointer already created */
1341 if (!type_pointer) {
1342 pointer = get_sv("swig_runtime_data::type_pointer" SWIG_RUNTIME_VERSION SWIG_TYPE_TABLE_NAME, FALSE | GV_ADDMULTI);
1343 if (pointer && SvOK(pointer)) {
1344 type_pointer = INT2PTR(swig_type_info **, SvIV(pointer));
1348 return (swig_module_info *) type_pointer;
1352 SWIG_Perl_SetModule(swig_module_info *module) {
1355 /* create a new pointer */
1356 pointer = get_sv("swig_runtime_data::type_pointer" SWIG_RUNTIME_VERSION SWIG_TYPE_TABLE_NAME, TRUE | GV_ADDMULTI);
1357 sv_setiv(pointer, PTR2IV(module));
1364 /* Workaround perl5 global namespace pollution. Note that undefining library
1365 * functions like fopen will not solve the problem on all platforms as fopen
1366 * might be a macro on Windows but not necessarily on other operating systems. */
1466 #define SWIG_exception_fail(code, msg) do { SWIG_Error(code, msg); SWIG_fail; } while(0)
1468 #define SWIG_contract_assert(expr, msg) if (!(expr)) { SWIG_Error(SWIG_RuntimeError, msg); SWIG_fail; } else
1472 #define SWIG_exception(code, msg) do { SWIG_Error(code, msg); SWIG_fail;; } while(0)
1475 /* -------- TYPES TABLE (BEGIN) -------- */
1477 #define SWIGTYPE_p_FILE swig_types[0]
1478 #define SWIGTYPE_p_GSList swig_types[1]
1479 #define SWIGTYPE_p_char swig_types[2]
1480 #define SWIGTYPE_p_double swig_types[3]
1481 #define SWIGTYPE_p_dumpspec_t swig_types[4]
1482 #define SWIGTYPE_p_find_result_t swig_types[5]
1483 #define SWIGTYPE_p_float swig_types[6]
1484 #define SWIGTYPE_p_int swig_types[7]
1485 #define SWIGTYPE_p_unsigned_char swig_types[8]
1486 static swig_type_info *swig_types[10];
1487 static swig_module_info swig_module = {swig_types, 9, 0, 0, 0, 0};
1488 #define SWIG_TypeQuery(name) SWIG_TypeQueryModule(&swig_module, &swig_module, name)
1489 #define SWIG_MangledTypeQuery(name) SWIG_MangledTypeQueryModule(&swig_module, &swig_module, name)
1491 /* -------- TYPES TABLE (END) -------- */
1493 #define SWIG_init boot_Amanda__Logfile
1495 #define SWIG_name "Amanda::Logfilec::boot_Amanda__Logfile"
1496 #define SWIG_prefix "Amanda::Logfilec::"
1498 #define SWIGVERSION 0x010339
1499 #define SWIG_VERSION SWIGVERSION
1502 #define SWIG_as_voidptr(a) (void *)((const void *)(a))
1503 #define SWIG_as_voidptrptr(a) ((void)SWIG_as_voidptr(*a),(void**)(a))
1510 #ifndef MULTIPLICITY
1511 SWIGEXPORT void SWIG_init (CV* cv);
1513 SWIGEXPORT void SWIG_init (pTHXo_ CV* cv);
1516 SWIGEXPORT void SWIG_init (CV *cv, CPerlObj *);
1529 #include "cmdline.h"
1532 typedef GSList amglue_dumpspec_list;
1536 #include "logfile.h"
1538 #include "diskfile.h" /* for the gross hack, below */
1541 SWIGINTERNINLINE SV *
1542 SWIG_From_long SWIG_PERL_DECL_ARGS_1(long value)
1544 SV *obj = sv_newmortal();
1545 sv_setiv(obj, (IV) value);
1550 SWIGINTERNINLINE SV *
1551 SWIG_From_int SWIG_PERL_DECL_ARGS_1(int value)
1553 return SWIG_From_long SWIG_PERL_CALL_ARGS_1(value);
1557 /* open_ and close_logfile are both simple wrappers around fopen/fclose. */
1558 typedef FILE loghandle;
1560 loghandle *open_logfile(char *filename) {
1561 return fopen(filename, "r");
1565 SWIGINTERN swig_type_info*
1566 SWIG_pchar_descriptor(void)
1568 static int init = 0;
1569 static swig_type_info* info = 0;
1571 info = SWIG_TypeQuery("_p_char");
1579 SWIG_AsCharPtrAndSize(SV *obj, char** cptr, size_t* psize, int *alloc)
1581 if (SvMAGICAL(obj)) {
1582 SV *tmp = sv_newmortal();
1588 char *cstr = SvPV(obj, len);
1589 size_t size = len + 1;
1592 if (*alloc == SWIG_NEWOBJ) {
1593 *cptr = (char *)memcpy((char *)malloc((size)*sizeof(char)), cstr, sizeof(char)*(size));
1596 *alloc = SWIG_OLDOBJ;
1600 if (psize) *psize = size;
1603 swig_type_info* pchar_descriptor = SWIG_pchar_descriptor();
1604 if (pchar_descriptor) {
1606 if (SWIG_ConvertPtr(obj, (void**)&vptr, pchar_descriptor, 0) == SWIG_OK) {
1607 if (cptr) *cptr = vptr;
1608 if (psize) *psize = vptr ? (strlen(vptr) + 1) : 0;
1609 if (alloc) *alloc = SWIG_OLDOBJ;
1614 return SWIG_TypeError;
1621 void close_logfile(loghandle *logfile) {
1622 if (logfile) fclose(logfile);
1626 typedef int LOGLINE_RETURN;
1628 SWIGINTERN void delete_find_result_t(find_result_t *self){
1629 find_result_t *selfp = self;
1630 free_find_result(&selfp);
1633 SWIGINTERNINLINE SV *
1634 SWIG_FromCharPtrAndSize(const char* carray, size_t size)
1636 SV *obj = sv_newmortal();
1638 sv_setpvn(obj, carray, size);
1640 sv_setsv(obj, &PL_sv_undef);
1646 SWIGINTERNINLINE SV *
1647 SWIG_FromCharPtr(const char *cptr)
1649 return SWIG_FromCharPtrAndSize(cptr, (cptr ? strlen(cptr) : 0));
1653 SWIGINTERNINLINE SV *
1654 SWIG_From_double SWIG_PERL_DECL_ARGS_1(double value)
1656 SV *obj = sv_newmortal();
1657 sv_setnv(obj, value);
1662 find_result_t *search_logfile_wrap(char *label, char *datestamp,
1663 char *logfile, int add_missing_disks) {
1664 find_result_t *rv = NULL;
1666 /* We use a static variable to collect any unrecognized disks */
1667 static disklist_t unrecognized_disks = { NULL, NULL };
1669 search_logfile(&rv, label, datestamp, logfile,
1670 add_missing_disks? &unrecognized_disks : NULL);
1677 #if !defined(SWIG_NO_LLONG_MAX)
1678 # if !defined(LLONG_MAX) && defined(__GNUC__) && defined (__LONG_LONG_MAX__)
1679 # define LLONG_MAX __LONG_LONG_MAX__
1680 # define LLONG_MIN (-LLONG_MAX - 1LL)
1681 # define ULLONG_MAX (LLONG_MAX * 2ULL + 1ULL)
1687 SWIG_AsVal_double SWIG_PERL_DECL_ARGS_2(SV *obj, double *val)
1690 if (val) *val = SvNV(obj);
1692 } else if (SvIOK(obj)) {
1693 if (val) *val = (double) SvIV(obj);
1694 return SWIG_AddCast(SWIG_OK);
1696 const char *nptr = SvPV_nolen(obj);
1699 double v = strtod(nptr, &endptr);
1700 if (errno == ERANGE) {
1702 return SWIG_OverflowError;
1704 if (*endptr == '\0') {
1706 return SWIG_Str2NumCast(SWIG_OK);
1711 return SWIG_TypeError;
1721 SWIGINTERNINLINE int
1722 SWIG_CanCastAsInteger(double *d, double min, double max) {
1724 if ((min <= x && x <= max)) {
1725 double fx = floor(x);
1726 double cx = ceil(x);
1727 double rd = ((x - fx) < 0.5) ? fx : cx; /* simple rint */
1728 if ((errno == EDOM) || (errno == ERANGE)) {
1731 double summ, reps, diff;
1734 } else if (rd > x) {
1741 if (reps < 8*DBL_EPSILON) {
1752 SWIG_AsVal_long SWIG_PERL_DECL_ARGS_2(SV *obj, long* val)
1755 if (val) *val = SvIV(obj);
1759 const char *nptr = SvPV_nolen(obj);
1764 v = strtol(nptr, &endptr,0);
1765 if (errno == ERANGE) {
1767 return SWIG_OverflowError;
1769 if (*endptr == '\0') {
1771 return SWIG_Str2NumCast(SWIG_OK);
1777 int res = SWIG_AddCast(SWIG_AsVal_double SWIG_PERL_CALL_ARGS_2(obj,&d));
1778 if (SWIG_IsOK(res) && SWIG_CanCastAsInteger(&d, LONG_MIN, LONG_MAX)) {
1779 if (val) *val = (long)(d);
1784 return SWIG_TypeError;
1789 SWIG_AsVal_int SWIG_PERL_DECL_ARGS_2(SV * obj, int *val)
1792 int res = SWIG_AsVal_long SWIG_PERL_CALL_ARGS_2(obj, &v);
1793 if (SWIG_IsOK(res)) {
1794 if ((v < INT_MIN || v > INT_MAX)) {
1795 return SWIG_OverflowError;
1797 if (val) *val = (int)(v);
1808 #define MAGIC_CLASS _wrap_Amanda__Logfile_var::
1809 class _wrap_Amanda__Logfile_var : public CPerlObj {
1814 SWIGCLASS_STATIC int swig_magic_readonly(pTHX_ SV *SWIGUNUSEDPARM(sv), MAGIC *SWIGUNUSEDPARM(mg)) {
1816 croak("Value is read-only.");
1832 XS(_wrap_open_logfile) {
1834 char *arg1 = (char *) 0 ;
1839 loghandle *result = 0 ;
1842 if ((items < 1) || (items > 1)) {
1843 SWIG_croak("Usage: open_logfile(filename);");
1845 res1 = SWIG_AsCharPtrAndSize(ST(0), &buf1, NULL, &alloc1);
1846 if (!SWIG_IsOK(res1)) {
1847 SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "open_logfile" "', argument " "1"" of type '" "char *""'");
1849 arg1 = (char *)(buf1);
1850 result = (loghandle *)open_logfile(arg1);
1851 ST(argvi) = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_FILE, 0 | 0); argvi++ ;
1852 if (alloc1 == SWIG_NEWOBJ) free((char*)buf1);
1855 if (alloc1 == SWIG_NEWOBJ) free((char*)buf1);
1861 XS(_wrap_close_logfile) {
1863 loghandle *arg1 = (loghandle *) 0 ;
1869 if ((items < 1) || (items > 1)) {
1870 SWIG_croak("Usage: close_logfile(logfile);");
1872 res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_FILE, 0 | 0 );
1873 if (!SWIG_IsOK(res1)) {
1874 SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "close_logfile" "', argument " "1"" of type '" "loghandle *""'");
1876 arg1 = (loghandle *)(argp1);
1877 close_logfile(arg1);
1878 ST(argvi) = sv_newmortal();
1888 XS(_wrap_get_logline) {
1890 FILE *arg1 = (FILE *) 0 ;
1894 LOGLINE_RETURN result;
1897 if ((items < 1) || (items > 1)) {
1898 SWIG_croak("Usage: get_logline(logfile);");
1900 res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_FILE, 0 | 0 );
1901 if (!SWIG_IsOK(res1)) {
1902 SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "get_logline" "', argument " "1"" of type '" "FILE *""'");
1904 arg1 = (FILE *)(argp1);
1905 result = get_logline(arg1);
1909 ST(argvi) = sv_2mortal(newSViv(curlog));
1911 ST(argvi) = sv_2mortal(newSViv(curprog));
1913 ST(argvi) = sv_2mortal(newSVpv(curstr, 0));
1916 /* otherwise (end of logfile) return an empty list */
1927 XS(_wrap_delete_find_result_t) {
1929 find_result_t *arg1 = (find_result_t *) 0 ;
1935 if ((items < 1) || (items > 1)) {
1936 SWIG_croak("Usage: delete_find_result_t(self);");
1938 res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_find_result_t, SWIG_POINTER_DISOWN | 0 );
1939 if (!SWIG_IsOK(res1)) {
1940 SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "delete_find_result_t" "', argument " "1"" of type '" "find_result_t *""'");
1942 arg1 = (find_result_t *)(argp1);
1943 delete_find_result_t(arg1);
1944 ST(argvi) = sv_newmortal();
1954 XS(_wrap_find_result_t_timestamp_get) {
1956 find_result_t *arg1 = (find_result_t *) 0 ;
1963 if ((items < 1) || (items > 1)) {
1964 SWIG_croak("Usage: find_result_t_timestamp_get(self);");
1966 res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_find_result_t, 0 | 0 );
1967 if (!SWIG_IsOK(res1)) {
1968 SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "find_result_t_timestamp_get" "', argument " "1"" of type '" "find_result_t *""'");
1970 arg1 = (find_result_t *)(argp1);
1971 result = (char *) ((arg1)->timestamp);
1972 ST(argvi) = SWIG_FromCharPtr((const char *)result); argvi++ ;
1982 XS(_wrap_find_result_t_hostname_get) {
1984 find_result_t *arg1 = (find_result_t *) 0 ;
1991 if ((items < 1) || (items > 1)) {
1992 SWIG_croak("Usage: find_result_t_hostname_get(self);");
1994 res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_find_result_t, 0 | 0 );
1995 if (!SWIG_IsOK(res1)) {
1996 SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "find_result_t_hostname_get" "', argument " "1"" of type '" "find_result_t *""'");
1998 arg1 = (find_result_t *)(argp1);
1999 result = (char *) ((arg1)->hostname);
2000 ST(argvi) = SWIG_FromCharPtr((const char *)result); argvi++ ;
2010 XS(_wrap_find_result_t_diskname_get) {
2012 find_result_t *arg1 = (find_result_t *) 0 ;
2019 if ((items < 1) || (items > 1)) {
2020 SWIG_croak("Usage: find_result_t_diskname_get(self);");
2022 res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_find_result_t, 0 | 0 );
2023 if (!SWIG_IsOK(res1)) {
2024 SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "find_result_t_diskname_get" "', argument " "1"" of type '" "find_result_t *""'");
2026 arg1 = (find_result_t *)(argp1);
2027 result = (char *) ((arg1)->diskname);
2028 ST(argvi) = SWIG_FromCharPtr((const char *)result); argvi++ ;
2038 XS(_wrap_find_result_t_level_get) {
2040 find_result_t *arg1 = (find_result_t *) 0 ;
2047 if ((items < 1) || (items > 1)) {
2048 SWIG_croak("Usage: find_result_t_level_get(self);");
2050 res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_find_result_t, 0 | 0 );
2051 if (!SWIG_IsOK(res1)) {
2052 SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "find_result_t_level_get" "', argument " "1"" of type '" "find_result_t *""'");
2054 arg1 = (find_result_t *)(argp1);
2055 result = (int) ((arg1)->level);
2057 ST(argvi) = sv_2mortal(amglue_newSVi64(result));
2069 XS(_wrap_find_result_t_label_get) {
2071 find_result_t *arg1 = (find_result_t *) 0 ;
2078 if ((items < 1) || (items > 1)) {
2079 SWIG_croak("Usage: find_result_t_label_get(self);");
2081 res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_find_result_t, 0 | 0 );
2082 if (!SWIG_IsOK(res1)) {
2083 SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "find_result_t_label_get" "', argument " "1"" of type '" "find_result_t *""'");
2085 arg1 = (find_result_t *)(argp1);
2086 result = (char *) ((arg1)->label);
2087 ST(argvi) = SWIG_FromCharPtr((const char *)result); argvi++ ;
2097 XS(_wrap_find_result_t_filenum_get) {
2099 find_result_t *arg1 = (find_result_t *) 0 ;
2106 if ((items < 1) || (items > 1)) {
2107 SWIG_croak("Usage: find_result_t_filenum_get(self);");
2109 res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_find_result_t, 0 | 0 );
2110 if (!SWIG_IsOK(res1)) {
2111 SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "find_result_t_filenum_get" "', argument " "1"" of type '" "find_result_t *""'");
2113 arg1 = (find_result_t *)(argp1);
2114 result = ((arg1)->filenum);
2116 ST(argvi) = sv_2mortal(amglue_newSVu64(result));
2128 XS(_wrap_find_result_t_status_get) {
2130 find_result_t *arg1 = (find_result_t *) 0 ;
2137 if ((items < 1) || (items > 1)) {
2138 SWIG_croak("Usage: find_result_t_status_get(self);");
2140 res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_find_result_t, 0 | 0 );
2141 if (!SWIG_IsOK(res1)) {
2142 SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "find_result_t_status_get" "', argument " "1"" of type '" "find_result_t *""'");
2144 arg1 = (find_result_t *)(argp1);
2145 result = (char *) ((arg1)->status);
2146 ST(argvi) = SWIG_FromCharPtr((const char *)result); argvi++ ;
2156 XS(_wrap_find_result_t_partnum_get) {
2158 find_result_t *arg1 = (find_result_t *) 0 ;
2165 if ((items < 1) || (items > 1)) {
2166 SWIG_croak("Usage: find_result_t_partnum_get(self);");
2168 res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_find_result_t, 0 | 0 );
2169 if (!SWIG_IsOK(res1)) {
2170 SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "find_result_t_partnum_get" "', argument " "1"" of type '" "find_result_t *""'");
2172 arg1 = (find_result_t *)(argp1);
2173 result = (char *) ((arg1)->partnum);
2174 ST(argvi) = SWIG_FromCharPtr((const char *)result); argvi++ ;
2184 XS(_wrap_find_result_t_sec_get) {
2186 find_result_t *arg1 = (find_result_t *) 0 ;
2193 if ((items < 1) || (items > 1)) {
2194 SWIG_croak("Usage: find_result_t_sec_get(self);");
2196 res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_find_result_t, 0 | 0 );
2197 if (!SWIG_IsOK(res1)) {
2198 SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "find_result_t_sec_get" "', argument " "1"" of type '" "find_result_t *""'");
2200 arg1 = (find_result_t *)(argp1);
2201 result = (double) ((arg1)->sec);
2202 ST(argvi) = SWIG_From_double SWIG_PERL_CALL_ARGS_1((double)(result)); argvi++ ;
2212 XS(_wrap_find_result_t_kb_get) {
2214 find_result_t *arg1 = (find_result_t *) 0 ;
2221 if ((items < 1) || (items > 1)) {
2222 SWIG_croak("Usage: find_result_t_kb_get(self);");
2224 res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_find_result_t, 0 | 0 );
2225 if (!SWIG_IsOK(res1)) {
2226 SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "find_result_t_kb_get" "', argument " "1"" of type '" "find_result_t *""'");
2228 arg1 = (find_result_t *)(argp1);
2229 result = ((arg1)->kb);
2231 ST(argvi) = sv_2mortal(amglue_newSVu64(result));
2243 XS(_wrap_new_find_result_t) {
2246 find_result_t *result = 0 ;
2249 if ((items < 0) || (items > 0)) {
2250 SWIG_croak("Usage: new_find_result_t();");
2252 result = (find_result_t *)calloc(1, sizeof(find_result_t));
2253 ST(argvi) = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_find_result_t, SWIG_OWNER | SWIG_SHADOW); argvi++ ;
2261 XS(_wrap_find_log) {
2267 if ((items < 0) || (items > 0)) {
2268 SWIG_croak("Usage: find_log();");
2270 result = (char **)find_log();
2275 /* measure the length of the array and make sure perl has enough room */
2276 for (len=0, iter=result; *iter; iter++) len++;
2279 /* now copy it to the perl stack */
2280 for (i=0, iter=result; *iter; iter++, i++) {
2281 ST(argvi) = sv_2mortal(newSVpv(*iter, 0));
2292 XS(_wrap_search_logfile) {
2294 char *arg1 = (char *) 0 ;
2295 char *arg2 = (char *) 0 ;
2296 char *arg3 = (char *) 0 ;
2308 find_result_t *result = 0 ;
2311 if ((items < 4) || (items > 4)) {
2312 SWIG_croak("Usage: search_logfile(label,datestamp,logfile,add_missing_disks);");
2314 res1 = SWIG_AsCharPtrAndSize(ST(0), &buf1, NULL, &alloc1);
2315 if (!SWIG_IsOK(res1)) {
2316 SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "search_logfile" "', argument " "1"" of type '" "char *""'");
2318 arg1 = (char *)(buf1);
2319 res2 = SWIG_AsCharPtrAndSize(ST(1), &buf2, NULL, &alloc2);
2320 if (!SWIG_IsOK(res2)) {
2321 SWIG_exception_fail(SWIG_ArgError(res2), "in method '" "search_logfile" "', argument " "2"" of type '" "char *""'");
2323 arg2 = (char *)(buf2);
2324 res3 = SWIG_AsCharPtrAndSize(ST(2), &buf3, NULL, &alloc3);
2325 if (!SWIG_IsOK(res3)) {
2326 SWIG_exception_fail(SWIG_ArgError(res3), "in method '" "search_logfile" "', argument " "3"" of type '" "char *""'");
2328 arg3 = (char *)(buf3);
2330 if (sizeof(signed int) == 1) {
2331 arg4 = amglue_SvI8(ST(3));
2332 } else if (sizeof(signed int) == 2) {
2333 arg4 = amglue_SvI16(ST(3));
2334 } else if (sizeof(signed int) == 4) {
2335 arg4 = amglue_SvI32(ST(3));
2336 } else if (sizeof(signed int) == 8) {
2337 arg4 = amglue_SvI64(ST(3));
2339 g_critical("Unexpected signed int >64 bits?"); /* should be optimized out unless sizeof(signed int) > 8 */
2342 result = (find_result_t *)search_logfile_wrap(arg1,arg2,arg3,arg4);
2344 find_result_t *iter;
2347 /* measure the list and make room on the perl stack */
2348 for (len=0, iter=result; iter; iter=iter->next) len++;
2353 find_result_t *next;
2354 /* Let SWIG take ownership of the object */
2355 ST(argvi) = SWIG_NewPointerObj(iter, SWIGTYPE_p_find_result_t, SWIG_OWNER | SWIG_SHADOW);
2358 /* null out the 'next' field */
2364 if (alloc1 == SWIG_NEWOBJ) free((char*)buf1);
2365 if (alloc2 == SWIG_NEWOBJ) free((char*)buf2);
2366 if (alloc3 == SWIG_NEWOBJ) free((char*)buf3);
2370 if (alloc1 == SWIG_NEWOBJ) free((char*)buf1);
2371 if (alloc2 == SWIG_NEWOBJ) free((char*)buf2);
2372 if (alloc3 == SWIG_NEWOBJ) free((char*)buf3);
2379 XS(_wrap_dumps_match) {
2381 find_result_t *arg1 = (find_result_t *) 0 ;
2382 char *arg2 = (char *) 0 ;
2383 char *arg3 = (char *) 0 ;
2384 char *arg4 = (char *) 0 ;
2385 char *arg5 = (char *) 0 ;
2400 find_result_t *result = 0 ;
2403 if ((items < 6) || (items > 6)) {
2404 SWIG_croak("Usage: dumps_match(output_find,hostname,diskname,datestamp,level,ok);");
2409 find_result_t *head = NULL, *tail = NULL;
2411 if (!SvROK(ST(0)) || SvTYPE(SvRV(ST(0))) != SVt_PVAV) {
2412 SWIG_exception(SWIG_TypeError, "expected an arrayref of find_result_t's");
2415 av = (AV *)SvRV(ST(0));
2416 len = av_len(av) + 1;
2418 for (i = 0; i < len; i++) {
2419 SV **val = av_fetch(av, i, 0);
2422 if (!val || SWIG_ConvertPtr(*val, (void **)&r, SWIGTYPE_p_find_result_t, 0) == -1) {
2423 SWIG_exception(SWIG_TypeError, "array member is not a find_result_t");
2436 /* point to the head of that list */
2439 res2 = SWIG_AsCharPtrAndSize(ST(1), &buf2, NULL, &alloc2);
2440 if (!SWIG_IsOK(res2)) {
2441 SWIG_exception_fail(SWIG_ArgError(res2), "in method '" "dumps_match" "', argument " "2"" of type '" "char *""'");
2443 arg2 = (char *)(buf2);
2444 res3 = SWIG_AsCharPtrAndSize(ST(2), &buf3, NULL, &alloc3);
2445 if (!SWIG_IsOK(res3)) {
2446 SWIG_exception_fail(SWIG_ArgError(res3), "in method '" "dumps_match" "', argument " "3"" of type '" "char *""'");
2448 arg3 = (char *)(buf3);
2449 res4 = SWIG_AsCharPtrAndSize(ST(3), &buf4, NULL, &alloc4);
2450 if (!SWIG_IsOK(res4)) {
2451 SWIG_exception_fail(SWIG_ArgError(res4), "in method '" "dumps_match" "', argument " "4"" of type '" "char *""'");
2453 arg4 = (char *)(buf4);
2454 res5 = SWIG_AsCharPtrAndSize(ST(4), &buf5, NULL, &alloc5);
2455 if (!SWIG_IsOK(res5)) {
2456 SWIG_exception_fail(SWIG_ArgError(res5), "in method '" "dumps_match" "', argument " "5"" of type '" "char *""'");
2458 arg5 = (char *)(buf5);
2460 if (sizeof(signed int) == 1) {
2461 arg6 = amglue_SvI8(ST(5));
2462 } else if (sizeof(signed int) == 2) {
2463 arg6 = amglue_SvI16(ST(5));
2464 } else if (sizeof(signed int) == 4) {
2465 arg6 = amglue_SvI32(ST(5));
2466 } else if (sizeof(signed int) == 8) {
2467 arg6 = amglue_SvI64(ST(5));
2469 g_critical("Unexpected signed int >64 bits?"); /* should be optimized out unless sizeof(signed int) > 8 */
2472 result = (find_result_t *)dumps_match(arg1,arg2,arg3,arg4,arg5,arg6);
2474 find_result_t *iter;
2477 /* measure the list and make room on the perl stack */
2478 for (len=0, iter=result; iter; iter=iter->next) len++;
2483 find_result_t *next;
2484 /* Let SWIG take ownership of the object */
2485 ST(argvi) = SWIG_NewPointerObj(iter, SWIGTYPE_p_find_result_t, SWIG_OWNER | SWIG_SHADOW);
2488 /* null out the 'next' field */
2495 find_result_t *iter = arg1, *next;
2497 /* undo all the links we added earlier */
2504 if (alloc2 == SWIG_NEWOBJ) free((char*)buf2);
2505 if (alloc3 == SWIG_NEWOBJ) free((char*)buf3);
2506 if (alloc4 == SWIG_NEWOBJ) free((char*)buf4);
2507 if (alloc5 == SWIG_NEWOBJ) free((char*)buf5);
2512 find_result_t *iter = arg1, *next;
2514 /* undo all the links we added earlier */
2521 if (alloc2 == SWIG_NEWOBJ) free((char*)buf2);
2522 if (alloc3 == SWIG_NEWOBJ) free((char*)buf3);
2523 if (alloc4 == SWIG_NEWOBJ) free((char*)buf4);
2524 if (alloc5 == SWIG_NEWOBJ) free((char*)buf5);
2531 XS(_wrap_dumps_match_dumpspecs) {
2533 find_result_t *arg1 = (find_result_t *) 0 ;
2534 amglue_dumpspec_list *arg2 = (amglue_dumpspec_list *) 0 ;
2537 find_result_t *result = 0 ;
2540 if ((items < 3) || (items > 3)) {
2541 SWIG_croak("Usage: dumps_match_dumpspecs(output_find,dumpspecs,ok);");
2546 find_result_t *head = NULL, *tail = NULL;
2548 if (!SvROK(ST(0)) || SvTYPE(SvRV(ST(0))) != SVt_PVAV) {
2549 SWIG_exception(SWIG_TypeError, "expected an arrayref of find_result_t's");
2552 av = (AV *)SvRV(ST(0));
2553 len = av_len(av) + 1;
2555 for (i = 0; i < len; i++) {
2556 SV **val = av_fetch(av, i, 0);
2559 if (!val || SWIG_ConvertPtr(*val, (void **)&r, SWIGTYPE_p_find_result_t, 0) == -1) {
2560 SWIG_exception(SWIG_TypeError, "array member is not a find_result_t");
2573 /* point to the head of that list */
2581 if (!SvROK(ST(1)) || SvTYPE(SvRV(ST(1))) != SVt_PVAV) {
2582 SWIG_exception_fail(SWIG_TypeError, "Expected an arrayref of dumpspecs");
2584 av = (AV *)SvRV(ST(1));
2588 for (i = 0; i < len; i++) {
2589 dumpspec_t *ds = NULL;
2590 SV **elt = av_fetch(av, i, 0);
2592 SWIG_ConvertPtr(*elt, (void **)&ds, SWIGTYPE_p_dumpspec_t, 0);
2594 SWIG_exception_fail(SWIG_TypeError, "Expected an arrayref of dumpspecs");
2595 arg2 = g_slist_append(arg2, ds);
2599 if (sizeof(signed int) == 1) {
2600 arg3 = amglue_SvI8(ST(2));
2601 } else if (sizeof(signed int) == 2) {
2602 arg3 = amglue_SvI16(ST(2));
2603 } else if (sizeof(signed int) == 4) {
2604 arg3 = amglue_SvI32(ST(2));
2605 } else if (sizeof(signed int) == 8) {
2606 arg3 = amglue_SvI64(ST(2));
2608 g_critical("Unexpected signed int >64 bits?"); /* should be optimized out unless sizeof(signed int) > 8 */
2611 result = (find_result_t *)dumps_match_dumpspecs(arg1,arg2,arg3);
2613 find_result_t *iter;
2616 /* measure the list and make room on the perl stack */
2617 for (len=0, iter=result; iter; iter=iter->next) len++;
2622 find_result_t *next;
2623 /* Let SWIG take ownership of the object */
2624 ST(argvi) = SWIG_NewPointerObj(iter, SWIGTYPE_p_find_result_t, SWIG_OWNER | SWIG_SHADOW);
2627 /* null out the 'next' field */
2634 find_result_t *iter = arg1, *next;
2636 /* undo all the links we added earlier */
2644 /* Free the GSList, but not its contents (which are still owned by SWIG) */
2651 find_result_t *iter = arg1, *next;
2653 /* undo all the links we added earlier */
2661 /* Free the GSList, but not its contents (which are still owned by SWIG) */
2671 /* -------- TYPE CONVERSION AND EQUIVALENCE RULES (BEGIN) -------- */
2673 static swig_type_info _swigt__p_FILE = {"_p_FILE", "FILE *|loghandle *", 0, 0, (void*)0, 0};
2674 static swig_type_info _swigt__p_GSList = {"_p_GSList", "amglue_dumpspec_list *|GSList *", 0, 0, (void*)0, 0};
2675 static swig_type_info _swigt__p_char = {"_p_char", "gchar *|char *", 0, 0, (void*)0, 0};
2676 static swig_type_info _swigt__p_double = {"_p_double", "double *|gdouble *", 0, 0, (void*)0, 0};
2677 static swig_type_info _swigt__p_dumpspec_t = {"_p_dumpspec_t", "struct dumpspec_t *|dumpspec_t *", 0, 0, (void*)"Amanda::Cmdline::dumpspec_t", 0};
2678 static swig_type_info _swigt__p_find_result_t = {"_p_find_result_t", "find_result_t *", 0, 0, (void*)"Amanda::Logfile::find_result_t", 0};
2679 static swig_type_info _swigt__p_float = {"_p_float", "float *|gfloat *", 0, 0, (void*)0, 0};
2680 static swig_type_info _swigt__p_int = {"_p_int", "int *|logtype_t *|program_t *|gboolean *|cmdline_parse_dumpspecs_flags *", 0, 0, (void*)0, 0};
2681 static swig_type_info _swigt__p_unsigned_char = {"_p_unsigned_char", "guchar *|unsigned char *", 0, 0, (void*)0, 0};
2683 static swig_type_info *swig_type_initial[] = {
2688 &_swigt__p_dumpspec_t,
2689 &_swigt__p_find_result_t,
2692 &_swigt__p_unsigned_char,
2695 static swig_cast_info _swigc__p_FILE[] = { {&_swigt__p_FILE, 0, 0, 0},{0, 0, 0, 0}};
2696 static swig_cast_info _swigc__p_GSList[] = { {&_swigt__p_GSList, 0, 0, 0},{0, 0, 0, 0}};
2697 static swig_cast_info _swigc__p_char[] = { {&_swigt__p_char, 0, 0, 0},{0, 0, 0, 0}};
2698 static swig_cast_info _swigc__p_double[] = { {&_swigt__p_double, 0, 0, 0},{0, 0, 0, 0}};
2699 static swig_cast_info _swigc__p_dumpspec_t[] = { {&_swigt__p_dumpspec_t, 0, 0, 0},{0, 0, 0, 0}};
2700 static swig_cast_info _swigc__p_find_result_t[] = { {&_swigt__p_find_result_t, 0, 0, 0},{0, 0, 0, 0}};
2701 static swig_cast_info _swigc__p_float[] = { {&_swigt__p_float, 0, 0, 0},{0, 0, 0, 0}};
2702 static swig_cast_info _swigc__p_int[] = { {&_swigt__p_int, 0, 0, 0},{0, 0, 0, 0}};
2703 static swig_cast_info _swigc__p_unsigned_char[] = { {&_swigt__p_unsigned_char, 0, 0, 0},{0, 0, 0, 0}};
2705 static swig_cast_info *swig_cast_initial[] = {
2710 _swigc__p_dumpspec_t,
2711 _swigc__p_find_result_t,
2714 _swigc__p_unsigned_char,
2718 /* -------- TYPE CONVERSION AND EQUIVALENCE RULES (END) -------- */
2720 static swig_constant_info swig_constants[] = {
2726 static swig_variable_info swig_variables[] = {
2729 static swig_command_info swig_commands[] = {
2730 {"Amanda::Logfilec::open_logfile", _wrap_open_logfile},
2731 {"Amanda::Logfilec::close_logfile", _wrap_close_logfile},
2732 {"Amanda::Logfilec::get_logline", _wrap_get_logline},
2733 {"Amanda::Logfilec::delete_find_result_t", _wrap_delete_find_result_t},
2734 {"Amanda::Logfilec::find_result_t_timestamp_get", _wrap_find_result_t_timestamp_get},
2735 {"Amanda::Logfilec::find_result_t_hostname_get", _wrap_find_result_t_hostname_get},
2736 {"Amanda::Logfilec::find_result_t_diskname_get", _wrap_find_result_t_diskname_get},
2737 {"Amanda::Logfilec::find_result_t_level_get", _wrap_find_result_t_level_get},
2738 {"Amanda::Logfilec::find_result_t_label_get", _wrap_find_result_t_label_get},
2739 {"Amanda::Logfilec::find_result_t_filenum_get", _wrap_find_result_t_filenum_get},
2740 {"Amanda::Logfilec::find_result_t_status_get", _wrap_find_result_t_status_get},
2741 {"Amanda::Logfilec::find_result_t_partnum_get", _wrap_find_result_t_partnum_get},
2742 {"Amanda::Logfilec::find_result_t_sec_get", _wrap_find_result_t_sec_get},
2743 {"Amanda::Logfilec::find_result_t_kb_get", _wrap_find_result_t_kb_get},
2744 {"Amanda::Logfilec::new_find_result_t", _wrap_new_find_result_t},
2745 {"Amanda::Logfilec::find_log", _wrap_find_log},
2746 {"Amanda::Logfilec::search_logfile", _wrap_search_logfile},
2747 {"Amanda::Logfilec::dumps_match", _wrap_dumps_match},
2748 {"Amanda::Logfilec::dumps_match_dumpspecs", _wrap_dumps_match_dumpspecs},
2751 /* -----------------------------------------------------------------------------
2752 * Type initialization:
2753 * This problem is tough by the requirement that no dynamic
2754 * memory is used. Also, since swig_type_info structures store pointers to
2755 * swig_cast_info structures and swig_cast_info structures store pointers back
2756 * to swig_type_info structures, we need some lookup code at initialization.
2757 * The idea is that swig generates all the structures that are needed.
2758 * The runtime then collects these partially filled structures.
2759 * The SWIG_InitializeModule function takes these initial arrays out of
2760 * swig_module, and does all the lookup, filling in the swig_module.types
2761 * array with the correct data and linking the correct swig_cast_info
2762 * structures together.
2764 * The generated swig_type_info structures are assigned staticly to an initial
2765 * array. We just loop through that array, and handle each type individually.
2766 * First we lookup if this type has been already loaded, and if so, use the
2767 * loaded structure instead of the generated one. Then we have to fill in the
2768 * cast linked list. The cast data is initially stored in something like a
2769 * two-dimensional array. Each row corresponds to a type (there are the same
2770 * number of rows as there are in the swig_type_initial array). Each entry in
2771 * a column is one of the swig_cast_info structures for that type.
2772 * The cast_initial array is actually an array of arrays, because each row has
2773 * a variable number of columns. So to actually build the cast linked list,
2774 * we find the array of casts associated with the type, and loop through it
2775 * adding the casts to the list. The one last trick we need to do is making
2776 * sure the type pointer in the swig_cast_info struct is correct.
2778 * First off, we lookup the cast->type name to see if it is already loaded.
2779 * There are three cases to handle:
2780 * 1) If the cast->type has already been loaded AND the type we are adding
2781 * casting info to has not been loaded (it is in this module), THEN we
2782 * replace the cast->type pointer with the type pointer that has already
2784 * 2) If BOTH types (the one we are adding casting info to, and the
2785 * cast->type) are loaded, THEN the cast info has already been loaded by
2786 * the previous module so we just ignore it.
2787 * 3) Finally, if cast->type has not already been loaded, then we add that
2788 * swig_cast_info to the linked list (because the cast->type) pointer will
2790 * ----------------------------------------------------------------------------- */
2800 #define SWIGRUNTIME_DEBUG
2805 SWIG_InitializeModule(void *clientdata) {
2807 swig_module_info *module_head, *iter;
2810 clientdata = clientdata;
2812 /* check to see if the circular list has been setup, if not, set it up */
2813 if (swig_module.next==0) {
2814 /* Initialize the swig_module */
2815 swig_module.type_initial = swig_type_initial;
2816 swig_module.cast_initial = swig_cast_initial;
2817 swig_module.next = &swig_module;
2823 /* Try and load any already created modules */
2824 module_head = SWIG_GetModule(clientdata);
2826 /* This is the first module loaded for this interpreter */
2827 /* so set the swig module into the interpreter */
2828 SWIG_SetModule(clientdata, &swig_module);
2829 module_head = &swig_module;
2831 /* the interpreter has loaded a SWIG module, but has it loaded this one? */
2835 if (iter==&swig_module) {
2840 } while (iter!= module_head);
2842 /* if the is found in the list, then all is done and we may leave */
2844 /* otherwise we must add out module into the list */
2845 swig_module.next = module_head->next;
2846 module_head->next = &swig_module;
2849 /* When multiple interpeters are used, a module could have already been initialized in
2850 a different interpreter, but not yet have a pointer in this interpreter.
2851 In this case, we do not want to continue adding types... everything should be
2853 if (init == 0) return;
2855 /* Now work on filling in swig_module.types */
2856 #ifdef SWIGRUNTIME_DEBUG
2857 printf("SWIG_InitializeModule: size %d\n", swig_module.size);
2859 for (i = 0; i < swig_module.size; ++i) {
2860 swig_type_info *type = 0;
2861 swig_type_info *ret;
2862 swig_cast_info *cast;
2864 #ifdef SWIGRUNTIME_DEBUG
2865 printf("SWIG_InitializeModule: type %d %s\n", i, swig_module.type_initial[i]->name);
2868 /* if there is another module already loaded */
2869 if (swig_module.next != &swig_module) {
2870 type = SWIG_MangledTypeQueryModule(swig_module.next, &swig_module, swig_module.type_initial[i]->name);
2873 /* Overwrite clientdata field */
2874 #ifdef SWIGRUNTIME_DEBUG
2875 printf("SWIG_InitializeModule: found type %s\n", type->name);
2877 if (swig_module.type_initial[i]->clientdata) {
2878 type->clientdata = swig_module.type_initial[i]->clientdata;
2879 #ifdef SWIGRUNTIME_DEBUG
2880 printf("SWIG_InitializeModule: found and overwrite type %s \n", type->name);
2884 type = swig_module.type_initial[i];
2887 /* Insert casting types */
2888 cast = swig_module.cast_initial[i];
2889 while (cast->type) {
2890 /* Don't need to add information already in the list */
2892 #ifdef SWIGRUNTIME_DEBUG
2893 printf("SWIG_InitializeModule: look cast %s\n", cast->type->name);
2895 if (swig_module.next != &swig_module) {
2896 ret = SWIG_MangledTypeQueryModule(swig_module.next, &swig_module, cast->type->name);
2897 #ifdef SWIGRUNTIME_DEBUG
2898 if (ret) printf("SWIG_InitializeModule: found cast %s\n", ret->name);
2902 if (type == swig_module.type_initial[i]) {
2903 #ifdef SWIGRUNTIME_DEBUG
2904 printf("SWIG_InitializeModule: skip old type %s\n", ret->name);
2909 /* Check for casting already in the list */
2910 swig_cast_info *ocast = SWIG_TypeCheck(ret->name, type);
2911 #ifdef SWIGRUNTIME_DEBUG
2912 if (ocast) printf("SWIG_InitializeModule: skip old cast %s\n", ret->name);
2914 if (!ocast) ret = 0;
2919 #ifdef SWIGRUNTIME_DEBUG
2920 printf("SWIG_InitializeModule: adding cast %s\n", cast->type->name);
2923 type->cast->prev = cast;
2924 cast->next = type->cast;
2930 /* Set entry in modules->types array equal to the type */
2931 swig_module.types[i] = type;
2933 swig_module.types[i] = 0;
2935 #ifdef SWIGRUNTIME_DEBUG
2936 printf("**** SWIG_InitializeModule: Cast List ******\n");
2937 for (i = 0; i < swig_module.size; ++i) {
2939 swig_cast_info *cast = swig_module.cast_initial[i];
2940 printf("SWIG_InitializeModule: type %d %s\n", i, swig_module.type_initial[i]->name);
2941 while (cast->type) {
2942 printf("SWIG_InitializeModule: cast type %s\n", cast->type->name);
2946 printf("---- Total casts: %d\n",j);
2948 printf("**** SWIG_InitializeModule: Cast List ******\n");
2952 /* This function will propagate the clientdata field of type to
2953 * any new swig_type_info structures that have been added into the list
2954 * of equivalent types. It is like calling
2955 * SWIG_TypeClientData(type, clientdata) a second time.
2958 SWIG_PropagateClientData(void) {
2960 swig_cast_info *equiv;
2961 static int init_run = 0;
2963 if (init_run) return;
2966 for (i = 0; i < swig_module.size; i++) {
2967 if (swig_module.types[i]->clientdata) {
2968 equiv = swig_module.types[i]->cast;
2970 if (!equiv->converter) {
2971 if (equiv->type && !equiv->type->clientdata)
2972 SWIG_TypeClientData(equiv->type, swig_module.types[i]->clientdata);
2974 equiv = equiv->next;
2998 SWIG_InitializeModule(0);
3000 /* Install commands */
3001 for (i = 0; swig_commands[i].name; i++) {
3002 newXS((char*) swig_commands[i].name,swig_commands[i].wrapper, (char*)__FILE__);
3005 /* Install variables */
3006 for (i = 0; swig_variables[i].name; i++) {
3008 sv = get_sv((char*) swig_variables[i].name, TRUE | 0x2 | GV_ADDMULTI);
3009 if (swig_variables[i].type) {
3010 SWIG_MakePtr(sv,(void *)1, *swig_variables[i].type,0);
3012 sv_setiv(sv,(IV) 0);
3014 swig_create_magic(sv, (char *) swig_variables[i].name, swig_variables[i].set, swig_variables[i].get);
3017 /* Install constant */
3018 for (i = 0; swig_constants[i].type; i++) {
3020 sv = get_sv((char*)swig_constants[i].name, TRUE | 0x2 | GV_ADDMULTI);
3021 switch(swig_constants[i].type) {
3023 sv_setiv(sv, (IV) swig_constants[i].lvalue);
3026 sv_setnv(sv, (double) swig_constants[i].dvalue);
3029 sv_setpv(sv, (char *) swig_constants[i].pvalue);
3032 SWIG_MakePtr(sv, swig_constants[i].pvalue, *(swig_constants[i].ptype),0);
3035 SWIG_MakePackedObj(sv, swig_constants[i].pvalue, swig_constants[i].lvalue, *(swig_constants[i].ptype));
3043 /*@SWIG:/usr/share/swig/1.3.39/perl5/perltypemaps.swg,65,%set_constant@*/ do {
3044 SV *sv = get_sv((char*) SWIG_prefix "L_BOGUS", TRUE | 0x2 | GV_ADDMULTI);
3045 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(L_BOGUS)));
3047 } while(0) /*@SWIG@*/;
3048 /*@SWIG:/usr/share/swig/1.3.39/perl5/perltypemaps.swg,65,%set_constant@*/ do {
3049 SV *sv = get_sv((char*) SWIG_prefix "L_FATAL", TRUE | 0x2 | GV_ADDMULTI);
3050 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(L_FATAL)));
3052 } while(0) /*@SWIG@*/;
3053 /*@SWIG:/usr/share/swig/1.3.39/perl5/perltypemaps.swg,65,%set_constant@*/ do {
3054 SV *sv = get_sv((char*) SWIG_prefix "L_ERROR", TRUE | 0x2 | GV_ADDMULTI);
3055 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(L_ERROR)));
3057 } while(0) /*@SWIG@*/;
3058 /*@SWIG:/usr/share/swig/1.3.39/perl5/perltypemaps.swg,65,%set_constant@*/ do {
3059 SV *sv = get_sv((char*) SWIG_prefix "L_WARNING", TRUE | 0x2 | GV_ADDMULTI);
3060 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(L_WARNING)));
3062 } while(0) /*@SWIG@*/;
3063 /*@SWIG:/usr/share/swig/1.3.39/perl5/perltypemaps.swg,65,%set_constant@*/ do {
3064 SV *sv = get_sv((char*) SWIG_prefix "L_INFO", TRUE | 0x2 | GV_ADDMULTI);
3065 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(L_INFO)));
3067 } while(0) /*@SWIG@*/;
3068 /*@SWIG:/usr/share/swig/1.3.39/perl5/perltypemaps.swg,65,%set_constant@*/ do {
3069 SV *sv = get_sv((char*) SWIG_prefix "L_SUMMARY", TRUE | 0x2 | GV_ADDMULTI);
3070 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(L_SUMMARY)));
3072 } while(0) /*@SWIG@*/;
3073 /*@SWIG:/usr/share/swig/1.3.39/perl5/perltypemaps.swg,65,%set_constant@*/ do {
3074 SV *sv = get_sv((char*) SWIG_prefix "L_START", TRUE | 0x2 | GV_ADDMULTI);
3075 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(L_START)));
3077 } while(0) /*@SWIG@*/;
3078 /*@SWIG:/usr/share/swig/1.3.39/perl5/perltypemaps.swg,65,%set_constant@*/ do {
3079 SV *sv = get_sv((char*) SWIG_prefix "L_FINISH", TRUE | 0x2 | GV_ADDMULTI);
3080 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(L_FINISH)));
3082 } while(0) /*@SWIG@*/;
3083 /*@SWIG:/usr/share/swig/1.3.39/perl5/perltypemaps.swg,65,%set_constant@*/ do {
3084 SV *sv = get_sv((char*) SWIG_prefix "L_DISK", TRUE | 0x2 | GV_ADDMULTI);
3085 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(L_DISK)));
3087 } while(0) /*@SWIG@*/;
3088 /*@SWIG:/usr/share/swig/1.3.39/perl5/perltypemaps.swg,65,%set_constant@*/ do {
3089 SV *sv = get_sv((char*) SWIG_prefix "L_DONE", TRUE | 0x2 | GV_ADDMULTI);
3090 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(L_DONE)));
3092 } while(0) /*@SWIG@*/;
3093 /*@SWIG:/usr/share/swig/1.3.39/perl5/perltypemaps.swg,65,%set_constant@*/ do {
3094 SV *sv = get_sv((char*) SWIG_prefix "L_PART", TRUE | 0x2 | GV_ADDMULTI);
3095 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(L_PART)));
3097 } while(0) /*@SWIG@*/;
3098 /*@SWIG:/usr/share/swig/1.3.39/perl5/perltypemaps.swg,65,%set_constant@*/ do {
3099 SV *sv = get_sv((char*) SWIG_prefix "L_PARTPARTIAL", TRUE | 0x2 | GV_ADDMULTI);
3100 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(L_PARTPARTIAL)));
3102 } while(0) /*@SWIG@*/;
3103 /*@SWIG:/usr/share/swig/1.3.39/perl5/perltypemaps.swg,65,%set_constant@*/ do {
3104 SV *sv = get_sv((char*) SWIG_prefix "L_SUCCESS", TRUE | 0x2 | GV_ADDMULTI);
3105 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(L_SUCCESS)));
3107 } while(0) /*@SWIG@*/;
3108 /*@SWIG:/usr/share/swig/1.3.39/perl5/perltypemaps.swg,65,%set_constant@*/ do {
3109 SV *sv = get_sv((char*) SWIG_prefix "L_PARTIAL", TRUE | 0x2 | GV_ADDMULTI);
3110 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(L_PARTIAL)));
3112 } while(0) /*@SWIG@*/;
3113 /*@SWIG:/usr/share/swig/1.3.39/perl5/perltypemaps.swg,65,%set_constant@*/ do {
3114 SV *sv = get_sv((char*) SWIG_prefix "L_FAIL", TRUE | 0x2 | GV_ADDMULTI);
3115 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(L_FAIL)));
3117 } while(0) /*@SWIG@*/;
3118 /*@SWIG:/usr/share/swig/1.3.39/perl5/perltypemaps.swg,65,%set_constant@*/ do {
3119 SV *sv = get_sv((char*) SWIG_prefix "L_STRANGE", TRUE | 0x2 | GV_ADDMULTI);
3120 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(L_STRANGE)));
3122 } while(0) /*@SWIG@*/;
3123 /*@SWIG:/usr/share/swig/1.3.39/perl5/perltypemaps.swg,65,%set_constant@*/ do {
3124 SV *sv = get_sv((char*) SWIG_prefix "L_CHUNK", TRUE | 0x2 | GV_ADDMULTI);
3125 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(L_CHUNK)));
3127 } while(0) /*@SWIG@*/;
3128 /*@SWIG:/usr/share/swig/1.3.39/perl5/perltypemaps.swg,65,%set_constant@*/ do {
3129 SV *sv = get_sv((char*) SWIG_prefix "L_CHUNKSUCCESS", TRUE | 0x2 | GV_ADDMULTI);
3130 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(L_CHUNKSUCCESS)));
3132 } while(0) /*@SWIG@*/;
3133 /*@SWIG:/usr/share/swig/1.3.39/perl5/perltypemaps.swg,65,%set_constant@*/ do {
3134 SV *sv = get_sv((char*) SWIG_prefix "L_STATS", TRUE | 0x2 | GV_ADDMULTI);
3135 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(L_STATS)));
3137 } while(0) /*@SWIG@*/;
3138 /*@SWIG:/usr/share/swig/1.3.39/perl5/perltypemaps.swg,65,%set_constant@*/ do {
3139 SV *sv = get_sv((char*) SWIG_prefix "L_MARKER", TRUE | 0x2 | GV_ADDMULTI);
3140 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(L_MARKER)));
3142 } while(0) /*@SWIG@*/;
3143 /*@SWIG:/usr/share/swig/1.3.39/perl5/perltypemaps.swg,65,%set_constant@*/ do {
3144 SV *sv = get_sv((char*) SWIG_prefix "L_CONT", TRUE | 0x2 | GV_ADDMULTI);
3145 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(L_CONT)));
3147 } while(0) /*@SWIG@*/;
3148 /*@SWIG:/usr/share/swig/1.3.39/perl5/perltypemaps.swg,65,%set_constant@*/ do {
3149 SV *sv = get_sv((char*) SWIG_prefix "P_UNKNOWN", TRUE | 0x2 | GV_ADDMULTI);
3150 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(P_UNKNOWN)));
3152 } while(0) /*@SWIG@*/;
3153 /*@SWIG:/usr/share/swig/1.3.39/perl5/perltypemaps.swg,65,%set_constant@*/ do {
3154 SV *sv = get_sv((char*) SWIG_prefix "P_PLANNER", TRUE | 0x2 | GV_ADDMULTI);
3155 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(P_PLANNER)));
3157 } while(0) /*@SWIG@*/;
3158 /*@SWIG:/usr/share/swig/1.3.39/perl5/perltypemaps.swg,65,%set_constant@*/ do {
3159 SV *sv = get_sv((char*) SWIG_prefix "P_DRIVER", TRUE | 0x2 | GV_ADDMULTI);
3160 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(P_DRIVER)));
3162 } while(0) /*@SWIG@*/;
3163 /*@SWIG:/usr/share/swig/1.3.39/perl5/perltypemaps.swg,65,%set_constant@*/ do {
3164 SV *sv = get_sv((char*) SWIG_prefix "P_REPORTER", TRUE | 0x2 | GV_ADDMULTI);
3165 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(P_REPORTER)));
3167 } while(0) /*@SWIG@*/;
3168 /*@SWIG:/usr/share/swig/1.3.39/perl5/perltypemaps.swg,65,%set_constant@*/ do {
3169 SV *sv = get_sv((char*) SWIG_prefix "P_DUMPER", TRUE | 0x2 | GV_ADDMULTI);
3170 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(P_DUMPER)));
3172 } while(0) /*@SWIG@*/;
3173 /*@SWIG:/usr/share/swig/1.3.39/perl5/perltypemaps.swg,65,%set_constant@*/ do {
3174 SV *sv = get_sv((char*) SWIG_prefix "P_CHUNKER", TRUE | 0x2 | GV_ADDMULTI);
3175 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(P_CHUNKER)));
3177 } while(0) /*@SWIG@*/;
3178 /*@SWIG:/usr/share/swig/1.3.39/perl5/perltypemaps.swg,65,%set_constant@*/ do {
3179 SV *sv = get_sv((char*) SWIG_prefix "P_TAPER", TRUE | 0x2 | GV_ADDMULTI);
3180 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(P_TAPER)));
3182 } while(0) /*@SWIG@*/;
3183 /*@SWIG:/usr/share/swig/1.3.39/perl5/perltypemaps.swg,65,%set_constant@*/ do {
3184 SV *sv = get_sv((char*) SWIG_prefix "P_AMFLUSH", TRUE | 0x2 | GV_ADDMULTI);
3185 sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(P_AMFLUSH)));
3187 } while(0) /*@SWIG@*/;
3188 SWIG_TypeClientData(SWIGTYPE_p_find_result_t, (void*) "Amanda::Logfile::find_result_t");