X-Git-Url: http://git.indexdata.com/?a=blobdiff_plain;ds=sidebyside;f=odr%2Fber_any.c;h=376d121222af8d3bf998a783566029b644100dc2;hb=99837f06c78dde81614bab9a3a58c005b004338d;hp=8c661f0655b1dec35310c11a6c3d797ebb9010ce;hpb=10981b2f116449523a9f628c20a78212ce91553e;p=yaz-moved-to-github.git diff --git a/odr/ber_any.c b/odr/ber_any.c index 8c661f0..376d121 100644 --- a/odr/ber_any.c +++ b/odr/ber_any.c @@ -1,77 +1,152 @@ /* - * Copyright (C) 1994, Index Data I/S - * All rights reserved. - * Sebastian Hammer, Adam Dickmeiss - * - * $Log: ber_any.c,v $ - * Revision 1.1 1995-02-09 15:51:45 quinn - * Works better now. + * Copyright (c) 1995-2003, Index Data + * See the file LICENSE for details. * + * $Id: ber_any.c,v 1.26 2003-10-20 13:44:05 adam Exp $ */ +#if HAVE_CONFIG_H +#include +#endif -#include +#include +#include "odr-priv.h" int ber_any(ODR o, Odr_any **p) { int res; - + switch (o->direction) { - case ODR_DECODE: - if ((res = completeBER(o->bp, o->left)) <= 0) - return 0; - (*p)->buf = nalloc(o, res); - memcpy((*p)->buf, o->bp, res); - (*p)->len = (*p)->size = res; - o->bp += res; - o->left -= res; - return 1; - case ODR_ENCODE: - if ((*p)->len > o->left) - return 0; - memcpy(o->bp , (*p)->buf, (*p)->len); - o->bp += (*p)->len; - o->left -= (*p)->len; - return 1; - default: return 0; + case ODR_DECODE: + if ((res = completeBER(o->bp, odr_max(o))) <= 0) /* FIX THIS */ + { + odr_seterror(o, OPROTO, 2); + return 0; + } + (*p)->buf = (unsigned char *)odr_malloc(o, res); + memcpy((*p)->buf, o->bp, res); + (*p)->len = (*p)->size = res; + o->bp += res; + return 1; + case ODR_ENCODE: + if (odr_write(o, (*p)->buf, (*p)->len) < 0) + return 0; + return 1; + default: odr_seterror(o, OOTHER, 3); return 0; } } +#define BER_ANY_DEBUG 0 + /* - * Return length of BER-package or -1. + * Return length of BER-package or 0. */ -int completeBER(unsigned char *buf, int len) +int completeBER_n(const unsigned char *buf, int len, int level) { - int res, ll, class, tag, cons; - unsigned char *b = buf; + int res, ll, zclass, tag, cons; + const unsigned char *b = buf; + int bad = 0; + if (len > 5000000 || level > 1000) + { + bad = 1; +#if BER_ANY_DEBUG + yaz_log(LOG_LOG, "completeBER lev=%d len=%d", level, len); +#endif + if (level > 1000) + return -2; + } + if (!len) + return 0; if (!buf[0] && !buf[1]) - return -1; - if ((res = ber_dectag(b, &class, &tag, &cons)) <= 0) return 0; + if ((res = ber_dectag(b, &zclass, &tag, &cons, len)) <= 0) + return 0; +#if 0 +/* removed, since ber_dectag never reads that far .. */ if (res > len) - return -1; + return 0; +#endif b += res; len -= res; - if ((res = ber_declen(b, &ll)) <= 0) - return -1; + assert (len >= 0); + res = ber_declen(b, &ll, len); + if (res == -2) + { +#if BER_ANY_DEBUG + if (bad) + yaz_log(LOG_LOG, "<<<<<<<<< return1 lev=%d res=%d", level, res); +#endif + return -1; /* error */ + } + if (res == -1) + { +#if BER_ANY_DEBUG + if (bad) + yaz_log(LOG_LOG, "<<<<<<<<< return3 lev=%d res=-1", level); +#endif + return 0; /* incomplete length */ + } + if (ll > 5000000) + { +#if BER_ANY_DEBUG + if (bad) + yaz_log(LOG_LOG, "<<<<<<<<< return2 lev=%d len=%d res=%d ll=%d", + level, len, res, ll); +#endif + return -1; /* error */ + } +#if 0 +/* no longer necessary, since ber_declen never reads that far (returns -1) */ if (res > len) - return -1; + { + if (bad) + yaz_log(LOG_LOG, "<<<<<<<<< return4 lev=%d res=%d len=%d", + level, res, len); + return 0; + } +#endif b += res; len -= res; if (ll >= 0) - return (len >= ll ? len + (b-buf) : -1); + { /* definite length */ +#if BER_ANY_DEBUG + if (bad && len < ll) + yaz_log(LOG_LOG, "<<<<<<<<< return5 lev=%d len=%d ll=%d", + level, len, ll); +#endif + return (len >= ll ? ll + (b-buf) : 0); + } + /* indefinite length */ if (!cons) - return -1; - while (1) + { /* if primitive, it's an error */ +#if BER_ANY_DEBUG + yaz_log(LOG_LOG, "<<<<<<<<< return6 lev=%d ll=%d len=%d res=%d", + level, ll, len, res); +#endif + return -1; /* error */ + } + /* constructed - cycle through children */ + while (len >= 2) { - if ((res = completeBER(b, len)) < 0) + if (*b == 0 && *(b + 1) == 0) + break; + if (!(res = completeBER_n(b, len, level+1))) + return 0; + if (res == -1) return -1; b += res; len -= res; - if (len < 2) - return -1; - if (*b == 0 && *(b + 1) == 0) - return (b - buf) + 2; } + if (len < 2) + return 0; + return (b - buf) + 2; +} + +int completeBER(const unsigned char *buf, int len) +{ + int res = completeBER_n(buf, len, 0); + if (res < 0) + return len; + return res; }