qpid_proton 0.13.0 → 0.13.0.1

Sign up to get free protection for your applications and to get access to all the features.
Files changed (3) hide show
  1. checksums.yaml +7 -0
  2. data/ext/cproton/cproton.c +605 -349
  3. metadata +91 -113
checksums.yaml ADDED
@@ -0,0 +1,7 @@
1
+ ---
2
+ SHA1:
3
+ metadata.gz: ee7817c8a1dc0a2d0505e2319beda53515dae9f4
4
+ data.tar.gz: 0c2174c2cc7a273f2c053d96c042950c001d843c
5
+ SHA512:
6
+ metadata.gz: 7aa6f4468a2c4f475ba5ca691fe01b106a19a7e0701b00c2e9b0a503989f6def1493388b0bb09d0358a3c3b5ef3fd979d9c57391fb65f7a1daa609f2c7a6972f
7
+ data.tar.gz: b726e91d4b84013beee380b539d0c0b692ec22bccd2ef63a052643c9ad0960b9218a203d02b678aa7ed41789567dab9768fcae8e6be596ca186785ae4f3a9475
@@ -1,14 +1,18 @@
1
1
  /* ----------------------------------------------------------------------------
2
2
  * This file was automatically generated by SWIG (http://www.swig.org).
3
- * Version 1.3.40
4
- *
5
- * This file is not intended to be easily readable and contains a number of
3
+ * Version 3.0.10
4
+ *
5
+ * This file is not intended to be easily readable and contains a number of
6
6
  * coding conventions designed to improve portability and efficiency. Do not make
7
- * changes to this file unless you know what you are doing--modify the SWIG
8
- * interface file instead.
7
+ * changes to this file unless you know what you are doing--modify the SWIG
8
+ * interface file instead.
9
9
  * ----------------------------------------------------------------------------- */
10
10
 
11
+
12
+ #ifndef SWIGRUBY
11
13
  #define SWIGRUBY
14
+ #endif
15
+
12
16
 
13
17
  /* -----------------------------------------------------------------------------
14
18
  * This section contains generic SWIG labels for method/variable
@@ -41,28 +45,28 @@
41
45
  #ifndef SWIGUNUSED
42
46
  # if defined(__GNUC__)
43
47
  # if !(defined(__cplusplus)) || (__GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4))
44
- # define SWIGUNUSED __attribute__ ((__unused__))
48
+ # define SWIGUNUSED __attribute__ ((__unused__))
45
49
  # else
46
50
  # define SWIGUNUSED
47
51
  # endif
48
52
  # elif defined(__ICC)
49
- # define SWIGUNUSED __attribute__ ((__unused__))
53
+ # define SWIGUNUSED __attribute__ ((__unused__))
50
54
  # else
51
- # define SWIGUNUSED
55
+ # define SWIGUNUSED
52
56
  # endif
53
57
  #endif
54
58
 
55
59
  #ifndef SWIG_MSC_UNSUPPRESS_4505
56
60
  # if defined(_MSC_VER)
57
61
  # pragma warning(disable : 4505) /* unreferenced local function has been removed */
58
- # endif
62
+ # endif
59
63
  #endif
60
64
 
61
65
  #ifndef SWIGUNUSEDPARM
62
66
  # ifdef __cplusplus
63
67
  # define SWIGUNUSEDPARM(p)
64
68
  # else
65
- # define SWIGUNUSEDPARM(p) p SWIGUNUSED
69
+ # define SWIGUNUSEDPARM(p) p SWIGUNUSED
66
70
  # endif
67
71
  #endif
68
72
 
@@ -77,9 +81,11 @@
77
81
  #endif
78
82
 
79
83
  /* exporting methods */
80
- #if (__GNUC__ >= 4) || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4)
81
- # ifndef GCC_HASCLASSVISIBILITY
82
- # define GCC_HASCLASSVISIBILITY
84
+ #if defined(__GNUC__)
85
+ # if (__GNUC__ >= 4) || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4)
86
+ # ifndef GCC_HASCLASSVISIBILITY
87
+ # define GCC_HASCLASSVISIBILITY
88
+ # endif
83
89
  # endif
84
90
  #endif
85
91
 
@@ -105,7 +111,7 @@
105
111
  # define SWIGSTDCALL __stdcall
106
112
  # else
107
113
  # define SWIGSTDCALL
108
- # endif
114
+ # endif
109
115
  #endif
110
116
 
111
117
  /* Deal with Microsoft's attempt at deprecating C standard runtime functions */
@@ -118,6 +124,19 @@
118
124
  # define _SCL_SECURE_NO_DEPRECATE
119
125
  #endif
120
126
 
127
+ /* Deal with Apple's deprecated 'AssertMacros.h' from Carbon-framework */
128
+ #if defined(__APPLE__) && !defined(__ASSERT_MACROS_DEFINE_VERSIONS_WITHOUT_UNDERSCORES)
129
+ # define __ASSERT_MACROS_DEFINE_VERSIONS_WITHOUT_UNDERSCORES 0
130
+ #endif
131
+
132
+ /* Intel's compiler complains if a variable which was never initialised is
133
+ * cast to void, which is a common idiom which we use to indicate that we
134
+ * are aware a variable isn't used. So we just silence that warning.
135
+ * See: https://github.com/swig/swig/issues/192 for more discussion.
136
+ */
137
+ #ifdef __INTEL_COMPILER
138
+ # pragma warning disable 592
139
+ #endif
121
140
 
122
141
  /* -----------------------------------------------------------------------------
123
142
  * This section contains generic SWIG labels for method/variable
@@ -150,28 +169,28 @@
150
169
  #ifndef SWIGUNUSED
151
170
  # if defined(__GNUC__)
152
171
  # if !(defined(__cplusplus)) || (__GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4))
153
- # define SWIGUNUSED __attribute__ ((__unused__))
172
+ # define SWIGUNUSED __attribute__ ((__unused__))
154
173
  # else
155
174
  # define SWIGUNUSED
156
175
  # endif
157
176
  # elif defined(__ICC)
158
- # define SWIGUNUSED __attribute__ ((__unused__))
177
+ # define SWIGUNUSED __attribute__ ((__unused__))
159
178
  # else
160
- # define SWIGUNUSED
179
+ # define SWIGUNUSED
161
180
  # endif
162
181
  #endif
163
182
 
164
183
  #ifndef SWIG_MSC_UNSUPPRESS_4505
165
184
  # if defined(_MSC_VER)
166
185
  # pragma warning(disable : 4505) /* unreferenced local function has been removed */
167
- # endif
186
+ # endif
168
187
  #endif
169
188
 
170
189
  #ifndef SWIGUNUSEDPARM
171
190
  # ifdef __cplusplus
172
191
  # define SWIGUNUSEDPARM(p)
173
192
  # else
174
- # define SWIGUNUSEDPARM(p) p SWIGUNUSED
193
+ # define SWIGUNUSEDPARM(p) p SWIGUNUSED
175
194
  # endif
176
195
  #endif
177
196
 
@@ -186,9 +205,11 @@
186
205
  #endif
187
206
 
188
207
  /* exporting methods */
189
- #if (__GNUC__ >= 4) || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4)
190
- # ifndef GCC_HASCLASSVISIBILITY
191
- # define GCC_HASCLASSVISIBILITY
208
+ #if defined(__GNUC__)
209
+ # if (__GNUC__ >= 4) || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4)
210
+ # ifndef GCC_HASCLASSVISIBILITY
211
+ # define GCC_HASCLASSVISIBILITY
212
+ # endif
192
213
  # endif
193
214
  #endif
194
215
 
@@ -214,7 +235,7 @@
214
235
  # define SWIGSTDCALL __stdcall
215
236
  # else
216
237
  # define SWIGSTDCALL
217
- # endif
238
+ # endif
218
239
  #endif
219
240
 
220
241
  /* Deal with Microsoft's attempt at deprecating C standard runtime functions */
@@ -227,6 +248,19 @@
227
248
  # define _SCL_SECURE_NO_DEPRECATE
228
249
  #endif
229
250
 
251
+ /* Deal with Apple's deprecated 'AssertMacros.h' from Carbon-framework */
252
+ #if defined(__APPLE__) && !defined(__ASSERT_MACROS_DEFINE_VERSIONS_WITHOUT_UNDERSCORES)
253
+ # define __ASSERT_MACROS_DEFINE_VERSIONS_WITHOUT_UNDERSCORES 0
254
+ #endif
255
+
256
+ /* Intel's compiler complains if a variable which was never initialised is
257
+ * cast to void, which is a common idiom which we use to indicate that we
258
+ * are aware a variable isn't used. So we just silence that warning.
259
+ * See: https://github.com/swig/swig/issues/192 for more discussion.
260
+ */
261
+ #ifdef __INTEL_COMPILER
262
+ # pragma warning disable 592
263
+ #endif
230
264
 
231
265
  /* -----------------------------------------------------------------------------
232
266
  * swigrun.swg
@@ -252,7 +286,7 @@
252
286
  You can use the SWIGRUNTIME and SWIGRUNTIMEINLINE macros for
253
287
  creating a static or dynamic library from the SWIG runtime code.
254
288
  In 99.9% of the cases, SWIG just needs to declare them as 'static'.
255
-
289
+
256
290
  But only do this if strictly necessary, ie, if you have problems
257
291
  with your compiler or suchlike.
258
292
  */
@@ -278,16 +312,16 @@
278
312
  #define SWIG_POINTER_OWN 0x1
279
313
 
280
314
 
281
- /*
315
+ /*
282
316
  Flags/methods for returning states.
283
-
284
- The SWIG conversion methods, as ConvertPtr, return and integer
317
+
318
+ The SWIG conversion methods, as ConvertPtr, return an integer
285
319
  that tells if the conversion was successful or not. And if not,
286
320
  an error code can be returned (see swigerrors.swg for the codes).
287
-
321
+
288
322
  Use the following macros/flags to set or process the returning
289
323
  states.
290
-
324
+
291
325
  In old versions of SWIG, code such as the following was usually written:
292
326
 
293
327
  if (SWIG_ConvertPtr(obj,vptr,ty.flags) != -1) {
@@ -320,23 +354,23 @@
320
354
  } else {
321
355
  // fail code
322
356
  }
323
-
357
+
324
358
  I.e., now SWIG_ConvertPtr can return new objects and you can
325
359
  identify the case and take care of the deallocation. Of course that
326
360
  also requires SWIG_ConvertPtr to return new result values, such as
327
361
 
328
- int SWIG_ConvertPtr(obj, ptr,...) {
329
- if (<obj is ok>) {
330
- if (<need new object>) {
331
- *ptr = <ptr to new allocated object>;
332
- return SWIG_NEWOBJ;
333
- } else {
334
- *ptr = <ptr to old object>;
335
- return SWIG_OLDOBJ;
336
- }
337
- } else {
338
- return SWIG_BADOBJ;
339
- }
362
+ int SWIG_ConvertPtr(obj, ptr,...) {
363
+ if (<obj is ok>) {
364
+ if (<need new object>) {
365
+ *ptr = <ptr to new allocated object>;
366
+ return SWIG_NEWOBJ;
367
+ } else {
368
+ *ptr = <ptr to old object>;
369
+ return SWIG_OLDOBJ;
370
+ }
371
+ } else {
372
+ return SWIG_BADOBJ;
373
+ }
340
374
  }
341
375
 
342
376
  Of course, returning the plain '0(success)/-1(fail)' still works, but you can be
@@ -350,17 +384,17 @@
350
384
  int fooi(int);
351
385
 
352
386
  and you call
353
-
387
+
354
388
  food(1) // cast rank '1' (1 -> 1.0)
355
389
  fooi(1) // cast rank '0'
356
390
 
357
391
  just use the SWIG_AddCast()/SWIG_CheckState()
358
392
  */
359
393
 
360
- #define SWIG_OK (0)
394
+ #define SWIG_OK (0)
361
395
  #define SWIG_ERROR (-1)
362
396
  #define SWIG_IsOK(r) (r >= 0)
