Changeset 37697 for branches/eam_branches/ipp-20140904
- Timestamp:
- Nov 30, 2014, 8:38:47 AM (12 years ago)
- Location:
- branches/eam_branches/ipp-20140904/Ohana/src
- Files:
-
- 1 added
- 5 edited
-
relastro/src/ImageOps.c (modified) (3 diffs)
-
relastro/src/UpdateMeasures.c (modified) (1 diff)
-
relastro/src/relastro_client.c (modified) (1 diff)
-
relphot/doc/timeline.txt (added)
-
relphot/src/ImageOps.c (modified) (4 diffs)
-
relphot/src/relphot_parallel_regions.c (modified) (1 diff)
Legend:
- Unmodified
- Added
- Removed
-
branches/eam_branches/ipp-20140904/Ohana/src/relastro/src/ImageOps.c
r37684 r37697 28 28 static off_t *imageIDs; // list of all image IDs 29 29 static off_t *imageIdx; // list of index for image IDs 30 # else 30 31 // as an alternative, we generate imageSeq, which directly maps imageID -> seq 32 static off_t *imageSeq; // list of index for image IDs 33 34 // MAX_ID requires 512M to store the image index 35 # define MAX_ID 0x8000000 36 static off_t minImageID = MAX_ID; 37 static off_t maxImageID = 0; 38 39 # else /* not using IMAGE_ID */ 31 40 static unsigned int *start; 32 41 static unsigned int *stop; … … 84 93 imageIdx[i] = i; 85 94 imageIDs[i] = image[i].imageID; 95 minImageID = MIN(minImageID, image[i].imageID); 96 maxImageID = MAX(maxImageID, image[i].imageID); 97 myAssert (image[i].imageID < MAX_ID, "image IDs too large for index memory"); 86 98 } 87 99 llsortpair (imageIDs, imageIdx, Nimage); 100 101 ALLOCATE (imageSeq, off_t, maxImageID + 1); 102 for (i = 0; i < maxImageID + 1; i++) { 103 imageSeq[i] = -1; // not yet assigned 104 } 105 106 for (i = 0; i < Nimage; i++) { 107 off_t N = image[i].imageID; 108 myAssert (imageSeq[N] == -1, "previously assigned"); 109 imageSeq[N] = i; 110 } 111 88 112 # else 89 113 ALLOCATE (start, unsigned, Nimage); … … 98 122 99 123 off_t getImageByID (off_t ID) { 124 # if USE_IMAGE_ID 125 126 if (imageSeq) { 127 myAssert (ID >= minImageID, "oops"); 128 myAssert (ID <= maxImageID, "oops"); 129 off_t N = imageSeq[ID]; 130 return N; 131 } 100 132 101 133 // we have a pair of vectors (imageIDs, imageIdx) sorted by imageIDs 102 134 // use bisection to find the specified image ID 103 135 104 # if USE_IMAGE_ID105 136 off_t Nlo, Nhi, N; 106 137 -
branches/eam_branches/ipp-20140904/Ohana/src/relastro/src/UpdateMeasures.c
r37622 r37697 3 3 // this function operates on Measure, not MeasureTiny 4 4 int UpdateMeasures (Catalog *catalog, int Ncatalog) { 5 6 off_t i, Nimage; 7 Image *image; 8 9 int badImage = 10 ID_IMAGE_ASTROM_NOCAL | 11 ID_IMAGE_ASTROM_POOR | 12 ID_IMAGE_ASTROM_FAIL | 13 ID_IMAGE_ASTROM_SKIP | 14 ID_IMAGE_ASTROM_FEW; 15 16 if (RESET_BAD_IMAGES) badImage = 0; 17 18 image = getimages (&Nimage, NULL); 19 20 for (i = 0; i < Ncatalog; i++) { 21 for (j = 0; j < catalog[i].Nmeasure; j++) { 22 MeasureTiny *measureT = &catalog[i].measureT[j]; 23 Measure *measure = catalog[i].measure ? &catalog[i].measure[j] : NULL; 24 25 off_t im = getImageByID (measureT->imageID); 26 27 // check that we have the 28 29 // skip images that have failed solutions (divergent or otherwise) 30 // XXX apply this or not?? 31 if (FALSE && (image[i].flags & badImage)) continue; 32 33 } 34 35 // printNcatTotal (); 36 37 return (TRUE); 38 } 39 40 // this function operates on Measure, not MeasureTiny 41 int UpdateMeasuresOld (Catalog *catalog, int Ncatalog) { 5 42 6 43 off_t i, Nimage; -
branches/eam_branches/ipp-20140904/Ohana/src/relastro/src/relastro_client.c
r36833 r37697 79 79 load_images (&db, skylist, FALSE); 80 80 81 // I can free the database after I have loaded the images... 82 81 83 // // load the image subset table from the specified location 82 84 // off_t Nimage; -
branches/eam_branches/ipp-20140904/Ohana/src/relphot/src/ImageOps.c
r37116 r37697 35 35 static off_t *imageIdx; // list of index for image IDs 36 36 37 // QQ // as an alternative, we generate imageSeq, which directly maps imageID -> seq 38 // QQ static off_t *imageSeq; // list of index for image IDs 39 // QQ 40 // QQ // MAX_ID requires 512M to store the image index 41 // QQ # define MAX_ID 0x8000000 42 // QQ static off_t minImageID = MAX_ID; 43 // QQ static off_t maxImageID = 0; 44 37 45 // elsewhere, we have loaded a set of catalogs with measures (catalog[cat].measure[meas]) 38 46 // each image has N_onImage[ImageIndex] measurements … … 95 103 96 104 TessellationIDsByImageName (&tessID[i], &projectID[i], &skycellID[i], image[i].name); 105 106 // QQ minImageID = MIN(minImageID, image[i].imageID); 107 // QQ maxImageID = MAX(maxImageID, image[i].imageID); 108 // QQ myAssert (image[i].imageID < MAX_ID, "image IDs too large for index memory"); 97 109 } 98 110 … … 100 112 // XXX does this break the imageID <-> projectID, etc match? 101 113 llsortpair (imageIDs, imageIdx, Nimage); 114 115 // QQ ALLOCATE (imageSeq, off_t, maxImageID + 1); 116 // QQ for (i = 0; i < maxImageID + 1; i++) { 117 // QQ imageSeq[i] = -1; // not yet assigned 118 // QQ } 119 // QQ 120 // QQ for (i = 0; i < Nimage; i++) { 121 // QQ off_t N = image[i].imageID; 122 // QQ myAssert (imageSeq[N] == -1, "previously assigned"); 123 // QQ imageSeq[N] = i; 124 // QQ } 102 125 } 103 126 … … 167 190 168 191 off_t getImageByID (off_t ID) { 192 193 // QQ if (imageSeq) { 194 // QQ myAssert (ID >= minImageID, "oops"); 195 // QQ myAssert (ID <= maxImageID, "oops"); 196 // QQ off_t N = imageSeq[ID]; 197 // QQ return N; 198 // QQ } 169 199 170 200 // we have a pair of vectors (imageIDs, imageIdx) sorted by imageIDs -
branches/eam_branches/ipp-20140904/Ohana/src/relphot/src/relphot_parallel_regions.c
r37593 r37697 55 55 /* launch processing on the parallel region hosts */ 56 56 if (!launch_region_hosts (regionHosts)) Shutdown ("error launching region hosts"); 57 MARKTIME ("finished relphot -parallel-regions: %f sec total\n", dtime); 57 58 58 59 // retrieve updated image parameters from the remote hosts (also set Image.mcal)
Note:
See TracChangeset
for help on using the changeset viewer.
