2 * Copyright (c) 1995, Index Data
3 * See the file LICENSE for details.
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.10 1995-05-16 08:50:42 quinn
8 * License, documentation, and memory fixes
10 * Revision 1.9 1995/04/18 08:15:12 quinn
11 * Added dynamic memory allocation on encoding (whew). Code is now somewhat
12 * neater. We'll make the same change for decoding one day.
14 * Revision 1.8 1995/04/17 09:37:42 quinn
15 * *** empty log message ***
17 * Revision 1.7 1995/03/17 10:17:39 quinn
18 * Added memory management.
20 * Revision 1.6 1995/03/08 12:12:02 quinn
21 * Added better error checking.
23 * Revision 1.5 1995/02/14 20:39:54 quinn
24 * Fixed bugs in completeBER and (serious one in) ber_oid.
26 * Revision 1.4 1995/02/14 11:54:33 quinn
29 * Revision 1.3 1995/02/10 18:57:24 quinn
30 * More in the way of error-checking.
32 * Revision 1.2 1995/02/10 15:55:28 quinn
35 * Revision 1.1 1995/02/09 15:51:45 quinn
42 int ber_any(ODR o, Odr_any **p)
49 if ((res = completeBER(o->bp, o->left)) <= 0) /* FIX THIS */
54 (*p)->buf = odr_malloc(o, res);
55 memcpy((*p)->buf, o->bp, res);
56 (*p)->len = (*p)->size = res;
61 if (odr_write(o, (*p)->buf, (*p)->len) < 0)
64 default: o->error = OOTHER; return 0;
69 * Return length of BER-package or 0.
71 int completeBER(unsigned char *buf, int len)
73 int res, ll, class, tag, cons;
74 unsigned char *b = buf;
78 if (!buf[0] && !buf[1])
80 if ((res = ber_dectag(b, &class, &tag, &cons)) <= 0)
86 if ((res = ber_declen(b, &ll)) <= 0)
93 return (len >= ll ? ll + (b-buf) : 0);
96 /* constructed - cycle through children */
99 if (*b == 0 && *(b + 1) == 0)
101 if (!(res = completeBER(b, len)))
108 return (b - buf) + 2;