2 * Copyright (C) 1994, Index Data I/S
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.9 1995-04-18 08:15:12 quinn
8 * Added dynamic memory allocation on encoding (whew). Code is now somewhat
9 * neater. We'll make the same change for decoding one day.
11 * Revision 1.8 1995/04/17 09:37:42 quinn
12 * *** empty log message ***
14 * Revision 1.7 1995/03/17 10:17:39 quinn
15 * Added memory management.
17 * Revision 1.6 1995/03/08 12:12:02 quinn
18 * Added better error checking.
20 * Revision 1.5 1995/02/14 20:39:54 quinn
21 * Fixed bugs in completeBER and (serious one in) ber_oid.
23 * Revision 1.4 1995/02/14 11:54:33 quinn
26 * Revision 1.3 1995/02/10 18:57:24 quinn
27 * More in the way of error-checking.
29 * Revision 1.2 1995/02/10 15:55:28 quinn
32 * Revision 1.1 1995/02/09 15:51:45 quinn
39 int ber_any(ODR o, Odr_any **p)
46 if ((res = completeBER(o->bp, o->left)) <= 0) /* FIX THIS */
51 (*p)->buf = odr_malloc(o, res);
52 memcpy((*p)->buf, o->bp, res);
53 (*p)->len = (*p)->size = res;
58 if (odr_write(o, (*p)->buf, (*p)->len) < 0)
61 default: o->error = OOTHER; return 0;
66 * Return length of BER-package or 0.
68 int completeBER(unsigned char *buf, int len)
70 int res, ll, class, tag, cons;
71 unsigned char *b = buf;
75 if (!buf[0] && !buf[1])
77 if ((res = ber_dectag(b, &class, &tag, &cons)) <= 0)
83 if ((res = ber_declen(b, &ll)) <= 0)
90 return (len >= ll ? ll + (b-buf) : 0);
93 /* constructed - cycle through children */
96 if (*b == 0 && *(b + 1) == 0)
98 if (!(res = completeBER(b, len)))
105 return (b - buf) + 2;