xref: /netbsd-src/crypto/external/bsd/heimdal/dist/lib/asn1/gen_seq.c (revision d3273b5b76f5afaafe308cead5511dbb8df8c5e9)
1 /*	$NetBSD: gen_seq.c,v 1.2 2017/01/28 21:31:45 christos Exp $	*/
2 
3 /*
4  * Copyright (c) 1997 - 2006 Kungliga Tekniska Högskolan
5  * (Royal Institute of Technology, Stockholm, Sweden).
6  * All rights reserved.
7  *
8  * Redistribution and use in source and binary forms, with or without
9  * modification, are permitted provided that the following conditions
10  * are met:
11  *
12  * 1. Redistributions of source code must retain the above copyright
13  *    notice, this list of conditions and the following disclaimer.
14  *
15  * 2. Redistributions in binary form must reproduce the above copyright
16  *    notice, this list of conditions and the following disclaimer in the
17  *    documentation and/or other materials provided with the distribution.
18  *
19  * 3. Neither the name of the Institute nor the names of its contributors
20  *    may be used to endorse or promote products derived from this software
21  *    without specific prior written permission.
22  *
23  * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
24  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26  * ARE DISCLAIMED.  IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
27  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33  * SUCH DAMAGE.
34  */
35 
36 #include "gen_locl.h"
37 
38 __RCSID("$NetBSD: gen_seq.c,v 1.2 2017/01/28 21:31:45 christos Exp $");
39 
40 void
generate_type_seq(const Symbol * s)41 generate_type_seq (const Symbol *s)
42 {
43     char *subname;
44     Type *type;
45 
46     if (!seq_type(s->name))
47 	return;
48     type = s->type;
49     while(type->type == TTag)
50 	type = type->subtype;
51 
52     if (type->type != TSequenceOf && type->type != TSetOf) {
53 	fprintf(stderr, "%s not seq of %d\n", s->name, (int)type->type);
54 	return;
55     }
56 
57     /*
58      * Require the subtype to be a type so we can name it and use
59      * copy_/free_
60      */
61 
62     if (type->subtype->type != TType) {
63 	fprintf(stderr, "%s subtype is not a type, can't generate "
64 	       "sequence code for this case: %d\n",
65 		s->name, (int)type->subtype->type);
66 	exit(1);
67     }
68 
69     subname = type->subtype->symbol->gen_name;
70 
71     fprintf (headerfile,
72 	     "ASN1EXP int   ASN1CALL add_%s  (%s *, const %s *);\n"
73 	     "ASN1EXP int   ASN1CALL remove_%s  (%s *, unsigned int);\n",
74 	     s->gen_name, s->gen_name, subname,
75 	     s->gen_name, s->gen_name);
76 
77     fprintf (codefile, "int ASN1CALL\n"
78 	     "add_%s(%s *data, const %s *element)\n"
79 	     "{\n",
80 	     s->gen_name, s->gen_name, subname);
81 
82     fprintf (codefile,
83 	     "int ret;\n"
84 	     "void *ptr;\n"
85 	     "\n"
86 	     "ptr = realloc(data->val, \n"
87 	     "\t(data->len + 1) * sizeof(data->val[0]));\n"
88 	     "if (ptr == NULL) return ENOMEM;\n"
89 	     "data->val = ptr;\n\n"
90 	     "ret = copy_%s(element, &data->val[data->len]);\n"
91 	     "if (ret) return ret;\n"
92 	     "data->len++;\n"
93 	     "return 0;\n",
94 	     subname);
95 
96     fprintf (codefile, "}\n\n");
97 
98     fprintf (codefile, "int ASN1CALL\n"
99 	     "remove_%s(%s *data, unsigned int element)\n"
100 	     "{\n",
101 	     s->gen_name, s->gen_name);
102 
103     fprintf (codefile,
104 	     "void *ptr;\n"
105 	     "\n"
106 	     "if (data->len == 0 || element >= data->len)\n"
107 	     "\treturn ASN1_OVERRUN;\n"
108 	     "free_%s(&data->val[element]);\n"
109 	     "data->len--;\n"
110 	     /* don't move if its the last element */
111 	     "if (element < data->len)\n"
112 	     "\tmemmove(&data->val[element], &data->val[element + 1], \n"
113 	     "\t\tsizeof(data->val[0]) * (data->len - element));\n"
114 	     /* resize but don't care about failures since it doesn't matter */
115 	     "ptr = realloc(data->val, data->len * sizeof(data->val[0]));\n"
116 	     "if (ptr != NULL || data->len == 0) data->val = ptr;\n"
117 	     "return 0;\n",
118 	     subname);
119 
120     fprintf (codefile, "}\n\n");
121 }
122