ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/Convert-BER-XS/XS.xs
(Generate patch)

Comparing Convert-BER-XS/XS.xs (file contents):
Revision 1.9 by root, Sat Apr 20 02:12:27 2019 UTC vs.
Revision 1.32 by root, Tue Apr 23 21:20:25 2019 UTC

1#include "EXTERN.h" 1#include "EXTERN.h"
2#include "perl.h" 2#include "perl.h"
3#include "XSUB.h" 3#include "XSUB.h"
4 4
5// C99 required 5// C99 required!
6// this is not just for comments, but also for
7// integer constant semantics,
8// sscanf format modifiers and more.
6 9
7enum { 10enum {
8 // ASN_TAG 11 // ASN_TAG
9 ASN_BOOLEAN = 0x01, 12 ASN_BOOLEAN = 0x01,
10 ASN_INTEGER32 = 0x02, 13 ASN_INTEGER = 0x02,
11 ASN_BIT_STRING = 0x03, 14 ASN_BIT_STRING = 0x03,
12 ASN_OCTET_STRING = 0x04, 15 ASN_OCTET_STRING = 0x04,
13 ASN_NULL = 0x05, 16 ASN_NULL = 0x05,
14 ASN_OBJECT_IDENTIFIER = 0x06, 17 ASN_OBJECT_IDENTIFIER = 0x06,
15 ASN_OID = 0x06, 18 ASN_OID = 0x06,
55 ASN_CLASS_SHIFT = 6, 58 ASN_CLASS_SHIFT = 6,
56 59
57 // ASN_APPLICATION SNMP 60 // ASN_APPLICATION SNMP
58 SNMP_IPADDRESS = 0x00, 61 SNMP_IPADDRESS = 0x00,
59 SNMP_COUNTER32 = 0x01, 62 SNMP_COUNTER32 = 0x01,
63 SNMP_GAUGE32 = 0x02,
60 SNMP_UNSIGNED32 = 0x02, 64 SNMP_UNSIGNED32 = 0x02,
61 SNMP_TIMETICKS = 0x03, 65 SNMP_TIMETICKS = 0x03,
62 SNMP_OPAQUE = 0x04, 66 SNMP_OPAQUE = 0x04,
63 SNMP_COUNTER64 = 0x06, 67 SNMP_COUNTER64 = 0x06,
64}; 68};
65 69
70// tlow-level types this module can ecode the above (and more) into
66enum { 71enum {
67 BER_TYPE_BYTES, 72 BER_TYPE_BYTES,
68 BER_TYPE_UTF8, 73 BER_TYPE_UTF8,
69 BER_TYPE_UCS2, 74 BER_TYPE_UCS2,
70 BER_TYPE_UCS4, 75 BER_TYPE_UCS4,
76 BER_TYPE_REAL, 81 BER_TYPE_REAL,
77 BER_TYPE_IPADDRESS, 82 BER_TYPE_IPADDRESS,
78 BER_TYPE_CROAK, 83 BER_TYPE_CROAK,
79}; 84};
80 85
86// tuple array indices
81enum { 87enum {
82 BER_CLASS = 0, 88 BER_CLASS = 0,
83 BER_TAG = 1, 89 BER_TAG = 1,
84 BER_CONSTRUCTED = 2, 90 BER_FLAGS = 2,
85 BER_DATA = 3, 91 BER_DATA = 3,
86 BER_ARRAYSIZE 92 BER_ARRAYSIZE
87}; 93};
88 94
89#define MAX_OID_STRLEN 4096 95#define MAX_OID_STRLEN 4096
90 96
137{ 143{
138 if (!SvOK (profile)) 144 if (!SvOK (profile))
139 return default_profile; 145 return default_profile;
140 146
141 if (!SvROK (profile)) 147 if (!SvROK (profile))
142 croak ("invalid profile"); 148 croak ("Convert::BER::XS::Profile expected");
143 149
144 profile = SvRV (profile); 150 profile = SvRV (profile);
145 151
146 if (SvSTASH (profile) != profile_stash) 152 if (SvSTASH (profile) != profile_stash)
147 croak ("invalid profile object"); 153 croak ("Convert::BER::XS::Profile expected");
148 154
149 return (void *)profile; 155 return (void *)profile;
150} 156}
151 157
152static int 158static int
159 return BER_TYPE_BYTES; 165 return BER_TYPE_BYTES;
160 166
161 return SvPVX (sv)[idx]; 167 return SvPVX (sv)[idx];
162} 168}
163 169
164static int 170static void
165profile_set (profile_type *profile, int klass, int tag, int type) 171profile_set (profile_type *profile, int klass, int tag, int type)
166{ 172{
167 SV *sv = (SV *)profile; 173 SV *sv = (SV *)profile;
168 U32 idx = (tag << 2) + klass; 174 U32 idx = (tag << 2) + klass;
169 STRLEN oldlen = SvCUR (sv); 175 STRLEN oldlen = SvCUR (sv);
178 184
179 SvPVX (sv)[idx] = type; 185 SvPVX (sv)[idx] = type;
180} 186}
181 187
182static SV * 188static SV *
183profile_new () 189profile_new (void)
184{ 190{
185 SV *sv = newSVpvn ("", 0); 191 SV *sv = newSVpvn ("", 0);
186 192
187 static const struct { 193 static const struct {
188 int klass; 194 int klass;
189 int tag; 195 int tag;
190 int type; 196 int type;
191 } *celem, default_map[] = { 197 } *celem, default_map[] = {
192 { ASN_UNIVERSAL, ASN_BOOLEAN , BER_TYPE_BOOL }, 198 { ASN_UNIVERSAL, ASN_BOOLEAN , BER_TYPE_BOOL },
193 { ASN_UNIVERSAL, ASN_INTEGER32 , BER_TYPE_INT }, 199 { ASN_UNIVERSAL, ASN_INTEGER , BER_TYPE_INT },
194 { ASN_UNIVERSAL, ASN_NULL , BER_TYPE_NULL }, 200 { ASN_UNIVERSAL, ASN_NULL , BER_TYPE_NULL },
195 { ASN_UNIVERSAL, ASN_OBJECT_IDENTIFIER, BER_TYPE_OID }, 201 { ASN_UNIVERSAL, ASN_OBJECT_IDENTIFIER, BER_TYPE_OID },
196 { ASN_UNIVERSAL, ASN_OBJECT_DESCRIPTOR, BER_TYPE_OID },
197 { ASN_UNIVERSAL, ASN_RELATIVE_OID , BER_TYPE_RELOID }, 202 { ASN_UNIVERSAL, ASN_RELATIVE_OID , BER_TYPE_RELOID },
198 { ASN_UNIVERSAL, ASN_REAL , BER_TYPE_REAL }, 203 { ASN_UNIVERSAL, ASN_REAL , BER_TYPE_REAL },
204 { ASN_UNIVERSAL, ASN_ENUMERATED , BER_TYPE_INT },
199 { ASN_UNIVERSAL, ASN_UTF8_STRING , BER_TYPE_UTF8 }, 205 { ASN_UNIVERSAL, ASN_UTF8_STRING , BER_TYPE_UTF8 },
200 { ASN_UNIVERSAL, ASN_BMP_STRING , BER_TYPE_UCS2 }, 206 { ASN_UNIVERSAL, ASN_BMP_STRING , BER_TYPE_UCS2 },
201 { ASN_UNIVERSAL, ASN_UNIVERSAL_STRING , BER_TYPE_UCS4 }, 207 { ASN_UNIVERSAL, ASN_UNIVERSAL_STRING , BER_TYPE_UCS4 },
202 }; 208 };
203 209
204 for (celem = default_map + sizeof (default_map) / sizeof (default_map [0]); celem > default_map; celem--) 210 for (celem = default_map + sizeof (default_map) / sizeof (default_map [0]); celem-- > default_map; )
205 profile_set ((void *)sv, celem->klass, celem->tag, celem->type); 211 profile_set ((profile_type *)sv, celem->klass, celem->tag, celem->type);
206 212
207 return sv_bless (newRV_noinc (sv), profile_stash); 213 return sv_bless (newRV_noinc (sv), profile_stash);
208} 214}
209 215
210///////////////////////////////////////////////////////////////////////////// 216/////////////////////////////////////////////////////////////////////////////
223 error ("unexpected end of message buffer"); 229 error ("unexpected end of message buffer");
224} 230}
225 231
226// get_* functions fetch something from the buffer 232// get_* functions fetch something from the buffer
227// decode_* functions use get_* fun ctions to decode ber values 233// decode_* functions use get_* fun ctions to decode ber values
234
235// get single octet
236static U8
237get_u8 (void)
238{
239 if (cur == end)
240 error ("unexpected end of message buffer");
241
242 return *cur++;
243}
228 244
229// get n octets 245// get n octets
230static U8 * 246static U8 *
231get_n (UV count) 247get_n (UV count)
232{ 248{
234 U8 *res = cur; 250 U8 *res = cur;
235 cur += count; 251 cur += count;
236 return res; 252 return res;
237} 253}
238 254
239// get single octet
240static U8
241get_u8 (void)
242{
243 if (cur == end)
244 error ("unexpected end of message buffer");
245
246 return *cur++;
247}
248
249// get ber-encoded integer (i.e. pack "w") 255// get ber-encoded integer (i.e. pack "w")
250static U32 256static UV
251get_w (void) 257get_w (void)
252{ 258{
253 U32 res = 0; 259 UV res = 0;
260 U8 c = get_u8 ();
261
262 if (expect_false (c == 0x80))
263 error ("illegal BER padding (X.690 8.1.2.4.2, 8.19.2)");
254 264
255 for (;;) 265 for (;;)
256 { 266 {
257 U8 c = get_u8 (); 267 if (expect_false (res >> UVSIZE * 8 - 7))
268 error ("BER variable length integer overflow");
269
258 res = (res << 7) | (c & 0x7f); 270 res = (res << 7) | (c & 0x7f);
259 271
260 if (!(c & 0x80)) 272 if (expect_true (!(c & 0x80)))
261 return res; 273 return res;
262 }
263}
264 274
275 c = get_u8 ();
276 }
277}
278
265static U32 279static UV
266get_length (void) 280get_length (void)
267{ 281{
268 U32 res = get_u8 (); 282 UV res = get_u8 ();
269 283
270 if (res & 0x80) 284 if (expect_false (res & 0x80))
271 { 285 {
272 int cnt = res & 0x7f; 286 U8 cnt = res & 0x7f;
287
288 // this genewrates quite ugly code, but the overhead
289 // of copying the bytes for these lengths is probably so high
290 // that a slightly inefficient get_length won't matter.
291
292 if (expect_false (cnt == 0))
293 error ("illegal use of indefinite BER length form in primitive encoding (X.690 8.1.3.2)");
294
295 if (expect_false (cnt > UVSIZE))
296 error ("BER value length too long (must fit into UV) or BER reserved value in length (X.690 8.1.3.5)");
297
298 want (cnt);
299
273 res = 0; 300 res = 0;
274 301 do
275 switch (cnt) 302 res = (res << 8) | *cur++;
276 { 303 while (--cnt);
277 case 0:
278 error ("indefinite ASN.1 lengths not supported");
279 return 0;
280
281 default:
282 error ("ASN.1 length too long");
283 return 0;
284
285 case 4: res = (res << 8) | get_u8 ();
286 case 3: res = (res << 8) | get_u8 ();
287 case 2: res = (res << 8) | get_u8 ();
288 case 1: res = (res << 8) | get_u8 ();
289 }
290 } 304 }
291 305
292 return res; 306 return res;
293} 307}
294 308
295static SV * 309static SV *
296decode_int () 310decode_int (UV len)
297{ 311{
298 int len = get_length ();
299
300 if (len <= 0) 312 if (!len)
301 { 313 error ("invalid BER_TYPE_INT length zero (X.690 8.3.1)");
302 error ("integer length equal to zero");
303 return 0;
304 }
305 314
306 U8 *data = get_n (len); 315 U8 *data = get_n (len);
307 316
317 if (expect_false (len > 1))
318 {
319 U16 mask = (data [0] << 8) | data [1] & 0xff80;
320
321 if (expect_false (mask == 0xff80 || mask == 0x0000))
322 error ("illegal padding in BER_TYPE_INT (X.690 8.3.2)");
323 }
324
308 int negative = data [0] & 0x80; 325 int negative = data [0] & 0x80;
309 326
310 UV val = negative ? -1 : 0; // copy signbit to all bits 327 UV val = negative ? -1 : 0; // copy signbit to all bits
328
329 if (len > UVSIZE + (!negative && !*data))
330 error ("BER_TYPE_INT overflow");
311 331
312 do 332 do
313 val = (val << 8) | *data++; 333 val = (val << 8) | *data++;
314 while (--len); 334 while (--len);
315 335
317 // but that's ok, as perl relies on it as well. 337 // but that's ok, as perl relies on it as well.
318 return negative ? newSViv ((IV)val) : newSVuv (val); 338 return negative ? newSViv ((IV)val) : newSVuv (val);
319} 339}
320 340
321static SV * 341static SV *
322decode_data (void) 342decode_data (UV len)
323{ 343{
324 U32 len = get_length ();
325 U8 *data = get_n (len);
326 return newSVpvn ((char *)data, len); 344 return newSVpvn ((char *)get_n (len), len);
327} 345}
328 346
329// gelper for decode_object_identifier 347// helper for decode_object_identifier
330static char * 348static char *
331write_uv (char *buf, U32 u) 349write_uv (char *buf, UV u)
332{ 350{
333 // the one-digit case is absolutely predominant, so this pays off (hopefully) 351 // the one-digit case is absolutely predominant, so this pays off (hopefully)
334 if (expect_true (u < 10)) 352 if (expect_true (u < 10))
335 *buf++ = u + '0'; 353 *buf++ = u + '0';
336 else 354 else
337 { 355 {
356 // this *could* be done much faster using branchless fixed-point arithmetics
338 char *beg = buf; 357 char *beg = buf;
339 358
340 do 359 do
341 { 360 {
342 *buf++ = u % 10 + '0'; 361 *buf++ = u % 10 + '0';
343 u /= 10; 362 u /= 10;
344 } 363 }
345 while (u); 364 while (u);
346 365
347 // reverse digits 366 // reverse digits
348 for (char *ptr = buf; --ptr != beg; ++beg) 367 char *ptr = buf;
368 while (--ptr > beg)
349 { 369 {
350 char c = *ptr; 370 char c = *ptr;
351 *ptr = *beg; 371 *ptr = *beg;
352 *beg = c; 372 *beg = c;
373 ++beg;
353 } 374 }
354 } 375 }
355 376
356 return buf; 377 return buf;
357} 378}
358 379
359static SV * 380static SV *
360decode_oid (int relative) 381decode_oid (UV len, int relative)
361{ 382{
362 U32 len = get_length ();
363
364 if (len <= 0) 383 if (len <= 0)
365 { 384 {
366 error ("OBJECT IDENTIFIER length equal to zero"); 385 error ("BER_TYPE_OID length must not be zero");
367 return &PL_sv_undef; 386 return &PL_sv_undef;
368 } 387 }
369 388
370 U8 *end = cur + len; 389 U8 *end = cur + len;
371 U32 w = get_w (); 390 UV w = get_w ();
372 391
373 static char oid[MAX_OID_STRLEN]; // must be static 392 static char oid[MAX_OID_STRLEN]; // static, because too large for stack
374 char *app = oid; 393 char *app = oid;
375 394
376 if (relative) 395 if (relative)
377 app = write_uv (app, w); 396 app = write_uv (app, w);
378 else 397 else
379 { 398 {
399 UV w1, w2;
400
401 if (w < 2 * 40)
402 (w1 = w / 40), (w2 = w % 40);
403 else
404 (w1 = 2), (w2 = w - 2 * 40);
405
380 app = write_uv (app, (U8)w / 40); 406 app = write_uv (app, w1);
381 *app++ = '.'; 407 *app++ = '.';
382 app = write_uv (app, (U8)w % 40); 408 app = write_uv (app, w2);
409 }
410
411 while (cur < end)
383 } 412 {
384
385 // we assume an oid component is never > 64 bytes 413 // we assume an oid component is never > 64 digits
386 while (cur < end && oid + sizeof (oid) - app > 64) 414 if (oid + sizeof (oid) - app < 64)
387 { 415 croak ("BER_TYPE_OID to long to decode");
416
388 w = get_w (); 417 w = get_w ();
389 *app++ = '.'; 418 *app++ = '.';
390 app = write_uv (app, w); 419 app = write_uv (app, w);
391 } 420 }
392 421
393 return newSVpvn (oid, app - oid); 422 return newSVpvn (oid, app - oid);
394} 423}
395 424
396// TODO: this is unacceptably slow 425// TODO: this is unacceptably slow
397static SV * 426static SV *
398decode_ucs (int chrsize) 427decode_ucs (UV len, int chrsize)
399{ 428{
400 SV *res = NEWSV (0, 0);
401
402 U32 len = get_length ();
403
404 if (len & (chrsize - 1)) 429 if (len & (chrsize - 1))
405 croak ("BER_TYPE_UCS has an invalid number of octets (%d)", len); 430 croak ("BER_TYPE_UCS has an invalid number of octets (%d)", len);
431
432 SV *res = NEWSV (0, 0);
406 433
407 while (len) 434 while (len)
408 { 435 {
409 U8 b1 = get_u8 (); 436 U8 b1 = get_u8 ();
410 U8 b2 = get_u8 (); 437 U8 b2 = get_u8 ();
428 455
429 return res; 456 return res;
430} 457}
431 458
432static SV * 459static SV *
433decode_ber () 460decode_ber (void)
434{ 461{
435 int identifier = get_u8 (); 462 int identifier = get_u8 ();
436 463
437 SV *res; 464 SV *res;
438 465
441 int tag = identifier & ASN_TAG_MASK; 468 int tag = identifier & ASN_TAG_MASK;
442 469
443 if (tag == ASN_TAG_BER) 470 if (tag == ASN_TAG_BER)
444 tag = get_w (); 471 tag = get_w ();
445 472
446 if (tag == ASN_TAG_BER)
447 tag = get_w ();
448
449 if (constructed) 473 if (constructed)
450 { 474 {
451 U32 len = get_length (); 475 want (1);
452 U32 seqend = (cur - buf) + len;
453 AV *av = (AV *)sv_2mortal ((SV *)newAV ()); 476 AV *av = (AV *)sv_2mortal ((SV *)newAV ());
454 477
455 while (cur < buf + seqend) 478 if (expect_false (*cur == 0x80))
479 {
480 // indefinite length
481 ++cur;
482
483 for (;;)
484 {
485 want (2);
486 if (!cur [0] && !cur [1])
487 {
488 cur += 2;
489 break;
490 }
491
456 av_push (av, decode_ber ()); 492 av_push (av, decode_ber ());
493 }
494 }
495 else
496 {
497 UV len = get_length ();
498 UV seqend = (cur - buf) + len;
457 499
458 if (cur > buf + seqend) 500 while (cur < buf + seqend)
501 av_push (av, decode_ber ());
502
503 if (expect_false (cur > buf + seqend))
459 croak ("constructed type %02x overflow (%x %x)\n", identifier, cur - buf, seqend); 504 croak ("CONSTRUCTED type %02x length overflow (0x%x 0x%x)\n", identifier, (int)(cur - buf), (int)seqend);
505 }
460 506
461 res = newRV_inc ((SV *)av); 507 res = newRV_inc ((SV *)av);
462 } 508 }
463 else 509 else
510 {
511 UV len = get_length ();
512
464 switch (profile_lookup (cur_profile, klass, tag)) 513 switch (profile_lookup (cur_profile, klass, tag))
465 { 514 {
466 case BER_TYPE_NULL: 515 case BER_TYPE_NULL:
516 if (expect_false (len))
517 croak ("BER_TYPE_NULL value with non-zero length %d encountered (X.690 8.8.2)", len);
518
467 res = &PL_sv_undef; 519 res = &PL_sv_undef;
468 break; 520 break;
469 521
470 case BER_TYPE_BOOL: 522 case BER_TYPE_BOOL:
471 {
472 U32 len = get_length ();
473
474 if (len != 1) 523 if (expect_false (len != 1))
475 croak ("BER_TYPE_BOOLEAN type with invalid length %d encountered", len); 524 croak ("BER_TYPE_BOOLEAN value with invalid length %d encountered (X.690 8.2.1)", len);
476 525
477 res = newSVcacheint (get_u8 () ? 0 : 1); 526 res = newSVcacheint (!!get_u8 ());
478 }
479 break; 527 break;
480 528
481 case BER_TYPE_OID: 529 case BER_TYPE_OID:
482 res = decode_oid (0); 530 res = decode_oid (len, 0);
483 break; 531 break;
484 532
485 case BER_TYPE_RELOID: 533 case BER_TYPE_RELOID:
486 res = decode_oid (1); 534 res = decode_oid (len, 1);
487 break; 535 break;
488 536
489 case BER_TYPE_INT: 537 case BER_TYPE_INT:
490 res = decode_int (); 538 res = decode_int (len);
491 break; 539 break;
492 540
493 case BER_TYPE_UTF8: 541 case BER_TYPE_UTF8:
494 res = decode_data (); 542 res = decode_data (len);
495 SvUTF8_on (res); 543 SvUTF8_on (res);
496 break; 544 break;
497 545
498 case BER_TYPE_BYTES: 546 case BER_TYPE_BYTES:
499 res = decode_data (); 547 res = decode_data (len);
500 break; 548 break;
501 549
502 case BER_TYPE_IPADDRESS: 550 case BER_TYPE_IPADDRESS:
503 { 551 {
504 U32 len = get_length ();
505
506 if (len != 4) 552 if (len != 4)
507 croak ("BER_TYPE_IPADDRESS type with invalid length %d encountered", len); 553 croak ("BER_TYPE_IPADDRESS type with invalid length %d encountered (RFC 2578 7.1.5)", len);
508 554
509 U8 c1 = get_u8 (); 555 U8 *data = get_n (4);
510 U8 c2 = get_u8 (); 556 res = newSVpvf ("%d.%d.%d.%d", data [0], data [1], data [2], data [3]);
511 U8 c3 = get_u8 ();
512 U8 c4 = get_u8 ();
513
514 res = newSVpvf ("%d.%d.%d.%d", c1, c2, c3, c4);
515 } 557 }
516 break; 558 break;
517 559
518 case BER_TYPE_UCS2: 560 case BER_TYPE_UCS2:
519 res = decode_ucs (2); 561 res = decode_ucs (len, 2);
520 break; 562 break;
521 563
522 case BER_TYPE_UCS4: 564 case BER_TYPE_UCS4:
523 res = decode_ucs (4); 565 res = decode_ucs (len, 4);
524 break; 566 break;
525 567
526 case BER_TYPE_REAL: 568 case BER_TYPE_REAL:
569 error ("BER_TYPE_REAL not implemented");
570
527 case BER_TYPE_CROAK: 571 case BER_TYPE_CROAK:
572 croak ("class/tag %d/%d mapped to BER_TYPE_CROAK", klass, tag);
573
528 default: 574 default:
529 croak ("unconfigured/unsupported class/tag %d/%d", klass, tag); 575 croak ("unconfigured/unsupported class/tag %d/%d", klass, tag);
530 } 576 }
577 }
531 578
532 AV *av = newAV (); 579 AV *av = newAV ();
533 av_fill (av, BER_ARRAYSIZE - 1); 580 av_fill (av, BER_ARRAYSIZE - 1);
534 AvARRAY (av)[BER_CLASS ] = newSVcacheint (klass); 581 AvARRAY (av)[BER_CLASS] = newSVcacheint (klass);
535 AvARRAY (av)[BER_TAG ] = newSVcacheint (tag); 582 AvARRAY (av)[BER_TAG ] = newSVcacheint (tag);
536 AvARRAY (av)[BER_CONSTRUCTED] = newSVcacheint (constructed ? 1 : 0); 583 AvARRAY (av)[BER_FLAGS] = newSVcacheint (constructed ? 1 : 0);
537 AvARRAY (av)[BER_DATA ] = res; 584 AvARRAY (av)[BER_DATA ] = res;
538 585
539 return newRV_noinc ((SV *)av); 586 return newRV_noinc ((SV *)av);
540} 587}
541 588
542///////////////////////////////////////////////////////////////////////////// 589/////////////////////////////////////////////////////////////////////////////
547strlen_sum (STRLEN l1, STRLEN l2) 594strlen_sum (STRLEN l1, STRLEN l2)
548{ 595{
549 size_t sum = l1 + l2; 596 size_t sum = l1 + l2;
550 597
551 if (sum < (size_t)l2 || sum != (size_t)(STRLEN)sum) 598 if (sum < (size_t)l2 || sum != (size_t)(STRLEN)sum)
552 croak ("JSON::XS: string size overflow"); 599 croak ("Convert::BER::XS: string size overflow");
553 600
554 return sum; 601 return sum;
555} 602}
556 603
557static void 604static void
558set_buf (SV *sv) 605set_buf (SV *sv)
559{ 606{
560 STRLEN len; 607 STRLEN len;
561 buf_sv = sv; 608 buf_sv = sv;
562 buf = SvPVbyte (buf_sv, len); 609 buf = (U8 *)SvPVbyte (buf_sv, len);
563 cur = buf; 610 cur = buf;
564 end = buf + len; 611 end = buf + len;
565} 612}
566 613
567/* similar to SvGROW, but somewhat safer and guarantees exponential realloc strategy */ 614/* similar to SvGROW, but somewhat safer and guarantees exponential realloc strategy */
581need (STRLEN len) 628need (STRLEN len)
582{ 629{
583 if (expect_false ((uintptr_t)(end - cur) < len)) 630 if (expect_false ((uintptr_t)(end - cur) < len))
584 { 631 {
585 STRLEN pos = cur - buf; 632 STRLEN pos = cur - buf;
586 buf = my_sv_grow (buf_sv, pos, len); 633 buf = (U8 *)my_sv_grow (buf_sv, pos, len);
587 cur = buf + pos; 634 cur = buf + pos;
588 end = buf + SvLEN (buf_sv) - 1; 635 end = buf + SvLEN (buf_sv) - 1;
589 } 636 }
590} 637}
591 638
595 need (1); 642 need (1);
596 *cur++ = val; 643 *cur++ = val;
597} 644}
598 645
599static void 646static void
600put_w_nocheck (U32 val) 647put_w_nocheck (UV val)
601{ 648{
649#if UVSIZE > 4
650 *cur = (val >> 7 * 9) | 0x80; cur += val >= ((UV)1 << (7 * 9));
651 *cur = (val >> 7 * 8) | 0x80; cur += val >= ((UV)1 << (7 * 8));
652 *cur = (val >> 7 * 7) | 0x80; cur += val >= ((UV)1 << (7 * 7));
653 *cur = (val >> 7 * 6) | 0x80; cur += val >= ((UV)1 << (7 * 6));
654 *cur = (val >> 7 * 5) | 0x80; cur += val >= ((UV)1 << (7 * 5));
655#endif
602 *cur = (val >> 7 * 4) | 0x80; cur += val >= (1 << (7 * 4)); 656 *cur = (val >> 7 * 4) | 0x80; cur += val >= ((UV)1 << (7 * 4));
603 *cur = (val >> 7 * 3) | 0x80; cur += val >= (1 << (7 * 3)); 657 *cur = (val >> 7 * 3) | 0x80; cur += val >= ((UV)1 << (7 * 3));
604 *cur = (val >> 7 * 2) | 0x80; cur += val >= (1 << (7 * 2)); 658 *cur = (val >> 7 * 2) | 0x80; cur += val >= ((UV)1 << (7 * 2));
605 *cur = (val >> 7 * 1) | 0x80; cur += val >= (1 << (7 * 1)); 659 *cur = (val >> 7 * 1) | 0x80; cur += val >= ((UV)1 << (7 * 1));
606 *cur = val & 0x7f; cur += 1; 660 *cur = val & 0x7f; cur += 1;
607} 661}
608 662
609static void 663static void
610put_w (U32 val) 664put_w (UV val)
611{ 665{
612 need (5); // we only handle up to 5 bytes 666 need (5); // we only handle up to 5 bytes
613 667
614 put_w_nocheck (val); 668 put_w_nocheck (val);
615} 669}
616 670
617static U8 * 671static U8 *
618put_length_at (U32 val, U8 *cur) 672put_length_at (UV val, U8 *cur)
619{ 673{
620 if (val < 0x7fU) 674 if (val <= 0x7fU)
621 *cur++ = val; 675 *cur++ = val;
622 else 676 else
623 { 677 {
624 U8 *lenb = cur++; 678 U8 *lenb = cur++;
625 679
626 *cur = val >> 24; cur += *cur > 0; 680#if UVSIZE > 4
627 *cur = val >> 16; cur += *cur > 0; 681 *cur = val >> 56; cur += val >= ((UV)1 << (8 * 7));
628 *cur = val >> 8; cur += *cur > 0; 682 *cur = val >> 48; cur += val >= ((UV)1 << (8 * 6));
683 *cur = val >> 40; cur += val >= ((UV)1 << (8 * 5));
684 *cur = val >> 32; cur += val >= ((UV)1 << (8 * 4));
685#endif
686 *cur = val >> 24; cur += val >= ((UV)1 << (8 * 3));
687 *cur = val >> 16; cur += val >= ((UV)1 << (8 * 2));
688 *cur = val >> 8; cur += val >= ((UV)1 << (8 * 1));
629 *cur = val ; cur += 1; 689 *cur = val ; cur += 1;
630 690
631 *lenb = 0x80 + cur - lenb - 1; 691 *lenb = 0x80 + cur - lenb - 1;
632 } 692 }
633 693
634 return cur; 694 return cur;
635} 695}
636 696
637static void 697static void
638put_length (U32 val) 698put_length (UV val)
639{ 699{
640 need (5 + val); 700 need (9 + val);
641 cur = put_length_at (val, cur); 701 cur = put_length_at (val, cur);
642} 702}
643 703
644// return how many bytes the encoded length requires 704// return how many bytes the encoded length requires
645static int length_length (U32 val) 705static int length_length (UV val)
646{ 706{
647 return val < 0x7fU 707 // use hashing with a DeBruin sequence, anyone?
708 return expect_true (val <= 0x7fU)
648 ? 1 709 ? 1
649 : 2 + (val > 0xffU) + (val > 0xffffU) + (val > 0xffffffU); 710 : 2
711 + (val > 0x000000000000ffU)
712 + (val > 0x0000000000ffffU)
713 + (val > 0x00000000ffffffU)
714#if UVSIZE > 4
715 + (val > 0x000000ffffffffU)
716 + (val > 0x0000ffffffffffU)
717 + (val > 0x00ffffffffffffU)
718 + (val > 0xffffffffffffffU)
719#endif
720 ;
650} 721}
651 722
652static void 723static void
653encode_data (const char *ptr, STRLEN len) 724encode_data (const char *ptr, STRLEN len)
654{ 725{
716 787
717 *lenb = cur - lenb - 1; 788 *lenb = cur - lenb - 1;
718} 789}
719 790
720// we don't know the length yet, so we optimistically 791// we don't know the length yet, so we optimistically
721// assume the length will need one octet later. if that 792// assume the length will need one octet later. If that
722// turns out to be wrong, we memove as needed. 793// turns out to be wrong, we memmove as needed.
723// mark the beginning 794// mark the beginning
724static STRLEN 795static STRLEN
725len_fixup_mark () 796len_fixup_mark (void)
726{ 797{
727 return cur++ - buf; 798 return cur++ - buf;
728} 799}
729 800
730// patch up the length 801// patch up the length
817 put_length (uchars * chrsize); 888 put_length (uchars * chrsize);
818 889
819 while (uchars--) 890 while (uchars--)
820 { 891 {
821 STRLEN uclen; 892 STRLEN uclen;
822 UV uchr = utf8_to_uvchr_buf (ptr, ptr + len, &uclen); 893 UV uchr = utf8_to_uvchr_buf ((U8 *)ptr, (U8 *)ptr + len, &uclen);
823 894
824 ptr += uclen; 895 ptr += uclen;
825 len -= uclen; 896 len -= uclen;
826 897
827 if (chrsize == 4) 898 if (chrsize == 4)
839{ 910{
840 AV *av = ber_tuple (tuple); 911 AV *av = ber_tuple (tuple);
841 912
842 int klass = SvIV (AvARRAY (av)[BER_CLASS]); 913 int klass = SvIV (AvARRAY (av)[BER_CLASS]);
843 int tag = SvIV (AvARRAY (av)[BER_TAG]); 914 int tag = SvIV (AvARRAY (av)[BER_TAG]);
844 int constructed = SvIV (AvARRAY (av)[BER_CONSTRUCTED]) ? ASN_CONSTRUCTED : 0; 915 int constructed = SvIV (AvARRAY (av)[BER_FLAGS]) & 1 ? ASN_CONSTRUCTED : 0;
845 SV *data = AvARRAY (av)[BER_DATA]; 916 SV *data = AvARRAY (av)[BER_DATA];
846 917
847 int identifier = (klass << ASN_CLASS_SHIFT) | constructed; 918 int identifier = (klass << ASN_CLASS_SHIFT) | constructed;
848 919
849 if (expect_false (tag >= ASN_TAG_BER)) 920 if (expect_false (tag >= ASN_TAG_BER))
860 // and adjust later 931 // and adjust later
861 need (1); 932 need (1);
862 STRLEN mark = len_fixup_mark (); 933 STRLEN mark = len_fixup_mark ();
863 934
864 if (expect_false (!SvROK (data) || SvTYPE (SvRV (data)) != SVt_PVAV)) 935 if (expect_false (!SvROK (data) || SvTYPE (SvRV (data)) != SVt_PVAV))
865 croak ("BER constructed data must be array-reference"); 936 croak ("BER CONSTRUCTED data must be array-reference");
866 937
867 AV *av = (AV *)SvRV (data); 938 AV *av = (AV *)SvRV (data);
868 int fill = AvFILL (av); 939 int fill = AvFILL (av);
869 940
870 if (expect_false (SvRMAGICAL (av))) 941 if (expect_false (SvRMAGICAL (av)))
871 croak ("BER constructed data must not be tied"); 942 croak ("BER CONSTRUCTED data must not be tied");
872 943
944 int i;
873 for (int i = 0; i <= fill; ++i) 945 for (i = 0; i <= fill; ++i)
874 encode_ber (AvARRAY (av)[i]); 946 encode_ber (AvARRAY (av)[i]);
875 947
876 len_fixup (mark); 948 len_fixup (mark);
877 } 949 }
878 else 950 else
882 put_length (0); 954 put_length (0);
883 break; 955 break;
884 956
885 case BER_TYPE_BOOL: 957 case BER_TYPE_BOOL:
886 put_length (1); 958 put_length (1);
887 *cur++ = SvTRUE (data) ? 0xff : 0x00; 959 *cur++ = SvTRUE (data) ? 0xff : 0x00; // 0xff = DER/CER
888 break; 960 break;
889 961
890 case BER_TYPE_OID: 962 case BER_TYPE_OID:
891 encode_oid (data, 0); 963 encode_oid (data, 0);
892 break; 964 break;
930 case BER_TYPE_UCS4: 1002 case BER_TYPE_UCS4:
931 encode_ucs (data, 4); 1003 encode_ucs (data, 4);
932 break; 1004 break;
933 1005
934 case BER_TYPE_REAL: 1006 case BER_TYPE_REAL:
1007 croak ("BER_TYPE_REAL not implemented");
1008
935 case BER_TYPE_CROAK: 1009 case BER_TYPE_CROAK:
1010 croak ("class/tag %d/%d mapped to BER_TYPE_CROAK", klass, tag);
1011
936 default: 1012 default:
937 croak ("unconfigured/unsupported class/tag %d/%d", klass, tag); 1013 croak ("unconfigured/unsupported class/tag %d/%d", klass, tag);
938 } 1014 }
939 1015
940} 1016}
955 const char *name; 1031 const char *name;
956 IV iv; 1032 IV iv;
957 } *civ, const_iv[] = { 1033 } *civ, const_iv[] = {
958#define const_iv(name) { # name, name }, 1034#define const_iv(name) { # name, name },
959 const_iv (ASN_BOOLEAN) 1035 const_iv (ASN_BOOLEAN)
960 const_iv (ASN_INTEGER32) 1036 const_iv (ASN_INTEGER)
961 const_iv (ASN_BIT_STRING) 1037 const_iv (ASN_BIT_STRING)
962 const_iv (ASN_OCTET_STRING) 1038 const_iv (ASN_OCTET_STRING)
963 const_iv (ASN_NULL) 1039 const_iv (ASN_NULL)
964 const_iv (ASN_OBJECT_IDENTIFIER) 1040 const_iv (ASN_OBJECT_IDENTIFIER)
965 const_iv (ASN_OBJECT_DESCRIPTOR) 1041 const_iv (ASN_OBJECT_DESCRIPTOR)
994 const_iv (ASN_CONTEXT) 1070 const_iv (ASN_CONTEXT)
995 const_iv (ASN_PRIVATE) 1071 const_iv (ASN_PRIVATE)
996 1072
997 const_iv (BER_CLASS) 1073 const_iv (BER_CLASS)
998 const_iv (BER_TAG) 1074 const_iv (BER_TAG)
999 const_iv (BER_CONSTRUCTED) 1075 const_iv (BER_FLAGS)
1000 const_iv (BER_DATA) 1076 const_iv (BER_DATA)
1001 1077
1002 const_iv (BER_TYPE_BYTES) 1078 const_iv (BER_TYPE_BYTES)
1003 const_iv (BER_TYPE_UTF8) 1079 const_iv (BER_TYPE_UTF8)
1004 const_iv (BER_TYPE_UCS2) 1080 const_iv (BER_TYPE_UCS2)
1012 const_iv (BER_TYPE_IPADDRESS) 1088 const_iv (BER_TYPE_IPADDRESS)
1013 const_iv (BER_TYPE_CROAK) 1089 const_iv (BER_TYPE_CROAK)
1014 1090
1015 const_iv (SNMP_IPADDRESS) 1091 const_iv (SNMP_IPADDRESS)
1016 const_iv (SNMP_COUNTER32) 1092 const_iv (SNMP_COUNTER32)
1093 const_iv (SNMP_GAUGE32)
1017 const_iv (SNMP_UNSIGNED32) 1094 const_iv (SNMP_UNSIGNED32)
1018 const_iv (SNMP_TIMETICKS) 1095 const_iv (SNMP_TIMETICKS)
1019 const_iv (SNMP_OPAQUE) 1096 const_iv (SNMP_OPAQUE)
1020 const_iv (SNMP_COUNTER64) 1097 const_iv (SNMP_COUNTER64)
1021 }; 1098 };
1022 1099
1023 for (civ = const_iv + sizeof (const_iv) / sizeof (const_iv [0]); civ > const_iv; civ--) 1100 for (civ = const_iv + sizeof (const_iv) / sizeof (const_iv [0]); civ > const_iv; civ--)
1024 newCONSTSUB (stash, (char *)civ[-1].name, newSViv (civ[-1].iv)); 1101 newCONSTSUB (stash, (char *)civ[-1].name, newSViv (civ[-1].iv));
1025} 1102}
1026 1103
1027SV * 1104void
1028ber_decode (SV *ber, SV *profile = &PL_sv_undef) 1105ber_decode (SV *ber, SV *profile = &PL_sv_undef)
1106 ALIAS:
1107 ber_decode_prefix = 1
1029 CODE: 1108 PPCODE:
1030{ 1109{
1031 cur_profile = SvPROFILE (profile); 1110 cur_profile = SvPROFILE (profile);
1032 STRLEN len; 1111 STRLEN len;
1033 buf = SvPVbyte (ber, len); 1112 buf = (U8 *)SvPVbyte (ber, len);
1034 cur = buf; 1113 cur = buf;
1035 end = buf + len; 1114 end = buf + len;
1036 1115
1037 RETVAL = decode_ber (); 1116 SV *tuple = decode_ber ();
1117
1118 EXTEND (SP, 2);
1119 PUSHs (sv_2mortal (tuple));
1120
1121 if (ix)
1122 PUSHs (sv_2mortal (newSViv (cur - buf)));
1123 else if (cur != end)
1124 error ("trailing garbage after BER value");
1038} 1125}
1039 OUTPUT: RETVAL
1040 1126
1041void 1127void
1042ber_is (SV *tuple, SV *klass = &PL_sv_undef, SV *tag = &PL_sv_undef, SV *constructed = &PL_sv_undef, SV *data = &PL_sv_undef) 1128ber_is (SV *tuple, SV *klass = &PL_sv_undef, SV *tag = &PL_sv_undef, SV *flags = &PL_sv_undef, SV *data = &PL_sv_undef)
1043 PPCODE: 1129 PPCODE:
1044{ 1130{
1045 if (!SvOK (tuple)) 1131 if (!SvOK (tuple))
1046 XSRETURN_NO; 1132 XSRETURN_NO;
1047 1133
1049 croak ("ber_is: tuple must be BER tuple (array-ref)"); 1135 croak ("ber_is: tuple must be BER tuple (array-ref)");
1050 1136
1051 AV *av = (AV *)SvRV (tuple); 1137 AV *av = (AV *)SvRV (tuple);
1052 1138
1053 XPUSHs ( 1139 XPUSHs (
1054 (!SvOK (klass) || SvIV (AvARRAY (av)[BER_CLASS ]) == SvIV (klass)) 1140 (!SvOK (klass) || SvIV (AvARRAY (av)[BER_CLASS]) == SvIV (klass))
1055 && (!SvOK (tag) || SvIV (AvARRAY (av)[BER_TAG ]) == SvIV (tag)) 1141 && (!SvOK (tag) || SvIV (AvARRAY (av)[BER_TAG ]) == SvIV (tag))
1056 && (!SvOK (constructed) || !SvIV (AvARRAY (av)[BER_CONSTRUCTED]) == !SvIV (constructed)) 1142 && (!SvOK (flags) || !SvIV (AvARRAY (av)[BER_FLAGS]) == !SvIV (flags))
1057 && (!SvOK (data) || sv_eq (AvARRAY (av)[BER_DATA ], data)) 1143 && (!SvOK (data) || sv_eq (AvARRAY (av)[BER_DATA ], data))
1058 ? &PL_sv_yes : &PL_sv_undef); 1144 ? &PL_sv_yes : &PL_sv_undef);
1059} 1145}
1060 1146
1061void 1147void
1062ber_is_seq (SV *tuple) 1148ber_is_seq (SV *tuple)
1066 XSRETURN_UNDEF; 1152 XSRETURN_UNDEF;
1067 1153
1068 AV *av = ber_tuple (tuple); 1154 AV *av = ber_tuple (tuple);
1069 1155
1070 XPUSHs ( 1156 XPUSHs (
1071 SvIV (AvARRAY (av)[BER_CLASS ]) == ASN_UNIVERSAL 1157 SvIV (AvARRAY (av)[BER_CLASS]) == ASN_UNIVERSAL
1072 && SvIV (AvARRAY (av)[BER_TAG ]) == ASN_SEQUENCE 1158 && SvIV (AvARRAY (av)[BER_TAG ]) == ASN_SEQUENCE
1073 && SvIV (AvARRAY (av)[BER_CONSTRUCTED]) 1159 && SvIV (AvARRAY (av)[BER_FLAGS])
1074 ? AvARRAY (av)[BER_DATA] : &PL_sv_undef); 1160 ? AvARRAY (av)[BER_DATA] : &PL_sv_undef);
1075} 1161}
1076 1162
1077void 1163void
1078ber_is_i32 (SV *tuple, SV *value = &PL_sv_undef) 1164ber_is_int (SV *tuple, SV *value = &PL_sv_undef)
1079 PPCODE: 1165 PPCODE:
1080{ 1166{
1081 if (!SvOK (tuple)) 1167 if (!SvOK (tuple))
1082 XSRETURN_NO; 1168 XSRETURN_NO;
1083 1169
1084 AV *av = ber_tuple (tuple); 1170 AV *av = ber_tuple (tuple);
1085 1171
1086 IV data = SvIV (AvARRAY (av)[BER_DATA]); 1172 UV data = SvUV (AvARRAY (av)[BER_DATA]);
1087 1173
1088 XPUSHs ( 1174 XPUSHs (
1089 SvIV (AvARRAY (av)[BER_CLASS ]) == ASN_UNIVERSAL 1175 SvIV (AvARRAY (av)[BER_CLASS]) == ASN_UNIVERSAL
1090 && SvIV (AvARRAY (av)[BER_TAG ]) == ASN_INTEGER32 1176 && SvIV (AvARRAY (av)[BER_TAG ]) == ASN_INTEGER
1091 && !SvIV (AvARRAY (av)[BER_CONSTRUCTED]) 1177 && !SvIV (AvARRAY (av)[BER_FLAGS])
1092 && (!SvOK (value) || data == SvIV (value)) 1178 && (!SvOK (value) || data == SvUV (value))
1093 ? sv_2mortal (data ? newSViv (data) : newSVpv ("0 but true", 0)) 1179 ? sv_2mortal (data ? newSVsv (AvARRAY (av)[BER_DATA]) : newSVpv ("0 but true", 0))
1094 : &PL_sv_undef); 1180 : &PL_sv_undef);
1095} 1181}
1096 1182
1097void 1183void
1098ber_is_oid (SV *tuple, SV *oid = &PL_sv_undef) 1184ber_is_oid (SV *tuple, SV *oid = &PL_sv_undef)
1102 XSRETURN_NO; 1188 XSRETURN_NO;
1103 1189
1104 AV *av = ber_tuple (tuple); 1190 AV *av = ber_tuple (tuple);
1105 1191
1106 XPUSHs ( 1192 XPUSHs (
1107 SvIV (AvARRAY (av)[BER_CLASS ]) == ASN_UNIVERSAL 1193 SvIV (AvARRAY (av)[BER_CLASS]) == ASN_UNIVERSAL
1108 && SvIV (AvARRAY (av)[BER_TAG ]) == ASN_OBJECT_IDENTIFIER 1194 && SvIV (AvARRAY (av)[BER_TAG ]) == ASN_OBJECT_IDENTIFIER
1109 && !SvIV (AvARRAY (av)[BER_CONSTRUCTED]) 1195 && !SvIV (AvARRAY (av)[BER_FLAGS])
1110 && (!SvOK (oid) || sv_eq (AvARRAY (av)[BER_DATA], oid)) 1196 && (!SvOK (oid) || sv_eq (AvARRAY (av)[BER_DATA], oid))
1111 ? newSVsv (AvARRAY (av)[BER_DATA]) : &PL_sv_undef); 1197 ? newSVsv (AvARRAY (av)[BER_DATA]) : &PL_sv_undef);
1112} 1198}
1113 1199
1114############################################################################# 1200#############################################################################
1127 SvCUR_set (buf_sv, cur - buf); 1213 SvCUR_set (buf_sv, cur - buf);
1128 XPUSHs (buf_sv); 1214 XPUSHs (buf_sv);
1129} 1215}
1130 1216
1131SV * 1217SV *
1132ber_i32 (IV iv) 1218ber_int (SV *sv)
1133 CODE: 1219 CODE:
1134{ 1220{
1135 AV *av = newAV (); 1221 AV *av = newAV ();
1136 av_fill (av, BER_ARRAYSIZE - 1); 1222 av_fill (av, BER_ARRAYSIZE - 1);
1137 AvARRAY (av)[BER_CLASS ] = newSVcacheint (ASN_UNIVERSAL); 1223 AvARRAY (av)[BER_CLASS] = newSVcacheint (ASN_UNIVERSAL);
1138 AvARRAY (av)[BER_TAG ] = newSVcacheint (ASN_INTEGER32); 1224 AvARRAY (av)[BER_TAG ] = newSVcacheint (ASN_INTEGER);
1139 AvARRAY (av)[BER_CONSTRUCTED] = newSVcacheint (0); 1225 AvARRAY (av)[BER_FLAGS] = newSVcacheint (0);
1140 AvARRAY (av)[BER_DATA ] = newSViv (iv); 1226 AvARRAY (av)[BER_DATA ] = newSVsv (sv);
1141 RETVAL = newRV_noinc ((SV *)av); 1227 RETVAL = newRV_noinc ((SV *)av);
1142} 1228}
1143 OUTPUT: RETVAL 1229 OUTPUT: RETVAL
1144 1230
1145# TODO: not arrayref, but elements? 1231# TODO: not arrayref, but elements?
1147ber_seq (SV *arrayref) 1233ber_seq (SV *arrayref)
1148 CODE: 1234 CODE:
1149{ 1235{
1150 AV *av = newAV (); 1236 AV *av = newAV ();
1151 av_fill (av, BER_ARRAYSIZE - 1); 1237 av_fill (av, BER_ARRAYSIZE - 1);
1152 AvARRAY (av)[BER_CLASS ] = newSVcacheint (ASN_UNIVERSAL); 1238 AvARRAY (av)[BER_CLASS] = newSVcacheint (ASN_UNIVERSAL);
1153 AvARRAY (av)[BER_TAG ] = newSVcacheint (ASN_SEQUENCE); 1239 AvARRAY (av)[BER_TAG ] = newSVcacheint (ASN_SEQUENCE);
1154 AvARRAY (av)[BER_CONSTRUCTED] = newSVcacheint (1); 1240 AvARRAY (av)[BER_FLAGS] = newSVcacheint (1);
1155 AvARRAY (av)[BER_DATA ] = newSVsv (arrayref); 1241 AvARRAY (av)[BER_DATA ] = newSVsv (arrayref);
1156 RETVAL = newRV_noinc ((SV *)av); 1242 RETVAL = newRV_noinc ((SV *)av);
1157} 1243}
1158 OUTPUT: RETVAL 1244 OUTPUT: RETVAL
1159 1245
1160MODULE = Convert::BER::XS PACKAGE = Convert::BER::XS::Profile 1246MODULE = Convert::BER::XS PACKAGE = Convert::BER::XS::Profile

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines