2N/A/*
2N/A * -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*-
2N/A *
2N/A * The contents of this file are subject to the Netscape Public License
2N/A * Version 1.0 (the "NPL"); you may not use this file except in
2N/A * compliance with the NPL. You may obtain a copy of the NPL at
2N/A * http://www.mozilla.org/NPL/
2N/A *
2N/A * Software distributed under the NPL is distributed on an "AS IS" basis,
2N/A * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
2N/A * for the specific language governing rights and limitations under the
2N/A * NPL.
2N/A *
2N/A * The Initial Developer of this code under the NPL is Netscape
2N/A * Communications Corporation. Portions created by Netscape are
2N/A * Copyright (C) 1998 Netscape Communications Corporation. All Rights
2N/A * Reserved.
2N/A */
2N/A
2N/A/*
2N/A * Copyright (c) 1990 Regents of the University of Michigan.
2N/A * All rights reserved.
2N/A *
2N/A * Redistribution and use in source and binary forms are permitted
2N/A * provided that this notice is preserved and that due credit is given
2N/A * to the University of Michigan at Ann Arbor. The name of the University
2N/A * may not be used to endorse or promote products derived from this
2N/A * software without specific prior written permission. This software
2N/A * is provided ``as is'' without express or implied warranty.
2N/A */
2N/A
2N/A/*
2N/A * Copyright 2009 Sun Microsystems, Inc. All rights reserved.
2N/A * Use is subject to license terms.
2N/A */
2N/A
2N/A#include <sys/types.h>
2N/A#include <netinet/in.h>
2N/A#include <inttypes.h>
2N/A
2N/A#include <ber_der.h>
2N/A#include "kmfber_int.h"
2N/A
2N/A/* the following constants are used in kmfber_calc_lenlen */
2N/A
2N/A#define LENMASK1 0xFF
2N/A#define LENMASK2 0xFFFF
2N/A#define LENMASK3 0xFFFFFF
2N/A#define LENMASK4 0xFFFFFFFF
2N/A#define _MASK 0x80
2N/A
2N/Aint
2N/Akmfber_calc_taglen(ber_tag_t tag)
2N/A{
2N/A int i;
2N/A ber_int_t mask;
2N/A
2N/A /* find the first non-all-zero byte in the tag */
2N/A for (i = sizeof (ber_int_t) - 1; i > 0; i--) {
2N/A mask = (LENMASK3 << (i * 8));
2N/A /* not all zero */
2N/A if (tag & mask)
2N/A break;
2N/A }
2N/A
2N/A return (i + 1);
2N/A}
2N/A
2N/Astatic int
2N/Aber_put_tag(BerElement *ber, ber_tag_t tag, int nosos)
2N/A{
2N/A ber_int_t taglen;
2N/A ber_tag_t ntag;
2N/A
2N/A taglen = kmfber_calc_taglen(tag);
2N/A
2N/A ntag = htonl(tag);
2N/A
2N/A return (kmfber_write(ber,
2N/A ((char *) &ntag) + sizeof (ber_int_t) - taglen,
2N/A taglen, nosos));
2N/A}
2N/A
2N/Aint
2N/Akmfber_calc_lenlen(ber_int_t len)
2N/A{
2N/A /*
2N/A * short len if it's less than 128 - one byte giving the len,
2N/A * with bit 8 0.
2N/A */
2N/A
2N/A if (len <= 0x7F)
2N/A return (1);
2N/A
2N/A /*
2N/A * long len otherwise - one byte with bit 8 set, giving the
2N/A * length of the length, followed by the length itself.
2N/A */
2N/A
2N/A if (len <= LENMASK1)
2N/A return (2);
2N/A if (len <= LENMASK2)
2N/A return (3);
2N/A if (len <= LENMASK3)
2N/A return (4);
2N/A
2N/A return (5);
2N/A}
2N/A
2N/Aint
2N/Akmfber_put_len(BerElement *ber, ber_int_t len, int nosos)
2N/A{
2N/A int i;
2N/A char lenlen;
2N/A ber_int_t mask, netlen;
2N/A
2N/A /*
2N/A * short len if it's less than 128 - one byte giving the len,
2N/A * with bit 8 0.
2N/A */
2N/A if (len <= 127) {
2N/A netlen = htonl(len);
2N/A return (kmfber_write(ber,
2N/A (char *)&netlen + sizeof (ber_int_t) - 1,
2N/A 1, nosos));
2N/A }
2N/A
2N/A /*
2N/A * long len otherwise - one byte with bit 8 set, giving the
2N/A * length of the length, followed by the length itself.
2N/A */
2N/A
2N/A /* find the first non-all-zero byte */
2N/A for (i = sizeof (ber_int_t) - 1; i > 0; i--) {
2N/A mask = (LENMASK1 << (i * 8));
2N/A /* not all zero */
2N/A if (len & mask)
2N/A break;
2N/A }
2N/A lenlen = ++i;
2N/A if (lenlen > 4)
2N/A return (-1);
2N/A lenlen |= 0x80;
2N/A
2N/A /* write the length of the length */
2N/A if (kmfber_write(ber, &lenlen, 1, nosos) != 1)
2N/A return (-1);
2N/A
2N/A /* write the length itself */
2N/A netlen = htonl(len);
2N/A if (kmfber_write(ber,
2N/A (char *) &netlen + (sizeof (ber_int_t) - i), i, nosos) != i)
2N/A return (-1);
2N/A
2N/A return (i + 1);
2N/A}
2N/A
2N/Astatic int
2N/Aber_put_int_or_enum(BerElement *ber, ber_int_t num, ber_tag_t tag)
2N/A{
2N/A int i, sign;
2N/A ber_int_t len, lenlen, taglen, netnum, mask;
2N/A
2N/A sign = (num < 0);
2N/A
2N/A /*
2N/A * high bit is set - look for first non-all-one byte
2N/A * high bit is clear - look for first non-all-zero byte
2N/A */
2N/A for (i = sizeof (ber_int_t) - 1; i > 0; i--) {
2N/A mask = (LENMASK1 << (i * 8));
2N/A
2N/A if (sign) {
2N/A /* not all ones */
2N/A if ((num & mask) != mask)
2N/A break;
2N/A } else {
2N/A /* not all zero */
2N/A if (num & mask)
2N/A break;
2N/A }
2N/A }
2N/A
2N/A /*
2N/A * we now have the "leading byte". if the high bit on this
2N/A * byte matches the sign bit, we need to "back up" a byte.
2N/A */
2N/A mask = (num & (_MASK << (i * 8)));
2N/A if ((mask && !sign) || (sign && !mask))
2N/A i++;
2N/A
2N/A len = i + 1;
2N/A
2N/A if ((taglen = ber_put_tag(ber, tag, 0)) == -1)
2N/A return (-1);
2N/A
2N/A if ((lenlen = kmfber_put_len(ber, len, 0)) == -1)
2N/A return (-1);
2N/A i++;
2N/A netnum = htonl(num);
2N/A if (kmfber_write(ber,
2N/A (char *) &netnum + (sizeof (ber_int_t) - i), i, 0) == i)
2N/A /* length of tag + length + contents */
2N/A return (taglen + lenlen + i);
2N/A
2N/A return (-1);
2N/A}
2N/A
2N/Astatic int
2N/Akmfber_put_enum(BerElement *ber, ber_int_t num, ber_tag_t tag)
2N/A{
2N/A if (tag == KMFBER_DEFAULT)
2N/A tag = BER_ENUMERATED;
2N/A
2N/A return (ber_put_int_or_enum(ber, num, tag));
2N/A}
2N/A
2N/Aint
2N/Aber_put_int(BerElement *ber, ber_int_t num, ber_tag_t tag)
2N/A{
2N/A if (tag == KMFBER_DEFAULT)
2N/A tag = BER_INTEGER;
2N/A
2N/A return (ber_put_int_or_enum(ber, num, tag));
2N/A}
2N/A
2N/Aint
2N/Aber_put_oid(BerElement *ber, struct berval *oid, ber_tag_t tag)
2N/A{
2N/A ber_int_t taglen, lenlen, rc, len;
2N/A
2N/A if (tag == KMFBER_DEFAULT)
2N/A tag = 0x06; /* TODO: Add new OID constant to header */
2N/A
2N/A if ((taglen = ber_put_tag(ber, tag, 0)) == -1)
2N/A return (-1);
2N/A
2N/A len = (ber_int_t)oid->bv_len;
2N/A if ((lenlen = kmfber_put_len(ber, len, 0)) == -1 ||
2N/A kmfber_write(ber, oid->bv_val, oid->bv_len, 0) !=
2N/A (ber_int_t)oid->bv_len) {
2N/A rc = -1;
2N/A } else {
2N/A /* return length of tag + length + contents */
2N/A rc = taglen + lenlen + oid->bv_len;
2N/A }
2N/A return (rc);
2N/A}
2N/A
2N/Aint
2N/Aber_put_big_int(BerElement *ber, ber_tag_t tag, char *data,
2N/A ber_len_t len)
2N/A{
2N/A ber_int_t taglen, lenlen, ilen, rc;
2N/A char zero = 0x00;
2N/A
2N/A if (tag == KMFBER_DEFAULT)
2N/A tag = BER_INTEGER;
2N/A
2N/A if ((taglen = ber_put_tag(ber, tag, 0)) == -1)
2N/A return (-1);
2N/A
2N/A /* Add a leading 0 if the high order bit is set */
2N/A if (data[0] & 0x80)
2N/A len++;
2N/A
2N/A ilen = (ber_int_t)len;
2N/A if ((lenlen = kmfber_put_len(ber, ilen, 0)) == -1)
2N/A return (-1);
2N/A
2N/A /* add leading 0 if hi bit set */
2N/A if ((data[0] & 0x80) && kmfber_write(ber, &zero, 1, 0) != 1)
2N/A return (-1);
2N/A
2N/A /* Adjust the length of the write if hi-order bit is set */
2N/A if (data[0] & 0x80)
2N/A ilen = len - 1;
2N/A if (kmfber_write(ber, data, ilen, 0) != (ber_int_t)ilen) {
2N/A return (-1);
2N/A } else {
2N/A /* return length of tag + length + contents */
2N/A rc = taglen + lenlen + len;
2N/A }
2N/A return (rc);
2N/A}
2N/A
2N/Astatic int
2N/Akmfber_put_ostring(BerElement *ber, char *str, ber_len_t len,
2N/A ber_tag_t tag)
2N/A{
2N/A ber_int_t taglen, lenlen, ilen, rc;
2N/A#ifdef STR_TRANSLATION
2N/A int free_str;
2N/A#endif /* STR_TRANSLATION */
2N/A
2N/A if (tag == KMFBER_DEFAULT)
2N/A tag = BER_OCTET_STRING;
2N/A
2N/A if ((taglen = ber_put_tag(ber, tag, 0)) == -1)
2N/A return (-1);
2N/A
2N/A#ifdef STR_TRANSLATION
2N/A if (len > 0 && (ber->ber_options & KMFBER_OPT_TRANSLATE_STRINGS) != 0 &&
2N/A ber->ber_encode_translate_proc != NULL) {
2N/A if ((*(ber->ber_encode_translate_proc))(&str, &len, 0)
2N/A != 0) {
2N/A return (-1);
2N/A }
2N/A free_str = 1;
2N/A } else {
2N/A free_str = 0;
2N/A }
2N/A#endif /* STR_TRANSLATION */
2N/A
2N/A /*
2N/A * Note: below is a spot where we limit ber_write
2N/A * to signed long (instead of unsigned long)
2N/A */
2N/A ilen = (ber_int_t)len;
2N/A if ((lenlen = kmfber_put_len(ber, ilen, 0)) == -1 ||
2N/A kmfber_write(ber, str, len, 0) != (ber_int_t)len) {
2N/A rc = -1;
2N/A } else {
2N/A /* return length of tag + length + contents */
2N/A rc = taglen + lenlen + len;
2N/A }
2N/A
2N/A#ifdef STR_TRANSLATION
2N/A if (free_str) {
2N/A free(str);
2N/A }
2N/A#endif /* STR_TRANSLATION */
2N/A
2N/A return (rc);
2N/A}
2N/A
2N/Astatic int
2N/Akmfber_put_string(BerElement *ber, char *str, ber_tag_t tag)
2N/A{
2N/A return (kmfber_put_ostring(ber, str, (ber_len_t)strlen(str), tag));
2N/A}
2N/A
2N/Astatic int
2N/Akmfber_put_bitstring(BerElement *ber, char *str,
2N/A ber_len_t blen /* in bits */, ber_tag_t tag)
2N/A{
2N/A ber_int_t taglen, lenlen, len;
2N/A unsigned char unusedbits;
2N/A
2N/A if (tag == KMFBER_DEFAULT)
2N/A tag = BER_BIT_STRING;
2N/A
2N/A if ((taglen = ber_put_tag(ber, tag, 0)) == -1)
2N/A return (-1);
2N/A
2N/A len = (blen + 7) / 8;
2N/A unusedbits = (unsigned char) (len * 8 - blen);
2N/A if ((lenlen = kmfber_put_len(ber, len + 1, 0)) == -1)
2N/A return (-1);
2N/A
2N/A if (kmfber_write(ber, (char *)&unusedbits, 1, 0) != 1)
2N/A return (-1);
2N/A
2N/A if (kmfber_write(ber, str, len, 0) != len)
2N/A return (-1);
2N/A
2N/A /* return length of tag + length + unused bit count + contents */
2N/A return (taglen + 1 + lenlen + len);
2N/A}
2N/A
2N/Astatic int
2N/Akmfber_put_null(BerElement *ber, ber_tag_t tag)
2N/A{
2N/A int taglen;
2N/A
2N/A if (tag == KMFBER_DEFAULT)
2N/A tag = BER_NULL;
2N/A
2N/A if ((taglen = ber_put_tag(ber, tag, 0)) == -1)
2N/A return (-1);
2N/A
2N/A if (kmfber_put_len(ber, 0, 0) != 1)
2N/A return (-1);
2N/A
2N/A return (taglen + 1);
2N/A}
2N/A
2N/Astatic int
2N/Akmfber_put_boolean(BerElement *ber, int boolval, ber_tag_t tag)
2N/A{
2N/A int taglen;
2N/A unsigned char trueval = 0xff;
2N/A unsigned char falseval = 0x00;
2N/A
2N/A if (tag == KMFBER_DEFAULT)
2N/A tag = BER_BOOLEAN;
2N/A
2N/A if ((taglen = ber_put_tag(ber, tag, 0)) == -1)
2N/A return (-1);
2N/A
2N/A if (kmfber_put_len(ber, 1, 0) != 1)
2N/A return (-1);
2N/A
2N/A if (kmfber_write(ber, (char *)(boolval ? &trueval : &falseval), 1, 0)
2N/A != 1)
2N/A return (-1);
2N/A
2N/A return (taglen + 2);
2N/A}
2N/A
2N/A#define FOUR_BYTE_LEN 5
2N/A
2N/A
2N/A/*
2N/A * The idea here is roughly this: we maintain a stack of these Seqorset
2N/A * structures. This is pushed when we see the beginning of a new set or
2N/A * sequence. It is popped when we see the end of a set or sequence.
2N/A * Since we don't want to malloc and free these structures all the time,
2N/A * we pre-allocate a small set of them within the ber element structure.
2N/A * thus we need to spot when we've overflowed this stack and fall back to
2N/A * malloc'ing instead.
2N/A */
2N/Astatic int
2N/Aber_start_seqorset(BerElement *ber, ber_tag_t tag)
2N/A{
2N/A Seqorset *new_sos;
2N/A
2N/A /* can we fit into the local stack ? */
2N/A if (ber->ber_sos_stack_posn < SOS_STACK_SIZE) {
2N/A /* yes */
2N/A new_sos = &ber->ber_sos_stack[ber->ber_sos_stack_posn];
2N/A } else {
2N/A /* no */
2N/A if ((new_sos = (Seqorset *)malloc(sizeof (Seqorset)))
2N/A == NULLSEQORSET) {
2N/A return (-1);
2N/A }
2N/A }
2N/A ber->ber_sos_stack_posn++;
2N/A
2N/A if (ber->ber_sos == NULLSEQORSET)
2N/A new_sos->sos_first = ber->ber_ptr;
2N/A else
2N/A new_sos->sos_first = ber->ber_sos->sos_ptr;
2N/A
2N/A /* Set aside room for a 4 byte length field */
2N/A new_sos->sos_ptr = new_sos->sos_first + kmfber_calc_taglen(tag) +
2N/A FOUR_BYTE_LEN;
2N/A new_sos->sos_tag = tag;
2N/A
2N/A new_sos->sos_next = ber->ber_sos;
2N/A new_sos->sos_clen = 0;
2N/A
2N/A ber->ber_sos = new_sos;
2N/A if (ber->ber_sos->sos_ptr > ber->ber_end) {
2N/A if (kmfber_realloc(ber, ber->ber_sos->sos_ptr -
2N/A ber->ber_end) != 0)
2N/A return (-1);
2N/A }
2N/A return (0);
2N/A}
2N/A
2N/Astatic int
2N/Akmfber_start_seq(BerElement *ber, ber_tag_t tag)
2N/A{
2N/A if (tag == KMFBER_DEFAULT)
2N/A tag = BER_CONSTRUCTED_SEQUENCE;
2N/A
2N/A return (ber_start_seqorset(ber, tag));
2N/A}
2N/A
2N/Astatic int
2N/Akmfber_start_set(BerElement *ber, ber_tag_t tag)
2N/A{
2N/A if (tag == KMFBER_DEFAULT)
2N/A tag = BER_CONSTRUCTED_SET;
2N/A
2N/A return (ber_start_seqorset(ber, tag));
2N/A}
2N/A
2N/Astatic int
2N/Aber_put_seqorset(BerElement *ber)
2N/A{
2N/A ber_int_t netlen, len, taglen, lenlen;
2N/A unsigned char ltag = 0x80 + FOUR_BYTE_LEN - 1;
2N/A Seqorset *next;
2N/A Seqorset **sos = &ber->ber_sos;
2N/A
2N/A /*
2N/A * If this is the toplevel sequence or set, we need to actually
2N/A * write the stuff out. Otherwise, it's already been put in
2N/A * the appropriate buffer and will be written when the toplevel
2N/A * one is written. In this case all we need to do is update the
2N/A * length and tag.
2N/A */
2N/A
2N/A len = (*sos)->sos_clen;
2N/A netlen = (ber_len_t)htonl(len);
2N/A
2N/A if (ber->ber_options & KMFBER_OPT_USE_DER) {
2N/A lenlen = kmfber_calc_lenlen(len);
2N/A } else {
2N/A lenlen = FOUR_BYTE_LEN;
2N/A }
2N/A
2N/A if ((next = (*sos)->sos_next) == NULLSEQORSET) {
2N/A /* write the tag */
2N/A if ((taglen = ber_put_tag(ber, (*sos)->sos_tag, 1)) == -1)
2N/A return (-1);
2N/A
2N/A if (ber->ber_options & KMFBER_OPT_USE_DER) {
2N/A /* Write the length in the minimum # of octets */
2N/A if (kmfber_put_len(ber, len, 1) == -1)
2N/A return (-1);
2N/A
2N/A if (lenlen != FOUR_BYTE_LEN) {
2N/A /*
2N/A * We set aside FOUR_BYTE_LEN bytes for
2N/A * the length field. Move the data if
2N/A * we don't actually need that much
2N/A */
2N/A (void) memmove((*sos)->sos_first + taglen +
2N/A lenlen, (*sos)->sos_first + taglen +
2N/A FOUR_BYTE_LEN, len);
2N/A }
2N/A } else {
2N/A /* Fill FOUR_BYTE_LEN bytes for length field */
2N/A /* one byte of length length */
2N/A if (kmfber_write(ber, (char *)&ltag, 1, 1) != 1)
2N/A return (-1);
2N/A
2N/A /* the length itself */
2N/A if (kmfber_write(ber,
2N/A (char *)&netlen + sizeof (ber_int_t)
2N/A - (FOUR_BYTE_LEN - 1), FOUR_BYTE_LEN - 1, 1) !=
2N/A FOUR_BYTE_LEN - 1)
2N/A return (-1);
2N/A }
2N/A /* The ber_ptr is at the set/seq start - move it to the end */
2N/A ber->ber_ptr += len;
2N/A } else {
2N/A ber_tag_t ntag;
2N/A
2N/A /* the tag */
2N/A taglen = kmfber_calc_taglen((*sos)->sos_tag);
2N/A ntag = htonl((*sos)->sos_tag);
2N/A (void) memmove((*sos)->sos_first, (char *)&ntag +
2N/A sizeof (ber_int_t) - taglen, taglen);
2N/A
2N/A if (ber->ber_options & KMFBER_OPT_USE_DER) {
2N/A ltag = (lenlen == 1) ? (unsigned char)len :
2N/A (unsigned char) (0x80 + (lenlen - 1));
2N/A }
2N/A
2N/A /* one byte of length length */
2N/A (void) memmove((*sos)->sos_first + 1, &ltag, 1);
2N/A
2N/A if (ber->ber_options & KMFBER_OPT_USE_DER) {
2N/A if (lenlen > 1) {
2N/A /* Write the length itself */
2N/A (void) memmove((*sos)->sos_first + 2,
2N/A (char *)&netlen + sizeof (ber_uint_t) -
2N/A (lenlen - 1),
2N/A lenlen - 1);
2N/A }
2N/A if (lenlen != FOUR_BYTE_LEN) {
2N/A /*
2N/A * We set aside FOUR_BYTE_LEN bytes for
2N/A * the length field. Move the data if
2N/A * we don't actually need that much
2N/A */
2N/A (void) memmove((*sos)->sos_first + taglen +
2N/A lenlen, (*sos)->sos_first + taglen +
2N/A FOUR_BYTE_LEN, len);
2N/A }
2N/A } else {
2N/A /* the length itself */
2N/A (void) memmove((*sos)->sos_first + taglen + 1,
2N/A (char *) &netlen + sizeof (ber_int_t) -
2N/A (FOUR_BYTE_LEN - 1), FOUR_BYTE_LEN - 1);
2N/A }
2N/A
2N/A next->sos_clen += (taglen + lenlen + len);
2N/A next->sos_ptr += (taglen + lenlen + len);
2N/A }
2N/A
2N/A /* we're done with this seqorset, so free it up */
2N/A /* was this one from the local stack ? */
2N/A if (ber->ber_sos_stack_posn > SOS_STACK_SIZE) {
2N/A free((char *)(*sos));
2N/A }
2N/A ber->ber_sos_stack_posn--;
2N/A *sos = next;
2N/A
2N/A return (taglen + lenlen + len);
2N/A}
2N/A
2N/A/* VARARGS */
2N/Aint
2N/Akmfber_printf(BerElement *ber, const char *fmt, ...)
2N/A{
2N/A va_list ap;
2N/A char *s, **ss;
2N/A struct berval **bv, *oid;
2N/A int rc, i, t;
2N/A ber_int_t len;
2N/A
2N/A va_start(ap, fmt);
2N/A
2N/A#ifdef KMFBER_DEBUG
2N/A if (lber_debug & 64) {
2N/A char msg[80];
2N/A sprintf(msg, "kmfber_printf fmt (%s)\n", fmt);
2N/A ber_err_print(msg);
2N/A }
2N/A#endif
2N/A
2N/A for (rc = 0; *fmt && rc != -1; fmt++) {
2N/A switch (*fmt) {
2N/A case 'b': /* boolean */
2N/A i = va_arg(ap, int);
2N/A rc = kmfber_put_boolean(ber, i, ber->ber_tag);
2N/A break;
2N/A
2N/A case 'i': /* int */
2N/A i = va_arg(ap, int);
2N/A rc = ber_put_int(ber, (ber_int_t)i, ber->ber_tag);
2N/A break;
2N/A
2N/A case 'D': /* Object ID */
2N/A if ((oid = va_arg(ap, struct berval *)) == NULL)
2N/A break;
2N/A rc = ber_put_oid(ber, oid, ber->ber_tag);
2N/A break;
2N/A case 'I': /* int */
2N/A s = va_arg(ap, char *);
2N/A len = va_arg(ap, ber_int_t);
2N/A rc = ber_put_big_int(ber, ber->ber_tag, s, len);
2N/A break;
2N/A
2N/A case 'e': /* enumeration */
2N/A i = va_arg(ap, int);
2N/A rc = kmfber_put_enum(ber, (ber_int_t)i, ber->ber_tag);
2N/A break;
2N/A
2N/A case 'l':
2N/A t = va_arg(ap, int);
2N/A rc = kmfber_put_len(ber, t, 0);
2N/A break;
2N/A case 'n': /* null */
2N/A rc = kmfber_put_null(ber, ber->ber_tag);
2N/A break;
2N/A
2N/A case 'o': /* octet string (non-null terminated) */
2N/A s = va_arg(ap, char *);
2N/A len = va_arg(ap, int);
2N/A rc = kmfber_put_ostring(ber, s, len, ber->ber_tag);
2N/A break;
2N/A
2N/A case 's': /* string */
2N/A s = va_arg(ap, char *);
2N/A rc = kmfber_put_string(ber, s, ber->ber_tag);
2N/A break;
2N/A
2N/A case 'B': /* bit string */
2N/A s = va_arg(ap, char *);
2N/A len = va_arg(ap, int); /* in bits */
2N/A rc = kmfber_put_bitstring(ber, s, len, ber->ber_tag);
2N/A break;
2N/A
2N/A case 't': /* tag for the next element */
2N/A ber->ber_tag = va_arg(ap, ber_tag_t);
2N/A ber->ber_usertag = 1;
2N/A break;
2N/A
2N/A case 'T': /* Write an explicit tag, but don't change current */
2N/A t = va_arg(ap, int);
2N/A rc = ber_put_tag(ber, t, 0);
2N/A break;
2N/A
2N/A case 'v': /* vector of strings */
2N/A if ((ss = va_arg(ap, char **)) == NULL)
2N/A break;
2N/A for (i = 0; ss[i] != NULL; i++) {
2N/A if ((rc = kmfber_put_string(ber, ss[i],
2N/A ber->ber_tag)) == -1)
2N/A break;
2N/A }
2N/A break;
2N/A
2N/A case 'V': /* sequences of strings + lengths */
2N/A if ((bv = va_arg(ap, struct berval **)) == NULL)
2N/A break;
2N/A for (i = 0; bv[i] != NULL; i++) {
2N/A if ((rc = kmfber_put_ostring(ber, bv[i]->bv_val,
2N/A bv[i]->bv_len, ber->ber_tag)) == -1)
2N/A break;
2N/A }
2N/A break;
2N/A
2N/A case '{': /* begin sequence */
2N/A rc = kmfber_start_seq(ber, ber->ber_tag);
2N/A break;
2N/A
2N/A case '}': /* end sequence */
2N/A rc = ber_put_seqorset(ber);
2N/A break;
2N/A
2N/A case '[': /* begin set */
2N/A rc = kmfber_start_set(ber, ber->ber_tag);
2N/A break;
2N/A
2N/A case ']': /* end set */
2N/A rc = ber_put_seqorset(ber);
2N/A break;
2N/A
2N/A default: {
2N/A#ifdef KMFBER_DEBUG
2N/A char msg[80];
2N/A sprintf(msg, "unknown fmt %c\n", *fmt);
2N/A ber_err_print(msg);
2N/A#endif
2N/A rc = -1;
2N/A break;
2N/A }
2N/A }
2N/A
2N/A if (ber->ber_usertag == 0)
2N/A ber->ber_tag = KMFBER_DEFAULT;
2N/A else
2N/A ber->ber_usertag = 0;
2N/A }
2N/A
2N/A va_end(ap);
2N/A
2N/A return (rc);
2N/A}