aboutsummaryrefslogtreecommitdiffstats
path: root/asn1c
diff options
context:
space:
mode:
authorLev Walkin <vlm@lionet.info>2013-03-24 03:28:00 -0700
committerLev Walkin <vlm@lionet.info>2013-03-24 03:28:00 -0700
commite14480fa0b9ff7fb67b90bcbaef7bf156c0ea433 (patch)
treece62ffb4b01e8d4e942107cf53e0ec849a34da8b /asn1c
parentf01946ecea3375ce09d6f2a9da33ce38993710f2 (diff)
fix https://sourceforge.net/p/asn1c/bugs/51/
Diffstat (limited to 'asn1c')
-rw-r--r--asn1c/tests/check-132.-fnative-types.-gen-PER.c63
1 files changed, 63 insertions, 0 deletions
diff --git a/asn1c/tests/check-132.-fnative-types.-gen-PER.c b/asn1c/tests/check-132.-fnative-types.-gen-PER.c
new file mode 100644
index 00000000..d4037a54
--- /dev/null
+++ b/asn1c/tests/check-132.-fnative-types.-gen-PER.c
@@ -0,0 +1,63 @@
+#undef NDEBUG
+#include <stdio.h>
+#include <stdlib.h>
+#include <sys/types.h>
+#include <string.h>
+#include <assert.h>
+#include <ctype.h>
+#include <errno.h>
+
+#include <T.h>
+
+static void
+verify(int testNo, T_t *ti) {
+ asn_enc_rval_t er;
+ asn_dec_rval_t rv;
+ unsigned char buf[2];
+ T_t *to = 0;
+
+ er = uper_encode_to_buffer(&asn_DEF_T, ti, buf, sizeof buf);
+ fprintf(stderr, "%d IN: %d => %d\n", testNo,
+ ti->present, (int)er.encoded);
+ assert(er.encoded >= 1 && er.encoded <= 8 * sizeof(buf));
+
+ rv = uper_decode(0, &asn_DEF_T, (void *)&to, buf, sizeof buf, 0, 0);
+ assert(rv.code == RC_OK);
+
+ fprintf(stderr, "%d ENC: %2x%2x\n", testNo,
+ buf[0], buf[1]);
+ fprintf(stderr, "%d OUT: %d\n", testNo, ti->present);
+ assert(ti->present == to->present);
+ if(ti->present == T_PR_second) {
+ assert(ti->choice.second == to->choice.second);
+ } else {
+ assert(ti->choice.first.present == to->choice.first.present);
+ assert(ti->choice.first.choice.nothing == to->choice.first.choice.nothing);
+ }
+
+ xer_fprint(stderr, &asn_DEF_T, ti);
+ xer_fprint(stderr, &asn_DEF_T, to);
+}
+
+int main() {
+ T_t t;
+
+ memset(&t, 0, sizeof(t));
+ t.present = T_PR_first;
+ t.choice.first.present = first_PR_nothing;
+ t.choice.first.choice.nothing = 5;
+ verify(0, &t);
+
+ memset(&t, 0, sizeof(t));
+ t.present = T_PR_first;
+ t.choice.first.present = first_PR_nothing;
+ t.choice.first.choice.nothing = 6;
+ verify(1, &t);
+
+ memset(&t, 0, sizeof(t));
+ t.present = T_PR_second;
+ t.choice.second = 7;
+ verify(2, &t);
+
+ return 0;
+}