12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589 |
- /*-
- * Copyright 2016 Vsevolod Stakhov
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
- #include "config.h"
- #include "expression.h"
- #include "printf.h"
- #include "regexp.h"
- #include "util.h"
- #include "utlist.h"
- #include "ottery.h"
- #include "libserver/logger.h"
- #include "libcryptobox/cryptobox.h"
- #include <math.h>
-
- #define RSPAMD_EXPR_FLAG_NEGATE (1 << 0)
- #define RSPAMD_EXPR_FLAG_PROCESSED (1 << 1)
-
- #define MIN_RESORT_EVALS 50
- #define MAX_RESORT_EVALS 150
- #define DOUBLE_EPSILON 1e-9
-
- enum rspamd_expression_elt_type {
- ELT_OP = 0,
- ELT_ATOM,
- ELT_LIMIT
- };
-
- enum rspamd_expression_op_flag {
- RSPAMD_EXPRESSION_UNARY = 1u << 0u,
- RSPAMD_EXPRESSION_BINARY = 1u << 1u,
- RSPAMD_EXPRESSION_NARY = 1u << 2u,
- RSPAMD_EXPRESSION_ARITHMETIC = 1u << 3u,
- RSPAMD_EXPRESSION_LOGICAL = 1u << 4u,
- RSPAMD_EXPRESSION_COMPARISON = 1u << 5u,
- };
-
- struct rspamd_expression_operation {
- enum rspamd_expression_op op;
- guint logical_priority;
- guint op_flags;
- };
-
- struct rspamd_expression_elt {
- enum rspamd_expression_elt_type type;
- union {
- rspamd_expression_atom_t *atom;
- struct rspamd_expression_operation op;
- gdouble lim;
- } p;
-
- gint flags;
- gint priority;
- gdouble value;
- };
-
- struct rspamd_expression {
- const struct rspamd_atom_subr *subr;
- GArray *expressions;
- GPtrArray *expression_stack;
- GNode *ast;
- gchar *log_id;
- guint next_resort;
- guint evals;
- };
-
- struct rspamd_expr_process_data {
- gpointer *ud;
- gint flags;
- /* != NULL if trace is collected */
- GPtrArray *trace;
- rspamd_expression_process_cb process_closure;
- };
-
- #define msg_debug_expression(...) rspamd_conditional_debug_fast (NULL, NULL, \
- rspamd_expression_log_id, "expression", e->log_id, \
- G_STRFUNC, \
- __VA_ARGS__)
-
- INIT_LOG_MODULE(expression)
-
- static GQuark
- rspamd_expr_quark (void)
- {
- return g_quark_from_static_string ("rspamd-expression");
- }
-
- static const gchar * RSPAMD_CONST_FUNCTION
- rspamd_expr_op_to_str (enum rspamd_expression_op op);
- static const gchar *
- rspamd_expr_op_to_str (enum rspamd_expression_op op)
- {
- const gchar *op_str = NULL;
-
- switch (op) {
- case OP_AND:
- op_str = "&";
- break;
- case OP_OR:
- op_str = "|";
- break;
- case OP_MULT:
- op_str = "*";
- break;
- case OP_PLUS:
- op_str = "+";
- break;
- case OP_MINUS:
- op_str = "-";
- break;
- case OP_DIVIDE:
- op_str = "/";
- break;
- case OP_NOT:
- op_str = "!";
- break;
- case OP_GE:
- op_str = ">=";
- break;
- case OP_GT:
- op_str = ">";
- break;
- case OP_LE:
- op_str = "<=";
- break;
- case OP_LT:
- op_str = "<";
- break;
- case OP_OBRACE:
- op_str = "(";
- break;
- case OP_CBRACE:
- op_str = ")";
- break;
- default:
- op_str = "???";
- break;
- }
-
- return op_str;
- }
-
- #define G_ARRAY_LAST(ar, type) (&g_array_index((ar), type, (ar)->len - 1))
-
- static void
- rspamd_expr_stack_elt_push (GPtrArray *stack,
- gpointer elt)
- {
- g_ptr_array_add (stack, elt);
- }
-
-
- static gpointer
- rspamd_expr_stack_elt_pop (GPtrArray *stack)
- {
- gpointer e;
- gint idx;
-
- if (stack->len == 0) {
- return NULL;
- }
-
- idx = stack->len - 1;
- e = g_ptr_array_index (stack, idx);
- g_ptr_array_remove_index_fast (stack, idx);
-
- return e;
- }
-
-
- static void
- rspamd_expr_stack_push (struct rspamd_expression *expr,
- gpointer elt)
- {
- rspamd_expr_stack_elt_push (expr->expression_stack, elt);
- }
-
- static gpointer
- rspamd_expr_stack_pop (struct rspamd_expression *expr)
- {
- return rspamd_expr_stack_elt_pop (expr->expression_stack);
- }
-
- static gpointer
- rspamd_expr_stack_peek (struct rspamd_expression *expr)
- {
- gpointer e;
- gint idx;
- GPtrArray *stack = expr->expression_stack;
-
- if (stack->len == 0) {
- return NULL;
- }
-
- idx = stack->len - 1;
- e = g_ptr_array_index (stack, idx);
-
- return e;
- }
-
- /*
- * Return operation priority
- */
- static gint RSPAMD_CONST_FUNCTION
- rspamd_expr_logic_priority (enum rspamd_expression_op op);
- static gint
- rspamd_expr_logic_priority (enum rspamd_expression_op op)
- {
- gint ret = 0;
-
- switch (op) {
- case OP_NOT:
- ret = 7;
- break;
- case OP_MULT:
- case OP_DIVIDE:
- ret = 6;
- break;
- case OP_PLUS:
- case OP_MINUS:
- ret = 5;
- break;
- case OP_GE:
- case OP_GT:
- case OP_LE:
- case OP_LT:
- ret = 4;
- break;
- case OP_AND:
- ret = 3;
- break;
- case OP_OR:
- ret = 2;
- break;
- case OP_OBRACE:
- case OP_CBRACE:
- ret = 1;
- break;
- case OP_INVALID:
- ret = -1;
- break;
- }
-
- return ret;
- }
-
- static guint RSPAMD_CONST_FUNCTION
- rspamd_expr_op_flags (enum rspamd_expression_op op);
-
- static guint
- rspamd_expr_op_flags (enum rspamd_expression_op op)
- {
- guint ret = 0;
-
- switch (op) {
- case OP_NOT:
- ret |= RSPAMD_EXPRESSION_UNARY|RSPAMD_EXPRESSION_LOGICAL;
- break;
- case OP_MULT:
- ret |= RSPAMD_EXPRESSION_NARY|RSPAMD_EXPRESSION_ARITHMETIC;
- break;
- case OP_DIVIDE:
- ret |= RSPAMD_EXPRESSION_BINARY|RSPAMD_EXPRESSION_ARITHMETIC;
- break;
- case OP_PLUS:
- ret |= RSPAMD_EXPRESSION_NARY|RSPAMD_EXPRESSION_ARITHMETIC;
- break;
- case OP_MINUS:
- ret |= RSPAMD_EXPRESSION_BINARY|RSPAMD_EXPRESSION_ARITHMETIC;
- break;
- case OP_GE:
- case OP_GT:
- case OP_LE:
- case OP_LT:
- ret |= RSPAMD_EXPRESSION_BINARY|RSPAMD_EXPRESSION_COMPARISON;
- break;
- case OP_AND:
- case OP_OR:
- ret |= RSPAMD_EXPRESSION_NARY|RSPAMD_EXPRESSION_LOGICAL;
- break;
- case OP_OBRACE:
- case OP_CBRACE:
- case OP_INVALID:
- break;
- }
-
- return ret;
- }
-
- /*
- * Return FALSE if symbol is not operation symbol (operand)
- * Return TRUE if symbol is operation symbol
- */
- static gboolean RSPAMD_CONST_FUNCTION
- rspamd_expr_is_operation_symbol (gchar a);
- static gboolean
- rspamd_expr_is_operation_symbol (gchar a)
- {
- switch (a) {
- case '!':
- case '&':
- case '|':
- case '(':
- case ')':
- case '>':
- case '<':
- case '+':
- case '*':
- case '-':
- case '/':
- return TRUE;
- }
-
- return FALSE;
- }
-
- /* Return character representation of operation */
- static enum rspamd_expression_op
- rspamd_expr_str_to_op (const gchar *a, const gchar *end, const gchar **next)
- {
- enum rspamd_expression_op op = OP_INVALID;
-
- g_assert (a < end);
-
- switch (*a) {
- case '!':
- case '&':
- case '|':
- case '+':
- case '*':
- case '/':
- case '-':
- case '(':
- case ')': {
- if (a < end - 1) {
- if ((a[0] == '&' && a[1] == '&') ||
- (a[0] == '|' && a[1] == '|')) {
- *next = a + 2;
- }
- else {
- *next = a + 1;
- }
- }
- else {
- *next = end;
- }
- /* XXX: not especially effective */
- switch (*a) {
- case '!':
- op = OP_NOT;
- break;
- case '&':
- op = OP_AND;
- break;
- case '*':
- op = OP_MULT;
- break;
- case '|':
- op = OP_OR;
- break;
- case '+':
- op = OP_PLUS;
- break;
- case '/':
- op = OP_DIVIDE;
- break;
- case '-':
- op = OP_MINUS;
- break;
- case ')':
- op = OP_CBRACE;
- break;
- case '(':
- op = OP_OBRACE;
- break;
- default:
- op = OP_INVALID;
- break;
- }
- break;
- }
- case 'O':
- case 'o':
- if ((gulong)(end - a) >= sizeof ("or") &&
- g_ascii_strncasecmp (a, "or", sizeof ("or") - 1) == 0) {
- *next = a + sizeof ("or") - 1;
- op = OP_OR;
- }
- break;
- case 'A':
- case 'a':
- if ((gulong)(end - a) >= sizeof ("and") &&
- g_ascii_strncasecmp (a, "and", sizeof ("and") - 1) == 0) {
- *next = a + sizeof ("and") - 1;
- op = OP_AND;
- }
- break;
- case 'N':
- case 'n':
- if ((gulong)(end - a) >= sizeof ("not") &&
- g_ascii_strncasecmp (a, "not", sizeof ("not") - 1) == 0) {
- *next = a + sizeof ("not") - 1;
- op = OP_NOT;
- }
- break;
- case '>':
- if (a < end - 1 && a[1] == '=') {
- *next = a + 2;
- op = OP_GE;
- }
- else {
- *next = a + 1;
- op = OP_GT;
- }
- break;
- case '<':
- if (a < end - 1 && a[1] == '=') {
- *next = a + 2;
- op = OP_LE;
- }
- else {
- *next = a + 1;
- op = OP_LT;
- }
- break;
- default:
- op = OP_INVALID;
- break;
- }
-
- return op;
- }
-
- static void
- rspamd_expression_destroy (struct rspamd_expression *expr)
- {
- guint i;
- struct rspamd_expression_elt *elt;
-
- if (expr != NULL) {
-
- if (expr->subr->destroy) {
- /* Free atoms */
- for (i = 0; i < expr->expressions->len; i ++) {
- elt = &g_array_index (expr->expressions,
- struct rspamd_expression_elt, i);
-
- if (elt->type == ELT_ATOM) {
- expr->subr->destroy (elt->p.atom);
- }
- }
- }
-
- if (expr->expressions) {
- g_array_free (expr->expressions, TRUE);
- }
- if (expr->expression_stack) {
- g_ptr_array_free (expr->expression_stack, TRUE);
- }
- if (expr->ast) {
- g_node_destroy (expr->ast);
- }
- if (expr->log_id) {
- g_free (expr->log_id);
- }
-
- g_free (expr);
- }
- }
-
- static gboolean
- rspamd_ast_add_node (struct rspamd_expression *e,
- GPtrArray *operands,
- struct rspamd_expression_elt *op,
- GError **err)
- {
-
- GNode *res, *a1, *a2, *test;
-
- g_assert (op->type == ELT_OP);
-
- if (op->p.op.op_flags & RSPAMD_EXPRESSION_UNARY) {
- /* Unary operator */
- struct rspamd_expression_elt *test_elt;
-
- res = g_node_new (op);
- a1 = rspamd_expr_stack_elt_pop (operands);
-
- if (a1 == NULL) {
- g_set_error (err, rspamd_expr_quark(), EINVAL, "no operand to "
- "unary '%s' operation", rspamd_expr_op_to_str (op->p.op.op));
- g_node_destroy (res);
-
- return FALSE;
- }
-
- g_node_append (res, a1);
- test_elt = a1->data;
-
- if (test_elt->type == ELT_ATOM) {
- test_elt->p.atom->parent = res;
- msg_debug_expression ("added unary op %s to AST; operand: %*s",
- rspamd_expr_op_to_str (op->p.op.op),
- (int)test_elt->p.atom->len, test_elt->p.atom->str);
- }
- else {
- msg_debug_expression ("added unary op %s to AST; operand type: %d",
- rspamd_expr_op_to_str (op->p.op.op),
- test_elt->type);
- }
-
- }
- else {
- struct rspamd_expression_elt *e1, *e2;
- /* For binary/nary operators we might want to examine chains */
- a2 = rspamd_expr_stack_elt_pop (operands);
- a1 = rspamd_expr_stack_elt_pop (operands);
-
- if (a2 == NULL) {
- g_set_error (err, rspamd_expr_quark(), EINVAL, "no left operand to "
- "'%s' operation", rspamd_expr_op_to_str (op->p.op.op));
- return FALSE;
- }
-
- if (a1 == NULL) {
- g_set_error (err, rspamd_expr_quark(), EINVAL, "no right operand to "
- "'%s' operation", rspamd_expr_op_to_str (op->p.op.op));
- return FALSE;
- }
-
- /* Nary stuff */
- if (op->p.op.op_flags & RSPAMD_EXPRESSION_NARY) {
- /*
- * We convert a set of ops like X + Y + Z to a nary tree like
- * X Y Z +
- * for the longest possible prefix of atoms/limits
- */
-
- /* First try with a1 */
- test = a1;
- e1 = test->data;
-
- if (e1->type == ELT_OP && e1->p.op.op == op->p.op.op) {
- /* Add children */
- g_node_append (test, a2);
- rspamd_expr_stack_elt_push (operands, a1);
-
- msg_debug_expression ("added nary op %s to AST merged with the first operand",
- rspamd_expr_op_to_str (op->p.op.op));
-
- return TRUE;
- }
-
- /* Now test a2 */
- test = a2;
- e2 = test->data;
-
- if (e2->type == ELT_OP && e2->p.op.op == op->p.op.op) {
- /* Add children */
- g_node_prepend (test, a1);
- rspamd_expr_stack_elt_push (operands, a2);
-
- msg_debug_expression ("added nary op %s to AST merged with the second operand",
- rspamd_expr_op_to_str (op->p.op.op));
-
- return TRUE;
- }
- }
-
- /* No optimizations possible, so create a new level */
- res = g_node_new (op);
- g_node_append (res, a1);
- g_node_append (res, a2);
-
- e1 = a1->data;
- e2 = a2->data;
-
- if (e1->type == ELT_ATOM) {
- e1->p.atom->parent = res;
- }
-
- if (e2->type == ELT_ATOM) {
- e2->p.atom->parent = res;
- }
-
- if (e1->type == ELT_ATOM && e2->type == ELT_ATOM) {
- msg_debug_expression ("added binary op %s to AST; operands: (%*s; %*s)",
- rspamd_expr_op_to_str (op->p.op.op),
- (int) e1->p.atom->len, e1->p.atom->str,
- (int) e2->p.atom->len, e2->p.atom->str);
- }
- else {
- msg_debug_expression ("added binary op %s to AST; operands (types): (%d; %d)",
- rspamd_expr_op_to_str (op->p.op.op),
- e1->type,
- e2->type);
- }
- }
-
- /* Push back resulting node to the stack */
- rspamd_expr_stack_elt_push (operands, res);
-
- return TRUE;
- }
-
- static gboolean
- rspamd_ast_priority_traverse (GNode *node, gpointer d)
- {
- struct rspamd_expression_elt *elt = node->data, *cur_elt;
- struct rspamd_expression *expr = d;
- gint cnt = 0;
- GNode *cur;
-
- if (node->children) {
- cur = node->children;
- while (cur) {
- cur_elt = cur->data;
- cnt += cur_elt->priority;
- cur = cur->next;
- }
- elt->priority = cnt;
- }
- else {
- /* It is atom or limit */
- g_assert (elt->type != ELT_OP);
-
- if (elt->type == ELT_LIMIT) {
- /* Always push limit first */
- elt->priority = 0;
- }
- else {
- elt->priority = RSPAMD_EXPRESSION_MAX_PRIORITY;
-
- if (expr->subr->priority != NULL) {
- elt->priority = RSPAMD_EXPRESSION_MAX_PRIORITY -
- expr->subr->priority (elt->p.atom);
- }
- elt->p.atom->hits = 0;
- elt->p.atom->avg_ticks = 0.0;
- }
- }
-
- return FALSE;
- }
-
- #define ATOM_PRIORITY(a) ((a)->p.atom->hits / ((a)->p.atom->avg_ticks > 0 ? \
- (a)->p.atom->avg_ticks * 10000000 : 1.0))
-
- static gint
- rspamd_ast_priority_cmp (GNode *a, GNode *b)
- {
- struct rspamd_expression_elt *ea = a->data, *eb = b->data;
- gdouble w1, w2;
-
- if (ea->type == ELT_LIMIT) {
- return 1;
- }
- else if (eb->type == ELT_LIMIT) {
- return -1;
- }
-
- /* Special logic for atoms */
- if (ea->type == ELT_ATOM && eb->type == ELT_ATOM &&
- ea->priority == eb->priority) {
- w1 = ATOM_PRIORITY (ea);
- w2 = ATOM_PRIORITY (eb);
-
- ea->p.atom->hits = 0;
- ea->p.atom->avg_ticks = 0.0;
-
- return w1 - w2;
- }
- else {
- return ea->priority - eb->priority;
- }
- }
-
- static gboolean
- rspamd_ast_resort_traverse (GNode *node, gpointer unused)
- {
- GNode *children, *last;
- struct rspamd_expression_elt *elt;
-
- elt = (struct rspamd_expression_elt *)node->data;
-
- /*
- * We sort merely logical operations, everything else is dangerous
- */
- if (elt->type == ELT_OP && elt->p.op.op_flags & RSPAMD_EXPRESSION_LOGICAL) {
-
- if (node->children) {
-
- children = node->children;
- last = g_node_last_sibling (children);
- /* Needed for utlist compatibility */
- children->prev = last;
- DL_SORT (node->children, rspamd_ast_priority_cmp);
- /* Restore GLIB compatibility */
- children = node->children;
- children->prev = NULL;
- }
- }
-
- return FALSE;
- }
-
- static struct rspamd_expression_elt *
- rspamd_expr_dup_elt (rspamd_mempool_t *pool, struct rspamd_expression_elt *elt)
- {
- struct rspamd_expression_elt *n;
-
- n = rspamd_mempool_alloc (pool, sizeof (*n));
- memcpy (n, elt, sizeof (*n));
-
- return n;
- }
-
- gboolean
- rspamd_parse_expression (const gchar *line, gsize len,
- const struct rspamd_atom_subr *subr, gpointer subr_data,
- rspamd_mempool_t *pool, GError **err,
- struct rspamd_expression **target)
- {
- struct rspamd_expression *e;
- struct rspamd_expression_elt elt;
- rspamd_expression_atom_t *atom;
- rspamd_regexp_t *num_re;
- enum rspamd_expression_op op, op_stack;
- const gchar *p, *c, *end;
- GPtrArray *operand_stack;
- GNode *tmp;
-
- enum {
- PARSE_ATOM = 0,
- PARSE_OP,
- PARSE_LIM,
- SKIP_SPACES
- } state = PARSE_ATOM;
-
- g_assert (line != NULL);
- g_assert (subr != NULL && subr->parse != NULL);
-
- if (len == 0) {
- len = strlen (line);
- }
-
- memset (&elt, 0, sizeof (elt));
- num_re = rspamd_regexp_cache_create (NULL,
- "/^(?:[+-]?([0-9]*[.])?[0-9]+)(?:\\s+|[)]|$)/", NULL, NULL);
-
- p = line;
- c = line;
- end = line + len;
- e = g_malloc0 (sizeof (*e));
- e->expressions = g_array_new (FALSE, FALSE,
- sizeof (struct rspamd_expression_elt));
- operand_stack = g_ptr_array_sized_new (32);
- e->ast = NULL;
- e->expression_stack = g_ptr_array_sized_new (32);
- e->subr = subr;
- e->evals = 0;
- e->next_resort = ottery_rand_range (MAX_RESORT_EVALS) + MIN_RESORT_EVALS;
- e->log_id = g_malloc0 (RSPAMD_LOG_ID_LEN + 1);
- guint64 h = rspamd_cryptobox_fast_hash (line, len, 0xdeadbabe);
- rspamd_snprintf (e->log_id, RSPAMD_LOG_ID_LEN + 1, "%xL", h);
- msg_debug_expression ("start to parse expression '%*s'", (int)len, line);
-
- /* Shunting-yard algorithm */
- while (p < end) {
- switch (state) {
- case PARSE_ATOM:
- if (g_ascii_isspace (*p)) {
- state = SKIP_SPACES;
- continue;
- }
- else if (rspamd_expr_is_operation_symbol (*p)) {
- /* Lookahead */
- if (p + 1 < end) {
- gchar t = *(p + 1);
-
- if (t == ':') {
- /* Special case, treat it as an atom */
- }
- else if (*p == '/') {
- /* Lookahead for division operation to distinguish from regexp */
- const gchar *track = p + 1;
-
- /* Skip spaces */
- while (track < end && g_ascii_isspace (*track)) {
- track++;
- }
-
- /* Check for a number */
- if (rspamd_regexp_search (num_re,
- track,
- end - track,
- NULL,
- NULL,
- FALSE,
- NULL)) {
- state = PARSE_OP;
- msg_debug_expression ("found divide operation");
- continue;
- }
-
- msg_debug_expression ("false divide operation");
- /* Fallback to PARSE_ATOM state */
- }
- else if (*p == '-') {
- /* - is used in composites, so we need to distinguish - from
- * 1) unary minus of a limit!
- * 2) -BLAH in composites
- * Decision is simple: require a space after binary `-` op
- */
- if (g_ascii_isspace (t)) {
- state = PARSE_OP;
- continue;
- }
- /* Fallback to PARSE_ATOM state */
- msg_debug_expression ("false minus operation");
- }
- else {
- /* Generic operation */
- state = PARSE_OP;
- continue;
- }
- }
- else {
- state = PARSE_OP;
- continue;
- }
- }
-
- /*
- * First of all, we check some pre-conditions:
- * 1) if we have 'and ' or 'or ' or 'not ' strings, they are op
- * 2) if we have full numeric string, then we check for
- * the following expression:
- * ^\d+\s*[><]$
- * and check the operation on stack
- */
- if ((gulong)(end - p) > sizeof ("and ") &&
- (g_ascii_strncasecmp (p, "and ", sizeof ("and ") - 1) == 0 ||
- g_ascii_strncasecmp (p, "not ", sizeof ("not ") - 1) == 0 )) {
- state = PARSE_OP;
- }
- else if ((gulong)(end - p) > sizeof ("or ") &&
- g_ascii_strncasecmp (p, "or ", sizeof ("or ") - 1) == 0) {
- state = PARSE_OP;
- }
- else {
- /*
- * If we have any comparison or arithmetic operator in the stack, then try
- * to parse limit
- */
- op = GPOINTER_TO_INT (rspamd_expr_stack_peek (e));
-
- if (op == OP_MULT || op == OP_MINUS || op == OP_DIVIDE ||
- op == OP_PLUS || (op >= OP_LT && op <= OP_GE)) {
- if (rspamd_regexp_search (num_re,
- p,
- end - p,
- NULL,
- NULL,
- FALSE,
- NULL)) {
- c = p;
- state = PARSE_LIM;
- continue;
- }
- /* Fallback to atom parsing */
- }
-
- /* Try to parse atom */
- atom = subr->parse (p, end - p, pool, subr_data, err);
- if (atom == NULL || atom->len == 0) {
- /* We couldn't parse the atom, so go out */
- if (err != NULL && *err == NULL) {
- g_set_error (err,
- rspamd_expr_quark (),
- 500,
- "Cannot parse atom: callback function failed"
- " to parse '%.*s'",
- (int) (end - p),
- p);
- }
- goto error_label;
- }
-
- if (atom->str == NULL) {
- atom->str = p;
- }
-
- p = p + atom->len;
-
- /* Push to output */
- elt.type = ELT_ATOM;
- elt.p.atom = atom;
- g_array_append_val (e->expressions, elt);
- rspamd_expr_stack_elt_push (operand_stack,
- g_node_new (rspamd_expr_dup_elt (pool, &elt)));
- msg_debug_expression ("found atom: %*s; pushed onto operand stack (%d size)",
- (int)atom->len, atom->str, operand_stack->len);
-
- }
- break;
- case PARSE_LIM:
- if ((g_ascii_isdigit (*p) || *p == '-' || *p == '.')
- && p < end - 1) {
- p ++;
- }
- else {
- if (p == end - 1 && g_ascii_isdigit (*p)) {
- p ++;
- }
-
- if (p - c > 0) {
- elt.type = ELT_LIMIT;
- elt.p.lim = strtod (c, NULL);
- g_array_append_val (e->expressions, elt);
- rspamd_expr_stack_elt_push (operand_stack,
- g_node_new (rspamd_expr_dup_elt (pool, &elt)));
- msg_debug_expression ("found limit: %.1f; pushed onto operand stack (%d size)",
- elt.p.lim, operand_stack->len);
- c = p;
- state = SKIP_SPACES;
- }
- else {
- g_set_error (err, rspamd_expr_quark(), 400, "Empty number");
- goto error_label;
- }
- }
- break;
- case PARSE_OP:
- op = rspamd_expr_str_to_op (p, end, &p);
- if (op == OP_INVALID) {
- g_set_error (err, rspamd_expr_quark(), 500, "Bad operator %c",
- *p);
- goto error_label;
- }
- else if (op == OP_OBRACE) {
- /*
- * If the token is a left parenthesis, then push it onto
- * the stack.
- */
- rspamd_expr_stack_push (e, GINT_TO_POINTER (op));
- msg_debug_expression ("found obrace, pushed to operators stack (%d size)",
- e->expression_stack->len);
- }
- else if (op == OP_CBRACE) {
- /*
- * Until the token at the top of the stack is a left
- * parenthesis, pop operators off the stack onto the
- * output queue.
- *
- * Pop the left parenthesis from the stack,
- * but not onto the output queue.
- *
- * If the stack runs out without finding a left parenthesis,
- * then there are mismatched parentheses.
- */
- msg_debug_expression ("found cbrace, rewind operators stack (%d size)",
- e->expression_stack->len);
-
- do {
- op = GPOINTER_TO_INT (rspamd_expr_stack_pop (e));
-
- if (op == OP_INVALID) {
- g_set_error (err, rspamd_expr_quark(), 600,
- "Braces mismatch");
- goto error_label;
- }
-
- guint op_priority = rspamd_expr_logic_priority (op);
- msg_debug_expression ("found op: %s; priority = %d",
- rspamd_expr_op_to_str (op), op_priority);
-
- if (op != OP_OBRACE) {
- elt.type = ELT_OP;
- elt.p.op.op = op;
- elt.p.op.op_flags = rspamd_expr_op_flags (op);
- elt.p.op.logical_priority = op_priority;
- g_array_append_val (e->expressions, elt);
-
- if (!rspamd_ast_add_node (e, operand_stack,
- rspamd_expr_dup_elt (pool, &elt), err)) {
- goto error_label;
- }
- }
-
- } while (op != OP_OBRACE);
- }
- else {
- /*
- * While there is an operator token, o2, at the top of
- * the operator stack, and either:
- *
- * - o1 is left-associative and its precedence is less than
- * or equal to that of o2, or
- * - o1 is right associative, and has precedence less than
- * that of o2,
- *
- * then pop o2 off the operator stack, onto the output queue;
- *
- * push o1 onto the operator stack.
- */
-
- for (;;) {
- op_stack = GPOINTER_TO_INT (rspamd_expr_stack_pop (e));
-
- if (op_stack == OP_INVALID) {
- /* Stack is empty */
- msg_debug_expression ("no operations in operators stack");
- break;
- }
-
- /* We ignore associativity for now */
- guint op_priority = rspamd_expr_logic_priority (op),
- stack_op_priority = rspamd_expr_logic_priority (op_stack);
-
- msg_debug_expression ("operators stack %d; operands stack: %d; "
- "process operation '%s'(%d); pop operation '%s'(%d)",
- e->expression_stack->len,
- operand_stack->len,
- rspamd_expr_op_to_str (op), op_priority,
- rspamd_expr_op_to_str (op_stack), stack_op_priority);
-
- if (op_stack != OP_OBRACE &&
- op_priority < stack_op_priority) {
- elt.type = ELT_OP;
- elt.p.op.op = op_stack;
- elt.p.op.op_flags = rspamd_expr_op_flags (op_stack);
- elt.p.op.logical_priority = op_priority;
-
- g_array_append_val (e->expressions, elt);
-
- if (!rspamd_ast_add_node (e, operand_stack,
- rspamd_expr_dup_elt (pool, &elt), err)) {
- goto error_label;
- }
- }
- else {
- /* Push op_stack back */
- msg_debug_expression ("operators stack %d; operands stack: %d; "
- "process operation '%s'(%d); push back to stack '%s'(%d)",
- e->expression_stack->len,
- operand_stack->len,
- rspamd_expr_op_to_str (op), op_priority,
- rspamd_expr_op_to_str (op_stack), stack_op_priority);
- rspamd_expr_stack_push (e, GINT_TO_POINTER (op_stack));
- break;
- }
- }
-
- /* Push new operator itself */
- msg_debug_expression ("operators stack %d; operands stack: %d; "
- "process operation '%s'; push to stack",
- e->expression_stack->len,
- operand_stack->len,
- rspamd_expr_op_to_str (op));
- rspamd_expr_stack_push (e, GINT_TO_POINTER (op));
- }
-
- state = SKIP_SPACES;
- break;
- case SKIP_SPACES:
- if (g_ascii_isspace (*p)) {
- p ++;
- }
- else if (rspamd_expr_is_operation_symbol (*p)) {
- state = PARSE_OP;
- }
- else {
- state = PARSE_ATOM;
- }
- break;
- }
- }
-
- /* Now we process the stack and push operators to the output */
- while ((op_stack = GPOINTER_TO_INT (rspamd_expr_stack_pop (e)))
- != OP_INVALID) {
- msg_debug_expression ("operators stack %d; operands stack: %d; "
- "rewind stack; op: %s",
- e->expression_stack->len,
- operand_stack->len,
- rspamd_expr_op_to_str (op));
-
- if (op_stack != OP_OBRACE) {
- elt.type = ELT_OP;
- elt.p.op.op = op_stack;
- elt.p.op.op_flags = rspamd_expr_op_flags (op_stack);
- elt.p.op.logical_priority = rspamd_expr_logic_priority (op_stack);
-
- g_array_append_val (e->expressions, elt);
- if (!rspamd_ast_add_node (e, operand_stack,
- rspamd_expr_dup_elt (pool, &elt), err)) {
- goto error_label;
- }
- }
- else {
- g_set_error (err, rspamd_expr_quark(), 600,
- "Braces mismatch");
- goto error_label;
- }
- }
-
- if (operand_stack->len != 1) {
- g_set_error (err, rspamd_expr_quark(), 601,
- "Operators mismatch: %d elts in stack", operand_stack->len);
- goto error_label;
- }
-
- e->ast = rspamd_expr_stack_elt_pop (operand_stack);
- g_ptr_array_free (operand_stack, TRUE);
-
- /* Set priorities for branches */
- g_node_traverse (e->ast, G_POST_ORDER, G_TRAVERSE_ALL, -1,
- rspamd_ast_priority_traverse, e);
-
- /* Now set less expensive branches to be evaluated first */
- g_node_traverse (e->ast, G_POST_ORDER, G_TRAVERSE_NON_LEAVES, -1,
- rspamd_ast_resort_traverse, NULL);
-
- if (target) {
- *target = e;
- rspamd_mempool_add_destructor (pool,
- (rspamd_mempool_destruct_t)rspamd_expression_destroy, e);
- }
- else {
- rspamd_expression_destroy (e);
- }
-
- return TRUE;
-
- error_label:
- msg_debug_expression ("fatal error: %e", *err);
-
- while ((tmp = rspamd_expr_stack_elt_pop (operand_stack)) != NULL) {
- g_node_destroy (tmp);
- }
-
- g_ptr_array_free (operand_stack, TRUE);
- rspamd_expression_destroy (e);
-
- return FALSE;
- }
-
- /*
- * Node optimizer function: skip nodes that are not relevant
- */
- static gboolean
- rspamd_ast_node_done (struct rspamd_expression_elt *elt, gdouble acc)
- {
- gboolean ret = FALSE;
-
- g_assert (elt->type == ELT_OP);
-
- switch (elt->p.op.op) {
- case OP_NOT:
- ret = TRUE;
- break;
- case OP_AND:
- ret = acc == 0;
- break;
- case OP_OR:
- ret = acc != 0;
- break;
- default:
- break;
- }
-
- return ret;
- }
-
-
- static gdouble
- rspamd_ast_do_unary_op (struct rspamd_expression_elt *elt, gdouble operand)
- {
- gdouble ret;
- g_assert (elt->type == ELT_OP);
-
- switch (elt->p.op.op) {
- case OP_NOT:
- ret = fabs (operand) > DOUBLE_EPSILON ? 0.0 : 1.0;
- break;
- default:
- g_assert_not_reached ();
- }
-
- return ret;
- }
-
- static gdouble
- rspamd_ast_do_binary_op (struct rspamd_expression_elt *elt, gdouble op1, gdouble op2)
- {
- gdouble ret;
-
- g_assert (elt->type == ELT_OP);
-
- switch (elt->p.op.op) {
- case OP_MINUS:
- ret = op1 - op2;
- break;
- case OP_DIVIDE:
- ret = op1 / op2;
- break;
- case OP_GE:
- ret = op1 >= op2;
- break;
- case OP_GT:
- ret = op1 > op2;
- break;
- case OP_LE:
- ret = op1 <= op2;
- break;
- case OP_LT:
- ret = op1 < op2;
- break;
-
- case OP_NOT:
- case OP_PLUS:
- case OP_MULT:
- case OP_AND:
- case OP_OR:
- default:
- g_assert_not_reached();
- break;
- }
-
- return ret;
- }
-
- static gdouble
- rspamd_ast_do_nary_op (struct rspamd_expression_elt *elt, gdouble val, gdouble acc)
- {
- gdouble ret;
-
- g_assert (elt->type == ELT_OP);
-
- if (isnan (acc)) {
- return val;
- }
-
- switch (elt->p.op.op) {
- case OP_PLUS:
- ret = acc + val;
- break;
- case OP_MULT:
- ret = acc * val;
- break;
- case OP_AND:
- ret = (acc * val);
- break;
- case OP_OR:
- ret = (acc + val);
- break;
- default:
- case OP_NOT:
- case OP_MINUS:
- case OP_DIVIDE:
- case OP_GE:
- case OP_GT:
- case OP_LE:
- case OP_LT:
- g_assert_not_reached();
- break;
- }
-
- return ret;
- }
-
- static gdouble
- rspamd_ast_process_node (struct rspamd_expression *e, GNode *node,
- struct rspamd_expr_process_data *process_data)
- {
- struct rspamd_expression_elt *elt;
- GNode *cld;
- gdouble acc = NAN;
- gdouble t1, t2, val;
- gboolean calc_ticks = FALSE;
- const gchar *op_name = NULL;
-
- elt = node->data;
-
- switch (elt->type) {
- case ELT_ATOM:
- if (!(elt->flags & RSPAMD_EXPR_FLAG_PROCESSED)) {
-
- /*
- * Sometimes get ticks for this expression. 'Sometimes' here means
- * that we get lowest 5 bits of the counter `evals` and 5 bits
- * of some shifted address to provide some sort of jittering for
- * ticks evaluation
- */
- if ((e->evals & 0x1F) == (GPOINTER_TO_UINT (node) >> 4 & 0x1F)) {
- calc_ticks = TRUE;
- t1 = rspamd_get_ticks (TRUE);
- }
-
- elt->value = process_data->process_closure (process_data->ud, elt->p.atom);
-
- if (fabs (elt->value) > 1e-9) {
- elt->p.atom->hits ++;
-
- if (process_data->trace) {
- g_ptr_array_add (process_data->trace, elt->p.atom);
- }
- }
-
- if (calc_ticks) {
- t2 = rspamd_get_ticks (TRUE);
- elt->p.atom->avg_ticks += ((t2 - t1) - elt->p.atom->avg_ticks) /
- (e->evals);
- }
-
- elt->flags |= RSPAMD_EXPR_FLAG_PROCESSED;
- }
-
- acc = elt->value;
- msg_debug_expression ("atom: elt=%s; acc=%.1f", elt->p.atom->str, acc);
- break;
- case ELT_LIMIT:
-
- acc = elt->p.lim;
- msg_debug_expression ("limit: lim=%.1f; acc=%.1f;", elt->p.lim, acc);
- break;
- case ELT_OP:
- g_assert (node->children != NULL);
- op_name = rspamd_expr_op_to_str (elt->p.op.op);
-
- if (elt->p.op.op_flags & RSPAMD_EXPRESSION_NARY) {
- msg_debug_expression ("proceed nary operation %s", op_name);
- /* Proceed all ops in chain */
- DL_FOREACH (node->children, cld) {
- val = rspamd_ast_process_node (e, cld, process_data);
- msg_debug_expression ("before op: op=%s; acc=%.1f; val = %.2f", op_name,
- acc, val);
- acc = rspamd_ast_do_nary_op (elt, val, acc);
- msg_debug_expression ("after op: op=%s; acc=%.1f; val = %.2f", op_name,
- acc, val);
-
- /* Check if we need to process further */
- if (!(process_data->flags & RSPAMD_EXPRESSION_FLAG_NOOPT)) {
- if (rspamd_ast_node_done (elt, acc)) {
- msg_debug_expression ("optimizer: done");
- return acc;
- }
- }
- }
- }
- else if (elt->p.op.op_flags & RSPAMD_EXPRESSION_BINARY) {
- GNode *c1 = node->children, *c2;
-
- c2 = c1->next;
- g_assert (c2->next == NULL);
- gdouble val1, val2;
-
- msg_debug_expression ("proceed binary operation %s",
- op_name);
- val1 = rspamd_ast_process_node (e, c1, process_data);
- val2 = rspamd_ast_process_node (e, c2, process_data);
-
- msg_debug_expression ("before op: op=%s; op1 = %.1f, op2 = %.1f",
- op_name, val1, val2);
- acc = rspamd_ast_do_binary_op (elt, val1, val2);
- msg_debug_expression ("after op: op=%s; res=%.1f",
- op_name, acc);
- }
- else if (elt->p.op.op_flags & RSPAMD_EXPRESSION_UNARY) {
- GNode *c1 = node->children;
-
- g_assert (c1->next == NULL);
-
- msg_debug_expression ("proceed unary operation %s",
- op_name);
- val = rspamd_ast_process_node (e, c1, process_data);
-
- msg_debug_expression ("before op: op=%s; op1 = %.1f",
- op_name, val);
- acc = rspamd_ast_do_unary_op (elt, val);
- msg_debug_expression ("after op: op=%s; res=%.1f",
- op_name, acc);
- }
- break;
- }
-
- return acc;
- }
-
- static gboolean
- rspamd_ast_cleanup_traverse (GNode *n, gpointer d)
- {
- struct rspamd_expression_elt *elt = n->data;
-
- elt->value = 0;
- elt->flags = 0;
-
- return FALSE;
- }
-
- gdouble
- rspamd_process_expression_closure (struct rspamd_expression *expr,
- rspamd_expression_process_cb cb,
- gint flags,
- gpointer runtime_ud,
- GPtrArray **track)
- {
- struct rspamd_expr_process_data pd;
- gdouble ret = 0;
-
- g_assert (expr != NULL);
- /* Ensure that stack is empty at this point */
- g_assert (expr->expression_stack->len == 0);
-
- expr->evals ++;
-
- memset (&pd, 0, sizeof (pd));
- pd.process_closure = cb;
- pd.flags = flags;
- pd.ud = runtime_ud;
-
- if (track) {
- pd.trace = g_ptr_array_sized_new (32);
- *track = pd.trace;
- }
-
- ret = rspamd_ast_process_node (expr, expr->ast, &pd);
-
- /* Cleanup */
- g_node_traverse (expr->ast, G_IN_ORDER, G_TRAVERSE_ALL, -1,
- rspamd_ast_cleanup_traverse, NULL);
-
- /* Check if we need to resort */
- if (expr->evals % expr->next_resort == 0) {
- expr->next_resort = ottery_rand_range (MAX_RESORT_EVALS) +
- MIN_RESORT_EVALS;
- /* Set priorities for branches */
- g_node_traverse (expr->ast, G_POST_ORDER, G_TRAVERSE_ALL, -1,
- rspamd_ast_priority_traverse, expr);
-
- /* Now set less expensive branches to be evaluated first */
- g_node_traverse (expr->ast, G_POST_ORDER, G_TRAVERSE_NON_LEAVES, -1,
- rspamd_ast_resort_traverse, NULL);
- }
-
- return ret;
- }
-
- gdouble
- rspamd_process_expression_track (struct rspamd_expression *expr,
- gint flags,
- gpointer runtime_ud,
- GPtrArray **track)
- {
- return rspamd_process_expression_closure (expr,
- expr->subr->process, flags, runtime_ud, track);
- }
-
- gdouble
- rspamd_process_expression (struct rspamd_expression *expr,
- gint flags,
- gpointer runtime_ud)
- {
- return rspamd_process_expression_closure (expr,
- expr->subr->process, flags, runtime_ud, NULL);
- }
-
- static gboolean
- rspamd_ast_string_traverse (GNode *n, gpointer d)
- {
- GString *res = d;
- gint cnt;
- GNode *cur;
- struct rspamd_expression_elt *elt = n->data;
- const char *op_str = NULL;
-
- if (elt->type == ELT_ATOM) {
- rspamd_printf_gstring (res, "(%*s)",
- (int)elt->p.atom->len, elt->p.atom->str);
- }
- else if (elt->type == ELT_LIMIT) {
- if (elt->p.lim == (double)(gint64)elt->p.lim) {
- rspamd_printf_gstring (res, "%L", (gint64)elt->p.lim);
- }
- else {
- rspamd_printf_gstring (res, "%f", elt->p.lim);
- }
- }
- else {
- op_str = rspamd_expr_op_to_str (elt->p.op.op);
- g_string_append (res, op_str);
-
- if (n->children) {
- LL_COUNT(n->children, cur, cnt);
-
- if (cnt > 2) {
- /* Print n-ary of the operator */
- g_string_append_printf (res, "(%d)", cnt);
- }
- }
- }
-
- g_string_append_c (res, ' ');
-
- return FALSE;
- }
-
- GString *
- rspamd_expression_tostring (struct rspamd_expression *expr)
- {
- GString *res;
-
- g_assert (expr != NULL);
-
- res = g_string_new (NULL);
- g_node_traverse (expr->ast, G_POST_ORDER, G_TRAVERSE_ALL, -1,
- rspamd_ast_string_traverse, res);
-
- /* Last space */
- if (res->len > 0) {
- g_string_erase (res, res->len - 1, 1);
- }
-
- return res;
- }
-
- struct atom_foreach_cbdata {
- rspamd_expression_atom_foreach_cb cb;
- gpointer cbdata;
- };
-
- static gboolean
- rspamd_ast_atom_traverse (GNode *n, gpointer d)
- {
- struct atom_foreach_cbdata *data = d;
- struct rspamd_expression_elt *elt = n->data;
- rspamd_ftok_t tok;
-
- if (elt->type == ELT_ATOM) {
- tok.begin = elt->p.atom->str;
- tok.len = elt->p.atom->len;
-
- data->cb (&tok, data->cbdata);
- }
-
- return FALSE;
- }
-
- void
- rspamd_expression_atom_foreach (struct rspamd_expression *expr,
- rspamd_expression_atom_foreach_cb cb, gpointer cbdata)
- {
- struct atom_foreach_cbdata data;
-
- g_assert (expr != NULL);
-
- data.cb = cb;
- data.cbdata = cbdata;
- g_node_traverse (expr->ast, G_POST_ORDER, G_TRAVERSE_ALL, -1,
- rspamd_ast_atom_traverse, &data);
- }
-
- gboolean
- rspamd_expression_node_is_op (GNode *node, enum rspamd_expression_op op)
- {
- struct rspamd_expression_elt *elt;
-
- g_assert (node != NULL);
-
- elt = node->data;
-
- if (elt->type == ELT_OP && elt->p.op.op == op) {
- return TRUE;
- }
-
- return FALSE;
- }
|