Changeset 3286
- Timestamp:
- Feb 18, 2005, 12:17:20 PM (21 years ago)
- Location:
- trunk/psLib
- Files:
-
- 1 deleted
- 13 edited
-
src/astronomy/psMetadata.c (modified) (4 diffs)
-
src/collections/psArray.c (modified) (2 diffs)
-
src/collections/psHash.c (modified) (1 diff)
-
src/collections/psMetadata.c (modified) (4 diffs)
-
src/types/psArray.c (modified) (2 diffs)
-
src/types/psHash.c (modified) (1 diff)
-
src/types/psMetadata.c (modified) (4 diffs)
-
test/astronomy/Makefile.am (modified) (2 diffs)
-
test/astronomy/data/test.psTime.config4.template (modified) (1 diff)
-
test/collections/tst_psArray.c (modified) (22 diffs)
-
test/collections/verified/tst_psArray.stderr (modified) (1 diff)
-
test/collections/verified/tst_psArray.stdout (deleted)
-
test/dataIO/tst_psFits.c (modified) (7 diffs)
-
test/fileUtils/tst_psFits.c (modified) (7 diffs)
Legend:
- Unmodified
- Added
- Removed
-
trunk/psLib/src/astronomy/psMetadata.c
r3264 r3286 12 12 * @author Ross Harman, MHPCC 13 13 * 14 * @version $Revision: 1.5 1$ $Name: not supported by cvs2svn $15 * @date $Date: 2005-02-1 7 19:26:23$14 * @version $Revision: 1.52 $ $Name: not supported by cvs2svn $ 15 * @date $Date: 2005-02-18 22:17:20 $ 16 16 * 17 17 * Copyright 2004-2005 Maui High Performance Computing Center, University of Hawaii … … 344 344 } 345 345 // Decrement reference count, since the metadata item is now in metadata collection and no longer needed 346 ps MemDecrRefCounter(metadataItem);346 psFree(metadataItem); 347 347 348 348 return true; … … 453 453 { \ 454 454 psMetadataItem *metadataItem = NULL; \ 455 ps##TYPE value = 0; \ 455 456 \ 456 457 if (status) { \ … … 469 470 switch (metadataItem->pType) { \ 470 471 case PS_TYPE_S32: \ 471 return metadataItem->data.S32; \ 472 value = (ps##TYPE)metadataItem->data.S32; \ 473 break; \ 472 474 case PS_TYPE_F32: \ 473 return metadataItem->data.F32; \ 475 value = (ps##TYPE)metadataItem->data.F32; \ 476 break; \ 474 477 case PS_TYPE_F64: \ 475 return metadataItem->data.F64; \ 478 value = (ps##TYPE)metadataItem->data.F64; \ 479 break; \ 476 480 case PS_TYPE_BOOL: \ 477 481 if (metadataItem->data.B) { \ 478 return1; \482 value = 1; \ 479 483 } \ 480 return 0; \484 break; \ 481 485 default: \ 486 /* if you get to this point, the value is not a number. */ \ 487 if (status) { \ 488 *status = false; \ 489 } \ 482 490 break; \ 491 } \ 492 } else { \ 493 if (status) { \ 494 *status = false; \ 483 495 } \ 484 496 } \ 485 497 \ 486 /* if you get to this point, the value is not a number. */ \ 487 if (status) { \ 488 *status = false; \ 489 } \ 490 \ 491 return 0; \ 498 /* psFree(metadataItem); currently, the lookup doesn't increment the ref count */ \ 499 return value; \ 492 500 } 493 501 -
trunk/psLib/src/collections/psArray.c
r3264 r3286 9 9 * @author Ross Harman, MHPCC 10 10 * 11 * @version $Revision: 1.2 5$ $Name: not supported by cvs2svn $12 * @date $Date: 2005-02-1 7 19:26:23$11 * @version $Revision: 1.26 $ $Name: not supported by cvs2svn $ 12 * @date $Date: 2005-02-18 22:17:20 $ 13 13 * 14 14 * Copyright 2004-2005 Maui High Performance Computing Center, University of Hawaii … … 103 103 104 104 // add the element to the end of the array. 105 psArr->data[n] = data;105 psArr->data[n] = psMemIncrRefCounter(data); 106 106 psArr->n = n+1; 107 107 -
trunk/psLib/src/collections/psHash.c
r3264 r3286 12 12 * @author Robert DeSonia, MHPCC 13 13 * 14 * @version $Revision: 1.1 2$ $Name: not supported by cvs2svn $15 * @date $Date: 2005-02-1 7 19:26:23$14 * @version $Revision: 1.13 $ $Name: not supported by cvs2svn $ 15 * @date $Date: 2005-02-18 22:17:20 $ 16 16 * 17 17 * Copyright 2004-2005 Maui High Performance Computing Center, University of Hawaii -
trunk/psLib/src/collections/psMetadata.c
r3264 r3286 12 12 * @author Ross Harman, MHPCC 13 13 * 14 * @version $Revision: 1.5 1$ $Name: not supported by cvs2svn $15 * @date $Date: 2005-02-1 7 19:26:23$14 * @version $Revision: 1.52 $ $Name: not supported by cvs2svn $ 15 * @date $Date: 2005-02-18 22:17:20 $ 16 16 * 17 17 * Copyright 2004-2005 Maui High Performance Computing Center, University of Hawaii … … 344 344 } 345 345 // Decrement reference count, since the metadata item is now in metadata collection and no longer needed 346 ps MemDecrRefCounter(metadataItem);346 psFree(metadataItem); 347 347 348 348 return true; … … 453 453 { \ 454 454 psMetadataItem *metadataItem = NULL; \ 455 ps##TYPE value = 0; \ 455 456 \ 456 457 if (status) { \ … … 469 470 switch (metadataItem->pType) { \ 470 471 case PS_TYPE_S32: \ 471 return metadataItem->data.S32; \ 472 value = (ps##TYPE)metadataItem->data.S32; \ 473 break; \ 472 474 case PS_TYPE_F32: \ 473 return metadataItem->data.F32; \ 475 value = (ps##TYPE)metadataItem->data.F32; \ 476 break; \ 474 477 case PS_TYPE_F64: \ 475 return metadataItem->data.F64; \ 478 value = (ps##TYPE)metadataItem->data.F64; \ 479 break; \ 476 480 case PS_TYPE_BOOL: \ 477 481 if (metadataItem->data.B) { \ 478 return1; \482 value = 1; \ 479 483 } \ 480 return 0; \484 break; \ 481 485 default: \ 486 /* if you get to this point, the value is not a number. */ \ 487 if (status) { \ 488 *status = false; \ 489 } \ 482 490 break; \ 491 } \ 492 } else { \ 493 if (status) { \ 494 *status = false; \ 483 495 } \ 484 496 } \ 485 497 \ 486 /* if you get to this point, the value is not a number. */ \ 487 if (status) { \ 488 *status = false; \ 489 } \ 490 \ 491 return 0; \ 498 /* psFree(metadataItem); currently, the lookup doesn't increment the ref count */ \ 499 return value; \ 492 500 } 493 501 -
trunk/psLib/src/types/psArray.c
r3264 r3286 9 9 * @author Ross Harman, MHPCC 10 10 * 11 * @version $Revision: 1.2 5$ $Name: not supported by cvs2svn $12 * @date $Date: 2005-02-1 7 19:26:23$11 * @version $Revision: 1.26 $ $Name: not supported by cvs2svn $ 12 * @date $Date: 2005-02-18 22:17:20 $ 13 13 * 14 14 * Copyright 2004-2005 Maui High Performance Computing Center, University of Hawaii … … 103 103 104 104 // add the element to the end of the array. 105 psArr->data[n] = data;105 psArr->data[n] = psMemIncrRefCounter(data); 106 106 psArr->n = n+1; 107 107 -
trunk/psLib/src/types/psHash.c
r3264 r3286 12 12 * @author Robert DeSonia, MHPCC 13 13 * 14 * @version $Revision: 1.1 2$ $Name: not supported by cvs2svn $15 * @date $Date: 2005-02-1 7 19:26:23$14 * @version $Revision: 1.13 $ $Name: not supported by cvs2svn $ 15 * @date $Date: 2005-02-18 22:17:20 $ 16 16 * 17 17 * Copyright 2004-2005 Maui High Performance Computing Center, University of Hawaii -
trunk/psLib/src/types/psMetadata.c
r3264 r3286 12 12 * @author Ross Harman, MHPCC 13 13 * 14 * @version $Revision: 1.5 1$ $Name: not supported by cvs2svn $15 * @date $Date: 2005-02-1 7 19:26:23$14 * @version $Revision: 1.52 $ $Name: not supported by cvs2svn $ 15 * @date $Date: 2005-02-18 22:17:20 $ 16 16 * 17 17 * Copyright 2004-2005 Maui High Performance Computing Center, University of Hawaii … … 344 344 } 345 345 // Decrement reference count, since the metadata item is now in metadata collection and no longer needed 346 ps MemDecrRefCounter(metadataItem);346 psFree(metadataItem); 347 347 348 348 return true; … … 453 453 { \ 454 454 psMetadataItem *metadataItem = NULL; \ 455 ps##TYPE value = 0; \ 455 456 \ 456 457 if (status) { \ … … 469 470 switch (metadataItem->pType) { \ 470 471 case PS_TYPE_S32: \ 471 return metadataItem->data.S32; \ 472 value = (ps##TYPE)metadataItem->data.S32; \ 473 break; \ 472 474 case PS_TYPE_F32: \ 473 return metadataItem->data.F32; \ 475 value = (ps##TYPE)metadataItem->data.F32; \ 476 break; \ 474 477 case PS_TYPE_F64: \ 475 return metadataItem->data.F64; \ 478 value = (ps##TYPE)metadataItem->data.F64; \ 479 break; \ 476 480 case PS_TYPE_BOOL: \ 477 481 if (metadataItem->data.B) { \ 478 return1; \482 value = 1; \ 479 483 } \ 480 return 0; \484 break; \ 481 485 default: \ 486 /* if you get to this point, the value is not a number. */ \ 487 if (status) { \ 488 *status = false; \ 489 } \ 482 490 break; \ 491 } \ 492 } else { \ 493 if (status) { \ 494 *status = false; \ 483 495 } \ 484 496 } \ 485 497 \ 486 /* if you get to this point, the value is not a number. */ \ 487 if (status) { \ 488 *status = false; \ 489 } \ 490 \ 491 return 0; \ 498 /* psFree(metadataItem); currently, the lookup doesn't increment the ref count */ \ 499 return value; \ 492 500 } 493 501 -
trunk/psLib/test/astronomy/Makefile.am
r3275 r3286 87 87 88 88 test.psTime.config4: data/test.psTime.config4.template 89 sed 's|PREFIX|$(srcdir)|' $? >$@89 cp $? $@ 90 90 91 91 test.config: data/test.config … … 97 97 header_2.fits: data/header_2.fits 98 98 cp $? $@ 99 100 test.ser7.dat: data/test.ser7.dat 101 cp $? $@ 102 103 -
trunk/psLib/test/astronomy/data/test.psTime.config4.template
r3246 r3286 1 1 # This configuration file specifies values required for time calculations by psLib. 2 psLib.time.tables.dir STR PREFIX# Directory for time tables2 psLib.time.tables.dir STR . # Directory for time tables 3 3 psLib.time.tables.n S32 1 # Number of time tables 4 4 psLib.time.tables.files STR test.ser7.dat # This the table file -
trunk/psLib/test/collections/tst_psArray.c
r3281 r3286 17 17 * @author Ross Harman, MHPCC 18 18 * 19 * @version $Revision: 1.1 1$ $Name: not supported by cvs2svn $20 * @date $Date: 2005-02-18 00:01:39$19 * @version $Revision: 1.12 $ $Name: not supported by cvs2svn $ 20 * @date $Date: 2005-02-18 22:17:20 $ 21 21 * 22 22 * Copyright 2004-2005 Maui High Performance Computing Center, University of Hawaii … … 75 75 76 76 // Test A - Create void pointer array 77 printPositiveTestHeader(std out,"psArray", "Create void pointer array");77 printPositiveTestHeader(stderr,"psArray", "Create void pointer array"); 78 78 psArray *psArr = psArrayAlloc(5); 79 79 if (psArr->nalloc != 5) { … … 81 81 return 1; 82 82 } 83 printFooter(std out, "psArray", "Create void pointer array", true);83 printFooter(stderr, "psArray", "Create void pointer array", true); 84 84 85 85 86 86 // Test B - Add data to void pointer array 87 printPositiveTestHeader(std out, "psArray", "Add data to void pointer array");87 printPositiveTestHeader(stderr, "psArray", "Add data to void pointer array"); 88 88 for(psS32 i = 0; i < 5; i++) { 89 89 testStruct *ts = psAlloc(sizeof(testStruct)); … … 97 97 for(psS32 i = 0; i < 5; i++) { 98 98 testStruct *ts = (testStruct*)psArr->data[i]; 99 printf("ts[%d].x = %d ts[%d].y = %.2f\n", i, ts->x, i, ts->y);99 fprintf(stderr,"ts[%d].x = %d ts[%d].y = %.2f\n", i, ts->x, i, ts->y); 100 100 if (fabsf(ts->x - 10*i) > 0.01f || fabsf(ts->y - 10.1*i) > 0.01f) { 101 101 psError(PS_ERR_UNKNOWN, true,"Couldn't properly get elements from array."); … … 103 103 } 104 104 } 105 printf("array size = %d\n", psArr->nalloc);105 fprintf(stderr,"array size = %d\n", psArr->nalloc); 106 106 if (psArr->nalloc != 5) { 107 107 psError(PS_ERR_UNKNOWN, true,"Array Size wrong"); 108 108 return 3; 109 109 } 110 printf("array population = %d\n", psArr->n);110 fprintf(stderr,"array population = %d\n", psArr->n); 111 111 if (psArr->n != 5) { 112 112 psError(PS_ERR_UNKNOWN, true,"Array population wrong"); 113 113 return 4; 114 114 } 115 printFooter(std out, "psArray", "Add data to void pointer array", true);115 printFooter(stderr, "psArray", "Add data to void pointer array", true); 116 116 117 117 118 118 // Test C - Reallocate void pointer array bigger 119 printPositiveTestHeader(std out,"psArray", "Reallocate void pointer array bigger");119 printPositiveTestHeader(stderr,"psArray", "Reallocate void pointer array bigger"); 120 120 psArr = psArrayRealloc(psArr,10); 121 printf("Adding more elements to void pointer array...\n");121 fprintf(stderr,"Adding more elements to void pointer array...\n"); 122 122 for(psS32 i = 5; i < 10; i++) { 123 123 testStruct *ts = psAlloc(sizeof(testStruct)); … … 131 131 for(psS32 i = 0; i < 10; i++) { 132 132 testStruct *ts = (testStruct*)psArr->data[i]; 133 printf("ts[%d].x = %d ts[%d].y = %.2f\n", i, ts->x, i, ts->y);133 fprintf(stderr,"ts[%d].x = %d ts[%d].y = %.2f\n", i, ts->x, i, ts->y); 134 134 if (fabsf(ts->x - 10*i) > 0.01f || fabsf(ts->y - 10.1*i) > 0.01f) { 135 135 psError(PS_ERR_UNKNOWN, true,"Couldn't properly get elements from array."); … … 137 137 } 138 138 } 139 printf("array size = %d\n", psArr->nalloc);139 fprintf(stderr,"array size = %d\n", psArr->nalloc); 140 140 if (psArr->nalloc != 10) { 141 141 psError(PS_ERR_UNKNOWN, true,"Array Size wrong"); 142 142 return 6; 143 143 } 144 printf("array population = %d\n", psArr->n);144 fprintf(stderr,"array population = %d\n", psArr->n); 145 145 if (psArr->n != 10) { 146 146 psError(PS_ERR_UNKNOWN, true,"Array Population wrong"); 147 147 return 7; 148 148 } 149 printFooter(std out, "psArray", "Reallocate void pointer array bigger", true);149 printFooter(stderr, "psArray", "Reallocate void pointer array bigger", true); 150 150 151 151 // Test D - Reallocate void pointer array smaller 152 printPositiveTestHeader(std out,"psArray","Reallocate void pointer array smaller");152 printPositiveTestHeader(stderr,"psArray","Reallocate void pointer array smaller"); 153 153 psArr = psArrayRealloc(psArr,3); 154 154 for(psS32 i = 0; i < 3; i++) { 155 155 testStruct *ts = (testStruct*)psArr->data[i]; 156 printf("ts[%d].x = %d ts[%d].y = %.2f\n", i, ts->x, i, ts->y);156 fprintf(stderr,"ts[%d].x = %d ts[%d].y = %.2f\n", i, ts->x, i, ts->y); 157 157 if (fabsf(ts->x - 10*i) > 0.01f || fabsf(ts->y - 10.1*i) > 0.01f) { 158 158 psError(PS_ERR_UNKNOWN, true,"Couldn't properly get elements from array."); … … 160 160 } 161 161 } 162 printf("array size = %d\n", psArr->nalloc);162 fprintf(stderr,"array size = %d\n", psArr->nalloc); 163 163 if (psArr->nalloc != 3) { 164 164 psError(PS_ERR_UNKNOWN, true,"Array Size wrong"); 165 165 return 9; 166 166 } 167 printf("array population = %d\n", psArr->n);167 fprintf(stderr,"array population = %d\n", psArr->n); 168 168 if (psArr->n != 3) { 169 169 psError(PS_ERR_UNKNOWN, true,"Array Population wrong"); 170 170 return 10; 171 171 } 172 printFooter(std out, "psArray", "Reallocate integer void pointer smaller", true);172 printFooter(stderr, "psArray", "Reallocate integer void pointer smaller", true); 173 173 174 174 // Test E - Reallocate with a null 175 printNegativeTestHeader(std out,"psArray","Reallocate with a null array",175 printNegativeTestHeader(stderr,"psArray","Reallocate with a null array", 176 176 "Error message generator", 0 ); 177 177 psLogMsg(__func__,PS_LOG_INFO,"Following should generate an error message."); 178 178 psArr1 = psArrayRealloc(NULL,5); 179 179 if ( psArr1 != NULL ) { 180 printf("ERROR: Return is not NULL\n");181 } 182 printFooter(std out,"psArray","Reallocate with a null array",true);180 fprintf(stderr,"ERROR: Return is not NULL\n"); 181 } 182 printFooter(stderr,"psArray","Reallocate with a null array",true); 183 183 184 184 185 185 // Test F - Remove item from array 186 printPositiveTestHeader(std out, "psArray", "Remove valid item");186 printPositiveTestHeader(stderr, "psArray", "Remove valid item"); 187 187 if( !psArrayRemove(psArr,mySt[0]) ) { 188 188 psError(PS_ERR_UNKNOWN,true,"Unable to remove valid item"); 189 189 return 100; 190 190 } 191 printf("Array size after removal = %d\n",psArr->n);191 fprintf(stderr,"Array size after removal = %d\n",psArr->n); 192 192 if ( psArr->n != 2 ) { 193 193 psError(PS_ERR_UNKNOWN, true, "Items in array not decremented after removal"); … … 196 196 for(psS32 i = 0; i < psArr->n; i++) { 197 197 testStruct *ts = (testStruct*)psArr->data[i]; 198 printf("ts[%d].x = %d ts[%d].y = %.2f\n", i, ts->x, i, ts->y);198 fprintf(stderr,"ts[%d].x = %d ts[%d].y = %.2f\n", i, ts->x, i, ts->y); 199 199 if(fabsf(ts->x - 10*(i+1)) > 0.01f || fabsf(ts->y - 10.1*(i+1)) > 0.01f) { 200 200 psError(PS_ERR_UNKNOWN, true, "Elements not as expected after remove."); … … 203 203 } 204 204 psFree(mySt[0]); 205 printFooter(std out,"psArray","Remove valid item", true);205 printFooter(stderr,"psArray","Remove valid item", true); 206 206 207 207 // Test G - Remove invalid item from array 208 printPositiveTestHeader(std out, "psArray", "Remove invalid item from array");208 printPositiveTestHeader(stderr, "psArray", "Remove invalid item from array"); 209 209 if( psArrayRemove(psArr,mySt[9]) ) { 210 210 psError(PS_ERR_UNKNOWN,true,"Removed invalid item from array"); 211 211 return 103; 212 212 } 213 printFooter(std out,"psArray","Remove invalid item from array",true);213 printFooter(stderr,"psArray","Remove invalid item from array",true); 214 214 215 215 // Test H - Remove item from null array 216 printPositiveTestHeader(std out, "psArray", "Remove item from null array");216 printPositiveTestHeader(stderr, "psArray", "Remove item from null array"); 217 217 if ( psArrayRemove(NULL,mySt[1]) ) { 218 218 psError(PS_ERR_UNKNOWN,true,"Removed valid item from null array"); 219 219 return 104; 220 220 } 221 printFooter(std out,"psArray","Remove item from null array",true);221 printFooter(stderr,"psArray","Remove item from null array",true); 222 222 223 223 // Test I - Remove null item from array 224 printPositiveTestHeader(std out, "psArray", "Remove null item from array");224 printPositiveTestHeader(stderr, "psArray", "Remove null item from array"); 225 225 if( psArrayRemove(psArr,NULL) ) { 226 226 psError(PS_ERR_UNKNOWN,true,"Remove null item from array",true); 227 227 return 105; 228 228 } 229 printFooter(std out,"psArray","Remove null item from array",true);229 printFooter(stderr,"psArray","Remove null item from array",true); 230 230 231 231 // Test J - Free void pointer array 232 printPositiveTestHeader(std out, "psArray", "Free void pointer array");232 printPositiveTestHeader(stderr, "psArray", "Free void pointer array"); 233 233 psFree(psArr); 234 234 for(psS32 i = 0; i < 10; i++) { 235 235 psFree(mySt[i]); 236 236 } 237 if( psMemCheckLeaks(0, NULL, std out, false) != 0) {237 if( psMemCheckLeaks(0, NULL, stderr, false) != 0) { 238 238 psError(PS_ERR_UNKNOWN,true,"Memory leaks detected."); 239 239 return 110; … … 241 241 psS32 nBad = psMemCheckCorruption(0); 242 242 if(nBad) { 243 printf("ERROR: Found %d bad memory blocks\n", nBad);243 fprintf(stderr,"ERROR: Found %d bad memory blocks\n", nBad); 244 244 return 111; 245 245 } 246 printFooter(std out, "psArray" ,"Free void pointer array", true);246 printFooter(stderr, "psArray" ,"Free void pointer array", true); 247 247 248 248 return 0; … … 255 255 256 256 // Test A - Create void pointer array 257 printPositiveTestHeader(std out,"psArray", "Create void pointer array");257 printPositiveTestHeader(stderr,"psArray", "Create void pointer array"); 258 258 psArray *psArr = psArrayAlloc(10); 259 259 if (psArr->nalloc != 10) { … … 261 261 return 1; 262 262 } 263 printFooter(std out, "psArray", "Create void pointer array", true);263 printFooter(stderr, "psArray", "Create void pointer array", true); 264 264 265 265 // Test B - Add data to void pointer array 266 printPositiveTestHeader(std out, "psArray", "Add data to void pointer array");266 printPositiveTestHeader(stderr, "psArray", "Add data to void pointer array"); 267 267 for(psS32 i = 0; i < 10; i++) { 268 268 testStruct *ts = psAlloc(sizeof(testStruct)); … … 276 276 for(psS32 i = 0; i < 10; i++) { 277 277 testStruct *ts = (testStruct*)psArr->data[i]; 278 printf("ts[%d].x = %d ts[%d].y = %.2f\n", i, ts->x, i, ts->y);278 fprintf(stderr,"ts[%d].x = %d ts[%d].y = %.2f\n", i, ts->x, i, ts->y); 279 279 if (fabsf(ts->x - 10*(10-i)) > 0.01f || fabsf(ts->y - 10.1*(10-i)) > 0.01f) { 280 280 psError(PS_ERR_UNKNOWN, true,"Couldn't properly get elements from array."); … … 282 282 } 283 283 } 284 printf("array size = %d\n", psArr->nalloc);284 fprintf(stderr,"array size = %d\n", psArr->nalloc); 285 285 if (psArr->nalloc != 10) { 286 286 psError(PS_ERR_UNKNOWN, true,"Array Size wrong"); 287 287 return 3; 288 288 } 289 printf("array population = %d\n", psArr->n);289 fprintf(stderr,"array population = %d\n", psArr->n); 290 290 if (psArr->n != 10) { 291 291 psError(PS_ERR_UNKNOWN, true,"Array population wrong"); 292 292 return 4; 293 293 } 294 printFooter(std out, "psArray", "Add data to void pointer array", true);294 printFooter(stderr, "psArray", "Add data to void pointer array", true); 295 295 296 296 // Test C - Sort data in array 297 printPositiveTestHeader(std out,"psArray","Sort data in array");297 printPositiveTestHeader(stderr,"psArray","Sort data in array"); 298 298 psArr = psArraySort(psArr,testStructCompare); 299 299 for(psS32 i = 0; i < 10; i++) { 300 300 testStruct *ts = (testStruct*)psArr->data[i]; 301 printf("ts[%d].x = %d ts[%d].y = %.2f\n", i, ts->x, i, ts->y);301 fprintf(stderr,"ts[%d].x = %d ts[%d].y = %.2f\n", i, ts->x, i, ts->y); 302 302 if (fabsf(ts->x - 10*(i+1)) > 0.01f || fabsf(ts->y - 10.1*(i+1)) > 0.01f) { 303 303 psError(PS_ERR_UNKNOWN, true,"Couldn't properly get elements from array."); … … 305 305 } 306 306 } 307 printFooter(std out,"psArray","Sort data in array",true);307 printFooter(stderr,"psArray","Sort data in array",true); 308 308 309 309 // Test D - Attempt to sort null array 310 printPositiveTestHeader(std out,"psArray","Attempt to sort array");310 printPositiveTestHeader(stderr,"psArray","Attempt to sort array"); 311 311 psArray* tempArr = psArraySort(NULL,testStructCompare); 312 312 if(tempArr != NULL) { … … 314 314 return 6; 315 315 } 316 printFooter(std out,"psArray","Attempt to sort array",true);316 printFooter(stderr,"psArray","Attempt to sort array",true); 317 317 318 318 // Test E - Free void pointer array 319 printPositiveTestHeader(std out, "psArray", "Free void pointer array");319 printPositiveTestHeader(stderr, "psArray", "Free void pointer array"); 320 320 psFree(psArr); 321 321 for(psS32 i = 0; i < 10; i++) { 322 322 psFree(mySt[i]); 323 323 } 324 if( psMemCheckLeaks(0, NULL, std out, false) != 0) {324 if( psMemCheckLeaks(0, NULL, stderr, false) != 0) { 325 325 psError(PS_ERR_UNKNOWN,true,"Memory leaks detected."); 326 326 return 110; … … 328 328 psS32 nBad = psMemCheckCorruption(0); 329 329 if(nBad) { 330 printf("ERROR: Found %d bad memory blocks\n", nBad);330 fprintf(stderr,"ERROR: Found %d bad memory blocks\n", nBad); 331 331 return 111; 332 332 } 333 printFooter(std out, "psArray" ,"Free void pointer array", true);333 printFooter(stderr, "psArray" ,"Free void pointer array", true); 334 334 335 335 return 0; … … 352 352 data = psAlloc(sizeof(float)); 353 353 arr = psArrayAdd(arr, delta*2, data); // make delta unique versus next delta used. 354 355 subtest++; 356 if (psMemGetRefCounter(data) != 2) { 357 // in response of Bug #302 358 psError(PS_ERR_UNKNOWN, true, 359 "psArrayAdd did not increment the data reference count."); 360 return subtest; 361 } 362 363 psFree(data); 354 364 355 365 subtest++; … … 381 391 data = psAlloc(sizeof(float)); 382 392 arr = psArrayAdd(arr, delta, data); 393 psFree(data); 383 394 384 395 // make sure the array was expanded … … 411 422 data = psAlloc(sizeof(float)); 412 423 arr = psArrayAdd(arr, 0, data); 424 psFree(data); 413 425 } 414 426 nalloc = arr->nalloc; … … 419 431 data = psAlloc(sizeof(float)); 420 432 arr = psArrayAdd(arr, 0, data); 433 psFree(data); 421 434 422 435 subtest++; -
trunk/psLib/test/collections/verified/tst_psArray.stderr
r3127 r3286 1 <DATE><TIME>|<HOST>|I|main 1 /***************************** TESTPOINT ******************************************\ 2 * TestFile: tst_psArray.c * 3 * TestPoint: psArray{psArray} * 4 * TestType: Positive * 5 \**********************************************************************************/ 6 7 /***************************** TESTPOINT ******************************************\ 8 * TestFile: tst_psArray.c * 9 * TestPoint: psArray{Create void pointer array} * 10 * TestType: Positive * 11 \**********************************************************************************/ 12 13 14 ---> TESTPOINT PASSED (psArray{Create void pointer array} | tst_psArray.c) 15 16 /***************************** TESTPOINT ******************************************\ 17 * TestFile: tst_psArray.c * 18 * TestPoint: psArray{Add data to void pointer array} * 19 * TestType: Positive * 20 \**********************************************************************************/ 21 22 ts[0].x = 0 ts[0].y = 0.00 23 ts[1].x = 10 ts[1].y = 10.10 24 ts[2].x = 20 ts[2].y = 20.20 25 ts[3].x = 30 ts[3].y = 30.30 26 ts[4].x = 40 ts[4].y = 40.40 27 array size = 5 28 array population = 5 29 30 ---> TESTPOINT PASSED (psArray{Add data to void pointer array} | tst_psArray.c) 31 32 /***************************** TESTPOINT ******************************************\ 33 * TestFile: tst_psArray.c * 34 * TestPoint: psArray{Reallocate void pointer array bigger} * 35 * TestType: Positive * 36 \**********************************************************************************/ 37 38 Adding more elements to void pointer array... 39 ts[0].x = 0 ts[0].y = 0.00 40 ts[1].x = 10 ts[1].y = 10.10 41 ts[2].x = 20 ts[2].y = 20.20 42 ts[3].x = 30 ts[3].y = 30.30 43 ts[4].x = 40 ts[4].y = 40.40 44 ts[5].x = 50 ts[5].y = 50.50 45 ts[6].x = 60 ts[6].y = 60.60 46 ts[7].x = 70 ts[7].y = 70.70 47 ts[8].x = 80 ts[8].y = 80.80 48 ts[9].x = 90 ts[9].y = 90.90 49 array size = 10 50 array population = 10 51 52 ---> TESTPOINT PASSED (psArray{Reallocate void pointer array bigger} | tst_psArray.c) 53 54 /***************************** TESTPOINT ******************************************\ 55 * TestFile: tst_psArray.c * 56 * TestPoint: psArray{Reallocate void pointer array smaller} * 57 * TestType: Positive * 58 \**********************************************************************************/ 59 60 ts[0].x = 0 ts[0].y = 0.00 61 ts[1].x = 10 ts[1].y = 10.10 62 ts[2].x = 20 ts[2].y = 20.20 63 array size = 3 64 array population = 3 65 66 ---> TESTPOINT PASSED (psArray{Reallocate integer void pointer smaller} | tst_psArray.c) 67 68 /***************************** TESTPOINT ******************************************\ 69 * TestFile: tst_psArray.c * 70 * TestPoint: psArray{Reallocate with a null array} * 71 * TestType: Negative * 72 * ExpectedErrorText: Error message generator * 73 * ExpectedStatusValue: 0 * 74 \**********************************************************************************/ 75 76 <DATE><TIME>|<HOST>|I|testArray 2 77 Following should generate an error message. 3 78 <DATE><TIME>|<HOST>|E|psArrayRealloc (FILE:LINENO) 4 79 psArrayRealloc must be given a non-NULL psArray to resize. 80 81 ---> TESTPOINT PASSED (psArray{Reallocate with a null array} | tst_psArray.c) 82 83 /***************************** TESTPOINT ******************************************\ 84 * TestFile: tst_psArray.c * 85 * TestPoint: psArray{Remove valid item} * 86 * TestType: Positive * 87 \**********************************************************************************/ 88 89 Array size after removal = 2 90 ts[0].x = 10 ts[0].y = 10.10 91 ts[1].x = 20 ts[1].y = 20.20 92 93 ---> TESTPOINT PASSED (psArray{Remove valid item} | tst_psArray.c) 94 95 /***************************** TESTPOINT ******************************************\ 96 * TestFile: tst_psArray.c * 97 * TestPoint: psArray{Remove invalid item from array} * 98 * TestType: Positive * 99 \**********************************************************************************/ 100 101 102 ---> TESTPOINT PASSED (psArray{Remove invalid item from array} | tst_psArray.c) 103 104 /***************************** TESTPOINT ******************************************\ 105 * TestFile: tst_psArray.c * 106 * TestPoint: psArray{Remove item from null array} * 107 * TestType: Positive * 108 \**********************************************************************************/ 109 5 110 <DATE><TIME>|<HOST>|E|psArrayRemove (FILE:LINENO) 6 111 Specified psArray can not be NULL. 112 113 ---> TESTPOINT PASSED (psArray{Remove item from null array} | tst_psArray.c) 114 115 /***************************** TESTPOINT ******************************************\ 116 * TestFile: tst_psArray.c * 117 * TestPoint: psArray{Remove null item from array} * 118 * TestType: Positive * 119 \**********************************************************************************/ 120 121 122 ---> TESTPOINT PASSED (psArray{Remove null item from array} | tst_psArray.c) 123 124 /***************************** TESTPOINT ******************************************\ 125 * TestFile: tst_psArray.c * 126 * TestPoint: psArray{Free void pointer array} * 127 * TestType: Positive * 128 \**********************************************************************************/ 129 130 131 ---> TESTPOINT PASSED (psArray{Free void pointer array} | tst_psArray.c) 132 133 134 ---> TESTPOINT PASSED (psArray{psArray} | tst_psArray.c) 135 136 /***************************** TESTPOINT ******************************************\ 137 * TestFile: tst_psArray.c * 138 * TestPoint: psArray{psArray} * 139 * TestType: Positive * 140 \**********************************************************************************/ 141 142 /***************************** TESTPOINT ******************************************\ 143 * TestFile: tst_psArray.c * 144 * TestPoint: psArray{Create void pointer array} * 145 * TestType: Positive * 146 \**********************************************************************************/ 147 148 149 ---> TESTPOINT PASSED (psArray{Create void pointer array} | tst_psArray.c) 150 151 /***************************** TESTPOINT ******************************************\ 152 * TestFile: tst_psArray.c * 153 * TestPoint: psArray{Add data to void pointer array} * 154 * TestType: Positive * 155 \**********************************************************************************/ 156 157 ts[0].x = 100 ts[0].y = 101.00 158 ts[1].x = 90 ts[1].y = 90.90 159 ts[2].x = 80 ts[2].y = 80.80 160 ts[3].x = 70 ts[3].y = 70.70 161 ts[4].x = 60 ts[4].y = 60.60 162 ts[5].x = 50 ts[5].y = 50.50 163 ts[6].x = 40 ts[6].y = 40.40 164 ts[7].x = 30 ts[7].y = 30.30 165 ts[8].x = 20 ts[8].y = 20.20 166 ts[9].x = 10 ts[9].y = 10.10 167 array size = 10 168 array population = 10 169 170 ---> TESTPOINT PASSED (psArray{Add data to void pointer array} | tst_psArray.c) 171 172 /***************************** TESTPOINT ******************************************\ 173 * TestFile: tst_psArray.c * 174 * TestPoint: psArray{Sort data in array} * 175 * TestType: Positive * 176 \**********************************************************************************/ 177 178 ts[0].x = 10 ts[0].y = 10.10 179 ts[1].x = 20 ts[1].y = 20.20 180 ts[2].x = 30 ts[2].y = 30.30 181 ts[3].x = 40 ts[3].y = 40.40 182 ts[4].x = 50 ts[4].y = 50.50 183 ts[5].x = 60 ts[5].y = 60.60 184 ts[6].x = 70 ts[6].y = 70.70 185 ts[7].x = 80 ts[7].y = 80.80 186 ts[8].x = 90 ts[8].y = 90.90 187 ts[9].x = 100 ts[9].y = 101.00 188 189 ---> TESTPOINT PASSED (psArray{Sort data in array} | tst_psArray.c) 190 191 /***************************** TESTPOINT ******************************************\ 192 * TestFile: tst_psArray.c * 193 * TestPoint: psArray{Attempt to sort array} * 194 * TestType: Positive * 195 \**********************************************************************************/ 196 197 198 ---> TESTPOINT PASSED (psArray{Attempt to sort array} | tst_psArray.c) 199 200 /***************************** TESTPOINT ******************************************\ 201 * TestFile: tst_psArray.c * 202 * TestPoint: psArray{Free void pointer array} * 203 * TestType: Positive * 204 \**********************************************************************************/ 205 206 207 ---> TESTPOINT PASSED (psArray{Free void pointer array} | tst_psArray.c) 208 209 210 ---> TESTPOINT PASSED (psArray{psArray} | tst_psArray.c) 211 212 /***************************** TESTPOINT ******************************************\ 213 * TestFile: tst_psArray.c * 214 * TestPoint: psArray{psArrayAdd} * 215 * TestType: Positive * 216 \**********************************************************************************/ 217 218 219 ---> TESTPOINT PASSED (psArray{psArrayAdd} | tst_psArray.c) 220 -
trunk/psLib/test/dataIO/tst_psFits.c
r3264 r3286 6 6 * @author Robert DeSonia, MHPCC 7 7 * 8 * @version $Revision: 1.1 7$ $Name: not supported by cvs2svn $9 * @date $Date: 2005-02-1 7 19:26:25$8 * @version $Revision: 1.18 $ $Name: not supported by cvs2svn $ 9 * @date $Date: 2005-02-18 22:17:20 $ 10 10 * 11 11 * Copyright 2004-2005 Maui High Performance Computing Center, University of Hawaii … … 157 157 // build a table structure 158 158 psArray* table = psArrayAlloc(tableNumRows); 159 table->n = 0;159 psMetadata* header = NULL; 160 160 for (int row = 0; row < tableNumRows; row++) { 161 psMetadata* header = psMetadataAlloc(); 162 161 header = psMetadataAlloc(); 162 163 int id = psMemGetId(); 163 164 psMetadataAdd(header,PS_LIST_TAIL, "MYINT", 164 165 PS_TYPE_S32, PS_META_PRIMITIVE, 165 166 "psS32 Item", (psS32)row); 166 167 168 fprintf(stderr,"ref=%d(%d), ",(int)psMemGetRefCounter(header->list->tail->data), id); 169 170 id = psMemGetId(); 167 171 psMetadataAdd(header,PS_LIST_TAIL, "MYFLT", 168 172 PS_TYPE_F32, PS_META_PRIMITIVE, 169 173 "psF32 Item", (float)(1.0f/(float)(1+row))); 170 174 175 fprintf(stderr,"%d(%d), ",(int)psMemGetRefCounter(header->list->tail->data),id); 176 177 id = psMemGetId(); 171 178 psMetadataAdd(header,PS_LIST_TAIL, "MYDBL", 172 179 PS_TYPE_F64, PS_META_PRIMITIVE, 173 180 "psF64 Item", (double)(1.0/(double)(1+row))); 174 181 182 fprintf(stderr,"%d(%d), ",(int)psMemGetRefCounter(header->list->tail->data),id); 183 184 id = psMemGetId(); 175 185 psMetadataAdd(header,PS_LIST_TAIL, "MYBOOL", 176 186 PS_TYPE_BOOL, PS_META_PRIMITIVE, … … 178 188 (row%2 == 0)); 179 189 180 psArrayAdd(table,0,header); 190 fprintf(stderr,"%d(%d)\n",(int)psMemGetRefCounter(header->list->tail->data),id); 191 192 table->data[row] = header; 181 193 } 182 194 … … 185 197 psFree(table); 186 198 psFree(fitsFile); 199 200 psMemCheckLeaks(15,NULL,stderr,false); 187 201 188 202 return true; … … 570 584 } 571 585 572 573 574 586 static psS32 tst_psFitsReadHeader( void ) 575 587 { … … 809 821 810 822 811 if (! makeTable() ) {823 if (! makeTable()) { 812 824 return 1; 813 825 } … … 874 886 return 23; 875 887 } 876 877 888 } 878 889 -
trunk/psLib/test/fileUtils/tst_psFits.c
r3264 r3286 6 6 * @author Robert DeSonia, MHPCC 7 7 * 8 * @version $Revision: 1.1 7$ $Name: not supported by cvs2svn $9 * @date $Date: 2005-02-1 7 19:26:25$8 * @version $Revision: 1.18 $ $Name: not supported by cvs2svn $ 9 * @date $Date: 2005-02-18 22:17:20 $ 10 10 * 11 11 * Copyright 2004-2005 Maui High Performance Computing Center, University of Hawaii … … 157 157 // build a table structure 158 158 psArray* table = psArrayAlloc(tableNumRows); 159 table->n = 0;159 psMetadata* header = NULL; 160 160 for (int row = 0; row < tableNumRows; row++) { 161 psMetadata* header = psMetadataAlloc(); 162 161 header = psMetadataAlloc(); 162 163 int id = psMemGetId(); 163 164 psMetadataAdd(header,PS_LIST_TAIL, "MYINT", 164 165 PS_TYPE_S32, PS_META_PRIMITIVE, 165 166 "psS32 Item", (psS32)row); 166 167 168 fprintf(stderr,"ref=%d(%d), ",(int)psMemGetRefCounter(header->list->tail->data), id); 169 170 id = psMemGetId(); 167 171 psMetadataAdd(header,PS_LIST_TAIL, "MYFLT", 168 172 PS_TYPE_F32, PS_META_PRIMITIVE, 169 173 "psF32 Item", (float)(1.0f/(float)(1+row))); 170 174 175 fprintf(stderr,"%d(%d), ",(int)psMemGetRefCounter(header->list->tail->data),id); 176 177 id = psMemGetId(); 171 178 psMetadataAdd(header,PS_LIST_TAIL, "MYDBL", 172 179 PS_TYPE_F64, PS_META_PRIMITIVE, 173 180 "psF64 Item", (double)(1.0/(double)(1+row))); 174 181 182 fprintf(stderr,"%d(%d), ",(int)psMemGetRefCounter(header->list->tail->data),id); 183 184 id = psMemGetId(); 175 185 psMetadataAdd(header,PS_LIST_TAIL, "MYBOOL", 176 186 PS_TYPE_BOOL, PS_META_PRIMITIVE, … … 178 188 (row%2 == 0)); 179 189 180 psArrayAdd(table,0,header); 190 fprintf(stderr,"%d(%d)\n",(int)psMemGetRefCounter(header->list->tail->data),id); 191 192 table->data[row] = header; 181 193 } 182 194 … … 185 197 psFree(table); 186 198 psFree(fitsFile); 199 200 psMemCheckLeaks(15,NULL,stderr,false); 187 201 188 202 return true; … … 570 584 } 571 585 572 573 574 586 static psS32 tst_psFitsReadHeader( void ) 575 587 { … … 809 821 810 822 811 if (! makeTable() ) {823 if (! makeTable()) { 812 824 return 1; 813 825 } … … 874 886 return 23; 875 887 } 876 877 888 } 878 889
Note:
See TracChangeset
for help on using the changeset viewer.
