SIM-115: update simulator to use latest E2SM KPM version 3

[sim/e2-interface.git] / e2sim / e2sm_examples / kpm_e2sm / src / ASN1c / asn_SEQUENCE_OF.c

diff --git a/e2sim/e2sm_examples/kpm_e2sm/src/ASN1c/asn_SEQUENCE_OF.c b/e2sim/e2sm_examples/kpm_e2sm/src/ASN1c/asn_SEQUENCE_OF.c
deleted file mode 100644 (file)
index ec952fc..0000000
--- a/e2sim/e2sm_examples/kpm_e2sm/src/ASN1c/asn_SEQUENCE_OF.c
+++ /dev/null
@@ -1,41 +0,0 @@
-/*-
- * Copyright (c) 2003, 2004 Lev Walkin <vlm@lionet.info>. All rights reserved.
- * Redistribution and modifications are permitted subject to BSD license.
- */
-#include <asn_internal.h>
-#include <asn_SEQUENCE_OF.h>
-
-typedef A_SEQUENCE_OF(void) asn_sequence;
-
-void
-asn_sequence_del(void *asn_sequence_of_x, int number, int _do_free) {
-       asn_sequence *as = (asn_sequence *)asn_sequence_of_x;
-
-       if(as) {
-               void *ptr;
-               int n;
-
-               if(number < 0 || number >= as->count)
-                       return; /* Nothing to delete */
-
-               if(_do_free && as->free) {
-                       ptr = as->array[number];
-               } else {
-                       ptr = 0;
-               }
-
-               /*
-                * Shift all elements to the left to hide the gap.
-                */
-               --as->count;
-               for(n = number; n < as->count; n++)
-                       as->array[n] = as->array[n+1];
-
-               /*
-                * Invoke the third-party function only when the state
-                * of the parent structure is consistent.
-                */
-               if(ptr) as->free(ptr);
-       }
-}
-