X-Git-Url: https://pintos-os.org/cgi-bin/gitweb.cgi?a=blobdiff_plain;f=src%2Flanguage%2Fexpressions%2Foptimize.c;h=8f090778ab9c80a20fc6f44a24e7a7ba5b5d21aa;hb=81579d9e9f994fb2908f50af41c3eb033d216e58;hp=154517927dee47bdecaa68fe93d4af926dd0227f;hpb=97d4f38945476834fd7fce612b663f19f2b291f8;p=pspp-builds.git diff --git a/src/language/expressions/optimize.c b/src/language/expressions/optimize.c index 15451792..8f090778 100644 --- a/src/language/expressions/optimize.c +++ b/src/language/expressions/optimize.c @@ -1,40 +1,41 @@ -/* PSPP - computes sample statistics. - Copyright (C) 1997-9, 2000 Free Software Foundation, Inc. - Written by Ben Pfaff . +/* PSPP - a program for statistical analysis. + Copyright (C) 1997-9, 2000, 2011 Free Software Foundation, Inc. - 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 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 3 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. + 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. */ + along with this program. If not, see . */ #include -#include "private.h" + +#include "language/expressions/private.h" + #include #include #include #include -#include -#include -#include -#include -#include -#include "evaluate.h" -#include "helpers.h" -#include -#include -#include "public.h" -#include -#include + +#include "data/calendar.h" +#include "data/data-in.h" +#include "data/variable.h" +#include "language/expressions/evaluate.h" +#include "language/expressions/helpers.h" +#include "language/expressions/public.h" +#include "libpspp/assertion.h" +#include "libpspp/message.h" +#include "libpspp/misc.h" +#include "libpspp/pool.h" +#include "libpspp/str.h" + +#include "gl/xalloc.h" static union any_node *evaluate_tree (struct composite_node *, struct expression *); @@ -45,7 +46,7 @@ expr_optimize (union any_node *node, struct expression *e) { int nonconst_cnt = 0; /* Number of nonconstant children. */ int sysmis_cnt = 0; /* Number of system-missing children. */ - struct operation *op; + const struct operation *op; struct composite_node *c; int i; @@ -79,20 +80,20 @@ expr_optimize (union any_node *node, struct expression *e) else return expr_allocate_boolean (e, SYSMIS); } - else if (!nonconst_cnt && (op->flags & OPF_NONOPTIMIZABLE) == 0) + else if (!nonconst_cnt && (op->flags & OPF_NONOPTIMIZABLE) == 0) { /* Evaluate constant expressions. */ return evaluate_tree (&node->composite, e); } - else + else { /* A few optimization possibilities are still left. */ - return optimize_tree (node, e); + return optimize_tree (node, e); } } static int -eq_double (union any_node *node, double n) +eq_double (union any_node *node, double n) { return node->type == OP_number && node->number.n == n; } @@ -109,7 +110,7 @@ optimize_tree (union any_node *node, struct expression *e) /* x+0, x-0, 0+x => x. */ if ((n->type == OP_ADD || n->type == OP_SUB) && eq_double (n->args[1], 0.)) return n->args[0]; - else if (n->type == OP_ADD && eq_double (n->args[0], 0.)) + else if (n->type == OP_ADD && eq_double (n->args[0], 0.)) return n->args[1]; /* x*1, x/1, 1*x => x. */ @@ -118,7 +119,7 @@ optimize_tree (union any_node *node, struct expression *e) return n->args[0]; else if (n->type == OP_MUL && eq_double (n->args[0], 1.)) return n->args[1]; - + /* 0*x, 0/x, x*0, MOD(0,x) => 0. */ else if (((n->type == OP_MUL || n->type == OP_DIV || n->type == OP_MOD_nn) && eq_double (n->args[0], 0.)) @@ -128,7 +129,7 @@ optimize_tree (union any_node *node, struct expression *e) /* x**1 => x. */ else if (n->type == OP_POW && eq_double (n->args[1], 1)) return n->args[0]; - + /* x**2 => SQUARE(x). */ else if (n->type == OP_POW && eq_double (n->args[1], 2)) return expr_allocate_unary (e, OP_SQUARE, n->args[0]); @@ -153,7 +154,7 @@ static const struct fmt_spec *get_format_arg (struct composite_node *, static union any_node * evaluate_tree (struct composite_node *node, struct expression *e) { - switch (node->type) + switch (node->type) { #include "optimize.inc" @@ -165,7 +166,7 @@ evaluate_tree (struct composite_node *node, struct expression *e) } static double -get_number_arg (struct composite_node *c, size_t arg_idx) +get_number_arg (struct composite_node *c, size_t arg_idx) { assert (arg_idx < c->arg_cnt); assert (c->args[arg_idx]->type == OP_number @@ -175,7 +176,7 @@ get_number_arg (struct composite_node *c, size_t arg_idx) static double * get_number_args (struct composite_node *c, size_t arg_idx, size_t arg_cnt, - struct expression *e) + struct expression *e) { double *d; size_t i; @@ -187,7 +188,7 @@ get_number_args (struct composite_node *c, size_t arg_idx, size_t arg_cnt, } static struct substring -get_string_arg (struct composite_node *c, size_t arg_idx) +get_string_arg (struct composite_node *c, size_t arg_idx) { assert (arg_idx < c->arg_cnt); assert (c->args[arg_idx]->type == OP_string); @@ -196,7 +197,7 @@ get_string_arg (struct composite_node *c, size_t arg_idx) static struct substring * get_string_args (struct composite_node *c, size_t arg_idx, size_t arg_cnt, - struct expression *e) + struct expression *e) { struct substring *s; size_t i; @@ -208,7 +209,7 @@ get_string_args (struct composite_node *c, size_t arg_idx, size_t arg_cnt, } static const struct fmt_spec * -get_format_arg (struct composite_node *c, size_t arg_idx) +get_format_arg (struct composite_node *c, size_t arg_idx) { assert (arg_idx < c->arg_cnt); assert (c->args[arg_idx]->type == OP_ni_format @@ -223,50 +224,50 @@ static union operation_data *allocate_aux (struct expression *, static void flatten_node (union any_node *, struct expression *); static void -emit_operation (struct expression *e, operation_type type) +emit_operation (struct expression *e, operation_type type) { allocate_aux (e, OP_operation)->operation = type; } static void -emit_number (struct expression *e, double n) +emit_number (struct expression *e, double n) { allocate_aux (e, OP_number)->number = n; } static void -emit_string (struct expression *e, struct substring s) +emit_string (struct expression *e, struct substring s) { allocate_aux (e, OP_string)->string = s; } static void -emit_format (struct expression *e, const struct fmt_spec *f) +emit_format (struct expression *e, const struct fmt_spec *f) { allocate_aux (e, OP_format)->format = pool_clone (e->expr_pool, f, sizeof *f); } static void -emit_variable (struct expression *e, struct variable *v) +emit_variable (struct expression *e, const struct variable *v) { allocate_aux (e, OP_variable)->variable = v; } static void -emit_vector (struct expression *e, const struct vector *v) +emit_vector (struct expression *e, const struct vector *v) { allocate_aux (e, OP_vector)->vector = v; } static void -emit_integer (struct expression *e, int i) +emit_integer (struct expression *e, int i) { allocate_aux (e, OP_integer)->integer = i; } -void -expr_flatten (union any_node *n, struct expression *e) +void +expr_flatten (union any_node *n, struct expression *e) { flatten_node (n, e); e->type = expr_node_returns (n); @@ -277,7 +278,7 @@ expr_flatten (union any_node *n, struct expression *e) static void flatten_atom (union any_node *n, struct expression *e) { - switch (n->type) + switch (n->type) { case OP_number: case OP_boolean: @@ -308,9 +309,9 @@ flatten_atom (union any_node *n, struct expression *e) static void flatten_composite (union any_node *n, struct expression *e) { - struct operation *op = &operations[n->type]; + const struct operation *op = &operations[n->type]; size_t i; - + for (i = 0; i < n->composite.arg_cnt; i++) flatten_node (n->composite.args[i], e); @@ -320,7 +321,7 @@ flatten_composite (union any_node *n, struct expression *e) for (i = 0; i < n->composite.arg_cnt; i++) { union any_node *arg = n->composite.args[i]; - switch (arg->type) + switch (arg->type) { case OP_num_var: case OP_str_var: @@ -339,7 +340,7 @@ flatten_composite (union any_node *n, struct expression *e) case OP_pos_int: emit_integer (e, arg->integer.i); break; - + default: /* Nothing to do. */ break; @@ -361,14 +362,14 @@ flatten_node (union any_node *n, struct expression *e) flatten_atom (n, e); else if (is_composite (n->type)) flatten_composite (n, e); - else + else NOT_REACHED (); } static union operation_data * -allocate_aux (struct expression *e, operation_type type) +allocate_aux (struct expression *e, operation_type type) { - if (e->op_cnt >= e->op_cap) + if (e->op_cnt >= e->op_cap) { e->op_cap = (e->op_cap + 8) * 3 / 2; e->ops = pool_realloc (e->expr_pool, e->ops, sizeof *e->ops * e->op_cap);