363
- #define SWIG_ArgError(r) ((r != SWIG_ERROR) ? r : SWIG_TypeError)
397
+ #define SWIG_ArgError(r) ((r != SWIG_ERROR) ? r : SWIG_TypeError)
364
398
 
365
399
  /* The CastRankLimit says how many bits are used for the cast rank */
366
400
  #define SWIG_CASTRANKLIMIT (1 << 8)
@@ -391,14 +425,14 @@
391
425
  # endif
392
426
  # define SWIG_CASTRANKMASK ((SWIG_CASTRANKLIMIT) -1)
393
427
  # define SWIG_CastRank(r) (r & SWIG_CASTRANKMASK)
394
- SWIGINTERNINLINE int SWIG_AddCast(int r) {
428
+ SWIGINTERNINLINE int SWIG_AddCast(int r) {
395
429
  return SWIG_IsOK(r) ? ((SWIG_CastRank(r) < SWIG_MAXCASTRANK) ? (r + 1) : SWIG_ERROR) : r;
396
430
  }
397
- SWIGINTERNINLINE int SWIG_CheckState(int r) {
398
- return SWIG_IsOK(r) ? SWIG_CastRank(r) + 1 : 0;
431
+ SWIGINTERNINLINE int SWIG_CheckState(int r) {
432
+ return SWIG_IsOK(r) ? SWIG_CastRank(r) + 1 : 0;
399
433
  }
400
434
  #else /* no cast-rank mode */
401
- # define SWIG_AddCast
435
+ # define SWIG_AddCast(r) (r)
402
436
  # define SWIG_CheckState(r) (SWIG_IsOK(r) ? 1 : 0)
403
437
  #endif
404
438
 
@@ -442,7 +476,7 @@ typedef struct swig_module_info {
442
476
  void *clientdata; /* Language specific module data */
443
477
  } swig_module_info;
444
478
 
445
- /*
479
+ /*
446
480
  Compare two type names skipping the space characters, therefore
447
481
  "char*" == "char *" and "Class<int>" == "Class<int >", etc.
448
482
 
@@ -462,18 +496,18 @@ SWIG_TypeNameComp(const char *f1, const char *l1,
462
496
 
463
497
  /*
464
498
  Check type equivalence in a name list like <name1>|<name2>|...
465
- Return 0 if not equal, 1 if equal
499
+ Return 0 if equal, -1 if nb < tb, 1 if nb > tb
466
500
  */
467
501
  SWIGRUNTIME int
468
- SWIG_TypeEquiv(const char *nb, const char *tb) {
469
- int equiv = 0;
502
+ SWIG_TypeCmp(const char *nb, const char *tb) {
503
+ int equiv = 1;
470
504
  const char* te = tb + strlen(tb);
471
505
  const char* ne = nb;
472
- while (!equiv && *ne) {
506
+ while (equiv != 0 && *ne) {
473
507
  for (nb = ne; *ne; ++ne) {
474
508
  if (*ne == '|') break;
475
509
  }
476
- equiv = (SWIG_TypeNameComp(nb, ne, tb, te) == 0) ? 1 : 0;
510
+ equiv = SWIG_TypeNameComp(nb, ne, tb, te);
477
511
  if (*ne) ++ne;
478
512
  }
479
513
  return equiv;
@@ -481,24 +515,13 @@ SWIG_TypeEquiv(const char *nb, const char *tb) {
481
515
 
482
516
  /*
483
517
  Check type equivalence in a name list like <name1>|<name2>|...
484
- Return 0 if equal, -1 if nb < tb, 1 if nb > tb
518
+ Return 0 if not equal, 1 if equal
485
519
  */
486
520
  SWIGRUNTIME int
487
- SWIG_TypeCompare(const char *nb, const char *tb) {
488
- int equiv = 0;
489
- const char* te = tb + strlen(tb);
490
- const char* ne = nb;
491
- while (!equiv && *ne) {
492
- for (nb = ne; *ne; ++ne) {
493
- if (*ne == '|') break;
494
- }
495
- equiv = (SWIG_TypeNameComp(nb, ne, tb, te) == 0) ? 1 : 0;
496
- if (*ne) ++ne;
497
- }
498
- return equiv;
521
+ SWIG_TypeEquiv(const char *nb, const char *tb) {
522
+ return SWIG_TypeCmp(nb, tb) == 0 ? 1 : 0;
499
523
  }
500
524
 
501
-
502
525
  /*
503
526
  Check the typename
504
527
  */
@@ -526,7 +549,7 @@ SWIG_TypeCheck(const char *c, swig_type_info *ty) {
526
549
  return 0;
527
550
  }
528
551
 
529
- /*
552
+ /*
530
553
  Identical to SWIG_TypeCheck, except strcmp is replaced with a pointer comparison
531
554
  */
532
555
  SWIGRUNTIME swig_cast_info *
@@ -561,7 +584,7 @@ SWIG_TypeCast(swig_cast_info *ty, void *ptr, int *newmemory) {
561
584
  return ((!ty) || (!ty->converter)) ? ptr : (*ty->converter)(ptr, newmemory);
562
585
  }
563
586
 
564
- /*
587
+ /*
565
588
  Dynamic pointer casting. Down an inheritance hierarchy
566
589
  */
567
590
  SWIGRUNTIME swig_type_info *
@@ -605,7 +628,7 @@ SWIG_TypePrettyName(const swig_type_info *type) {
605
628
  return type->name;
606
629
  }
607
630
 
608
- /*
631
+ /*
609
632
  Set the clientdata field for a type
610
633
  */
611
634
  SWIGRUNTIME void
@@ -613,14 +636,14 @@ SWIG_TypeClientData(swig_type_info *ti, void *clientdata) {
613
636
  swig_cast_info *cast = ti->cast;
614
637
  /* if (ti->clientdata == clientdata) return; */
615
638
  ti->clientdata = clientdata;
616
-
639
+
617
640
  while (cast) {
618
641
  if (!cast->converter) {
619
642
  swig_type_info *tc = cast->type;
620
643
  if (!tc->clientdata) {
621
644
  SWIG_TypeClientData(tc, clientdata);
622
645
  }
623
- }
646
+ }
624
647
  cast = cast->next;
625
648
  }
626
649
  }
@@ -629,31 +652,31 @@ SWIG_TypeNewClientData(swig_type_info *ti, void *clientdata) {
629
652
  SWIG_TypeClientData(ti, clientdata);
630
653
  ti->owndata = 1;
631
654
  }
632
-
655
+
633
656
  /*
634
657
  Search for a swig_type_info structure only by mangled name
635
658
  Search is a O(log #types)
636
-
637
- We start searching at module start, and finish searching when start == end.
659
+
660
+ We start searching at module start, and finish searching when start == end.
638
661
  Note: if start == end at the beginning of the function, we go all the way around
639
662
  the circular list.
640
663
  */
641
664
  SWIGRUNTIME swig_type_info *
642
- SWIG_MangledTypeQueryModule(swig_module_info *start,
643
- swig_module_info *end,
665
+ SWIG_MangledTypeQueryModule(swig_module_info *start,
666
+ swig_module_info *end,
644
667
  const char *name) {
645
668
  swig_module_info *iter = start;
646
669
  do {
647
670
  if (iter->size) {
648
- register size_t l = 0;
649
- register size_t r = iter->size - 1;
671
+ size_t l = 0;
672
+ size_t r = iter->size - 1;
650
673
  do {
651
674
  /* since l+r >= 0, we can (>> 1) instead (/ 2) */
652
- register size_t i = (l + r) >> 1;
675
+ size_t i = (l + r) >> 1;
653
676
  const char *iname = iter->types[i]->name;
654
677
  if (iname) {
655
- register int compare = strcmp(name, iname);
656
- if (compare == 0) {
678
+ int compare = strcmp(name, iname);
679
+ if (compare == 0) {
657
680
  return iter->types[i];
658
681
  } else if (compare < 0) {
659
682
  if (i) {
@@ -678,14 +701,14 @@ SWIG_MangledTypeQueryModule(swig_module_info *start,
678
701
  Search for a swig_type_info structure for either a mangled name or a human readable name.
679
702
  It first searches the mangled names of the types, which is a O(log #types)
680
703
  If a type is not found it then searches the human readable names, which is O(#types).
681
-
682
- We start searching at module start, and finish searching when start == end.
704
+
705
+ We start searching at module start, and finish searching when start == end.
683
706
  Note: if start == end at the beginning of the function, we go all the way around
684
707
  the circular list.
685
708
  */
686
709
  SWIGRUNTIME swig_type_info *
687
- SWIG_TypeQueryModule(swig_module_info *start,
688
- swig_module_info *end,
710
+ SWIG_TypeQueryModule(swig_module_info *start,
711
+ swig_module_info *end,
689
712
  const char *name) {
690
713
  /* STEP 1: Search the name field using binary search */
691
714
  swig_type_info *ret = SWIG_MangledTypeQueryModule(start, end, name);
@@ -696,7 +719,7 @@ SWIG_TypeQueryModule(swig_module_info *start,
696
719
  of the str field (the human readable name) */
697
720
  swig_module_info *iter = start;
698
721
  do {
699
- register size_t i = 0;
722
+ size_t i = 0;
700
723
  for (; i < iter->size; ++i) {
701
724
  if (iter->types[i]->str && (SWIG_TypeEquiv(iter->types[i]->str, name)))
702
725
  return iter->types[i];
@@ -704,56 +727,56 @@ SWIG_TypeQueryModule(swig_module_info *start,
704
727
  iter = iter->next;
705
728
  } while (iter != end);
706
729
  }
707
-
730
+
708
731
  /* neither found a match */
709
732
  return 0;
710
733
  }
711
734
 
712
- /*
735
+ /*
713
736
  Pack binary data into a string
714
737
  */
715
738
  SWIGRUNTIME char *
716
739
  SWIG_PackData(char *c, void *ptr, size_t sz) {
717
740
  static const char hex[17] = "0123456789abcdef";
718
- register const unsigned char *u = (unsigned char *) ptr;
719
- register const unsigned char *eu = u + sz;
741
+ const unsigned char *u = (unsigned char *) ptr;
742
+ const unsigned char *eu = u + sz;
720
743
  for (; u != eu; ++u) {
721
- register unsigned char uu = *u;
744
+ unsigned char uu = *u;
722
745
  *(c++) = hex[(uu & 0xf0) >> 4];
723
746
  *(c++) = hex[uu & 0xf];
724
747
  }
725
748
  return c;
726
749
  }
727
750
 
728
- /*
751
+ /*
729
752
  Unpack binary data from a string
730
753
  */
731
754
  SWIGRUNTIME const char *
732
755
  SWIG_UnpackData(const char *c, void *ptr, size_t sz) {
733
- register unsigned char *u = (unsigned char *) ptr;
734
- register const unsigned char *eu = u + sz;
756
+ unsigned char *u = (unsigned char *) ptr;
757
+ const unsigned char *eu = u + sz;
735
758
  for (; u != eu; ++u) {
736
- register char d = *(c++);
737
- register unsigned char uu;
759
+ char d = *(c++);
760
+ unsigned char uu;
738
761
  if ((d >= '0') && (d <= '9'))
739
- uu = ((d - '0') << 4);
762
+ uu = (unsigned char)((d - '0') << 4);
740
763
  else if ((d >= 'a') && (d <= 'f'))
741
- uu = ((d - ('a'-10)) << 4);
742
- else
764
+ uu = (unsigned char)((d - ('a'-10)) << 4);
765
+ else
743
766
  return (char *) 0;
744
767
  d = *(c++);
745
768
  if ((d >= '0') && (d <= '9'))
746
- uu |= (d - '0');
769
+ uu |= (unsigned char)(d - '0');
747
770
  else if ((d >= 'a') && (d <= 'f'))
748
- uu |= (d - ('a'-10));
749
- else
771
+ uu |= (unsigned char)(d - ('a'-10));
772
+ else
750
773
  return (char *) 0;
751
774
  *u = uu;
752
775
  }
753
776
  return c;
754
777
  }
755
778
 
756
- /*
779
+ /*
757
780
  Pack 'void *' into a string buffer.
758
781
  */
759
782
  SWIGRUNTIME char *
@@ -813,24 +836,33 @@ SWIG_UnpackDataName(const char *c, void *ptr, size_t sz, const char *name) {
813
836
  #endif
814
837
 
815
838
  /* Errors in SWIG */
816
- #define SWIG_UnknownError -1
817
- #define SWIG_IOError -2
818
- #define SWIG_RuntimeError -3
819
- #define SWIG_IndexError -4
820
- #define SWIG_TypeError -5
821
- #define SWIG_DivisionByZero -6
822
- #define SWIG_OverflowError -7
823
- #define SWIG_SyntaxError -8
824
- #define SWIG_ValueError -9
839
+ #define SWIG_UnknownError -1
840
+ #define SWIG_IOError -2
841
+ #define SWIG_RuntimeError -3
842
+ #define SWIG_IndexError -4
843
+ #define SWIG_TypeError -5
844
+ #define SWIG_DivisionByZero -6
845
+ #define SWIG_OverflowError -7
846
+ #define SWIG_SyntaxError -8
847
+ #define SWIG_ValueError -9
825
848
  #define SWIG_SystemError -10
826
849
  #define SWIG_AttributeError -11
827
- #define SWIG_MemoryError -12
850
+ #define SWIG_MemoryError -12
828
851
  #define SWIG_NullReferenceError -13
829
852
 
830
853
 
831
854
 
832
855
  #include <ruby.h>
833
856
 
857
+ /* Ruby 1.9.1 has a "memoisation optimisation" when compiling with GCC which
858
+ * breaks using rb_intern as an lvalue, as SWIG does. We work around this
859
+ * issue for now by disabling this.
860
+ * https://sourceforge.net/tracker/?func=detail&aid=2859614&group_id=1645&atid=101645
861
+ */
862
+ #ifdef rb_intern
863
+ # undef rb_intern
864
+ #endif
865
+
834
866
  /* Remove global macros defined in Ruby's win32.h */
835
867
  #ifdef write
836
868
  # undef write
@@ -989,7 +1021,7 @@ static VALUE _mSWIG = Qnil;
989
1021
 
990
1022
  /* Define custom exceptions for errors that do not map to existing Ruby
991
1023
  exceptions. Note this only works for C++ since a global cannot be
992
- initialized by a funtion in C. For C, fallback to rb_eRuntimeError.*/
1024
+ initialized by a function in C. For C, fallback to rb_eRuntimeError.*/
993
1025
 
994
1026
  SWIGINTERN VALUE
995
1027
  getNullReferenceError(void) {
@@ -1134,9 +1166,6 @@ void Ruby_Format_OverloadedError(
1134
1166
  }
1135
1167
 
1136
1168
  /* -----------------------------------------------------------------------------
1137
- * See the LICENSE file for information on copyright, usage and redistribution
1138
- * of SWIG, and the README file for authors - http://www.swig.org/release.html.
1139
- *
1140
1169
  * rubytracking.swg
1141
1170
  *
1142
1171
  * This file contains support for tracking mappings from
@@ -1149,6 +1178,11 @@ void Ruby_Format_OverloadedError(
1149
1178
  extern "C" {
1150
1179
  #endif
1151
1180
 
1181
+ #if !defined(ST_DATA_T_DEFINED)
1182
+ /* Needs to be explicitly included for Ruby 1.8 and earlier */
1183
+ #include <st.h>
1184
+ #endif
1185
+
1152
1186
  /* Ruby 1.8 actually assumes the first case. */
1153
1187
  #if SIZEOF_VOIDP == SIZEOF_LONG
1154
1188
  # define SWIG2NUM(v) LONG2NUM((unsigned long)v)
@@ -1160,19 +1194,19 @@ extern "C" {
1160
1194
  # error sizeof(void*) is not the same as long or long long
1161
1195
  #endif
1162
1196
 
1163
-
1164
- /* Global Ruby hash table to store Trackings from C/C++
1197
+ /* Global hash table to store Trackings from C/C++
1165
1198
  structs to Ruby Objects.
1166
1199
  */
1167
- static VALUE swig_ruby_trackings = Qnil;
1200
+ static st_table* swig_ruby_trackings = NULL;
1201
+
1202
+ static VALUE swig_ruby_trackings_count(ANYARGS) {
1203
+ return SWIG2NUM(swig_ruby_trackings->num_entries);
1204
+ }
1168
1205
 
1169
- /* Global variable that stores a reference to the ruby
1170
- hash table delete function. */
1171
- static ID swig_ruby_hash_delete;
1172
1206
 
1173
- /* Setup a Ruby hash table to store Trackings */
1207
+ /* Setup a hash table to store Trackings */
1174
1208
  SWIGRUNTIME void SWIG_RubyInitializeTrackings(void) {
1175
- /* Create a ruby hash table to store Trackings from C++
1209
+ /* Create a hash table to store Trackings from C++
1176
1210
  objects to Ruby objects. */
1177
1211
 
1178
1212
  /* Try to see if some other .so has already created a
@@ -1181,88 +1215,46 @@ SWIGRUNTIME void SWIG_RubyInitializeTrackings(void) {
1181
1215
  This is done to allow multiple DSOs to share the same
1182
1216
  tracking table.
1183
1217
  */
1184
- ID trackings_id = rb_intern( "@__trackings__" );
1218
+ VALUE trackings_value = Qnil;
1219
+ /* change the variable name so that we can mix modules
1220
+ compiled with older SWIG's - this used to be called "@__trackings__" */
1221
+ ID trackings_id = rb_intern( "@__safetrackings__" );
1185
1222
  VALUE verbose = rb_gv_get("VERBOSE");
1186
1223
  rb_gv_set("VERBOSE", Qfalse);
1187
- swig_ruby_trackings = rb_ivar_get( _mSWIG, trackings_id );
1224
+ trackings_value = rb_ivar_get( _mSWIG, trackings_id );
1188
1225
  rb_gv_set("VERBOSE", verbose);
1189
1226
 
1190
- /* No, it hasn't. Create one ourselves */
1191
- if ( swig_ruby_trackings == Qnil )
1192
- {
1193
- swig_ruby_trackings = rb_hash_new();
1194
- rb_ivar_set( _mSWIG, trackings_id, swig_ruby_trackings );
1195
- }
1196
-
1197
- /* Now store a reference to the hash table delete function
1198
- so that we only have to look it up once.*/
1199
- swig_ruby_hash_delete = rb_intern("delete");
1200
- }
1201
-
1202
- /* Get a Ruby number to reference a pointer */
1203
- SWIGRUNTIME VALUE SWIG_RubyPtrToReference(void* ptr) {
1204
- /* We cast the pointer to an unsigned long
1205
- and then store a reference to it using
1206
- a Ruby number object. */
1207
-
1208
- /* Convert the pointer to a Ruby number */
1209
- return SWIG2NUM(ptr);
1210
- }
1211
-
1212
- /* Get a Ruby number to reference an object */
1213
- SWIGRUNTIME VALUE SWIG_RubyObjectToReference(VALUE object) {
1214
- /* We cast the object to an unsigned long
1215
- and then store a reference to it using
1216
- a Ruby number object. */
1217
-
1218
- /* Convert the Object to a Ruby number */
1219
- return SWIG2NUM(object);
1220
- }
1221
-
1222
- /* Get a Ruby object from a previously stored reference */
1223
- SWIGRUNTIME VALUE SWIG_RubyReferenceToObject(VALUE reference) {
1224
- /* The provided Ruby number object is a reference
1225
- to the Ruby object we want.*/
1227
+ /* The trick here is that we have to store the hash table
1228
+ pointer in a Ruby variable. We do not want Ruby's GC to
1229
+ treat this pointer as a Ruby object, so we convert it to
1230
+ a Ruby numeric value. */
1231
+ if (trackings_value == Qnil) {
1232
+ /* No, it hasn't. Create one ourselves */
1233
+ swig_ruby_trackings = st_init_numtable();
1234
+ rb_ivar_set( _mSWIG, trackings_id, SWIG2NUM(swig_ruby_trackings) );
1235
+ } else {
1236
+ swig_ruby_trackings = (st_table*)NUM2SWIG(trackings_value);
1237
+ }
1226
1238
 
1227
- /* Convert the Ruby number to a Ruby object */
1228
- return NUM2SWIG(reference);
1239
+ rb_define_virtual_variable("SWIG_TRACKINGS_COUNT", swig_ruby_trackings_count, NULL);
1229
1240
  }
1230
1241
 
1231
1242
  /* Add a Tracking from a C/C++ struct to a Ruby object */
1232
1243
  SWIGRUNTIME void SWIG_RubyAddTracking(void* ptr, VALUE object) {
1233
- /* In a Ruby hash table we store the pointer and
1234
- the associated Ruby object. The trick here is
1235
- that we cannot store the Ruby object directly - if
1236
- we do then it cannot be garbage collected. So
1237
- instead we typecast it as a unsigned long and
1238
- convert it to a Ruby number object.*/
1239
-
1240
- /* Get a reference to the pointer as a Ruby number */
1241
- VALUE key = SWIG_RubyPtrToReference(ptr);
1242
-
1243
- /* Get a reference to the Ruby object as a Ruby number */
1244
- VALUE value = SWIG_RubyObjectToReference(object);
1245
-
1246
1244
  /* Store the mapping to the global hash table. */
1247
- rb_hash_aset(swig_ruby_trackings, key, value);
1245
+ st_insert(swig_ruby_trackings, (st_data_t)ptr, object);
1248
1246
  }
1249
1247
 
1250
1248
  /* Get the Ruby object that owns the specified C/C++ struct */
1251
1249
  SWIGRUNTIME VALUE SWIG_RubyInstanceFor(void* ptr) {
1252
- /* Get a reference to the pointer as a Ruby number */
1253
- VALUE key = SWIG_RubyPtrToReference(ptr);
1254
-
1255
1250
  /* Now lookup the value stored in the global hash table */
1256
- VALUE value = rb_hash_aref(swig_ruby_trackings, key);
1257
-
1258
- if (value == Qnil) {
1259
- /* No object exists - return nil. */
1251
+ VALUE value;
1252
+
1253
+ if (st_lookup(swig_ruby_trackings, (st_data_t)ptr, &value)) {
1254
+ return value;
1255
+ } else {
1260
1256
  return Qnil;
1261
1257
  }
1262
- else {
1263
- /* Convert this value to Ruby object */
1264
- return SWIG_RubyReferenceToObject(value);
1265
- }
1266
1258
  }
1267
1259
 
1268
1260
  /* Remove a Tracking from a C/C++ struct to a Ruby object. It
@@ -1270,12 +1262,8 @@ SWIGRUNTIME VALUE SWIG_RubyInstanceFor(void* ptr) {
1270
1262
  since the same memory address may be reused later to create
1271
1263
  a new object. */
1272
1264
  SWIGRUNTIME void SWIG_RubyRemoveTracking(void* ptr) {
1273
- /* Get a reference to the pointer as a Ruby number */
1274
- VALUE key = SWIG_RubyPtrToReference(ptr);
1275
-
1276
- /* Delete the object from the hash table by calling Ruby's
1277
- do this we need to call the Hash.delete method.*/
1278
- rb_funcall(swig_ruby_trackings, swig_ruby_hash_delete, 1, key);
1265
+ /* Delete the object from the hash table */
1266
+ st_delete(swig_ruby_trackings, (st_data_t *)&ptr, NULL);
1279
1267
  }
1280
1268
 
1281
1269
  /* This is a helper method that unlinks a Ruby object from its
@@ -1285,10 +1273,25 @@ SWIGRUNTIME void SWIG_RubyUnlinkObjects(void* ptr) {
1285
1273
  VALUE object = SWIG_RubyInstanceFor(ptr);
1286
1274
 
1287
1275
  if (object != Qnil) {
1276
+ if (TYPE(object) != T_DATA)
1277
+ abort();
1288
1278
  DATA_PTR(object) = 0;
1289
1279
  }
1290
1280
  }
1291
1281
 
1282
+ /* This is a helper method that iterates over all the trackings
1283
+ passing the C++ object pointer and its related Ruby object
1284
+ to the passed callback function. */
1285
+
1286
+ /* Proxy method to abstract the internal trackings datatype */
1287
+ static int swig_ruby_internal_iterate_callback(void* ptr, VALUE obj, void(*meth)(void* ptr, VALUE obj)) {
1288
+ (*meth)(ptr, obj);
1289
+ return ST_CONTINUE;
1290
+ }
1291
+
1292
+ SWIGRUNTIME void SWIG_RubyIterateTrackings( void(*meth)(void* ptr, VALUE obj) ) {
1293
+ st_foreach(swig_ruby_trackings, (int (*)(ANYARGS))&swig_ruby_internal_iterate_callback, (st_data_t)meth);
1294
+ }
1292
1295
 
1293
1296
  #ifdef __cplusplus
1294
1297
  }
@@ -1332,9 +1335,6 @@ SWIG_Ruby_AppendOutput(VALUE target, VALUE o) {
1332
1335
 
1333
1336
 
1334
1337
  /* -----------------------------------------------------------------------------
1335
- * See the LICENSE file for information on copyright, usage and redistribution
1336
- * of SWIG, and the README file for authors - http://www.swig.org/release.html.
1337
- *
1338
1338
  * rubyrun.swg
1339
1339
  *
1340
1340
  * This file contains the runtime support for Ruby modules
@@ -1350,7 +1350,7 @@ SWIG_Ruby_AppendOutput(VALUE target, VALUE o) {
1350
1350
  #define SWIG_ConvertPtrAndOwn(obj,pptr,type,flags,own) SWIG_Ruby_ConvertPtrAndOwn(obj, pptr, type, flags, own)
1351
1351
  #define SWIG_NewPointerObj(ptr, type, flags) SWIG_Ruby_NewPointerObj(ptr, type, flags)
1352
1352
  #define SWIG_AcquirePtr(ptr, own) SWIG_Ruby_AcquirePtr(ptr, own)
1353
- #define swig_owntype ruby_owntype
1353
+ #define swig_owntype swig_ruby_owntype
1354
1354
 
1355
1355
  /* for raw packed data */
1356
1356
  #define SWIG_ConvertPacked(obj, ptr, sz, ty) SWIG_Ruby_ConvertPacked(obj, ptr, sz, ty, flags)
@@ -1371,14 +1371,14 @@ SWIG_Ruby_AppendOutput(VALUE target, VALUE o) {
1371
1371
 
1372
1372
  /* Runtime API */
1373
1373
 
1374
- #define SWIG_GetModule(clientdata) SWIG_Ruby_GetModule()
1374
+ #define SWIG_GetModule(clientdata) SWIG_Ruby_GetModule(clientdata)
1375
1375
  #define SWIG_SetModule(clientdata, pointer) SWIG_Ruby_SetModule(pointer)
1376
1376
 
1377
1377
 
1378
1378
  /* Error manipulation */
1379
1379
 
1380
1380
  #define SWIG_ErrorType(code) SWIG_Ruby_ErrorType(code)
1381
- #define SWIG_Error(code, msg) rb_raise(SWIG_Ruby_ErrorType(code), msg)
1381
+ #define SWIG_Error(code, msg) rb_raise(SWIG_Ruby_ErrorType(code), "%s", msg)
1382
1382
  #define SWIG_fail goto fail
1383
1383
 
1384
1384
 
@@ -1433,7 +1433,7 @@ static ID swig_call_id = 0;
1433
1433
  ++swig_virtual_calls;
1434
1434
  # define SWIG_RELEASE_STACK --swig_virtual_calls;
1435
1435
  # define Ruby_DirectorTypeMismatchException(x) \
1436
- rb_raise( rb_eTypeError, x ); return c_result;
1436
+ rb_raise( rb_eTypeError, "%s", x ); return c_result;
1437
1437
 
1438
1438
  static unsigned int swig_virtual_calls = 0;
1439
1439
 
@@ -1487,14 +1487,13 @@ SWIG_Ruby_InitRuntime(void)
1487
1487
  SWIGRUNTIME void
1488
1488
  SWIG_Ruby_define_class(swig_type_info *type)
1489
1489
  {
1490
- VALUE klass;
1491
1490
  char *klass_name = (char *) malloc(4 + strlen(type->name) + 1);
1492
1491
  sprintf(klass_name, "TYPE%s", type->name);
1493
1492
  if (NIL_P(_cSWIG_Pointer)) {
1494
1493
  _cSWIG_Pointer = rb_define_class_under(_mSWIG, "Pointer", rb_cObject);
1495
1494
  rb_undef_method(CLASS_OF(_cSWIG_Pointer), "new");
1496
1495
  }
1497
- klass = rb_define_class_under(_mSWIG, klass_name, _cSWIG_Pointer);
1496
+ rb_define_class_under(_mSWIG, klass_name, _cSWIG_Pointer);
1498
1497
  free((void *) klass_name);
1499
1498
  }
1500
1499
 
@@ -1525,7 +1524,7 @@ SWIG_Ruby_NewPointerObj(void *ptr, swig_type_info *type, int flags)
1525
1524
  downcast methods. */
1526
1525
  if (obj != Qnil) {
1527
1526
  VALUE value = rb_iv_get(obj, "@__swigtype__");
1528
- char* type_name = RSTRING_PTR(value);
1527
+ const char* type_name = RSTRING_PTR(value);
1529
1528
 
1530
1529
  if (strcmp(type->name, type_name) == 0) {
1531
1530
  return obj;
@@ -1575,22 +1574,24 @@ SWIG_Ruby_MangleStr(VALUE obj)
1575
1574
  }
1576
1575
 
1577
1576
  /* Acquire a pointer value */
1578
- typedef void (*ruby_owntype)(void*);
1577
+ typedef struct {
1578
+ void (*datafree)(void *);
1579
+ int own;
1580
+ } swig_ruby_owntype;
1579
1581
 
1580
- SWIGRUNTIME ruby_owntype
1581
- SWIG_Ruby_AcquirePtr(VALUE obj, ruby_owntype own) {
1582
+ SWIGRUNTIME swig_ruby_owntype
1583
+ SWIG_Ruby_AcquirePtr(VALUE obj, swig_ruby_owntype own) {
1584
+ swig_ruby_owntype oldown = {0, 0};
1582
1585
  if (obj) {
1583
- ruby_owntype oldown = RDATA(obj)->dfree;
1584
- RDATA(obj)->dfree = own;
1585
- return oldown;
1586
- } else {
1587
- return 0;
1586
+ oldown.datafree = RDATA(obj)->dfree;
1587
+ RDATA(obj)->dfree = own.datafree;
1588
1588
  }
1589
+ return oldown;
1589
1590
  }
1590
1591
 
1591
1592
  /* Convert a pointer value */
1592
1593
  SWIGRUNTIME int
1593
- SWIG_Ruby_ConvertPtrAndOwn(VALUE obj, void **ptr, swig_type_info *ty, int flags, ruby_owntype *own)
1594
+ SWIG_Ruby_ConvertPtrAndOwn(VALUE obj, void **ptr, swig_type_info *ty, int flags, swig_ruby_owntype *own)
1594
1595
  {
1595
1596
  char *c;
1596
1597
  swig_cast_info *tc;
@@ -1598,7 +1599,8 @@ SWIG_Ruby_ConvertPtrAndOwn(VALUE obj, void **ptr, swig_type_info *ty, int flags,
1598
1599
 
1599
1600
  /* Grab the pointer */
1600
1601
  if (NIL_P(obj)) {
1601
- *ptr = 0;
1602
+ if (ptr)
1603
+ *ptr = 0;
1602
1604
  return SWIG_OK;
1603
1605
  } else {
1604
1606
  if (TYPE(obj) != T_DATA) {
@@ -1607,7 +1609,10 @@ SWIG_Ruby_ConvertPtrAndOwn(VALUE obj, void **ptr, swig_type_info *ty, int flags,
1607
1609
  Data_Get_Struct(obj, void, vptr);
1608
1610
  }
1609
1611
 
1610
- if (own) *own = RDATA(obj)->dfree;
1612
+ if (own) {
1613
+ own->datafree = RDATA(obj)->dfree;
1614
+ own->own = 0;
1615
+ }
1611
1616
 
1612
1617
  /* Check to see if the input object is giving up ownership
1613
1618
  of the underlying C struct or C++ object. If so then we
@@ -1642,8 +1647,6 @@ SWIG_Ruby_ConvertPtrAndOwn(VALUE obj, void **ptr, swig_type_info *ty, int flags,
1642
1647
  /* The object has already been deleted */
1643
1648
  return SWIG_ObjectPreviouslyDeletedError;
1644
1649
  }
1645
- *ptr = vptr;
1646
- return SWIG_OK;
1647
1650
  }
1648
1651
  }
1649
1652
  if ((c = SWIG_MangleStr(obj)) == NULL) {
@@ -1653,12 +1656,23 @@ SWIG_Ruby_ConvertPtrAndOwn(VALUE obj, void **ptr, swig_type_info *ty, int flags,
1653
1656
  if (!tc) {
1654
1657
  return SWIG_ERROR;
1655
1658
  } else {
1656
- int newmemory = 0;
1657
- *ptr = SWIG_TypeCast(tc, vptr, &newmemory);
1658
- assert(!newmemory); /* newmemory handling not yet implemented */
1659
+ if (ptr) {
1660
+ if (tc->type == ty) {
1661
+ *ptr = vptr;
1662
+ } else {
1663
+ int newmemory = 0;
1664
+ *ptr = SWIG_TypeCast(tc, vptr, &newmemory);
1665
+ if (newmemory == SWIG_CAST_NEW_MEMORY) {
1666
+ assert(own); /* badly formed typemap which will lead to a memory leak - it must set and use own to delete *ptr */
1667
+ if (own)
1668
+ own->own = own->own | SWIG_CAST_NEW_MEMORY;
1669
+ }
1670
+ }
1671
+ }
1659
1672
  }
1660
1673
  } else {
1661
- *ptr = vptr;
1674
+ if (ptr)
1675
+ *ptr = vptr;
1662
1676
  }
1663
1677
 
1664
1678
  return SWIG_OK;
@@ -1707,7 +1721,7 @@ SWIG_Ruby_ConvertPacked(VALUE obj, void *ptr, int sz, swig_type_info *ty) {
1707
1721
  }
1708
1722
 
1709
1723
  SWIGRUNTIME swig_module_info *
1710
- SWIG_Ruby_GetModule(void)
1724
+ SWIG_Ruby_GetModule(void *SWIGUNUSEDPARM(clientdata))
1711
1725
  {
1712
1726
  VALUE pointer;
1713
1727
  swig_module_info *ret = 0;
@@ -1747,7 +1761,7 @@ SWIG_Ruby_SetModule(swig_module_info *pointer)
1747
1761
  SWIGINTERN
1748
1762
  int SWIG_Ruby_isCallable( VALUE proc )
1749
1763
  {
1750
- if ( rb_respond_to( proc, swig_call_id ) == Qtrue )
1764
+ if ( rb_respond_to( proc, swig_call_id ) )
1751
1765
  return 1;
1752
1766
  return 0;
1753
1767
  }
@@ -1760,7 +1774,7 @@ int SWIG_Ruby_isCallable( VALUE proc )
1760
1774
  SWIGINTERN
1761
1775
  int SWIG_Ruby_arity( VALUE proc, int minimal )
1762
1776
  {
1763
- if ( rb_respond_to( proc, swig_arity_id ) == Qtrue )
1777
+ if ( rb_respond_to( proc, swig_arity_id ) )
1764
1778
  {
1765
1779
  VALUE num = rb_funcall( proc, swig_arity_id, 0 );
1766
1780
  int arity = NUM2INT(num);
@@ -1877,7 +1891,7 @@ static VALUE mCproton;
1877
1891
  #define SWIG_RUBY_THREAD_END_BLOCK
1878
1892
 
1879
1893
 
1880
- #define SWIGVERSION 0x010340
1894
+ #define SWIGVERSION 0x030010
1881
1895
  #define SWIG_VERSION SWIGVERSION
1882
1896
 
1883
1897
 
@@ -1909,7 +1923,7 @@ SWIG_ruby_failed(void)
1909
1923
  }
1910
1924
 
1911
1925
 
1912
- /*@SWIG:/usr/share/swig/1.3.40/ruby/rubyprimtypes.swg,23,%ruby_aux_method@*/
1926
+ /*@SWIG:/usr/share/swig/3.0.10/ruby/rubyprimtypes.swg,19,%ruby_aux_method@*/
1913
1927
  SWIGINTERN VALUE SWIG_AUX_NUM2ULONG(VALUE *args)
1914
1928
  {
1915
1929
  VALUE obj = args[0];
@@ -1938,12 +1952,69 @@ SWIG_AsVal_unsigned_SS_long (VALUE obj, unsigned long *val)
1938
1952
  }
1939
1953
 
1940
1954
 
1955
+ #include <limits.h>
1956
+ #if !defined(SWIG_NO_LLONG_MAX)
1957
+ # if !defined(LLONG_MAX) && defined(__GNUC__) && defined (__LONG_LONG_MAX__)
1958
+ # define LLONG_MAX __LONG_LONG_MAX__
1959
+ # define LLONG_MIN (-LLONG_MAX - 1LL)
1960
+ # define ULLONG_MAX (LLONG_MAX * 2ULL + 1ULL)
1961
+ # endif
1962
+ #endif
1963
+
1964
+
1965
+ #if defined(LLONG_MAX) && !defined(SWIG_LONG_LONG_AVAILABLE)
1966
+ # define SWIG_LONG_LONG_AVAILABLE
1967
+ #endif
1968
+
1969
+
1970
+ #ifdef SWIG_LONG_LONG_AVAILABLE
1971
+ /*@SWIG:/usr/share/swig/3.0.10/ruby/rubyprimtypes.swg,19,%ruby_aux_method@*/
1972
+ SWIGINTERN VALUE SWIG_AUX_NUM2ULL(VALUE *args)
1973
+ {
1974
+ VALUE obj = args[0];
1975
+ VALUE type = TYPE(obj);
1976
+ long long *res = (long long *)(args[1]);
1977
+ *res = type == T_FIXNUM ? NUM2ULL(obj) : rb_big2ull(obj);
1978
+ return obj;
1979
+ }
1980
+ /*@SWIG@*/
1981
+
1982
+ SWIGINTERN int
1983
+ SWIG_AsVal_unsigned_SS_long_SS_long (VALUE obj, unsigned long long *val)
1984
+ {
1985
+ VALUE type = TYPE(obj);
1986
+ if ((type == T_FIXNUM) || (type == T_BIGNUM)) {
1987
+ unsigned long long v;
1988
+ VALUE a[2];
1989
+ a[0] = obj;
1990
+ a[1] = (VALUE)(&v);
1991
+ if (rb_rescue(RUBY_METHOD_FUNC(SWIG_AUX_NUM2ULL), (VALUE)a, RUBY_METHOD_FUNC(SWIG_ruby_failed), 0) != Qnil) {
1992
+ if (val) *val = v;
1993
+ return SWIG_OK;
1994
+ }
1995
+ }
1996
+ return SWIG_TypeError;
1997
+ }
1998
+ #endif
1999
+
2000
+
1941
2001
  SWIGINTERNINLINE int
1942
2002
  SWIG_AsVal_size_t (VALUE obj, size_t *val)
1943
2003
  {
1944
- unsigned long v;
1945
- int res = SWIG_AsVal_unsigned_SS_long (obj, val ? &v : 0);
1946
- if (SWIG_IsOK(res) && val) *val = (size_t)(v);
2004
+ int res = SWIG_TypeError;
2005
+ #ifdef SWIG_LONG_LONG_AVAILABLE
2006
+ if (sizeof(size_t) <= sizeof(unsigned long)) {
2007
+ #endif
2008
+ unsigned long v;
2009
+ res = SWIG_AsVal_unsigned_SS_long (obj, val ? &v : 0);
2010
+ if (SWIG_IsOK(res) && val) *val = (size_t)(v);
2011
+ #ifdef SWIG_LONG_LONG_AVAILABLE
2012
+ } else if (sizeof(size_t) <= sizeof(unsigned long long)) {
2013
+ unsigned long long v;
2014
+ res = SWIG_AsVal_unsigned_SS_long_SS_long (obj, val ? &v : 0);
2015
+ if (SWIG_IsOK(res) && val) *val = (size_t)(v);
2016
+ }
2017
+ #endif
1947
2018
  return res;
1948
2019
  }
1949
2020
 
@@ -1965,11 +2036,7 @@ SWIGINTERN int
1965
2036
  SWIG_AsCharPtrAndSize(VALUE obj, char** cptr, size_t* psize, int *alloc)
1966
2037
  {
1967
2038
  if (TYPE(obj) == T_STRING) {
1968
- #if defined(StringValuePtr)
1969
2039
  char *cstr = StringValuePtr(obj);
1970
- #else
1971
- char *cstr = STR2CSTR(obj);
1972
- #endif
1973
2040
  size_t size = RSTRING_LEN(obj) + 1;
1974
2041
  if (cptr) {
1975
2042
  if (alloc) {
@@ -2019,16 +2086,6 @@ SWIG_FromCharPtrAndSize(const char* carray, size_t size)
2019
2086
  }
2020
2087
 
2021
2088
 
2022
- #include <limits.h>
2023
- #if !defined(SWIG_NO_LLONG_MAX)
2024
- # if !defined(LLONG_MAX) && defined(__GNUC__) && defined (__LONG_LONG_MAX__)
2025
- # define LLONG_MAX __LONG_LONG_MAX__
2026
- # define LLONG_MIN (-LLONG_MAX - 1LL)
2027
- # define ULLONG_MAX (LLONG_MAX * 2ULL + 1ULL)
2028
- # endif
2029
- #endif
2030
-
2031
-
2032
2089
  #define SWIG_From_long LONG2NUM
2033
2090
 
2034
2091
 
@@ -2240,7 +2297,7 @@ SWIG_From_bool (bool value)
2240
2297
 
2241
2298
 
2242
2299
 
2243
- /*@SWIG:/usr/share/swig/1.3.40/ruby/rubyprimtypes.swg,23,%ruby_aux_method@*/
2300
+ /*@SWIG:/usr/share/swig/3.0.10/ruby/rubyprimtypes.swg,19,%ruby_aux_method@*/
2244
2301
  SWIGINTERN VALUE SWIG_AUX_NUM2LONG(VALUE *args)
2245
2302
  {
2246
2303
  VALUE obj = args[0];
@@ -2444,23 +2501,77 @@ SWIG_From_unsigned_SS_int (unsigned int value)
2444
2501
  }
2445
2502
 
2446
2503
 
2504
+ #ifdef SWIG_LONG_LONG_AVAILABLE
2505
+ SWIGINTERNINLINE VALUE
2506
+ SWIG_From_long_SS_long (long long value)
2507
+ {
2508
+ return LL2NUM(value);
2509
+ }
2510
+ #endif
2511
+
2512
+
2513
+ #ifdef SWIG_LONG_LONG_AVAILABLE
2514
+ SWIGINTERNINLINE VALUE
2515
+ SWIG_From_unsigned_SS_long_SS_long (unsigned long long value)
2516
+ {
2517
+ return ULL2NUM(value);
2518
+ }
2519
+ #endif
2520
+
2521
+
2447
2522
  SWIGINTERNINLINE VALUE
2448
2523
  SWIG_From_size_t (size_t value)
2449
2524
  {
2450
- return SWIG_From_unsigned_SS_long ((unsigned long)(value));
2525
+ #ifdef SWIG_LONG_LONG_AVAILABLE
2526
+ if (sizeof(size_t) <= sizeof(unsigned long)) {
2527
+ #endif
2528
+ return SWIG_From_unsigned_SS_long ((unsigned long)(value));
2529
+ #ifdef SWIG_LONG_LONG_AVAILABLE
2530
+ } else {
2531
+ /* assume sizeof(size_t) <= sizeof(unsigned long long) */
2532
+ return SWIG_From_unsigned_SS_long_SS_long ((unsigned long long)(value));
2533
+ }
2534
+ #endif
2451
2535
  }
2452
2536
 
2453
2537
 
2454
2538
  #include <float.h>
2455
2539
 
2456
2540
 
2457
- /*@SWIG:/usr/share/swig/1.3.40/ruby/rubyprimtypes.swg,23,%ruby_aux_method@*/
2541
+ #include <math.h>
2542
+
2543
+
2544
+ /* Getting isfinite working pre C99 across multiple platforms is non-trivial. Users can provide SWIG_isfinite on older platforms. */
2545
+ #ifndef SWIG_isfinite
2546
+ /* isfinite() is a macro for C99, but a function in namespace std for C++11. */
2547
+ # if defined(isfinite)
2548
+ # define SWIG_isfinite(X) (isfinite(X))
2549
+ # elif defined __cplusplus && __cplusplus >= 201103L
2550
+ # define SWIG_isfinite(X) (std::isfinite(X))
2551
+ # elif defined(_MSC_VER)
2552
+ # define SWIG_isfinite(X) (_finite(X))
2553
+ # elif defined(__sun) && defined(__SVR4)
2554
+ # include <ieeefp.h>
2555
+ # define SWIG_isfinite(X) (finite(X))
2556
+ # endif
2557
+ #endif
2558
+
2559
+
2560
+ /* Accept infinite as a valid float value unless we are unable to check if a value is finite */
2561
+ #ifdef SWIG_isfinite
2562
+ # define SWIG_Float_Overflow_Check(X) ((X < -FLT_MAX || X > FLT_MAX) && SWIG_isfinite(X))
2563
+ #else
2564
+ # define SWIG_Float_Overflow_Check(X) ((X < -FLT_MAX || X > FLT_MAX))
2565
+ #endif
2566
+
2567
+
2568
+ /*@SWIG:/usr/share/swig/3.0.10/ruby/rubyprimtypes.swg,19,%ruby_aux_method@*/
2458
2569
  SWIGINTERN VALUE SWIG_AUX_NUM2DBL(VALUE *args)
2459
2570
  {
2460
2571
  VALUE obj = args[0];
2461
2572
  VALUE type = TYPE(obj);
2462
2573
  double *res = (double *)(args[1]);
2463
- *res = NUM2DBL(obj);
2574
+ *res = NUM2DBL(obj); (void)type;
2464
2575
  return obj;
2465
2576
  }
2466
2577
  /*@SWIG@*/
@@ -2489,7 +2600,7 @@ SWIG_AsVal_float (VALUE obj, float *val)
2489
2600
  double v;
2490
2601
  int res = SWIG_AsVal_double (obj, &v);
2491
2602
  if (SWIG_IsOK(res)) {
2492
- if ((v < -FLT_MAX || v > FLT_MAX)) {
2603
+ if (SWIG_Float_Overflow_Check(v)) {
2493
2604
  return SWIG_OverflowError;
2494
2605
  } else {
2495
2606
  if (val) *val = (float)(v);
@@ -2519,49 +2630,6 @@ SWIG_AsVal_bool (VALUE obj, bool *val)
2519
2630
  }
2520
2631
 
2521
2632
 
2522
- SWIGINTERNINLINE VALUE
2523
- SWIG_From_long_SS_long (long long value)
2524
- {
2525
- return LL2NUM(value);
2526
- }
2527
-
2528
-
2529
- SWIGINTERNINLINE VALUE
2530
- SWIG_From_unsigned_SS_long_SS_long (unsigned long long value)
2531
- {
2532
- return ULL2NUM(value);
2533
- }
2534
-
2535
-
2536
- /*@SWIG:/usr/share/swig/1.3.40/ruby/rubyprimtypes.swg,23,%ruby_aux_method@*/
2537
- SWIGINTERN VALUE SWIG_AUX_NUM2ULL(VALUE *args)
2538
- {
2539
- VALUE obj = args[0];
2540
- VALUE type = TYPE(obj);
2541
- long long *res = (long long *)(args[1]);
2542
- *res = type == T_FIXNUM ? NUM2ULL(obj) : rb_big2ull(obj);
2543
- return obj;
2544
- }
2545
- /*@SWIG@*/
2546
-
2547
- SWIGINTERN int
2548
- SWIG_AsVal_unsigned_SS_long_SS_long (VALUE obj, unsigned long long *val)
2549
- {
2550
- VALUE type = TYPE(obj);
2551
- if ((type == T_FIXNUM) || (type == T_BIGNUM)) {
2552
- unsigned long long v;
2553
- VALUE a[2];
2554
- a[0] = obj;
2555
- a[1] = (VALUE)(&v);
2556
- if (rb_rescue(RUBY_METHOD_FUNC(SWIG_AUX_NUM2ULL), (VALUE)a, RUBY_METHOD_FUNC(SWIG_ruby_failed), 0) != Qnil) {
2557
- if (val) *val = v;
2558
- return SWIG_OK;
2559
- }
2560
- }
2561
- return SWIG_TypeError;
2562
- }
2563
-
2564
-
2565
2633
  SWIGINTERNINLINE VALUE
2566
2634
  SWIG_From_unsigned_SS_short (unsigned short value)
2567
2635
  {
@@ -2585,7 +2653,8 @@ SWIG_AsVal_unsigned_SS_short (VALUE obj, unsigned short *val)
2585
2653
  }
2586
2654
 
2587
2655
 
2588
- /*@SWIG:/usr/share/swig/1.3.40/ruby/rubyprimtypes.swg,23,%ruby_aux_method@*/
2656
+ #ifdef SWIG_LONG_LONG_AVAILABLE
2657
+ /*@SWIG:/usr/share/swig/3.0.10/ruby/rubyprimtypes.swg,19,%ruby_aux_method@*/
2589
2658
  SWIGINTERN VALUE SWIG_AUX_NUM2LL(VALUE *args)
2590
2659
  {
2591
2660
  VALUE obj = args[0];
@@ -2612,6 +2681,7 @@ SWIG_AsVal_long_SS_long (VALUE obj, long long *val)
2612
2681
  }
2613
2682
  return SWIG_TypeError;
2614
2683
  }
2684
+ #endif
2615
2685
 
2616
2686
 
2617
2687
  /* assume the binding does the incref in the wrapper */
@@ -3575,7 +3645,7 @@ fail:
3575
3645
  }
3576
3646
 
3577
3647
 
3578
- swig_class SwigClassPni_rbhandler_t;
3648
+ static swig_class SwigClassPni_rbhandler_t;
3579
3649
 
3580
3650
  SWIGINTERN VALUE
3581
3651
  _wrap_Pni_rbhandler_t_handler_key_set(int argc, VALUE *argv, VALUE self) {
@@ -3624,22 +3694,20 @@ fail:
3624
3694
  }
3625
3695
 
3626
3696
 
3627
- #ifdef HAVE_RB_DEFINE_ALLOC_FUNC
3628
3697
  SWIGINTERN VALUE
3629
- _wrap_Pni_rbhandler_t_allocate(VALUE self) {
3698
+ #ifdef HAVE_RB_DEFINE_ALLOC_FUNC
3699
+ _wrap_Pni_rbhandler_t_allocate(VALUE self)
3630
3700
  #else
3631
- SWIGINTERN VALUE
3632
- _wrap_Pni_rbhandler_t_allocate(int argc, VALUE *argv, VALUE self) {
3701
+ _wrap_Pni_rbhandler_t_allocate(int argc, VALUE *argv, VALUE self)
3633
3702
  #endif
3634
-
3635
-
3636
- VALUE vresult = SWIG_NewClassInstance(self, SWIGTYPE_p_Pni_rbhandler_t);
3703
+ {
3704
+ VALUE vresult = SWIG_NewClassInstance(self, SWIGTYPE_p_Pni_rbhandler_t);
3637
3705
  #ifndef HAVE_RB_DEFINE_ALLOC_FUNC
3638
- rb_obj_call_init(vresult, argc, argv);
3706
+ rb_obj_call_init(vresult, argc, argv);
3639
3707
  #endif
3640
- return vresult;
3641
- }
3642
-
3708
+ return vresult;
3709
+ }
3710
+
3643
3711
 
3644
3712
  SWIGINTERN VALUE
3645
3713
  _wrap_new_Pni_rbhandler_t(int argc, VALUE *argv, VALUE self) {
@@ -3657,7 +3725,8 @@ fail:
3657
3725
 
3658
3726
 
3659
3727
  SWIGINTERN void
3660
- free_Pni_rbhandler_t(Pni_rbhandler_t *arg1) {
3728
+ free_Pni_rbhandler_t(void *self) {
3729
+ Pni_rbhandler_t *arg1 = (Pni_rbhandler_t *)self;
3661
3730
  free((char *) arg1);
3662
3731
  }
3663
3732
 
@@ -3761,6 +3830,22 @@ fail:
3761
3830
  }
3762
3831
 
3763
3832
 
3833
+ SWIGINTERN VALUE
3834
+ _wrap_pn_timestamp_now(int argc, VALUE *argv, VALUE self) {
3835
+ pn_timestamp_t result;
3836
+ VALUE vresult = Qnil;
3837
+
3838
+ if ((argc < 0) || (argc > 0)) {
3839
+ rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail;
3840
+ }
3841
+ result = (pn_timestamp_t)pn_timestamp_now();
3842
+ vresult = SWIG_From_long_SS_long((long long)(result));
3843
+ return vresult;
3844
+ fail:
3845
+ return Qnil;
3846
+ }
3847
+
3848
+
3764
3849
  SWIGINTERN VALUE
3765
3850
  _wrap_pn_bytes(int argc, VALUE *argv, VALUE self) {
3766
3851
  size_t arg1 ;
@@ -5187,7 +5272,7 @@ fail:
5187
5272
  SWIGINTERN VALUE
5188
5273
  _wrap_pn_map_next(int argc, VALUE *argv, VALUE self) {
5189
5274
  pn_map_t *arg1 = (pn_map_t *) 0 ;
5190
- pn_handle_t arg2 ;
5275
+ pn_handle_t arg2 = (pn_handle_t) 0 ;
5191
5276
  void *argp1 = 0 ;
5192
5277
  int res1 = 0 ;
5193
5278
  unsigned long val2 ;
@@ -5219,7 +5304,7 @@ fail:
5219
5304
  SWIGINTERN VALUE
5220
5305
  _wrap_pn_map_key(int argc, VALUE *argv, VALUE self) {
5221
5306
  pn_map_t *arg1 = (pn_map_t *) 0 ;
5222
- pn_handle_t arg2 ;
5307
+ pn_handle_t arg2 = (pn_handle_t) 0 ;
5223
5308
  void *argp1 = 0 ;
5224
5309
  int res1 = 0 ;
5225
5310
  unsigned long val2 ;
@@ -5251,7 +5336,7 @@ fail:
5251
5336
  SWIGINTERN VALUE
5252
5337
  _wrap_pn_map_value(int argc, VALUE *argv, VALUE self) {
5253
5338
  pn_map_t *arg1 = (pn_map_t *) 0 ;
5254
- pn_handle_t arg2 ;
5339
+ pn_handle_t arg2 = (pn_handle_t) 0 ;
5255
5340
  void *argp1 = 0 ;
5256
5341
  int res1 = 0 ;
5257
5342
  unsigned long val2 ;
@@ -5470,7 +5555,7 @@ fail:
5470
5555
  SWIGINTERN VALUE
5471
5556
  _wrap_pn_hash_next(int argc, VALUE *argv, VALUE self) {
5472
5557
  pn_hash_t *arg1 = (pn_hash_t *) 0 ;
5473
- pn_handle_t arg2 ;
5558
+ pn_handle_t arg2 = (pn_handle_t) 0 ;
5474
5559
  void *argp1 = 0 ;
5475
5560
  int res1 = 0 ;
5476
5561
  unsigned long val2 ;
@@ -5502,7 +5587,7 @@ fail:
5502
5587
  SWIGINTERN VALUE
5503
5588
  _wrap_pn_hash_key(int argc, VALUE *argv, VALUE self) {
5504
5589
  pn_hash_t *arg1 = (pn_hash_t *) 0 ;
5505
- pn_handle_t arg2 ;
5590
+ pn_handle_t arg2 = (pn_handle_t) 0 ;
5506
5591
  void *argp1 = 0 ;
5507
5592
  int res1 = 0 ;
5508
5593
  unsigned long val2 ;
@@ -5534,7 +5619,7 @@ fail:
5534
5619
  SWIGINTERN VALUE
5535
5620
  _wrap_pn_hash_value(int argc, VALUE *argv, VALUE self) {
5536
5621
  pn_hash_t *arg1 = (pn_hash_t *) 0 ;
5537
- pn_handle_t arg2 ;
5622
+ pn_handle_t arg2 = (pn_handle_t) 0 ;
5538
5623
  void *argp1 = 0 ;
5539
5624
  int res1 = 0 ;
5540
5625
  unsigned long val2 ;
@@ -6121,7 +6206,7 @@ fail:
6121
6206
  SWIGINTERN VALUE
6122
6207
  _wrap_pn_record_def(int argc, VALUE *argv, VALUE self) {
6123
6208
  pn_record_t *arg1 = (pn_record_t *) 0 ;
6124
- pn_handle_t arg2 ;
6209
+ pn_handle_t arg2 = (pn_handle_t) 0 ;
6125
6210
  pn_class_t *arg3 = (pn_class_t *) 0 ;
6126
6211
  void *argp1 = 0 ;
6127
6212
  int res1 = 0 ;
@@ -6158,7 +6243,7 @@ fail:
6158
6243
  SWIGINTERN VALUE
6159
6244
  _wrap_pn_record_has(int argc, VALUE *argv, VALUE self) {
6160
6245
  pn_record_t *arg1 = (pn_record_t *) 0 ;
6161
- pn_handle_t arg2 ;
6246
+ pn_handle_t arg2 = (pn_handle_t) 0 ;
6162
6247
  void *argp1 = 0 ;
6163
6248
  int res1 = 0 ;
6164
6249
  unsigned long val2 ;
@@ -6190,7 +6275,7 @@ fail:
6190
6275
  SWIGINTERN VALUE
6191
6276
  _wrap_pn_record_get(int argc, VALUE *argv, VALUE self) {
6192
6277
  pn_record_t *arg1 = (pn_record_t *) 0 ;
6193
- pn_handle_t arg2 ;
6278
+ pn_handle_t arg2 = (pn_handle_t) 0 ;
6194
6279
  void *argp1 = 0 ;
6195
6280
  int res1 = 0 ;
6196
6281
  unsigned long val2 ;
@@ -6222,7 +6307,7 @@ fail:
6222
6307
  SWIGINTERN VALUE
6223
6308
  _wrap_pn_record_set(int argc, VALUE *argv, VALUE self) {
6224
6309
  pn_record_t *arg1 = (pn_record_t *) 0 ;
6225
- pn_handle_t arg2 ;
6310
+ pn_handle_t arg2 = (pn_handle_t) 0 ;
6226
6311
  void *arg3 = (void *) 0 ;
6227
6312
  void *argp1 = 0 ;
6228
6313
  int res1 = 0 ;
@@ -9805,6 +9890,43 @@ fail:
9805
9890
  }
9806
9891
 
9807
9892
 
9893
+ SWIGINTERN VALUE
9894
+ _wrap_pn_dtag(int argc, VALUE *argv, VALUE self) {
9895
+ char *arg1 = (char *) 0 ;
9896
+ size_t arg2 ;
9897
+ int res1 ;
9898
+ char *buf1 = 0 ;
9899
+ int alloc1 = 0 ;
9900
+ size_t val2 ;
9901
+ int ecode2 = 0 ;
9902
+ pn_delivery_tag_t result;
9903
+ VALUE vresult = Qnil;
9904
+
9905
+ if ((argc < 2) || (argc > 2)) {
9906
+ rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
9907
+ }
9908
+ res1 = SWIG_AsCharPtrAndSize(argv[0], &buf1, NULL, &alloc1);
9909
+ if (!SWIG_IsOK(res1)) {
9910
+ SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "char const *","pn_dtag", 1, argv[0] ));
9911
+ }
9912
+ arg1 = (char *)(buf1);
9913
+ ecode2 = SWIG_AsVal_size_t(argv[1], &val2);
9914
+ if (!SWIG_IsOK(ecode2)) {
9915
+ SWIG_exception_fail(SWIG_ArgError(ecode2), Ruby_Format_TypeError( "", "size_t","pn_dtag", 2, argv[1] ));
9916
+ }
9917
+ arg2 = (size_t)(val2);
9918
+ result = pn_dtag((char const *)arg1,arg2);
9919
+ {
9920
+ vresult = rb_str_new((&result)->start, (&result)->size);
9921
+ }
9922
+ if (alloc1 == SWIG_NEWOBJ) free((char*)buf1);
9923
+ return vresult;
9924
+ fail:
9925
+ if (alloc1 == SWIG_NEWOBJ) free((char*)buf1);
9926
+ return Qnil;
9927
+ }
9928
+
9929
+
9808
9930
  SWIGINTERN VALUE
9809
9931
  _wrap_pn_delivery_get_context(int argc, VALUE *argv, VALUE self) {
9810
9932
  pn_delivery_t *arg1 = (pn_delivery_t *) 0 ;
@@ -13940,7 +14062,7 @@ _wrap_pn_message_decode(int argc, VALUE *argv, VALUE self) {
13940
14062
  SWIG_exception_fail(SWIG_ArgError(ecode3), Ruby_Format_TypeError( "", "size_t","pn_message_decode", 3, argv[2] ));
13941
14063
  }
13942
14064
  arg3 = (size_t)(val3);
13943
- SWIG_contract_assert((arg1!=NULL)&&(arg3>=0), "Contract violation: require: (arg1!=NULL)&&(arg3>=0)");
14065
+ SWIG_contract_assert((arg1!=NULL), "Contract violation: require: (arg1!=NULL)");
13944
14066
 
13945
14067
  result = (int)pn_message_decode(arg1,(char const *)arg2,arg3);
13946
14068
  vresult = SWIG_From_int((int)(result));
@@ -14300,8 +14422,6 @@ _wrap_pn_messenger(int argc, VALUE *argv, VALUE self) {
14300
14422
  }
14301
14423
  arg1 = (char *)(buf1);
14302
14424
  result = (pn_messenger_t *)pn_messenger((char const *)arg1);
14303
- SWIG_contract_assert((pn_message!=NULL), "Contract violation: ensure: (pn_message!=NULL)");
14304
-
14305
14425
  vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_pn_messenger_t, 0 | 0 );
14306
14426
  if (alloc1 == SWIG_NEWOBJ) free((char*)buf1);
14307
14427
  return vresult;
@@ -20010,7 +20130,7 @@ fail:
20010
20130
  SWIGINTERN VALUE
20011
20131
  _wrap_pn_data_restore(int argc, VALUE *argv, VALUE self) {
20012
20132
  pn_data_t *arg1 = (pn_data_t *) 0 ;
20013
- pn_handle_t arg2 ;
20133
+ pn_handle_t arg2 = (pn_handle_t) 0 ;
20014
20134
  void *argp1 = 0 ;
20015
20135
  int res1 = 0 ;
20016
20136
  unsigned long val2 ;
@@ -21342,6 +21462,60 @@ fail:
21342
21462
  }
21343
21463
 
21344
21464
 
21465
+ SWIGINTERN VALUE
21466
+ _wrap_pn_reactor_connection_to_host(int argc, VALUE *argv, VALUE self) {
21467
+ pn_reactor_t *arg1 = (pn_reactor_t *) 0 ;
21468
+ char *arg2 = (char *) 0 ;
21469
+ char *arg3 = (char *) 0 ;
21470
+ pn_handler_t *arg4 = (pn_handler_t *) 0 ;
21471
+ void *argp1 = 0 ;
21472
+ int res1 = 0 ;
21473
+ int res2 ;
21474
+ char *buf2 = 0 ;
21475
+ int alloc2 = 0 ;
21476
+ int res3 ;
21477
+ char *buf3 = 0 ;
21478
+ int alloc3 = 0 ;
21479
+ void *argp4 = 0 ;
21480
+ int res4 = 0 ;
21481
+ pn_connection_t *result = 0 ;
21482
+ VALUE vresult = Qnil;
21483
+
21484
+ if ((argc < 4) || (argc > 4)) {
21485
+ rb_raise(rb_eArgError, "wrong # of arguments(%d for 4)",argc); SWIG_fail;
21486
+ }
21487
+ res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_pn_reactor_t, 0 | 0 );
21488
+ if (!SWIG_IsOK(res1)) {
21489
+ SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "pn_reactor_t *","pn_reactor_connection_to_host", 1, argv[0] ));
21490
+ }
21491
+ arg1 = (pn_reactor_t *)(argp1);
21492
+ res2 = SWIG_AsCharPtrAndSize(argv[1], &buf2, NULL, &alloc2);
21493
+ if (!SWIG_IsOK(res2)) {
21494
+ SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "char const *","pn_reactor_connection_to_host", 2, argv[1] ));
21495
+ }
21496
+ arg2 = (char *)(buf2);
21497
+ res3 = SWIG_AsCharPtrAndSize(argv[2], &buf3, NULL, &alloc3);
21498
+ if (!SWIG_IsOK(res3)) {
21499
+ SWIG_exception_fail(SWIG_ArgError(res3), Ruby_Format_TypeError( "", "char const *","pn_reactor_connection_to_host", 3, argv[2] ));
21500
+ }
21501
+ arg3 = (char *)(buf3);
21502
+ res4 = SWIG_ConvertPtr(argv[3], &argp4,SWIGTYPE_p_pn_handler_t, 0 | 0 );
21503
+ if (!SWIG_IsOK(res4)) {
21504
+ SWIG_exception_fail(SWIG_ArgError(res4), Ruby_Format_TypeError( "", "pn_handler_t *","pn_reactor_connection_to_host", 4, argv[3] ));
21505
+ }
21506
+ arg4 = (pn_handler_t *)(argp4);
21507
+ result = (pn_connection_t *)pn_reactor_connection_to_host(arg1,(char const *)arg2,(char const *)arg3,arg4);
21508
+ vresult = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_pn_connection_t, 0 | 0 );
21509
+ if (alloc2 == SWIG_NEWOBJ) free((char*)buf2);
21510
+ if (alloc3 == SWIG_NEWOBJ) free((char*)buf3);
21511
+ return vresult;
21512
+ fail:
21513
+ if (alloc2 == SWIG_NEWOBJ) free((char*)buf2);
21514
+ if (alloc3 == SWIG_NEWOBJ) free((char*)buf3);
21515
+ return Qnil;
21516
+ }
21517
+
21518
+
21345
21519
  SWIGINTERN VALUE
21346
21520
  _wrap_pn_reactor_connection(int argc, VALUE *argv, VALUE self) {
21347
21521
  pn_reactor_t *arg1 = (pn_reactor_t *) 0 ;
@@ -21374,6 +21548,89 @@ fail:
21374
21548
  }
21375
21549
 
21376
21550
 
21551
+ SWIGINTERN VALUE
21552
+ _wrap_pn_reactor_set_connection_host(int argc, VALUE *argv, VALUE self) {
21553
+ pn_reactor_t *arg1 = (pn_reactor_t *) 0 ;
21554
+ pn_connection_t *arg2 = (pn_connection_t *) 0 ;
21555
+ char *arg3 = (char *) 0 ;
21556
+ char *arg4 = (char *) 0 ;
21557
+ void *argp1 = 0 ;
21558
+ int res1 = 0 ;
21559
+ void *argp2 = 0 ;
21560
+ int res2 = 0 ;
21561
+ int res3 ;
21562
+ char *buf3 = 0 ;
21563
+ int alloc3 = 0 ;
21564
+ int res4 ;
21565
+ char *buf4 = 0 ;
21566
+ int alloc4 = 0 ;
21567
+
21568
+ if ((argc < 4) || (argc > 4)) {
21569
+ rb_raise(rb_eArgError, "wrong # of arguments(%d for 4)",argc); SWIG_fail;
21570
+ }
21571
+ res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_pn_reactor_t, 0 | 0 );
21572
+ if (!SWIG_IsOK(res1)) {
21573
+ SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "pn_reactor_t *","pn_reactor_set_connection_host", 1, argv[0] ));
21574
+ }
21575
+ arg1 = (pn_reactor_t *)(argp1);
21576
+ res2 = SWIG_ConvertPtr(argv[1], &argp2,SWIGTYPE_p_pn_connection_t, 0 | 0 );
21577
+ if (!SWIG_IsOK(res2)) {
21578
+ SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "pn_connection_t *","pn_reactor_set_connection_host", 2, argv[1] ));
21579
+ }
21580
+ arg2 = (pn_connection_t *)(argp2);
21581
+ res3 = SWIG_AsCharPtrAndSize(argv[2], &buf3, NULL, &alloc3);
21582
+ if (!SWIG_IsOK(res3)) {
21583
+ SWIG_exception_fail(SWIG_ArgError(res3), Ruby_Format_TypeError( "", "char const *","pn_reactor_set_connection_host", 3, argv[2] ));
21584
+ }
21585
+ arg3 = (char *)(buf3);
21586
+ res4 = SWIG_AsCharPtrAndSize(argv[3], &buf4, NULL, &alloc4);
21587
+ if (!SWIG_IsOK(res4)) {
21588
+ SWIG_exception_fail(SWIG_ArgError(res4), Ruby_Format_TypeError( "", "char const *","pn_reactor_set_connection_host", 4, argv[3] ));
21589
+ }
21590
+ arg4 = (char *)(buf4);
21591
+ pn_reactor_set_connection_host(arg1,arg2,(char const *)arg3,(char const *)arg4);
21592
+ if (alloc3 == SWIG_NEWOBJ) free((char*)buf3);
21593
+ if (alloc4 == SWIG_NEWOBJ) free((char*)buf4);
21594
+ return Qnil;
21595
+ fail:
21596
+ if (alloc3 == SWIG_NEWOBJ) free((char*)buf3);
21597
+ if (alloc4 == SWIG_NEWOBJ) free((char*)buf4);
21598
+ return Qnil;
21599
+ }
21600
+
21601
+
21602
+ SWIGINTERN VALUE
21603
+ _wrap_pn_reactor_get_connection_address(int argc, VALUE *argv, VALUE self) {
21604
+ pn_reactor_t *arg1 = (pn_reactor_t *) 0 ;
21605
+ pn_connection_t *arg2 = (pn_connection_t *) 0 ;
21606
+ void *argp1 = 0 ;
21607
+ int res1 = 0 ;
21608
+ void *argp2 = 0 ;
21609
+ int res2 = 0 ;
21610
+ char *result = 0 ;
21611
+ VALUE vresult = Qnil;
21612
+
21613
+ if ((argc < 2) || (argc > 2)) {
21614
+ rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
21615
+ }
21616
+ res1 = SWIG_ConvertPtr(argv[0], &argp1,SWIGTYPE_p_pn_reactor_t, 0 | 0 );
21617
+ if (!SWIG_IsOK(res1)) {
21618
+ SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "pn_reactor_t *","pn_reactor_get_connection_address", 1, argv[0] ));
21619
+ }
21620
+ arg1 = (pn_reactor_t *)(argp1);
21621
+ res2 = SWIG_ConvertPtr(argv[1], &argp2,SWIGTYPE_p_pn_connection_t, 0 | 0 );
21622
+ if (!SWIG_IsOK(res2)) {
21623
+ SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "pn_connection_t *","pn_reactor_get_connection_address", 2, argv[1] ));
21624
+ }
21625
+ arg2 = (pn_connection_t *)(argp2);
21626
+ result = (char *)pn_reactor_get_connection_address(arg1,arg2);
21627
+ vresult = SWIG_FromCharPtr((const char *)result);
21628
+ return vresult;
21629
+ fail:
21630
+ return Qnil;
21631
+ }
21632
+
21633
+
21377
21634
  SWIGINTERN VALUE
21378
21635
  _wrap_pn_reactor_wakeup(int argc, VALUE *argv, VALUE self) {
21379
21636
  pn_reactor_t *arg1 = (pn_reactor_t *) 0 ;
@@ -22060,7 +22317,7 @@ static swig_type_info _swigt__p_short = {"_p_short", "short *|int16_t *", 0, 0,
22060
22317
  static swig_type_info _swigt__p_signed_char = {"_p_signed_char", "signed char *|int8_t *", 0, 0, (void*)0, 0};
22061
22318
  static swig_type_info _swigt__p_unsigned_char = {"_p_unsigned_char", "unsigned char *|uint8_t *", 0, 0, (void*)0, 0};
22062
22319
  static swig_type_info _swigt__p_unsigned_int = {"_p_unsigned_int", "size_t *|unsigned int *", 0, 0, (void*)0, 0};
22063
- static swig_type_info _swigt__p_unsigned_long = {"_p_unsigned_long", "pn_seconds_t *|uintptr_t *|pn_decimal32_t *|uint32_t *|pn_handle_t *|unsigned long *|pn_millis_t *|pn_char_t *", 0, 0, (void*)0, 0};
22320
+ static swig_type_info _swigt__p_unsigned_long = {"_p_unsigned_long", "pn_seconds_t *|uintptr_t *|pn_decimal32_t *|uint32_t *|unsigned long *|pn_millis_t *|pn_char_t *", 0, 0, (void*)0, 0};
22064
22321
  static swig_type_info _swigt__p_unsigned_long_long = {"_p_unsigned_long_long", "pn_decimal64_t *|uint64_t *|unsigned long long *", 0, 0, (void*)0, 0};
22065
22322
  static swig_type_info _swigt__p_unsigned_short = {"_p_unsigned_short", "unsigned short *|uint16_t *", 0, 0, (void*)0, 0};
22066
22323
  static swig_type_info _swigt__p_void = {"_p_void", "void *", 0, 0, (void*)0, 0};
@@ -22302,18 +22559,18 @@ static swig_cast_info *swig_cast_initial[] = {
22302
22559
 
22303
22560
  /* -----------------------------------------------------------------------------
22304
22561
  * Type initialization:
22305
- * This problem is tough by the requirement that no dynamic
22306
- * memory is used. Also, since swig_type_info structures store pointers to
22562
+ * This problem is tough by the requirement that no dynamic
22563
+ * memory is used. Also, since swig_type_info structures store pointers to
22307
22564
  * swig_cast_info structures and swig_cast_info structures store pointers back
22308
- * to swig_type_info structures, we need some lookup code at initialization.
22309
- * The idea is that swig generates all the structures that are needed.
22310
- * The runtime then collects these partially filled structures.
22311
- * The SWIG_InitializeModule function takes these initial arrays out of
22565
+ * to swig_type_info structures, we need some lookup code at initialization.
22566
+ * The idea is that swig generates all the structures that are needed.
22567
+ * The runtime then collects these partially filled structures.
22568
+ * The SWIG_InitializeModule function takes these initial arrays out of
22312
22569
  * swig_module, and does all the lookup, filling in the swig_module.types
22313
22570
  * array with the correct data and linking the correct swig_cast_info
22314
22571
  * structures together.
22315
22572
  *
22316
- * The generated swig_type_info structures are assigned staticly to an initial
22573
+ * The generated swig_type_info structures are assigned statically to an initial
22317
22574
  * array. We just loop through that array, and handle each type individually.
22318
22575
  * First we lookup if this type has been already loaded, and if so, use the
22319
22576
  * loaded structure instead of the generated one. Then we have to fill in the
@@ -22323,17 +22580,17 @@ static swig_cast_info *swig_cast_initial[] = {
22323
22580
  * a column is one of the swig_cast_info structures for that type.
22324
22581
  * The cast_initial array is actually an array of arrays, because each row has
22325
22582
  * a variable number of columns. So to actually build the cast linked list,
22326
- * we find the array of casts associated with the type, and loop through it
22583
+ * we find the array of casts associated with the type, and loop through it
22327
22584
  * adding the casts to the list. The one last trick we need to do is making
22328
22585
  * sure the type pointer in the swig_cast_info struct is correct.
22329
22586
  *
22330
- * First off, we lookup the cast->type name to see if it is already loaded.
22587
+ * First off, we lookup the cast->type name to see if it is already loaded.
22331
22588
  * There are three cases to handle:
22332
22589
  * 1) If the cast->type has already been loaded AND the type we are adding
22333
22590
  * casting info to has not been loaded (it is in this module), THEN we
22334
22591
  * replace the cast->type pointer with the type pointer that has already
22335
22592
  * been loaded.
22336
- * 2) If BOTH types (the one we are adding casting info to, and the
22593
+ * 2) If BOTH types (the one we are adding casting info to, and the
22337
22594
  * cast->type) are loaded, THEN the cast info has already been loaded by
22338
22595
  * the previous module so we just ignore it.
22339
22596
  * 3) Finally, if cast->type has not already been loaded, then we add that
@@ -22357,9 +22614,7 @@ SWIGRUNTIME void
22357
22614
  SWIG_InitializeModule(void *clientdata) {
22358
22615
  size_t i;
22359
22616
  swig_module_info *module_head, *iter;
22360
- int found, init;
22361
-
22362
- clientdata = clientdata;
22617
+ int init;
22363
22618
 
22364
22619
  /* check to see if the circular list has been setup, if not, set it up */
22365
22620
  if (swig_module.next==0) {
@@ -22378,27 +22633,23 @@ SWIG_InitializeModule(void *clientdata) {
22378
22633
  /* This is the first module loaded for this interpreter */
22379
22634
  /* so set the swig module into the interpreter */
22380
22635
  SWIG_SetModule(clientdata, &swig_module);
22381
- module_head = &swig_module;
22382
22636
  } else {
22383
22637
  /* the interpreter has loaded a SWIG module, but has it loaded this one? */
22384
- found=0;
22385
22638
  iter=module_head;
22386
22639
  do {
22387
22640
  if (iter==&swig_module) {
22388
- found=1;
22389
- break;
22641
+ /* Our module is already in the list, so there's nothing more to do. */
22642
+ return;
22390
22643
  }
22391
22644
  iter=iter->next;
22392
22645
  } while (iter!= module_head);
22393
22646
 
22394
- /* if the is found in the list, then all is done and we may leave */
22395
- if (found) return;
22396
- /* otherwise we must add out module into the list */
22647
+ /* otherwise we must add our module into the list */
22397
22648
  swig_module.next = module_head->next;
22398
22649
  module_head->next = &swig_module;
22399
22650
  }
22400
22651
 
22401
- /* When multiple interpeters are used, a module could have already been initialized in
22652
+ /* When multiple interpreters are used, a module could have already been initialized in
22402
22653
  a different interpreter, but not yet have a pointer in this interpreter.
22403
22654
  In this case, we do not want to continue adding types... everything should be
22404
22655
  set up already */
@@ -22412,7 +22663,7 @@ SWIG_InitializeModule(void *clientdata) {
22412
22663
  swig_type_info *type = 0;
22413
22664
  swig_type_info *ret;
22414
22665
  swig_cast_info *cast;
22415
-
22666
+
22416
22667
  #ifdef SWIGRUNTIME_DEBUG
22417
22668
  printf("SWIG_InitializeModule: type %d %s\n", i, swig_module.type_initial[i]->name);
22418
22669
  #endif
@@ -22439,7 +22690,7 @@ SWIG_InitializeModule(void *clientdata) {
22439
22690
  /* Insert casting types */
22440
22691
  cast = swig_module.cast_initial[i];
22441
22692
  while (cast->type) {
22442
-
22693
+
22443
22694
  /* Don't need to add information already in the list */
22444
22695
  ret = 0;
22445
22696
  #ifdef SWIGRUNTIME_DEBUG
@@ -22601,10 +22852,11 @@ SWIGEXPORT void Init_cproton(void) {
22601
22852
  rb_define_module_function(mCproton, "pn_rbhandler", _wrap_pn_rbhandler, -1);
22602
22853
  rb_define_const(mCproton, "PROTON_IMPORT_EXPORT_H", SWIG_From_int((int)(1)));
22603
22854
  rb_define_const(mCproton, "PN_VERSION_MAJOR", SWIG_From_int((int)(0)));
22604
- rb_define_const(mCproton, "PN_VERSION_MINOR", SWIG_From_int((int)(12)));
22855
+ rb_define_const(mCproton, "PN_VERSION_MINOR", SWIG_From_int((int)(13)));
22605
22856
  rb_define_const(mCproton, "PN_VERSION_POINT", SWIG_From_int((int)(0)));
22606
22857
  rb_define_const(mCproton, "PROTON_TYPES_H", SWIG_From_int((int)(1)));
22607
22858
  rb_define_const(mCproton, "PN_MILLIS_MAX", SWIG_From_unsigned_SS_int((unsigned int)((~0U))));
22859
+ rb_define_module_function(mCproton, "pn_timestamp_now", _wrap_pn_timestamp_now, -1);
22608
22860
  rb_define_module_function(mCproton, "pn_bytes", _wrap_pn_bytes, -1);
22609
22861
  rb_define_const(mCproton, "PROTON_OBJECT_H", SWIG_From_int((int)(1)));
22610
22862
  rb_define_singleton_method(mCproton, "PN_OBJECT", _wrap_PN_OBJECT_get, 0);
@@ -22875,6 +23127,7 @@ SWIGEXPORT void Init_cproton(void) {
22875
23127
  rb_define_module_function(mCproton, "pn_terminus_filter", _wrap_pn_terminus_filter, -1);
22876
23128
  rb_define_module_function(mCproton, "pn_terminus_copy", _wrap_pn_terminus_copy, -1);
22877
23129
  rb_define_const(mCproton, "PROTON_DELIVERY_H", SWIG_From_int((int)(1)));
23130
+ rb_define_module_function(mCproton, "pn_dtag", _wrap_pn_dtag, -1);
22878
23131
  rb_define_module_function(mCproton, "pn_delivery_get_context", _wrap_pn_delivery_get_context, -1);
22879
23132
  rb_define_module_function(mCproton, "pn_delivery_set_context", _wrap_pn_delivery_set_context, -1);
22880
23133
  rb_define_module_function(mCproton, "pn_delivery_attachments", _wrap_pn_delivery_attachments, -1);
@@ -23410,7 +23663,10 @@ SWIGEXPORT void Init_cproton(void) {
23410
23663
  rb_define_module_function(mCproton, "pn_reactor_selectable", _wrap_pn_reactor_selectable, -1);
23411
23664
  rb_define_module_function(mCproton, "pn_reactor_update", _wrap_pn_reactor_update, -1);
23412
23665
  rb_define_module_function(mCproton, "pn_reactor_acceptor", _wrap_pn_reactor_acceptor, -1);
23666
+ rb_define_module_function(mCproton, "pn_reactor_connection_to_host", _wrap_pn_reactor_connection_to_host, -1);
23413
23667
  rb_define_module_function(mCproton, "pn_reactor_connection", _wrap_pn_reactor_connection, -1);
23668
+ rb_define_module_function(mCproton, "pn_reactor_set_connection_host", _wrap_pn_reactor_set_connection_host, -1);
23669
+ rb_define_module_function(mCproton, "pn_reactor_get_connection_address", _wrap_pn_reactor_get_connection_address, -1);
23414
23670
  rb_define_module_function(mCproton, "pn_reactor_wakeup", _wrap_pn_reactor_wakeup, -1);
23415
23671
  rb_define_module_function(mCproton, "pn_reactor_start", _wrap_pn_reactor_start, -1);
23416
23672
  rb_define_module_function(mCproton, "pn_reactor_quiesced", _wrap_pn_reactor_quiesced, -1);