fix list parse and construction

change lists to be represented by pointer arrays grown in 32 entry
blocks instead of linked list. This also ensures lists are constructed
in the correct order and makes enumeration and indexing much more
efficient.

1 files changed, 12 insertions, 6 deletions

diff --git a/src/cos_object.h b/src/cos_object.h
index b90ef15..2e763e2 100644
--- a/src/cos_object.h
+++ b/src/cos_object.h
@@ -45,12 +45,18 @@ struct cos_dictionary_entry {
     struct cos_object *value;
 };
 
-struct cos_array_entry {
-    /** next value in array */
-    struct cos_array_entry *next;
+/**
+ * array of COS objects
+ */
+struct cos_array {
+    /** number of values */
+    unsigned int length;
 
-    /** value */
-    struct cos_object *value;
+    /** number of allocated values */
+    unsigned int alloc;
+
+    /** array of object pointers */
+    struct cos_object **values;
 };
 
 struct cos_string {
@@ -96,7 +102,7 @@ struct cos_object {
         struct cos_dictionary_entry *dictionary;
 
         /* array */
-        struct cos_array_entry *array;
+        struct cos_array *array;
 
         /** reference */
         struct cos_reference *reference;