1 /* Licensed to the Apache Software Foundation (ASF) under one or more
2 * contributor license agreements. See the NOTICE file distributed with
3 * this work for additional information regarding copyright ownership.
4 * The ASF licenses this file to You under the Apache License, Version 2.0
5 * (the "License"); you may not use this file except in compliance with
6 * the License. You may obtain a copy of the License at
8 * http://www.apache.org/licenses/LICENSE-2.0
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
17 #ifndef __AP_EXPR_PRIVATE_H__
18 #define __AP_EXPR_PRIVATE_H__
21 #include "apr_strings.h"
22 #include "apr_tables.h"
30 #define MIN(a,b) (((a)<(b))?(a):(b))
33 #if !APR_HAVE_UNISTD_H
34 #define YY_NO_UNISTD_H
38 /* Avoid some warnings with Visual Studio (likely due to a bug in bison) */
39 #define YYMALLOC malloc
47 /** The operations in a parse tree node */
51 op_Not, op_Or, op_And,
53 op_EQ, op_NE, op_LT, op_LE, op_GT, op_GE, op_IN,
55 op_STR_EQ, op_STR_NE, op_STR_LT, op_STR_LE, op_STR_GT, op_STR_GE,
57 op_Digit, op_String, op_Regex, op_RegexBackref,
61 * call external functions/operators.
62 * The info node contains the function pointer and some function specific
64 * For Binary operators, the Call node links to the Info node and the
65 * Args node, which in turn links to the left and right operand.
66 * For all other variants, the Call node links to the Info node and the
69 op_UnaryOpCall, op_UnaryOpInfo,
70 op_BinaryOpCall, op_BinaryOpInfo, op_BinaryOpArgs,
71 op_StringFuncCall, op_StringFuncInfo,
72 op_ListFuncCall, op_ListFuncInfo
75 /** The basic parse tree node */
77 ap_expr_node_op_e node_op;
78 const void *node_arg1;
79 const void *node_arg2;
82 /** The context used by scanner and parser */
84 /* internal state of the scanner */
90 char scan_buf[MAX_STRING_LEN];
94 /* pools for result and temporary usage */
98 /* The created parse tree */
106 * The function to use to lookup provider functions for variables
109 ap_expr_lookup_fn_t *lookup_fn;
110 } ap_expr_parse_ctx_t;
112 /* flex/bison functions */
113 int ap_expr_yyparse(ap_expr_parse_ctx_t *context);
114 void ap_expr_yyerror(ap_expr_parse_ctx_t *context, const char *err);
115 int ap_expr_yylex_init(void **scanner);
116 int ap_expr_yylex_destroy(void *scanner);
117 void ap_expr_yyset_extra(ap_expr_parse_ctx_t *context, void *scanner);
119 /* create a parse tree node */
120 ap_expr_t *ap_expr_make(ap_expr_node_op_e op, const void *arg1,
121 const void *arg2, ap_expr_parse_ctx_t *ctx);
122 /* create parse tree node for the string-returning function 'name' */
123 ap_expr_t *ap_expr_str_func_make(const char *name, const ap_expr_t *arg,
124 ap_expr_parse_ctx_t *ctx);
125 /* create parse tree node for the list-returning function 'name' */
126 ap_expr_t *ap_expr_list_func_make(const char *name, const ap_expr_t *arg,
127 ap_expr_parse_ctx_t *ctx);
128 /* create parse tree node for the variable 'name' */
129 ap_expr_t *ap_expr_var_make(const char *name, ap_expr_parse_ctx_t *ctx);
130 /* create parse tree node for the unary operator 'name' */
131 ap_expr_t *ap_expr_unary_op_make(const char *name, const ap_expr_t *arg,
132 ap_expr_parse_ctx_t *ctx);
133 /* create parse tree node for the binary operator 'name' */
134 ap_expr_t *ap_expr_binary_op_make(const char *name, const ap_expr_t *arg1,
135 const ap_expr_t *arg2,
136 ap_expr_parse_ctx_t *ctx);
139 #endif /* __AP_EXPR_PRIVATE_H__ */