asn1c/skeletons/ber_tlv_tag.c

145 lines
3.1 KiB
C
Raw Normal View History

2004-06-03 03:38:44 +00:00
/*-
* Copyright (c) 2003, 2004 Lev Walkin <vlm@lionet.info>. All rights reserved.
* Redistribution and modifications are permitted subject to BSD license.
*/
2004-09-22 16:06:28 +00:00
#include <asn_internal.h>
2004-06-03 03:38:44 +00:00
#include <ber_tlv_tag.h>
#include <errno.h>
ssize_t
2005-03-10 18:52:02 +00:00
ber_fetch_tag(const void *ptr, size_t size, ber_tlv_tag_t *tag_r) {
2004-06-03 03:38:44 +00:00
ber_tlv_tag_t val;
ber_tlv_tag_t tclass;
2004-06-05 08:17:50 +00:00
size_t skipped;
2004-06-03 03:38:44 +00:00
if(size == 0)
return 0;
2005-03-10 18:52:02 +00:00
val = *(const uint8_t *)ptr;
2004-06-03 03:38:44 +00:00
tclass = (val >> 6);
2004-08-18 09:01:45 +00:00
if((val &= 0x1F) != 0x1F) {
2004-06-03 03:38:44 +00:00
/*
* Simple form: everything encoded in a single octet.
* Tag Class is encoded using two least significant bits.
*/
*tag_r = (val << 2) | tclass;
return 1;
}
/*
* Each octet contains 7 bits of useful information.
* The MSB is 0 if it is the last octet of the tag.
*/
2005-03-10 18:52:02 +00:00
for(val = 0, ptr = ((const char *)ptr) + 1, skipped = 2;
skipped <= size;
ptr = ((const char *)ptr) + 1, skipped++) {
unsigned int oct = *(const uint8_t *)ptr;
2004-06-03 03:38:44 +00:00
if(oct & 0x80) {
val = (val << 7) | (oct & 0x7F);
/*
* Make sure there are at least 9 bits spare
* at the MS side of a value.
*/
if(val >> ((8 * sizeof(val)) - 9)) {
/*
* We would not be able to accomodate
* any more tag bits.
*/
return -1;
}
} else {
2004-08-18 09:01:45 +00:00
val = (val << 7) | oct;
*tag_r = (val << 2) | tclass;
2004-06-03 03:38:44 +00:00
return skipped;
}
}
return 0; /* Want more */
}
ssize_t
ber_tlv_tag_fwrite(ber_tlv_tag_t tag, FILE *f) {
char buf[sizeof("[APPLICATION ]") + 32];
ssize_t ret;
ret = ber_tlv_tag_snprint(tag, buf, sizeof(buf));
2004-06-05 08:17:50 +00:00
if(ret >= (ssize_t)sizeof(buf) || ret < 2) {
2004-06-03 03:38:44 +00:00
errno = EPERM;
return -1;
}
return fwrite(buf, 1, ret, f);
}
ssize_t
ber_tlv_tag_snprint(ber_tlv_tag_t tag, char *buf, size_t size) {
char *type = 0;
int ret;
switch(tag & 0x3) {
case ASN_TAG_CLASS_UNIVERSAL: type = "UNIVERSAL "; break;
case ASN_TAG_CLASS_APPLICATION: type = "APPLICATION "; break;
case ASN_TAG_CLASS_CONTEXT: type = ""; break;
case ASN_TAG_CLASS_PRIVATE: type = "PRIVATE "; break;
}
ret = snprintf(buf, size, "[%s%u]", type, ((unsigned)tag) >> 2);
if(ret <= 0 && size) buf[0] = '\0'; /* against broken libc's */
return ret;
}
char *
ber_tlv_tag_string(ber_tlv_tag_t tag) {
static char buf[sizeof("[APPLICATION ]") + 32];
(void)ber_tlv_tag_snprint(tag, buf, sizeof(buf));
return buf;
}
2004-09-24 20:59:13 +00:00
size_t
2004-08-19 13:27:34 +00:00
ber_tlv_tag_serialize(ber_tlv_tag_t tag, void *bufp, size_t size) {
2004-06-03 03:38:44 +00:00
int tclass = BER_TAG_CLASS(tag);
ber_tlv_tag_t tval = BER_TAG_VALUE(tag);
2004-08-11 09:07:36 +00:00
uint8_t *buf = (uint8_t *)bufp;
2004-06-03 03:38:44 +00:00
uint8_t *end;
2004-08-18 08:23:43 +00:00
size_t required_size;
2004-08-18 09:01:45 +00:00
size_t i;
2004-06-03 03:38:44 +00:00
if(tval <= 30) {
/* Encoded in 1 octet */
if(size) buf[0] = (tclass << 6) | tval;
return 1;
} else if(size) {
*buf++ = (tclass << 6) | 0x1F;
size--;
}
/*
* Compute the size of the subsequent bytes.
*/
2004-08-18 09:01:45 +00:00
for(required_size = 1, i = 7; i < 8 * sizeof(tval); i += 7) {
if(tval >> i)
2004-08-18 08:23:43 +00:00
required_size++;
else
break;
2004-06-03 03:38:44 +00:00
}
2004-08-18 08:23:43 +00:00
if(size < required_size)
return required_size + 1;
2004-06-03 03:38:44 +00:00
/*
* Fill in the buffer, space permitting.
*/
2004-08-18 08:23:43 +00:00
end = buf + required_size - 1;
2004-08-18 09:01:45 +00:00
for(i -= 7; buf < end; i -= 7, buf++)
2004-08-18 08:23:43 +00:00
*buf = 0x80 | ((tval >> i) & 0x7F);
2004-08-18 09:01:45 +00:00
*buf = (tval & 0x7F); /* Last octet without high bit */
2004-06-03 03:38:44 +00:00
2004-08-18 08:23:43 +00:00
return required_size + 1;
2004-06-03 03:38:44 +00:00
}