2 * Copyright (c) 1995-1999, Index Data
3 * See the file LICENSE for details.
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.16 1999-11-30 13:47:11 adam
8 * Improved installation. Moved header files to include/yaz.
10 * Revision 1.15 1999/01/08 11:23:20 adam
11 * Added const modifier to some of the BER/ODR encoding routines.
13 * Revision 1.14 1998/02/11 11:53:34 adam
14 * Changed code so that it compiles as C++.
16 * Revision 1.13 1997/05/14 06:53:56 adam
19 * Revision 1.12 1995/09/29 17:12:15 quinn
22 * Revision 1.11 1995/09/27 15:02:54 quinn
23 * Modified function heads & prototypes.
25 * Revision 1.10 1995/05/16 08:50:42 quinn
26 * License, documentation, and memory fixes
28 * Revision 1.9 1995/04/18 08:15:12 quinn
29 * Added dynamic memory allocation on encoding (whew). Code is now somewhat
30 * neater. We'll make the same change for decoding one day.
32 * Revision 1.8 1995/04/17 09:37:42 quinn
33 * *** empty log message ***
35 * Revision 1.7 1995/03/17 10:17:39 quinn
36 * Added memory management.
38 * Revision 1.6 1995/03/08 12:12:02 quinn
39 * Added better error checking.
41 * Revision 1.5 1995/02/14 20:39:54 quinn
42 * Fixed bugs in completeBER and (serious one in) ber_oid.
44 * Revision 1.4 1995/02/14 11:54:33 quinn
47 * Revision 1.3 1995/02/10 18:57:24 quinn
48 * More in the way of error-checking.
50 * Revision 1.2 1995/02/10 15:55:28 quinn
53 * Revision 1.1 1995/02/09 15:51:45 quinn
60 int ber_any(ODR o, Odr_any **p)
67 if ((res = completeBER(o->bp, o->left)) <= 0) /* FIX THIS */
72 (*p)->buf = (unsigned char *)odr_malloc(o, res);
73 memcpy((*p)->buf, o->bp, res);
74 (*p)->len = (*p)->size = res;
79 if (odr_write(o, (*p)->buf, (*p)->len) < 0)
82 default: o->error = OOTHER; return 0;
87 * Return length of BER-package or 0.
89 int completeBER(const unsigned char *buf, int len)
91 int res, ll, zclass, tag, cons;
92 const unsigned char *b = buf;
96 if (!buf[0] && !buf[1])
98 if ((res = ber_dectag(b, &zclass, &tag, &cons)) <= 0)
104 if ((res = ber_declen(b, &ll)) <= 0)
111 return (len >= ll ? ll + (b-buf) : 0);
114 /* constructed - cycle through children */
117 if (*b == 0 && *(b + 1) == 0)
119 if (!(res = completeBER(b, len)))
126 return (b - buf) + 2;