1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
|
/*
* Copyright (c) 1995 Silicon Graphics, Inc. All Rights Reserved.
*
* 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.,
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#ifndef GRAM_NODE_H
#define GRAM_NODE_H
/* --- types --- */
typedef enum
{
N_and, N_or, N_not,
N_lt, N_le, N_gt, N_ge,
N_eq, N_neq, N_seq, N_sneq,
N_match, N_nmatch,
N_str, N_pat, N_number,
N_uid, N_gid, N_uname, N_gname,
N_fname, N_psargs, N_cpuburn,
N_true, N_false,
N_syscalls, N_ctxswitch,
N_virtualsize, N_residentsize,
N_iodemand, N_iowait, N_schedwait
} N_tag;
typedef struct
{
struct bool_node *left;
struct bool_node *right;
} bool_children;
typedef struct bool_node
{
N_tag tag;
struct bool_node *next;
union {
bool_children children;
char *str_val;
double num_val;
}
data;
} bool_node;
/* --- functions --- */
void free_tree(bool_node *);
void start_tree(void);
bool_node *create_tnode(N_tag, bool_node *, bool_node *);
bool_node *create_tag_node(N_tag);
bool_node *create_number_node(double);
bool_node *create_str_node(char *);
bool_node *create_pat_node(char *);
void dump_bool_tree(FILE *, bool_node *);
void dump_predicate(FILE *, bool_node *);
#endif
|
