2024-03-25 23:32:23 +08:00
|
|
|
/* A Bison parser, made by GNU Bison 3.8.2. */
|
2020-07-30 07:59:19 +08:00
|
|
|
|
|
|
|
/* Bison implementation for Yacc-like parsers in C
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
Copyright (C) 1984, 1989-1990, 2000-2015, 2018-2021 Free Software Foundation,
|
|
|
|
Inc.
|
2020-07-30 07:59:19 +08:00
|
|
|
|
|
|
|
This program is free software: you can redistribute it and/or modify
|
|
|
|
it under the terms of the GNU General Public License as published by
|
|
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
|
|
(at your option) any later version.
|
|
|
|
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
GNU General Public License for more details.
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
2024-03-25 23:32:23 +08:00
|
|
|
along with this program. If not, see <https://www.gnu.org/licenses/>. */
|
2020-07-30 07:59:19 +08:00
|
|
|
|
|
|
|
/* As a special exception, you may create a larger work that contains
|
|
|
|
part or all of the Bison parser skeleton and distribute that work
|
|
|
|
under terms of your choice, so long as that work isn't itself a
|
|
|
|
parser generator using the skeleton or a modified version thereof
|
|
|
|
as a parser skeleton. Alternatively, if you modify or redistribute
|
|
|
|
the parser skeleton itself, you may (at your option) remove this
|
|
|
|
special exception, which will cause the skeleton and the resulting
|
|
|
|
Bison output files to be licensed under the GNU General Public
|
|
|
|
License without this special exception.
|
|
|
|
|
|
|
|
This special exception was added by the Free Software Foundation in
|
|
|
|
version 2.2 of Bison. */
|
|
|
|
|
|
|
|
/* C LALR(1) parser skeleton written by Richard Stallman, by
|
|
|
|
simplifying the original so-called "semantic" parser. */
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
/* DO NOT RELY ON FEATURES THAT ARE NOT DOCUMENTED in the manual,
|
|
|
|
especially those whose name start with YY_ or yy_. They are
|
|
|
|
private implementation details that can be changed or removed. */
|
|
|
|
|
2020-07-30 07:59:19 +08:00
|
|
|
/* All symbols defined below should begin with yy or YY, to avoid
|
|
|
|
infringing on user name space. This should be done even for local
|
|
|
|
variables, as they might otherwise be expanded by user macros.
|
|
|
|
There are some unavoidable exceptions within include files to
|
|
|
|
define necessary library symbols; they are noted "INFRINGES ON
|
|
|
|
USER NAME SPACE" below. */
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
/* Identify Bison output, and Bison version. */
|
|
|
|
#define YYBISON 30802
|
2020-07-30 07:59:19 +08:00
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
/* Bison version string. */
|
|
|
|
#define YYBISON_VERSION "3.8.2"
|
2020-07-30 07:59:19 +08:00
|
|
|
|
|
|
|
/* Skeleton name. */
|
|
|
|
#define YYSKELETON_NAME "yacc.c"
|
|
|
|
|
|
|
|
/* Pure parsers. */
|
|
|
|
#define YYPURE 0
|
|
|
|
|
|
|
|
/* Push parsers. */
|
|
|
|
#define YYPUSH 0
|
|
|
|
|
|
|
|
/* Pull parsers. */
|
|
|
|
#define YYPULL 1
|
|
|
|
|
|
|
|
|
|
|
|
/* Substitute the variable and function names. */
|
|
|
|
#define yyparse ncgparse
|
|
|
|
#define yylex ncglex
|
|
|
|
#define yyerror ncgerror
|
|
|
|
#define yydebug ncgdebug
|
|
|
|
#define yynerrs ncgnerrs
|
|
|
|
#define yylval ncglval
|
|
|
|
#define yychar ncgchar
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
/* First part of user prologue. */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 9 "ncgen.y"
|
2020-07-30 07:59:19 +08:00
|
|
|
|
|
|
|
#ifdef sccs
|
|
|
|
static char SccsId[] = "$Id: ncgen.y,v 1.34 2010/03/31 18:18:41 dmh Exp $";
|
|
|
|
#endif
|
|
|
|
#include "config.h"
|
|
|
|
#include <string.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <stdio.h>
|
|
|
|
#include "netcdf.h"
|
|
|
|
#include "generic.h"
|
|
|
|
#include "ncgen.h"
|
|
|
|
#include "genlib.h" /* for grow_darray() et al */
|
|
|
|
|
|
|
|
typedef struct Symbol { /* symbol table entry */
|
|
|
|
char *name;
|
|
|
|
struct Symbol *next;
|
|
|
|
unsigned is_dim : 1; /* appears as netCDF dimension */
|
|
|
|
unsigned is_var : 1; /* appears as netCDF variable */
|
|
|
|
unsigned is_att : 1; /* appears as netCDF attribute */
|
|
|
|
int dnum; /* handle as a dimension */
|
|
|
|
int vnum; /* handle as a variable */
|
|
|
|
} *YYSTYPE1;
|
|
|
|
|
|
|
|
/* True if string a equals string b*/
|
|
|
|
#ifndef STREQ
|
|
|
|
#define STREQ(a, b) (*(a) == *(b) && strcmp((a), (b)) == 0)
|
|
|
|
#endif
|
|
|
|
#define NC_UNSPECIFIED ((nc_type)0) /* unspecified (as yet) type */
|
|
|
|
|
|
|
|
#define YYSTYPE YYSTYPE1
|
|
|
|
YYSTYPE symlist; /* symbol table: linked list */
|
|
|
|
|
|
|
|
extern int derror_count; /* counts errors in netcdf definition */
|
|
|
|
extern int lineno; /* line number for error messages */
|
|
|
|
|
|
|
|
static int not_a_string; /* whether last constant read was a string */
|
|
|
|
static char termstring[MAXTRST]; /* last terminal string read */
|
|
|
|
static double double_val; /* last double value read */
|
|
|
|
static float float_val; /* last float value read */
|
|
|
|
static int int_val; /* last int value read */
|
|
|
|
static short short_val; /* last short value read */
|
|
|
|
static char char_val; /* last char value read */
|
|
|
|
static signed char byte_val; /* last byte value read */
|
|
|
|
|
|
|
|
static nc_type type_code; /* holds declared type for variables */
|
|
|
|
static nc_type atype_code; /* holds derived type for attributes */
|
|
|
|
static char *netcdfname; /* to construct netcdf file name */
|
|
|
|
static void *att_space; /* pointer to block for attribute values */
|
|
|
|
static nc_type valtype; /* type code for list of attribute values */
|
|
|
|
|
|
|
|
static char *char_valp; /* pointers used to accumulate data values */
|
|
|
|
static signed char *byte_valp;
|
|
|
|
static short *short_valp;
|
|
|
|
static int *int_valp;
|
|
|
|
static float *float_valp;
|
|
|
|
static double *double_valp;
|
|
|
|
static void *rec_cur; /* pointer to where next data value goes */
|
|
|
|
static void *rec_start; /* start of space for data */
|
|
|
|
|
|
|
|
/* Forward declarations */
|
2022-03-02 12:21:24 +08:00
|
|
|
void defatt(void);
|
|
|
|
void equalatt(void);
|
2020-07-30 07:59:19 +08:00
|
|
|
|
|
|
|
#ifdef YYLEX_PARAM
|
|
|
|
int yylex(YYLEX_PARAM);
|
|
|
|
#else
|
2022-03-02 12:21:24 +08:00
|
|
|
int yylex(void);
|
2020-07-30 07:59:19 +08:00
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifdef vms
|
|
|
|
void yyerror(char*);
|
|
|
|
#else
|
|
|
|
int yyerror(char*);
|
|
|
|
#endif
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
#line 154 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
# ifndef YY_CAST
|
|
|
|
# ifdef __cplusplus
|
|
|
|
# define YY_CAST(Type, Val) static_cast<Type> (Val)
|
|
|
|
# define YY_REINTERPRET_CAST(Type, Val) reinterpret_cast<Type> (Val)
|
|
|
|
# else
|
|
|
|
# define YY_CAST(Type, Val) ((Type) (Val))
|
|
|
|
# define YY_REINTERPRET_CAST(Type, Val) ((Type) (Val))
|
|
|
|
# endif
|
|
|
|
# endif
|
2020-07-30 07:59:19 +08:00
|
|
|
# ifndef YY_NULLPTR
|
2024-03-25 23:32:23 +08:00
|
|
|
# if defined __cplusplus
|
|
|
|
# if 201103L <= __cplusplus
|
|
|
|
# define YY_NULLPTR nullptr
|
|
|
|
# else
|
|
|
|
# define YY_NULLPTR 0
|
|
|
|
# endif
|
2020-07-30 07:59:19 +08:00
|
|
|
# else
|
2024-03-25 23:32:23 +08:00
|
|
|
# define YY_NULLPTR ((void*)0)
|
2020-07-30 07:59:19 +08:00
|
|
|
# endif
|
|
|
|
# endif
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
#include "ncgeny.h"
|
|
|
|
/* Symbol kind. */
|
|
|
|
enum yysymbol_kind_t
|
|
|
|
{
|
|
|
|
YYSYMBOL_YYEMPTY = -2,
|
|
|
|
YYSYMBOL_YYEOF = 0, /* "end of file" */
|
|
|
|
YYSYMBOL_YYerror = 1, /* error */
|
|
|
|
YYSYMBOL_YYUNDEF = 2, /* "invalid token" */
|
|
|
|
YYSYMBOL_NC_UNLIMITED_K = 3, /* NC_UNLIMITED_K */
|
|
|
|
YYSYMBOL_BYTE_K = 4, /* BYTE_K */
|
|
|
|
YYSYMBOL_CHAR_K = 5, /* CHAR_K */
|
|
|
|
YYSYMBOL_SHORT_K = 6, /* SHORT_K */
|
|
|
|
YYSYMBOL_INT_K = 7, /* INT_K */
|
|
|
|
YYSYMBOL_FLOAT_K = 8, /* FLOAT_K */
|
|
|
|
YYSYMBOL_DOUBLE_K = 9, /* DOUBLE_K */
|
|
|
|
YYSYMBOL_IDENT = 10, /* IDENT */
|
|
|
|
YYSYMBOL_TERMSTRING = 11, /* TERMSTRING */
|
|
|
|
YYSYMBOL_BYTE_CONST = 12, /* BYTE_CONST */
|
|
|
|
YYSYMBOL_CHAR_CONST = 13, /* CHAR_CONST */
|
|
|
|
YYSYMBOL_SHORT_CONST = 14, /* SHORT_CONST */
|
|
|
|
YYSYMBOL_INT_CONST = 15, /* INT_CONST */
|
|
|
|
YYSYMBOL_FLOAT_CONST = 16, /* FLOAT_CONST */
|
|
|
|
YYSYMBOL_DOUBLE_CONST = 17, /* DOUBLE_CONST */
|
|
|
|
YYSYMBOL_DIMENSIONS = 18, /* DIMENSIONS */
|
|
|
|
YYSYMBOL_VARIABLES = 19, /* VARIABLES */
|
|
|
|
YYSYMBOL_NETCDF = 20, /* NETCDF */
|
|
|
|
YYSYMBOL_DATA = 21, /* DATA */
|
|
|
|
YYSYMBOL_FILLVALUE = 22, /* FILLVALUE */
|
|
|
|
YYSYMBOL_23_ = 23, /* '{' */
|
|
|
|
YYSYMBOL_24_ = 24, /* '}' */
|
|
|
|
YYSYMBOL_25_ = 25, /* ';' */
|
|
|
|
YYSYMBOL_26_ = 26, /* ',' */
|
|
|
|
YYSYMBOL_27_ = 27, /* '=' */
|
|
|
|
YYSYMBOL_28_ = 28, /* '(' */
|
|
|
|
YYSYMBOL_29_ = 29, /* ')' */
|
|
|
|
YYSYMBOL_30_ = 30, /* ':' */
|
|
|
|
YYSYMBOL_YYACCEPT = 31, /* $accept */
|
|
|
|
YYSYMBOL_ncdesc = 32, /* ncdesc */
|
|
|
|
YYSYMBOL_33_1 = 33, /* $@1 */
|
|
|
|
YYSYMBOL_34_2 = 34, /* $@2 */
|
|
|
|
YYSYMBOL_dimsection = 35, /* dimsection */
|
|
|
|
YYSYMBOL_dimdecls = 36, /* dimdecls */
|
|
|
|
YYSYMBOL_dimdecline = 37, /* dimdecline */
|
|
|
|
YYSYMBOL_dimdecl = 38, /* dimdecl */
|
|
|
|
YYSYMBOL_dimd = 39, /* dimd */
|
|
|
|
YYSYMBOL_dim = 40, /* dim */
|
|
|
|
YYSYMBOL_vasection = 41, /* vasection */
|
|
|
|
YYSYMBOL_vadecls = 42, /* vadecls */
|
|
|
|
YYSYMBOL_vadecl = 43, /* vadecl */
|
|
|
|
YYSYMBOL_gattdecls = 44, /* gattdecls */
|
|
|
|
YYSYMBOL_vardecl = 45, /* vardecl */
|
|
|
|
YYSYMBOL_type = 46, /* type */
|
|
|
|
YYSYMBOL_varlist = 47, /* varlist */
|
|
|
|
YYSYMBOL_varspec = 48, /* varspec */
|
|
|
|
YYSYMBOL_49_3 = 49, /* $@3 */
|
|
|
|
YYSYMBOL_var = 50, /* var */
|
|
|
|
YYSYMBOL_dimspec = 51, /* dimspec */
|
|
|
|
YYSYMBOL_dimlist = 52, /* dimlist */
|
|
|
|
YYSYMBOL_vdim = 53, /* vdim */
|
|
|
|
YYSYMBOL_attdecl = 54, /* attdecl */
|
|
|
|
YYSYMBOL_55_4 = 55, /* $@4 */
|
|
|
|
YYSYMBOL_gattdecl = 56, /* gattdecl */
|
|
|
|
YYSYMBOL_57_5 = 57, /* $@5 */
|
|
|
|
YYSYMBOL_att = 58, /* att */
|
|
|
|
YYSYMBOL_gatt = 59, /* gatt */
|
|
|
|
YYSYMBOL_avar = 60, /* avar */
|
|
|
|
YYSYMBOL_attr = 61, /* attr */
|
|
|
|
YYSYMBOL_attvallist = 62, /* attvallist */
|
|
|
|
YYSYMBOL_aconst = 63, /* aconst */
|
|
|
|
YYSYMBOL_attconst = 64, /* attconst */
|
|
|
|
YYSYMBOL_datasection = 65, /* datasection */
|
|
|
|
YYSYMBOL_datadecls = 66, /* datadecls */
|
|
|
|
YYSYMBOL_datadecl = 67, /* datadecl */
|
|
|
|
YYSYMBOL_68_6 = 68, /* $@6 */
|
|
|
|
YYSYMBOL_constlist = 69, /* constlist */
|
|
|
|
YYSYMBOL_dconst = 70, /* dconst */
|
|
|
|
YYSYMBOL_71_7 = 71, /* $@7 */
|
|
|
|
YYSYMBOL_const = 72 /* const */
|
|
|
|
};
|
|
|
|
typedef enum yysymbol_kind_t yysymbol_kind_t;
|
2020-07-30 07:59:19 +08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
#ifdef short
|
|
|
|
# undef short
|
|
|
|
#endif
|
2020-07-30 07:59:19 +08:00
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
/* On compilers that do not define __PTRDIFF_MAX__ etc., make sure
|
|
|
|
<limits.h> and (if available) <stdint.h> are included
|
|
|
|
so that the code can choose integer types of a good width. */
|
2020-07-30 07:59:19 +08:00
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
#ifndef __PTRDIFF_MAX__
|
|
|
|
# include <limits.h> /* INFRINGES ON USER NAME SPACE */
|
|
|
|
# if defined __STDC_VERSION__ && 199901 <= __STDC_VERSION__
|
|
|
|
# include <stdint.h> /* INFRINGES ON USER NAME SPACE */
|
|
|
|
# define YY_STDINT_H
|
|
|
|
# endif
|
|
|
|
#endif
|
2020-07-30 07:59:19 +08:00
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
/* Narrow types that promote to a signed type and that can represent a
|
|
|
|
signed or unsigned integer of at least N bits. In tables they can
|
|
|
|
save space and decrease cache pressure. Promoting to a signed type
|
|
|
|
helps avoid bugs in integer arithmetic. */
|
Fix various problem around VLEN's
re: https://github.com/Unidata/netcdf-c/issues/541
re: https://github.com/Unidata/netcdf-c/issues/1208
re: https://github.com/Unidata/netcdf-c/issues/2078
re: https://github.com/Unidata/netcdf-c/issues/2041
re: https://github.com/Unidata/netcdf-c/issues/2143
For a long time, there have been known problems with the
management of complex types containing VLENs. This also
involves the string type because it is stored as a VLEN of
chars.
This PR (mostly) fixes this problem. But note that it adds new
functions to netcdf.h (see below) and this may require bumping
the .so number. These new functions can be removed, if desired,
in favor of functions in netcdf_aux.h, but netcdf.h seems the
better place for them because they are intended as alternatives
to the nc_free_vlen and nc_free_string functions already in
netcdf.h.
The term complex type refers to any type that directly or
transitively references a VLEN type. So an array of VLENS, a
compound with a VLEN field, and so on.
In order to properly handle instances of these complex types, it
is necessary to have function that can recursively walk
instances of such types to perform various actions on them. The
term "deep" is also used to mean recursive.
At the moment, the two operations needed by the netcdf library are:
* free'ing an instance of the complex type
* copying an instance of the complex type.
The current library does only shallow free and shallow copy of
complex types. This means that only the top level is properly
free'd or copied, but deep internal blocks in the instance are
not touched.
Note that the term "vector" will be used to mean a contiguous (in
memory) sequence of instances of some type. Given an array with,
say, dimensions 2 X 3 X 4, this will be stored in memory as a
vector of length 2*3*4=24 instances.
The use cases are primarily these.
## nc_get_vars
Suppose one is reading a vector of instances using nc_get_vars
(or nc_get_vara or nc_get_var, etc.). These functions will
return the vector in the top-level memory provided. All
interior blocks (form nested VLEN or strings) will have been
dynamically allocated.
After using this vector of instances, it is necessary to free
(aka reclaim) the dynamically allocated memory, otherwise a
memory leak occurs. So, the recursive reclaim function is used
to walk the returned instance vector and do a deep reclaim of
the data.
Currently functions are defined in netcdf.h that are supposed to
handle this: nc_free_vlen(), nc_free_vlens(), and
nc_free_string(). Unfortunately, these functions only do a
shallow free, so deeply nested instances are not properly
handled by them.
Note that internally, the provided data is immediately written so
there is no need to copy it. But the caller may need to reclaim the
data it passed into the function.
## nc_put_att
Suppose one is writing a vector of instances as the data of an attribute
using, say, nc_put_att.
Internally, the incoming attribute data must be copied and stored
so that changes/reclamation of the input data will not affect
the attribute.
Again, the code inside the netcdf library does only shallow copying
rather than deep copy. As a result, one sees effects such as described
in Github Issue https://github.com/Unidata/netcdf-c/issues/2143.
Also, after defining the attribute, it may be necessary for the user
to free the data that was provided as input to nc_put_att().
## nc_get_att
Suppose one is reading a vector of instances as the data of an attribute
using, say, nc_get_att.
Internally, the existing attribute data must be copied and returned
to the caller, and the caller is responsible for reclaiming
the returned data.
Again, the code inside the netcdf library does only shallow copying
rather than deep copy. So this can lead to memory leaks and errors
because the deep data is shared between the library and the user.
# Solution
The solution is to build properly recursive reclaim and copy
functions and use those as needed.
These recursive functions are defined in libdispatch/dinstance.c
and their signatures are defined in include/netcdf.h.
For back compatibility, corresponding "ncaux_XXX" functions
are defined in include/netcdf_aux.h.
````
int nc_reclaim_data(int ncid, nc_type xtypeid, void* memory, size_t count);
int nc_reclaim_data_all(int ncid, nc_type xtypeid, void* memory, size_t count);
int nc_copy_data(int ncid, nc_type xtypeid, const void* memory, size_t count, void* copy);
int nc_copy_data_all(int ncid, nc_type xtypeid, const void* memory, size_t count, void** copyp);
````
There are two variants. The first two, nc_reclaim_data() and
nc_copy_data(), assume the top-level vector is managed by the
caller. For reclaim, this is so the user can use, for example, a
statically allocated vector. For copy, it assumes the user
provides the space into which the copy is stored.
The second two, nc_reclaim_data_all() and
nc_copy_data_all(), allows the functions to manage the
top-level. So for nc_reclaim_data_all, the top level is
assumed to be dynamically allocated and will be free'd by
nc_reclaim_data_all(). The nc_copy_data_all() function
will allocate the top level and return a pointer to it to the
user. The user can later pass that pointer to
nc_reclaim_data_all() to reclaim the instance(s).
# Internal Changes
The netcdf-c library internals are changed to use the proper
reclaim and copy functions. It turns out that the places where
these functions are needed is quite pervasive in the netcdf-c
library code. Using these functions also allows some
simplification of the code since the stdata and vldata fields of
NC_ATT_INFO are no longer needed. Currently this is commented
out using the SEPDATA \#define macro. When any bugs are largely
fixed, all this code will be removed.
# Known Bugs
1. There is still one known failure that has not been solved.
All the failures revolve around some variant of this .cdl file.
The proximate cause of failure is the use of a VLEN FillValue.
````
netcdf x {
types:
float(*) row_of_floats ;
dimensions:
m = 5 ;
variables:
row_of_floats ragged_array(m) ;
row_of_floats ragged_array:_FillValue = {-999} ;
data:
ragged_array = {10, 11, 12, 13, 14}, {20, 21, 22, 23}, {30, 31, 32},
{40, 41}, _ ;
}
````
When a solution is found, I will either add it to this PR or post a new PR.
# Related Changes
* Mark nc_free_vlen(s) as deprecated in favor of ncaux_reclaim_data.
* Remove the --enable-unfixed-memory-leaks option.
* Remove the NC_VLENS_NOTEST code that suppresses some vlen tests.
* Document this change in docs/internal.md
* Disable the tst_vlen_data test in ncdump/tst_nccopy4.sh.
* Mark types as fixed size or not (transitively) to optimize the reclaim
and copy functions.
# Misc. Changes
* Make Doxygen process libdispatch/daux.c
* Make sure the NC_ATT_INFO_T.container field is set.
2022-01-09 09:30:00 +08:00
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
#ifdef __INT_LEAST8_MAX__
|
|
|
|
typedef __INT_LEAST8_TYPE__ yytype_int8;
|
|
|
|
#elif defined YY_STDINT_H
|
|
|
|
typedef int_least8_t yytype_int8;
|
|
|
|
#else
|
|
|
|
typedef signed char yytype_int8;
|
2020-07-30 07:59:19 +08:00
|
|
|
#endif
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
#ifdef __INT_LEAST16_MAX__
|
|
|
|
typedef __INT_LEAST16_TYPE__ yytype_int16;
|
|
|
|
#elif defined YY_STDINT_H
|
|
|
|
typedef int_least16_t yytype_int16;
|
Fix various problem around VLEN's
re: https://github.com/Unidata/netcdf-c/issues/541
re: https://github.com/Unidata/netcdf-c/issues/1208
re: https://github.com/Unidata/netcdf-c/issues/2078
re: https://github.com/Unidata/netcdf-c/issues/2041
re: https://github.com/Unidata/netcdf-c/issues/2143
For a long time, there have been known problems with the
management of complex types containing VLENs. This also
involves the string type because it is stored as a VLEN of
chars.
This PR (mostly) fixes this problem. But note that it adds new
functions to netcdf.h (see below) and this may require bumping
the .so number. These new functions can be removed, if desired,
in favor of functions in netcdf_aux.h, but netcdf.h seems the
better place for them because they are intended as alternatives
to the nc_free_vlen and nc_free_string functions already in
netcdf.h.
The term complex type refers to any type that directly or
transitively references a VLEN type. So an array of VLENS, a
compound with a VLEN field, and so on.
In order to properly handle instances of these complex types, it
is necessary to have function that can recursively walk
instances of such types to perform various actions on them. The
term "deep" is also used to mean recursive.
At the moment, the two operations needed by the netcdf library are:
* free'ing an instance of the complex type
* copying an instance of the complex type.
The current library does only shallow free and shallow copy of
complex types. This means that only the top level is properly
free'd or copied, but deep internal blocks in the instance are
not touched.
Note that the term "vector" will be used to mean a contiguous (in
memory) sequence of instances of some type. Given an array with,
say, dimensions 2 X 3 X 4, this will be stored in memory as a
vector of length 2*3*4=24 instances.
The use cases are primarily these.
## nc_get_vars
Suppose one is reading a vector of instances using nc_get_vars
(or nc_get_vara or nc_get_var, etc.). These functions will
return the vector in the top-level memory provided. All
interior blocks (form nested VLEN or strings) will have been
dynamically allocated.
After using this vector of instances, it is necessary to free
(aka reclaim) the dynamically allocated memory, otherwise a
memory leak occurs. So, the recursive reclaim function is used
to walk the returned instance vector and do a deep reclaim of
the data.
Currently functions are defined in netcdf.h that are supposed to
handle this: nc_free_vlen(), nc_free_vlens(), and
nc_free_string(). Unfortunately, these functions only do a
shallow free, so deeply nested instances are not properly
handled by them.
Note that internally, the provided data is immediately written so
there is no need to copy it. But the caller may need to reclaim the
data it passed into the function.
## nc_put_att
Suppose one is writing a vector of instances as the data of an attribute
using, say, nc_put_att.
Internally, the incoming attribute data must be copied and stored
so that changes/reclamation of the input data will not affect
the attribute.
Again, the code inside the netcdf library does only shallow copying
rather than deep copy. As a result, one sees effects such as described
in Github Issue https://github.com/Unidata/netcdf-c/issues/2143.
Also, after defining the attribute, it may be necessary for the user
to free the data that was provided as input to nc_put_att().
## nc_get_att
Suppose one is reading a vector of instances as the data of an attribute
using, say, nc_get_att.
Internally, the existing attribute data must be copied and returned
to the caller, and the caller is responsible for reclaiming
the returned data.
Again, the code inside the netcdf library does only shallow copying
rather than deep copy. So this can lead to memory leaks and errors
because the deep data is shared between the library and the user.
# Solution
The solution is to build properly recursive reclaim and copy
functions and use those as needed.
These recursive functions are defined in libdispatch/dinstance.c
and their signatures are defined in include/netcdf.h.
For back compatibility, corresponding "ncaux_XXX" functions
are defined in include/netcdf_aux.h.
````
int nc_reclaim_data(int ncid, nc_type xtypeid, void* memory, size_t count);
int nc_reclaim_data_all(int ncid, nc_type xtypeid, void* memory, size_t count);
int nc_copy_data(int ncid, nc_type xtypeid, const void* memory, size_t count, void* copy);
int nc_copy_data_all(int ncid, nc_type xtypeid, const void* memory, size_t count, void** copyp);
````
There are two variants. The first two, nc_reclaim_data() and
nc_copy_data(), assume the top-level vector is managed by the
caller. For reclaim, this is so the user can use, for example, a
statically allocated vector. For copy, it assumes the user
provides the space into which the copy is stored.
The second two, nc_reclaim_data_all() and
nc_copy_data_all(), allows the functions to manage the
top-level. So for nc_reclaim_data_all, the top level is
assumed to be dynamically allocated and will be free'd by
nc_reclaim_data_all(). The nc_copy_data_all() function
will allocate the top level and return a pointer to it to the
user. The user can later pass that pointer to
nc_reclaim_data_all() to reclaim the instance(s).
# Internal Changes
The netcdf-c library internals are changed to use the proper
reclaim and copy functions. It turns out that the places where
these functions are needed is quite pervasive in the netcdf-c
library code. Using these functions also allows some
simplification of the code since the stdata and vldata fields of
NC_ATT_INFO are no longer needed. Currently this is commented
out using the SEPDATA \#define macro. When any bugs are largely
fixed, all this code will be removed.
# Known Bugs
1. There is still one known failure that has not been solved.
All the failures revolve around some variant of this .cdl file.
The proximate cause of failure is the use of a VLEN FillValue.
````
netcdf x {
types:
float(*) row_of_floats ;
dimensions:
m = 5 ;
variables:
row_of_floats ragged_array(m) ;
row_of_floats ragged_array:_FillValue = {-999} ;
data:
ragged_array = {10, 11, 12, 13, 14}, {20, 21, 22, 23}, {30, 31, 32},
{40, 41}, _ ;
}
````
When a solution is found, I will either add it to this PR or post a new PR.
# Related Changes
* Mark nc_free_vlen(s) as deprecated in favor of ncaux_reclaim_data.
* Remove the --enable-unfixed-memory-leaks option.
* Remove the NC_VLENS_NOTEST code that suppresses some vlen tests.
* Document this change in docs/internal.md
* Disable the tst_vlen_data test in ncdump/tst_nccopy4.sh.
* Mark types as fixed size or not (transitively) to optimize the reclaim
and copy functions.
# Misc. Changes
* Make Doxygen process libdispatch/daux.c
* Make sure the NC_ATT_INFO_T.container field is set.
2022-01-09 09:30:00 +08:00
|
|
|
#else
|
2024-03-25 23:32:23 +08:00
|
|
|
typedef short yytype_int16;
|
Fix various problem around VLEN's
re: https://github.com/Unidata/netcdf-c/issues/541
re: https://github.com/Unidata/netcdf-c/issues/1208
re: https://github.com/Unidata/netcdf-c/issues/2078
re: https://github.com/Unidata/netcdf-c/issues/2041
re: https://github.com/Unidata/netcdf-c/issues/2143
For a long time, there have been known problems with the
management of complex types containing VLENs. This also
involves the string type because it is stored as a VLEN of
chars.
This PR (mostly) fixes this problem. But note that it adds new
functions to netcdf.h (see below) and this may require bumping
the .so number. These new functions can be removed, if desired,
in favor of functions in netcdf_aux.h, but netcdf.h seems the
better place for them because they are intended as alternatives
to the nc_free_vlen and nc_free_string functions already in
netcdf.h.
The term complex type refers to any type that directly or
transitively references a VLEN type. So an array of VLENS, a
compound with a VLEN field, and so on.
In order to properly handle instances of these complex types, it
is necessary to have function that can recursively walk
instances of such types to perform various actions on them. The
term "deep" is also used to mean recursive.
At the moment, the two operations needed by the netcdf library are:
* free'ing an instance of the complex type
* copying an instance of the complex type.
The current library does only shallow free and shallow copy of
complex types. This means that only the top level is properly
free'd or copied, but deep internal blocks in the instance are
not touched.
Note that the term "vector" will be used to mean a contiguous (in
memory) sequence of instances of some type. Given an array with,
say, dimensions 2 X 3 X 4, this will be stored in memory as a
vector of length 2*3*4=24 instances.
The use cases are primarily these.
## nc_get_vars
Suppose one is reading a vector of instances using nc_get_vars
(or nc_get_vara or nc_get_var, etc.). These functions will
return the vector in the top-level memory provided. All
interior blocks (form nested VLEN or strings) will have been
dynamically allocated.
After using this vector of instances, it is necessary to free
(aka reclaim) the dynamically allocated memory, otherwise a
memory leak occurs. So, the recursive reclaim function is used
to walk the returned instance vector and do a deep reclaim of
the data.
Currently functions are defined in netcdf.h that are supposed to
handle this: nc_free_vlen(), nc_free_vlens(), and
nc_free_string(). Unfortunately, these functions only do a
shallow free, so deeply nested instances are not properly
handled by them.
Note that internally, the provided data is immediately written so
there is no need to copy it. But the caller may need to reclaim the
data it passed into the function.
## nc_put_att
Suppose one is writing a vector of instances as the data of an attribute
using, say, nc_put_att.
Internally, the incoming attribute data must be copied and stored
so that changes/reclamation of the input data will not affect
the attribute.
Again, the code inside the netcdf library does only shallow copying
rather than deep copy. As a result, one sees effects such as described
in Github Issue https://github.com/Unidata/netcdf-c/issues/2143.
Also, after defining the attribute, it may be necessary for the user
to free the data that was provided as input to nc_put_att().
## nc_get_att
Suppose one is reading a vector of instances as the data of an attribute
using, say, nc_get_att.
Internally, the existing attribute data must be copied and returned
to the caller, and the caller is responsible for reclaiming
the returned data.
Again, the code inside the netcdf library does only shallow copying
rather than deep copy. So this can lead to memory leaks and errors
because the deep data is shared between the library and the user.
# Solution
The solution is to build properly recursive reclaim and copy
functions and use those as needed.
These recursive functions are defined in libdispatch/dinstance.c
and their signatures are defined in include/netcdf.h.
For back compatibility, corresponding "ncaux_XXX" functions
are defined in include/netcdf_aux.h.
````
int nc_reclaim_data(int ncid, nc_type xtypeid, void* memory, size_t count);
int nc_reclaim_data_all(int ncid, nc_type xtypeid, void* memory, size_t count);
int nc_copy_data(int ncid, nc_type xtypeid, const void* memory, size_t count, void* copy);
int nc_copy_data_all(int ncid, nc_type xtypeid, const void* memory, size_t count, void** copyp);
````
There are two variants. The first two, nc_reclaim_data() and
nc_copy_data(), assume the top-level vector is managed by the
caller. For reclaim, this is so the user can use, for example, a
statically allocated vector. For copy, it assumes the user
provides the space into which the copy is stored.
The second two, nc_reclaim_data_all() and
nc_copy_data_all(), allows the functions to manage the
top-level. So for nc_reclaim_data_all, the top level is
assumed to be dynamically allocated and will be free'd by
nc_reclaim_data_all(). The nc_copy_data_all() function
will allocate the top level and return a pointer to it to the
user. The user can later pass that pointer to
nc_reclaim_data_all() to reclaim the instance(s).
# Internal Changes
The netcdf-c library internals are changed to use the proper
reclaim and copy functions. It turns out that the places where
these functions are needed is quite pervasive in the netcdf-c
library code. Using these functions also allows some
simplification of the code since the stdata and vldata fields of
NC_ATT_INFO are no longer needed. Currently this is commented
out using the SEPDATA \#define macro. When any bugs are largely
fixed, all this code will be removed.
# Known Bugs
1. There is still one known failure that has not been solved.
All the failures revolve around some variant of this .cdl file.
The proximate cause of failure is the use of a VLEN FillValue.
````
netcdf x {
types:
float(*) row_of_floats ;
dimensions:
m = 5 ;
variables:
row_of_floats ragged_array(m) ;
row_of_floats ragged_array:_FillValue = {-999} ;
data:
ragged_array = {10, 11, 12, 13, 14}, {20, 21, 22, 23}, {30, 31, 32},
{40, 41}, _ ;
}
````
When a solution is found, I will either add it to this PR or post a new PR.
# Related Changes
* Mark nc_free_vlen(s) as deprecated in favor of ncaux_reclaim_data.
* Remove the --enable-unfixed-memory-leaks option.
* Remove the NC_VLENS_NOTEST code that suppresses some vlen tests.
* Document this change in docs/internal.md
* Disable the tst_vlen_data test in ncdump/tst_nccopy4.sh.
* Mark types as fixed size or not (transitively) to optimize the reclaim
and copy functions.
# Misc. Changes
* Make Doxygen process libdispatch/daux.c
* Make sure the NC_ATT_INFO_T.container field is set.
2022-01-09 09:30:00 +08:00
|
|
|
#endif
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
/* Work around bug in HP-UX 11.23, which defines these macros
|
|
|
|
incorrectly for preprocessor constants. This workaround can likely
|
|
|
|
be removed in 2023, as HPE has promised support for HP-UX 11.23
|
|
|
|
(aka HP-UX 11i v2) only through the end of 2022; see Table 2 of
|
|
|
|
<https://h20195.www2.hpe.com/V2/getpdf.aspx/4AA4-7673ENW.pdf>. */
|
|
|
|
#ifdef __hpux
|
|
|
|
# undef UINT_LEAST8_MAX
|
|
|
|
# undef UINT_LEAST16_MAX
|
|
|
|
# define UINT_LEAST8_MAX 255
|
|
|
|
# define UINT_LEAST16_MAX 65535
|
2020-07-30 07:59:19 +08:00
|
|
|
#endif
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
#if defined __UINT_LEAST8_MAX__ && __UINT_LEAST8_MAX__ <= __INT_MAX__
|
|
|
|
typedef __UINT_LEAST8_TYPE__ yytype_uint8;
|
|
|
|
#elif (!defined __UINT_LEAST8_MAX__ && defined YY_STDINT_H \
|
|
|
|
&& UINT_LEAST8_MAX <= INT_MAX)
|
|
|
|
typedef uint_least8_t yytype_uint8;
|
|
|
|
#elif !defined __UINT_LEAST8_MAX__ && UCHAR_MAX <= INT_MAX
|
|
|
|
typedef unsigned char yytype_uint8;
|
2020-07-30 07:59:19 +08:00
|
|
|
#else
|
2024-03-25 23:32:23 +08:00
|
|
|
typedef short yytype_uint8;
|
2021-09-03 07:04:26 +08:00
|
|
|
#endif
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
#if defined __UINT_LEAST16_MAX__ && __UINT_LEAST16_MAX__ <= __INT_MAX__
|
|
|
|
typedef __UINT_LEAST16_TYPE__ yytype_uint16;
|
|
|
|
#elif (!defined __UINT_LEAST16_MAX__ && defined YY_STDINT_H \
|
|
|
|
&& UINT_LEAST16_MAX <= INT_MAX)
|
|
|
|
typedef uint_least16_t yytype_uint16;
|
|
|
|
#elif !defined __UINT_LEAST16_MAX__ && USHRT_MAX <= INT_MAX
|
|
|
|
typedef unsigned short yytype_uint16;
|
Fix various problem around VLEN's
re: https://github.com/Unidata/netcdf-c/issues/541
re: https://github.com/Unidata/netcdf-c/issues/1208
re: https://github.com/Unidata/netcdf-c/issues/2078
re: https://github.com/Unidata/netcdf-c/issues/2041
re: https://github.com/Unidata/netcdf-c/issues/2143
For a long time, there have been known problems with the
management of complex types containing VLENs. This also
involves the string type because it is stored as a VLEN of
chars.
This PR (mostly) fixes this problem. But note that it adds new
functions to netcdf.h (see below) and this may require bumping
the .so number. These new functions can be removed, if desired,
in favor of functions in netcdf_aux.h, but netcdf.h seems the
better place for them because they are intended as alternatives
to the nc_free_vlen and nc_free_string functions already in
netcdf.h.
The term complex type refers to any type that directly or
transitively references a VLEN type. So an array of VLENS, a
compound with a VLEN field, and so on.
In order to properly handle instances of these complex types, it
is necessary to have function that can recursively walk
instances of such types to perform various actions on them. The
term "deep" is also used to mean recursive.
At the moment, the two operations needed by the netcdf library are:
* free'ing an instance of the complex type
* copying an instance of the complex type.
The current library does only shallow free and shallow copy of
complex types. This means that only the top level is properly
free'd or copied, but deep internal blocks in the instance are
not touched.
Note that the term "vector" will be used to mean a contiguous (in
memory) sequence of instances of some type. Given an array with,
say, dimensions 2 X 3 X 4, this will be stored in memory as a
vector of length 2*3*4=24 instances.
The use cases are primarily these.
## nc_get_vars
Suppose one is reading a vector of instances using nc_get_vars
(or nc_get_vara or nc_get_var, etc.). These functions will
return the vector in the top-level memory provided. All
interior blocks (form nested VLEN or strings) will have been
dynamically allocated.
After using this vector of instances, it is necessary to free
(aka reclaim) the dynamically allocated memory, otherwise a
memory leak occurs. So, the recursive reclaim function is used
to walk the returned instance vector and do a deep reclaim of
the data.
Currently functions are defined in netcdf.h that are supposed to
handle this: nc_free_vlen(), nc_free_vlens(), and
nc_free_string(). Unfortunately, these functions only do a
shallow free, so deeply nested instances are not properly
handled by them.
Note that internally, the provided data is immediately written so
there is no need to copy it. But the caller may need to reclaim the
data it passed into the function.
## nc_put_att
Suppose one is writing a vector of instances as the data of an attribute
using, say, nc_put_att.
Internally, the incoming attribute data must be copied and stored
so that changes/reclamation of the input data will not affect
the attribute.
Again, the code inside the netcdf library does only shallow copying
rather than deep copy. As a result, one sees effects such as described
in Github Issue https://github.com/Unidata/netcdf-c/issues/2143.
Also, after defining the attribute, it may be necessary for the user
to free the data that was provided as input to nc_put_att().
## nc_get_att
Suppose one is reading a vector of instances as the data of an attribute
using, say, nc_get_att.
Internally, the existing attribute data must be copied and returned
to the caller, and the caller is responsible for reclaiming
the returned data.
Again, the code inside the netcdf library does only shallow copying
rather than deep copy. So this can lead to memory leaks and errors
because the deep data is shared between the library and the user.
# Solution
The solution is to build properly recursive reclaim and copy
functions and use those as needed.
These recursive functions are defined in libdispatch/dinstance.c
and their signatures are defined in include/netcdf.h.
For back compatibility, corresponding "ncaux_XXX" functions
are defined in include/netcdf_aux.h.
````
int nc_reclaim_data(int ncid, nc_type xtypeid, void* memory, size_t count);
int nc_reclaim_data_all(int ncid, nc_type xtypeid, void* memory, size_t count);
int nc_copy_data(int ncid, nc_type xtypeid, const void* memory, size_t count, void* copy);
int nc_copy_data_all(int ncid, nc_type xtypeid, const void* memory, size_t count, void** copyp);
````
There are two variants. The first two, nc_reclaim_data() and
nc_copy_data(), assume the top-level vector is managed by the
caller. For reclaim, this is so the user can use, for example, a
statically allocated vector. For copy, it assumes the user
provides the space into which the copy is stored.
The second two, nc_reclaim_data_all() and
nc_copy_data_all(), allows the functions to manage the
top-level. So for nc_reclaim_data_all, the top level is
assumed to be dynamically allocated and will be free'd by
nc_reclaim_data_all(). The nc_copy_data_all() function
will allocate the top level and return a pointer to it to the
user. The user can later pass that pointer to
nc_reclaim_data_all() to reclaim the instance(s).
# Internal Changes
The netcdf-c library internals are changed to use the proper
reclaim and copy functions. It turns out that the places where
these functions are needed is quite pervasive in the netcdf-c
library code. Using these functions also allows some
simplification of the code since the stdata and vldata fields of
NC_ATT_INFO are no longer needed. Currently this is commented
out using the SEPDATA \#define macro. When any bugs are largely
fixed, all this code will be removed.
# Known Bugs
1. There is still one known failure that has not been solved.
All the failures revolve around some variant of this .cdl file.
The proximate cause of failure is the use of a VLEN FillValue.
````
netcdf x {
types:
float(*) row_of_floats ;
dimensions:
m = 5 ;
variables:
row_of_floats ragged_array(m) ;
row_of_floats ragged_array:_FillValue = {-999} ;
data:
ragged_array = {10, 11, 12, 13, 14}, {20, 21, 22, 23}, {30, 31, 32},
{40, 41}, _ ;
}
````
When a solution is found, I will either add it to this PR or post a new PR.
# Related Changes
* Mark nc_free_vlen(s) as deprecated in favor of ncaux_reclaim_data.
* Remove the --enable-unfixed-memory-leaks option.
* Remove the NC_VLENS_NOTEST code that suppresses some vlen tests.
* Document this change in docs/internal.md
* Disable the tst_vlen_data test in ncdump/tst_nccopy4.sh.
* Mark types as fixed size or not (transitively) to optimize the reclaim
and copy functions.
# Misc. Changes
* Make Doxygen process libdispatch/daux.c
* Make sure the NC_ATT_INFO_T.container field is set.
2022-01-09 09:30:00 +08:00
|
|
|
#else
|
2024-03-25 23:32:23 +08:00
|
|
|
typedef int yytype_uint16;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifndef YYPTRDIFF_T
|
|
|
|
# if defined __PTRDIFF_TYPE__ && defined __PTRDIFF_MAX__
|
|
|
|
# define YYPTRDIFF_T __PTRDIFF_TYPE__
|
|
|
|
# define YYPTRDIFF_MAXIMUM __PTRDIFF_MAX__
|
|
|
|
# elif defined PTRDIFF_MAX
|
|
|
|
# ifndef ptrdiff_t
|
|
|
|
# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
|
|
|
|
# endif
|
|
|
|
# define YYPTRDIFF_T ptrdiff_t
|
|
|
|
# define YYPTRDIFF_MAXIMUM PTRDIFF_MAX
|
|
|
|
# else
|
|
|
|
# define YYPTRDIFF_T long
|
|
|
|
# define YYPTRDIFF_MAXIMUM LONG_MAX
|
|
|
|
# endif
|
2020-07-30 07:59:19 +08:00
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifndef YYSIZE_T
|
|
|
|
# ifdef __SIZE_TYPE__
|
|
|
|
# define YYSIZE_T __SIZE_TYPE__
|
|
|
|
# elif defined size_t
|
|
|
|
# define YYSIZE_T size_t
|
2024-03-25 23:32:23 +08:00
|
|
|
# elif defined __STDC_VERSION__ && 199901 <= __STDC_VERSION__
|
2020-07-30 07:59:19 +08:00
|
|
|
# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
|
|
|
|
# define YYSIZE_T size_t
|
|
|
|
# else
|
2024-03-25 23:32:23 +08:00
|
|
|
# define YYSIZE_T unsigned
|
2020-07-30 07:59:19 +08:00
|
|
|
# endif
|
|
|
|
#endif
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
#define YYSIZE_MAXIMUM \
|
|
|
|
YY_CAST (YYPTRDIFF_T, \
|
|
|
|
(YYPTRDIFF_MAXIMUM < YY_CAST (YYSIZE_T, -1) \
|
|
|
|
? YYPTRDIFF_MAXIMUM \
|
|
|
|
: YY_CAST (YYSIZE_T, -1)))
|
|
|
|
|
|
|
|
#define YYSIZEOF(X) YY_CAST (YYPTRDIFF_T, sizeof (X))
|
|
|
|
|
|
|
|
|
|
|
|
/* Stored state numbers (used for stacks). */
|
|
|
|
typedef yytype_int8 yy_state_t;
|
|
|
|
|
|
|
|
/* State numbers in computations. */
|
|
|
|
typedef int yy_state_fast_t;
|
2020-07-30 07:59:19 +08:00
|
|
|
|
|
|
|
#ifndef YY_
|
|
|
|
# if defined YYENABLE_NLS && YYENABLE_NLS
|
|
|
|
# if ENABLE_NLS
|
|
|
|
# include <libintl.h> /* INFRINGES ON USER NAME SPACE */
|
|
|
|
# define YY_(Msgid) dgettext ("bison-runtime", Msgid)
|
|
|
|
# endif
|
|
|
|
# endif
|
|
|
|
# ifndef YY_
|
|
|
|
# define YY_(Msgid) Msgid
|
|
|
|
# endif
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
Fix various problem around VLEN's
re: https://github.com/Unidata/netcdf-c/issues/541
re: https://github.com/Unidata/netcdf-c/issues/1208
re: https://github.com/Unidata/netcdf-c/issues/2078
re: https://github.com/Unidata/netcdf-c/issues/2041
re: https://github.com/Unidata/netcdf-c/issues/2143
For a long time, there have been known problems with the
management of complex types containing VLENs. This also
involves the string type because it is stored as a VLEN of
chars.
This PR (mostly) fixes this problem. But note that it adds new
functions to netcdf.h (see below) and this may require bumping
the .so number. These new functions can be removed, if desired,
in favor of functions in netcdf_aux.h, but netcdf.h seems the
better place for them because they are intended as alternatives
to the nc_free_vlen and nc_free_string functions already in
netcdf.h.
The term complex type refers to any type that directly or
transitively references a VLEN type. So an array of VLENS, a
compound with a VLEN field, and so on.
In order to properly handle instances of these complex types, it
is necessary to have function that can recursively walk
instances of such types to perform various actions on them. The
term "deep" is also used to mean recursive.
At the moment, the two operations needed by the netcdf library are:
* free'ing an instance of the complex type
* copying an instance of the complex type.
The current library does only shallow free and shallow copy of
complex types. This means that only the top level is properly
free'd or copied, but deep internal blocks in the instance are
not touched.
Note that the term "vector" will be used to mean a contiguous (in
memory) sequence of instances of some type. Given an array with,
say, dimensions 2 X 3 X 4, this will be stored in memory as a
vector of length 2*3*4=24 instances.
The use cases are primarily these.
## nc_get_vars
Suppose one is reading a vector of instances using nc_get_vars
(or nc_get_vara or nc_get_var, etc.). These functions will
return the vector in the top-level memory provided. All
interior blocks (form nested VLEN or strings) will have been
dynamically allocated.
After using this vector of instances, it is necessary to free
(aka reclaim) the dynamically allocated memory, otherwise a
memory leak occurs. So, the recursive reclaim function is used
to walk the returned instance vector and do a deep reclaim of
the data.
Currently functions are defined in netcdf.h that are supposed to
handle this: nc_free_vlen(), nc_free_vlens(), and
nc_free_string(). Unfortunately, these functions only do a
shallow free, so deeply nested instances are not properly
handled by them.
Note that internally, the provided data is immediately written so
there is no need to copy it. But the caller may need to reclaim the
data it passed into the function.
## nc_put_att
Suppose one is writing a vector of instances as the data of an attribute
using, say, nc_put_att.
Internally, the incoming attribute data must be copied and stored
so that changes/reclamation of the input data will not affect
the attribute.
Again, the code inside the netcdf library does only shallow copying
rather than deep copy. As a result, one sees effects such as described
in Github Issue https://github.com/Unidata/netcdf-c/issues/2143.
Also, after defining the attribute, it may be necessary for the user
to free the data that was provided as input to nc_put_att().
## nc_get_att
Suppose one is reading a vector of instances as the data of an attribute
using, say, nc_get_att.
Internally, the existing attribute data must be copied and returned
to the caller, and the caller is responsible for reclaiming
the returned data.
Again, the code inside the netcdf library does only shallow copying
rather than deep copy. So this can lead to memory leaks and errors
because the deep data is shared between the library and the user.
# Solution
The solution is to build properly recursive reclaim and copy
functions and use those as needed.
These recursive functions are defined in libdispatch/dinstance.c
and their signatures are defined in include/netcdf.h.
For back compatibility, corresponding "ncaux_XXX" functions
are defined in include/netcdf_aux.h.
````
int nc_reclaim_data(int ncid, nc_type xtypeid, void* memory, size_t count);
int nc_reclaim_data_all(int ncid, nc_type xtypeid, void* memory, size_t count);
int nc_copy_data(int ncid, nc_type xtypeid, const void* memory, size_t count, void* copy);
int nc_copy_data_all(int ncid, nc_type xtypeid, const void* memory, size_t count, void** copyp);
````
There are two variants. The first two, nc_reclaim_data() and
nc_copy_data(), assume the top-level vector is managed by the
caller. For reclaim, this is so the user can use, for example, a
statically allocated vector. For copy, it assumes the user
provides the space into which the copy is stored.
The second two, nc_reclaim_data_all() and
nc_copy_data_all(), allows the functions to manage the
top-level. So for nc_reclaim_data_all, the top level is
assumed to be dynamically allocated and will be free'd by
nc_reclaim_data_all(). The nc_copy_data_all() function
will allocate the top level and return a pointer to it to the
user. The user can later pass that pointer to
nc_reclaim_data_all() to reclaim the instance(s).
# Internal Changes
The netcdf-c library internals are changed to use the proper
reclaim and copy functions. It turns out that the places where
these functions are needed is quite pervasive in the netcdf-c
library code. Using these functions also allows some
simplification of the code since the stdata and vldata fields of
NC_ATT_INFO are no longer needed. Currently this is commented
out using the SEPDATA \#define macro. When any bugs are largely
fixed, all this code will be removed.
# Known Bugs
1. There is still one known failure that has not been solved.
All the failures revolve around some variant of this .cdl file.
The proximate cause of failure is the use of a VLEN FillValue.
````
netcdf x {
types:
float(*) row_of_floats ;
dimensions:
m = 5 ;
variables:
row_of_floats ragged_array(m) ;
row_of_floats ragged_array:_FillValue = {-999} ;
data:
ragged_array = {10, 11, 12, 13, 14}, {20, 21, 22, 23}, {30, 31, 32},
{40, 41}, _ ;
}
````
When a solution is found, I will either add it to this PR or post a new PR.
# Related Changes
* Mark nc_free_vlen(s) as deprecated in favor of ncaux_reclaim_data.
* Remove the --enable-unfixed-memory-leaks option.
* Remove the NC_VLENS_NOTEST code that suppresses some vlen tests.
* Document this change in docs/internal.md
* Disable the tst_vlen_data test in ncdump/tst_nccopy4.sh.
* Mark types as fixed size or not (transitively) to optimize the reclaim
and copy functions.
# Misc. Changes
* Make Doxygen process libdispatch/daux.c
* Make sure the NC_ATT_INFO_T.container field is set.
2022-01-09 09:30:00 +08:00
|
|
|
#ifndef YY_ATTRIBUTE_PURE
|
2024-03-25 23:32:23 +08:00
|
|
|
# if defined __GNUC__ && 2 < __GNUC__ + (96 <= __GNUC_MINOR__)
|
|
|
|
# define YY_ATTRIBUTE_PURE __attribute__ ((__pure__))
|
|
|
|
# else
|
|
|
|
# define YY_ATTRIBUTE_PURE
|
|
|
|
# endif
|
Fix various problem around VLEN's
re: https://github.com/Unidata/netcdf-c/issues/541
re: https://github.com/Unidata/netcdf-c/issues/1208
re: https://github.com/Unidata/netcdf-c/issues/2078
re: https://github.com/Unidata/netcdf-c/issues/2041
re: https://github.com/Unidata/netcdf-c/issues/2143
For a long time, there have been known problems with the
management of complex types containing VLENs. This also
involves the string type because it is stored as a VLEN of
chars.
This PR (mostly) fixes this problem. But note that it adds new
functions to netcdf.h (see below) and this may require bumping
the .so number. These new functions can be removed, if desired,
in favor of functions in netcdf_aux.h, but netcdf.h seems the
better place for them because they are intended as alternatives
to the nc_free_vlen and nc_free_string functions already in
netcdf.h.
The term complex type refers to any type that directly or
transitively references a VLEN type. So an array of VLENS, a
compound with a VLEN field, and so on.
In order to properly handle instances of these complex types, it
is necessary to have function that can recursively walk
instances of such types to perform various actions on them. The
term "deep" is also used to mean recursive.
At the moment, the two operations needed by the netcdf library are:
* free'ing an instance of the complex type
* copying an instance of the complex type.
The current library does only shallow free and shallow copy of
complex types. This means that only the top level is properly
free'd or copied, but deep internal blocks in the instance are
not touched.
Note that the term "vector" will be used to mean a contiguous (in
memory) sequence of instances of some type. Given an array with,
say, dimensions 2 X 3 X 4, this will be stored in memory as a
vector of length 2*3*4=24 instances.
The use cases are primarily these.
## nc_get_vars
Suppose one is reading a vector of instances using nc_get_vars
(or nc_get_vara or nc_get_var, etc.). These functions will
return the vector in the top-level memory provided. All
interior blocks (form nested VLEN or strings) will have been
dynamically allocated.
After using this vector of instances, it is necessary to free
(aka reclaim) the dynamically allocated memory, otherwise a
memory leak occurs. So, the recursive reclaim function is used
to walk the returned instance vector and do a deep reclaim of
the data.
Currently functions are defined in netcdf.h that are supposed to
handle this: nc_free_vlen(), nc_free_vlens(), and
nc_free_string(). Unfortunately, these functions only do a
shallow free, so deeply nested instances are not properly
handled by them.
Note that internally, the provided data is immediately written so
there is no need to copy it. But the caller may need to reclaim the
data it passed into the function.
## nc_put_att
Suppose one is writing a vector of instances as the data of an attribute
using, say, nc_put_att.
Internally, the incoming attribute data must be copied and stored
so that changes/reclamation of the input data will not affect
the attribute.
Again, the code inside the netcdf library does only shallow copying
rather than deep copy. As a result, one sees effects such as described
in Github Issue https://github.com/Unidata/netcdf-c/issues/2143.
Also, after defining the attribute, it may be necessary for the user
to free the data that was provided as input to nc_put_att().
## nc_get_att
Suppose one is reading a vector of instances as the data of an attribute
using, say, nc_get_att.
Internally, the existing attribute data must be copied and returned
to the caller, and the caller is responsible for reclaiming
the returned data.
Again, the code inside the netcdf library does only shallow copying
rather than deep copy. So this can lead to memory leaks and errors
because the deep data is shared between the library and the user.
# Solution
The solution is to build properly recursive reclaim and copy
functions and use those as needed.
These recursive functions are defined in libdispatch/dinstance.c
and their signatures are defined in include/netcdf.h.
For back compatibility, corresponding "ncaux_XXX" functions
are defined in include/netcdf_aux.h.
````
int nc_reclaim_data(int ncid, nc_type xtypeid, void* memory, size_t count);
int nc_reclaim_data_all(int ncid, nc_type xtypeid, void* memory, size_t count);
int nc_copy_data(int ncid, nc_type xtypeid, const void* memory, size_t count, void* copy);
int nc_copy_data_all(int ncid, nc_type xtypeid, const void* memory, size_t count, void** copyp);
````
There are two variants. The first two, nc_reclaim_data() and
nc_copy_data(), assume the top-level vector is managed by the
caller. For reclaim, this is so the user can use, for example, a
statically allocated vector. For copy, it assumes the user
provides the space into which the copy is stored.
The second two, nc_reclaim_data_all() and
nc_copy_data_all(), allows the functions to manage the
top-level. So for nc_reclaim_data_all, the top level is
assumed to be dynamically allocated and will be free'd by
nc_reclaim_data_all(). The nc_copy_data_all() function
will allocate the top level and return a pointer to it to the
user. The user can later pass that pointer to
nc_reclaim_data_all() to reclaim the instance(s).
# Internal Changes
The netcdf-c library internals are changed to use the proper
reclaim and copy functions. It turns out that the places where
these functions are needed is quite pervasive in the netcdf-c
library code. Using these functions also allows some
simplification of the code since the stdata and vldata fields of
NC_ATT_INFO are no longer needed. Currently this is commented
out using the SEPDATA \#define macro. When any bugs are largely
fixed, all this code will be removed.
# Known Bugs
1. There is still one known failure that has not been solved.
All the failures revolve around some variant of this .cdl file.
The proximate cause of failure is the use of a VLEN FillValue.
````
netcdf x {
types:
float(*) row_of_floats ;
dimensions:
m = 5 ;
variables:
row_of_floats ragged_array(m) ;
row_of_floats ragged_array:_FillValue = {-999} ;
data:
ragged_array = {10, 11, 12, 13, 14}, {20, 21, 22, 23}, {30, 31, 32},
{40, 41}, _ ;
}
````
When a solution is found, I will either add it to this PR or post a new PR.
# Related Changes
* Mark nc_free_vlen(s) as deprecated in favor of ncaux_reclaim_data.
* Remove the --enable-unfixed-memory-leaks option.
* Remove the NC_VLENS_NOTEST code that suppresses some vlen tests.
* Document this change in docs/internal.md
* Disable the tst_vlen_data test in ncdump/tst_nccopy4.sh.
* Mark types as fixed size or not (transitively) to optimize the reclaim
and copy functions.
# Misc. Changes
* Make Doxygen process libdispatch/daux.c
* Make sure the NC_ATT_INFO_T.container field is set.
2022-01-09 09:30:00 +08:00
|
|
|
#endif
|
|
|
|
|
2020-07-30 07:59:19 +08:00
|
|
|
#ifndef YY_ATTRIBUTE_UNUSED
|
2024-03-25 23:32:23 +08:00
|
|
|
# if defined __GNUC__ && 2 < __GNUC__ + (7 <= __GNUC_MINOR__)
|
|
|
|
# define YY_ATTRIBUTE_UNUSED __attribute__ ((__unused__))
|
2020-07-30 07:59:19 +08:00
|
|
|
# else
|
2024-03-25 23:32:23 +08:00
|
|
|
# define YY_ATTRIBUTE_UNUSED
|
2020-07-30 07:59:19 +08:00
|
|
|
# endif
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* Suppress unused-variable warnings by "using" E. */
|
|
|
|
#if ! defined lint || defined __GNUC__
|
2024-03-25 23:32:23 +08:00
|
|
|
# define YY_USE(E) ((void) (E))
|
2020-07-30 07:59:19 +08:00
|
|
|
#else
|
2024-03-25 23:32:23 +08:00
|
|
|
# define YY_USE(E) /* empty */
|
2020-07-30 07:59:19 +08:00
|
|
|
#endif
|
|
|
|
|
|
|
|
/* Suppress an incorrect diagnostic about yylval being uninitialized. */
|
2024-03-25 23:32:23 +08:00
|
|
|
#if defined __GNUC__ && ! defined __ICC && 406 <= __GNUC__ * 100 + __GNUC_MINOR__
|
|
|
|
# if __GNUC__ * 100 + __GNUC_MINOR__ < 407
|
|
|
|
# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN \
|
|
|
|
_Pragma ("GCC diagnostic push") \
|
|
|
|
_Pragma ("GCC diagnostic ignored \"-Wuninitialized\"")
|
|
|
|
# else
|
|
|
|
# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN \
|
|
|
|
_Pragma ("GCC diagnostic push") \
|
|
|
|
_Pragma ("GCC diagnostic ignored \"-Wuninitialized\"") \
|
2020-07-30 07:59:19 +08:00
|
|
|
_Pragma ("GCC diagnostic ignored \"-Wmaybe-uninitialized\"")
|
2024-03-25 23:32:23 +08:00
|
|
|
# endif
|
|
|
|
# define YY_IGNORE_MAYBE_UNINITIALIZED_END \
|
2020-07-30 07:59:19 +08:00
|
|
|
_Pragma ("GCC diagnostic pop")
|
|
|
|
#else
|
|
|
|
# define YY_INITIAL_VALUE(Value) Value
|
|
|
|
#endif
|
|
|
|
#ifndef YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
|
|
|
|
# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
|
|
|
|
# define YY_IGNORE_MAYBE_UNINITIALIZED_END
|
|
|
|
#endif
|
|
|
|
#ifndef YY_INITIAL_VALUE
|
|
|
|
# define YY_INITIAL_VALUE(Value) /* Nothing. */
|
|
|
|
#endif
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
#if defined __cplusplus && defined __GNUC__ && ! defined __ICC && 6 <= __GNUC__
|
|
|
|
# define YY_IGNORE_USELESS_CAST_BEGIN \
|
|
|
|
_Pragma ("GCC diagnostic push") \
|
|
|
|
_Pragma ("GCC diagnostic ignored \"-Wuseless-cast\"")
|
|
|
|
# define YY_IGNORE_USELESS_CAST_END \
|
|
|
|
_Pragma ("GCC diagnostic pop")
|
|
|
|
#endif
|
|
|
|
#ifndef YY_IGNORE_USELESS_CAST_BEGIN
|
|
|
|
# define YY_IGNORE_USELESS_CAST_BEGIN
|
|
|
|
# define YY_IGNORE_USELESS_CAST_END
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
#define YY_ASSERT(E) ((void) (0 && (E)))
|
2021-09-03 07:04:26 +08:00
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
#if !defined yyoverflow
|
2020-07-30 07:59:19 +08:00
|
|
|
|
|
|
|
/* The parser invokes alloca or malloc; define the necessary symbols. */
|
|
|
|
|
|
|
|
# ifdef YYSTACK_USE_ALLOCA
|
|
|
|
# if YYSTACK_USE_ALLOCA
|
|
|
|
# ifdef __GNUC__
|
|
|
|
# define YYSTACK_ALLOC __builtin_alloca
|
|
|
|
# elif defined __BUILTIN_VA_ARG_INCR
|
|
|
|
# include <alloca.h> /* INFRINGES ON USER NAME SPACE */
|
|
|
|
# elif defined _AIX
|
|
|
|
# define YYSTACK_ALLOC __alloca
|
|
|
|
# elif defined _MSC_VER
|
|
|
|
# include <malloc.h> /* INFRINGES ON USER NAME SPACE */
|
|
|
|
# define alloca _alloca
|
|
|
|
# else
|
|
|
|
# define YYSTACK_ALLOC alloca
|
|
|
|
# if ! defined _ALLOCA_H && ! defined EXIT_SUCCESS
|
|
|
|
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
|
|
|
|
/* Use EXIT_SUCCESS as a witness for stdlib.h. */
|
|
|
|
# ifndef EXIT_SUCCESS
|
|
|
|
# define EXIT_SUCCESS 0
|
|
|
|
# endif
|
|
|
|
# endif
|
|
|
|
# endif
|
|
|
|
# endif
|
|
|
|
# endif
|
|
|
|
|
|
|
|
# ifdef YYSTACK_ALLOC
|
|
|
|
/* Pacify GCC's 'empty if-body' warning. */
|
|
|
|
# define YYSTACK_FREE(Ptr) do { /* empty */; } while (0)
|
|
|
|
# ifndef YYSTACK_ALLOC_MAXIMUM
|
|
|
|
/* The OS might guarantee only one guard page at the bottom of the stack,
|
|
|
|
and a page size can be as small as 4096 bytes. So we cannot safely
|
|
|
|
invoke alloca (N) if N exceeds 4096. Use a slightly smaller number
|
|
|
|
to allow for a few compiler-allocated temporary stack slots. */
|
|
|
|
# define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */
|
|
|
|
# endif
|
|
|
|
# else
|
|
|
|
# define YYSTACK_ALLOC YYMALLOC
|
|
|
|
# define YYSTACK_FREE YYFREE
|
|
|
|
# ifndef YYSTACK_ALLOC_MAXIMUM
|
|
|
|
# define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM
|
|
|
|
# endif
|
|
|
|
# if (defined __cplusplus && ! defined EXIT_SUCCESS \
|
|
|
|
&& ! ((defined YYMALLOC || defined malloc) \
|
|
|
|
&& (defined YYFREE || defined free)))
|
|
|
|
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
|
|
|
|
# ifndef EXIT_SUCCESS
|
|
|
|
# define EXIT_SUCCESS 0
|
|
|
|
# endif
|
|
|
|
# endif
|
|
|
|
# ifndef YYMALLOC
|
|
|
|
# define YYMALLOC malloc
|
|
|
|
# if ! defined malloc && ! defined EXIT_SUCCESS
|
|
|
|
void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */
|
|
|
|
# endif
|
|
|
|
# endif
|
|
|
|
# ifndef YYFREE
|
|
|
|
# define YYFREE free
|
|
|
|
# if ! defined free && ! defined EXIT_SUCCESS
|
|
|
|
void free (void *); /* INFRINGES ON USER NAME SPACE */
|
|
|
|
# endif
|
|
|
|
# endif
|
|
|
|
# endif
|
2024-03-25 23:32:23 +08:00
|
|
|
#endif /* !defined yyoverflow */
|
2020-07-30 07:59:19 +08:00
|
|
|
|
|
|
|
#if (! defined yyoverflow \
|
|
|
|
&& (! defined __cplusplus \
|
|
|
|
|| (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
|
|
|
|
|
|
|
|
/* A type that is properly aligned for any stack member. */
|
|
|
|
union yyalloc
|
|
|
|
{
|
2024-03-25 23:32:23 +08:00
|
|
|
yy_state_t yyss_alloc;
|
2020-07-30 07:59:19 +08:00
|
|
|
YYSTYPE yyvs_alloc;
|
|
|
|
};
|
|
|
|
|
|
|
|
/* The size of the maximum gap between one aligned stack and the next. */
|
2024-03-25 23:32:23 +08:00
|
|
|
# define YYSTACK_GAP_MAXIMUM (YYSIZEOF (union yyalloc) - 1)
|
2020-07-30 07:59:19 +08:00
|
|
|
|
|
|
|
/* The size of an array large to enough to hold all stacks, each with
|
|
|
|
N elements. */
|
|
|
|
# define YYSTACK_BYTES(N) \
|
2024-03-25 23:32:23 +08:00
|
|
|
((N) * (YYSIZEOF (yy_state_t) + YYSIZEOF (YYSTYPE)) \
|
2020-07-30 07:59:19 +08:00
|
|
|
+ YYSTACK_GAP_MAXIMUM)
|
|
|
|
|
|
|
|
# define YYCOPY_NEEDED 1
|
|
|
|
|
|
|
|
/* Relocate STACK from its old location to the new one. The
|
|
|
|
local variables YYSIZE and YYSTACKSIZE give the old and new number of
|
|
|
|
elements in the stack, and YYPTR gives the new location of the
|
|
|
|
stack. Advance YYPTR to a properly aligned location for the next
|
|
|
|
stack. */
|
|
|
|
# define YYSTACK_RELOCATE(Stack_alloc, Stack) \
|
|
|
|
do \
|
|
|
|
{ \
|
2024-03-25 23:32:23 +08:00
|
|
|
YYPTRDIFF_T yynewbytes; \
|
2020-07-30 07:59:19 +08:00
|
|
|
YYCOPY (&yyptr->Stack_alloc, Stack, yysize); \
|
|
|
|
Stack = &yyptr->Stack_alloc; \
|
2024-03-25 23:32:23 +08:00
|
|
|
yynewbytes = yystacksize * YYSIZEOF (*Stack) + YYSTACK_GAP_MAXIMUM; \
|
|
|
|
yyptr += yynewbytes / YYSIZEOF (*yyptr); \
|
2020-07-30 07:59:19 +08:00
|
|
|
} \
|
|
|
|
while (0)
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#if defined YYCOPY_NEEDED && YYCOPY_NEEDED
|
|
|
|
/* Copy COUNT objects from SRC to DST. The source and destination do
|
|
|
|
not overlap. */
|
|
|
|
# ifndef YYCOPY
|
|
|
|
# if defined __GNUC__ && 1 < __GNUC__
|
|
|
|
# define YYCOPY(Dst, Src, Count) \
|
2024-03-25 23:32:23 +08:00
|
|
|
__builtin_memcpy (Dst, Src, YY_CAST (YYSIZE_T, (Count)) * sizeof (*(Src)))
|
2020-07-30 07:59:19 +08:00
|
|
|
# else
|
|
|
|
# define YYCOPY(Dst, Src, Count) \
|
|
|
|
do \
|
|
|
|
{ \
|
2024-03-25 23:32:23 +08:00
|
|
|
YYPTRDIFF_T yyi; \
|
2020-07-30 07:59:19 +08:00
|
|
|
for (yyi = 0; yyi < (Count); yyi++) \
|
|
|
|
(Dst)[yyi] = (Src)[yyi]; \
|
|
|
|
} \
|
|
|
|
while (0)
|
|
|
|
# endif
|
|
|
|
# endif
|
|
|
|
#endif /* !YYCOPY_NEEDED */
|
|
|
|
|
|
|
|
/* YYFINAL -- State number of the termination state. */
|
|
|
|
#define YYFINAL 4
|
|
|
|
/* YYLAST -- Last index in YYTABLE. */
|
|
|
|
#define YYLAST 78
|
|
|
|
|
|
|
|
/* YYNTOKENS -- Number of terminals. */
|
|
|
|
#define YYNTOKENS 31
|
|
|
|
/* YYNNTS -- Number of nonterminals. */
|
|
|
|
#define YYNNTS 42
|
|
|
|
/* YYNRULES -- Number of rules. */
|
|
|
|
#define YYNRULES 79
|
|
|
|
/* YYNSTATES -- Number of states. */
|
|
|
|
#define YYNSTATES 112
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
/* YYMAXUTOK -- Last valid token kind. */
|
2020-07-30 07:59:19 +08:00
|
|
|
#define YYMAXUTOK 277
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
|
|
|
|
/* YYTRANSLATE(TOKEN-NUM) -- Symbol number corresponding to TOKEN-NUM
|
|
|
|
as returned by yylex, with out-of-bounds checking. */
|
|
|
|
#define YYTRANSLATE(YYX) \
|
|
|
|
(0 <= (YYX) && (YYX) <= YYMAXUTOK \
|
|
|
|
? YY_CAST (yysymbol_kind_t, yytranslate[YYX]) \
|
|
|
|
: YYSYMBOL_YYUNDEF)
|
2020-07-30 07:59:19 +08:00
|
|
|
|
|
|
|
/* YYTRANSLATE[TOKEN-NUM] -- Symbol number corresponding to TOKEN-NUM
|
2024-03-25 23:32:23 +08:00
|
|
|
as returned by yylex. */
|
|
|
|
static const yytype_int8 yytranslate[] =
|
2020-07-30 07:59:19 +08:00
|
|
|
{
|
|
|
|
0, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
28, 29, 2, 2, 26, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 30, 25,
|
|
|
|
2, 27, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 23, 2, 24, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 1, 2, 3, 4,
|
|
|
|
5, 6, 7, 8, 9, 10, 11, 12, 13, 14,
|
|
|
|
15, 16, 17, 18, 19, 20, 21, 22
|
|
|
|
};
|
|
|
|
|
|
|
|
#if YYDEBUG
|
2024-03-25 23:32:23 +08:00
|
|
|
/* YYRLINE[YYN] -- Source line where rule number YYN was defined. */
|
|
|
|
static const yytype_int16 yyrline[] =
|
2020-07-30 07:59:19 +08:00
|
|
|
{
|
2021-09-29 04:03:19 +08:00
|
|
|
0, 117, 117, 120, 115, 133, 134, 136, 137, 139,
|
|
|
|
140, 142, 148, 159, 167, 184, 186, 187, 188, 190,
|
|
|
|
191, 193, 193, 193, 195, 196, 198, 200, 201, 202,
|
|
|
|
203, 204, 205, 207, 208, 211, 210, 249, 251, 252,
|
|
|
|
254, 255, 257, 279, 278, 288, 287, 297, 299, 305,
|
|
|
|
315, 326, 327, 329, 338, 344, 357, 363, 369, 375,
|
|
|
|
381, 389, 390, 391, 394, 395, 398, 397, 464, 465,
|
|
|
|
468, 468, 520, 546, 601, 627, 653, 679, 705, 734
|
2020-07-30 07:59:19 +08:00
|
|
|
};
|
|
|
|
#endif
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
/** Accessing symbol of state STATE. */
|
|
|
|
#define YY_ACCESSING_SYMBOL(State) YY_CAST (yysymbol_kind_t, yystos[State])
|
|
|
|
|
|
|
|
#if YYDEBUG || 0
|
|
|
|
/* The user-facing name of the symbol whose (internal) number is
|
|
|
|
YYSYMBOL. No bounds checking. */
|
|
|
|
static const char *yysymbol_name (yysymbol_kind_t yysymbol) YY_ATTRIBUTE_UNUSED;
|
|
|
|
|
2020-07-30 07:59:19 +08:00
|
|
|
/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
|
|
|
|
First, the terminals, then, starting at YYNTOKENS, nonterminals. */
|
|
|
|
static const char *const yytname[] =
|
|
|
|
{
|
2024-03-25 23:32:23 +08:00
|
|
|
"\"end of file\"", "error", "\"invalid token\"", "NC_UNLIMITED_K",
|
|
|
|
"BYTE_K", "CHAR_K", "SHORT_K", "INT_K", "FLOAT_K", "DOUBLE_K", "IDENT",
|
|
|
|
"TERMSTRING", "BYTE_CONST", "CHAR_CONST", "SHORT_CONST", "INT_CONST",
|
|
|
|
"FLOAT_CONST", "DOUBLE_CONST", "DIMENSIONS", "VARIABLES", "NETCDF",
|
|
|
|
"DATA", "FILLVALUE", "'{'", "'}'", "';'", "','", "'='", "'('", "')'",
|
|
|
|
"':'", "$accept", "ncdesc", "$@1", "$@2", "dimsection", "dimdecls",
|
|
|
|
"dimdecline", "dimdecl", "dimd", "dim", "vasection", "vadecls", "vadecl",
|
|
|
|
"gattdecls", "vardecl", "type", "varlist", "varspec", "$@3", "var",
|
|
|
|
"dimspec", "dimlist", "vdim", "attdecl", "$@4", "gattdecl", "$@5", "att",
|
|
|
|
"gatt", "avar", "attr", "attvallist", "aconst", "attconst",
|
|
|
|
"datasection", "datadecls", "datadecl", "$@6", "constlist", "dconst",
|
|
|
|
"$@7", "const", YY_NULLPTR
|
2020-07-30 07:59:19 +08:00
|
|
|
};
|
2021-09-03 07:04:26 +08:00
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
static const char *
|
|
|
|
yysymbol_name (yysymbol_kind_t yysymbol)
|
2021-09-03 07:04:26 +08:00
|
|
|
{
|
2024-03-25 23:32:23 +08:00
|
|
|
return yytname[yysymbol];
|
|
|
|
}
|
|
|
|
#endif
|
2020-07-30 07:59:19 +08:00
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
#define YYPACT_NINF (-73)
|
2020-07-30 07:59:19 +08:00
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
#define yypact_value_is_default(Yyn) \
|
|
|
|
((Yyn) == YYPACT_NINF)
|
2020-07-30 07:59:19 +08:00
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
#define YYTABLE_NINF (-1)
|
2020-07-30 07:59:19 +08:00
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
#define yytable_value_is_error(Yyn) \
|
2020-07-30 07:59:19 +08:00
|
|
|
0
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
|
|
|
|
STATE-NUM. */
|
2020-07-30 07:59:19 +08:00
|
|
|
static const yytype_int8 yypact[] =
|
|
|
|
{
|
|
|
|
10, 3, 31, -73, -73, 19, 36, 6, -73, 36,
|
|
|
|
7, -73, 20, -73, -3, 38, -73, 21, 24, -73,
|
|
|
|
9, -73, 36, 5, -73, -73, -73, -73, -73, -73,
|
|
|
|
-73, -3, 25, -73, 42, -73, -73, -73, -73, 23,
|
|
|
|
-73, -73, 33, 30, -73, 29, -73, -73, -73, -73,
|
|
|
|
-73, 32, -73, 34, -73, -73, 35, 38, 42, 37,
|
|
|
|
-73, 28, -73, 42, 39, 28, -73, -73, 42, 40,
|
|
|
|
-73, -73, -73, -73, -73, -73, -73, -73, 43, -73,
|
|
|
|
-73, -73, 36, -73, 43, 41, 45, -73, 28, -73,
|
|
|
|
-17, -73, -73, -73, -73, 36, -73, 46, -73, 2,
|
|
|
|
-73, -73, -73, -73, -73, -73, -73, -73, -73, -73,
|
|
|
|
-73, -73
|
|
|
|
};
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
/* YYDEFACT[STATE-NUM] -- Default reduction number in state STATE-NUM.
|
|
|
|
Performed when YYTABLE does not specify something else to do. Zero
|
|
|
|
means the default is an error. */
|
|
|
|
static const yytype_int8 yydefact[] =
|
2020-07-30 07:59:19 +08:00
|
|
|
{
|
|
|
|
0, 0, 0, 2, 1, 5, 0, 16, 15, 6,
|
|
|
|
0, 9, 0, 14, 0, 0, 3, 18, 0, 45,
|
|
|
|
0, 7, 0, 0, 27, 28, 29, 30, 31, 32,
|
|
|
|
37, 17, 0, 21, 0, 49, 22, 23, 43, 0,
|
|
|
|
50, 48, 61, 0, 24, 0, 8, 10, 13, 11,
|
|
|
|
12, 0, 19, 26, 33, 35, 0, 0, 63, 0,
|
|
|
|
25, 0, 20, 0, 38, 0, 47, 66, 62, 0,
|
|
|
|
4, 55, 56, 54, 57, 58, 59, 60, 46, 51,
|
|
|
|
53, 34, 0, 36, 44, 0, 0, 64, 0, 42,
|
|
|
|
0, 40, 70, 65, 52, 0, 39, 67, 68, 0,
|
|
|
|
41, 70, 73, 74, 72, 75, 76, 77, 78, 79,
|
|
|
|
71, 69
|
|
|
|
};
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
/* YYPGOTO[NTERM-NUM]. */
|
2020-07-30 07:59:19 +08:00
|
|
|
static const yytype_int8 yypgoto[] =
|
|
|
|
{
|
|
|
|
-73, -73, -73, -73, -73, -73, 49, 44, -73, -72,
|
|
|
|
-73, -73, 47, -73, -73, -73, -73, -4, -73, -34,
|
|
|
|
-73, -73, -32, -73, -73, 4, -73, -73, -73, -30,
|
|
|
|
14, -1, -15, -73, -73, -73, 8, -73, -73, -27,
|
|
|
|
-73, -73
|
|
|
|
};
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
/* YYDEFGOTO[NTERM-NUM]. */
|
2020-07-30 07:59:19 +08:00
|
|
|
static const yytype_int8 yydefgoto[] =
|
|
|
|
{
|
2024-03-25 23:32:23 +08:00
|
|
|
0, 2, 5, 42, 7, 9, 10, 11, 12, 13,
|
2020-07-30 07:59:19 +08:00
|
|
|
16, 31, 32, 17, 33, 34, 53, 54, 64, 35,
|
|
|
|
83, 90, 91, 36, 56, 37, 45, 38, 19, 39,
|
|
|
|
41, 78, 79, 80, 59, 68, 69, 85, 97, 98,
|
|
|
|
99, 110
|
|
|
|
};
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
/* YYTABLE[YYPACT[STATE-NUM]] -- What to do in state STATE-NUM. If
|
|
|
|
positive, shift that token. If negative, reduce the rule whose
|
|
|
|
number is the opposite. If YYTABLE_NINF, syntax error. */
|
|
|
|
static const yytype_int8 yytable[] =
|
2020-07-30 07:59:19 +08:00
|
|
|
{
|
|
|
|
55, 24, 25, 26, 27, 28, 29, 30, 48, 95,
|
|
|
|
89, 18, 96, 102, 103, 104, 105, 106, 107, 108,
|
|
|
|
49, 43, 50, 89, 109, 14, 3, 15, 67, 55,
|
|
|
|
1, 4, 21, 22, 46, 22, 15, 6, 67, 71,
|
|
|
|
72, 73, 74, 75, 76, 77, 8, 23, 40, 44,
|
|
|
|
52, 15, 30, 57, 58, 60, 61, 62, 20, 81,
|
|
|
|
63, 70, 65, 100, 84, 87, 47, 82, 92, 88,
|
|
|
|
93, 66, 101, 94, 111, 0, 86, 0, 51
|
|
|
|
};
|
|
|
|
|
|
|
|
static const yytype_int8 yycheck[] =
|
|
|
|
{
|
|
|
|
34, 4, 5, 6, 7, 8, 9, 10, 3, 26,
|
|
|
|
82, 7, 29, 11, 12, 13, 14, 15, 16, 17,
|
|
|
|
15, 17, 17, 95, 22, 19, 23, 30, 58, 63,
|
|
|
|
20, 0, 25, 26, 25, 26, 30, 18, 68, 11,
|
|
|
|
12, 13, 14, 15, 16, 17, 10, 27, 10, 25,
|
|
|
|
25, 30, 10, 30, 21, 25, 27, 25, 9, 63,
|
|
|
|
26, 24, 27, 95, 65, 25, 22, 28, 27, 26,
|
|
|
|
25, 57, 26, 88, 101, -1, 68, -1, 31
|
|
|
|
};
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
/* YYSTOS[STATE-NUM] -- The symbol kind of the accessing symbol of
|
|
|
|
state STATE-NUM. */
|
|
|
|
static const yytype_int8 yystos[] =
|
2020-07-30 07:59:19 +08:00
|
|
|
{
|
|
|
|
0, 20, 32, 23, 0, 33, 18, 35, 10, 36,
|
|
|
|
37, 38, 39, 40, 19, 30, 41, 44, 56, 59,
|
|
|
|
37, 25, 26, 27, 4, 5, 6, 7, 8, 9,
|
|
|
|
10, 42, 43, 45, 46, 50, 54, 56, 58, 60,
|
|
|
|
10, 61, 34, 56, 25, 57, 25, 38, 3, 15,
|
|
|
|
17, 43, 25, 47, 48, 50, 55, 30, 21, 65,
|
|
|
|
25, 27, 25, 26, 49, 27, 61, 60, 66, 67,
|
|
|
|
24, 11, 12, 13, 14, 15, 16, 17, 62, 63,
|
|
|
|
64, 48, 28, 51, 62, 68, 67, 25, 26, 40,
|
|
|
|
52, 53, 27, 25, 63, 26, 29, 69, 70, 71,
|
|
|
|
53, 26, 11, 12, 13, 14, 15, 16, 17, 22,
|
|
|
|
72, 70
|
|
|
|
};
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
/* YYR1[RULE-NUM] -- Symbol kind of the left-hand side of rule RULE-NUM. */
|
|
|
|
static const yytype_int8 yyr1[] =
|
2020-07-30 07:59:19 +08:00
|
|
|
{
|
|
|
|
0, 31, 33, 34, 32, 35, 35, 36, 36, 37,
|
|
|
|
37, 38, 38, 38, 39, 40, 41, 41, 41, 42,
|
|
|
|
42, 43, 43, 43, 44, 44, 45, 46, 46, 46,
|
|
|
|
46, 46, 46, 47, 47, 49, 48, 50, 51, 51,
|
|
|
|
52, 52, 53, 55, 54, 57, 56, 58, 59, 60,
|
|
|
|
61, 62, 62, 63, 64, 64, 64, 64, 64, 64,
|
|
|
|
64, 65, 65, 65, 66, 66, 68, 67, 69, 69,
|
|
|
|
71, 70, 72, 72, 72, 72, 72, 72, 72, 72
|
|
|
|
};
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
/* YYR2[RULE-NUM] -- Number of symbols on the right-hand side of rule RULE-NUM. */
|
|
|
|
static const yytype_int8 yyr2[] =
|
2020-07-30 07:59:19 +08:00
|
|
|
{
|
|
|
|
0, 2, 0, 0, 8, 0, 2, 2, 3, 1,
|
|
|
|
3, 3, 3, 3, 1, 1, 0, 2, 1, 2,
|
|
|
|
3, 1, 1, 1, 2, 3, 2, 1, 1, 1,
|
|
|
|
1, 1, 1, 1, 3, 0, 3, 1, 0, 3,
|
|
|
|
1, 3, 1, 0, 4, 0, 4, 3, 2, 1,
|
|
|
|
1, 1, 3, 1, 1, 1, 1, 1, 1, 1,
|
|
|
|
1, 0, 2, 1, 2, 3, 0, 4, 1, 3,
|
|
|
|
0, 2, 1, 1, 1, 1, 1, 1, 1, 1
|
|
|
|
};
|
|
|
|
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
enum { YYENOMEM = -2 };
|
|
|
|
|
2020-07-30 07:59:19 +08:00
|
|
|
#define yyerrok (yyerrstatus = 0)
|
|
|
|
#define yyclearin (yychar = YYEMPTY)
|
|
|
|
|
|
|
|
#define YYACCEPT goto yyacceptlab
|
|
|
|
#define YYABORT goto yyabortlab
|
|
|
|
#define YYERROR goto yyerrorlab
|
2024-03-25 23:32:23 +08:00
|
|
|
#define YYNOMEM goto yyexhaustedlab
|
2020-07-30 07:59:19 +08:00
|
|
|
|
|
|
|
|
|
|
|
#define YYRECOVERING() (!!yyerrstatus)
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
#define YYBACKUP(Token, Value) \
|
|
|
|
do \
|
|
|
|
if (yychar == YYEMPTY) \
|
|
|
|
{ \
|
|
|
|
yychar = (Token); \
|
|
|
|
yylval = (Value); \
|
|
|
|
YYPOPSTACK (yylen); \
|
|
|
|
yystate = *yyssp; \
|
|
|
|
goto yybackup; \
|
|
|
|
} \
|
|
|
|
else \
|
|
|
|
{ \
|
|
|
|
yyerror (YY_("syntax error: cannot back up")); \
|
|
|
|
YYERROR; \
|
|
|
|
} \
|
|
|
|
while (0)
|
|
|
|
|
|
|
|
/* Backward compatibility with an undocumented macro.
|
|
|
|
Use YYerror or YYUNDEF. */
|
|
|
|
#define YYERRCODE YYUNDEF
|
2020-07-30 07:59:19 +08:00
|
|
|
|
|
|
|
|
|
|
|
/* Enable debugging if requested. */
|
|
|
|
#if YYDEBUG
|
|
|
|
|
|
|
|
# ifndef YYFPRINTF
|
|
|
|
# include <stdio.h> /* INFRINGES ON USER NAME SPACE */
|
|
|
|
# define YYFPRINTF fprintf
|
|
|
|
# endif
|
|
|
|
|
|
|
|
# define YYDPRINTF(Args) \
|
|
|
|
do { \
|
|
|
|
if (yydebug) \
|
|
|
|
YYFPRINTF Args; \
|
|
|
|
} while (0)
|
|
|
|
|
2021-12-24 13:18:56 +08:00
|
|
|
|
2020-07-30 07:59:19 +08:00
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
|
|
|
|
# define YY_SYMBOL_PRINT(Title, Kind, Value, Location) \
|
2020-07-30 07:59:19 +08:00
|
|
|
do { \
|
|
|
|
if (yydebug) \
|
|
|
|
{ \
|
|
|
|
YYFPRINTF (stderr, "%s ", Title); \
|
|
|
|
yy_symbol_print (stderr, \
|
2024-03-25 23:32:23 +08:00
|
|
|
Kind, Value); \
|
2020-07-30 07:59:19 +08:00
|
|
|
YYFPRINTF (stderr, "\n"); \
|
|
|
|
} \
|
|
|
|
} while (0)
|
|
|
|
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
/*-----------------------------------.
|
|
|
|
| Print this symbol's value on YYO. |
|
|
|
|
`-----------------------------------*/
|
2020-07-30 07:59:19 +08:00
|
|
|
|
|
|
|
static void
|
2024-03-25 23:32:23 +08:00
|
|
|
yy_symbol_value_print (FILE *yyo,
|
|
|
|
yysymbol_kind_t yykind, YYSTYPE const * const yyvaluep)
|
2020-07-30 07:59:19 +08:00
|
|
|
{
|
2024-03-25 23:32:23 +08:00
|
|
|
FILE *yyoutput = yyo;
|
|
|
|
YY_USE (yyoutput);
|
2020-07-30 07:59:19 +08:00
|
|
|
if (!yyvaluep)
|
|
|
|
return;
|
2024-03-25 23:32:23 +08:00
|
|
|
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
|
|
|
|
YY_USE (yykind);
|
|
|
|
YY_IGNORE_MAYBE_UNINITIALIZED_END
|
2020-07-30 07:59:19 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
/*---------------------------.
|
|
|
|
| Print this symbol on YYO. |
|
|
|
|
`---------------------------*/
|
2020-07-30 07:59:19 +08:00
|
|
|
|
|
|
|
static void
|
2024-03-25 23:32:23 +08:00
|
|
|
yy_symbol_print (FILE *yyo,
|
|
|
|
yysymbol_kind_t yykind, YYSTYPE const * const yyvaluep)
|
2020-07-30 07:59:19 +08:00
|
|
|
{
|
2024-03-25 23:32:23 +08:00
|
|
|
YYFPRINTF (yyo, "%s %s (",
|
|
|
|
yykind < YYNTOKENS ? "token" : "nterm", yysymbol_name (yykind));
|
2020-07-30 07:59:19 +08:00
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
yy_symbol_value_print (yyo, yykind, yyvaluep);
|
|
|
|
YYFPRINTF (yyo, ")");
|
2020-07-30 07:59:19 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/*------------------------------------------------------------------.
|
|
|
|
| yy_stack_print -- Print the state stack from its BOTTOM up to its |
|
|
|
|
| TOP (included). |
|
|
|
|
`------------------------------------------------------------------*/
|
|
|
|
|
|
|
|
static void
|
2024-03-25 23:32:23 +08:00
|
|
|
yy_stack_print (yy_state_t *yybottom, yy_state_t *yytop)
|
2020-07-30 07:59:19 +08:00
|
|
|
{
|
|
|
|
YYFPRINTF (stderr, "Stack now");
|
|
|
|
for (; yybottom <= yytop; yybottom++)
|
|
|
|
{
|
|
|
|
int yybot = *yybottom;
|
|
|
|
YYFPRINTF (stderr, " %d", yybot);
|
|
|
|
}
|
|
|
|
YYFPRINTF (stderr, "\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
# define YY_STACK_PRINT(Bottom, Top) \
|
|
|
|
do { \
|
|
|
|
if (yydebug) \
|
|
|
|
yy_stack_print ((Bottom), (Top)); \
|
|
|
|
} while (0)
|
|
|
|
|
|
|
|
|
|
|
|
/*------------------------------------------------.
|
|
|
|
| Report that the YYRULE is going to be reduced. |
|
|
|
|
`------------------------------------------------*/
|
|
|
|
|
|
|
|
static void
|
2024-03-25 23:32:23 +08:00
|
|
|
yy_reduce_print (yy_state_t *yyssp, YYSTYPE *yyvsp,
|
|
|
|
int yyrule)
|
2020-07-30 07:59:19 +08:00
|
|
|
{
|
2024-03-25 23:32:23 +08:00
|
|
|
int yylno = yyrline[yyrule];
|
2020-07-30 07:59:19 +08:00
|
|
|
int yynrhs = yyr2[yyrule];
|
|
|
|
int yyi;
|
2024-03-25 23:32:23 +08:00
|
|
|
YYFPRINTF (stderr, "Reducing stack by rule %d (line %d):\n",
|
2020-07-30 07:59:19 +08:00
|
|
|
yyrule - 1, yylno);
|
|
|
|
/* The symbols being reduced. */
|
|
|
|
for (yyi = 0; yyi < yynrhs; yyi++)
|
|
|
|
{
|
|
|
|
YYFPRINTF (stderr, " $%d = ", yyi + 1);
|
|
|
|
yy_symbol_print (stderr,
|
2024-03-25 23:32:23 +08:00
|
|
|
YY_ACCESSING_SYMBOL (+yyssp[yyi + 1 - yynrhs]),
|
|
|
|
&yyvsp[(yyi + 1) - (yynrhs)]);
|
2020-07-30 07:59:19 +08:00
|
|
|
YYFPRINTF (stderr, "\n");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
# define YY_REDUCE_PRINT(Rule) \
|
|
|
|
do { \
|
|
|
|
if (yydebug) \
|
|
|
|
yy_reduce_print (yyssp, yyvsp, Rule); \
|
|
|
|
} while (0)
|
|
|
|
|
|
|
|
/* Nonzero means print parse trace. It is left uninitialized so that
|
|
|
|
multiple parsers can coexist. */
|
|
|
|
int yydebug;
|
|
|
|
#else /* !YYDEBUG */
|
2024-03-25 23:32:23 +08:00
|
|
|
# define YYDPRINTF(Args) ((void) 0)
|
|
|
|
# define YY_SYMBOL_PRINT(Title, Kind, Value, Location)
|
2020-07-30 07:59:19 +08:00
|
|
|
# define YY_STACK_PRINT(Bottom, Top)
|
|
|
|
# define YY_REDUCE_PRINT(Rule)
|
|
|
|
#endif /* !YYDEBUG */
|
|
|
|
|
|
|
|
|
|
|
|
/* YYINITDEPTH -- initial size of the parser's stacks. */
|
|
|
|
#ifndef YYINITDEPTH
|
|
|
|
# define YYINITDEPTH 200
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only
|
|
|
|
if the built-in stack extension method is used).
|
|
|
|
|
|
|
|
Do not make this value too large; the results are undefined if
|
|
|
|
YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH)
|
|
|
|
evaluated with infinite-precision integer arithmetic. */
|
|
|
|
|
|
|
|
#ifndef YYMAXDEPTH
|
|
|
|
# define YYMAXDEPTH 10000
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*-----------------------------------------------.
|
|
|
|
| Release the memory associated to this symbol. |
|
|
|
|
`-----------------------------------------------*/
|
|
|
|
|
|
|
|
static void
|
2024-03-25 23:32:23 +08:00
|
|
|
yydestruct (const char *yymsg,
|
|
|
|
yysymbol_kind_t yykind, YYSTYPE *yyvaluep)
|
2020-07-30 07:59:19 +08:00
|
|
|
{
|
2024-03-25 23:32:23 +08:00
|
|
|
YY_USE (yyvaluep);
|
2020-07-30 07:59:19 +08:00
|
|
|
if (!yymsg)
|
|
|
|
yymsg = "Deleting";
|
2024-03-25 23:32:23 +08:00
|
|
|
YY_SYMBOL_PRINT (yymsg, yykind, yyvaluep, yylocationp);
|
2020-07-30 07:59:19 +08:00
|
|
|
|
|
|
|
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
|
2024-03-25 23:32:23 +08:00
|
|
|
YY_USE (yykind);
|
2020-07-30 07:59:19 +08:00
|
|
|
YY_IGNORE_MAYBE_UNINITIALIZED_END
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
/* Lookahead token kind. */
|
2020-07-30 07:59:19 +08:00
|
|
|
int yychar;
|
|
|
|
|
|
|
|
/* The semantic value of the lookahead symbol. */
|
|
|
|
YYSTYPE yylval;
|
|
|
|
/* Number of syntax errors so far. */
|
|
|
|
int yynerrs;
|
|
|
|
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
|
|
|
|
|
2020-07-30 07:59:19 +08:00
|
|
|
/*----------.
|
|
|
|
| yyparse. |
|
|
|
|
`----------*/
|
|
|
|
|
|
|
|
int
|
|
|
|
yyparse (void)
|
|
|
|
{
|
2024-03-25 23:32:23 +08:00
|
|
|
yy_state_fast_t yystate = 0;
|
2020-07-30 07:59:19 +08:00
|
|
|
/* Number of tokens to shift before error messages enabled. */
|
2024-03-25 23:32:23 +08:00
|
|
|
int yyerrstatus = 0;
|
2020-07-30 07:59:19 +08:00
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
/* Refer to the stacks through separate pointers, to allow yyoverflow
|
Fix various problem around VLEN's
re: https://github.com/Unidata/netcdf-c/issues/541
re: https://github.com/Unidata/netcdf-c/issues/1208
re: https://github.com/Unidata/netcdf-c/issues/2078
re: https://github.com/Unidata/netcdf-c/issues/2041
re: https://github.com/Unidata/netcdf-c/issues/2143
For a long time, there have been known problems with the
management of complex types containing VLENs. This also
involves the string type because it is stored as a VLEN of
chars.
This PR (mostly) fixes this problem. But note that it adds new
functions to netcdf.h (see below) and this may require bumping
the .so number. These new functions can be removed, if desired,
in favor of functions in netcdf_aux.h, but netcdf.h seems the
better place for them because they are intended as alternatives
to the nc_free_vlen and nc_free_string functions already in
netcdf.h.
The term complex type refers to any type that directly or
transitively references a VLEN type. So an array of VLENS, a
compound with a VLEN field, and so on.
In order to properly handle instances of these complex types, it
is necessary to have function that can recursively walk
instances of such types to perform various actions on them. The
term "deep" is also used to mean recursive.
At the moment, the two operations needed by the netcdf library are:
* free'ing an instance of the complex type
* copying an instance of the complex type.
The current library does only shallow free and shallow copy of
complex types. This means that only the top level is properly
free'd or copied, but deep internal blocks in the instance are
not touched.
Note that the term "vector" will be used to mean a contiguous (in
memory) sequence of instances of some type. Given an array with,
say, dimensions 2 X 3 X 4, this will be stored in memory as a
vector of length 2*3*4=24 instances.
The use cases are primarily these.
## nc_get_vars
Suppose one is reading a vector of instances using nc_get_vars
(or nc_get_vara or nc_get_var, etc.). These functions will
return the vector in the top-level memory provided. All
interior blocks (form nested VLEN or strings) will have been
dynamically allocated.
After using this vector of instances, it is necessary to free
(aka reclaim) the dynamically allocated memory, otherwise a
memory leak occurs. So, the recursive reclaim function is used
to walk the returned instance vector and do a deep reclaim of
the data.
Currently functions are defined in netcdf.h that are supposed to
handle this: nc_free_vlen(), nc_free_vlens(), and
nc_free_string(). Unfortunately, these functions only do a
shallow free, so deeply nested instances are not properly
handled by them.
Note that internally, the provided data is immediately written so
there is no need to copy it. But the caller may need to reclaim the
data it passed into the function.
## nc_put_att
Suppose one is writing a vector of instances as the data of an attribute
using, say, nc_put_att.
Internally, the incoming attribute data must be copied and stored
so that changes/reclamation of the input data will not affect
the attribute.
Again, the code inside the netcdf library does only shallow copying
rather than deep copy. As a result, one sees effects such as described
in Github Issue https://github.com/Unidata/netcdf-c/issues/2143.
Also, after defining the attribute, it may be necessary for the user
to free the data that was provided as input to nc_put_att().
## nc_get_att
Suppose one is reading a vector of instances as the data of an attribute
using, say, nc_get_att.
Internally, the existing attribute data must be copied and returned
to the caller, and the caller is responsible for reclaiming
the returned data.
Again, the code inside the netcdf library does only shallow copying
rather than deep copy. So this can lead to memory leaks and errors
because the deep data is shared between the library and the user.
# Solution
The solution is to build properly recursive reclaim and copy
functions and use those as needed.
These recursive functions are defined in libdispatch/dinstance.c
and their signatures are defined in include/netcdf.h.
For back compatibility, corresponding "ncaux_XXX" functions
are defined in include/netcdf_aux.h.
````
int nc_reclaim_data(int ncid, nc_type xtypeid, void* memory, size_t count);
int nc_reclaim_data_all(int ncid, nc_type xtypeid, void* memory, size_t count);
int nc_copy_data(int ncid, nc_type xtypeid, const void* memory, size_t count, void* copy);
int nc_copy_data_all(int ncid, nc_type xtypeid, const void* memory, size_t count, void** copyp);
````
There are two variants. The first two, nc_reclaim_data() and
nc_copy_data(), assume the top-level vector is managed by the
caller. For reclaim, this is so the user can use, for example, a
statically allocated vector. For copy, it assumes the user
provides the space into which the copy is stored.
The second two, nc_reclaim_data_all() and
nc_copy_data_all(), allows the functions to manage the
top-level. So for nc_reclaim_data_all, the top level is
assumed to be dynamically allocated and will be free'd by
nc_reclaim_data_all(). The nc_copy_data_all() function
will allocate the top level and return a pointer to it to the
user. The user can later pass that pointer to
nc_reclaim_data_all() to reclaim the instance(s).
# Internal Changes
The netcdf-c library internals are changed to use the proper
reclaim and copy functions. It turns out that the places where
these functions are needed is quite pervasive in the netcdf-c
library code. Using these functions also allows some
simplification of the code since the stdata and vldata fields of
NC_ATT_INFO are no longer needed. Currently this is commented
out using the SEPDATA \#define macro. When any bugs are largely
fixed, all this code will be removed.
# Known Bugs
1. There is still one known failure that has not been solved.
All the failures revolve around some variant of this .cdl file.
The proximate cause of failure is the use of a VLEN FillValue.
````
netcdf x {
types:
float(*) row_of_floats ;
dimensions:
m = 5 ;
variables:
row_of_floats ragged_array(m) ;
row_of_floats ragged_array:_FillValue = {-999} ;
data:
ragged_array = {10, 11, 12, 13, 14}, {20, 21, 22, 23}, {30, 31, 32},
{40, 41}, _ ;
}
````
When a solution is found, I will either add it to this PR or post a new PR.
# Related Changes
* Mark nc_free_vlen(s) as deprecated in favor of ncaux_reclaim_data.
* Remove the --enable-unfixed-memory-leaks option.
* Remove the NC_VLENS_NOTEST code that suppresses some vlen tests.
* Document this change in docs/internal.md
* Disable the tst_vlen_data test in ncdump/tst_nccopy4.sh.
* Mark types as fixed size or not (transitively) to optimize the reclaim
and copy functions.
# Misc. Changes
* Make Doxygen process libdispatch/daux.c
* Make sure the NC_ATT_INFO_T.container field is set.
2022-01-09 09:30:00 +08:00
|
|
|
to reallocate them elsewhere. */
|
2020-07-30 07:59:19 +08:00
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
/* Their size. */
|
|
|
|
YYPTRDIFF_T yystacksize = YYINITDEPTH;
|
2020-07-30 07:59:19 +08:00
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
/* The state stack: array, bottom, top. */
|
|
|
|
yy_state_t yyssa[YYINITDEPTH];
|
|
|
|
yy_state_t *yyss = yyssa;
|
|
|
|
yy_state_t *yyssp = yyss;
|
Fix various problem around VLEN's
re: https://github.com/Unidata/netcdf-c/issues/541
re: https://github.com/Unidata/netcdf-c/issues/1208
re: https://github.com/Unidata/netcdf-c/issues/2078
re: https://github.com/Unidata/netcdf-c/issues/2041
re: https://github.com/Unidata/netcdf-c/issues/2143
For a long time, there have been known problems with the
management of complex types containing VLENs. This also
involves the string type because it is stored as a VLEN of
chars.
This PR (mostly) fixes this problem. But note that it adds new
functions to netcdf.h (see below) and this may require bumping
the .so number. These new functions can be removed, if desired,
in favor of functions in netcdf_aux.h, but netcdf.h seems the
better place for them because they are intended as alternatives
to the nc_free_vlen and nc_free_string functions already in
netcdf.h.
The term complex type refers to any type that directly or
transitively references a VLEN type. So an array of VLENS, a
compound with a VLEN field, and so on.
In order to properly handle instances of these complex types, it
is necessary to have function that can recursively walk
instances of such types to perform various actions on them. The
term "deep" is also used to mean recursive.
At the moment, the two operations needed by the netcdf library are:
* free'ing an instance of the complex type
* copying an instance of the complex type.
The current library does only shallow free and shallow copy of
complex types. This means that only the top level is properly
free'd or copied, but deep internal blocks in the instance are
not touched.
Note that the term "vector" will be used to mean a contiguous (in
memory) sequence of instances of some type. Given an array with,
say, dimensions 2 X 3 X 4, this will be stored in memory as a
vector of length 2*3*4=24 instances.
The use cases are primarily these.
## nc_get_vars
Suppose one is reading a vector of instances using nc_get_vars
(or nc_get_vara or nc_get_var, etc.). These functions will
return the vector in the top-level memory provided. All
interior blocks (form nested VLEN or strings) will have been
dynamically allocated.
After using this vector of instances, it is necessary to free
(aka reclaim) the dynamically allocated memory, otherwise a
memory leak occurs. So, the recursive reclaim function is used
to walk the returned instance vector and do a deep reclaim of
the data.
Currently functions are defined in netcdf.h that are supposed to
handle this: nc_free_vlen(), nc_free_vlens(), and
nc_free_string(). Unfortunately, these functions only do a
shallow free, so deeply nested instances are not properly
handled by them.
Note that internally, the provided data is immediately written so
there is no need to copy it. But the caller may need to reclaim the
data it passed into the function.
## nc_put_att
Suppose one is writing a vector of instances as the data of an attribute
using, say, nc_put_att.
Internally, the incoming attribute data must be copied and stored
so that changes/reclamation of the input data will not affect
the attribute.
Again, the code inside the netcdf library does only shallow copying
rather than deep copy. As a result, one sees effects such as described
in Github Issue https://github.com/Unidata/netcdf-c/issues/2143.
Also, after defining the attribute, it may be necessary for the user
to free the data that was provided as input to nc_put_att().
## nc_get_att
Suppose one is reading a vector of instances as the data of an attribute
using, say, nc_get_att.
Internally, the existing attribute data must be copied and returned
to the caller, and the caller is responsible for reclaiming
the returned data.
Again, the code inside the netcdf library does only shallow copying
rather than deep copy. So this can lead to memory leaks and errors
because the deep data is shared between the library and the user.
# Solution
The solution is to build properly recursive reclaim and copy
functions and use those as needed.
These recursive functions are defined in libdispatch/dinstance.c
and their signatures are defined in include/netcdf.h.
For back compatibility, corresponding "ncaux_XXX" functions
are defined in include/netcdf_aux.h.
````
int nc_reclaim_data(int ncid, nc_type xtypeid, void* memory, size_t count);
int nc_reclaim_data_all(int ncid, nc_type xtypeid, void* memory, size_t count);
int nc_copy_data(int ncid, nc_type xtypeid, const void* memory, size_t count, void* copy);
int nc_copy_data_all(int ncid, nc_type xtypeid, const void* memory, size_t count, void** copyp);
````
There are two variants. The first two, nc_reclaim_data() and
nc_copy_data(), assume the top-level vector is managed by the
caller. For reclaim, this is so the user can use, for example, a
statically allocated vector. For copy, it assumes the user
provides the space into which the copy is stored.
The second two, nc_reclaim_data_all() and
nc_copy_data_all(), allows the functions to manage the
top-level. So for nc_reclaim_data_all, the top level is
assumed to be dynamically allocated and will be free'd by
nc_reclaim_data_all(). The nc_copy_data_all() function
will allocate the top level and return a pointer to it to the
user. The user can later pass that pointer to
nc_reclaim_data_all() to reclaim the instance(s).
# Internal Changes
The netcdf-c library internals are changed to use the proper
reclaim and copy functions. It turns out that the places where
these functions are needed is quite pervasive in the netcdf-c
library code. Using these functions also allows some
simplification of the code since the stdata and vldata fields of
NC_ATT_INFO are no longer needed. Currently this is commented
out using the SEPDATA \#define macro. When any bugs are largely
fixed, all this code will be removed.
# Known Bugs
1. There is still one known failure that has not been solved.
All the failures revolve around some variant of this .cdl file.
The proximate cause of failure is the use of a VLEN FillValue.
````
netcdf x {
types:
float(*) row_of_floats ;
dimensions:
m = 5 ;
variables:
row_of_floats ragged_array(m) ;
row_of_floats ragged_array:_FillValue = {-999} ;
data:
ragged_array = {10, 11, 12, 13, 14}, {20, 21, 22, 23}, {30, 31, 32},
{40, 41}, _ ;
}
````
When a solution is found, I will either add it to this PR or post a new PR.
# Related Changes
* Mark nc_free_vlen(s) as deprecated in favor of ncaux_reclaim_data.
* Remove the --enable-unfixed-memory-leaks option.
* Remove the NC_VLENS_NOTEST code that suppresses some vlen tests.
* Document this change in docs/internal.md
* Disable the tst_vlen_data test in ncdump/tst_nccopy4.sh.
* Mark types as fixed size or not (transitively) to optimize the reclaim
and copy functions.
# Misc. Changes
* Make Doxygen process libdispatch/daux.c
* Make sure the NC_ATT_INFO_T.container field is set.
2022-01-09 09:30:00 +08:00
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
/* The semantic value stack: array, bottom, top. */
|
|
|
|
YYSTYPE yyvsa[YYINITDEPTH];
|
|
|
|
YYSTYPE *yyvs = yyvsa;
|
|
|
|
YYSTYPE *yyvsp = yyvs;
|
2020-07-30 07:59:19 +08:00
|
|
|
|
|
|
|
int yyn;
|
2024-03-25 23:32:23 +08:00
|
|
|
/* The return value of yyparse. */
|
2020-07-30 07:59:19 +08:00
|
|
|
int yyresult;
|
2024-03-25 23:32:23 +08:00
|
|
|
/* Lookahead symbol kind. */
|
|
|
|
yysymbol_kind_t yytoken = YYSYMBOL_YYEMPTY;
|
2020-07-30 07:59:19 +08:00
|
|
|
/* The variables used to return semantic value and location from the
|
|
|
|
action routines. */
|
|
|
|
YYSTYPE yyval;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
|
2020-07-30 07:59:19 +08:00
|
|
|
|
|
|
|
#define YYPOPSTACK(N) (yyvsp -= (N), yyssp -= (N))
|
|
|
|
|
|
|
|
/* The number of symbols on the RHS of the reduced rule.
|
|
|
|
Keep to zero when no symbol should be popped. */
|
|
|
|
int yylen = 0;
|
|
|
|
|
|
|
|
YYDPRINTF ((stderr, "Starting parse\n"));
|
|
|
|
|
|
|
|
yychar = YYEMPTY; /* Cause a token to be read. */
|
2024-03-25 23:32:23 +08:00
|
|
|
|
2020-07-30 07:59:19 +08:00
|
|
|
goto yysetstate;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
|
2020-07-30 07:59:19 +08:00
|
|
|
/*------------------------------------------------------------.
|
2024-03-25 23:32:23 +08:00
|
|
|
| yynewstate -- push a new state, which is found in yystate. |
|
2020-07-30 07:59:19 +08:00
|
|
|
`------------------------------------------------------------*/
|
2024-03-25 23:32:23 +08:00
|
|
|
yynewstate:
|
2020-07-30 07:59:19 +08:00
|
|
|
/* In all cases, when you get here, the value and location stacks
|
|
|
|
have just been pushed. So pushing a state here evens the stacks. */
|
|
|
|
yyssp++;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
|
|
|
|
/*--------------------------------------------------------------------.
|
|
|
|
| yysetstate -- set current state (the top of the stack) to yystate. |
|
|
|
|
`--------------------------------------------------------------------*/
|
|
|
|
yysetstate:
|
|
|
|
YYDPRINTF ((stderr, "Entering state %d\n", yystate));
|
|
|
|
YY_ASSERT (0 <= yystate && yystate < YYNSTATES);
|
|
|
|
YY_IGNORE_USELESS_CAST_BEGIN
|
|
|
|
*yyssp = YY_CAST (yy_state_t, yystate);
|
|
|
|
YY_IGNORE_USELESS_CAST_END
|
|
|
|
YY_STACK_PRINT (yyss, yyssp);
|
2020-07-30 07:59:19 +08:00
|
|
|
|
|
|
|
if (yyss + yystacksize - 1 <= yyssp)
|
2024-03-25 23:32:23 +08:00
|
|
|
#if !defined yyoverflow && !defined YYSTACK_RELOCATE
|
|
|
|
YYNOMEM;
|
|
|
|
#else
|
2020-07-30 07:59:19 +08:00
|
|
|
{
|
|
|
|
/* Get the current used size of the three stacks, in elements. */
|
2024-03-25 23:32:23 +08:00
|
|
|
YYPTRDIFF_T yysize = yyssp - yyss + 1;
|
2020-07-30 07:59:19 +08:00
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
# if defined yyoverflow
|
2020-07-30 07:59:19 +08:00
|
|
|
{
|
|
|
|
/* Give user a chance to reallocate the stack. Use copies of
|
|
|
|
these so that the &'s don't force the real ones into
|
|
|
|
memory. */
|
2024-03-25 23:32:23 +08:00
|
|
|
yy_state_t *yyss1 = yyss;
|
2020-07-30 07:59:19 +08:00
|
|
|
YYSTYPE *yyvs1 = yyvs;
|
|
|
|
|
|
|
|
/* Each stack pointer address is followed by the size of the
|
|
|
|
data in use in that stack, in bytes. This used to be a
|
|
|
|
conditional around just the two extra args, but that might
|
|
|
|
be undefined if yyoverflow is a macro. */
|
|
|
|
yyoverflow (YY_("memory exhausted"),
|
2024-03-25 23:32:23 +08:00
|
|
|
&yyss1, yysize * YYSIZEOF (*yyssp),
|
|
|
|
&yyvs1, yysize * YYSIZEOF (*yyvsp),
|
2020-07-30 07:59:19 +08:00
|
|
|
&yystacksize);
|
|
|
|
yyss = yyss1;
|
|
|
|
yyvs = yyvs1;
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
# else /* defined YYSTACK_RELOCATE */
|
2020-07-30 07:59:19 +08:00
|
|
|
/* Extend the stack our own way. */
|
|
|
|
if (YYMAXDEPTH <= yystacksize)
|
2024-03-25 23:32:23 +08:00
|
|
|
YYNOMEM;
|
2020-07-30 07:59:19 +08:00
|
|
|
yystacksize *= 2;
|
|
|
|
if (YYMAXDEPTH < yystacksize)
|
|
|
|
yystacksize = YYMAXDEPTH;
|
|
|
|
|
|
|
|
{
|
2024-03-25 23:32:23 +08:00
|
|
|
yy_state_t *yyss1 = yyss;
|
2020-07-30 07:59:19 +08:00
|
|
|
union yyalloc *yyptr =
|
2024-03-25 23:32:23 +08:00
|
|
|
YY_CAST (union yyalloc *,
|
|
|
|
YYSTACK_ALLOC (YY_CAST (YYSIZE_T, YYSTACK_BYTES (yystacksize))));
|
2020-07-30 07:59:19 +08:00
|
|
|
if (! yyptr)
|
2024-03-25 23:32:23 +08:00
|
|
|
YYNOMEM;
|
2020-07-30 07:59:19 +08:00
|
|
|
YYSTACK_RELOCATE (yyss_alloc, yyss);
|
|
|
|
YYSTACK_RELOCATE (yyvs_alloc, yyvs);
|
|
|
|
# undef YYSTACK_RELOCATE
|
|
|
|
if (yyss1 != yyssa)
|
|
|
|
YYSTACK_FREE (yyss1);
|
|
|
|
}
|
|
|
|
# endif
|
|
|
|
|
|
|
|
yyssp = yyss + yysize - 1;
|
|
|
|
yyvsp = yyvs + yysize - 1;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
YY_IGNORE_USELESS_CAST_BEGIN
|
|
|
|
YYDPRINTF ((stderr, "Stack size increased to %ld\n",
|
|
|
|
YY_CAST (long, yystacksize)));
|
|
|
|
YY_IGNORE_USELESS_CAST_END
|
2020-07-30 07:59:19 +08:00
|
|
|
|
|
|
|
if (yyss + yystacksize - 1 <= yyssp)
|
|
|
|
YYABORT;
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
#endif /* !defined yyoverflow && !defined YYSTACK_RELOCATE */
|
2020-07-30 07:59:19 +08:00
|
|
|
|
2021-12-24 13:18:56 +08:00
|
|
|
|
2020-07-30 07:59:19 +08:00
|
|
|
if (yystate == YYFINAL)
|
|
|
|
YYACCEPT;
|
|
|
|
|
|
|
|
goto yybackup;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
|
2020-07-30 07:59:19 +08:00
|
|
|
/*-----------.
|
|
|
|
| yybackup. |
|
|
|
|
`-----------*/
|
|
|
|
yybackup:
|
|
|
|
/* Do appropriate processing given the current state. Read a
|
|
|
|
lookahead token if we need one and don't already have one. */
|
|
|
|
|
|
|
|
/* First try to decide what to do without reference to lookahead token. */
|
|
|
|
yyn = yypact[yystate];
|
|
|
|
if (yypact_value_is_default (yyn))
|
|
|
|
goto yydefault;
|
|
|
|
|
|
|
|
/* Not known => get a lookahead token if don't already have one. */
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
/* YYCHAR is either empty, or end-of-input, or a valid lookahead. */
|
2020-07-30 07:59:19 +08:00
|
|
|
if (yychar == YYEMPTY)
|
|
|
|
{
|
2024-03-25 23:32:23 +08:00
|
|
|
YYDPRINTF ((stderr, "Reading a token\n"));
|
2020-07-30 07:59:19 +08:00
|
|
|
yychar = yylex ();
|
|
|
|
}
|
|
|
|
|
|
|
|
if (yychar <= YYEOF)
|
|
|
|
{
|
2024-03-25 23:32:23 +08:00
|
|
|
yychar = YYEOF;
|
|
|
|
yytoken = YYSYMBOL_YYEOF;
|
2020-07-30 07:59:19 +08:00
|
|
|
YYDPRINTF ((stderr, "Now at end of input.\n"));
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
else if (yychar == YYerror)
|
|
|
|
{
|
|
|
|
/* The scanner already issued an error message, process directly
|
|
|
|
to error recovery. But do not keep the error token as
|
|
|
|
lookahead, it is too special and may lead us to an endless
|
|
|
|
loop in error recovery. */
|
|
|
|
yychar = YYUNDEF;
|
|
|
|
yytoken = YYSYMBOL_YYerror;
|
|
|
|
goto yyerrlab1;
|
|
|
|
}
|
2020-07-30 07:59:19 +08:00
|
|
|
else
|
|
|
|
{
|
|
|
|
yytoken = YYTRANSLATE (yychar);
|
|
|
|
YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* If the proper action on seeing token YYTOKEN is to reduce or to
|
|
|
|
detect an error, take that action. */
|
|
|
|
yyn += yytoken;
|
|
|
|
if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken)
|
|
|
|
goto yydefault;
|
|
|
|
yyn = yytable[yyn];
|
|
|
|
if (yyn <= 0)
|
|
|
|
{
|
|
|
|
if (yytable_value_is_error (yyn))
|
|
|
|
goto yyerrlab;
|
|
|
|
yyn = -yyn;
|
|
|
|
goto yyreduce;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Count tokens shifted since error; after three, turn off error
|
|
|
|
status. */
|
|
|
|
if (yyerrstatus)
|
|
|
|
yyerrstatus--;
|
|
|
|
|
|
|
|
/* Shift the lookahead token. */
|
|
|
|
YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc);
|
|
|
|
yystate = yyn;
|
|
|
|
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
|
|
|
|
*++yyvsp = yylval;
|
|
|
|
YY_IGNORE_MAYBE_UNINITIALIZED_END
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
/* Discard the shifted token. */
|
|
|
|
yychar = YYEMPTY;
|
2020-07-30 07:59:19 +08:00
|
|
|
goto yynewstate;
|
|
|
|
|
|
|
|
|
|
|
|
/*-----------------------------------------------------------.
|
|
|
|
| yydefault -- do the default action for the current state. |
|
|
|
|
`-----------------------------------------------------------*/
|
|
|
|
yydefault:
|
|
|
|
yyn = yydefact[yystate];
|
|
|
|
if (yyn == 0)
|
|
|
|
goto yyerrlab;
|
|
|
|
goto yyreduce;
|
|
|
|
|
|
|
|
|
|
|
|
/*-----------------------------.
|
2024-03-25 23:32:23 +08:00
|
|
|
| yyreduce -- do a reduction. |
|
2020-07-30 07:59:19 +08:00
|
|
|
`-----------------------------*/
|
|
|
|
yyreduce:
|
|
|
|
/* yyn is the number of a rule to reduce with. */
|
|
|
|
yylen = yyr2[yyn];
|
|
|
|
|
|
|
|
/* If YYLEN is nonzero, implement the default value of the action:
|
|
|
|
'$$ = $1'.
|
|
|
|
|
|
|
|
Otherwise, the following line sets YYVAL to garbage.
|
|
|
|
This behavior is undocumented and Bison
|
|
|
|
users should not rely upon it. Assigning to YYVAL
|
|
|
|
unconditionally makes the parser a bit smaller, and it avoids a
|
|
|
|
GCC warning that YYVAL may be used uninitialized. */
|
|
|
|
yyval = yyvsp[1-yylen];
|
|
|
|
|
|
|
|
|
|
|
|
YY_REDUCE_PRINT (yyn);
|
|
|
|
switch (yyn)
|
|
|
|
{
|
2024-03-25 23:32:23 +08:00
|
|
|
case 2: /* $@1: %empty */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 117 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{ init_netcdf(); }
|
|
|
|
#line 1287 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 3: /* $@2: %empty */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 120 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{
|
2020-07-30 07:59:19 +08:00
|
|
|
if (derror_count == 0)
|
|
|
|
define_netcdf(netcdfname);
|
|
|
|
if (derror_count > 0)
|
|
|
|
exit(6);
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
#line 1298 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 4: /* ncdesc: NETCDF '{' $@1 dimsection vasection $@2 datasection '}' */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 128 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{
|
2020-07-30 07:59:19 +08:00
|
|
|
if (derror_count == 0)
|
|
|
|
close_netcdf();
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
#line 1307 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 11: /* dimdecl: dimd '=' INT_CONST */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 143 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{ if (int_val <= 0)
|
2020-07-30 07:59:19 +08:00
|
|
|
derror("dimension length must be positive");
|
2024-03-25 23:42:34 +08:00
|
|
|
dims[ndims].size = (size_t)int_val;
|
2020-07-30 07:59:19 +08:00
|
|
|
ndims++;
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
#line 1317 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 12: /* dimdecl: dimd '=' DOUBLE_CONST */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 149 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{ /* for rare case where 2^31 < dimsize < 2^32 */
|
2020-07-30 07:59:19 +08:00
|
|
|
if (double_val <= 0)
|
|
|
|
derror("dimension length must be positive");
|
|
|
|
if (double_val > 4294967295.0)
|
|
|
|
derror("dimension too large");
|
|
|
|
if (double_val - (size_t) double_val > 0)
|
|
|
|
derror("dimension length must be an integer");
|
|
|
|
dims[ndims].size = (size_t) double_val;
|
|
|
|
ndims++;
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
#line 1332 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 13: /* dimdecl: dimd '=' NC_UNLIMITED_K */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 160 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{ if (rec_dim != -1)
|
2020-07-30 07:59:19 +08:00
|
|
|
derror("only one NC_UNLIMITED dimension allowed");
|
|
|
|
rec_dim = ndims; /* the unlimited (record) dimension */
|
|
|
|
dims[ndims].size = NC_UNLIMITED;
|
|
|
|
ndims++;
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
#line 1343 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 14: /* dimd: dim */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 168 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{
|
|
|
|
if (yyvsp[0]->is_dim == 1) {
|
2020-07-30 07:59:19 +08:00
|
|
|
derror( "duplicate dimension declaration for %s",
|
2024-03-25 23:32:23 +08:00
|
|
|
yyvsp[0]->name);
|
2020-07-30 07:59:19 +08:00
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
yyvsp[0]->is_dim = 1;
|
|
|
|
yyvsp[0]->dnum = ndims;
|
2020-07-30 07:59:19 +08:00
|
|
|
/* make sure dims array will hold dimensions */
|
|
|
|
grow_darray(ndims, /* must hold ndims+1 dims */
|
|
|
|
&dims); /* grow as needed */
|
2024-03-25 23:32:23 +08:00
|
|
|
dims[ndims].name = (char *) emalloc(strlen(yyvsp[0]->name)+1);
|
|
|
|
(void) strcpy(dims[ndims].name, yyvsp[0]->name);
|
2020-07-30 07:59:19 +08:00
|
|
|
/* name for use in generated Fortran and C variables */
|
2024-03-25 23:32:23 +08:00
|
|
|
dims[ndims].lname = decodify(yyvsp[0]->name);
|
2020-07-30 07:59:19 +08:00
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
#line 1363 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 27: /* type: BYTE_K */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 200 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{ type_code = NC_BYTE; }
|
|
|
|
#line 1369 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 28: /* type: CHAR_K */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 201 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{ type_code = NC_CHAR; }
|
|
|
|
#line 1375 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 29: /* type: SHORT_K */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 202 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{ type_code = NC_SHORT; }
|
|
|
|
#line 1381 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 30: /* type: INT_K */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 203 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{ type_code = NC_INT; }
|
|
|
|
#line 1387 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 31: /* type: FLOAT_K */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 204 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{ type_code = NC_FLOAT; }
|
|
|
|
#line 1393 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 32: /* type: DOUBLE_K */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 205 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{ type_code = NC_DOUBLE; }
|
|
|
|
#line 1399 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 35: /* $@3: %empty */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 211 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{
|
2020-07-30 07:59:19 +08:00
|
|
|
static struct vars dummyvar;
|
|
|
|
|
|
|
|
dummyvar.name = "dummy";
|
|
|
|
dummyvar.type = NC_DOUBLE;
|
|
|
|
dummyvar.ndims = 0;
|
|
|
|
dummyvar.dims = 0;
|
|
|
|
dummyvar.fill_value.doublev = NC_FILL_DOUBLE;
|
|
|
|
dummyvar.has_data = 0;
|
|
|
|
|
|
|
|
nvdims = 0;
|
|
|
|
/* make sure variable not re-declared */
|
2024-03-25 23:32:23 +08:00
|
|
|
if (yyvsp[0]->is_var == 1) {
|
2020-07-30 07:59:19 +08:00
|
|
|
derror( "duplicate variable declaration for %s",
|
2024-03-25 23:32:23 +08:00
|
|
|
yyvsp[0]->name);
|
2020-07-30 07:59:19 +08:00
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
yyvsp[0]->is_var = 1;
|
|
|
|
yyvsp[0]->vnum = nvars;
|
2020-07-30 07:59:19 +08:00
|
|
|
/* make sure vars array will hold variables */
|
|
|
|
grow_varray(nvars, /* must hold nvars+1 vars */
|
|
|
|
&vars); /* grow as needed */
|
|
|
|
vars[nvars] = dummyvar; /* to make Purify happy */
|
2024-03-25 23:32:23 +08:00
|
|
|
vars[nvars].name = (char *) emalloc(strlen(yyvsp[0]->name)+1);
|
|
|
|
(void) strcpy(vars[nvars].name, yyvsp[0]->name);
|
2020-07-30 07:59:19 +08:00
|
|
|
/* name for use in generated Fortran and C variables */
|
2024-03-25 23:32:23 +08:00
|
|
|
vars[nvars].lname = decodify(yyvsp[0]->name);
|
2020-07-30 07:59:19 +08:00
|
|
|
vars[nvars].type = type_code;
|
|
|
|
/* set default fill value. You can override this with
|
|
|
|
* the variable attribute "_FillValue". */
|
|
|
|
nc_getfill(type_code, &vars[nvars].fill_value);
|
|
|
|
vars[nvars].has_data = 0; /* has no data (yet) */
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
#line 1436 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 36: /* varspec: var $@3 dimspec */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 244 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{
|
2020-07-30 07:59:19 +08:00
|
|
|
vars[nvars].ndims = nvdims;
|
|
|
|
nvars++;
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
#line 1445 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 42: /* vdim: dim */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 258 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{
|
2020-07-30 07:59:19 +08:00
|
|
|
if (nvdims >= NC_MAX_VAR_DIMS) {
|
|
|
|
derror("%s has too many dimensions",vars[nvars].name);
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
if (yyvsp[0]->is_dim == 1)
|
|
|
|
dimnum = yyvsp[0]->dnum;
|
2020-07-30 07:59:19 +08:00
|
|
|
else {
|
|
|
|
derror( "%s is not declared as a dimension",
|
2024-03-25 23:32:23 +08:00
|
|
|
yyvsp[0]->name);
|
2020-07-30 07:59:19 +08:00
|
|
|
dimnum = ndims;
|
|
|
|
}
|
|
|
|
if (rec_dim != -1 && dimnum == rec_dim && nvdims != 0) {
|
|
|
|
derror("unlimited dimension must be first");
|
|
|
|
}
|
|
|
|
grow_iarray(nvdims, /* must hold nvdims+1 ints */
|
|
|
|
&vars[nvars].dims); /* grow as needed */
|
|
|
|
vars[nvars].dims[nvdims] = dimnum;
|
|
|
|
nvdims++;
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
#line 1469 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 43: /* $@4: %empty */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 279 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{
|
2020-07-30 07:59:19 +08:00
|
|
|
defatt();
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
#line 1477 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 44: /* attdecl: att $@4 '=' attvallist */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 283 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{
|
2020-07-30 07:59:19 +08:00
|
|
|
equalatt();
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
#line 1485 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 45: /* $@5: %empty */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 288 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{
|
2020-07-30 07:59:19 +08:00
|
|
|
defatt();
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
#line 1493 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 46: /* gattdecl: gatt $@5 '=' attvallist */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 292 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{
|
2020-07-30 07:59:19 +08:00
|
|
|
equalatt();
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
#line 1501 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 48: /* gatt: ':' attr */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 300 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{
|
2020-07-30 07:59:19 +08:00
|
|
|
varnum = NC_GLOBAL; /* handle of "global" attribute */
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
#line 1509 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 49: /* avar: var */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 306 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{ if (yyvsp[0]->is_var == 1)
|
|
|
|
varnum = yyvsp[0]->vnum;
|
2020-07-30 07:59:19 +08:00
|
|
|
else {
|
|
|
|
derror("%s not declared as a variable, fatal error",
|
2024-03-25 23:32:23 +08:00
|
|
|
yyvsp[0]->name);
|
2020-07-30 07:59:19 +08:00
|
|
|
YYABORT;
|
|
|
|
}
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
#line 1522 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 50: /* attr: IDENT */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 316 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{
|
2020-07-30 07:59:19 +08:00
|
|
|
/* make sure atts array will hold attributes */
|
|
|
|
grow_aarray(natts, /* must hold natts+1 atts */
|
|
|
|
&atts); /* grow as needed */
|
2024-03-25 23:32:23 +08:00
|
|
|
atts[natts].name = (char *) emalloc(strlen(yyvsp[0]->name)+1);
|
|
|
|
(void) strcpy(atts[natts].name,yyvsp[0]->name);
|
2020-07-30 07:59:19 +08:00
|
|
|
/* name for use in generated Fortran and C variables */
|
2024-03-25 23:32:23 +08:00
|
|
|
atts[natts].lname = decodify(yyvsp[0]->name);
|
2020-07-30 07:59:19 +08:00
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
#line 1536 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 53: /* aconst: attconst */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 330 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{
|
2020-07-30 07:59:19 +08:00
|
|
|
if (valtype == NC_UNSPECIFIED)
|
|
|
|
valtype = atype_code;
|
|
|
|
if (valtype != atype_code)
|
|
|
|
derror("values for attribute must be all of same type");
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
#line 1547 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 54: /* attconst: CHAR_CONST */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 339 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{
|
2020-07-30 07:59:19 +08:00
|
|
|
atype_code = NC_CHAR;
|
|
|
|
*char_valp++ = char_val;
|
|
|
|
valnum++;
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
#line 1557 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 55: /* attconst: TERMSTRING */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 345 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{
|
2020-07-30 07:59:19 +08:00
|
|
|
atype_code = NC_CHAR;
|
|
|
|
{
|
|
|
|
/* don't null-terminate attribute strings */
|
|
|
|
size_t len = strlen(termstring);
|
|
|
|
if (len == 0) /* need null if that's only value */
|
|
|
|
len = 1;
|
|
|
|
(void)strncpy(char_valp,termstring,len);
|
|
|
|
valnum += len;
|
|
|
|
char_valp += len;
|
|
|
|
}
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
#line 1574 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 56: /* attconst: BYTE_CONST */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 358 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{
|
2020-07-30 07:59:19 +08:00
|
|
|
atype_code = NC_BYTE;
|
|
|
|
*byte_valp++ = byte_val;
|
|
|
|
valnum++;
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
#line 1584 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 57: /* attconst: SHORT_CONST */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 364 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{
|
2020-07-30 07:59:19 +08:00
|
|
|
atype_code = NC_SHORT;
|
|
|
|
*short_valp++ = short_val;
|
|
|
|
valnum++;
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
#line 1594 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 58: /* attconst: INT_CONST */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 370 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{
|
2020-07-30 07:59:19 +08:00
|
|
|
atype_code = NC_INT;
|
|
|
|
*int_valp++ = int_val;
|
|
|
|
valnum++;
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
#line 1604 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 59: /* attconst: FLOAT_CONST */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 376 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{
|
2020-07-30 07:59:19 +08:00
|
|
|
atype_code = NC_FLOAT;
|
|
|
|
*float_valp++ = float_val;
|
|
|
|
valnum++;
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
#line 1614 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 60: /* attconst: DOUBLE_CONST */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 382 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{
|
2020-07-30 07:59:19 +08:00
|
|
|
atype_code = NC_DOUBLE;
|
|
|
|
*double_valp++ = double_val;
|
|
|
|
valnum++;
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
#line 1624 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 66: /* $@6: %empty */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 398 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{
|
2020-07-30 07:59:19 +08:00
|
|
|
valtype = vars[varnum].type; /* variable type */
|
|
|
|
valnum = 0; /* values accumulated for variable */
|
|
|
|
vars[varnum].has_data = 1;
|
|
|
|
/* compute dimensions product */
|
|
|
|
var_size = nctypesize(valtype);
|
|
|
|
if (vars[varnum].ndims == 0) { /* scalar */
|
|
|
|
var_len = 1;
|
|
|
|
} else if (vars[varnum].dims[0] == rec_dim) {
|
|
|
|
var_len = 1; /* one record for unlimited vars */
|
|
|
|
} else {
|
|
|
|
var_len = dims[vars[varnum].dims[0]].size;
|
|
|
|
}
|
|
|
|
for(dimnum = 1; dimnum < vars[varnum].ndims; dimnum++)
|
|
|
|
var_len = var_len*dims[vars[varnum].dims[dimnum]].size;
|
|
|
|
/* allocate memory for variable data */
|
|
|
|
if (var_len*var_size != (size_t)(var_len*var_size)) {
|
|
|
|
derror("variable %s too large for memory",
|
|
|
|
vars[varnum].name);
|
|
|
|
exit(9);
|
|
|
|
}
|
|
|
|
rec_len = var_len;
|
|
|
|
rec_start = malloc ((size_t)(rec_len*var_size));
|
|
|
|
if (rec_start == 0) {
|
|
|
|
derror ("out of memory\n");
|
|
|
|
exit(3);
|
|
|
|
}
|
|
|
|
rec_cur = rec_start;
|
|
|
|
switch (valtype) {
|
|
|
|
case NC_CHAR:
|
|
|
|
char_valp = (char *) rec_start;
|
|
|
|
break;
|
|
|
|
case NC_BYTE:
|
|
|
|
byte_valp = (signed char *) rec_start;
|
|
|
|
break;
|
|
|
|
case NC_SHORT:
|
|
|
|
short_valp = (short *) rec_start;
|
|
|
|
break;
|
|
|
|
case NC_INT:
|
|
|
|
int_valp = (int *) rec_start;
|
|
|
|
break;
|
|
|
|
case NC_FLOAT:
|
|
|
|
float_valp = (float *) rec_start;
|
|
|
|
break;
|
|
|
|
case NC_DOUBLE:
|
|
|
|
double_valp = (double *) rec_start;
|
|
|
|
break;
|
|
|
|
default: break;
|
|
|
|
}
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
#line 1679 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 67: /* datadecl: avar $@6 '=' constlist */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 449 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{
|
2020-07-30 07:59:19 +08:00
|
|
|
if (valnum < var_len) { /* leftovers */
|
|
|
|
nc_fill(valtype,
|
|
|
|
var_len - valnum,
|
|
|
|
rec_cur,
|
|
|
|
vars[varnum].fill_value);
|
|
|
|
}
|
|
|
|
/* put out var_len values */
|
|
|
|
/* vars[varnum].nrecs = valnum / rec_len; */
|
|
|
|
vars[varnum].nrecs = var_len / rec_len;
|
|
|
|
if (derror_count == 0)
|
|
|
|
put_variable(rec_start);
|
|
|
|
free ((char *) rec_start);
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
#line 1698 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 70: /* $@7: %empty */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 468 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{
|
2020-07-30 07:59:19 +08:00
|
|
|
if(valnum >= var_len) {
|
|
|
|
if (vars[varnum].dims[0] != rec_dim) { /* not recvar */
|
|
|
|
derror("too many values for this variable, %d >= %d",
|
|
|
|
valnum, var_len);
|
|
|
|
exit (4);
|
|
|
|
} else { /* a record variable, so grow data
|
|
|
|
container and increment var_len by
|
|
|
|
multiple of record size */
|
|
|
|
ptrdiff_t rec_inc = (char *)rec_cur
|
|
|
|
- (char *)rec_start;
|
|
|
|
var_len = rec_len * (1 + valnum / rec_len);
|
|
|
|
rec_start = erealloc(rec_start, var_len*var_size);
|
|
|
|
rec_cur = (char *)rec_start + rec_inc;
|
|
|
|
char_valp = (char *) rec_cur;
|
|
|
|
byte_valp = (signed char *) rec_cur;
|
|
|
|
short_valp = (short *) rec_cur;
|
|
|
|
int_valp = (int *) rec_cur;
|
|
|
|
float_valp = (float *) rec_cur;
|
|
|
|
double_valp = (double *) rec_cur;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
not_a_string = 1;
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
#line 1727 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 71: /* dconst: $@7 const */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 493 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{
|
2020-07-30 07:59:19 +08:00
|
|
|
if (not_a_string) {
|
|
|
|
switch (valtype) {
|
|
|
|
case NC_CHAR:
|
|
|
|
rec_cur = (void *) char_valp;
|
|
|
|
break;
|
|
|
|
case NC_BYTE:
|
|
|
|
rec_cur = (void *) byte_valp;
|
|
|
|
break;
|
|
|
|
case NC_SHORT:
|
|
|
|
rec_cur = (void *) short_valp;
|
|
|
|
break;
|
|
|
|
case NC_INT:
|
|
|
|
rec_cur = (void *) int_valp;
|
|
|
|
break;
|
|
|
|
case NC_FLOAT:
|
|
|
|
rec_cur = (void *) float_valp;
|
|
|
|
break;
|
|
|
|
case NC_DOUBLE:
|
|
|
|
rec_cur = (void *) double_valp;
|
|
|
|
break;
|
|
|
|
default: break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
#line 1757 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 72: /* const: CHAR_CONST */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 521 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{
|
2020-07-30 07:59:19 +08:00
|
|
|
atype_code = NC_CHAR;
|
|
|
|
switch (valtype) {
|
|
|
|
case NC_CHAR:
|
|
|
|
*char_valp++ = char_val;
|
|
|
|
break;
|
|
|
|
case NC_BYTE:
|
|
|
|
*byte_valp++ = char_val;
|
|
|
|
break;
|
|
|
|
case NC_SHORT:
|
|
|
|
*short_valp++ = char_val;
|
|
|
|
break;
|
|
|
|
case NC_INT:
|
|
|
|
*int_valp++ = char_val;
|
|
|
|
break;
|
|
|
|
case NC_FLOAT:
|
|
|
|
*float_valp++ = char_val;
|
|
|
|
break;
|
|
|
|
case NC_DOUBLE:
|
|
|
|
*double_valp++ = char_val;
|
|
|
|
break;
|
|
|
|
default: break;
|
|
|
|
}
|
|
|
|
valnum++;
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
#line 1787 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 73: /* const: TERMSTRING */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 547 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{
|
2020-07-30 07:59:19 +08:00
|
|
|
not_a_string = 0;
|
|
|
|
atype_code = NC_CHAR;
|
|
|
|
{
|
|
|
|
size_t len = strlen(termstring);
|
|
|
|
|
|
|
|
if(valnum + len > var_len) {
|
|
|
|
if (vars[varnum].dims[0] != rec_dim) {
|
|
|
|
derror("too many values for this variable, %d>%d",
|
|
|
|
valnum+len, var_len);
|
|
|
|
exit (5);
|
|
|
|
} else {/* a record variable so grow it */
|
|
|
|
ptrdiff_t rec_inc = (char *)rec_cur
|
|
|
|
- (char *)rec_start;
|
|
|
|
var_len += rec_len * (len + valnum - var_len)/rec_len;
|
|
|
|
rec_start = erealloc(rec_start, var_len*var_size);
|
|
|
|
rec_cur = (char *)rec_start + rec_inc;
|
|
|
|
char_valp = (char *) rec_cur;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
switch (valtype) {
|
|
|
|
case NC_CHAR:
|
|
|
|
{
|
|
|
|
int ld;
|
|
|
|
size_t i, sl;
|
|
|
|
(void)strncpy(char_valp,termstring,len);
|
|
|
|
ld = vars[varnum].ndims-1;
|
|
|
|
if (ld > 0) {/* null-fill to size of last dim */
|
|
|
|
sl = dims[vars[varnum].dims[ld]].size;
|
|
|
|
for (i =len;i<sl;i++)
|
|
|
|
char_valp[i] = '\0';
|
|
|
|
if (sl < len)
|
|
|
|
sl = len;
|
|
|
|
valnum += sl;
|
|
|
|
char_valp += sl;
|
|
|
|
} else { /* scalar or 1D strings */
|
|
|
|
valnum += len;
|
|
|
|
char_valp += len;
|
|
|
|
}
|
|
|
|
rec_cur = (void *) char_valp;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case NC_BYTE:
|
|
|
|
case NC_SHORT:
|
|
|
|
case NC_INT:
|
|
|
|
case NC_FLOAT:
|
|
|
|
case NC_DOUBLE:
|
|
|
|
derror("string value invalid for %s variable",
|
|
|
|
nctype(valtype));
|
|
|
|
break;
|
|
|
|
default: break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
#line 1846 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 74: /* const: BYTE_CONST */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 602 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{
|
2020-07-30 07:59:19 +08:00
|
|
|
atype_code = NC_BYTE;
|
|
|
|
switch (valtype) {
|
|
|
|
case NC_CHAR:
|
|
|
|
*char_valp++ = byte_val;
|
|
|
|
break;
|
|
|
|
case NC_BYTE:
|
|
|
|
*byte_valp++ = byte_val;
|
|
|
|
break;
|
|
|
|
case NC_SHORT:
|
|
|
|
*short_valp++ = byte_val;
|
|
|
|
break;
|
|
|
|
case NC_INT:
|
|
|
|
*int_valp++ = byte_val;
|
|
|
|
break;
|
|
|
|
case NC_FLOAT:
|
|
|
|
*float_valp++ = byte_val;
|
|
|
|
break;
|
|
|
|
case NC_DOUBLE:
|
|
|
|
*double_valp++ = byte_val;
|
|
|
|
break;
|
|
|
|
default: break;
|
|
|
|
}
|
|
|
|
valnum++;
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
#line 1876 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 75: /* const: SHORT_CONST */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 628 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{
|
2020-07-30 07:59:19 +08:00
|
|
|
atype_code = NC_SHORT;
|
|
|
|
switch (valtype) {
|
|
|
|
case NC_CHAR:
|
2024-03-25 23:42:34 +08:00
|
|
|
*char_valp++ = (char)short_val;
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
case NC_BYTE:
|
2024-03-25 23:42:34 +08:00
|
|
|
*byte_valp++ = (signed char)short_val;
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
case NC_SHORT:
|
|
|
|
*short_valp++ = short_val;
|
|
|
|
break;
|
|
|
|
case NC_INT:
|
|
|
|
*int_valp++ = short_val;
|
|
|
|
break;
|
|
|
|
case NC_FLOAT:
|
|
|
|
*float_valp++ = short_val;
|
|
|
|
break;
|
|
|
|
case NC_DOUBLE:
|
|
|
|
*double_valp++ = short_val;
|
|
|
|
break;
|
|
|
|
default: break;
|
|
|
|
}
|
|
|
|
valnum++;
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
#line 1906 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 76: /* const: INT_CONST */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 654 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{
|
2020-07-30 07:59:19 +08:00
|
|
|
atype_code = NC_INT;
|
|
|
|
switch (valtype) {
|
|
|
|
case NC_CHAR:
|
2024-03-25 23:42:34 +08:00
|
|
|
*char_valp++ = (char)int_val;
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
case NC_BYTE:
|
2024-03-25 23:42:34 +08:00
|
|
|
*byte_valp++ = (signed char)int_val;
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
case NC_SHORT:
|
2024-03-25 23:42:34 +08:00
|
|
|
*short_valp++ = (short)int_val;
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
case NC_INT:
|
|
|
|
*int_valp++ = int_val;
|
|
|
|
break;
|
|
|
|
case NC_FLOAT:
|
2024-03-25 23:42:34 +08:00
|
|
|
*float_valp++ = (float)int_val;
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
case NC_DOUBLE:
|
|
|
|
*double_valp++ = int_val;
|
|
|
|
break;
|
|
|
|
default: break;
|
|
|
|
}
|
|
|
|
valnum++;
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
#line 1936 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 77: /* const: FLOAT_CONST */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 680 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{
|
2020-07-30 07:59:19 +08:00
|
|
|
atype_code = NC_FLOAT;
|
|
|
|
switch (valtype) {
|
|
|
|
case NC_CHAR:
|
2024-03-25 23:42:34 +08:00
|
|
|
*char_valp++ = (char)float_val;
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
case NC_BYTE:
|
2024-03-25 23:42:34 +08:00
|
|
|
*byte_valp++ = (signed char)float_val;
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
case NC_SHORT:
|
2024-03-25 23:42:34 +08:00
|
|
|
*short_valp++ = (short)float_val;
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
case NC_INT:
|
2024-03-25 23:42:34 +08:00
|
|
|
*int_valp++ = (int)float_val;
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
case NC_FLOAT:
|
|
|
|
*float_valp++ = float_val;
|
|
|
|
break;
|
|
|
|
case NC_DOUBLE:
|
|
|
|
*double_valp++ = float_val;
|
|
|
|
break;
|
|
|
|
default: break;
|
|
|
|
}
|
|
|
|
valnum++;
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
#line 1966 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 78: /* const: DOUBLE_CONST */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 706 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{
|
2020-07-30 07:59:19 +08:00
|
|
|
atype_code = NC_DOUBLE;
|
|
|
|
switch (valtype) {
|
|
|
|
case NC_CHAR:
|
2024-03-25 23:42:34 +08:00
|
|
|
*char_valp++ = (char)double_val;
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
case NC_BYTE:
|
2024-03-25 23:42:34 +08:00
|
|
|
*byte_valp++ = (signed char)double_val;
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
case NC_SHORT:
|
2024-03-25 23:42:34 +08:00
|
|
|
*short_valp++ = (short)double_val;
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
case NC_INT:
|
2024-03-25 23:42:34 +08:00
|
|
|
*int_valp++ = (int)double_val;
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
case NC_FLOAT:
|
|
|
|
if (double_val == NC_FILL_DOUBLE)
|
|
|
|
*float_valp++ = NC_FILL_FLOAT;
|
|
|
|
else
|
2024-03-25 23:42:34 +08:00
|
|
|
*float_valp++ = (float)double_val;
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
case NC_DOUBLE:
|
|
|
|
*double_valp++ = double_val;
|
|
|
|
break;
|
|
|
|
default: break;
|
|
|
|
}
|
|
|
|
valnum++;
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
#line 1999 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
case 79: /* const: FILLVALUE */
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 735 "ncgen.y"
|
2024-03-25 23:32:23 +08:00
|
|
|
{
|
2020-07-30 07:59:19 +08:00
|
|
|
/* store fill_value */
|
|
|
|
switch (valtype) {
|
|
|
|
case NC_CHAR:
|
|
|
|
nc_fill(valtype, 1, (void *)char_valp++,
|
|
|
|
vars[varnum].fill_value);
|
|
|
|
break;
|
|
|
|
case NC_BYTE:
|
|
|
|
nc_fill(valtype, 1, (void *)byte_valp++,
|
|
|
|
vars[varnum].fill_value);
|
|
|
|
break;
|
|
|
|
case NC_SHORT:
|
|
|
|
nc_fill(valtype, 1, (void *)short_valp++,
|
|
|
|
vars[varnum].fill_value);
|
|
|
|
break;
|
|
|
|
case NC_INT:
|
|
|
|
nc_fill(valtype, 1, (void *)int_valp++,
|
|
|
|
vars[varnum].fill_value);
|
|
|
|
break;
|
|
|
|
case NC_FLOAT:
|
|
|
|
nc_fill(valtype, 1, (void *)float_valp++,
|
|
|
|
vars[varnum].fill_value);
|
|
|
|
break;
|
|
|
|
case NC_DOUBLE:
|
|
|
|
nc_fill(valtype, 1, (void *)double_valp++,
|
|
|
|
vars[varnum].fill_value);
|
|
|
|
break;
|
|
|
|
default: break;
|
|
|
|
}
|
|
|
|
valnum++;
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
#line 2035 "ncgeny.c"
|
2020-07-30 07:59:19 +08:00
|
|
|
break;
|
|
|
|
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
#line 2039 "ncgeny.c"
|
|
|
|
|
2020-07-30 07:59:19 +08:00
|
|
|
default: break;
|
|
|
|
}
|
|
|
|
/* User semantic actions sometimes alter yychar, and that requires
|
|
|
|
that yytoken be updated with the new translation. We take the
|
|
|
|
approach of translating immediately before every use of yytoken.
|
|
|
|
One alternative is translating here after every semantic action,
|
|
|
|
but that translation would be missed if the semantic action invokes
|
|
|
|
YYABORT, YYACCEPT, or YYERROR immediately after altering yychar or
|
|
|
|
if it invokes YYBACKUP. In the case of YYABORT or YYACCEPT, an
|
|
|
|
incorrect destructor might then be invoked immediately. In the
|
|
|
|
case of YYERROR or YYBACKUP, subsequent parser actions might lead
|
|
|
|
to an incorrect destructor call or verbose syntax error message
|
|
|
|
before the lookahead is translated. */
|
2024-03-25 23:32:23 +08:00
|
|
|
YY_SYMBOL_PRINT ("-> $$ =", YY_CAST (yysymbol_kind_t, yyr1[yyn]), &yyval, &yyloc);
|
2020-07-30 07:59:19 +08:00
|
|
|
|
|
|
|
YYPOPSTACK (yylen);
|
|
|
|
yylen = 0;
|
|
|
|
|
|
|
|
*++yyvsp = yyval;
|
|
|
|
|
|
|
|
/* Now 'shift' the result of the reduction. Determine what state
|
|
|
|
that goes to, based on the state we popped back to and the rule
|
|
|
|
number reduced by. */
|
2024-03-25 23:32:23 +08:00
|
|
|
{
|
|
|
|
const int yylhs = yyr1[yyn] - YYNTOKENS;
|
|
|
|
const int yyi = yypgoto[yylhs] + *yyssp;
|
|
|
|
yystate = (0 <= yyi && yyi <= YYLAST && yycheck[yyi] == *yyssp
|
|
|
|
? yytable[yyi]
|
|
|
|
: yydefgoto[yylhs]);
|
|
|
|
}
|
2020-07-30 07:59:19 +08:00
|
|
|
|
|
|
|
goto yynewstate;
|
|
|
|
|
|
|
|
|
|
|
|
/*--------------------------------------.
|
|
|
|
| yyerrlab -- here on detecting error. |
|
|
|
|
`--------------------------------------*/
|
|
|
|
yyerrlab:
|
|
|
|
/* Make sure we have latest lookahead translation. See comments at
|
|
|
|
user semantic actions for why this is necessary. */
|
2024-03-25 23:32:23 +08:00
|
|
|
yytoken = yychar == YYEMPTY ? YYSYMBOL_YYEMPTY : YYTRANSLATE (yychar);
|
2020-07-30 07:59:19 +08:00
|
|
|
/* If not already recovering from an error, report this error. */
|
|
|
|
if (!yyerrstatus)
|
|
|
|
{
|
|
|
|
++yynerrs;
|
|
|
|
yyerror (YY_("syntax error"));
|
|
|
|
}
|
|
|
|
|
|
|
|
if (yyerrstatus == 3)
|
|
|
|
{
|
|
|
|
/* If just tried and failed to reuse lookahead token after an
|
|
|
|
error, discard it. */
|
|
|
|
|
|
|
|
if (yychar <= YYEOF)
|
|
|
|
{
|
|
|
|
/* Return failure if at end of input. */
|
|
|
|
if (yychar == YYEOF)
|
|
|
|
YYABORT;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
yydestruct ("Error: discarding",
|
|
|
|
yytoken, &yylval);
|
|
|
|
yychar = YYEMPTY;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Else will try to reuse lookahead token after shifting the error
|
|
|
|
token. */
|
|
|
|
goto yyerrlab1;
|
|
|
|
|
|
|
|
|
|
|
|
/*---------------------------------------------------.
|
|
|
|
| yyerrorlab -- error raised explicitly by YYERROR. |
|
|
|
|
`---------------------------------------------------*/
|
|
|
|
yyerrorlab:
|
2024-03-25 23:32:23 +08:00
|
|
|
/* Pacify compilers when the user code never invokes YYERROR and the
|
|
|
|
label yyerrorlab therefore never appears in user code. */
|
|
|
|
if (0)
|
|
|
|
YYERROR;
|
|
|
|
++yynerrs;
|
2020-07-30 07:59:19 +08:00
|
|
|
|
|
|
|
/* Do not reclaim the symbols of the rule whose action triggered
|
|
|
|
this YYERROR. */
|
|
|
|
YYPOPSTACK (yylen);
|
|
|
|
yylen = 0;
|
|
|
|
YY_STACK_PRINT (yyss, yyssp);
|
|
|
|
yystate = *yyssp;
|
|
|
|
goto yyerrlab1;
|
|
|
|
|
|
|
|
|
|
|
|
/*-------------------------------------------------------------.
|
|
|
|
| yyerrlab1 -- common code for both syntax error and YYERROR. |
|
|
|
|
`-------------------------------------------------------------*/
|
|
|
|
yyerrlab1:
|
|
|
|
yyerrstatus = 3; /* Each real token shifted decrements this. */
|
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
/* Pop stack until we find a state that shifts the error token. */
|
2020-07-30 07:59:19 +08:00
|
|
|
for (;;)
|
|
|
|
{
|
|
|
|
yyn = yypact[yystate];
|
|
|
|
if (!yypact_value_is_default (yyn))
|
|
|
|
{
|
2024-03-25 23:32:23 +08:00
|
|
|
yyn += YYSYMBOL_YYerror;
|
|
|
|
if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYSYMBOL_YYerror)
|
2020-07-30 07:59:19 +08:00
|
|
|
{
|
|
|
|
yyn = yytable[yyn];
|
|
|
|
if (0 < yyn)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Pop the current state because it cannot handle the error token. */
|
|
|
|
if (yyssp == yyss)
|
|
|
|
YYABORT;
|
|
|
|
|
|
|
|
|
|
|
|
yydestruct ("Error: popping",
|
2024-03-25 23:32:23 +08:00
|
|
|
YY_ACCESSING_SYMBOL (yystate), yyvsp);
|
2020-07-30 07:59:19 +08:00
|
|
|
YYPOPSTACK (1);
|
|
|
|
yystate = *yyssp;
|
|
|
|
YY_STACK_PRINT (yyss, yyssp);
|
|
|
|
}
|
|
|
|
|
|
|
|
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
|
|
|
|
*++yyvsp = yylval;
|
|
|
|
YY_IGNORE_MAYBE_UNINITIALIZED_END
|
|
|
|
|
|
|
|
|
|
|
|
/* Shift the error token. */
|
2024-03-25 23:32:23 +08:00
|
|
|
YY_SYMBOL_PRINT ("Shifting", YY_ACCESSING_SYMBOL (yyn), yyvsp, yylsp);
|
2020-07-30 07:59:19 +08:00
|
|
|
|
|
|
|
yystate = yyn;
|
|
|
|
goto yynewstate;
|
|
|
|
|
|
|
|
|
|
|
|
/*-------------------------------------.
|
|
|
|
| yyacceptlab -- YYACCEPT comes here. |
|
|
|
|
`-------------------------------------*/
|
|
|
|
yyacceptlab:
|
|
|
|
yyresult = 0;
|
2024-03-25 23:32:23 +08:00
|
|
|
goto yyreturnlab;
|
|
|
|
|
2021-09-03 07:04:26 +08:00
|
|
|
|
2020-07-30 07:59:19 +08:00
|
|
|
/*-----------------------------------.
|
|
|
|
| yyabortlab -- YYABORT comes here. |
|
|
|
|
`-----------------------------------*/
|
|
|
|
yyabortlab:
|
|
|
|
yyresult = 1;
|
2024-03-25 23:32:23 +08:00
|
|
|
goto yyreturnlab;
|
|
|
|
|
2021-09-03 07:04:26 +08:00
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
/*-----------------------------------------------------------.
|
|
|
|
| yyexhaustedlab -- YYNOMEM (memory exhaustion) comes here. |
|
|
|
|
`-----------------------------------------------------------*/
|
2020-07-30 07:59:19 +08:00
|
|
|
yyexhaustedlab:
|
|
|
|
yyerror (YY_("memory exhausted"));
|
|
|
|
yyresult = 2;
|
2024-03-25 23:32:23 +08:00
|
|
|
goto yyreturnlab;
|
|
|
|
|
2021-09-03 07:04:26 +08:00
|
|
|
|
2024-03-25 23:32:23 +08:00
|
|
|
/*----------------------------------------------------------.
|
|
|
|
| yyreturnlab -- parsing is finished, clean up and return. |
|
|
|
|
`----------------------------------------------------------*/
|
|
|
|
yyreturnlab:
|
2020-07-30 07:59:19 +08:00
|
|
|
if (yychar != YYEMPTY)
|
|
|
|
{
|
|
|
|
/* Make sure we have latest lookahead translation. See comments at
|
|
|
|
user semantic actions for why this is necessary. */
|
|
|
|
yytoken = YYTRANSLATE (yychar);
|
|
|
|
yydestruct ("Cleanup: discarding lookahead",
|
|
|
|
yytoken, &yylval);
|
|
|
|
}
|
|
|
|
/* Do not reclaim the symbols of the rule whose action triggered
|
|
|
|
this YYABORT or YYACCEPT. */
|
|
|
|
YYPOPSTACK (yylen);
|
|
|
|
YY_STACK_PRINT (yyss, yyssp);
|
|
|
|
while (yyssp != yyss)
|
|
|
|
{
|
|
|
|
yydestruct ("Cleanup: popping",
|
2024-03-25 23:32:23 +08:00
|
|
|
YY_ACCESSING_SYMBOL (+*yyssp), yyvsp);
|
2020-07-30 07:59:19 +08:00
|
|
|
YYPOPSTACK (1);
|
|
|
|
}
|
|
|
|
#ifndef yyoverflow
|
|
|
|
if (yyss != yyssa)
|
|
|
|
YYSTACK_FREE (yyss);
|
|
|
|
#endif
|
2024-03-25 23:32:23 +08:00
|
|
|
|
2020-07-30 07:59:19 +08:00
|
|
|
return yyresult;
|
|
|
|
}
|
2024-03-25 23:32:23 +08:00
|
|
|
|
2024-05-16 08:46:25 +08:00
|
|
|
#line 770 "ncgen.y"
|
2020-07-30 07:59:19 +08:00
|
|
|
|
|
|
|
|
|
|
|
/* HELPER PROGRAMS */
|
2022-03-02 12:21:24 +08:00
|
|
|
void defatt(void)
|
2020-07-30 07:59:19 +08:00
|
|
|
{
|
|
|
|
valnum = 0;
|
|
|
|
valtype = NC_UNSPECIFIED;
|
|
|
|
/* get a large block for attributes, realloc later */
|
|
|
|
att_space = emalloc(MAX_NC_ATTSIZE);
|
|
|
|
/* make all kinds of pointers point to it */
|
|
|
|
char_valp = (char *) att_space;
|
|
|
|
byte_valp = (signed char *) att_space;
|
|
|
|
short_valp = (short *) att_space;
|
|
|
|
int_valp = (int *) att_space;
|
|
|
|
float_valp = (float *) att_space;
|
|
|
|
double_valp = (double *) att_space;
|
|
|
|
}
|
|
|
|
|
2022-03-02 12:21:24 +08:00
|
|
|
void equalatt(void)
|
2020-07-30 07:59:19 +08:00
|
|
|
{
|
|
|
|
/* check if duplicate attribute for this var */
|
|
|
|
int i;
|
|
|
|
for(i=0; i<natts; i++) { /* expensive */
|
|
|
|
if(atts[i].var == varnum &&
|
|
|
|
STREQ(atts[i].name,atts[natts].name)) {
|
|
|
|
derror("duplicate attribute %s:%s",
|
|
|
|
vars[varnum].name,atts[natts].name);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
atts[natts].var = varnum ;
|
|
|
|
atts[natts].type = valtype;
|
|
|
|
atts[natts].len = valnum;
|
|
|
|
/* shrink space down to what was really needed */
|
|
|
|
att_space = erealloc(att_space, valnum*nctypesize(valtype));
|
|
|
|
atts[natts].val = att_space;
|
2024-04-25 01:38:07 +08:00
|
|
|
if (STREQ(atts[natts].name, NC_FillValue) &&
|
2020-07-30 07:59:19 +08:00
|
|
|
atts[natts].var != NC_GLOBAL) {
|
|
|
|
nc_putfill(atts[natts].type,atts[natts].val,
|
|
|
|
&vars[atts[natts].var].fill_value);
|
|
|
|
if(atts[natts].type != vars[atts[natts].var].type) {
|
|
|
|
derror("variable %s: %s type mismatch",
|
2024-04-25 01:38:07 +08:00
|
|
|
vars[atts[natts].var].name, NC_FillValue);
|
2020-07-30 07:59:19 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
natts++;
|
|
|
|
}
|
|
|
|
/* PROGRAMS */
|
|
|
|
|
|
|
|
#ifdef vms
|
|
|
|
void
|
|
|
|
#else
|
|
|
|
int
|
|
|
|
#endif
|
|
|
|
yyerror( /* called for yacc syntax error */
|
|
|
|
char *s)
|
|
|
|
{
|
|
|
|
derror(s);
|
|
|
|
#ifndef vms
|
|
|
|
return -1;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
/* undefine yywrap macro, in case we are using bison instead of yacc */
|
|
|
|
#ifdef yywrap
|
|
|
|
#undef yywrap
|
|
|
|
#endif
|
|
|
|
|
|
|
|
int
|
|
|
|
ncgwrap(void) /* returns 1 on EOF if no more input */
|
|
|
|
{
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* Symbol table operations for ncgen tool */
|
|
|
|
|
|
|
|
/* Find CDL name in symbol table (linear search). Note, this has a
|
|
|
|
* side-effect: it handles escape characters in the name, deleting
|
|
|
|
* single escape characters from the CDL name, before looking it up.
|
|
|
|
*/
|
|
|
|
YYSTYPE lookup(char *sname)
|
|
|
|
{
|
|
|
|
YYSTYPE sp;
|
|
|
|
deescapify(sname); /* delete escape chars from names,
|
|
|
|
* e.g. 'ab\:cd\ ef' becomes
|
|
|
|
* 'ab:cd ef' */
|
|
|
|
for (sp = symlist; sp != (YYSTYPE) 0; sp = sp -> next)
|
|
|
|
if (STREQ(sp -> name, sname)) {
|
|
|
|
return sp;
|
|
|
|
}
|
|
|
|
return 0; /* 0 ==> not found */
|
|
|
|
}
|
|
|
|
|
|
|
|
YYSTYPE install( /* install sname in symbol table */
|
|
|
|
const char *sname)
|
|
|
|
{
|
|
|
|
YYSTYPE sp;
|
|
|
|
|
|
|
|
sp = (YYSTYPE) emalloc (sizeof (struct Symbol));
|
|
|
|
sp -> name = (char *) emalloc (strlen (sname) + 1);/* +1 for '\0' */
|
|
|
|
(void) strcpy (sp -> name, sname);
|
|
|
|
sp -> next = symlist; /* put at front of list */
|
|
|
|
sp -> is_dim = 0;
|
|
|
|
sp -> is_var = 0;
|
|
|
|
sp -> is_att = 0;
|
|
|
|
symlist = sp;
|
|
|
|
return sp;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
clearout(void) /* reset symbol table to empty */
|
|
|
|
{
|
|
|
|
YYSTYPE sp, tp;
|
|
|
|
for (sp = symlist; sp != (YYSTYPE) 0;) {
|
|
|
|
tp = sp -> next;
|
|
|
|
free (sp -> name);
|
|
|
|
free ((char *) sp);
|
|
|
|
sp = tp;
|
|
|
|
}
|
|
|
|
symlist = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* get lexical input routine generated by lex */
|
|
|
|
|
|
|
|
/* Keep compile quiet */
|
|
|
|
#define YY_NO_UNPUT
|
|
|
|
#define YY_NO_INPUT
|
|
|
|
|
|
|
|
#include "ncgenl.c"
|