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