2013-03-25 12:04:10 +00:00
|
|
|
/*
|
2019-04-15 13:44:45 +00:00
|
|
|
* Copyright 2005-2019 ECMWF.
|
2013-03-25 12:04:10 +00:00
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*/
|
|
|
|
#include "grib_api.h"
|
|
|
|
|
2017-08-25 16:30:00 +00:00
|
|
|
static void usage(const char* prog) {
|
2014-07-29 15:50:33 +00:00
|
|
|
printf("usage: %s infile\n",prog);
|
|
|
|
exit(1);
|
2013-03-25 12:04:10 +00:00
|
|
|
}
|
|
|
|
|
2014-07-29 15:50:33 +00:00
|
|
|
int main(int argc,char* argv[])
|
|
|
|
{
|
|
|
|
grib_index* index=NULL;
|
|
|
|
grib_handle* h=NULL;
|
|
|
|
char* infile=NULL;
|
2015-03-02 17:22:07 +00:00
|
|
|
long *steps,*levels,*numbers; /* arrays */
|
2014-07-29 15:50:33 +00:00
|
|
|
char** shortName=NULL;
|
2015-03-02 17:22:07 +00:00
|
|
|
int i,j,k,l;
|
2014-07-29 15:50:33 +00:00
|
|
|
size_t stepSize,levelSize,shortNameSize,numberSize;
|
2015-11-27 18:04:40 +00:00
|
|
|
long oStep,oLevel,oNumber;
|
|
|
|
char oShortName[200];
|
|
|
|
size_t lenShortName=200;
|
2014-07-29 15:50:33 +00:00
|
|
|
int ret=0,count=0;
|
|
|
|
|
|
|
|
if (argc != 2) usage(argv[0]);
|
|
|
|
infile=argv[1];
|
|
|
|
|
|
|
|
printf("indexing...\n");
|
|
|
|
|
2015-03-02 17:22:07 +00:00
|
|
|
/* Create an index given set of keys*/
|
|
|
|
index=grib_index_new(0,"shortName,level,number,step",&ret);
|
|
|
|
if (ret) {printf("error: %s\n",grib_get_error_message(ret)); exit(ret);}
|
|
|
|
|
|
|
|
/* Indexes a file */
|
|
|
|
ret=grib_index_add_file(index,infile);
|
|
|
|
if (ret) {printf("error: %s\n",grib_get_error_message(ret)); exit(ret);}
|
|
|
|
printf("end indexing...\n");
|
|
|
|
|
|
|
|
/* get the number of distinct values of "step" in the index */
|
|
|
|
GRIB_CHECK(grib_index_get_size(index,"step",&stepSize),0);
|
|
|
|
steps=(long*)malloc(sizeof(long)*stepSize);
|
|
|
|
if (!steps) exit(1);
|
|
|
|
/* get the list of distinct steps from the index */
|
|
|
|
/* the list is in ascending order */
|
|
|
|
GRIB_CHECK(grib_index_get_long(index,"step",steps,&stepSize),0);
|
|
|
|
printf("stepSize=%ld\n",(long)stepSize);
|
|
|
|
for (i=0;i<stepSize;i++) printf("%ld ",steps[i]);
|
|
|
|
printf("\n");
|
|
|
|
|
|
|
|
/*same as for "step"*/
|
|
|
|
GRIB_CHECK(grib_index_get_size(index,"level",&levelSize),0);
|
|
|
|
levels=(long*)malloc(sizeof(long)*levelSize);
|
|
|
|
if (!levels) exit(1);
|
|
|
|
/*same as for "step"*/
|
|
|
|
GRIB_CHECK(grib_index_get_long(index,"level",levels,&levelSize),0);
|
|
|
|
printf("levelSize=%ld\n",(long)levelSize);
|
|
|
|
for (i=0;i<levelSize;i++) printf("%ld ",levels[i]);
|
|
|
|
printf("\n");
|
|
|
|
|
|
|
|
/*same as for "step"*/
|
|
|
|
GRIB_CHECK(grib_index_get_size(index,"number",&numberSize),0);
|
|
|
|
numbers=(long*)malloc(sizeof(long)*numberSize);
|
|
|
|
if (!numbers) exit(1);
|
|
|
|
/*same as for "step"*/
|
|
|
|
GRIB_CHECK(grib_index_get_long(index,"number",numbers,&numberSize),0);
|
|
|
|
printf("numberSize=%ld\n",(long)numberSize);
|
|
|
|
for (i=0;i<numberSize;i++) printf("%ld ",numbers[i]);
|
|
|
|
printf("\n");
|
|
|
|
|
|
|
|
/*same as for "step"*/
|
|
|
|
GRIB_CHECK(grib_index_get_size(index,"shortName",&shortNameSize),0);
|
|
|
|
shortName=(char**)malloc(sizeof(char*)*shortNameSize);
|
|
|
|
if (!shortName) exit(1);
|
|
|
|
/*same as for "step"*/
|
|
|
|
GRIB_CHECK(grib_index_get_string(index,"shortName",shortName,&shortNameSize),0);
|
|
|
|
printf("shortNameSize=%ld\n",(long)shortNameSize);
|
|
|
|
for (i=0;i<shortNameSize;i++) printf("%s ",shortName[i]);
|
|
|
|
printf("\n");
|
|
|
|
|
|
|
|
count=0;
|
|
|
|
/* nested loops on the keys values of the index */
|
|
|
|
/* different order of the nested loops doesn't affect performance*/
|
|
|
|
for (i=0;i<shortNameSize;i++) {
|
|
|
|
/* select the GRIB with shortName=shortName[i] */
|
|
|
|
grib_index_select_string(index,"shortName",shortName[i]);
|
|
|
|
|
|
|
|
for (l=0;l<levelSize;l++) {
|
|
|
|
/* select the GRIB with level=levels[i] */
|
|
|
|
grib_index_select_long(index,"level",levels[l]);
|
|
|
|
|
|
|
|
for (j=0;j<numberSize;j++) {
|
|
|
|
/* select the GRIB with number=numbers[i] */
|
|
|
|
grib_index_select_long(index,"number",numbers[j]);
|
|
|
|
|
|
|
|
for (k=0;k<stepSize;k++) {
|
|
|
|
/* select the GRIB with step=steps[i] */
|
|
|
|
grib_index_select_long(index,"step",steps[k]);
|
|
|
|
|
|
|
|
/* create a new grib_handle from the index with the constraints
|
2014-07-29 15:50:33 +00:00
|
|
|
imposed by the select statements. It is a loop because
|
|
|
|
in the index there could be more than one GRIB with those
|
|
|
|
constraints */
|
2015-03-02 17:22:07 +00:00
|
|
|
while ((h=grib_handle_new_from_index(index,&ret))!=NULL){
|
|
|
|
count++;
|
|
|
|
if (ret) {printf("error: %d\n",ret); exit(ret);}
|
2015-11-27 18:04:40 +00:00
|
|
|
lenShortName=200;
|
|
|
|
grib_get_string(h,"shortName",oShortName,&lenShortName);
|
|
|
|
grib_get_long(h,"level",&oLevel);
|
|
|
|
grib_get_long(h,"number",&oNumber);
|
|
|
|
grib_get_long(h,"step",&oStep);
|
|
|
|
printf("shortName=%s ",oShortName);
|
|
|
|
printf("level=%ld ",oLevel);
|
|
|
|
printf("number=%ld ",oNumber);
|
|
|
|
printf("step=%ld \n",oStep);
|
2015-03-02 17:22:07 +00:00
|
|
|
grib_handle_delete(h);
|
2014-07-29 15:50:33 +00:00
|
|
|
}
|
2015-03-02 17:22:07 +00:00
|
|
|
if (ret && ret!=GRIB_END_OF_INDEX ) {printf("error: %s\n",grib_get_error_message(ret)); exit(ret);}
|
2014-07-29 15:50:33 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2015-03-02 17:22:07 +00:00
|
|
|
printf(" %d messages selected\n",count);
|
|
|
|
|
|
|
|
grib_index_write(index,"out.gribidx");
|
|
|
|
grib_index_delete(index);
|
2014-07-29 15:50:33 +00:00
|
|
|
|
|
|
|
return 0;
|
2013-03-25 12:04:10 +00:00
|
|
|
}
|