/*
*
* Copyright 1994, 2003 by the Massachusetts Institute of Technology.
* All Rights Reserved.
*
* Export of this software from the United States of America may
* require a specific license from the United States Government.
* It is the responsibility of any person or organization contemplating
* export to obtain such a license before exporting.
*
* WITHIN THAT CONSTRAINT, permission to use, copy, modify, and
* distribute this software and its documentation for any purpose and
* without fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright notice and
* this permission notice appear in supporting documentation, and that
* the name of M.I.T. not be used in advertising or publicity pertaining
* to distribution of the software without specific, written prior
* permission. Furthermore if you modify this software you must label
* your software as modified software and not distribute it in such a
* fashion that it might be confused with the original M.I.T. software.
* M.I.T. makes no representations about the suitability of
* this software for any purpose. It is provided "as is" without express
* or implied warranty.
*/
/* ASN.1 primitive decoders */
#include "asn1_decode.h"
#include "asn1_get.h"
#include <stdio.h>
#ifdef HAVE_SYS_TIME_H
#ifdef TIME_WITH_SYS_TIME
#include <time.h>
#endif
#else
#include <time.h>
#endif
#define setup()\
return ASN1_BAD_ID
#define cleanup()\
return 0
{
setup();
asn1_octet o;
long n = 0; /* initialize to keep gcc happy */
int i;
for (i = 0; i < length; i++) {
if (!i) {
n = (0x80 & o) ? -1 : 0; /* grab sign bit */
if (n < 0 && length > sizeof (long))
return ASN1_OVERFLOW;
return ASN1_OVERFLOW;
}
n = (n << 8) | o;
}
*val = n;
cleanup();
}
{
setup();
asn1_octet o;
unsigned long n;
int i;
for (i = 0, n = 0; i < length; i++) {
if (!i) {
if (0x80 & o)
return ASN1_OVERFLOW;
else if (length > sizeof (long) + 1)
return ASN1_OVERFLOW;
}
n = (n << 8) | o;
}
*val = n;
cleanup();
}
/*
* asn1_decode_maybe_unsigned
*
* This is needed because older releases of MIT krb5 have signed
* sequence numbers. We want to accept both signed and unsigned
* sequence numbers, in the range -2^31..2^32-1, mapping negative
* numbers into their positive equivalents in the same way that C's
* normal integer conversions do, i.e., would preserve bits on a
* two's-complement architecture.
*/
{
setup();
asn1_octet o;
unsigned long n, bitsremain;
unsigned int i;
o = 0;
n = 0;
bitsremain = ~0UL;
for (i = 0; i < length; i++) {
/* Accounts for u_long width not being a multiple of 8. */
if (bitsremain == ~0UL) {
if (i == 0)
/*
* Skip leading zero or 0xFF octets to humor non-compliant encoders.
*/
if (n == 0 && o == 0)
continue;
if (n == ~0UL && o == 0xff)
continue;
}
n = (n << 8) | o;
bitsremain >>= 8;
}
*val = n;
cleanup();
}
{
setup();
cleanup();
}
{
setup();
cleanup();
}
{
setup();
cleanup();
}
{
setup();
cleanup();
}
{
setup();
if(length != 0) return ASN1_BAD_LENGTH;
cleanup();
}
{
setup();
cleanup();
}
{
setup();
cleanup();
}
{
setup();
char *s;
time_t t;
/* Time encoding: YYYYMMDDhhmmssZ */
if(s[14] != 'Z') {
free(s);
return ASN1_BAD_FORMAT;
}
t = 0;
free(s);
goto done;
}
- 1900;
t = krb5int_gmt_mktime(&ts);
free(s);
if(t == -1) return ASN1_BAD_TIMEFORMAT;
done:
*val = t;
cleanup();
}