Cross Reference: /osnet-11/usr/src/lib/libsqlite/tool/lemon.c

Lines Matching refs:data
113 ** Principal data structures for the LEMON parser generator.
141   char *datatype;          /* The data type of information held by this
143   int dtnum;               /* The data type number.  In the parser, the value
145                            ** union is the correct data type for this object */
260   char *tokendest;         /* Code to execute to destroy token data */
2280 ** the appropriate data structures in the global state vector "gp".
2773 /* The first function transfers data from "in" to "out" until
3004 ** Print the definition of the union used for the parser's data stack.
3005 ** This union contains fields for every possible data type for tokens
3751   struct s_x1node *tbl;  /* The data stored here */
3755 /* There is one instance of this structure for every data element
3759   char *data;                  /* The data */
3787 ** Prior data with the same key is NOT overwritten */
3788 int Strsafe_insert(data)
3789 char *data;
3796   ph = strhash(data);
3800     if( strcmp(np->data,data)==0 ){
3821       h = strhash(oldnp->data) & (size-1);
3825       newnp->data = oldnp->data;
3832   /* Insert the new data */
3835   np->data = data;
3843 /* Return a pointer to data assigned to the given key.  Return NULL
3855     if( strcmp(np->data,key)==0 ) break;
3858   return np ? np->data : 0;
3912   struct s_x2node *tbl;  /* The data stored here */
3916 /* There is one instance of this structure for every data element
3920   struct symbol *data;                  /* The data */
3949 ** Prior data with the same key is NOT overwritten */
3950 int Symbol_insert(data,key)
3951 struct symbol *data;
3989       newnp->data = oldnp->data;
3996   /* Insert the new data */
4000   np->data = data;
4008 /* Return a pointer to data assigned to the given key.  Return NULL
4023   return np ? np->data : 0;
4026 /* Return the n-th data.  Return NULL if n is out of range. */
4030   struct symbol *data;
4032     data = x2a->tbl[n-1].data;
4034     data = 0;
4036   return data;
4045 /* Return an array of pointers to all data in the table.
4056     for(i=0; i<size; i++) array[i] = x2a->tbl[i].data;
4118   struct s_x3node *tbl;  /* The data stored here */
4122 /* There is one instance of this structure for every data element
4126   struct state *data;                  /* The data */
4155 ** Prior data with the same key is NOT overwritten */
4156 int State_insert(data,key)
4157 struct state *data;
4195       newnp->data = oldnp->data;
4202   /* Insert the new data */
4206   np->data = data;
4214 /* Return a pointer to data assigned to the given key.  Return NULL
4229   return np ? np->data : 0;
4232 /* Return an array of pointers to all data in the table.
4243     for(i=0; i<size; i++) array[i] = x3a->tbl[i].data;
4265   struct s_x4node *tbl;  /* The data stored here */
4269 /* There is one instance of this structure for every data element
4273   struct config *data;                  /* The data */
4301 ** Prior data with the same key is NOT overwritten */
4302 int Configtable_insert(data)
4303 struct config *data;
4310   ph = confighash(data);
4314     if( Configcmp(np->data,data)==0 ){
4335       h = confighash(oldnp->data) & (size-1);
4339       newnp->data = oldnp->data;
4346   /* Insert the new data */
4349   np->data = data;
4357 /* Return a pointer to data assigned to the given key.  Return NULL
4369     if( Configcmp(np->data,key)==0 ) break;
4372   return np ? np->data : 0;
4375 /* Remove all data from the table.  Pass each data to the function "f"
4382   if( f ) for(i=0; i<x4a->count; i++) (*f)(x4a->tbl[i].data);