mirror of https://github.com/ecmwf/eccodes.git
191 lines
5.6 KiB
C
191 lines
5.6 KiB
C
/*
|
|
* (C) Copyright 2005- ECMWF.
|
|
*
|
|
* This software is licensed under the terms of the Apache Licence Version 2.0
|
|
* which can be obtained at http://www.apache.org/licenses/LICENSE-2.0.
|
|
*
|
|
* In applying this licence, ECMWF does not waive the privileges and immunities granted to it by
|
|
* virtue of its status as an intergovernmental organisation nor does it submit to any jurisdiction.
|
|
*/
|
|
|
|
/*
|
|
* Description: Nearest neighbour functionality using multiple input points
|
|
*
|
|
*/
|
|
|
|
#include "eccodes.h"
|
|
|
|
static void usage(const char* prog)
|
|
{
|
|
fprintf(stderr, "Usage: %s latlon_file grib_orography grib_file grib_file ...\n", prog);
|
|
fprintf(stderr, " The latlon_file should have 3 columns: num lat lon\n");
|
|
fprintf(stderr, " The grib_orography file is treated as the land-sea mask\n");
|
|
fprintf(stderr, "\n");
|
|
exit(1);
|
|
}
|
|
|
|
int main(int argc, char** argv)
|
|
{
|
|
FILE* fin = 0;
|
|
int ret = 0;
|
|
char* fname = 0;
|
|
float lat, lon;
|
|
double *vlat, *vlon;
|
|
int npoints = 0, i = 0, n = 0;
|
|
codes_handle* h;
|
|
double *outlats, *outlons, *values, *lsm_values, *distances;
|
|
int* indexes;
|
|
/*long step=0;
|
|
char time[10]={0,};
|
|
char date[10]={0,};
|
|
long parameter=0;
|
|
size_t len=0;*/
|
|
long iid = 0;
|
|
long* id = NULL;
|
|
const int is_lsm = 1;
|
|
|
|
if (argc < 2) usage(argv[0]);
|
|
|
|
/* input lat/lon file should have 3 columns:
|
|
* number latitude longitude
|
|
*/
|
|
fname = argv[1];
|
|
fin = fopen(fname, "r"); /* open in text mode */
|
|
if (!fin) {
|
|
perror(fname);
|
|
exit(1);
|
|
}
|
|
npoints = 0;
|
|
while (fscanf(fin, "%ld %g %g", &iid, &lat, &lon) != EOF)
|
|
npoints++;
|
|
fclose(fin);
|
|
if (npoints==0) {
|
|
fprintf(stderr, "No input points found!\n");
|
|
exit(1);
|
|
}
|
|
|
|
id = (long*)calloc(npoints, sizeof(long));
|
|
if (!id) {
|
|
fprintf(stderr, "unable to allocate %ld bytes\n", (long)(npoints * sizeof(long)));
|
|
exit(1);
|
|
}
|
|
vlat = (double*)calloc(npoints, sizeof(double));
|
|
if (!vlat) {
|
|
fprintf(stderr, "unable to allocate %ld bytes\n", (long)(npoints * sizeof(double)));
|
|
exit(1);
|
|
}
|
|
vlon = (double*)calloc(npoints, sizeof(double));
|
|
if (!vlon) {
|
|
fprintf(stderr, "unable to allocate %ld bytes\n", (long)(npoints * sizeof(double)));
|
|
exit(1);
|
|
}
|
|
outlats = (double*)calloc(npoints, sizeof(double));
|
|
if (!outlats) {
|
|
fprintf(stderr, "unable to allocate %ld bytes\n", (long)(npoints * sizeof(double)));
|
|
exit(1);
|
|
}
|
|
outlons = (double*)calloc(npoints, sizeof(double));
|
|
if (!outlons) {
|
|
fprintf(stderr, "unable to allocate %ld bytes\n", (long)(npoints * sizeof(double)));
|
|
exit(1);
|
|
}
|
|
values = (double*)calloc(npoints, sizeof(double));
|
|
if (!values) {
|
|
fprintf(stderr, "unable to allocate %ld bytes\n", (long)(npoints * sizeof(double)));
|
|
exit(1);
|
|
}
|
|
lsm_values = (double*)calloc(npoints, sizeof(double));
|
|
if (!lsm_values) {
|
|
fprintf(stderr, "unable to allocate %ld bytes\n", (long)(npoints * sizeof(double)));
|
|
exit(1);
|
|
}
|
|
distances = (double*)calloc(npoints, sizeof(double));
|
|
if (!distances) {
|
|
fprintf(stderr, "unable to allocate %ld bytes\n", (long)(npoints * sizeof(double)));
|
|
exit(1);
|
|
}
|
|
indexes = (int*)calloc(npoints, sizeof(int));
|
|
if (!indexes) {
|
|
fprintf(stderr, "unable to allocate %ld bytes\n", (long)(npoints * sizeof(int)));
|
|
exit(1);
|
|
}
|
|
|
|
fname = argv[1];
|
|
fin = fopen(fname, "r"); /* open in text mode */
|
|
if (!fin) {
|
|
perror(fname);
|
|
exit(1);
|
|
}
|
|
i = 0;
|
|
while (i < npoints && fscanf(fin, "%ld %g %g", &iid, &lat, &lon) != EOF) {
|
|
id[i] = iid;
|
|
vlat[i] = lat;
|
|
while (lon < 0)
|
|
lon += 360;
|
|
vlon[i] = lon;
|
|
i++;
|
|
}
|
|
fclose(fin);
|
|
|
|
/* the first GRIB file on the arguments is treated as the land-sea mask file */
|
|
fname = argv[2];
|
|
fin = fopen(fname, "rb"); /* open GRIB in binary mode */
|
|
if (!fin) {
|
|
perror(fname);
|
|
exit(1);
|
|
}
|
|
h = codes_handle_new_from_file(0, fin, PRODUCT_GRIB, &ret);
|
|
if (!h || ret != CODES_SUCCESS) {
|
|
fprintf(stderr, "unable to create handle\n");
|
|
exit(1);
|
|
}
|
|
|
|
codes_grib_nearest_find_multiple(h, is_lsm, vlat, vlon, npoints,
|
|
outlats, outlons, lsm_values, distances, indexes);
|
|
|
|
codes_handle_delete(h);
|
|
|
|
fclose(fin);
|
|
|
|
for (n = 3; n <= argc - 1; n++) {
|
|
fname = argv[n];
|
|
fin = fopen(fname, "r");
|
|
if (!fin) {
|
|
perror(fname);
|
|
exit(1);
|
|
}
|
|
while ((h = codes_handle_new_from_file(0, fin, PRODUCT_GRIB, &ret)) != NULL) {
|
|
codes_get_double_elements(h, "values", indexes, npoints, values);
|
|
|
|
/*
|
|
CODES_CHECK(codes_get_length(h, "date", &len),0);
|
|
codes_get_string(h,"date",date,&len);
|
|
CODES_CHECK(codes_get_length(h, "time", &len),0);
|
|
codes_get_string(h,"time",time,&len);
|
|
codes_get_long(h,"step",&step);
|
|
codes_get_long(h,"parameter",¶meter);
|
|
printf("# %s %s %ld %ld\n",date,time,step,parameter);
|
|
*/
|
|
codes_handle_delete(h);
|
|
for (i = 0; i < npoints; i++)
|
|
printf("%ld %.2f %.2f %.2f %.2f %d\n",
|
|
id[i], outlats[i], outlons[i],
|
|
lsm_values[i], values[i], indexes[i]);
|
|
}
|
|
|
|
fclose(fin);
|
|
}
|
|
|
|
free(id);
|
|
free(vlat);
|
|
free(vlon);
|
|
free(outlats);
|
|
free(outlons);
|
|
free(values);
|
|
free(lsm_values);
|
|
free(distances);
|
|
free(indexes);
|
|
|
|
return ret;
|
|
}
|