Mercurial > cgi-bin > hgwebdir.cgi > VMS > C_Libraries > DynArray
view DynArray.c @ 11:601709e9f2a4
Newly created project repository -- commit sub-states
| author | Me@portablequad |
|---|---|
| date | Tue, 07 Feb 2012 12:51:29 -0800 |
| parents | f35e64d7a42b |
| children | 9de0a9369134 |
line source
1 /*
2 * Copyright 2010 OpenSourceCodeStewardshipFoundation
3 *
4 * Licensed under BSD
5 */
9 #include <stdio.h>
10 #include <malloc.h>
12 #include "DynArray.h"
16 DynArrayInfo *
17 makeDynArrayInfoFrom( void ***addrOfPtrToArray, int32 sizeOfArray )
18 { DynArrayInfo *info;
20 info = malloc( sizeof(DynArrayInfo) );
22 info->addrOfPtrToArray = addrOfPtrToArray;
23 info->sizeOfArray = sizeOfArray;
24 info->numInArray = 0;
25 }
27 DynArrayInfo *
28 makeDynArrayOfSize( void ***addrOfPtrToArray, int32 sizeOfArray )
29 { DynArrayInfo *info;
31 info = malloc( sizeof(DynArrayInfo) );
33 info->addrOfPtrToArray = addrOfPtrToArray;
35 *(addrOfPtrToArray) = malloc( sizeOfArray * sizeof(void *) );
36 info->sizeOfArray = sizeOfArray;
37 info->numInArray = 0;
38 }
41 /*A dynamic array is same as any other array, but add a DynArrayInfo next
42 * to it. Accesses and updates of array indexes are done normally, it's
43 * only when add a new element into array that use the extra info.
44 * An add can cause the pointer to the normal array to change.. so must
45 * be protected to single VP at a time.
46 *
47 *Only need to use this Fn when need a new index, higher than any previous
48 */
49 int32
50 addToDynArray( void *value, DynArrayInfo *info )
51 { int32 numInArray, sizeOfArray;
52 void **array;
54 numInArray = info->numInArray;
55 sizeOfArray = info->sizeOfArray;
57 if( numInArray >= sizeOfArray )
58 {
59 increaseSizeOfDynArrayTo( info, sizeOfArray * 2 );
60 }
62 array = *(info->addrOfPtrToArray);
63 array[ numInArray ] = value;
64 info->numInArray++;
66 return numInArray; //pre-incr value is the index put value into
67 }
70 /*Use this when know how many things going to add in -- then can do this
71 * once and use as normal array afterwards. If later add another chunk,
72 * do this again. Note, this makes new size be just big enough to hold
73 * highest index, so will do a linear number of copies if use only this.
74 *To cut down on number of copies, can use the increaseSizeTo Fn to
75 * exponentially increase size..
76 */
77 void
78 makeHighestDynArrayIndexBe( DynArrayInfo *info, int32 highestIndex )
79 {
80 if( info->sizeOfArray <= highestIndex )
81 {
82 increaseSizeOfDynArrayTo( info, highestIndex + 1 );
83 }
84 info->numInArray = highestIndex + 1;
85 }
88 /*Only use this if certain new size is bigger than current size
89 */
90 void
91 increaseSizeOfDynArrayTo( DynArrayInfo *info, int32 newSize )
92 { int32 oldSizeOfArray, i;
93 void **newArray, **oldArray;
95 oldSizeOfArray = info->sizeOfArray;
96 if( newSize <= oldSizeOfArray ) return;
98 oldArray = *(info->addrOfPtrToArray);
99 newArray = malloc( newSize * sizeof(void *) );
101 for( i = 0; i < oldSizeOfArray; i++ )
102 {
103 newArray[i] = oldArray[i];
104 }
105 *(info->addrOfPtrToArray) = newArray; //change location of array-ptr
106 info->sizeOfArray = newSize;
108 free( oldArray );
109 }
112 /* Frees the array, plus the info
113 */
114 void
115 freeDynArrayDeep( DynArrayInfo *info, FreeFnPtr freeFnPtr )
116 {
117 forAllInDynArrayDo( info, freeFnPtr );
118 free( *(info->addrOfPtrToArray) );
119 free( info );
120 }
122 /* Only frees the info
123 */
124 void
125 freeDynArrayFlat( DynArrayInfo *info )
126 {
127 free( info );
128 }
131 /*The function has a fixed prototype: takes a void * returns void
132 * So, the function has to internally cast void * to whatever data struc..
133 */
134 void
135 forAllInDynArrayDo( DynArrayInfo *info, DynArrayFnPtr fnPtr )
136 { int32 idx;
137 void **array;
139 array = *(info->addrOfPtrToArray);
140 for( idx = 0; idx < info->numInArray; idx++ )
141 {
142 (*fnPtr)(array[idx]);
143 }
144 }