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))
37 /** The operations in a parse tree node */
41 op_Not, op_Or, op_And,
43 op_EQ, op_NE, op_LT, op_LE, op_GT, op_GE, op_IN,
45 op_STR_EQ, op_STR_NE, op_STR_LT, op_STR_LE, op_STR_GT, op_STR_GE,
47 op_Digit, op_String, op_Regex, op_RegexBackref,
51 * call external functions/operators.
52 * The info node contains the function pointer and some function specific
54 * For Binary operators, the Call node links to the Info node and the
55 * Args node, which in turn links to the left and right operand.
56 * For all other variants, the Call node links to the Info node and the
59 op_UnaryOpCall, op_UnaryOpInfo,
60 op_BinaryOpCall, op_BinaryOpInfo, op_BinaryOpArgs,
61 op_StringFuncCall, op_StringFuncInfo,
62 op_ListFuncCall, op_ListFuncInfo
65 /** The basic parse tree node */
67 ap_expr_node_op node_op;
68 const void *node_arg1;
69 const void *node_arg2;
72 /** The context used by scanner and parser */
74 /* internal state of the scanner */
80 char scan_buf[MAX_STRING_LEN];
83 /* pools for result and temporary usage */
87 /* The created parse tree */
95 * The function to use to lookup provider functions for variables
98 ap_expr_lookup_fn *lookup_fn;
101 /* flex/bison functions */
102 int ap_expr_yyparse(ap_expr_parse_ctx *context);
103 void ap_expr_yyerror(ap_expr_parse_ctx *context, char *err);
104 int ap_expr_yylex_init(void **scanner);
105 int ap_expr_yylex_destroy(void *scanner);
106 void ap_expr_yyset_extra(ap_expr_parse_ctx *context, void *scanner);
108 /* create a parse tree node */
109 ap_expr *ap_expr_make(ap_expr_node_op op, const void *arg1, const void *arg2,
110 ap_expr_parse_ctx *ctx);
111 /* create parse tree node for the string-returning function 'name' */
112 ap_expr *ap_expr_str_func_make(const char *name, const ap_expr *arg,
113 ap_expr_parse_ctx *ctx);
114 /* create parse tree node for the list-returning function 'name' */
115 ap_expr *ap_expr_list_func_make(const char *name, const ap_expr *arg,
116 ap_expr_parse_ctx *ctx);
117 /* create parse tree node for the variable 'name' */
118 ap_expr *ap_expr_var_make(const char *name, ap_expr_parse_ctx *ctx);
119 /* create parse tree node for the unary operator 'name' */
120 ap_expr *ap_expr_unary_op_make(const char *name, const ap_expr *arg,
121 ap_expr_parse_ctx *ctx);
122 /* create parse tree node for the binary operator 'name' */
123 ap_expr *ap_expr_binary_op_make(const char *name, const ap_expr *arg1,
124 const ap_expr *arg2, ap_expr_parse_ctx *ctx);
127 #endif /* __AP_EXPR_PRIVATE_H__ */