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