2 * Copyright (C) 1994, Index Data I/S
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.8 1995-03-15 11:18:04 quinn
8 * Fixed serious bug in odr_cons
10 * Revision 1.7 1995/03/10 11:44:41 quinn
11 * Fixed serious stack-bug in odr_cons_begin
13 * Revision 1.6 1995/03/08 12:12:23 quinn
14 * Added better error checking.
16 * Revision 1.5 1995/02/10 18:57:25 quinn
17 * More in the way of error-checking.
19 * Revision 1.4 1995/02/10 15:55:29 quinn
22 * Revision 1.3 1995/02/09 15:51:48 quinn
25 * Revision 1.2 1995/02/07 17:52:59 quinn
26 * A damn mess, but now things work, I think.
28 * Revision 1.1 1995/02/02 16:21:53 quinn
35 int odr_constructed_begin(ODR o, void *p, int class, int tag)
47 if ((res = ber_tag(o, p, o->t_class, o->t_tag, &cons, 1)) < 0)
52 if (o->stackp == ODR_MAX_STACK - 1)
57 o->stack[++(o->stackp)].lenb = o->bp;
59 fprintf(stderr, "[cons_begin(%d)]", o->stackp);
61 if (o->direction == ODR_ENCODE || o->direction == ODR_PRINT)
63 o->stack[o->stackp].lenlen = 1;
67 else if (o->direction == ODR_DECODE)
69 if ((res = ber_declen(o->bp, &o->stack[o->stackp].len)) < 0)
71 o->stack[o->stackp].lenlen = res;
77 o->stack[o->stackp].base = o->bp;
81 int odr_constructed_more(ODR o)
87 if (o->stack[o->stackp].len >= 0)
88 return o->bp - o->stack[o->stackp].base < o->stack[o->stackp].len;
90 return (!(*o->bp == 0 && *(o->bp + 1) == 0));
93 int odr_constructed_end(ODR o)
104 switch (o->direction)
107 if (o->stack[o->stackp].len < 0)
109 if (*o->bp++ == 0 && *(o->bp++) == 0)
121 else if (o->bp - o->stack[o->stackp].base !=
122 o->stack[o->stackp].len)
130 if ((res = ber_enclen(o->stack[o->stackp].lenb,
131 o->bp - o->stack[o->stackp].base,
132 o->stack[o->stackp].lenlen, 1)) < 0)
137 if (res == 0) /* indefinite encoding */
140 fprintf(stderr, "[cons_end(%d): indefinite]", o->stackp);
149 fprintf(stderr, "[cons_end(%d): definite]", o->stackp);
154 case ODR_PRINT: return 1;