-
Notifications
You must be signed in to change notification settings - Fork 0
/
asn1fix_constr.c
517 lines (440 loc) · 11.4 KB
/
asn1fix_constr.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
#include "asn1fix_internal.h"
static int _asn1f_check_if_tag_must_be_explicit(arg_t *arg, asn1p_expr_t *v);
static int _asn1f_compare_tags(arg_t *arg, asn1p_expr_t *a, asn1p_expr_t *b);
static int _asn1f_fix_type_tag(arg_t *arg, asn1p_expr_t *expr);
int
asn1f_pull_components_of(arg_t *arg) {
TQ_HEAD(asn1p_expr_t) list;
asn1p_expr_t *expr = arg->expr;
asn1p_expr_t *memb;
int r_value = 0;
switch(expr->expr_type) {
case ASN_CONSTR_SEQUENCE:
case ASN_CONSTR_SET:
break;
default:
return 0;
}
TQ_INIT(&list);
/*
* Look into
*/
while((memb = TQ_REMOVE(&(expr->members), next))) {
asn1p_expr_t *coft; /* COMPONENTS OF thing itself */
asn1p_expr_t *terminal; /* Terminal of the referenced type */
if(memb->expr_type != A1TC_COMPONENTS_OF) {
TQ_ADD(&list, memb, next);
continue;
}
coft = TQ_FIRST(&memb->members);
assert(coft);
assert(!TQ_NEXT(coft, next));
/*
* Find the referenced type.
*/
terminal = asn1f_find_terminal_type(arg, coft);
if(!terminal || (terminal->expr_type != expr->expr_type)) {
FATAL("COMPONENTS OF at line %d "
"must reference a %s type",
coft->_lineno,
expr->expr_type==ASN_CONSTR_SET
? "SET" : "SEQUENCE"
);
TQ_ADD(&list, memb, next);
r_value = -1;
continue;
}
/*
* Clone the final structure.
*/
coft = asn1p_expr_clone(terminal, 1 /* Skip extensions */);
if(!coft) return -1; /* ENOMEM */
if(0) {
asn1p_expr_free(memb); /* Don't need it anymore*/
} else {
/* Actual removal clashes with constraints... skip. */
}
/*
* Move all components of the cloned structure
* into the current one.
*/
while((memb = TQ_REMOVE(&(coft->members), next))) {
TQ_ADD(&list, memb, next);
memb->parent_expr = expr;
}
asn1p_expr_free(coft); /* Remove wrapper */
}
/* Move the stuff back */
TQ_MOVE(&(expr->members), &list);
return r_value;
}
/*
* Fix extensibility parts inside constructed types (SEQUENCE, SET, CHOICE).
*/
int
asn1f_fix_constr_ext(arg_t *arg) {
asn1p_expr_t *expr = arg->expr;
asn1p_expr_t *v;
TQ_HEAD(asn1p_expr_t) root_list;
TQ_HEAD(asn1p_expr_t) ext_list;
TQ_HEAD(asn1p_expr_t) *cur_list;
int r_value = 0;
int ext_count = 0;
switch(expr->expr_type) {
case ASN_CONSTR_SEQUENCE:
case ASN_CONSTR_SET:
case ASN_CONSTR_CHOICE:
break;
default:
return 0;
}
DEBUG("(%s) for line %d", expr->Identifier, expr->_lineno);
TQ_INIT(&root_list);
TQ_INIT(&ext_list);
cur_list = (void *)&root_list;
/*
* Split the set of fields into two lists, the root list
* and the extensions list.
*/
while((v = TQ_REMOVE(&(expr->members), next))) {
if(v->expr_type == A1TC_EXTENSIBLE) {
ext_count++;
switch(ext_count) {
case 1: cur_list = (void *)&ext_list; break;
case 2:
cur_list = (void *)&root_list;
if(v->value) {
FATAL("Optional extension marker "
"must not contain "
"an exception mark "
"at line %d", v->_lineno);
r_value = -1;
}
asn1p_expr_free(v);
continue;
case 3:
FATAL("Third extension marker "
"is not allowed at line %d", v->_lineno);
default:
r_value = -1;
}
}
TQ_ADD(cur_list, v, next);
}
/*
* Copy the root list and extension list back into the main list.
*/
TQ_MOVE(&(expr->members), &root_list);
while((v = TQ_REMOVE(&ext_list, next)))
TQ_ADD(&(expr->members), v, next);
if(arg->mod->module_flags & MSF_EXTENSIBILITY_IMPLIED
&& ext_count == 0) {
v = asn1p_expr_new(0, arg->mod);
if(v) {
v->Identifier = strdup("...");
v->expr_type = A1TC_EXTENSIBLE;
v->meta_type = AMT_TYPE;
v->_lineno = expr->_lineno; /* The best we can do */
if(v->Identifier == NULL) {
asn1p_expr_free(v);
r_value = -1;
} else {
asn1p_expr_add(expr, v);
}
} else {
r_value = -1;
}
}
return r_value;
}
int
asn1f_fix_constr_tag(arg_t *arg, int fix_top_level) {
asn1p_expr_t *expr = arg->expr;
asn1p_expr_t *v;
int root_tagged = 0; /* The root component is manually tagged */
int ext_tagged = 0; /* The extensions are manually tagged */
int component_number = 0;
int r_value = 0;
DEBUG("(%s) for line %d", expr->Identifier, expr->_lineno);
/*
* Fix the top-level type itself first.
*/
if(fix_top_level) {
if(expr->tag.tag_class == TC_NOCLASS)
return r_value;
if(_asn1f_fix_type_tag(arg, expr))
r_value = -1;
return r_value;
}
switch(expr->expr_type) {
case ASN_CONSTR_SEQUENCE:
case ASN_CONSTR_SET:
case ASN_CONSTR_CHOICE:
break;
default:
return 0;
}
TQ_FOR(v, &(expr->members), next) {
if(v->expr_type == A1TC_EXTENSIBLE) {
component_number++;
continue;
}
if(v->tag.tag_class == TC_NOCLASS) {
continue;
}
switch(component_number) {
case 0: case 2:
root_tagged = 1; break;
default:
ext_tagged = 1; break;
}
if(_asn1f_fix_type_tag(arg, v))
r_value = -1;
}
if((arg->mod->module_flags & MSF_AUTOMATIC_TAGS)
&& !root_tagged) {
if(ext_tagged) {
/* X.690: 28.4 */
FATAL("In %s at line %d: "
"extensions are tagged "
"but root components are not",
expr->Identifier, expr->_lineno);
r_value = -1;
} else {
/* Make a decision on automatic tagging */
expr->auto_tags_OK = 1;
}
}
return r_value;
}
static int
_asn1f_fix_type_tag(arg_t *arg, asn1p_expr_t *expr) {
int must_explicit = _asn1f_check_if_tag_must_be_explicit(arg, expr);
int module_impl_tags = (arg->mod->module_flags
& (MSF_IMPLICIT_TAGS | MSF_AUTOMATIC_TAGS));
int r_value = 0;
if(expr->tag.tag_mode == TM_DEFAULT) {
if(must_explicit || module_impl_tags == 0)
expr->tag.tag_mode = TM_EXPLICIT;
else
expr->tag.tag_mode = TM_IMPLICIT;
}
/*
* Perform a final sanity check.
*/
if(must_explicit) {
if(expr->tag.tag_mode == TM_IMPLICIT) {
FATAL("%s tagged in IMPLICIT mode "
"but must be EXPLICIT at line %d",
expr->Identifier, expr->_lineno);
r_value = -1;
} else {
expr->tag.tag_mode = TM_EXPLICIT;
}
}
return r_value;
}
int
asn1f_fix_constr_autotag(arg_t *arg) {
asn1p_expr_t *expr = arg->expr;
asn1p_expr_t *v;
asn1c_integer_t tag_value = 0;
int r_value = 0;
switch(expr->expr_type) {
case ASN_CONSTR_SEQUENCE:
case ASN_CONSTR_SET:
case ASN_CONSTR_CHOICE:
if(expr->auto_tags_OK)
break;
/* Automatic tagging is not applicable */
/* Fall through */
default:
return 0;
}
DEBUG("(%s) for line %d", expr->Identifier, expr->_lineno);
TQ_FOR(v, &(expr->members), next) {
int must_explicit;
if(v->expr_type == A1TC_EXTENSIBLE) {
/* 28.5, d) */
continue;
}
if(0) {
/* This may be not true in case COMPONENTS OF */
assert(v->tag.tag_class == TC_NOCLASS);
}
must_explicit = _asn1f_check_if_tag_must_be_explicit(arg, v);
v->tag.tag_class = TC_CONTEXT_SPECIFIC;
v->tag.tag_mode = must_explicit ? TM_EXPLICIT : TM_IMPLICIT;
v->tag.tag_value = tag_value++;
}
return r_value;
}
/*
* Check that tags are distinct.
*/
int
asn1f_check_constr_tags_distinct(arg_t *arg) {
asn1p_expr_t *expr = arg->expr;
asn1p_expr_t *v;
int r_value = 0;
switch(expr->expr_type) {
case ASN_CONSTR_SEQUENCE:
case ASN_CONSTR_SET:
case ASN_CONSTR_CHOICE:
break;
default:
return 0;
}
TQ_FOR(v, &(expr->members), next) {
/*
* In every series of non-mandatory components,
* the tags must be distinct from each other AND the
* tag of the following mandatory component.
* For SET and CHOICE treat everything as a big set of
* non-mandatory components.
*/
if(expr->expr_type != ASN_CONSTR_SEQUENCE || v->marker.flags) {
asn1p_expr_t *nv;
for(nv = v; (nv = TQ_NEXT(nv, next));) {
DEBUG("S/C comparing tags %s s. %s",
v->Identifier, nv->Identifier);
if(_asn1f_compare_tags(arg, v, nv))
r_value = -1;
if(expr->expr_type == ASN_CONSTR_SEQUENCE
&& !nv->marker.flags) break;
}
}
}
return r_value;
}
static int
_asn1f_check_if_tag_must_be_explicit(arg_t *arg, asn1p_expr_t *v) {
struct asn1p_type_tag_s tag;
struct asn1p_type_tag_s save_tag;
asn1p_expr_t *reft;
int ret;
/*
* Fetch the _next_ tag for this type.
*/
save_tag = v->tag; /* Save existing tag */
memset(&v->tag, 0, sizeof(v->tag)); /* Remove it temporarily */
ret = asn1f_fetch_outmost_tag(arg->asn, arg->mod, v, &tag, 0);
v->tag = save_tag; /* Restore the tag back */
if(ret == 0) return 0; /* If found tag, it's okay */
reft = asn1f_find_terminal_type(arg, v);
if(reft) {
switch(reft->expr_type) {
case ASN_TYPE_ANY:
case ASN_CONSTR_CHOICE:
return 1;
default:
return 0;
}
}
return 0;
}
/*
* Check that the tags are distinct.
*/
static int
_asn1f_compare_tags(arg_t *arg, asn1p_expr_t *a, asn1p_expr_t *b) {
struct asn1p_type_tag_s ta, tb;
int ra, rb;
int ret;
ra = asn1f_fetch_outmost_tag(arg->asn, arg->mod, a,
&ta, AFT_IMAGINARY_ANY);
rb = asn1f_fetch_outmost_tag(arg->asn, arg->mod, b,
&tb, AFT_IMAGINARY_ANY);
/*
* If both tags are explicitly or implicitly given, use them.
*/
DEBUG("Fetching outmost tags: %d, %d", ra, rb);
if(ra == 0 && rb == 0) {
/*
* Simple case: fetched both tags.
*/
if((ta.tag_value == tb.tag_value
&& ta.tag_class == tb.tag_class)
|| ta.tag_value == -1 /* Spread IMAGINARY ANY tag... */
|| tb.tag_value == -1 /* ...it is an evil virus, fear it! */
) {
char tagbuf[2][TAG2STRING_BUFFER_SIZE];
char *p = (a->expr_type == A1TC_EXTENSIBLE)
?"potentially ":"";
FATAL("Processing %s at line %d: component \"%s\" at line %d %shas the same tag "
"as component \"%s\" at line %d",
arg->expr->Identifier,
arg->expr->_lineno,
a->Identifier,
a->_lineno,
p,
b->Identifier,
b->_lineno
);
FATAL("Consider adding AUTOMATIC TAGS "
"after module %s DEFINITIONS, "
"or manually tag components",
arg->expr->module->ModuleName);
DEBUG("Tags: %s %s vs. %s %s",
asn1p_tag2string(&ta, tagbuf[0]),
a->Identifier,
asn1p_tag2string(&tb, tagbuf[1]),
b->Identifier
);
if((arg->mod->module_flags & MSF_EXTENSIBILITY_IMPLIED)
&& (a->expr_type == A1TC_EXTENSIBLE)
&& (b->expr_type == A1TC_EXTENSIBLE)) {
FATAL("The previous error is due to "
"improper use of "
"EXTENSIBILITY IMPLIED flag "
"of module %s",
arg->mod->ModuleName);
}
return -1;
} else {
/* Tags are distinct */
return 0;
}
}
/**********************************************************
* Now we must perform some very funny recursion to check
* multiple components of CHOICE type, etc.
*/
DEBUG("Comparing tags %s:%x <-> %s:%x",
a->Identifier, a->expr_type,
b->Identifier, b->expr_type);
if(ra && a->meta_type == AMT_TYPEREF) {
DEBUG(" %s is a type reference", a->Identifier);
a = asn1f_lookup_symbol(arg,
a->module, a->rhs_pspecs, a->reference);
if(!a) return 0; /* Already FATAL()'ed somewhere else */
WITH_MODULE(a->module, ret = _asn1f_compare_tags(arg, a, b));
return ret;
}
if(ra && a->expr_type == ASN_CONSTR_CHOICE) {
asn1p_expr_t *v;
DEBUG(" %s is a choice type (%d)", a->Identifier, a->_mark);
/*
* Iterate over members of CHOICE.
*/
//if(a->_mark & TM_RECURSION) return 0;
TQ_FOR(v, &(a->members), next) {
//a->_mark |= TM_RECURSION;
ret = _asn1f_compare_tags(arg, v, b);
//a->_mark &= ~TM_RECURSION;
if(ret) return ret;
}
return 0;
}
if(rb && b->expr_type == ASN_CONSTR_CHOICE) {
return _asn1f_compare_tags(arg, b, a);
}
if(a->_mark & TM_RECURSION) return 0;
if(b->_mark & TM_RECURSION) return 0;
a->_mark |= TM_RECURSION;
b->_mark |= TM_RECURSION;
ret = _asn1f_compare_tags(arg, b, a);
a->_mark &= ~TM_RECURSION;
b->_mark &= ~TM_RECURSION;
return ret;
}