Searched defs:eval_expr (Results 1 - 2 of 2) sorted by relevance
/external/toybox/toys/pending/ |
H A D | expr.c | 11 * eval_expr() uses the recursive "Precedence Climbing" algorithm: 213 static void eval_expr(struct value *ret, int min_prec) function 221 eval_expr(ret, 1); // We're inside ( ), so min_prec = 1 241 eval_expr(&rhs, o->prec + 1); // Evaluate RHS, with higher min precedence 252 eval_expr(&ret, 1);
|
/external/squashfs-tools/squashfs-tools/ |
H A D | action.c | 731 static int eval_expr(struct expr *expr, struct action_data *action_data) function 740 match = !eval_expr(expr->unary_op.expr, action_data); 743 match = eval_expr(expr->expr_op.lhs, action_data); 747 match = eval_expr(expr->expr_op.rhs, action_data); 794 return eval_expr(action->expr, action_data); 2887 match = eval_expr(atom->data, &eval_action); 2937 match = eval_expr(atom->data, &eval_action); 3041 match = eval_expr(atom->data, &eval_action);
|
Completed in 136 milliseconds