summaryrefslogtreecommitdiff
path: root/tests/single_node.c
diff options
context:
space:
mode:
authorPawel Kowalski <p.kowalski2@partner.samsung.com>2019-08-28 14:31:23 +0200
committerPawel Kowalski <p.kowalski2@partner.samsung.com>2019-08-28 16:56:31 +0200
commitdee455252ad321c660b411b4ecd65aa5e08f8fc1 (patch)
treeb55f9ec039e963e42605e9e9bdc186354cf9df42 /tests/single_node.c
parent5c7e0aaf17a296535495e3431db6a86ad64064b3 (diff)
parent26bea900a531662c6028ecc06f4adea825658434 (diff)
downloadlibtasn1-0b1fb6b30f9a46fe5a10923272044fd22678a0be.tar.gz
libtasn1-0b1fb6b30f9a46fe5a10923272044fd22678a0be.tar.bz2
libtasn1-0b1fb6b30f9a46fe5a10923272044fd22678a0be.zip
Change-Id: I6d4b47b2072db8e7c45daa6e269e2f0cc6f54a7f
Diffstat (limited to 'tests/single_node.c')
-rw-r--r--tests/single_node.c61
1 files changed, 61 insertions, 0 deletions
diff --git a/tests/single_node.c b/tests/single_node.c
new file mode 100644
index 0000000..2322d4f
--- /dev/null
+++ b/tests/single_node.c
@@ -0,0 +1,61 @@
+/*
+ * Copyright (C) 2019 Free Software Foundation, Inc.
+ *
+ * This file is part of LIBTASN1.
+ *
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program. If not, see <http://www.gnu.org/licenses/>.
+ *
+ */
+
+/****************************************************************/
+/* Description: reproducer for endless loop with a single node */
+/****************************************************************/
+
+#include <stdio.h>
+#include <string.h>
+#include <stdlib.h>
+
+#include <libtasn1.h>
+
+/* That translates to a single node with all pointers (right,left,down) set to NULL */
+const asn1_static_node endless_asn1_tab[] = {
+ { "TEST_TREE", 536875024, NULL },
+ { NULL, 0, NULL }
+};
+
+int
+main (int argc, char *argv[])
+{
+ int result, verbose = 0;
+ asn1_node definitions = NULL;
+ char errorDescription[ASN1_MAX_ERROR_DESCRIPTION_SIZE];
+
+ if (argc > 1)
+ verbose = 1;
+
+ result = asn1_array2tree (endless_asn1_tab, &definitions, errorDescription);
+ if (result != ASN1_SUCCESS)
+ {
+ asn1_perror (result);
+ printf ("ErrorDescription = %s\n\n", errorDescription);
+ exit (EXIT_FAILURE);
+ }
+
+ asn1_delete_structure (&definitions);
+
+ if (verbose)
+ printf ("Success\n");
+
+ exit (EXIT_SUCCESS);
+}