int EXP_LVL7 CS_bins (csFILE *strm,long32_t start,long32_t eofPos,int rs,Const void *rec,int (*comp)(Const void *pp,Const void *qq))
{
int st;
int flag = -1; /* initialization to keep gcc happy */
size_t rd_cnt;
long32_t nrecs;
long32_t hi_rec;
long32_t lo_rec;
long32_t test_rec;
long32_t test_pos;
char *buff;
/* Prepare for a possible error. */
buff = NULL;
/* Get a buffer which we can use for record I/O. */
buff = (char *)CS_malc ((unsigned)rs);
if (buff == NULL)
{
CS_erpt (cs_NO_MEM);
goto error;
}
/* Compute the portion of the file which is to be
searched. Quite often, we don't want to
search the whole thing. */
if (start < 0L)
{
start = CS_ftell (strm);
if (start < 0L)
{
CS_erpt (cs_IOERR);
goto error;
}
}
if (eofPos <= 0L)
{
st = CS_fseek (strm,0L,SEEK_END);
if (st != 0)
{
CS_erpt (cs_IOERR);
goto error;
}
eofPos = CS_ftell (strm);
if (eofPos < 0L)
{
CS_erpt (cs_IOERR);
goto error;
}
}
/* Compute the number of records in the file
which are to be searched. */
nrecs = (eofPos - start) / rs;
/* If there are no records, we don't have a match,
any any record would appear at the start. */
if (nrecs <= 0)
{
st = CS_fseek (strm,start,SEEK_SET);
if (st != 0)
{
CS_erpt (cs_IOERR);
goto error;
}
CS_free (buff);
buff = NULL;
return (0);
}
/* Set the starting and ending record numbers, where
the first record is numbered zero. */
hi_rec = nrecs - 1;
lo_rec = 0;
/* Continue to search the records until we have
exhausted all possibilities. The equal part
of this test is nescessary so that the last
record in the search gets compared for a match
or not. */
test_pos = start; /* initialization to keep gcc happy */
while (lo_rec <= hi_rec)
{
/* Select the next record to be tested in terms
of record number. */
test_rec = (hi_rec + lo_rec) / 2;
/* Convert this to a file position. */
test_pos = (long32_t)(test_rec * rs) + start;
/* Read in the new test record. */
st = CS_fseek (strm,test_pos,SEEK_SET);
if (st != 0)
{
CS_erpt (cs_IOERR);
goto error;
}
rd_cnt = CS_fread (buff,1,(unsigned)rs,strm);
if (rd_cnt != (size_t)rs)
{
if (ferror (strm)) CS_erpt (cs_IOERR);
else CS_erpt (cs_INV_FILE);
goto error;
}
/* Compare with our search record. */
flag = (*comp)(buff,rec);
if (flag > 0)
{
/* Here if our test record is past where
our search record will be if it does
indeed exist. We can exclude this
record (that we just read) and all
records past it from the search. */
hi_rec = test_rec - 1;
}
else if (flag < 0)
{
/* Here if the test record is before where
our search record will be if it does
indeed exist. We can exclude this
record and all which precede it from
the search. */
lo_rec = test_rec + 1;
}
else
{
/* We have found a matching record. Before
we return, we need to make sure that if
there are duplicate records in the file,
we are returning with the file positioned
to read the first of such duplicates. */
do
{
test_pos -= (long32_t)rs;
if (test_pos < start)
{
/* The last record tested is the
first in the search area.
Seek to search and break,
we're all done. */
st = CS_fseek (strm,start,SEEK_SET);
if (st != 0)
{
CS_erpt (cs_IOERR);
goto error;
}
break;
}
/* Seek to the record just prior
to the last one tested and
read it in. */
st = CS_fseek (strm,test_pos,SEEK_SET);
if (st != 0)
{
CS_erpt (cs_IOERR);
goto error;
}
rd_cnt = CS_fread (buff,1,(unsigned)rs,strm);
if (rd_cnt != (size_t)rs)
{
if (ferror (strm)) CS_erpt (cs_IOERR);
else CS_erpt (cs_INV_FILE);
goto error;
}
/* See if this record also matches
our key. NOTE, that the read
positions the file back to the
last record tested, which is the
desired file position if the
match test fails. */
flag = (*comp)(buff,rec);
} while (flag == 0);
/* Reset flag to zero, i.e. we got here because
we found a matching record. */
flag = 0;
/* Now we can return. */
break;
}
}
/* If flag is negative here, the file is correctly
positioned since we have read the record in and
the file is positioned for the next. If flag
is greater than zero, we need to move the file
pointer back one record so that the user will
be able to re-read the current record. */
if (flag > 0)
{
st = CS_fseek (strm,test_pos,SEEK_SET);
if (st != 0)
{
CS_erpt (cs_IOERR);
goto error;
}
}
/* OK, return and tell the user if we found the
desired record or not. */
CS_free (buff);
buff = NULL;
return (flag == 0);
error:
if (buff != NULL) CS_free (buff);
return (-1);
}
int EXP_LVL9 CSdtcomp ( Const char *inpt,
Const char *outp,
int flags,
Const char *elipsoid,
int (*err_func)(char *mesg)
)
{
int st;
int test;
int demo;
int warn;
int dummy;
int cancel;
int err_cnt;
int crypt;
size_t rdCnt;
size_t wrCnt;
char *cp;
csFILE *inStrm;
csFILE *elStrm;
csFILE *outStrm;
struct cs_DtcmpT_ *tp;
struct cs_DtTypeT_ *typPtr;
cs_magic_t magic;
char err_seg [18];
char buff [128];
char err_msg [128];
char last_name [48];
__ALIGNMENT__2 /* For some versions of Sun compiler. */
struct cs_Dtdef_ dtdef;
crypt = ((flags & cs_CMPLR_CRYPT) != 0);
demo = ((flags & cs_CMPLR_DEMO) != 0);
test = ((flags & cs_CMPLR_TEST) != 0);
warn = ((flags & cs_CMPLR_WARN) != 0);
/* Open the source file. */
inStrm = CS_fopen (inpt,_STRM_TXTRD);
if (inStrm == NULL)
{
sprintf (err_msg,"Couldn't open %s for input.",inpt);
cancel = (*err_func)(err_msg);
return (1);
}
/* Open the output file and write the magic number. BINRW mode
creates a new file with read and write access. */
outStrm = CS_fopen (outp,_STRM_BINRW);
if (outStrm == NULL)
{
sprintf (err_msg,"Couldn't open %s for output.",outp);
cancel = (*err_func)(err_msg);
CS_fclose (inStrm);
return (1);
}
if (demo) magic = cs_DTDEF_MAGIC;
else magic = cs_DTDEF_MAGIC;
CS_bswap (&magic,"l");
wrCnt = CS_fwrite ((char *)&magic,1,sizeof (magic),outStrm);
if (wrCnt != sizeof (magic))
{
sprintf (err_msg,"Failure detected during write to %s.",outp);
cancel = (*err_func)(err_msg);
CS_fclose (outStrm);
CS_remove (outp); /*lint !e534 */
CS_fclose (inStrm);
return (1);
}
/* If we have been given an ellipsoid file name, we open it now. */
if (elipsoid != NULL && *elipsoid != '\0')
{
elStrm = CS_fopen (elipsoid,_STRM_BINRD);
if (elStrm == NULL)
{
sprintf (err_msg,"Couldn't open %s as an Ellipsoid Dictionary.",elipsoid);
cancel = (*err_func)(err_msg);
CS_fclose (inStrm);
return (1);
}
rdCnt = CS_fread (&magic,1,sizeof (magic),elStrm);
CS_bswap (&magic,"l");
if (rdCnt != sizeof (magic) ||
(demo && magic != cs_ELDEF_MAGIC) ||
(!demo && magic != cs_ELDEF_MAGIC))
{
sprintf (err_msg,"%s is not an Elipsoid Dictionary file.",elipsoid);
cancel = (*err_func)(err_msg);
CS_fclose (inStrm);
CS_fclose (elStrm);
return (1);
}
}
else
{
elStrm = NULL;
}
/* Process each line in the source file. */
line_nbr = 0;
err_cnt = 0;
cancel = FALSE;
memset (&dtdef,'\0',sizeof (dtdef));
dtdef.delta_X = no_value;
dtdef.delta_Y = no_value;
dtdef.delta_Z = no_value;
dtdef.rot_X = no_value;
dtdef.rot_Y = no_value;
dtdef.rot_Z = no_value;
dtdef.bwscale = no_value;
dtdef.to84_via = cs_DTCTYP_NONE;
while (CS_fgets (buff,sizeof (buff),inStrm) != NULL)
{
if (cancel)
{
CS_fclose (inStrm);
CS_fclose (outStrm);
if (elStrm != NULL) CS_fclose (elStrm);
CS_remove (outp); /*lint !e534 */
return (err_cnt);
}
line_nbr += 1;
/* Ignore comments and blank lines. */
CS_trim (buff);
if (buff [0] == '#' || buff [0] == '\0')
{
continue;
}
cp = buff;
while ((cp = strchr (cp,'#')) != NULL)
{
if (*(cp + 1) != '#' &&
*(cp - 1) != '\\')
{
*cp = '\0';
break;
}
}
/* Run the line through the table parser. We
see what type of line we have. */
cp = buff;
tp = (struct cs_DtcmpT_ *)CS_tpars (&cp,cs_DtcmpT,sizeof (struct cs_DtcmpT_));
if (tp == NULL)
{
CS_stncp (err_seg,buff,sizeof (err_seg));
sprintf (err_msg,"Invalid keyword (%s) on line %d.",err_seg,line_nbr);
cancel = (*err_func)(err_msg);
err_cnt += 1;
dtdef.key_nm [0] = '\0';
continue;
}
/* Here when we have a valid line. Cp points to the first
character after the colon. */
CS_trim (cp);
switch (tp->type) {
case DT_NAME:
/* Here each time we encounter a new datum
name. We see if there is an existing
datum which must be written. */
if (dtdef.key_nm [0] != '\0' && /* Skip 1st one. */
(test || CS_stricmp (dtdef.group,"TEST")))
{
st = CSdtdefwr (outStrm,&dtdef,crypt,warn,elStrm,err_func);
if (st >= 0) err_cnt += st;
else
{
cancel = TRUE;
err_cnt += -st;
}
}
/* Prepare for the next coordinate system. */
memset (&dtdef,'\0',sizeof (dtdef));
dtdef.delta_X = no_value;
dtdef.delta_Y = no_value;
dtdef.delta_Z = no_value;
dtdef.rot_X = no_value;
dtdef.rot_Y = no_value;
dtdef.rot_Z = no_value;
dtdef.bwscale = no_value;
dtdef.protect = FALSE;
dtdef.to84_via = cs_DTCTYP_NONE;
CS_stncp (dtdef.key_nm,cp,sizeof (dtdef.key_nm));
st = CS_nampp (dtdef.key_nm);
if (st != 0)
{
sprintf (err_msg,"%s is not a valid datum key name; line %d.",cp,line_nbr);
cancel = (*err_func)(err_msg);
err_cnt += 1;
}
break;
case DESC_NM:
if (strlen (cp) >= sizeof (dtdef.name) && warn)
{
sprintf (err_msg,"Warning: Description for %s on line %d is too long.",dtdef.key_nm,line_nbr);
cancel = (*err_func)(err_msg);
}
CS_stncp (dtdef.name,cp,sizeof (dtdef.name));
break;
case ELLP_NM:
CS_stncp (dtdef.ell_knm,cp,sizeof (dtdef.ell_knm));
break;
case LOCATION:
if (strlen (cp) >= sizeof (dtdef.locatn) && warn)
{
sprintf (err_msg,"Warning: Country list for %s on line %d is too long.",dtdef.key_nm,line_nbr);
cancel = (*err_func)(err_msg);
}
CS_stncp (dtdef.locatn,cp,sizeof (dtdef.locatn));
break;
case COUNTRY:
if (strlen (cp) >= sizeof (dtdef.cntry_st) && warn)
{
sprintf (err_msg,"Warning: Country list for %s on line %d is too long.",dtdef.key_nm,line_nbr);
cancel = (*err_func)(err_msg);
}
CS_stncp (dtdef.cntry_st,cp,sizeof (dtdef.cntry_st));
break;
case SOURCE:
if (strlen (cp) >= sizeof (dtdef.source) && warn)
{
sprintf (err_msg,"Warning: Source for %s on line %d is too long.",dtdef.key_nm,line_nbr);
cancel = (*err_func)(err_msg);
}
CS_stncp (dtdef.source,cp,sizeof (dtdef.source));
break;
case DELTA_X:
dtdef.delta_X = atof (cp);
if (warn && (fabs (dtdef.delta_X) > 2000.0))
{
sprintf (err_msg,"Warning: Delta X value for %s on line %d is suspicious.",dtdef.key_nm,line_nbr);
cancel = (*err_func)(err_msg);
}
break;
case DELTA_Y:
dtdef.delta_Y = atof (cp);
if (warn && (fabs (dtdef.delta_Y) > 2000.0))
{
sprintf (err_msg,"Warning: Delta Y value for %s on line %d is suspicious.",dtdef.key_nm,line_nbr);
cancel = (*err_func)(err_msg);
}
break;
case DELTA_Z:
dtdef.delta_Z = atof (cp);
if (warn && (fabs (dtdef.delta_Z) > 2000.0))
{
sprintf (err_msg,"Warning: Delta Z value for %s on line %d is suspicious.",dtdef.key_nm,line_nbr);
cancel = (*err_func)(err_msg);
}
break;
case ROT_X:
dtdef.rot_X = atof (cp);
if (warn && (fabs (dtdef.rot_X) >= 60.0))
{
sprintf (err_msg,"Warning: X Rotation value for %s on line %d is suspicious.",dtdef.key_nm,line_nbr);
cancel = (*err_func)(err_msg);
}
break;
case ROT_Y:
dtdef.rot_Y = atof (cp);
if (warn && (fabs (dtdef.rot_Y) >= 60.0))
{
sprintf (err_msg,"Warning: Y Rotation value for %s on line %d is suspicious.",dtdef.key_nm,line_nbr);
cancel = (*err_func)(err_msg);
}
break;
case ROT_Z:
dtdef.rot_Z = atof (cp);
if (warn && (fabs (dtdef.rot_Z) >= 60.0))
{
sprintf (err_msg,"Warning: Y Rotation value for %s on line %d is suspicious.",dtdef.key_nm,line_nbr);
cancel = (*err_func)(err_msg);
}
break;
case BWSCALE:
dtdef.bwscale = atof (cp);
if (warn && (fabs (dtdef.bwscale) >= 25.0))
{
sprintf (err_msg,"Warning: Bursa Wolfe scale value for %s on line %d is suspicious.",dtdef.key_nm,line_nbr);
cancel = (*err_func)(err_msg);
}
break;
case USE:
dtdef.to84_via = cs_DTCTYP_NONE;
for (typPtr = cs_DtTypeT;typPtr->type != cs_DTCTYP_NONE;typPtr += 1)
{
if (!CS_stricmp (cp,typPtr->label))
{
dtdef.to84_via = typPtr->type;
break;
}
}
if (dtdef.to84_via == cs_DTCTYP_NONE)
{
sprintf (err_msg,"Invalid 'USE' specification detected on line %d.",line_nbr);
cancel = (*err_func)(err_msg);
err_cnt += 1;
}
break;
case GROUP:
if (strlen (cp) >= sizeof (dtdef.group) && warn)
{
sprintf (err_msg,"Warning: Group for %s on line %d is too long.",dtdef.key_nm,line_nbr);
cancel = (*err_func)(err_msg);
}
CS_stncp (dtdef.group,cp,sizeof (dtdef.group));
break;
case EPSG_NBR:
dtdef.epsgNbr = atoi (cp);
break;
default:
sprintf (err_msg,"Software problem detected at line %d in module %s.",__LINE__,__FILE__);
(void)(*err_func)(err_msg);
cancel = TRUE;
break;
}
/* On to the next input line. */
}
CS_fclose (inStrm);
/* Write out the last coordinate system if not in error. */
if (dtdef.key_nm [0] != '\0' && (test || CS_stricmp (dtdef.group,"TEST")))
{
st = CSdtdefwr (outStrm,&dtdef,crypt,warn,elStrm,err_func);
if (st >= 0) err_cnt += st;
else
{
cancel = TRUE;
err_cnt += -st;
}
}
if (elStrm != NULL) CS_fclose (elStrm);
if (cancel)
{
CS_fclose (outStrm);
CS_remove (outp); /*lint !e534 */
return (err_cnt);
}
/* Sort the output file. */
CS_fseek (outStrm,(long)sizeof (magic),SEEK_SET);
CS_ips (outStrm,sizeof (dtdef),0L,(CMPFUNC_CAST)CS_dtcmp); /*lint !e534 */
/* Verify that there are no duplicates. */
CS_fseek (outStrm,(long)sizeof (magic),0);
CS_dtrd (outStrm,&dtdef,&dummy); /*lint !e534 */
CS_stncp (last_name,dtdef.key_nm,sizeof (last_name));
while (!cancel && CS_dtrd (outStrm,&dtdef,&dummy) != 0)
{
if (!CS_stricmp (dtdef.key_nm,last_name))
{
sprintf (err_msg,"Datum key name %s appears more than once.",last_name);
cancel = (*err_func)(err_msg);
err_cnt += 1;
}
CS_stncp (last_name,dtdef.key_nm,sizeof (last_name));
}
CS_fclose (outStrm);
/* Remove the output file if there were errors. */
if (err_cnt != 0)
{
CS_remove (outp); /*lint !e534 */
}
return (err_cnt);
}
int EXP_LVL7 CS_ips (csFILE *strm,short rs,long32_t eofPos,int (*comp)(Const void *pp,Const void *qq))
{
int st;
size_t rec_cnt; /* Record count */
size_t buf_siz; /* Buffer size */
size_t rd_cnt; /* Read check. */
size_t wr_cnt; /* Write check. */
long32_t beg; /* File position of the beginning of
the portion of the file which we
are to sort but remains unsorted. */
long32_t end; /* File position of the end of the
portion of the file which we are
to sort but remains unsorted. */
void *buff; /* Pointer to malloc'ed sort buffer. */
/* Prepare for a possible error. */
buff = NULL;
/* Establish the extrema of the sort. We support
sorting only a portion of a file. */
beg = CS_ftell (strm);
if (beg < 0L)
{
CS_erpt (cs_IOERR);
goto error;
}
if (eofPos <= 0L)
{
st = CS_fseek (strm,0L,SEEK_END);
if (st != 0)
{
CS_erpt (cs_IOERR);
goto error;
}
end = CS_ftell (strm);
if (end < 0L)
{
CS_erpt (cs_IOERR);
goto error;
}
st = CS_fseek (strm,beg,SEEK_SET);
if (st != 0)
{
CS_erpt (cs_IOERR);
goto error;
}
}
else
{
end = eofPos;
}
/* If there is nothing to sort, we done. */
if (end <= beg)
{
return 0;
}
/* Set up our buffer area. */
buf_siz = (size_t)(end - beg);
buff = malloc (buf_siz);
if (buff == NULL)
{
CS_erpt (cs_NO_MEM);
goto error;
}
/* Compute some basic parameters for the sort. */
rec_cnt = buf_siz / (unsigned short)rs;
/* Read in the entire file. */
rd_cnt = CS_fread (buff,1,buf_siz,strm);
if (rd_cnt != buf_siz)
{
if (ferror (strm)) CS_erpt (cs_IOERR);
else CS_erpt (cs_INV_FILE);
goto error;
}
/* Sort it. */
qsort (buff,rec_cnt,rs,(int (_cdecl *)(Const void *pp,Const void *qq))comp); /*lint !e732 */
/* Write it back out. */
st = CS_fseek (strm,beg,SEEK_SET);
if (st != 0)
{
CS_erpt (cs_IOERR);
goto error;
}
wr_cnt = CS_fwrite (buff,1,buf_siz,strm);
if (wr_cnt != buf_siz)
{
if (ferror (strm)) CS_erpt (cs_IOERR);
else CS_erpt (cs_DISK_FULL);
goto error;
}
/* Clean up */
CS_fseek (strm,beg,SEEK_SET);
free (buff);
return (1);
error:
if (buff != NULL) free (buff);
return (-1);
}
/*****************************************************************************
Constructor
*/
struct csGeoid99GridFile_* CSnewGeoid99GridFile (Const char *path,long32_t bufferSize,ulong32_t flags,double density)
{
extern double cs_K360;
extern char cs_DirsepC;
extern char cs_ExtsepC;
extern char csErrnam [];
size_t readCount;
long lngTmp;
double lngMin, lngMax;
char *cp1, *cp2;
csFILE *fstr;
struct csGeoid99GridFile_* __This;
char cTemp [MAXPATH];
struct csGeoid99Hdr_ geoid99Hdr;
/* Prepare for an error. */
__This = NULL;
fstr = NULL;
/* Malloc and initialize */
__This = CS_malc (sizeof (struct csGeoid99GridFile_));
if (__This == NULL)
{
CS_erpt (cs_NO_MEM);
goto error;
}
CSinitGeoid99 (__This);
/* Set default values for all members. */
__This->bufferSize = bufferSize;
if (__This->bufferSize < 0) __This->bufferSize = 0;
/* Save file path/name. */
CS_stncp (__This->filePath,path,sizeof (__This->filePath));
CS_stncp (cTemp,path,sizeof (cTemp));
/* Set up the type of file. Get cp1 to point at the file
name, and cp2 to point at the extension. We consider it
an error if we are not given a full path name. Note,
we care not about the format of the drive specification.
But there must be at least one directory and there must
be an extension. */
cp1 = strrchr (cTemp,cs_DirsepC);
if (cp1 == NULL)
{
CS_stncp (csErrnam,__This->filePath,MAXPATH);
CS_erpt (cs_INV_FILE);
goto error;
}
cp1 += 1;
cp2 = strchr (cp1,cs_ExtsepC);
if (cp2 == NULL)
{
CS_stncp (csErrnam,__This->filePath,MAXPATH);
CS_erpt (cs_INV_FILE);
goto error;
}
*cp2++ = '\0';
CS_stncp (__This->fileName,cp1,sizeof (__This->fileName));
/* The thing should have a .bin extension to be processed by us. */
if (CS_stricmp (cp2,"bin"))
{
CS_stncp (csErrnam,__This->filePath,MAXPATH);
CS_erpt (cs_INV_FILE);
goto error;
}
/* Get the file information header. */
fstr = CS_fopen (__This->filePath,_STRM_BINRD);
if (fstr == NULL)
{
CS_stncp (csErrnam,__This->filePath,MAXPATH);
CS_erpt (cs_DTC_FILE);
goto error;
}
readCount = CS_fread (&geoid99Hdr,1,sizeof (geoid99Hdr),fstr);
if (readCount != sizeof (geoid99Hdr))
{
CS_stncp (csErrnam,__This->filePath,MAXPATH);
CS_erpt (cs_INV_FILE);
goto error;
}
if (CS_ferror (fstr))
{
CS_stncp (csErrnam,__This->filePath,MAXPATH);
CS_erpt (cs_IOERR);
goto error;
}
/* Determine the size of the file. */
if (CS_fseek (fstr,0L,SEEK_END))
{
CS_stncp (csErrnam,__This->filePath,MAXPATH);
CS_erpt (cs_IOERR);
goto error;
}
__This->fileSize = CS_ftell (fstr);
if (__This->fileSize < 0L)
{
CS_stncp (csErrnam,__This->filePath,MAXPATH);
CS_erpt (cs_IOERR);
goto error;
}
/* This constructor doesn't need the file any more. */
CS_fclose (fstr);
fstr = NULL;
/* Swap the bytes if necessary. In all the data files I've seen, iKind is 32
bit 1. If it is a one in the structure, than the file is in the same byte
order as the machine we are running on, and swapping is unnecessary. If
iKind is not a one, we assume that is because of byte order, and we do a
swap. Note, however, that we preserve iKind as it was before swapping so
that we know whether to swap or not in the other functions in this code
module. */
__This->iKind = geoid99Hdr.iKind;
if (geoid99Hdr.iKind != 1L)
{
/* CSbswap is a variation on CS_bswap. CSbswap always swaps. */
CSbswap (&geoid99Hdr,cs_BSWP_Geoid99Hdr);
}
/* At this point, geoid99Hdr.iKind should be a one, or either the file
is corrupted, or we don't understand the file format properly. */
if (geoid99Hdr.iKind != 1L)
{
CS_stncp (csErrnam,__This->filePath,MAXPATH);
CS_erpt (cs_INV_FILE);
goto error;
}
/* Extract the important stuff from the header. Note that the longitude in the header
is a zero thru 360 value, proceeding east from Greenwich. This makes a lot of sense
since Alaska crosses the 190 degree crack. However, it is inconsistent with
all the other stuff. So, we do the following kludge, which is consistent with the
NADCON data files. */
lngMin = geoid99Hdr.lngMin;
lngMax = lngMin + (geoid99Hdr.lngDelta * (geoid99Hdr.lngCount - 1));
if (lngMin >= 180.0 || lngMax > 180.0)
{
__This->coverage.southWest [LNG] = geoid99Hdr.lngMin - cs_K360;
}
else
{
__This->coverage.southWest [LNG] = geoid99Hdr.lngMin;
}
__This->coverage.southWest [LAT] = geoid99Hdr.latMin;
__This->deltaLng = geoid99Hdr.lngDelta;
__This->deltaLat = geoid99Hdr.latDelta;
__This->coverage.northEast [LNG] = __This->coverage.southWest [LNG] + (geoid99Hdr.lngDelta * (geoid99Hdr.lngCount - 1));
__This->coverage.northEast [LAT] = __This->coverage.southWest [LAT] + (geoid99Hdr.latDelta * (geoid99Hdr.latCount - 1));
__This->coverage.density = (__This->deltaLng < __This->deltaLat) ? __This->deltaLng : __This->deltaLat;
if (density != 0.0) __This->coverage.density = density;
__This->elementCount = geoid99Hdr.lngCount;
__This->recordCount = geoid99Hdr.latCount;
__This->recordSize = geoid99Hdr.lngCount * (int)sizeof (float);
/* Verify the integrity of the file. */
lngTmp = __This->recordCount * __This->recordSize + sizeof (geoid99Hdr);
if (lngTmp != __This->fileSize)
{
CS_stncp (csErrnam,__This->filePath,MAXPATH);
CS_erpt (cs_INV_FILE);
goto error;
}
/* Now that we know recordSize, we can adjust the bufferSize for maximum
efficiency. */
if (__This->bufferSize > __This->fileSize)
{
__This->bufferSize = __This->fileSize;
}
else
{
if (__This->bufferSize > (3 * __This->recordSize))
{
/* Maximum efficiency is obtained with a buffer size whch is
a multiple of the record size. */
__This->bufferSize = (__This->bufferSize / __This->recordSize) * __This->recordSize;
}
else
{
/* We require a minimum buffer size of 3 records. */
__This->bufferSize = 3 * __This->recordSize;
}
}
return (__This);
error:
CSdeleteGeoid99GridFile (__This);
return NULL;
}
int CStest6 (int verbose,int crypt)
{
int st;
int cnt;
int flag;
int my_crypt;
csFILE *csStrm;
struct tst_lst_ *tp;
char last_name [48];
__ALIGNMENT__1 /* Required by some Sun compilers. */
struct cs_Csdef_ cs_def;
printf ("Testing sort and binary search functions.\n");
/* This test sorts the Coordinate System Dictionary, the
largest of the three dictionaries, into reverse order.
Then does some CS_bins calls. Then resorts back into
normal order. This is a resaonable good exercise of
the sort function which normally sorts files with a
single entry out of order. */
if (verbose)
{
printf ("Sorting Coordinate System Dictionary into reverse order.\n");
}
csStrm = CS_csopn (_STRM_BINUP);
if (csStrm == NULL)
{
printf ("Coordinate System Dictionary open failed. Is it write protected?.\n");
return 1;
}
/* NOTE: CS_csopn leaves the file positioned after
the magic number. CS_ips always starts sorting
at the current file position. */
CS_ips (csStrm,sizeof (struct cs_Csdef_),-1L,(CMPFUNC_CAST)CStest6cmp);
/* The dictionary should now be in reverse order. We
check the order now. CS_ips is supposed to return
with the file position where it was when we started. */
if (verbose)
{
printf ("Checking reverse order of Coordinate System Dictionary.\n");
}
cnt = 0;
st = CS_csrd (csStrm,&cs_def,&my_crypt);
if (st == 0)
{
printf ("CS_ips hosed the Coordinate System Dictionary.\n");
CS_fclose (csStrm);
return (1);
}
CS_stncp (last_name,cs_def.key_nm,sizeof (last_name));
while (CS_csrd (csStrm,&cs_def,&my_crypt))
{
cnt += 1;
if (verbose && (cnt % 10) == 0) putchar ('.');
st = CS_stricmp (last_name,cs_def.key_nm);
if (st < 0)
{
printf ("\nSort did not sort entire file correctly!!!\n");
CS_fclose (csStrm);
return (1);
}
else if (st == 0)
{
printf ("\nSort left duplicate entries when sorting entire file!!!\n");
CS_fclose (csStrm);
return (1);
}
}
if (verbose) printf (" OK.\n");
/* If we are still here, the sort worked correctly.
Use the sort_tst list as a list of names to binary
search on. It includes the normal first and last;
which should now be the last and the first. */
tp = sort_tst;
while (tp->name [0] != '\0')
{
if (verbose)
{
printf ("Searching for %s in reversed CS Dictionary.",tp->name);
}
CS_stncp (cs_def.key_nm,tp->name,sizeof (cs_def.key_nm));
flag = CS_bins (csStrm,(long32_t)sizeof (cs_magic_t),(long32_t)0,sizeof (cs_def),
(char *)&cs_def,(CMPFUNC_CAST)CStest6cmp);
if (flag <= 0)
{
printf ("CS_bins failed on file in reverse order!!!\n");
CS_fclose (csStrm);
return (1);
}
if (verbose) printf (" OK.\n");
tp += 1;
}
/* OK, return the file back to normal sorted order. */
if (verbose)
{
printf ("Sorting Coordinate System Dictionary back to normal order.\n");
}
CS_fseek (csStrm,(long)sizeof (cs_magic_t),SEEK_SET);
CS_ips (csStrm,sizeof (struct cs_Csdef_),-1L,(CMPFUNC_CAST)CS_cscmp);
/* One more time, check that the order is correct. */
if (verbose)
{
printf ("Checking Coordinate System Dictionary normal sorted order.\n");
}
cnt = 0;
st = CS_csrd (csStrm,&cs_def,&my_crypt);
if (st == 0)
{
printf ("CS_ips hosed the Coordinate System Dictionary.\n");
CS_fclose (csStrm);
return (1);
}
CS_stncp (last_name,cs_def.key_nm,sizeof (last_name));
while (CS_csrd (csStrm,&cs_def,&my_crypt))
{
cnt += 1;
if (verbose && (cnt % 10) == 0) putchar ('.');
st = CS_stricmp (last_name,cs_def.key_nm);
if (st > 0)
{
printf ("Sort did not sort entire file correctly!!!\n");
CS_fclose (csStrm);
return (1);
}
else if (st == 0)
{
printf ("Sort left duplicate entries when sorting entire file!!!\n");
CS_fclose (csStrm);
return (1);
}
}
if (verbose) printf (" OK.\n");
/* OK, if we are still here, we passed the test. */
CS_csDictCls (csStrm);
return (0);
}
/*****************************************************************************
Constructor
*/
struct csGeoid96GridFile_* CSnewGeoid96GridFile (Const char *path,long32_t bufferSize,ulong32_t flags,double density)
{
extern char cs_DirsepC;
extern char cs_ExtsepC;
extern char csErrnam [];
size_t readCount;
long lngTmp;
char *cp1, *cp2;
csFILE *fstr;
struct csGeoid96GridFile_* __This;
char cTemp [MAXPATH];
struct csNadconFileHdr_ nadconHdr;
/* Prepare for an error. */
__This = NULL;
fstr = NULL;
/* Malloc and initialize */
__This = CS_malc (sizeof (struct csGeoid96GridFile_));
if (__This == NULL)
{
CS_erpt (cs_NO_MEM);
goto error;
}
CSinitGeoid96 (__This);
/* Set default values for all members. */
__This->bufferSize = bufferSize;
if (__This->bufferSize < 0) __This->bufferSize = 0;
/* Save file path/name. */
CS_stncp (__This->filePath,path,sizeof (__This->filePath));
CS_stncp (cTemp,path,sizeof (cTemp));
/* Set up the type of file. Get cp1 to point at the file
name, and cp2 to point at the extension. We consider it
an error if we are not given a full path name. Note,
we care not about the format of the drive specification.
But there must be at least one directory and there must
be an extension. */
cp1 = strrchr (cTemp,cs_DirsepC);
if (cp1 == NULL)
{
CS_stncp (csErrnam,__This->filePath,MAXPATH);
CS_erpt (cs_INV_FILE);
goto error;
}
cp1 += 1;
cp2 = strchr (cp1,cs_ExtsepC);
if (cp2 == NULL)
{
CS_stncp (csErrnam,__This->filePath,MAXPATH);
CS_erpt (cs_INV_FILE);
goto error;
}
*cp2++ = '\0';
CS_stncp (__This->fileName,cp1,sizeof (__This->fileName));
/* The thing should have a .geo extension to be processed by us. */
if (CS_stricmp (cp2,"geo"))
{
CS_stncp (csErrnam,__This->filePath,MAXPATH);
CS_erpt (cs_INV_FILE);
goto error;
}
/* Get the file information header. */
fstr = CS_fopen (__This->filePath,_STRM_BINRD);
if (fstr == NULL)
{
CS_stncp (csErrnam,__This->filePath,MAXPATH);
CS_erpt (cs_DTC_FILE);
goto error;
}
readCount = CS_fread (&nadconHdr,1,sizeof (nadconHdr),fstr);
if (readCount != sizeof (nadconHdr))
{
CS_stncp (csErrnam,__This->filePath,MAXPATH);
CS_erpt (cs_INV_FILE);
goto error;
}
if (CS_ferror (fstr))
{
CS_stncp (csErrnam,__This->filePath,MAXPATH);
CS_erpt (cs_IOERR);
goto error;
}
/* Determine the size of the file. */
if (CS_fseek (fstr,0L,SEEK_END))
{
CS_stncp (csErrnam,__This->filePath,MAXPATH);
CS_erpt (cs_IOERR);
goto error;
}
__This->fileSize = CS_ftell (fstr);
if (__This->fileSize < 0L)
{
CS_stncp (csErrnam,__This->filePath,MAXPATH);
CS_erpt (cs_IOERR);
goto error;
}
/* This constructor doesn't need the file any more. */
CS_fclose (fstr);
fstr = NULL;
/* Swap the bytes if necessary. */
CS_bswap (&nadconHdr,cs_BSWP_NadconFileHdr);
/* The extra stuff here is required as conversions of floats to doubles
does not always provide precise results. To get the precise results we
require, we assume that the value (which is in degrees) is an intergal
number of seconds. */
lngTmp = (long)(((double)nadconHdr.del_lng * 3600.0) + 0.4);
__This->deltaLng = ((double)lngTmp / 3600.0);
lngTmp = (long)(((double)nadconHdr.del_lat * 3600.0) + 0.4);
__This->deltaLat = ((double)lngTmp / 3600.0);
/* Now we can do the rest of this stuff. */
__This->coverage.southWest [LNG] = nadconHdr.min_lng;
__This->coverage.southWest [LAT] = nadconHdr.min_lat;
__This->coverage.northEast [LNG] = nadconHdr.min_lng + (__This->deltaLng * (nadconHdr.ele_cnt - 1));
__This->coverage.northEast [LAT] = nadconHdr.min_lat + (__This->deltaLat * (nadconHdr.rec_cnt - 1));
__This->coverage.density = (__This->deltaLng < __This->deltaLat) ? __This->deltaLng : __This->deltaLat;
if (density != 0.0) __This->coverage.density = density;
__This->elementCount = nadconHdr.ele_cnt;
__This->recordCount = nadconHdr.rec_cnt;
__This->recordSize = nadconHdr.ele_cnt * (int)sizeof (float) + (int)sizeof (long);
/* Verify the integrity of the file. */
lngTmp = (__This->recordCount + 1) * __This->recordSize;
if (lngTmp != __This->fileSize)
{
CS_stncp (csErrnam,__This->filePath,MAXPATH);
CS_erpt (cs_INV_FILE);
goto error;
}
/* Now that we know recordSize, we can adjust the bufferSize for maximum
efficiency. */
if (__This->bufferSize > __This->fileSize)
{
__This->bufferSize = __This->fileSize;
}
else
{
if (__This->bufferSize > (3 * __This->recordSize))
{
/* Maximum efficiency is obtained with a buffer size whch is
a multiple of the record size. */
__This->bufferSize = (__This->bufferSize / __This->recordSize) * __This->recordSize;
}
else
{
/* We require a minimum buffer size of 3 records. */
__This->bufferSize = 3 * __This->recordSize;
}
}
return (__This);
error:
CSdeleteGeoid96GridFile (__This);
return NULL;
}
/*****************************************************************************
This function would be a private function in C++.
This function sets the currentCell member to the cell which covers the
provided geographic coordinate. Returns 0 on success or a negative value
for a system error of some sort (i.e. file I/O). Per the design of this
object, this function is not to be called unless the provided source
coordinate is within the coverage of the object.
*/
int CScalcGeoid99GridFile (struct csGeoid99GridFile_* __This,double* result,Const double* sourceLL)
{
extern double cs_One;
int eleNbr;
int recNbr;
int readCount;
int checkCount;
long lngTmp;
long checkSeek;
long fpos;
long fposBegin;
long fposEnd;
long swapCount;
char* chrPtr;
float* fltPtr;
double centerLL [2];
double deltaLL [2];
char swapSpec [16];
/* Float array carries the 3x3 array as follows:
North
W 6 7 8 E
e 3 4 5 a
s 0 1 2 s
t t
South */
float array [9];
enum edgeEffects { edgeNone = 0,
edgeSouthwest,
edgeSouth,
edgeSoutheast,
edgeEast,
edgeNortheast,
edgeNorth,
edgeNorthwest,
edgeWest
} edge;
edge = edgeNone;
/* We are not supposed to get here unless the sourceLL is within the coverage of the
file object. We make sure of that now. This makes life much easier below. Use the
CStestGeoid99GridFile function to select the proper csGeoid99GridFile object. */
if (sourceLL [LNG] < __This->coverage.southWest [LNG] || sourceLL [LNG] > __This->coverage.northEast [LNG] ||
sourceLL [LAT] < __This->coverage.southWest [LAT] || sourceLL [LAT] > __This->coverage.northEast [LAT])
{
CS_stncp (csErrnam,"CS_geoid99:1",MAXPATH);
CS_erpt (cs_ISER);
goto error;
}
/* Compute the basic indices to the cell in the data file. We're supposed to come up
with a reference to the closest point. Since we know the source coordinate is within
range, dealing with the edges is rather easy. */
eleNbr = (long)(((sourceLL [LNG] - __This->coverage.southWest [LNG]) / __This->deltaLng) + 0.5);
recNbr = (long)(((sourceLL [LAT] - __This->coverage.southWest [LAT]) / __This->deltaLat) + 0.5);
/* Determine the if an edge effect applies. */
if (recNbr < 1)
{
recNbr = 1;
if (eleNbr < 1)
{
eleNbr = 1;
edge = edgeSouthwest;
}
else if (eleNbr >= (__This->elementCount - 1))
{
eleNbr = __This->elementCount - 2;
edge = edgeSoutheast;
}
else
{
edge = edgeSouth;
}
}
else if (recNbr >= (__This->recordCount - 1))
{
if (eleNbr < 1)
{
eleNbr = 1;
edge = edgeNorthwest;
}
else if (eleNbr >= (__This->elementCount - 1))
{
eleNbr = __This->elementCount - 2;
edge = edgeNortheast;
}
else
{
edge = edgeNorth;
}
}
else
{
if (eleNbr < 1)
{
eleNbr = 1;
edge = edgeWest;
}
else if (eleNbr > (__This->elementCount -1))
{
eleNbr = __This->elementCount - 2;
edge = edgeEast;
}
else
{
edge = edgeNone;
}
}
/* Compute the minimal region of the file which we need to read. */
fposBegin = sizeof (struct csGeoid99Hdr_) + (recNbr - 1) * __This->recordSize;
fposEnd = fposBegin + (__This->recordSize * 3);
if (fposEnd > __This->fileSize) fposEnd = __This->fileSize;
/* Do we have a buffer? Could have been released. Maybe this is the
first access. */
if (__This->dataBuffer == NULL)
{
__This->dataBuffer = CS_malc ((size_t)__This->bufferSize);
if (__This->dataBuffer == NULL)
{
CS_erpt (cs_NO_MEM);
goto error;
}
/* Make sure the rest of this stuff knows the buffer is empty. These values
will fail to match any specific file position. */
__This->bufferBeginPosition = -1L;
__This->bufferEndPosition = -2L;
}
/* See if the stuff we want is in the buffer. Careful here, all of the intended
range must be in the buffer, not just a portion of it. */
if (fposBegin < __This->bufferBeginPosition || fposBegin > __This->bufferEndPosition ||
fposEnd < __This->bufferBeginPosition || fposEnd > __This->bufferEndPosition)
{
/* The data we need is not there; we need to read it in. Is the file open? */
if (__This->strm == NULL)
{
__This->strm = CS_fopen (__This->filePath,_STRM_BINRD);
if (__This->strm == NULL)
{
CS_stncp (csErrnam,__This->filePath,MAXPATH);
CS_erpt (cs_DTC_FILE);
goto error;
}
/* We do our own buffering, turn stream buffering off. */
setvbuf (__This->strm,NULL,_IONBF,0);
}
/* Compute the starting position of the actual read. */
if (__This->bufferSize >= __This->fileSize)
{
__This->bufferBeginPosition = 0L;
__This->bufferEndPosition = __This->fileSize;
readCount = __This->fileSize;
}
else
{
/* We need to doa partial read, the normal case. Initialize for the
minimal case computed above, then expand as is possible. Note, we
get here only when a read has to be done. */
__This->bufferBeginPosition = fposBegin;
__This->bufferEndPosition = fposEnd;
readCount = __This->bufferEndPosition - __This->bufferBeginPosition;
/* In this section, lngTmp is the number of additional records
which can fit in the buffer. */
lngTmp = (__This->bufferSize - readCount) / __This->recordSize;
if (lngTmp > 3L)
{
/* Move the beginning of the read up by one half of the
amount of extra space in the buffer; but never past the
beginning of record number 1. */
lngTmp = lngTmp / 2;
__This->bufferBeginPosition -= __This->recordSize * lngTmp;
if (__This->bufferBeginPosition < sizeof (struct csGeoid99Hdr_)) /*lint !e574 */
{
__This->bufferBeginPosition = sizeof (struct csGeoid99Hdr_);
}
readCount = __This->bufferEndPosition - __This->bufferBeginPosition;
}
lngTmp = (__This->bufferSize - readCount) / __This->recordSize;
if (lngTmp > 3L)
{
/* Move the end of the read back by the amount of extra
space in the buffer, but never past the end of the file. */
__This->bufferEndPosition += __This->recordSize * lngTmp;
if (__This->bufferEndPosition > __This->fileSize)
{
__This->bufferEndPosition = __This->fileSize;
}
readCount = __This->bufferEndPosition - __This->bufferBeginPosition;
}
lngTmp = (__This->bufferSize - readCount) / __This->recordSize;
if (lngTmp > 0L)
{
/* In case the expanded end of read exceeded the end of the
file, we can move the beginning of the read up some more,
However, never more than the beginning of the first
data record. */
__This->bufferBeginPosition -= __This->recordSize * lngTmp;
if (__This->bufferBeginPosition < sizeof (struct csGeoid99Hdr_)) /*lint !e574 */
{
__This->bufferBeginPosition = sizeof (struct csGeoid99Hdr_);
}
readCount = __This->bufferEndPosition - __This->bufferBeginPosition;
}
/* Defensive programming. */
if (readCount != __This->bufferSize)
{
CS_stncp (csErrnam,"CS_geoid99:2",MAXPATH);
CS_erpt (cs_ISER);
goto error;
}
}
/* OK, read in the data. */
checkSeek = CS_fseek (__This->strm,__This->bufferBeginPosition,SEEK_SET);
if (checkSeek < 0L)
{
CS_stncp (csErrnam,__This->filePath,MAXPATH);
CS_erpt (cs_IOERR);
goto error;
}
checkCount = (long)CS_fread (__This->dataBuffer,1,(size_t)readCount,__This->strm);
if (checkCount != readCount)
{
CS_stncp (csErrnam,__This->filePath,MAXPATH);
CS_erpt (cs_INV_FILE);
goto error;
}
if (CS_ferror (__This->strm))
{
CS_stncp (csErrnam,__This->filePath,MAXPATH);
CS_erpt (cs_IOERR);
goto error;
}
/* Under certain circumstances, it will be rather inefficient to swap bytes here.
However, we swap here to preclude the chance of swapping the data twice, and
the chance that unswapped floats appear to be Nan's or something ugly like
that. So, this may be somewhat inefficient, but it is the safest place
to put the swap. In general, Geoid99 files are in little endian order, and
Geoid 2003 files are in Big endian order. Thus, by using the appropriate
files, you may be able to skip the whole issue of byte swapping here
altogether. */
if (__This->iKind != 1L)
{
/* Here if some swapping has to be done. Need to exercise some care.
If the whole file was read in, we have a header on the front which
we don't want to swap. Otherwise, we can treat the buffer as an
array of floats, which is rather simple.
In the code below, we use lngTmp as the number of bytes on the
front of the buffer which we must omit from the swapping process. */
lngTmp = (long)sizeof (struct csGeoid99Hdr_) - __This->bufferBeginPosition;
if (lngTmp < 0) lngTmp = 0L;
swapCount = (__This->bufferEndPosition - (__This->bufferBeginPosition + lngTmp)) / sizeof (float);
sprintf (swapSpec,"%ldf",swapCount);
chrPtr = (char *)(__This->dataBuffer) + lngTmp;
CSbswap (chrPtr,swapSpec);
}
/* We have the desired data in the buffer. If we read in the whole file,
we close the stream now. No need to have the file descriptor open. */
if (__This->bufferSize == __This->fileSize)
{
CS_fclose (__This->strm);
__This->strm = NULL;
}
}
/* Compute the delta into the grid cell we will contruct below. Note, we are using adjusted
recNbr and eleNbr variables here. */
centerLL [LNG] = __This->coverage.southWest [LNG] + __This->deltaLng * (double)eleNbr;
centerLL [LAT] = __This->coverage.southWest [LAT] + __This->deltaLat * (double)recNbr;
deltaLL [LNG] = ((sourceLL [LNG] - centerLL [LNG]) / __This->deltaLng) + cs_One;
deltaLL [LAT] = ((sourceLL [LAT] - centerLL [LAT]) / __This->deltaLat) + cs_One;
/* OK, the necessary stuff should be in the buffer. We do what is necessary to
populate the array. Notice, we populate the array in a way that the edge
effects come out correct using a standard algorithm below. */
switch (edge) {
case edgeNone:
fpos = sizeof (struct csGeoid99Hdr_) + (recNbr * __This->recordSize) + (eleNbr * sizeof (float));
chrPtr = (char *)(__This->dataBuffer) + (fpos - __This->bufferBeginPosition);
chrPtr += __This->recordSize;
fltPtr = (float *)(chrPtr);
array [6] = *(fltPtr - 1);
array [7] = *fltPtr;
array [8] = *(fltPtr + 1);
chrPtr = (char *)(__This->dataBuffer) + (fpos - __This->bufferBeginPosition);
fltPtr = (float *)(chrPtr);
array [3] = *(fltPtr - 1);
array [4] = *fltPtr;
array [5] = *(fltPtr + 1);
chrPtr = (char *)(__This->dataBuffer) + (fpos - __This->bufferBeginPosition);
chrPtr -= __This->recordSize;
fltPtr = (float *)(chrPtr);
array [0] = *(fltPtr - 1);
array [1] = *fltPtr;
array [2] = *(fltPtr + 1);
break;
case edgeSouthwest:
fpos = sizeof (struct csGeoid99Hdr_);
chrPtr = (char *)(__This->dataBuffer) + (fpos - __This->bufferBeginPosition);
fltPtr = (float *)(chrPtr);
array [6] = array [7] = array [8] = *fltPtr;
array [3] = array [4] = array [5] = *fltPtr;
array [0] = array [1] = array [2] = *fltPtr;
deltaLL [LNG] = deltaLL [LAT] = cs_One;
break;
case edgeSouth:
fpos = sizeof (struct csGeoid99Hdr_) + eleNbr * sizeof (float);
chrPtr = (char *)(__This->dataBuffer) + (fpos - __This->bufferBeginPosition);
fltPtr = (float *)(chrPtr);
array [6] = array [3] = array [0] = *(fltPtr - 1);
array [7] = array [4] = array [1] = *fltPtr;
array [8] = array [5] = array [2] = *(fltPtr + 1);
deltaLL [LAT] = cs_One;
break;
case edgeSoutheast:
fpos = sizeof (struct csGeoid99Hdr_) + (__This->elementCount - 1) * sizeof (float);
chrPtr = (char *)(__This->dataBuffer) + (fpos - __This->bufferBeginPosition);
fltPtr = (float *)(chrPtr);
array [6] = array [7] = array [8] = *fltPtr;
array [3] = array [4] = array [5] = *fltPtr;
array [0] = array [1] = array [2] = *fltPtr;
deltaLL [LNG] = deltaLL [LAT] = cs_One;
break;
case edgeEast:
fpos = sizeof (struct csGeoid99Hdr_) + recNbr * __This->recordSize + (__This->elementCount - 1) * sizeof (float);
chrPtr = (char *)(__This->dataBuffer) + (fpos - __This->bufferBeginPosition);
chrPtr += __This->recordSize;
fltPtr = (float *)(chrPtr);
array [6] = array [7] = array [8] = *fltPtr;
chrPtr = (char *)(__This->dataBuffer) + (fpos - __This->bufferBeginPosition);
fltPtr = (float *)(chrPtr);
array [3] = array [4] = array [5] = *fltPtr;
chrPtr = (char *)(__This->dataBuffer) + (fpos - __This->bufferBeginPosition);
chrPtr -= __This->recordSize;
fltPtr = (float *)(chrPtr);
array [0] = array [1] = array [2] = *fltPtr;
deltaLL [LNG] = cs_One;
break;
case edgeNortheast:
fpos = sizeof (struct csGeoid99Hdr_) + (__This->recordCount - 1) * __This->recordSize + (__This->elementCount - 1) * sizeof (float);
chrPtr = (char *)(__This->dataBuffer) + (fpos - __This->bufferBeginPosition);
fltPtr = (float *)(chrPtr);
array [6] = array [7] = array [8] = *fltPtr;
array [3] = array [4] = array [5] = *fltPtr;
array [0] = array [1] = array [2] = *fltPtr;
deltaLL [LNG] = deltaLL [LAT] = cs_One;
break;
case edgeNorth:
fpos = sizeof (struct csGeoid99Hdr_) + (__This->recordCount - 1) * __This->recordSize + eleNbr * sizeof (float);
chrPtr = (char *)(__This->dataBuffer) + (fpos - __This->bufferBeginPosition);
fltPtr = (float *)(chrPtr);
array [6] = array [3] = array [0] = *(fltPtr - 1);
array [7] = array [4] = array [1] = *fltPtr;
array [8] = array [5] = array [2] = *(fltPtr + 1);
deltaLL [LAT] = cs_One;
break;
case edgeNorthwest:
fpos = sizeof (struct csGeoid99Hdr_) + (__This->recordCount - 1) * __This->recordSize;
chrPtr = (char *)(__This->dataBuffer) + (fpos - __This->bufferBeginPosition);
fltPtr = (float *)(chrPtr);
array [6] = array [7] = array [8] = *fltPtr;
array [3] = array [4] = array [5] = *fltPtr;
array [0] = array [1] = array [2] = *fltPtr;
deltaLL [LNG] = deltaLL [LAT] = cs_One;
break;
case edgeWest:
fpos = sizeof (struct csGeoid99Hdr_) + recNbr * __This->recordSize;
chrPtr = (char *)(__This->dataBuffer) + (fpos - __This->bufferBeginPosition);
chrPtr += __This->recordSize;
fltPtr = (float *)(chrPtr);
array [6] = array [7] = array [8] = *fltPtr;
chrPtr = (char *)(__This->dataBuffer) + (fpos - __This->bufferBeginPosition);
fltPtr = (float *)(chrPtr);
array [3] = array [4] = array [5] = *fltPtr;
chrPtr = (char *)(__This->dataBuffer) + (fpos - __This->bufferBeginPosition);
chrPtr -= __This->recordSize;
fltPtr = (float *)(chrPtr);
array [0] = array [1] = array [2] = *fltPtr;
deltaLL [LNG] = cs_One;
break;
}
/* Do the calculations. */
*result = CSgeoidQterp (deltaLL,array);
return 0;
error:
/* Release the resources allocated to this object. The next call to this
object would then require a refresh. */
CSreleaseGeoid99GridFile (__This);
/* Negative return indicates a system error of sorts. */
return -1;
}
int CSinitNTv2 (struct cs_NTv2_* thisPtr,Const char *filePath,long32_t bufferSize,
ulong32_t flags,
double density)
{
extern double cs_Sec2Deg;
extern char cs_DirsepC;
extern char csErrnam [];
short idx;
short parIdx;
int overlap;
int seekStat;
size_t readCnt;
size_t readCntRq;
size_t malcCnt;
long32_t skipAmount;
char *cp;
struct csNTv2SubGrid_* subPtr;
struct csNTv2SubGrid_* kidPtr;
struct csNTv2SubGrid_* parPtr;
union csNtv2Hdrs_ fileHdr;
struct csNTv2SubHdr_ fileSubHdr;
char ctemp [MAXPATH];
csFILE* stream = NULL;
/* Try to prevent a likely crash. */
if (thisPtr == NULL)
{
CS_stncp (csErrnam,"CS_ntv2::1",MAXPATH);
CS_erpt (cs_ISER);
return -1;
}
/* In the event of an error; this eliminates duplicating this many many
times. */
CS_stncp (csErrnam,filePath,MAXPATH);
/* Initialize the structure to harmless values. */
thisPtr->SubGridDir = NULL;
thisPtr->fileImage = NULL;
thisPtr->fileImageSize = 0;
thisPtr->HdrRecCnt = 0;
thisPtr->SubCount = 0;
thisPtr->RecSize = 16;
thisPtr->CellIsValid = FALSE;
thisPtr->SubOverlap = (short)((flags & 0x01) != 0);
thisPtr->IntType = csNTv2TypeNone;
thisPtr->BufferSize = bufferSize;
thisPtr->sourceId [0] = '\0';
if (thisPtr->BufferSize <= 0) thisPtr->BufferSize = csNTv2BufrSz;
if (thisPtr->BufferSize <= 4096) thisPtr->BufferSize = 4096;
CSinitNTv2GridCell (&thisPtr->longitudeCell);
CSinitNTv2GridCell (&thisPtr->latitudeCell);
/* Deal with the file path. */
CS_stncp (thisPtr->FilePath,filePath,sizeof (thisPtr->FilePath));
/* Extract and save last 15 characters of the data file name. */
cp = strrchr (thisPtr->FilePath,cs_DirsepC);
if (cp == NULL) cp = thisPtr->FilePath;
CS_stncp (ctemp,cp,sizeof (ctemp));
cp = strrchr (ctemp,'.');
if (cp != NULL) *cp = '\0';
cp = ctemp;
if (strlen (ctemp) > 15)
{
cp = ctemp + strlen (ctemp) - 15;
}
CS_stncp (thisPtr->FileName,cp,sizeof (thisPtr->FileName));
/* Open the file. */
stream = CS_fopen (thisPtr->FilePath,_STRM_BINRD);
if (stream == NULL)
{
CS_erpt (cs_DTC_FILE);
goto error;
}
setvbuf (stream,NULL,_IOFBF,(size_t)thisPtr->BufferSize);
/* We've got a file. Read the header. */
readCnt = CS_fread (&fileHdr,1,sizeof (fileHdr),stream);
if (CS_ferror (stream))
{
CS_erpt (cs_IOERR);
goto error;
}
if (readCnt != sizeof (fileHdr))
{
CS_erpt (cs_INV_FILE);
goto error;
}
/* Verify that this is the kind of file we know how to deal with. */
if (strncmp (fileHdr.Canadian.titl01,"NUM_OREC",8))
{
/* Opps!!! Not a CaNTv2 file. */
CS_erpt (cs_INV_FILE);
goto error;
}
/* Determine the type/source of the file. */
if (fileHdr.Canadian.titl02 [0] == 'N' &&
fileHdr.Canadian.titl02 [1] == 'U')
{
/* It appears that the file is Canadian. */
thisPtr->IntType = csNTv2TypeCanada;
skipAmount = sizeof (struct csNTv2HdrCa_);
CS_bswap (&fileHdr.Canadian,cs_BSWP_NTv2HdrCa);
}
else if (fileHdr.Australian.titl02 [0] == 'N' &&
fileHdr.Australian.titl02 [1] == 'U')
{
/* It appears to be an Australian file. */
thisPtr->IntType = csNTv2TypeAustralia;
skipAmount = sizeof (struct csNTv2HdrAu_);
CS_bswap (&fileHdr.Australian,cs_BSWP_NTv2HdrAu);
}
else
{
/* Opps!!! Don't know what kind of file it is. */
CS_erpt (cs_INV_FILE);
goto error;
}
/* Reposition the input file as is appropriate due to the
type of file. A little hoeky, but it should be portable. */
seekStat = CS_fseek (stream,skipAmount,SEEK_SET);
if (seekStat != 0)
{
CS_erpt (cs_INV_FILE);
goto error;
}
/* Extract the valuable stuff. */
if (thisPtr->IntType == csNTv2TypeCanada)
{
thisPtr->HdrRecCnt = fileHdr.Canadian.num_orec;
thisPtr->SubCount = fileHdr.Canadian.num_file;
thisPtr->SubHdrRecCnt = fileHdr.Canadian.num_srec;
}
else
{
thisPtr->HdrRecCnt = fileHdr.Australian.num_orec;
thisPtr->SubCount = fileHdr.Australian.num_file;
thisPtr->SubHdrRecCnt = fileHdr.Australian.num_srec;
}
/* The rest of the header is pretty much useless. */
/* Now, we deal with the sub-directories. THese are very
important. */
malcCnt = sizeof (struct csNTv2SubHdr_) * (ulong32_t)thisPtr->SubCount;
thisPtr->SubGridDir = (struct csNTv2SubGrid_ *)CS_malc (malcCnt);
if (thisPtr->SubGridDir == NULL)
{
CS_erpt (cs_NO_MEM);
goto error;
}
/* Initialize (i.e. construct) each of the sub-grid items we just
allocated. */
for (idx = 0;idx < thisPtr->SubCount;idx += 1)
{
subPtr = &thisPtr->SubGridDir [idx];
/* Initialize to a boundary which will not match anything. */
subPtr->SouthWest [LNG] = 180.0;
subPtr->SouthWest [LAT] = 90.0;
subPtr->NorthEast [LNG] = -180.0;
subPtr->NorthEast [LAT] = -90.0;
/* Remember, these values as extracted from the file itself are
WEST positive. */
subPtr->SeReference [LNG] = 180.0;
subPtr->SeReference [LAT] = 90.0;
subPtr->NwReference [LNG] = -180.0;
subPtr->NwReference [LAT] = -90.0;
subPtr->DeltaLng = 0.0;
subPtr->DeltaLat = 0.0;
subPtr->Density = 0.0;
subPtr->FirstRecord = -1;
subPtr->GridRecCnt = 0;
subPtr->ParentIndex = -1;
subPtr->ChildIndex = -1;
subPtr->RowCount = 0;
subPtr->ElementCount = 0;
subPtr->RowSize = 0;
subPtr->Cacheable = FALSE;
subPtr->Name [0] = '\0';
subPtr->Parent [0] = '\0';
}
/* Once for each sub-grid in the file; read in the header. At this point,
we just read them in. Later on, we peruse the array and figure out
who the mamas and the papas are. */
for (idx = 0;idx < thisPtr->SubCount;idx += 1)
{
/* Kludge to handle the variation in format. Doing this right
would require duplication of a whole bunch of code. So . . . */
readCntRq = sizeof (fileSubHdr);
if (thisPtr->IntType == csNTv2TypeAustralia) readCntRq -= 4;
readCnt = CS_fread (&fileSubHdr,1,readCntRq,stream);
if (CS_ferror (stream))
{
CS_erpt (cs_IOERR);
goto error;
}
if (readCnt != readCntRq)
{
CS_erpt (cs_INV_FILE);
goto error;
}
if (strncmp (fileSubHdr.titl01,"SUB_NAME",8))
{
CS_erpt (cs_INV_FILE);
goto error;
}
if (thisPtr->IntType == csNTv2TypeCanada)
{
CS_bswap (&fileSubHdr,cs_BSWP_NTv2SubHdrCA);
}
else
{
CS_bswap (&fileSubHdr,cs_BSWP_NTv2SubHdrAU);
}
/* Collect the useful stuff. */
subPtr = &thisPtr->SubGridDir [idx];
/* Data for each sub-grid immediately follows the sub-grid header. */
subPtr->FirstRecord = CS_ftell (stream);
/* These boundaries are rational east positive boundaries. */
subPtr->SouthWest [LNG] = -fileSubHdr.w_long * cs_Sec2Deg;
subPtr->SouthWest [LAT] = fileSubHdr.s_lat * cs_Sec2Deg;
subPtr->NorthEast [LNG] = -fileSubHdr.e_long * cs_Sec2Deg;
subPtr->NorthEast [LAT] = fileSubHdr.n_lat * cs_Sec2Deg;
/* These boundaries are the screwy west positive ones used in the
NTv2 format. */
subPtr->SeReference [LNG] = fileSubHdr.e_long * cs_Sec2Deg;
subPtr->SeReference [LAT] = fileSubHdr.s_lat * cs_Sec2Deg;
subPtr->NwReference [LNG] = fileSubHdr.w_long * cs_Sec2Deg;
subPtr->NwReference [LAT] = fileSubHdr.n_lat * cs_Sec2Deg;
/* The remainder of this is pretty rational. */
subPtr->DeltaLng = fileSubHdr.long_inc * cs_Sec2Deg;
subPtr->DeltaLat = fileSubHdr.lat_inc * cs_Sec2Deg;
/* We do not use Density in the calculations. It is only used to
select one sub-grid over another in the case of overlap. Yes,
I know. The sub-grids at the same level are not suppoded to
overlap; but they do. Call it job security for you an me. */
subPtr->Density = (subPtr->DeltaLat < subPtr->DeltaLng) ? subPtr->DeltaLat : subPtr->DeltaLng;
/* If the user has specified a default density value, we use it. */
if (density != 0.0)
{
subPtr->Density = density;
}
/* Save the name for reporting purposes. */
CS_stncp (subPtr->Name,fileSubHdr.sub_name,9);
CS_stncp (subPtr->Parent,fileSubHdr.parent,9);
subPtr->GridRecCnt = fileSubHdr.gs_count;
/* WEST Positive, dummy. The extra .01 is to eliminate possible fuzz
in the double portion of the calculations. */
subPtr->RowCount = (unsigned short)(((subPtr->NwReference [LAT] - subPtr->SeReference [LAT]) / subPtr->DeltaLat) + 1.01);
subPtr->ElementCount = (unsigned short)(((subPtr->NwReference [LNG] - subPtr->SeReference [LNG]) / subPtr->DeltaLng) + 1.01);
subPtr->RowSize = (unsigned short)(subPtr->ElementCount * thisPtr->RecSize);
/* Certain sub grids are not cacheable. In the Canadian file, the region
which is not cacheable is rather small. We use the csCaNTv2KludgeTable
to handle it. The one Austrailian sub-grid we've seen is screwed up,
so we disable cacheing (at least for now), for all Australian files.
Australian, in this context, means file in the old Australian format,
not necessarily data files covering Australian geography.
In the case of the Spanish variation, parent grids overlap, and
therefore none of the sub-grids are cacheable. */
//???? subPtr->Cacheable = (short)((thisPtr->IntType == csNTv2TypeCanada) && (thisPtr->SubOverlap == 0));
subPtr->Cacheable = FALSE;
/* Skip over the data records in the file. */
skipAmount = subPtr->GridRecCnt * thisPtr->RecSize;
seekStat = CS_fseek (stream,skipAmount,SEEK_CUR);
if (seekStat != 0)
{
CS_erpt (cs_INV_FILE);
goto error;
}
}
/* Now we figure out who the mammas and the pappas are. Note, all we have
to work with are parent names. Therefore, we have to work bassackwards.
End result of all of this, is that each child needs to have the index
of its parent; and each sub-grid that has a child needs to be so marked. */
for (idx = 0;idx < thisPtr->SubCount;idx += 1)
{
kidPtr = &thisPtr->SubGridDir [idx];
if (CS_stricmp (kidPtr->Parent,"NONE "))
{
/* Its a child, find the parent. */
for (parIdx = 0;parIdx < thisPtr->SubCount;parIdx += 1)
{
parPtr = &thisPtr->SubGridDir [parIdx];
if (!CS_stricmp (kidPtr->Parent,parPtr->Name))
{
/* Save the index of the parent. */
kidPtr->ParentIndex = parIdx;
/* Mark the parent as having a child, if not already so marked. */
if (parPtr->ChildIndex == -1 || parPtr->ChildIndex > idx)
{
parPtr->ChildIndex = idx;
}
}
}
}
}
/* To accomodate the Spanish (and perhaps others in the future, we check the
parent grids in the list of sub-grids for overlap. If overlap exists,
we turn on the SubOverlap flag. Of course, if this flag is already on,
we have nothing to do. If we did indeed turn on the SubOverlap flag,
we need to cruise through all the sub-grids and set the Cacheable flag
to false to assure that no data from this file makes it to the grid cell
cache. */
if (thisPtr->SubOverlap == 0)
{
for (parIdx = 0;parIdx < thisPtr->SubCount && thisPtr->SubOverlap == 0;parIdx += 1)
{
parPtr = &thisPtr->SubGridDir [parIdx];
/* Top level grids only, we know the children overlap. */
if (parPtr->ParentIndex >= 0) continue;
overlap = FALSE;
for (idx = 0;idx < thisPtr->SubCount;idx += 1)
{
if (idx == parIdx) continue;
subPtr = &thisPtr->SubGridDir [idx];
if (subPtr->ParentIndex >= 0) continue;
/* See if subPtr overlaps with parPtr. */
overlap = subPtr->SeReference [LNG] > parPtr->SeReference [LNG] &&
subPtr->SeReference [LAT] > parPtr->SeReference [LAT] &&
subPtr->SeReference [LNG] < parPtr->NwReference [LNG] &&
subPtr->SeReference [LAT] < parPtr->NwReference [LAT];
overlap |= subPtr->NwReference [LNG] > parPtr->SeReference [LNG] &&
subPtr->NwReference [LAT] > parPtr->SeReference [LAT] &&
subPtr->NwReference [LNG] < parPtr->NwReference [LNG] &&
subPtr->NwReference [LAT] < parPtr->NwReference [LAT];
if (overlap)
{
thisPtr->SubOverlap = TRUE; /* for testing ease */
}
}
}
if (thisPtr->SubOverlap != 0)
{
for (idx = 0;idx < thisPtr->SubCount;idx += 1)
{
subPtr = &thisPtr->SubGridDir [idx];
subPtr->Cacheable = FALSE;
}
}
}
/* OK, we should be ready to rock and roll. We close the Stream until
we actually need it. Often, we get constructed just so there is a
record of the coverage afforded by the file. */
if (stream != NULL)
{
CS_fclose (stream);
stream = NULL;
}
csErrnam [0] = '\0';
return 0;
error:
if (stream != NULL)
{
CS_fclose (stream);
stream = NULL;
}
if (thisPtr->SubGridDir != NULL)
{
CS_free (thisPtr->SubGridDir);
thisPtr->SubGridDir = NULL;
}
thisPtr->HdrRecCnt = 0;
thisPtr->SubCount = 0;
thisPtr->RecSize = 16;
thisPtr->CellIsValid = FALSE;
thisPtr->SubOverlap = (short)((flags & 0x01) != 0);
thisPtr->IntType = csNTv2TypeNone;
thisPtr->BufferSize = bufferSize;
thisPtr->sourceId [0] = '\0';
if (thisPtr->BufferSize <= 0) thisPtr->BufferSize = csNTv2BufrSz;
if (thisPtr->BufferSize <= 4096) thisPtr->BufferSize = 4096;
CSinitNTv2GridCell (&thisPtr->longitudeCell);
CSinitNTv2GridCell (&thisPtr->latitudeCell);
return -1;
}
/* Interpolation Calculator
The comment below is stale now that we store the entire grid file in memory,
but is interesting nonetheless as it documents unusual properties of NTv2
grids.
====
Due to a bust in the file format, we do not buffer up grid cells and stuff.
There are a couple of sub-grids which overlap other grids in such a way that
buffering can cause errors. So, at least until (if ever) the data file is
corrected, we do no buffering of the grid cells.
Also, this file format is being adopted by others, such as the Australians.
We don't know what they are going to do. So to be safe, NO BUFFERING OF
GRID CELLS.
Also, due to the sub-grid nature of the data file, we do not buffer the
data file in any special way; we simply use normal stream buffering. We
do, however, use a normal stream buffer of the size specified in the
main object.
*/
int CScalcNTv2 (struct cs_NTv2_* thisPtr,double deltaLL [2],Const double source [2])
{
extern double cs_Zero; /* 0.0 */
extern double cs_LlNoise; /* 1.0E-12 */
extern char csErrnam [MAXPATH];
short onLimit;
unsigned short eleNbr, rowNbr;
int rtnValue;
int swapping;
csFILE* stream = NULL;
size_t readCnt;
long32_t filePosition;
struct csNTv2SubGrid_ *cvtPtr;
double wpLL [2];
double seCell [2];
double nwCell [2];
struct TcsCaNTv2Data southEast;
struct TcsCaNTv2Data southWest;
struct TcsCaNTv2Data northEast;
struct TcsCaNTv2Data northWest;
/* Until we know differently. */
rtnValue = csGRIDI_ST_SYSTEM;
thisPtr->CellIsValid = FALSE;
/* In case of an error. This saves duplication of this many many times. */
CS_stncp (csErrnam,thisPtr->FilePath,MAXPATH);
/* Remember, source is East Positive. All NTv2 files are West Positive. */
/* Locate the appropriate sub-grid. If there is none, than there is no
coverage. There are two algorithms: the original one and one invented
to cater to the Spaniards (and maybe some others in the future).
In the original algorithm, we search through the top level of parent
grids looking for coverage. The top level parents are those which have
no parent. If none is found, there is no coverage. If we locate a parent
which provides coverage, we examine all children of that parent looking
for a sub-grid; and so on.
In the Spanish algorithm, we search all grids, and choose the grid which
produces the smallest cell size. This is necessary as the grids are
allowed to overlap in the Spanish variation. */
cvtPtr = CSlocateSubNTv2 (thisPtr,source);
/* OK, if cvtPtr is not NULL, its a pointer to the appropriate sub grid
for this conversion. */
if (cvtPtr != NULL)
{
/* NTv2 files consider west longitude to be positive. */
wpLL [LNG] = -source [LNG];
wpLL [LAT] = source [LAT];
/* Determine the status of onLimit. This indicates if the point to be
converted actually resides on the northern or western edge of the
grid cell. */
onLimit = 0;
if (fabs (wpLL [LAT] - cvtPtr->NwReference [LAT]) <= cs_LlNoise) onLimit |= 1;
if (fabs (wpLL [LNG] - cvtPtr->NwReference [LNG]) <= cs_LlNoise) onLimit |= 2;
if (thisPtr->fileImage == NULL)
{
stream = CS_fopen (thisPtr->FilePath,_STRM_BINRD);
if (stream == NULL)
{
CS_stncp (csErrnam,thisPtr->FilePath,MAXPATH);
CS_erpt (cs_DTC_FILE);
goto error;
}
setvbuf (stream,NULL,_IOFBF,(size_t)thisPtr->BufferSize);
// Determine the size of the file.
if (CS_fseek (stream,0L,SEEK_END))
{
CS_stncp (csErrnam,thisPtr->FilePath,MAXPATH);
CS_erpt (cs_IOERR);
goto error;
}
thisPtr->fileImageSize = CS_ftell (stream);
if (thisPtr->fileImageSize < 0L)
{
CS_stncp (csErrnam,thisPtr->FilePath,MAXPATH);
CS_erpt (cs_IOERR);
goto error;
}
if (CS_fseek (stream, 0L, SEEK_SET))
{
CS_stncp (csErrnam,thisPtr->FilePath,MAXPATH);
CS_erpt (cs_IOERR);
goto error;
}
// Prepare memory
thisPtr->fileImage = (char*)CS_malc(thisPtr->fileImageSize);
if (thisPtr->fileImage == NULL)
{
CS_erpt (cs_NO_MEM);
goto error;
}
// Copy everything into the memory
readCnt = CS_fread(thisPtr->fileImage,
1,
thisPtr->fileImageSize,
stream);
if (CS_ferror(stream))
{
CS_erpt (cs_IOERR);
goto error;
}
CS_fclose (stream); stream = NULL;
}
/* Compute onLimit for this point and the selected sub-grid regardless
of how we got here. This should now only occur at the extreme edges
of the entire file coverage. */
onLimit = 0;
if (fabs (wpLL [LAT] - cvtPtr->NwReference [LAT]) <= cs_LlNoise) onLimit |= 1;
if (fabs (wpLL [LNG] - cvtPtr->NwReference [LNG]) <= cs_LlNoise) onLimit |= 2;
/* Compute the elements required for the file access. This is common to
all cases of "onLimit". */
eleNbr = (unsigned short)(((wpLL [LNG] - cvtPtr->SeReference [LNG]) / cvtPtr->DeltaLng) + cs_LlNoise);
rowNbr = (unsigned short)(((wpLL [LAT] - cvtPtr->SeReference [LAT]) / cvtPtr->DeltaLat) + cs_LlNoise);
/* Compute the boundaries of the specific cell we dealing with, assuming
onLimit is zero (which is the case 99.999% of the time). */
seCell [LNG] = cvtPtr->SeReference [LNG] + cvtPtr->DeltaLng * (double)eleNbr;
seCell [LAT] = cvtPtr->SeReference [LAT] + cvtPtr->DeltaLat * (double)rowNbr;
nwCell [LNG] = seCell [LNG] + cvtPtr->DeltaLng;
nwCell [LAT] = seCell [LAT] + cvtPtr->DeltaLng;
/* Build the extent portions of the grid cells. */
thisPtr->longitudeCell.seCorner [LNG] = seCell [LNG];
thisPtr->longitudeCell.seCorner [LAT] = seCell [LAT];
thisPtr->longitudeCell.nwCorner [LNG] = nwCell [LNG];
thisPtr->longitudeCell.nwCorner [LAT] = nwCell [LAT];
thisPtr->longitudeCell.deltaLng = cvtPtr->DeltaLng;
thisPtr->longitudeCell.deltaLat = cvtPtr->DeltaLat;
thisPtr->longitudeCell.density = cvtPtr->Density;
thisPtr->latitudeCell.seCorner [LNG] = seCell [LNG];
thisPtr->latitudeCell.seCorner [LAT] = seCell [LAT];
thisPtr->latitudeCell.nwCorner [LNG] = nwCell [LNG];
thisPtr->latitudeCell.nwCorner [LAT] = nwCell [LAT];
thisPtr->latitudeCell.deltaLng = cvtPtr->DeltaLng;
thisPtr->latitudeCell.deltaLat = cvtPtr->DeltaLat;
thisPtr->latitudeCell.density = cvtPtr->Density;
/* We could reduce the code complexity here by getting smart with the
onLimit thing. However, this gets very tricky. My excuse here is
that what is code below emulates the way the Canadians did it in
FORTRAN as best we can do in C. */
if (onLimit == 0)
{
/* The normal case, probably about 99.9999 percent of the time.
Read the data into my record buffer. */
filePosition = cvtPtr->FirstRecord + rowNbr * cvtPtr->RowSize + eleNbr * thisPtr->RecSize;
if ((filePosition + sizeof(southEast) + sizeof(southWest)) > thisPtr->fileImageSize)
{
CS_erpt (cs_INV_FILE);
goto error;
}
memcpy(&southEast, thisPtr->fileImage + filePosition, sizeof(southEast));
/* Read southwest shifts. */
memcpy(&southWest,
thisPtr->fileImage + filePosition + sizeof(southEast),
sizeof(southWest));
/* Read northeast shifts. */
filePosition += cvtPtr->RowSize;
if ((filePosition + sizeof(northEast) + sizeof(northWest)) > thisPtr->fileImageSize)
{
CS_erpt (cs_INV_FILE);
goto error;
}
memcpy(&northEast, thisPtr->fileImage + filePosition, sizeof(northEast));
/* Read northwest shifts. */
memcpy(&northWest,
thisPtr->fileImage + filePosition + sizeof(northEast),
sizeof(northWest));
/* Swap as necessary. */
swapping = CS_bswap (&southEast,cs_BSWP_NTv2Data);
if (swapping)
{
CS_bswap (&southWest,cs_BSWP_NTv2Data);
CS_bswap (&northEast,cs_BSWP_NTv2Data);
CS_bswap (&northWest,cs_BSWP_NTv2Data);
}
/* Build the grid cell AA, BB, CC, and DD values. */
thisPtr->longitudeCell.currentAA = southEast.del_lng;
thisPtr->longitudeCell.currentBB = southWest.del_lng - southEast.del_lng;
thisPtr->longitudeCell.currentCC = northEast.del_lng - southEast.del_lng;
thisPtr->longitudeCell.currentDD = northWest.del_lng - southWest.del_lng - northEast.del_lng + southEast.del_lng;
thisPtr->latitudeCell.currentAA = southEast.del_lat;
thisPtr->latitudeCell.currentBB = southWest.del_lat - southEast.del_lat;
thisPtr->latitudeCell.currentCC = northEast.del_lat - southEast.del_lat;
thisPtr->latitudeCell.currentDD = northWest.del_lat - southWest.del_lat - northEast.del_lat + southEast.del_lat;
}
else if (onLimit == 1)
{
/* Point is on the extreme northern edge of the sub-grid. This occurs
ocassionally. In this case, the "northern" boundary of the grid cell
doesn't exist, and we must manufacture such. This is called a
virtual cell in the Canadian documentation. */
filePosition = cvtPtr->FirstRecord + rowNbr * cvtPtr->RowSize + eleNbr * thisPtr->RecSize;
if ((filePosition + sizeof(southEast) + sizeof(southWest)) > thisPtr->fileImageSize)
{
CS_erpt (cs_INV_FILE);
goto error;
}
memcpy(&southEast, thisPtr->fileImage + filePosition, sizeof(southEast));
/* Read southwest shifts. */
memcpy(&southWest,
thisPtr->fileImage + filePosition + sizeof(southEast),
sizeof(southWest));
/* Swap as necessary. */
swapping = CS_bswap (&southEast,cs_BSWP_NTv2Data);
if (swapping)
{
CS_bswap (&southWest,cs_BSWP_NTv2Data);
}
/* Do not attempt to read the northern boundary, it ain't there.
Compute the AA, BB, CC, DD values. */
thisPtr->longitudeCell.currentAA = southEast.del_lng;
thisPtr->longitudeCell.currentBB = southWest.del_lng - southEast.del_lng;
thisPtr->longitudeCell.currentCC = cs_Zero;
thisPtr->longitudeCell.currentDD = cs_Zero;
thisPtr->latitudeCell.currentAA = southEast.del_lat;
thisPtr->latitudeCell.currentBB = southWest.del_lat - southEast.del_lat;
thisPtr->latitudeCell.currentCC = cs_Zero;
thisPtr->latitudeCell.currentDD = cs_Zero;
/* Adjust the grid cell boundaries to indicate that the northern
limits are the same as the southern limits. I.e. a grid cell
that has zero height. */
thisPtr->longitudeCell.nwCorner [LAT] = thisPtr->longitudeCell.seCorner [LAT] + cs_LlNoise;
thisPtr->latitudeCell.nwCorner [LAT] = thisPtr->latitudeCell.seCorner [LAT] + cs_LlNoise;
}
else if (onLimit == 2)
{
/* Point is on the extreme western edge of the sub-grid. */
filePosition = cvtPtr->FirstRecord + rowNbr * cvtPtr->RowSize + eleNbr * thisPtr->RecSize;
if ((filePosition + sizeof(southEast)) > thisPtr->fileImageSize)
{
CS_erpt (cs_INV_FILE);
goto error;
}
memcpy(&southEast, thisPtr->fileImage + filePosition, sizeof(southEast));
/* Don't read the south west, it ain't there. */
filePosition += cvtPtr->RowSize;
if ((filePosition + sizeof(northEast)) > thisPtr->fileImageSize)
{
CS_erpt (cs_INV_FILE);
goto error;
}
memcpy(&northEast, thisPtr->fileImage + filePosition, sizeof(northEast));
/* Don't read the northwest, it ain't there. */
swapping = CS_bswap (&southEast,cs_BSWP_NTv2Data);
if (swapping)
{
CS_bswap (&northEast,cs_BSWP_NTv2Data);
}
thisPtr->longitudeCell.currentAA = southEast.del_lng;
thisPtr->longitudeCell.currentBB = cs_Zero;
thisPtr->longitudeCell.currentCC = northEast.del_lng - southEast.del_lng;
thisPtr->longitudeCell.currentDD = cs_Zero;
thisPtr->latitudeCell.currentAA = southEast.del_lat;
thisPtr->latitudeCell.currentBB = cs_Zero;
thisPtr->latitudeCell.currentCC = northEast.del_lat - southEast.del_lat;
thisPtr->latitudeCell.currentDD = cs_Zero;
/* Adjust the grid cell boundaries to indicate that the eastern
limits are the same as the western limits. I.e. a grid cell
that has zero width. */
thisPtr->longitudeCell.nwCorner [LNG] = thisPtr->longitudeCell.seCorner [LNG] + cs_LlNoise;
thisPtr->latitudeCell.nwCorner [LNG] = thisPtr->latitudeCell.seCorner [LNG] + cs_LlNoise;
}
else /* onLimit == 3 */
{
/* Point is actually the northwestern corner of the sub-grid. */
filePosition = cvtPtr->FirstRecord + rowNbr * cvtPtr->RowSize + eleNbr * thisPtr->RecSize;
if ((filePosition + sizeof(southEast)) > thisPtr->fileImageSize)
{
CS_erpt (cs_INV_FILE);
goto error;
}
memcpy(&southEast, thisPtr->fileImage + filePosition, sizeof(southEast));
/* Don't read anything else. There's nothing there. */
CS_bswap (&southEast,cs_BSWP_NTv2Data);
/* Compute the AA, BB, CC, DD values. */
thisPtr->longitudeCell.currentAA = southEast.del_lng;
thisPtr->longitudeCell.currentBB = cs_Zero;
thisPtr->longitudeCell.currentCC = cs_Zero;
thisPtr->longitudeCell.currentDD = cs_Zero;
thisPtr->latitudeCell.currentAA = southEast.del_lat;
thisPtr->latitudeCell.currentBB = cs_Zero;
thisPtr->latitudeCell.currentCC = cs_Zero;
thisPtr->latitudeCell.currentDD = cs_Zero;
/* Adjust the grid cell boundaries to indicate that the northeastern
limits are the same as the southwestern limits. I.e. a grid cell
that has zero width and zero height. */
thisPtr->longitudeCell.nwCorner [LNG] = thisPtr->longitudeCell.seCorner [LNG] + cs_LlNoise;
thisPtr->latitudeCell.nwCorner [LNG] = thisPtr->latitudeCell.seCorner [LNG] + cs_LlNoise;
thisPtr->longitudeCell.nwCorner [LAT] = thisPtr->longitudeCell.seCorner [LAT] + cs_LlNoise;
thisPtr->latitudeCell.nwCorner [LAT] = thisPtr->latitudeCell.seCorner [LAT] + cs_LlNoise;
}
/* The cells are now valid, maybe. We now work around a bust in the
Canadian NTV2_0.gsb grid data file. */
thisPtr->CellIsValid = TRUE;
/* Perform the interpolation calculation. */
deltaLL [LNG] = CScalcNTv2GridCell (&thisPtr->longitudeCell,source);
deltaLL [LAT] = CScalcNTv2GridCell (&thisPtr->latitudeCell,source);
rtnValue = csGRIDI_ST_OK;
}
else
{
/* We didn't find a sub-grid. The return value is +1 to indicate no
coverage. */
deltaLL [LNG] = cs_Zero;
deltaLL [LAT] = cs_Zero;
rtnValue = csGRIDI_ST_COVERAGE;
}
csErrnam [0] = '\0';
return rtnValue;
error:
if (stream != NULL)
{
CS_fclose (stream); stream = NULL;
}
return csGRIDI_ST_SYSTEM;
}
int EXP_LVL3 CS_dtupd (struct cs_Dtdef_ *dtdef,int crypt)
{
extern char csErrnam [];
extern short cs_Protect;
extern char cs_Unique;
short cs_time;
int st;
int flag;
int dummy;
csFILE *strm;
long fpos;
char *cp;
__ALIGNMENT__1 /* For some versions of Sun compiler. */
struct cs_Dtdef_ my_dtdef;
/* Capture the current time. For our purposes here, time is
the number of days since (approx) January 1, 1990. If this
record does get written, the protect field will indicate
that it has changed. */
cs_time = (short)((CS_time ((cs_Time_ *)0) - 630720000L) / 86400L);
if (dtdef->protect >= 0)
{
dtdef->protect = cs_time;
}
/* Prepare for a possible error. */
strm = NULL;
/* Adjust the name and make sure it is all upper
case. By convention, datum names are case
insensitive. */
st = CS_nampp (dtdef->key_nm);
if (st != 0) goto error;
/* Open up the Datum Dictionary and verify its magic number. */
strm = CS_dtopn (_STRM_BINUP);
if (strm == NULL)
{
goto error;
}
/* See if we have a datum with this name already. */
flag = CS_bins (strm,(long)sizeof (cs_magic_t),0L,sizeof (*dtdef),
(char *)dtdef,(CMPFUNC_CAST)CS_dtcmp);
if (flag < 0) goto error;
if (flag)
{
/* Here when the datum already exists. See if we are
allowed to change this definition. */
if (cs_Protect >= 0)
{
/* Distribution protection is enabled. */
fpos = CS_ftell (strm);
if (fpos < 0L)
{
CS_erpt (cs_IOERR);
goto error;
}
st = CS_dtrd (strm,&my_dtdef,&dummy);
if (st == 0) CS_erpt (cs_INV_FILE);
if (st <= 0)
{
goto error;
}
if (my_dtdef.protect == 1)
{
CS_stncp (csErrnam,dtdef->key_nm,MAXPATH);
CS_erpt (cs_DT_PROT);
goto error;
}
if (cs_Protect > 0 && my_dtdef.protect > 0)
{
if (my_dtdef.protect < (cs_time - cs_Protect)) /*lint !e644 */
{
CS_stncp (csErrnam,dtdef->key_nm,MAXPATH);
CS_erpt (cs_DT_UPROT);
goto error;
}
}
st = CS_fseek (strm,fpos,SEEK_SET);
if (st < 0L)
{
CS_erpt (cs_IOERR);
goto error;
}
}
/* If we're still here, it's OK to update this definition. */
if (CS_dtwr (strm,dtdef,crypt))
{
goto error;
}
}
else
{
/* Here if the datum definition doesn't exist. We
have to add it. If cs_Unique is not zero, we
require that a cs_Unique character be present
in the key name before we'll allow it to be
written. */
if (cs_Unique != '\0')
{
cp = strchr (dtdef->key_nm,cs_Unique);
if (cp == NULL)
{
csErrnam [0] = cs_Unique;
csErrnam [1] = '\0';
CS_erpt (cs_UNIQUE);
goto error;
}
}
/* Now we can add it. Write to the end of the file, and then
sort the file. */
st = CS_fseek (strm,0L,SEEK_END);
if (st != 0)
{
CS_erpt (cs_IOERR);
goto error;
}
if (CS_dtwr (strm,dtdef,crypt))
{
goto error;
}
/* Sort the file into proper order, thereby
moving the new datum to its proper place
in the dictionary. */
st = CS_fseek (strm,(long)sizeof (cs_magic_t),SEEK_SET);
if (st != 0)
{
CS_erpt (cs_IOERR);
goto error;
}
st = CS_ips (strm,sizeof (*dtdef),0L,(CMPFUNC_CAST)CS_dtcmp);
if (st < 0) goto error;
}
/* The Datum Dictionary has been updated. */
CS_dtDictCls (strm);
return (flag);
error:
if (strm != NULL) CS_dtDictCls (strm);
return (-1);
}
int EXP_LVL3 CS_dtwr (csFILE *strm,Const struct cs_Dtdef_ *dt_def,int crypt)
{
cs_Register unsigned char key;
cs_Register unsigned char *cp;
static unsigned seed = 0;
int st;
size_t wr_cnt;
unsigned char *cpe;
__ALIGNMENT__1 /* For some versions of Sun compiler. */
struct cs_Dtdef_ lcl_dt;
/* Get a local copy which we can modify without screwing up
the calling module. */
memcpy ((char *)&lcl_dt,(char *)dt_def,sizeof (lcl_dt));
/* Swap the bytes, if necessary, before possible encryption. */
CS_bswap (&lcl_dt,cs_BSWP_DTDEF);
/* Encrypt if requested. */
if (crypt)
{
if (seed == 0)
{
seed = (unsigned)CS_time ((cs_Time_ *)0);
srand (seed);
}
while (TRUE)
{
key = (unsigned char)rand ();
cpe = (unsigned char *)&lcl_dt;
cp = cpe + sizeof (lcl_dt);
lcl_dt.fill [0] = (char)key;
lcl_dt.fill [1] = (char)rand ();
while (--cp > cpe)
{
*cp ^= *(cp - 1);
}
*cp ^= (unsigned char)lcl_dt.fill [0];
if (lcl_dt.fill [0] != '\0') break;
/* OPPS!!! The key turned out to be
zero. Need to try another one.
Need to restore the original data
or we'll be encrypting encrypted
data. We can't decipher that one. */
memcpy ((char *)&lcl_dt,(char *)dt_def,
sizeof (lcl_dt));
CS_bswap (&lcl_dt,cs_BSWP_DTDEF);
}
}
else
{
/* If no encryption, set code to
zero. This effectively turns
encryption off. */
lcl_dt.fill [0] = '\0';
lcl_dt.fill [1] = '\0';
}
/* Synchronize the stream. */
st = CS_fseek (strm,0L,SEEK_CUR);
if (st != 0)
{
CS_erpt (cs_IOERR);
return (TRUE);
}
/* Now we can write. */
wr_cnt = CS_fwrite ((char *)&lcl_dt,1,sizeof (lcl_dt),strm);
if (wr_cnt != sizeof (lcl_dt))
{
if (CS_ferror (strm)) CS_erpt (cs_IOERR);
else CS_erpt (cs_DISK_FULL);
return (TRUE);
}
return (FALSE);
}
int EXP_LVL3 CS_dtrd (csFILE *strm,struct cs_Dtdef_ *dt_def,int *crypt)
{
cs_Register unsigned char key;
cs_Register unsigned char *cp;
int st;
size_t rd_cnt;
unsigned char *cpe;
char tmpKeyName [cs_KEYNM_DEF];
/* Synchronize the stream. */
st = CS_fseek (strm,0L,SEEK_CUR);
if (st != 0)
{
CS_erpt (cs_IOERR);
return (-1);
}
/* Now we can read. */
cp = (unsigned char *)dt_def;
rd_cnt = CS_fread ((char *)dt_def,1,sizeof (*dt_def),strm);
if (rd_cnt != sizeof (*dt_def))
{
if (CS_feof (strm))
{
return 0;
}
else if (CS_ferror (strm))
{
CS_erpt (cs_IOERR);
}
else
{
CS_erpt (cs_INV_FILE);
}
return (-1);
}
/* Do the encryption bit. */
key = (unsigned char)dt_def->fill [0];
if (key != '\0')
{
*crypt = TRUE;
cpe = cp + sizeof (*dt_def);
while (cp < cpe)
{
key ^= *cp;
*cp++ = key;
}
}
else
{
*crypt = FALSE;
}
/* Swap the bytes if necessary. */
CS_bswap (dt_def,cs_BSWP_DTDEF);
/* Check the result. The name must always meet the criteria
set by the CS_nmpp function. At least so far, the criteria
established by CS_nampp over the years has always been
expanded, never restricted. Thus, any definition which
was legitimate in a previous release would always be
legitimate iin subsequent releases. */
CS_stncp (tmpKeyName,dt_def->key_nm,sizeof (tmpKeyName));
if (CS_nampp (tmpKeyName) != 0)
{
/* Replace the error condition reported by CS_nampp with
and Invalid File indication. */
CS_erpt (cs_INV_FILE);
return (-1);
}
/* Reset the encryption indicator in the record. */
dt_def->fill [0] = '\0';
return (1);
}
csFILE * EXP_LVL3 CS_dtopn (Const char *mode)
{
extern char cs_Dir [];
extern char *cs_DirP;
extern char cs_Dtname [];
extern char csErrnam [];
size_t rdCnt;
csFILE *strm = NULL;
cs_magic_t magic;
if (cs_DtStream != 0)
{
if (!CS_stricmp (mode,_STRM_BINRD))
{
strm = cs_DtStream;
CS_fseek (strm,(long)sizeof (magic),SEEK_SET);
}
else
{
CS_fclose (cs_DtStream);
cs_DtStream = NULL;
}
}
if (strm == NULL)
{
strcpy (cs_DirP,cs_Dtname);
strm = CS_fopen (cs_Dir,mode);
if (strm != NULL)
{
rdCnt = CS_fread ((char *)&magic,1,sizeof (magic),strm);
if (rdCnt != sizeof (magic))
{
if (CS_ferror (strm)) CS_erpt (cs_IOERR);
else CS_erpt (cs_INV_FILE);
CS_fclose (strm);
strm = NULL;
strcpy (csErrnam,cs_Dir);
}
else
{
CS_bswap (&magic,"l");
if (magic != cs_DTDEF_MAGIC)
{
CS_fclose (strm);
strm = NULL;
strcpy (csErrnam,cs_Dir);
CS_erpt (cs_DT_BAD_MAGIC);
}
else if (!strcmp (mode,_STRM_BINRD))
{
cs_DtStream = strm;
}
}
}
else
{
strcpy (csErrnam,cs_Dir);
CS_erpt (cs_DTDICT);
}
}
return (strm);
}
/* Interpolation Calculator
Due to a bust in the file format, we do not buffer up grid cells and stuff.
There are a couple of sub-grids which overlap other grids in such a way that
buffering can cause errors. So, at least until (if ever) the data file is
corrected, we do no buffering of the grid cells.
Also, this file format is being adopted by others, like the Aussie's. We
don't know what they are going to do. So to be safe, NO BUFFERING OF GRID
CELLS.
Also, due to the sub-grid nature of the data file, we do not buffer the
data file in any special way; we simply use normal stream buffering.
*/
int CScalcGridFileCa2 (struct csGridFileCa2_* __This,double deltaLL [2],Const double source [2])
{
extern double cs_Zero; /* 0.0 */
extern double cs_LlNoise; /* 1.0E-12 */
extern char csErrnam [];
short idx;
short parIdx;
short onLimit;
unsigned short eleNbr, rowNbr;
int seekStat;
int rtnValue;
size_t readCnt;
long32_t filePosition;
struct csGridFileCa2SubGrid_ *subPtr;
struct csGridFileCa2SubGrid_ *cvtPtr;
double bestCellSize;
double wpLL [2];
double swCell [2];
struct TcsCaNTv2Data southEast;
struct TcsCaNTv2Data southWest;
struct TcsCaNTv2Data northEast;
struct TcsCaNTv2Data northWest;
/* Until we know differently. */
__This->CellIsValid = FALSE;
/* In case of an error. This saves duplication of this many many times. */
CS_stncp (csErrnam,__This->FilePath,MAXPATH);
/* Remember, source is East Positive. The CaNTv2 file is West Positive. */
wpLL [LNG] = -source [LNG];
wpLL [LAT] = source [LAT];
/* Locate the appropriate sub-grid. If there is none, than there is no
coverage. There are two algorithms: the original one and one invented
to cater to the Spaniards, maybe someothers in the future.
In the original alghorithm, we search through the top level of parent
grids looing for coverage. The top level parents are those which have no
parent. If none is found, there is no coverage. If we locate a parent
which provides coverage, we examine all children of that parent looking
for a sub-grid; and so on.
In the Spanish algorithm, we search all grids, and choose the grid which
produces the smallest cell size. This is necessary as the grids are
allowed to overlap in the Spanish variation. */
cvtPtr = NULL; /* NULL says no coverage (yet). */
if (__This->SubOverlap == 0)
{
parIdx = -1;
/* The Canadian algorithm. We loop, only considering those
sub-grids whose parent index match parIdx. */
for (idx = 0;idx < __This->SubCount;idx += 1)
{
subPtr = &__This->SubGridDir [idx];
/* The following verifies that the current sub is a child of
the located parent. Also, causes children to be skipped
until such time as we have found a parent. */
if (subPtr->ParentIndex != parIdx) continue;
/* Does this sub grid cover the point we are to convert?
Remember, we're dealing with WEST POSITIVE longitude.
the SeReference & NwReference values are west positive.
Think of this being a transformation that applies to
Russia, instead of Canada. */
if (wpLL [LNG] >= subPtr->SeReference [LNG] &&
wpLL [LAT] >= subPtr->SeReference [LAT] &&
wpLL [LNG] <= subPtr->NwReference [LNG] &&
wpLL [LAT] <= subPtr->NwReference [LAT])
{
/* If this is a sub grid and on the northern or western
boundary, we do not consider it a match. */
if (subPtr->ParentIndex >= 0 &&
(wpLL [LNG] >= subPtr->NwReference [LNG] ||
wpLL [LAT] >= subPtr->NwReference [LAT])
)
{
continue;
}
/* We have a match. */
cvtPtr = subPtr;
/* See if this grid has one or more children. */
if (cvtPtr->ChildIndex < 0)
{
/* This one has no children; use cvtPtr. */
break;
}
/* This guy has children. We need to see if any of these
children cover the point we are converting. Need a minus
one here as the loop code is going to bump idx. */
parIdx = idx;
idx = cvtPtr->ChildIndex - 1;
}
}
}
else
{
/* The Spanish variation. We search all subgrids looking for
coverages. As the sub-grids are allowed to overlap, we must
search them all, and we select the one which produces the
smallest cell size as the "appropriate" one. */
bestCellSize = 1.0E+100;
for (idx = 0;idx < __This->SubCount;idx += 1)
{
subPtr = &__This->SubGridDir [idx];
/* Does this sub grid cover the point we are to convert?
Remember, we're dealing with WEST POSITIVE longitude.
the SeReference & NwReference values are west positive.
Think of this being a transformation that applies to Russia,
instead of Canada. */
if (wpLL [LNG] >= subPtr->SeReference [LNG] &&
wpLL [LAT] >= subPtr->SeReference [LAT] &&
wpLL [LNG] <= subPtr->NwReference [LNG] &&
wpLL [LAT] <= subPtr->NwReference [LAT])
{
/* Yes it does. Getthe cell size and see if it is batter
than what we have found so far. */
if (subPtr->Density < bestCellSize)
{
cvtPtr = subPtr;
bestCellSize = subPtr->Density;
onLimit = 0;
if (fabs (wpLL [LAT] - cvtPtr->NwReference [LAT]) <= cs_LlNoise) onLimit |= 1;
if (fabs (wpLL [LNG] - cvtPtr->NwReference [LNG]) <= cs_LlNoise) onLimit |= 2;
}
}
}
/* cvtPtr should still be null if no coverage was found, we rely on this. */
}
/* OK, if cvtPtr is not NULL, its a pointer to the approriate
sub grid for this conversion. */
if (cvtPtr != NULL)
{
/* Make sure the file is opened. It can get closed by a release. */
if (__This->Stream == NULL)
{
__This->Stream = CS_fopen (__This->FilePath,_STRM_BINRD);
if (__This->Stream == NULL)
{
CS_stncp (csErrnam,__This->FilePath,MAXPATH);
CS_erpt (cs_DTC_FILE);
goto error;
}
setvbuf (__This->Stream,NULL,_IOFBF,(size_t)__This->BufferSize);
}
/* Compute onLimit for this point and the selected sub-grid regardless
of how we got here. This should now only occur at the extreme edges
of the entire file coverage. */
onLimit = 0;
if (fabs (wpLL [LAT] - cvtPtr->NwReference [LAT]) <= cs_LlNoise) onLimit |= 1;
if (fabs (wpLL [LNG] - cvtPtr->NwReference [LNG]) <= cs_LlNoise) onLimit |= 2;
/* Compute the elements required for the file access. This is common to
all cases of "onLimit". */
eleNbr = (unsigned short)(((wpLL [LNG] - cvtPtr->SeReference [LNG]) / cvtPtr->DeltaLng) + cs_LlNoise);
rowNbr = (unsigned short)(((wpLL [LAT] - cvtPtr->SeReference [LAT]) / cvtPtr->DeltaLat) + cs_LlNoise);
/* Compute the boundaries of the specific cell we dealing with, assuming
onLimit is zero (which is the case 99.999% of the time). The
nonmenclature goes funny here as we use a grid cell structure which
is common to US and Canandian style files. The craziness comes from
the fact that the US uses east positive longitude and the Canadians
use west positive latitude. */
swCell [LNG] = cvtPtr->SeReference [LNG] + cvtPtr->DeltaLng * (double)eleNbr;
swCell [LAT] = cvtPtr->SeReference [LAT] + cvtPtr->DeltaLat * (double)rowNbr;
/* Build the extent portions of the grid cells. Note that due to the
west positive nature of this dataset, the elements are used differently
than what the element names indicate.
That is, since:
1> the Canadians use positive west longitude, and
2> the US grid uses positive east lonigtudes, and
3> since we use the same grid cell structure for both the
US data and Canadian data,
we need to swap east and west in the nonmenclature used when
building a grid cell structure. So, in thew code below, we are
actually putting the southeast corner in the southwest point
of the grid cell. Similarly with the northwest and the
northeast. While we use the same grid cell structure (as we
must if as we cache these together in the same cache), we
have separate calculation routines; so this does work.
*/
__This->longitudeCell.coverage.southWest [LNG] = swCell [LNG];
__This->longitudeCell.coverage.southWest [LAT] = swCell [LAT];
__This->longitudeCell.coverage.northEast [LNG] = swCell [LNG] + cvtPtr->DeltaLng;
__This->longitudeCell.coverage.northEast [LAT] = swCell [LAT] + cvtPtr->DeltaLat;
__This->longitudeCell.coverage.density = cvtPtr->Density;
__This->longitudeCell.deltaLng = cvtPtr->DeltaLng;
__This->longitudeCell.deltaLat = cvtPtr->DeltaLat;
__This->latitudeCell.coverage.southWest [LNG] = swCell [LNG];
__This->latitudeCell.coverage.southWest [LAT] = swCell [LAT];
__This->latitudeCell.coverage.northEast [LNG] = swCell [LNG] + cvtPtr->DeltaLng;
__This->latitudeCell.coverage.northEast [LAT] = swCell [LAT] + cvtPtr->DeltaLat;
__This->latitudeCell.coverage.density = cvtPtr->Density;
__This->latitudeCell.deltaLng = cvtPtr->DeltaLng;
__This->latitudeCell.deltaLat = cvtPtr->DeltaLat;
/* We code reduce the code level here by getting smart with the onLimit
thing. However, this gets very tricky. My excuse here is that this
emulates the way the Canadians did it in FORTRAN. */
if (onLimit == 0)
{
/* The normal case, probably about 99.99999 percent of the time.
Read the data into my record buffer. */
filePosition = cvtPtr->FirstRecord + rowNbr * cvtPtr->RowSize + eleNbr * __This->RecSize;
seekStat = CS_fseek (__This->Stream,filePosition,SEEK_SET);
if (seekStat != 0)
{
CS_erpt (cs_INV_FILE);
goto error;
}
/* Read southeast shifts. */
readCnt = CS_fread (&southEast,1,sizeof (southEast),__This->Stream);
if (CS_ferror (__This->Stream))
{
CS_erpt (cs_IOERR);
goto error;
}
if (readCnt != sizeof (southEast))
{
CS_erpt (cs_INV_FILE);
goto error;
}
/* Read southwest shifts. */
readCnt = CS_fread (&southWest,1,sizeof (southWest),__This->Stream);
if (CS_ferror (__This->Stream))
{
CS_erpt (cs_IOERR);
goto error;
}
if (readCnt != sizeof (southWest))
{
CS_erpt (cs_INV_FILE);
goto error;
}
/* Read northeast shifts. */
filePosition += cvtPtr->RowSize;
seekStat = CS_fseek (__This->Stream,filePosition,SEEK_SET);
if (seekStat != 0)
{
CS_erpt (cs_INV_FILE);
goto error;
}
readCnt = CS_fread (&northEast,1,sizeof (northEast),__This->Stream);
if (CS_ferror (__This->Stream))
{
CS_erpt (cs_IOERR);
goto error;
}
if (readCnt != sizeof (northEast))
{
CS_erpt (cs_INV_FILE);
goto error;
}
/* Read northwest shifts. */
readCnt = CS_fread (&northWest,1,sizeof (northWest),__This->Stream);
if (CS_ferror (__This->Stream))
{
CS_erpt (cs_IOERR);
goto error;
}
if (readCnt != sizeof (northWest))
{
CS_erpt (cs_INV_FILE);
goto error;
}
/* Swap as necessary. */
CS_bswap (&southEast,cs_BSWP_GridFileCa2Data);
CS_bswap (&southWest,cs_BSWP_GridFileCa2Data);
CS_bswap (&northEast,cs_BSWP_GridFileCa2Data);
CS_bswap (&northWest,cs_BSWP_GridFileCa2Data);
/* Build the grid cell AA, BB, CC, and DD values. */
__This->longitudeCell.currentAA = southEast.del_lng;
__This->longitudeCell.currentBB = southWest.del_lng - southEast.del_lng;
__This->longitudeCell.currentCC = northEast.del_lng - southEast.del_lng;
__This->longitudeCell.currentDD = northWest.del_lng - southWest.del_lng - northEast.del_lng + southEast.del_lng;
__This->latitudeCell.currentAA = southEast.del_lat;
__This->latitudeCell.currentBB = southWest.del_lat - southEast.del_lat;
__This->latitudeCell.currentCC = northEast.del_lat - southEast.del_lat;
__This->latitudeCell.currentDD = northWest.del_lat - southWest.del_lat - northEast.del_lat + southEast.del_lat;
}
else if (onLimit == 1)
{
/* Point is on the extreme northern edge of the sub-grid. This occurs
ocassionally. In this case, the "northern" boundary of the grid cell
doesn't exist, and we must manufacture such. This is called a
virtual cell in the Canadian documentation. */
filePosition = cvtPtr->FirstRecord + rowNbr * cvtPtr->RowSize + eleNbr * __This->RecSize;
seekStat = CS_fseek (__This->Stream,filePosition,SEEK_SET);
if (seekStat != 0)
{
CS_erpt (cs_INV_FILE);
goto error;
}
readCnt = CS_fread (&southEast,1,sizeof (southEast),__This->Stream);
if (CS_ferror (__This->Stream))
{
CS_erpt (cs_IOERR);
goto error;
}
if (readCnt != sizeof (southWest))
{
CS_erpt (cs_INV_FILE);
goto error;
}
readCnt = CS_fread (&southWest,1,sizeof (southWest),__This->Stream);
if (CS_ferror (__This->Stream))
{
CS_erpt (cs_IOERR);
goto error;
}
if (readCnt != sizeof (southEast))
{
CS_erpt (cs_INV_FILE);
goto error;
}
/* Swap as necessary. */
CS_bswap (&southEast,cs_BSWP_GridFileCa2Data);
CS_bswap (&southWest,cs_BSWP_GridFileCa2Data);
/* Do not attempt to read the northern boundary, it ain't there.
Compute the AA, BB, CC, DD values. */
__This->longitudeCell.currentAA = southEast.del_lng;
__This->longitudeCell.currentBB = southWest.del_lng - southEast.del_lng;
__This->longitudeCell.currentCC = cs_Zero;
__This->longitudeCell.currentDD = cs_Zero;
__This->latitudeCell.currentAA = southEast.del_lat;
__This->latitudeCell.currentBB = southWest.del_lat - southEast.del_lat;
__This->latitudeCell.currentCC = cs_Zero;
__This->latitudeCell.currentDD = cs_Zero;
/* Adjust the grid cell boundaries to indicate that the northern
limits are the same as the southern limits. I.e. a grid cell
that has zero height. */
__This->longitudeCell.coverage.northEast [LAT] = __This->longitudeCell.coverage.southWest [LAT] + cs_LlNoise;
__This->latitudeCell.coverage.northEast [LAT] = __This->latitudeCell.coverage.southWest [LAT] + cs_LlNoise;
}
else if (onLimit == 2)
{
/* Point is on the extreme western edge of the sub-grid. */
filePosition = cvtPtr->FirstRecord + rowNbr * cvtPtr->RowSize + eleNbr * __This->RecSize;
seekStat = CS_fseek (__This->Stream,filePosition,SEEK_SET);
if (seekStat != 0)
{
CS_erpt (cs_INV_FILE);
goto error;
}
readCnt = CS_fread (&southEast,1,sizeof (southEast),__This->Stream);
if (CS_ferror (__This->Stream))
{
CS_erpt (cs_IOERR);
goto error;
}
if (readCnt != sizeof (southWest))
{
CS_erpt (cs_INV_FILE);
goto error;
}
/* Don't read the south west, it ain't there. */
filePosition += cvtPtr->RowSize;
seekStat = CS_fseek (__This->Stream,filePosition,SEEK_SET);
if (seekStat != 0)
{
CS_erpt (cs_INV_FILE);
goto error;
}
readCnt = CS_fread (&northEast,1,sizeof (northEast),__This->Stream);
if (CS_ferror (__This->Stream))
{
CS_erpt (cs_IOERR);
goto error;
}
if (readCnt != sizeof (northWest))
{
CS_erpt (cs_INV_FILE);
goto error;
}
/* Don't read the northwest, it ain't there. */
CS_bswap (&southEast,cs_BSWP_GridFileCa2Data);
CS_bswap (&northEast,cs_BSWP_GridFileCa2Data);
__This->longitudeCell.currentAA = southEast.del_lng;
__This->longitudeCell.currentBB = cs_Zero;
__This->longitudeCell.currentCC = northEast.del_lng - southEast.del_lng;
__This->longitudeCell.currentDD = cs_Zero;
__This->latitudeCell.currentAA = southEast.del_lat;
__This->latitudeCell.currentBB = cs_Zero;
__This->latitudeCell.currentCC = northEast.del_lat - southEast.del_lat;
__This->latitudeCell.currentDD = cs_Zero;
/* Adjust the grid cell boundaries to indicate that the eastern
limits are the same as the western limits. I.e. a grid cell
that has zero width. */
__This->longitudeCell.coverage.northEast [LNG] = __This->longitudeCell.coverage.southWest [LNG] + cs_LlNoise;
__This->latitudeCell.coverage.northEast [LNG] = __This->latitudeCell.coverage.southWest [LNG] + cs_LlNoise;
}
else /* onLimit == 3 */
{
/* Point is actually the northwestern corner of the sub-grid. */
filePosition = cvtPtr->FirstRecord + rowNbr * cvtPtr->RowSize + eleNbr * __This->RecSize;
seekStat = CS_fseek (__This->Stream,filePosition,SEEK_SET);
if (seekStat != 0)
{
CS_erpt (cs_INV_FILE);
goto error;
}
readCnt = CS_fread (&southEast,1,sizeof (southWest),__This->Stream);
if (CS_ferror (__This->Stream))
{
CS_erpt (cs_IOERR);
goto error;
}
if (readCnt != sizeof (southWest))
{
CS_erpt (cs_INV_FILE);
goto error;
}
/* Don't read anything else. There's nothing there. */
CS_bswap (&southEast,cs_BSWP_GridFileCa2Data);
/* Compute the AA, BB, CC, DD values. */
__This->longitudeCell.currentAA = southEast.del_lng;
__This->longitudeCell.currentBB = cs_Zero;
__This->longitudeCell.currentCC = cs_Zero;
__This->longitudeCell.currentDD = cs_Zero;
__This->latitudeCell.currentAA = southEast.del_lat;
__This->latitudeCell.currentBB = cs_Zero;
__This->latitudeCell.currentCC = cs_Zero;
__This->latitudeCell.currentDD = cs_Zero;
/* Adjust the grid cell boundaries to indicate that the northeastern
limits are the same as the southwestern limits. I.e. a grid cell
that has zero width and zero height. */
__This->longitudeCell.coverage.northEast [LAT] = __This->longitudeCell.coverage.southWest [LAT] + cs_LlNoise;
__This->latitudeCell.coverage.northEast [LAT] = __This->latitudeCell.coverage.southWest [LAT] + cs_LlNoise;
__This->longitudeCell.coverage.northEast [LNG] = __This->longitudeCell.coverage.southWest [LNG] + cs_LlNoise;
__This->latitudeCell.coverage.northEast [LNG] = __This->latitudeCell.coverage.southWest [LNG] + cs_LlNoise;
}
/* The cells are now valid, maybe. We now work around a bust
in the Canadian grid file format. */
__This->CellIsValid = cvtPtr->Cacheable;
for (idx = 0;csKludgeTable [idx][0] != 0.0;idx += 1)
{
if (source [LNG] >= csKludgeTable [idx][0] &&
source [LAT] >= csKludgeTable [idx][1] &&
source [LNG] <= csKludgeTable [idx][2] &&
source [LAT] <= csKludgeTable [idx][3])
{
__This->CellIsValid = FALSE;
break;
}
}
/* Perform the interpolation calculation. */
deltaLL [LNG] = CScalcGridCellCA (&__This->longitudeCell,source);
deltaLL [LAT] = CScalcGridCellCA (&__This->latitudeCell,source);
rtnValue = 0;
}
else
{
/* We didn't find a sub-grid. The return value is +1 to indicate no
coverage. We should, in this case, use the fall back guy. */
deltaLL [LNG] = cs_Zero;
deltaLL [LAT] = cs_Zero;
rtnValue = 1;
}
csErrnam [0] = '\0';
return rtnValue;
error:
return -1;
}
