forked from osmocom/wireshark
086774b71f
Besides "STRING", there is now "UNPARSED_STRING", where the distinction
is that "STRING" was a double-quoted string and "UNPARSED_STRING" is just
a sequence of characters that the scanner didn't know how to scan/parse,
so it's up to the Ftype to parse it.
This gives us more flexibility and prepares the dfilter parsing engine
for the upcoming addition of the "contains" operator.
In the process of doing this, I also re-did the double-quoted string
support in the scanner, so that instead of the naively-simple support we
used to have, double-quoted strings now can have embedded dobule-quotes,
embedded octal sequences, and embedded hexadecimal sequences:
"\"" embedded double-quote
"\110" embedded octal
"\x48" embedded hex
Enhance the dfilter unit test script to be able to run a single collection
of tests instead of having to run all of them all the time.
svn path=/trunk/; revision=8083
125 lines
2.7 KiB
C
125 lines
2.7 KiB
C
/*
|
|
* $Id: syntax-tree.h,v 1.5 2003/07/25 03:44:01 gram Exp $
|
|
*
|
|
* Ethereal - Network traffic analyzer
|
|
* By Gerald Combs <gerald@zing.org>
|
|
* Copyright 2001 Gerald Combs
|
|
*
|
|
*
|
|
* 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 2
|
|
* 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
|
|
* along with this program; if not, write to the Free Software
|
|
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
|
|
*/
|
|
|
|
#ifndef SYNTAX_TREE_H
|
|
#define SYNTAX_TREE_H
|
|
|
|
#include <glib.h>
|
|
#include "cppmagic.h"
|
|
|
|
typedef enum {
|
|
STTYPE_UNINITIALIZED,
|
|
STTYPE_TEST,
|
|
STTYPE_UNPARSED,
|
|
STTYPE_STRING,
|
|
STTYPE_FIELD,
|
|
STTYPE_FVALUE,
|
|
STTYPE_INTEGER,
|
|
STTYPE_RANGE,
|
|
STTYPE_NUM_TYPES
|
|
} sttype_id_t;
|
|
|
|
typedef gpointer (*STTypeNewFunc)(gpointer);
|
|
typedef void (*STTypeFreeFunc)(gpointer);
|
|
|
|
|
|
/* Type information */
|
|
typedef struct {
|
|
sttype_id_t id;
|
|
const char *name;
|
|
STTypeNewFunc func_new;
|
|
STTypeFreeFunc func_free;
|
|
} sttype_t;
|
|
|
|
/* Node (type instance) information */
|
|
typedef struct {
|
|
guint32 magic;
|
|
sttype_t *type;
|
|
|
|
/* This could be made an enum, but I haven't
|
|
* set aside to time to do so. */
|
|
gpointer data;
|
|
guint32 value;
|
|
} stnode_t;
|
|
|
|
void
|
|
sttype_init(void);
|
|
|
|
void
|
|
sttype_cleanup(void);
|
|
|
|
void
|
|
sttype_register(sttype_t *type);
|
|
|
|
stnode_t*
|
|
stnode_new(sttype_id_t type_id, gpointer data);
|
|
|
|
void
|
|
stnode_init(stnode_t *node, sttype_id_t type_id, gpointer data);
|
|
|
|
void
|
|
stnode_init_int(stnode_t *node, sttype_id_t type_id, guint32 value);
|
|
|
|
void
|
|
stnode_free(stnode_t *node);
|
|
|
|
const char*
|
|
stnode_type_name(stnode_t *node);
|
|
|
|
sttype_id_t
|
|
stnode_type_id(stnode_t *node);
|
|
|
|
gpointer
|
|
stnode_data(stnode_t *node);
|
|
|
|
guint32
|
|
stnode_value(stnode_t *node);
|
|
|
|
#define assert_magic(obj, mnum) \
|
|
g_assert((obj)); \
|
|
if ((obj)->magic != (mnum)) { \
|
|
g_print("\nMagic num is 0x%08x, but should be 0x%08x", \
|
|
(obj)->magic, (mnum)); \
|
|
g_assert((obj)->magic == (mnum)); \
|
|
}
|
|
|
|
|
|
|
|
|
|
#define STTYPE_ACCESSOR(ret,type,attr,magicnum) \
|
|
ret \
|
|
CONCAT(CONCAT(CONCAT(sttype_,type),_),attr) (stnode_t *node) \
|
|
{\
|
|
CONCAT(type,_t) *value; \
|
|
value = stnode_data(node);\
|
|
assert_magic(value, magicnum); \
|
|
return value->attr; \
|
|
}
|
|
|
|
#define STTYPE_ACCESSOR_PROTOTYPE(ret,type,attr) \
|
|
ret \
|
|
CONCAT(CONCAT(CONCAT(sttype_,type),_),attr) (stnode_t *node);
|
|
|
|
|
|
#endif
|