1 |
#include "EXTERN.h" |
2 |
#include "perl.h" |
3 |
#include "XSUB.h" |
4 |
|
5 |
// C99 required! |
6 |
// this is not just for comments, but also for |
7 |
// integer constant semantics, |
8 |
// sscanf format modifiers and more. |
9 |
|
10 |
enum { |
11 |
// ASN_TAG |
12 |
ASN_BOOLEAN = 0x01, |
13 |
ASN_INTEGER = 0x02, |
14 |
ASN_BIT_STRING = 0x03, |
15 |
ASN_OCTET_STRING = 0x04, |
16 |
ASN_NULL = 0x05, |
17 |
ASN_OBJECT_IDENTIFIER = 0x06, |
18 |
ASN_OID = 0x06, |
19 |
ASN_OBJECT_DESCRIPTOR = 0x07, |
20 |
ASN_EXTERNAL = 0x08, |
21 |
ASN_REAL = 0x09, |
22 |
ASN_ENUMERATED = 0x0a, |
23 |
ASN_EMBEDDED_PDV = 0x0b, |
24 |
ASN_UTF8_STRING = 0x0c, |
25 |
ASN_RELATIVE_OID = 0x0d, |
26 |
ASN_SEQUENCE = 0x10, |
27 |
ASN_SET = 0x11, |
28 |
ASN_NUMERIC_STRING = 0x12, |
29 |
ASN_PRINTABLE_STRING = 0x13, |
30 |
ASN_TELETEX_STRING = 0x14, |
31 |
ASN_T61_STRING = 0x14, |
32 |
ASN_VIDEOTEX_STRING = 0x15, |
33 |
ASN_IA5_STRING = 0x16, |
34 |
ASN_ASCII_STRING = 0x16, |
35 |
ASN_UTC_TIME = 0x17, |
36 |
ASN_GENERALIZED_TIME = 0x18, |
37 |
ASN_GRAPHIC_STRING = 0x19, |
38 |
ASN_VISIBLE_STRING = 0x1a, |
39 |
ASN_ISO646_STRING = 0x1a, |
40 |
ASN_GENERAL_STRING = 0x1b, |
41 |
ASN_UNIVERSAL_STRING = 0x1c, |
42 |
ASN_CHARACTER_STRING = 0x1d, |
43 |
ASN_BMP_STRING = 0x1e, |
44 |
|
45 |
ASN_TAG_BER = 0x1f, |
46 |
ASN_TAG_MASK = 0x1f, |
47 |
|
48 |
// primitive/constructed |
49 |
ASN_CONSTRUCTED = 0x20, |
50 |
|
51 |
// ASN_CLASS |
52 |
ASN_UNIVERSAL = 0x00, |
53 |
ASN_APPLICATION = 0x01, |
54 |
ASN_CONTEXT = 0x02, |
55 |
ASN_PRIVATE = 0x03, |
56 |
|
57 |
ASN_CLASS_MASK = 0xc0, |
58 |
ASN_CLASS_SHIFT = 6, |
59 |
|
60 |
// ASN_APPLICATION SNMP |
61 |
SNMP_IPADDRESS = 0x00, |
62 |
SNMP_COUNTER32 = 0x01, |
63 |
SNMP_GAUGE32 = 0x02, |
64 |
SNMP_UNSIGNED32 = 0x02, |
65 |
SNMP_TIMETICKS = 0x03, |
66 |
SNMP_OPAQUE = 0x04, |
67 |
SNMP_COUNTER64 = 0x06, |
68 |
}; |
69 |
|
70 |
enum { |
71 |
BER_TYPE_BYTES, |
72 |
BER_TYPE_UTF8, |
73 |
BER_TYPE_UCS2, |
74 |
BER_TYPE_UCS4, |
75 |
BER_TYPE_INT, |
76 |
BER_TYPE_OID, |
77 |
BER_TYPE_RELOID, |
78 |
BER_TYPE_NULL, |
79 |
BER_TYPE_BOOL, |
80 |
BER_TYPE_REAL, |
81 |
BER_TYPE_IPADDRESS, |
82 |
BER_TYPE_CROAK, |
83 |
}; |
84 |
|
85 |
enum { |
86 |
BER_CLASS = 0, |
87 |
BER_TAG = 1, |
88 |
BER_FLAGS = 2, |
89 |
BER_DATA = 3, |
90 |
BER_ARRAYSIZE |
91 |
}; |
92 |
|
93 |
#define MAX_OID_STRLEN 4096 |
94 |
|
95 |
typedef void profile_type; |
96 |
|
97 |
static profile_type *cur_profile, *default_profile; |
98 |
static SV *buf_sv; // encoding buffer |
99 |
static U8 *buf, *cur, *end; // buffer start, current, end |
100 |
|
101 |
#if PERL_VERSION < 18 |
102 |
# define utf8_to_uvchr_buf(s,e,l) utf8_to_uvchr (s, l) |
103 |
#endif |
104 |
|
105 |
#if __GNUC__ >= 3 |
106 |
# define expect(expr,value) __builtin_expect ((expr), (value)) |
107 |
# define INLINE static inline |
108 |
#else |
109 |
# define expect(expr,value) (expr) |
110 |
# define INLINE static |
111 |
#endif |
112 |
|
113 |
#define expect_false(expr) expect ((expr) != 0, 0) |
114 |
#define expect_true(expr) expect ((expr) != 0, 1) |
115 |
|
116 |
///////////////////////////////////////////////////////////////////////////// |
117 |
|
118 |
static SV *sviv_cache[32]; |
119 |
|
120 |
// for "small" integers, return a readonly sv, otherwise create a new one |
121 |
static SV *newSVcacheint (int val) |
122 |
{ |
123 |
if (expect_false (val < 0 || val >= sizeof (sviv_cache))) |
124 |
return newSViv (val); |
125 |
|
126 |
if (expect_false (!sviv_cache [val])) |
127 |
{ |
128 |
sviv_cache [val] = newSVuv (val); |
129 |
SvREADONLY_on (sviv_cache [val]); |
130 |
} |
131 |
|
132 |
return SvREFCNT_inc_NN (sviv_cache [val]); |
133 |
} |
134 |
|
135 |
///////////////////////////////////////////////////////////////////////////// |
136 |
|
137 |
static HV *profile_stash; |
138 |
|
139 |
static profile_type * |
140 |
SvPROFILE (SV *profile) |
141 |
{ |
142 |
if (!SvOK (profile)) |
143 |
return default_profile; |
144 |
|
145 |
if (!SvROK (profile)) |
146 |
croak ("invalid profile"); |
147 |
|
148 |
profile = SvRV (profile); |
149 |
|
150 |
if (SvSTASH (profile) != profile_stash) |
151 |
croak ("invalid profile object"); |
152 |
|
153 |
return (void *)profile; |
154 |
} |
155 |
|
156 |
static int |
157 |
profile_lookup (profile_type *profile, int klass, int tag) |
158 |
{ |
159 |
SV *sv = (SV *)profile; |
160 |
U32 idx = (tag << 2) + klass; |
161 |
|
162 |
if (expect_false (idx >= SvCUR (sv))) |
163 |
return BER_TYPE_BYTES; |
164 |
|
165 |
return SvPVX (sv)[idx]; |
166 |
} |
167 |
|
168 |
static void |
169 |
profile_set (profile_type *profile, int klass, int tag, int type) |
170 |
{ |
171 |
SV *sv = (SV *)profile; |
172 |
U32 idx = (tag << 2) + klass; |
173 |
STRLEN oldlen = SvCUR (sv); |
174 |
STRLEN newlen = idx + 2; |
175 |
|
176 |
if (idx >= oldlen) |
177 |
{ |
178 |
sv_grow (sv, newlen); |
179 |
memset (SvPVX (sv) + oldlen, BER_TYPE_BYTES, newlen - oldlen); |
180 |
SvCUR_set (sv, newlen); |
181 |
} |
182 |
|
183 |
SvPVX (sv)[idx] = type; |
184 |
} |
185 |
|
186 |
static SV * |
187 |
profile_new (void) |
188 |
{ |
189 |
SV *sv = newSVpvn ("", 0); |
190 |
|
191 |
static const struct { |
192 |
int klass; |
193 |
int tag; |
194 |
int type; |
195 |
} *celem, default_map[] = { |
196 |
{ ASN_UNIVERSAL, ASN_BOOLEAN , BER_TYPE_BOOL }, |
197 |
{ ASN_UNIVERSAL, ASN_INTEGER , BER_TYPE_INT }, |
198 |
{ ASN_UNIVERSAL, ASN_NULL , BER_TYPE_NULL }, |
199 |
{ ASN_UNIVERSAL, ASN_OBJECT_IDENTIFIER, BER_TYPE_OID }, |
200 |
{ ASN_UNIVERSAL, ASN_RELATIVE_OID , BER_TYPE_RELOID }, |
201 |
{ ASN_UNIVERSAL, ASN_REAL , BER_TYPE_REAL }, |
202 |
{ ASN_UNIVERSAL, ASN_ENUMERATED , BER_TYPE_INT }, |
203 |
{ ASN_UNIVERSAL, ASN_UTF8_STRING , BER_TYPE_UTF8 }, |
204 |
{ ASN_UNIVERSAL, ASN_BMP_STRING , BER_TYPE_UCS2 }, |
205 |
{ ASN_UNIVERSAL, ASN_UNIVERSAL_STRING , BER_TYPE_UCS4 }, |
206 |
}; |
207 |
|
208 |
for (celem = default_map + sizeof (default_map) / sizeof (default_map [0]); celem-- > default_map; ) |
209 |
profile_set ((profile_type *)sv, celem->klass, celem->tag, celem->type); |
210 |
|
211 |
return sv_bless (newRV_noinc (sv), profile_stash); |
212 |
} |
213 |
|
214 |
///////////////////////////////////////////////////////////////////////////// |
215 |
// decoder |
216 |
|
217 |
static void |
218 |
error (const char *errmsg) |
219 |
{ |
220 |
croak ("%s at offset 0x%04x", errmsg, cur - buf); |
221 |
} |
222 |
|
223 |
static void |
224 |
want (UV count) |
225 |
{ |
226 |
if (expect_false ((uintptr_t)(end - cur) < count)) |
227 |
error ("unexpected end of message buffer"); |
228 |
} |
229 |
|
230 |
// get_* functions fetch something from the buffer |
231 |
// decode_* functions use get_* fun ctions to decode ber values |
232 |
|
233 |
// get n octets |
234 |
static U8 * |
235 |
get_n (UV count) |
236 |
{ |
237 |
want (count); |
238 |
U8 *res = cur; |
239 |
cur += count; |
240 |
return res; |
241 |
} |
242 |
|
243 |
// get single octet |
244 |
static U8 |
245 |
get_u8 (void) |
246 |
{ |
247 |
if (cur == end) |
248 |
error ("unexpected end of message buffer"); |
249 |
|
250 |
return *cur++; |
251 |
} |
252 |
|
253 |
// get ber-encoded integer (i.e. pack "w") |
254 |
static UV |
255 |
get_w (void) |
256 |
{ |
257 |
UV res = 0; |
258 |
U8 c = get_u8 (); |
259 |
|
260 |
if (expect_false (c == 0x80)) |
261 |
error ("illegal BER padding (X.690 8.1.2.4.2, 8.19.2)"); |
262 |
|
263 |
for (;;) |
264 |
{ |
265 |
if (expect_false (res >> UVSIZE * 8 - 7)) |
266 |
error ("BER variable integer overflow"); |
267 |
|
268 |
res = (res << 7) | (c & 0x7f); |
269 |
|
270 |
if (!(c & 0x80)) |
271 |
return res; |
272 |
|
273 |
c = get_u8 (); |
274 |
} |
275 |
} |
276 |
|
277 |
static UV |
278 |
get_length (void) |
279 |
{ |
280 |
UV res = get_u8 (); |
281 |
|
282 |
if (res & 0x80) |
283 |
{ |
284 |
int cnt = res & 0x7f; |
285 |
res = 0; |
286 |
|
287 |
switch (cnt) |
288 |
{ |
289 |
case 0: |
290 |
error ("indefinite ASN.1 lengths not supported"); |
291 |
|
292 |
case 0x7f: |
293 |
error ("ASN.1 reserved value in length (X.690 8.1.3.5)"); |
294 |
|
295 |
default: |
296 |
error ("ASN.1 length too long (only up to 2**64 octets supported)"); |
297 |
|
298 |
case 8: res = (res << 8) | get_u8 (); |
299 |
case 7: res = (res << 8) | get_u8 (); |
300 |
case 6: res = (res << 8) | get_u8 (); |
301 |
case 5: res = (res << 8) | get_u8 (); |
302 |
case 4: res = (res << 8) | get_u8 (); |
303 |
case 3: res = (res << 8) | get_u8 (); |
304 |
case 2: res = (res << 8) | get_u8 (); |
305 |
case 1: res = (res << 8) | get_u8 (); |
306 |
} |
307 |
} |
308 |
|
309 |
return res; |
310 |
} |
311 |
|
312 |
static SV * |
313 |
decode_int (void) |
314 |
{ |
315 |
UV len = get_length (); |
316 |
|
317 |
if (!len) |
318 |
error ("invalid integer length equal to zero (X.690 8.3.1)"); |
319 |
|
320 |
U8 *data = get_n (len); |
321 |
|
322 |
if (expect_false (len > 1)) |
323 |
{ |
324 |
U16 mask = (data [0] << 8) | data [1] & 0xff80; |
325 |
|
326 |
if (expect_false (mask == 0xff80 || mask == 0x0000)) |
327 |
error ("illegal padding in integer (X.690 8.3.2)"); |
328 |
} |
329 |
|
330 |
int negative = data [0] & 0x80; |
331 |
|
332 |
UV val = negative ? -1 : 0; // copy signbit to all bits |
333 |
|
334 |
if (len > UVSIZE + (!negative && !*data)) |
335 |
//printf ("len %d > %d + (!%d && !%d) = %d\n", len, UVSIZE, negative, *data, UVSIZE + (!negative && !*data));//D |
336 |
error ("INTEGER overflow"); |
337 |
|
338 |
do |
339 |
val = (val << 8) | *data++; |
340 |
while (--len); |
341 |
|
342 |
// the cast to IV relies on implementation-defined behaviour (two's complement cast) |
343 |
// but that's ok, as perl relies on it as well. |
344 |
return negative ? newSViv ((IV)val) : newSVuv (val); |
345 |
} |
346 |
|
347 |
static SV * |
348 |
decode_data (void) |
349 |
{ |
350 |
UV len = get_length (); |
351 |
return newSVpvn ((char *)get_n (len), len); |
352 |
} |
353 |
|
354 |
// helper for decode_object_identifier |
355 |
static char * |
356 |
write_uv (char *buf, UV u) |
357 |
{ |
358 |
// the one-digit case is absolutely predominant, so this pays off (hopefully) |
359 |
if (expect_true (u < 10)) |
360 |
*buf++ = u + '0'; |
361 |
else |
362 |
{ |
363 |
// this *could* be done much faster using branchless fixed-point arithmetics |
364 |
char *beg = buf; |
365 |
|
366 |
do |
367 |
{ |
368 |
*buf++ = u % 10 + '0'; |
369 |
u /= 10; |
370 |
} |
371 |
while (u); |
372 |
|
373 |
// reverse digits |
374 |
char *ptr = buf; |
375 |
while (--ptr > beg) |
376 |
{ |
377 |
char c = *ptr; |
378 |
*ptr = *beg; |
379 |
*beg = c; |
380 |
++beg; |
381 |
} |
382 |
} |
383 |
|
384 |
return buf; |
385 |
} |
386 |
|
387 |
static SV * |
388 |
decode_oid (int relative) |
389 |
{ |
390 |
UV len = get_length (); |
391 |
|
392 |
if (len <= 0) |
393 |
{ |
394 |
error ("OBJECT IDENTIFIER length equal to zero"); |
395 |
return &PL_sv_undef; |
396 |
} |
397 |
|
398 |
U8 *end = cur + len; |
399 |
UV w = get_w (); |
400 |
|
401 |
static char oid[MAX_OID_STRLEN]; // static, because too large for stack |
402 |
char *app = oid; |
403 |
|
404 |
if (relative) |
405 |
app = write_uv (app, w); |
406 |
else if (w < 2 * 40) |
407 |
{ |
408 |
app = write_uv (app, (U8)w / 40); |
409 |
*app++ = '.'; |
410 |
app = write_uv (app, (U8)w % 40); |
411 |
} |
412 |
else |
413 |
{ |
414 |
app = write_uv (app, 2); |
415 |
*app++ = '.'; |
416 |
app = write_uv (app, w - 2 * 40); |
417 |
} |
418 |
|
419 |
while (cur < end) |
420 |
{ |
421 |
// we assume an oid component is never > 64 digits |
422 |
if (oid + sizeof (oid) - app < 64) |
423 |
croak ("BER_TYPE_OID to long to decode"); |
424 |
|
425 |
w = get_w (); |
426 |
*app++ = '.'; |
427 |
app = write_uv (app, w); |
428 |
} |
429 |
|
430 |
return newSVpvn (oid, app - oid); |
431 |
} |
432 |
|
433 |
// TODO: this is unacceptably slow |
434 |
static SV * |
435 |
decode_ucs (int chrsize) |
436 |
{ |
437 |
SV *res = NEWSV (0, 0); |
438 |
|
439 |
UV len = get_length (); |
440 |
|
441 |
if (len & (chrsize - 1)) |
442 |
croak ("BER_TYPE_UCS has an invalid number of octets (%d)", len); |
443 |
|
444 |
while (len) |
445 |
{ |
446 |
U8 b1 = get_u8 (); |
447 |
U8 b2 = get_u8 (); |
448 |
U32 chr = (b1 << 8) | b2; |
449 |
|
450 |
if (chrsize == 4) |
451 |
{ |
452 |
U8 b3 = get_u8 (); |
453 |
U8 b4 = get_u8 (); |
454 |
chr = (chr << 16) | (b3 << 8) | b4; |
455 |
} |
456 |
|
457 |
U8 uchr [UTF8_MAXBYTES]; |
458 |
int uclen = uvuni_to_utf8 (uchr, chr) - uchr; |
459 |
|
460 |
sv_catpvn (res, (const char *)uchr, uclen); |
461 |
len -= chrsize; |
462 |
} |
463 |
|
464 |
SvUTF8_on (res); |
465 |
|
466 |
return res; |
467 |
} |
468 |
|
469 |
static SV * |
470 |
decode_ber (void) |
471 |
{ |
472 |
int identifier = get_u8 (); |
473 |
|
474 |
SV *res; |
475 |
|
476 |
int constructed = identifier & ASN_CONSTRUCTED; |
477 |
int klass = (identifier & ASN_CLASS_MASK) >> ASN_CLASS_SHIFT; |
478 |
int tag = identifier & ASN_TAG_MASK; |
479 |
|
480 |
if (tag == ASN_TAG_BER) |
481 |
tag = get_w (); |
482 |
|
483 |
if (constructed) |
484 |
{ |
485 |
UV len = get_length (); |
486 |
UV seqend = (cur - buf) + len; |
487 |
AV *av = (AV *)sv_2mortal ((SV *)newAV ()); |
488 |
|
489 |
while (cur < buf + seqend) |
490 |
av_push (av, decode_ber ()); |
491 |
|
492 |
if (cur > buf + seqend) |
493 |
croak ("constructed type %02x length overflow (0x%x 0x%x)\n", identifier, (int)(cur - buf), (int)seqend); |
494 |
|
495 |
res = newRV_inc ((SV *)av); |
496 |
} |
497 |
else |
498 |
switch (profile_lookup (cur_profile, klass, tag)) |
499 |
{ |
500 |
case BER_TYPE_NULL: |
501 |
{ |
502 |
UV len = get_length (); |
503 |
|
504 |
if (len) |
505 |
croak ("BER_TYPE_NULL value with non-zero length %d encountered (X.690 8.8.2)", len); |
506 |
|
507 |
res = &PL_sv_undef; |
508 |
} |
509 |
break; |
510 |
|
511 |
case BER_TYPE_BOOL: |
512 |
{ |
513 |
UV len = get_length (); |
514 |
|
515 |
if (len != 1) |
516 |
croak ("BER_TYPE_BOOLEAN value with invalid length %d encountered (X.690 8.2.1)", len); |
517 |
|
518 |
res = newSVcacheint (!!get_u8 ()); |
519 |
} |
520 |
break; |
521 |
|
522 |
case BER_TYPE_OID: |
523 |
res = decode_oid (0); |
524 |
break; |
525 |
|
526 |
case BER_TYPE_RELOID: |
527 |
res = decode_oid (1); |
528 |
break; |
529 |
|
530 |
case BER_TYPE_INT: |
531 |
res = decode_int (); |
532 |
break; |
533 |
|
534 |
case BER_TYPE_UTF8: |
535 |
res = decode_data (); |
536 |
SvUTF8_on (res); |
537 |
break; |
538 |
|
539 |
case BER_TYPE_BYTES: |
540 |
res = decode_data (); |
541 |
break; |
542 |
|
543 |
case BER_TYPE_IPADDRESS: |
544 |
{ |
545 |
UV len = get_length (); |
546 |
|
547 |
if (len != 4) |
548 |
croak ("BER_TYPE_IPADDRESS type with invalid length %d encountered (RFC 2578 7.1.5)", len); |
549 |
|
550 |
U8 c1 = get_u8 (); |
551 |
U8 c2 = get_u8 (); |
552 |
U8 c3 = get_u8 (); |
553 |
U8 c4 = get_u8 (); |
554 |
|
555 |
res = newSVpvf ("%d.%d.%d.%d", c1, c2, c3, c4); |
556 |
} |
557 |
break; |
558 |
|
559 |
case BER_TYPE_UCS2: |
560 |
res = decode_ucs (2); |
561 |
break; |
562 |
|
563 |
case BER_TYPE_UCS4: |
564 |
res = decode_ucs (4); |
565 |
break; |
566 |
|
567 |
case BER_TYPE_REAL: |
568 |
case BER_TYPE_CROAK: |
569 |
default: |
570 |
croak ("unconfigured/unsupported class/tag %d/%d", klass, tag); |
571 |
} |
572 |
|
573 |
AV *av = newAV (); |
574 |
av_fill (av, BER_ARRAYSIZE - 1); |
575 |
AvARRAY (av)[BER_CLASS] = newSVcacheint (klass); |
576 |
AvARRAY (av)[BER_TAG ] = newSVcacheint (tag); |
577 |
AvARRAY (av)[BER_FLAGS] = newSVcacheint (constructed ? 1 : 0); |
578 |
AvARRAY (av)[BER_DATA ] = res; |
579 |
|
580 |
return newRV_noinc ((SV *)av); |
581 |
} |
582 |
|
583 |
///////////////////////////////////////////////////////////////////////////// |
584 |
// encoder |
585 |
|
586 |
/* adds two STRLENs together, slow, and with paranoia */ |
587 |
static STRLEN |
588 |
strlen_sum (STRLEN l1, STRLEN l2) |
589 |
{ |
590 |
size_t sum = l1 + l2; |
591 |
|
592 |
if (sum < (size_t)l2 || sum != (size_t)(STRLEN)sum) |
593 |
croak ("Convert::BER::XS: string size overflow"); |
594 |
|
595 |
return sum; |
596 |
} |
597 |
|
598 |
static void |
599 |
set_buf (SV *sv) |
600 |
{ |
601 |
STRLEN len; |
602 |
buf_sv = sv; |
603 |
buf = (U8 *)SvPVbyte (buf_sv, len); |
604 |
cur = buf; |
605 |
end = buf + len; |
606 |
} |
607 |
|
608 |
/* similar to SvGROW, but somewhat safer and guarantees exponential realloc strategy */ |
609 |
static char * |
610 |
my_sv_grow (SV *sv, size_t len1, size_t len2) |
611 |
{ |
612 |
len1 = strlen_sum (len1, len2); |
613 |
len1 = strlen_sum (len1, len1 >> 1); |
614 |
|
615 |
if (len1 > 4096 - 24) |
616 |
len1 = (len1 | 4095) - 24; |
617 |
|
618 |
return SvGROW (sv, len1); |
619 |
} |
620 |
|
621 |
static void |
622 |
need (STRLEN len) |
623 |
{ |
624 |
if (expect_false ((uintptr_t)(end - cur) < len)) |
625 |
{ |
626 |
STRLEN pos = cur - buf; |
627 |
buf = (U8 *)my_sv_grow (buf_sv, pos, len); |
628 |
cur = buf + pos; |
629 |
end = buf + SvLEN (buf_sv) - 1; |
630 |
} |
631 |
} |
632 |
|
633 |
static void |
634 |
put_u8 (int val) |
635 |
{ |
636 |
need (1); |
637 |
*cur++ = val; |
638 |
} |
639 |
|
640 |
static void |
641 |
put_w_nocheck (UV val) |
642 |
{ |
643 |
#if UVSIZE > 4 |
644 |
*cur = (val >> 7 * 9) | 0x80; cur += val >= ((UV)1 << (7 * 9)); |
645 |
*cur = (val >> 7 * 8) | 0x80; cur += val >= ((UV)1 << (7 * 8)); |
646 |
*cur = (val >> 7 * 7) | 0x80; cur += val >= ((UV)1 << (7 * 7)); |
647 |
*cur = (val >> 7 * 6) | 0x80; cur += val >= ((UV)1 << (7 * 6)); |
648 |
*cur = (val >> 7 * 5) | 0x80; cur += val >= ((UV)1 << (7 * 5)); |
649 |
#endif |
650 |
*cur = (val >> 7 * 4) | 0x80; cur += val >= ((UV)1 << (7 * 4)); |
651 |
*cur = (val >> 7 * 3) | 0x80; cur += val >= ((UV)1 << (7 * 3)); |
652 |
*cur = (val >> 7 * 2) | 0x80; cur += val >= ((UV)1 << (7 * 2)); |
653 |
*cur = (val >> 7 * 1) | 0x80; cur += val >= ((UV)1 << (7 * 1)); |
654 |
*cur = val & 0x7f; cur += 1; |
655 |
} |
656 |
|
657 |
static void |
658 |
put_w (UV val) |
659 |
{ |
660 |
need (5); // we only handle up to 5 bytes |
661 |
|
662 |
put_w_nocheck (val); |
663 |
} |
664 |
|
665 |
static U8 * |
666 |
put_length_at (UV val, U8 *cur) |
667 |
{ |
668 |
if (val < 0x7fU) |
669 |
*cur++ = val; |
670 |
else |
671 |
{ |
672 |
U8 *lenb = cur++; |
673 |
|
674 |
#if UVSIZE > 4 |
675 |
*cur = val >> 56; cur += *cur > 0; |
676 |
*cur = val >> 48; cur += *cur > 0; |
677 |
*cur = val >> 40; cur += *cur > 0; |
678 |
*cur = val >> 32; cur += *cur > 0; |
679 |
#endif |
680 |
*cur = val >> 24; cur += *cur > 0; |
681 |
*cur = val >> 16; cur += *cur > 0; |
682 |
*cur = val >> 8; cur += *cur > 0; |
683 |
*cur = val ; cur += 1; |
684 |
|
685 |
*lenb = 0x80 + cur - lenb - 1; |
686 |
} |
687 |
|
688 |
return cur; |
689 |
} |
690 |
|
691 |
static void |
692 |
put_length (UV val) |
693 |
{ |
694 |
need (5 + val); |
695 |
cur = put_length_at (val, cur); |
696 |
} |
697 |
|
698 |
// return how many bytes the encoded length requires |
699 |
static int length_length (UV val) |
700 |
{ |
701 |
return val < 0x7fU |
702 |
? 1 |
703 |
: 2 |
704 |
+ (val > 0xffU) |
705 |
+ (val > 0xffffU) |
706 |
+ (val > 0xffffffU) |
707 |
#if UVSIZE > 4 |
708 |
+ (val > 0xffffffffU) |
709 |
+ (val > 0xffffffffffU) |
710 |
+ (val > 0xffffffffffffU) |
711 |
+ (val > 0xffffffffffffffU) |
712 |
#endif |
713 |
; |
714 |
} |
715 |
|
716 |
static void |
717 |
encode_data (const char *ptr, STRLEN len) |
718 |
{ |
719 |
put_length (len); |
720 |
memcpy (cur, ptr, len); |
721 |
cur += len; |
722 |
} |
723 |
|
724 |
static void |
725 |
encode_uv (UV uv) |
726 |
{ |
727 |
} |
728 |
|
729 |
static void |
730 |
encode_int (SV *sv) |
731 |
{ |
732 |
need (8 + 1 + 1); // 64 bit + length + extra 0 |
733 |
|
734 |
if (expect_false (!SvIOK (sv))) |
735 |
sv_2iv_flags (sv, 0); |
736 |
|
737 |
U8 *lenb = cur++; |
738 |
|
739 |
if (SvIOK_notUV (sv)) |
740 |
{ |
741 |
IV iv = SvIVX (sv); |
742 |
|
743 |
if (expect_false (iv < 0)) |
744 |
{ |
745 |
// get two's complement bit pattern - works even on hypothetical non-2c machines |
746 |
UV uv = iv; |
747 |
|
748 |
#if UVSIZE > 4 |
749 |
*cur = uv >> 56; cur += !!(~uv & 0xff80000000000000U); |
750 |
*cur = uv >> 48; cur += !!(~uv & 0xffff800000000000U); |
751 |
*cur = uv >> 40; cur += !!(~uv & 0xffffff8000000000U); |
752 |
*cur = uv >> 32; cur += !!(~uv & 0xffffffff80000000U); |
753 |
#endif |
754 |
*cur = uv >> 24; cur += !!(~uv & 0xffffffffff800000U); |
755 |
*cur = uv >> 16; cur += !!(~uv & 0xffffffffffff8000U); |
756 |
*cur = uv >> 8; cur += !!(~uv & 0xffffffffffffff80U); |
757 |
*cur = uv ; cur += 1; |
758 |
|
759 |
*lenb = cur - lenb - 1; |
760 |
|
761 |
return; |
762 |
} |
763 |
} |
764 |
|
765 |
UV uv = SvUV (sv); |
766 |
|
767 |
// prepend an extra 0 if the high bit is 1 |
768 |
*cur = 0; cur += !!(uv & ((UV)1 << (UVSIZE * 8 - 1))); |
769 |
|
770 |
#if UVSIZE > 4 |
771 |
*cur = uv >> 56; cur += !!(uv & 0xff80000000000000U); |
772 |
*cur = uv >> 48; cur += !!(uv & 0xffff800000000000U); |
773 |
*cur = uv >> 40; cur += !!(uv & 0xffffff8000000000U); |
774 |
*cur = uv >> 32; cur += !!(uv & 0xffffffff80000000U); |
775 |
#endif |
776 |
*cur = uv >> 24; cur += !!(uv & 0xffffffffff800000U); |
777 |
*cur = uv >> 16; cur += !!(uv & 0xffffffffffff8000U); |
778 |
*cur = uv >> 8; cur += !!(uv & 0xffffffffffffff80U); |
779 |
*cur = uv ; cur += 1; |
780 |
|
781 |
*lenb = cur - lenb - 1; |
782 |
} |
783 |
|
784 |
// we don't know the length yet, so we optimistically |
785 |
// assume the length will need one octet later. If that |
786 |
// turns out to be wrong, we memmove as needed. |
787 |
// mark the beginning |
788 |
static STRLEN |
789 |
len_fixup_mark (void) |
790 |
{ |
791 |
return cur++ - buf; |
792 |
} |
793 |
|
794 |
// patch up the length |
795 |
static void |
796 |
len_fixup (STRLEN mark) |
797 |
{ |
798 |
STRLEN reallen = (cur - buf) - mark - 1; |
799 |
int lenlen = length_length (reallen); |
800 |
|
801 |
if (expect_false (lenlen > 1)) |
802 |
{ |
803 |
// bad luck, we have to shift the bytes to make room for the length |
804 |
need (5); |
805 |
memmove (buf + mark + lenlen, buf + mark + 1, reallen); |
806 |
cur += lenlen - 1; |
807 |
} |
808 |
|
809 |
put_length_at (reallen, buf + mark); |
810 |
} |
811 |
|
812 |
static char * |
813 |
read_uv (char *str, UV *uv) |
814 |
{ |
815 |
UV r = 0; |
816 |
|
817 |
while (*str >= '0') |
818 |
r = r * 10 + *str++ - '0'; |
819 |
|
820 |
*uv = r; |
821 |
|
822 |
str += !!*str; // advance over any non-zero byte |
823 |
|
824 |
return str; |
825 |
} |
826 |
|
827 |
static void |
828 |
encode_oid (SV *oid, int relative) |
829 |
{ |
830 |
STRLEN len; |
831 |
char *ptr = SvPV (oid, len); // utf8 vs. bytes does not matter |
832 |
|
833 |
// we need at most as many octets as the string form |
834 |
need (len + 1); |
835 |
STRLEN mark = len_fixup_mark (); |
836 |
|
837 |
UV w1, w2; |
838 |
|
839 |
if (!relative) |
840 |
{ |
841 |
ptr = read_uv (ptr, &w1); |
842 |
ptr = read_uv (ptr, &w2); |
843 |
|
844 |
put_w_nocheck (w1 * 40 + w2); |
845 |
} |
846 |
|
847 |
while (*ptr) |
848 |
{ |
849 |
ptr = read_uv (ptr, &w1); |
850 |
put_w_nocheck (w1); |
851 |
} |
852 |
|
853 |
len_fixup (mark); |
854 |
} |
855 |
|
856 |
// check whether an SV is a BER tuple and returns its AV * |
857 |
static AV * |
858 |
ber_tuple (SV *tuple) |
859 |
{ |
860 |
SV *rv; |
861 |
|
862 |
if (expect_false (!SvROK (tuple) || SvTYPE ((rv = SvRV (tuple))) != SVt_PVAV)) |
863 |
croak ("BER tuple must be array-reference"); |
864 |
|
865 |
if (expect_false (SvRMAGICAL (rv))) |
866 |
croak ("BER tuple must not be tied"); |
867 |
|
868 |
if (expect_false (AvFILL ((AV *)rv) != BER_ARRAYSIZE - 1)) |
869 |
croak ("BER tuple must contain exactly %d elements, not %d", BER_ARRAYSIZE, AvFILL ((AV *)rv) + 1); |
870 |
|
871 |
return (AV *)rv; |
872 |
} |
873 |
|
874 |
static void |
875 |
encode_ucs (SV *data, int chrsize) |
876 |
{ |
877 |
STRLEN uchars = sv_len_utf8 (data); |
878 |
STRLEN len;; |
879 |
char *ptr = SvPVutf8 (data, len); |
880 |
|
881 |
put_length (uchars * chrsize); |
882 |
|
883 |
while (uchars--) |
884 |
{ |
885 |
STRLEN uclen; |
886 |
UV uchr = utf8_to_uvchr_buf ((U8 *)ptr, (U8 *)ptr + len, &uclen); |
887 |
|
888 |
ptr += uclen; |
889 |
len -= uclen; |
890 |
|
891 |
if (chrsize == 4) |
892 |
{ |
893 |
*cur++ = uchr >> 24; |
894 |
*cur++ = uchr >> 16; |
895 |
} |
896 |
|
897 |
*cur++ = uchr >> 8; |
898 |
*cur++ = uchr; |
899 |
} |
900 |
} |
901 |
static void |
902 |
encode_ber (SV *tuple) |
903 |
{ |
904 |
AV *av = ber_tuple (tuple); |
905 |
|
906 |
int klass = SvIV (AvARRAY (av)[BER_CLASS]); |
907 |
int tag = SvIV (AvARRAY (av)[BER_TAG]); |
908 |
int constructed = SvIV (AvARRAY (av)[BER_FLAGS]) & 1 ? ASN_CONSTRUCTED : 0; |
909 |
SV *data = AvARRAY (av)[BER_DATA]; |
910 |
|
911 |
int identifier = (klass << ASN_CLASS_SHIFT) | constructed; |
912 |
|
913 |
if (expect_false (tag >= ASN_TAG_BER)) |
914 |
{ |
915 |
put_u8 (identifier | ASN_TAG_BER); |
916 |
put_w (tag); |
917 |
} |
918 |
else |
919 |
put_u8 (identifier | tag); |
920 |
|
921 |
if (constructed) |
922 |
{ |
923 |
// we optimistically assume that only one length byte is needed |
924 |
// and adjust later |
925 |
need (1); |
926 |
STRLEN mark = len_fixup_mark (); |
927 |
|
928 |
if (expect_false (!SvROK (data) || SvTYPE (SvRV (data)) != SVt_PVAV)) |
929 |
croak ("BER constructed data must be array-reference"); |
930 |
|
931 |
AV *av = (AV *)SvRV (data); |
932 |
int fill = AvFILL (av); |
933 |
|
934 |
if (expect_false (SvRMAGICAL (av))) |
935 |
croak ("BER constructed data must not be tied"); |
936 |
|
937 |
int i; |
938 |
for (i = 0; i <= fill; ++i) |
939 |
encode_ber (AvARRAY (av)[i]); |
940 |
|
941 |
len_fixup (mark); |
942 |
} |
943 |
else |
944 |
switch (profile_lookup (cur_profile, klass, tag)) |
945 |
{ |
946 |
case BER_TYPE_NULL: |
947 |
put_length (0); |
948 |
break; |
949 |
|
950 |
case BER_TYPE_BOOL: |
951 |
put_length (1); |
952 |
*cur++ = SvTRUE (data) ? 0xff : 0x00; // 0xff = DER/CER |
953 |
break; |
954 |
|
955 |
case BER_TYPE_OID: |
956 |
encode_oid (data, 0); |
957 |
break; |
958 |
|
959 |
case BER_TYPE_RELOID: |
960 |
encode_oid (data, 1); |
961 |
break; |
962 |
|
963 |
case BER_TYPE_INT: |
964 |
encode_int (data); |
965 |
break; |
966 |
|
967 |
case BER_TYPE_BYTES: |
968 |
{ |
969 |
STRLEN len; |
970 |
const char *ptr = SvPVbyte (data, len); |
971 |
encode_data (ptr, len); |
972 |
} |
973 |
break; |
974 |
|
975 |
case BER_TYPE_UTF8: |
976 |
{ |
977 |
STRLEN len; |
978 |
const char *ptr = SvPVutf8 (data, len); |
979 |
encode_data (ptr, len); |
980 |
} |
981 |
break; |
982 |
|
983 |
case BER_TYPE_IPADDRESS: |
984 |
{ |
985 |
U8 ip[4]; |
986 |
sscanf (SvPV_nolen (data), "%hhu.%hhu.%hhu.%hhu", ip + 0, ip + 1, ip + 2, ip + 3); |
987 |
encode_data ((const char *)ip, sizeof (ip)); |
988 |
} |
989 |
break; |
990 |
|
991 |
case BER_TYPE_UCS2: |
992 |
encode_ucs (data, 2); |
993 |
break; |
994 |
|
995 |
case BER_TYPE_UCS4: |
996 |
encode_ucs (data, 4); |
997 |
break; |
998 |
|
999 |
case BER_TYPE_REAL: |
1000 |
case BER_TYPE_CROAK: |
1001 |
default: |
1002 |
croak ("unconfigured/unsupported class/tag %d/%d", klass, tag); |
1003 |
} |
1004 |
|
1005 |
} |
1006 |
|
1007 |
///////////////////////////////////////////////////////////////////////////// |
1008 |
|
1009 |
MODULE = Convert::BER::XS PACKAGE = Convert::BER::XS |
1010 |
|
1011 |
PROTOTYPES: ENABLE |
1012 |
|
1013 |
BOOT: |
1014 |
{ |
1015 |
HV *stash = gv_stashpv ("Convert::BER::XS", 1); |
1016 |
|
1017 |
profile_stash = gv_stashpv ("Convert::BER::XS::Profile", 1); |
1018 |
|
1019 |
static const struct { |
1020 |
const char *name; |
1021 |
IV iv; |
1022 |
} *civ, const_iv[] = { |
1023 |
#define const_iv(name) { # name, name }, |
1024 |
const_iv (ASN_BOOLEAN) |
1025 |
const_iv (ASN_INTEGER) |
1026 |
const_iv (ASN_BIT_STRING) |
1027 |
const_iv (ASN_OCTET_STRING) |
1028 |
const_iv (ASN_NULL) |
1029 |
const_iv (ASN_OBJECT_IDENTIFIER) |
1030 |
const_iv (ASN_OBJECT_DESCRIPTOR) |
1031 |
const_iv (ASN_OID) |
1032 |
const_iv (ASN_EXTERNAL) |
1033 |
const_iv (ASN_REAL) |
1034 |
const_iv (ASN_SEQUENCE) |
1035 |
const_iv (ASN_ENUMERATED) |
1036 |
const_iv (ASN_EMBEDDED_PDV) |
1037 |
const_iv (ASN_UTF8_STRING) |
1038 |
const_iv (ASN_RELATIVE_OID) |
1039 |
const_iv (ASN_SET) |
1040 |
const_iv (ASN_NUMERIC_STRING) |
1041 |
const_iv (ASN_PRINTABLE_STRING) |
1042 |
const_iv (ASN_TELETEX_STRING) |
1043 |
const_iv (ASN_T61_STRING) |
1044 |
const_iv (ASN_VIDEOTEX_STRING) |
1045 |
const_iv (ASN_IA5_STRING) |
1046 |
const_iv (ASN_ASCII_STRING) |
1047 |
const_iv (ASN_UTC_TIME) |
1048 |
const_iv (ASN_GENERALIZED_TIME) |
1049 |
const_iv (ASN_GRAPHIC_STRING) |
1050 |
const_iv (ASN_VISIBLE_STRING) |
1051 |
const_iv (ASN_ISO646_STRING) |
1052 |
const_iv (ASN_GENERAL_STRING) |
1053 |
const_iv (ASN_UNIVERSAL_STRING) |
1054 |
const_iv (ASN_CHARACTER_STRING) |
1055 |
const_iv (ASN_BMP_STRING) |
1056 |
|
1057 |
const_iv (ASN_UNIVERSAL) |
1058 |
const_iv (ASN_APPLICATION) |
1059 |
const_iv (ASN_CONTEXT) |
1060 |
const_iv (ASN_PRIVATE) |
1061 |
|
1062 |
const_iv (BER_CLASS) |
1063 |
const_iv (BER_TAG) |
1064 |
const_iv (BER_FLAGS) |
1065 |
const_iv (BER_DATA) |
1066 |
|
1067 |
const_iv (BER_TYPE_BYTES) |
1068 |
const_iv (BER_TYPE_UTF8) |
1069 |
const_iv (BER_TYPE_UCS2) |
1070 |
const_iv (BER_TYPE_UCS4) |
1071 |
const_iv (BER_TYPE_INT) |
1072 |
const_iv (BER_TYPE_OID) |
1073 |
const_iv (BER_TYPE_RELOID) |
1074 |
const_iv (BER_TYPE_NULL) |
1075 |
const_iv (BER_TYPE_BOOL) |
1076 |
const_iv (BER_TYPE_REAL) |
1077 |
const_iv (BER_TYPE_IPADDRESS) |
1078 |
const_iv (BER_TYPE_CROAK) |
1079 |
|
1080 |
const_iv (SNMP_IPADDRESS) |
1081 |
const_iv (SNMP_COUNTER32) |
1082 |
const_iv (SNMP_GAUGE32) |
1083 |
const_iv (SNMP_UNSIGNED32) |
1084 |
const_iv (SNMP_TIMETICKS) |
1085 |
const_iv (SNMP_OPAQUE) |
1086 |
const_iv (SNMP_COUNTER64) |
1087 |
}; |
1088 |
|
1089 |
for (civ = const_iv + sizeof (const_iv) / sizeof (const_iv [0]); civ > const_iv; civ--) |
1090 |
newCONSTSUB (stash, (char *)civ[-1].name, newSViv (civ[-1].iv)); |
1091 |
} |
1092 |
|
1093 |
void |
1094 |
ber_decode (SV *ber, SV *profile = &PL_sv_undef) |
1095 |
ALIAS: |
1096 |
ber_decode_prefix = 1 |
1097 |
PPCODE: |
1098 |
{ |
1099 |
cur_profile = SvPROFILE (profile); |
1100 |
STRLEN len; |
1101 |
buf = (U8 *)SvPVbyte (ber, len); |
1102 |
cur = buf; |
1103 |
end = buf + len; |
1104 |
|
1105 |
SV *tuple = decode_ber (); |
1106 |
|
1107 |
EXTEND (SP, 2); |
1108 |
PUSHs (sv_2mortal (tuple)); |
1109 |
|
1110 |
if (ix) |
1111 |
PUSHs (sv_2mortal (newSViv (cur - buf))); |
1112 |
else if (cur != end) |
1113 |
error ("trailing garbage after BER data"); |
1114 |
} |
1115 |
|
1116 |
void |
1117 |
ber_is (SV *tuple, SV *klass = &PL_sv_undef, SV *tag = &PL_sv_undef, SV *flags = &PL_sv_undef, SV *data = &PL_sv_undef) |
1118 |
PPCODE: |
1119 |
{ |
1120 |
if (!SvOK (tuple)) |
1121 |
XSRETURN_NO; |
1122 |
|
1123 |
if (!SvROK (tuple) || SvTYPE (SvRV (tuple)) != SVt_PVAV) |
1124 |
croak ("ber_is: tuple must be BER tuple (array-ref)"); |
1125 |
|
1126 |
AV *av = (AV *)SvRV (tuple); |
1127 |
|
1128 |
XPUSHs ( |
1129 |
(!SvOK (klass) || SvIV (AvARRAY (av)[BER_CLASS]) == SvIV (klass)) |
1130 |
&& (!SvOK (tag) || SvIV (AvARRAY (av)[BER_TAG ]) == SvIV (tag)) |
1131 |
&& (!SvOK (flags) || !SvIV (AvARRAY (av)[BER_FLAGS]) == !SvIV (flags)) |
1132 |
&& (!SvOK (data) || sv_eq (AvARRAY (av)[BER_DATA ], data)) |
1133 |
? &PL_sv_yes : &PL_sv_undef); |
1134 |
} |
1135 |
|
1136 |
void |
1137 |
ber_is_seq (SV *tuple) |
1138 |
PPCODE: |
1139 |
{ |
1140 |
if (!SvOK (tuple)) |
1141 |
XSRETURN_UNDEF; |
1142 |
|
1143 |
AV *av = ber_tuple (tuple); |
1144 |
|
1145 |
XPUSHs ( |
1146 |
SvIV (AvARRAY (av)[BER_CLASS]) == ASN_UNIVERSAL |
1147 |
&& SvIV (AvARRAY (av)[BER_TAG ]) == ASN_SEQUENCE |
1148 |
&& SvIV (AvARRAY (av)[BER_FLAGS]) |
1149 |
? AvARRAY (av)[BER_DATA] : &PL_sv_undef); |
1150 |
} |
1151 |
|
1152 |
void |
1153 |
ber_is_int (SV *tuple, SV *value = &PL_sv_undef) |
1154 |
PPCODE: |
1155 |
{ |
1156 |
if (!SvOK (tuple)) |
1157 |
XSRETURN_NO; |
1158 |
|
1159 |
AV *av = ber_tuple (tuple); |
1160 |
|
1161 |
UV data = SvUV (AvARRAY (av)[BER_DATA]); |
1162 |
|
1163 |
XPUSHs ( |
1164 |
SvIV (AvARRAY (av)[BER_CLASS]) == ASN_UNIVERSAL |
1165 |
&& SvIV (AvARRAY (av)[BER_TAG ]) == ASN_INTEGER |
1166 |
&& !SvIV (AvARRAY (av)[BER_FLAGS]) |
1167 |
&& (!SvOK (value) || data == SvUV (value)) |
1168 |
? sv_2mortal (data ? newSVsv (AvARRAY (av)[BER_DATA]) : newSVpv ("0 but true", 0)) |
1169 |
: &PL_sv_undef); |
1170 |
} |
1171 |
|
1172 |
void |
1173 |
ber_is_oid (SV *tuple, SV *oid = &PL_sv_undef) |
1174 |
PPCODE: |
1175 |
{ |
1176 |
if (!SvOK (tuple)) |
1177 |
XSRETURN_NO; |
1178 |
|
1179 |
AV *av = ber_tuple (tuple); |
1180 |
|
1181 |
XPUSHs ( |
1182 |
SvIV (AvARRAY (av)[BER_CLASS]) == ASN_UNIVERSAL |
1183 |
&& SvIV (AvARRAY (av)[BER_TAG ]) == ASN_OBJECT_IDENTIFIER |
1184 |
&& !SvIV (AvARRAY (av)[BER_FLAGS]) |
1185 |
&& (!SvOK (oid) || sv_eq (AvARRAY (av)[BER_DATA], oid)) |
1186 |
? newSVsv (AvARRAY (av)[BER_DATA]) : &PL_sv_undef); |
1187 |
} |
1188 |
|
1189 |
############################################################################# |
1190 |
|
1191 |
void |
1192 |
ber_encode (SV *tuple, SV *profile = &PL_sv_undef) |
1193 |
PPCODE: |
1194 |
{ |
1195 |
cur_profile = SvPROFILE (profile); |
1196 |
buf_sv = sv_2mortal (NEWSV (0, 256)); |
1197 |
SvPOK_only (buf_sv); |
1198 |
set_buf (buf_sv); |
1199 |
|
1200 |
encode_ber (tuple); |
1201 |
|
1202 |
SvCUR_set (buf_sv, cur - buf); |
1203 |
XPUSHs (buf_sv); |
1204 |
} |
1205 |
|
1206 |
SV * |
1207 |
ber_int (SV *sv) |
1208 |
CODE: |
1209 |
{ |
1210 |
AV *av = newAV (); |
1211 |
av_fill (av, BER_ARRAYSIZE - 1); |
1212 |
AvARRAY (av)[BER_CLASS] = newSVcacheint (ASN_UNIVERSAL); |
1213 |
AvARRAY (av)[BER_TAG ] = newSVcacheint (ASN_INTEGER); |
1214 |
AvARRAY (av)[BER_FLAGS] = newSVcacheint (0); |
1215 |
AvARRAY (av)[BER_DATA ] = newSVsv (sv); |
1216 |
RETVAL = newRV_noinc ((SV *)av); |
1217 |
} |
1218 |
OUTPUT: RETVAL |
1219 |
|
1220 |
# TODO: not arrayref, but elements? |
1221 |
SV * |
1222 |
ber_seq (SV *arrayref) |
1223 |
CODE: |
1224 |
{ |
1225 |
AV *av = newAV (); |
1226 |
av_fill (av, BER_ARRAYSIZE - 1); |
1227 |
AvARRAY (av)[BER_CLASS] = newSVcacheint (ASN_UNIVERSAL); |
1228 |
AvARRAY (av)[BER_TAG ] = newSVcacheint (ASN_SEQUENCE); |
1229 |
AvARRAY (av)[BER_FLAGS] = newSVcacheint (1); |
1230 |
AvARRAY (av)[BER_DATA ] = newSVsv (arrayref); |
1231 |
RETVAL = newRV_noinc ((SV *)av); |
1232 |
} |
1233 |
OUTPUT: RETVAL |
1234 |
|
1235 |
MODULE = Convert::BER::XS PACKAGE = Convert::BER::XS::Profile |
1236 |
|
1237 |
SV * |
1238 |
new (SV *klass) |
1239 |
CODE: |
1240 |
RETVAL = profile_new (); |
1241 |
OUTPUT: RETVAL |
1242 |
|
1243 |
void |
1244 |
set (SV *profile, int klass, int tag, int type) |
1245 |
CODE: |
1246 |
profile_set (SvPROFILE (profile), klass, tag, type); |
1247 |
|
1248 |
IV |
1249 |
get (SV *profile, int klass, int tag) |
1250 |
CODE: |
1251 |
RETVAL = profile_lookup (SvPROFILE (profile), klass, tag); |
1252 |
OUTPUT: RETVAL |
1253 |
|
1254 |
void |
1255 |
_set_default (SV *profile) |
1256 |
CODE: |
1257 |
default_profile = SvPROFILE (profile); |
1258 |
|
1259 |
|