Mercurial > cgi-bin > hgwebdir.cgi > VMS > C_Libraries > DynArray

annotate DynArray.c @ 7:4506c08ed60d

find changesets by author, revision, files, or words in the commit message
added external, and "AtLeast"
author Me
date Sat, 20 Nov 2010 08:21:49 +0100
parents f4b108f21041
children bc91986481e1
rev   line source
Me@3 1 /*
Me@3 2 * Copyright 2010 OpenSourceCodeStewardshipFoundation
Me@3 3 *
Me@3 4 * Licensed under BSD
Me@3 5 */
Me@3 6
Me@3 7
Me@3 8
Me@3 9 #include <stdio.h>
Me@3 10
Me@4 11 #include "DynArray.h"
Me@3 12
Me@3 13
Me@3 14
Me@6 15 PrivDynArrayInfo *
Me@6 16 makePrivDynArrayInfoFrom( void ***addrOfPtrToArray, int32 sizeOfArray )
Me@6 17 { PrivDynArrayInfo *info;
Me@3 18
Me@6 19 info = VMS__malloc( sizeof(PrivDynArrayInfo) );
Me@3 20
Me@4 21 info->addrOfPtrToArray = addrOfPtrToArray;
Me@4 22 info->sizeOfArray = sizeOfArray;
Me@4 23 info->numInArray = 0;
Me@3 24 }
Me@3 25
Me@6 26 PrivDynArrayInfo *
Me@6 27 makePrivDynArrayOfSize( void ***addrOfPtrToArray, int32 sizeOfArray )
Me@6 28 { PrivDynArrayInfo *info;
Me@4 29
Me@6 30 info = VMS__malloc( sizeof(PrivDynArrayInfo) );
Me@4 31
Me@4 32 info->addrOfPtrToArray = addrOfPtrToArray;
Me@7 33
Me@5 34 *(addrOfPtrToArray) = VMS__malloc( sizeOfArray * sizeof(void *) );
Me@4 35 info->sizeOfArray = sizeOfArray;
Me@4 36 info->numInArray = 0;
Me@4 37 }
Me@4 38
Me@7 39 PrivDynArrayInfo *
Me@7 40 makePrivDynArrayOfSize_Ext( void ***addrOfPtrToArray, int32 sizeOfArray )
Me@7 41 { PrivDynArrayInfo *info;
Me@7 42
Me@7 43 info = malloc( sizeof(PrivDynArrayInfo) );
Me@7 44
Me@7 45 info->addrOfPtrToArray = addrOfPtrToArray;
Me@7 46
Me@7 47 *(addrOfPtrToArray) = malloc( sizeOfArray * sizeof(void *) );
Me@7 48 info->sizeOfArray = sizeOfArray;
Me@7 49 info->numInArray = 0;
Me@7 50 }
Me@7 51
Me@4 52
Me@4 53 /*A dynamic array is same as any other array, but add a DynArrayInfo next
Me@4 54 * to it. Accesses and updates of array indexes are done normally, it's
Me@4 55 * only when add a new element into array that use the extra info.
Me@4 56 * An add can cause the pointer to the normal array to change.. so must
Me@4 57 * be protected to single VP at a time.
Me@4 58 *
Me@4 59 *Only need to use this Fn when need a new index, higher than any previous
Me@4 60 */
Me@4 61 int32
Me@6 62 addToDynArray( void *value, PrivDynArrayInfo *info )
Me@4 63 { int32 numInArray, sizeOfArray;
Me@4 64 void **array;
Me@5 65
Me@4 66 numInArray = info->numInArray;
Me@4 67 sizeOfArray = info->sizeOfArray;
Me@4 68
Me@4 69 if( numInArray >= sizeOfArray )
Me@4 70 {
Me@4 71 increaseSizeOfDynArrayTo( info, sizeOfArray * 2 );
Me@4 72 }
Me@5 73
Me@5 74 array = *(info->addrOfPtrToArray);
Me@5 75 array[ numInArray ] = value;
Me@5 76 info->numInArray++;
Me@5 77
Me@5 78 return numInArray; //pre-incr value is the index put value into
Me@5 79 }
Me@5 80 int32
Me@7 81 addToDynArray_Ext( void *value, PrivDynArrayInfo *info )
Me@5 82 { int32 numInArray, sizeOfArray;
Me@5 83 void **array;
Me@5 84
Me@5 85 numInArray = info->numInArray;
Me@5 86 sizeOfArray = info->sizeOfArray;
Me@5 87
Me@5 88 if( numInArray >= sizeOfArray )
Me@5 89 {
Me@7 90 increaseSizeOfDynArrayTo_Ext( info, sizeOfArray * 2 );
Me@5 91 }
Me@5 92
Me@4 93 array = *(info->addrOfPtrToArray);
Me@4 94 array[ numInArray ] = value;
Me@4 95 info->numInArray++;
Me@4 96
Me@4 97 return numInArray; //pre-incr value is the index put value into
Me@4 98 }
Me@4 99
Me@4 100
Me@4 101 /*Use this when know how many things going to add in -- then can do this
Me@4 102 * once and use as normal array afterwards. If later add another chunk,
Me@4 103 * do this again. Note, this makes new size be just big enough to hold
Me@4 104 * highest index, so will do a linear number of copies if use only this.
Me@4 105 *To cut down on number of copies, can use the increaseSizeTo Fn to
Me@4 106 * exponentially increase size..
Me@4 107 */
Me@4 108 void
Me@6 109 makeHighestDynArrayIndexBe( PrivDynArrayInfo *info, int32 highestIndex )
Me@4 110 {
Me@4 111 if( info->sizeOfArray <= highestIndex )
Me@4 112 {
Me@4 113 increaseSizeOfDynArrayTo( info, highestIndex + 1 );
Me@4 114 }
Me@4 115 info->numInArray = highestIndex + 1;
Me@4 116 }
Me@4 117
Me@7 118 void
Me@7 119 makeHighestDynArrayIndexBeAtLeast(PrivDynArrayInfo *info, int32 index)
Me@7 120 {
Me@7 121 if( index < info->numInArray ) return;
Me@7 122 else makeHighestDynArrayIndexBe( info, index );
Me@7 123 }
Me@7 124
Me@4 125
Me@4 126 /*Only use this if certain new size is bigger than current size
Me@4 127 */
Me@4 128 void
Me@6 129 increaseSizeOfDynArrayTo( PrivDynArrayInfo *info, int32 newSize )
Me@4 130 { int32 oldSizeOfArray, i;
Me@3 131 void **newArray, **oldArray;
Me@5 132
Me@4 133 oldSizeOfArray = info->sizeOfArray;
Me@4 134 if( newSize <= oldSizeOfArray ) return;
Me@5 135
Me@4 136 oldArray = *(info->addrOfPtrToArray);
Me@5 137 newArray = VMS__malloc( newSize * sizeof(void *) );
Me@4 138
Me@3 139 for( i = 0; i < oldSizeOfArray; i++ )
Me@3 140 {
Me@3 141 newArray[i] = oldArray[i];
Me@3 142 }
Me@4 143 *(info->addrOfPtrToArray) = newArray; //change location of array-ptr
Me@4 144 info->sizeOfArray = newSize;
Me@3 145
Me@5 146 VMS__free( oldArray );
Me@5 147 }
Me@5 148
Me@5 149 /*Can't mix VMS__malloc locations with external malloc locations -- so use
Me@5 150 * this version inside VMS, which will perform normal malloc in the core
Me@5 151 * loop -- hopefully avoiding the annoying system-stack bugs..
Me@5 152 */
Me@5 153 void
Me@7 154 increaseSizeOfDynArrayTo_Ext( PrivDynArrayInfo *info, int32 newSize )
Me@5 155 { int32 oldSizeOfArray, i;
Me@5 156 void **newArray, **oldArray;
Me@5 157
Me@5 158 oldSizeOfArray = info->sizeOfArray;
Me@5 159 if( newSize <= oldSizeOfArray ) return;
Me@5 160
Me@5 161 oldArray = *(info->addrOfPtrToArray);
Me@7 162 newArray = malloc( newSize * sizeof(void *) );
Me@5 163
Me@5 164 for( i = 0; i < oldSizeOfArray; i++ )
Me@5 165 {
Me@5 166 newArray[i] = oldArray[i];
Me@5 167 }
Me@5 168 *(info->addrOfPtrToArray) = newArray; //change location of array-ptr
Me@5 169 info->sizeOfArray = newSize;
Me@5 170
Me@7 171 free( oldArray );
Me@3 172 }
Me@3 173
Me@4 174
Me@4 175 /* Frees the array, plus the info
Me@4 176 */
Me@4 177 void
Me@6 178 freeDynArrayDeep( PrivDynArrayInfo *info, FreeFnPtr freeFnPtr )
Me@3 179 {
Me@4 180 forAllInDynArrayDo( info, freeFnPtr );
Me@5 181 VMS__free( *(info->addrOfPtrToArray) );
Me@5 182 VMS__free( info );
Me@3 183 }
Me@4 184
Me@4 185 /* Only frees the info
Me@4 186 */
Me@4 187 void
Me@6 188 freeDynArrayFlat( PrivDynArrayInfo *info )
Me@4 189 {
Me@5 190 VMS__free( info );
Me@4 191 }
Me@4 192
Me@4 193
Me@4 194 /*The function has a fixed prototype: takes a void * returns void
Me@4 195 * So, the function has to internally cast void * to whatever data struc..
Me@4 196 */
Me@4 197 void
Me@6 198 forAllInDynArrayDo( PrivDynArrayInfo *info, DynArrayFnPtr fnPtr )
Me@4 199 { int32 idx;
Me@4 200 void **array;
Me@4 201
Me@4 202 array = *(info->addrOfPtrToArray);
Me@4 203 for( idx = 0; idx < info->numInArray; idx++ )
Me@4 204 {
Me@4 205 (*fnPtr)(array[idx]);
Me@4 206 }
Me@4 207 }
Me@4 208