1 /* PSPP - computes sample statistics.
2 Copyright (C) 1997-9, 2000 Free Software Foundation, Inc.
3 Written by Ben Pfaff <blp@gnu.org>.
5 This program is free software; you can redistribute it and/or
6 modify it under the terms of the GNU General Public License as
7 published by the Free Software Foundation; either version 2 of the
8 License, or (at your option) any later version.
10 This program is distributed in the hope that it will be useful, but
11 WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with this program; if not, write to the Free Software
17 Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
24 #include <libpspp/alloc.h>
25 #include <libpspp/message.h>
28 #include <libpspp/pool.h>
31 expr_evaluate (struct expression *e, const struct ccase *c, int case_idx,
34 union operation_data *op = e->ops;
36 double *ns = e->number_stack;
37 struct fixed_string *ss = e->string_stack;
39 assert ((c != NULL) == (e->dict != NULL));
40 pool_clear (e->eval_pool);
44 assert (op < e->ops + e->op_cnt);
45 switch (op++->operation)
54 const struct fixed_string *s = &op++->string;
55 *ss++ = copy_string (e, s->string, s->length);
59 case OP_return_number:
60 *(double *) result = finite (ns[-1]) ? ns[-1] : SYSMIS;
63 case OP_return_string:
64 *(struct fixed_string *) result = ss[-1];
67 #include "evaluate.inc"
76 expr_evaluate_num (struct expression *e, const struct ccase *c, int case_idx)
80 assert (e->type == OP_number || e->type == OP_boolean);
81 expr_evaluate (e, c, case_idx, &d);
88 expr_evaluate_str (struct expression *e, const struct ccase *c, int case_idx,
89 char *dst, size_t dst_size)
91 struct fixed_string s;
93 assert (e->type == OP_string);
94 assert ((dst == NULL) == (dst_size == 0));
95 expr_evaluate (e, c, case_idx, &s);
97 copy_mangle (dst, dst_size, s.string, s.length);
100 #include <language/lexer/lexer.h>
101 #include <language/command.h>
104 cmd_debug_evaluate (void)
106 bool optimize = true;
107 int retval = CMD_FAILURE;
108 bool dump_postfix = false;
109 struct dictionary *d = NULL;
110 struct ccase *c = NULL;
112 struct expression *expr;
116 if (lex_match_id ("NOOPTIMIZE"))
118 else if (lex_match_id ("POSTFIX"))
120 else if (lex_match ('('))
122 char name[LONG_NAME_LEN + 1];
124 size_t old_value_cnt;
127 if (!lex_force_id ())
129 strcpy (name, tokid);
132 if (!lex_force_match ('='))
135 if (lex_is_number ())
138 fprintf (stderr, "(%s = %.2f)", name, tokval);
140 else if (token == T_STRING)
142 width = ds_length (&tokstr);
143 fprintf (stderr, "(%s = \"%.2s\")", name, ds_c_str (&tokstr));
147 lex_error (_("expecting number or string"));
154 old_value_cnt = dict_get_next_value_idx (d);
155 v = dict_create_var (d, name, width);
158 msg (SE, _("Duplicate variable name %s."), name);
164 c = xmalloc (sizeof *c);
167 case_resize (c, old_value_cnt, dict_get_next_value_idx (d));
169 if (lex_is_number ())
170 case_data_rw (c, v->fv)->f = tokval;
172 memcpy (case_data_rw (c, v->fv)->s, ds_data (&tokstr),
176 if (!lex_force_match (')'))
184 lex_force_match ('/');
188 fprintf (stderr, "; ");
189 fprintf (stderr, "%s => ", lex_rest_of_line (NULL));
192 expr = expr_parse_any (d, optimize);
193 if (!expr || lex_end_of_command () != CMD_SUCCESS)
197 fprintf (stderr, "error\n");
202 expr_debug_print_postfix (expr);
208 double d = expr_evaluate_num (expr, c, 0);
210 fprintf (stderr, "sysmis\n");
212 fprintf (stderr, "%.2f\n", d);
218 double b = expr_evaluate_num (expr, c, 0);
219 fprintf (stderr, "%s\n",
220 b == SYSMIS ? "sysmis" : b == 0.0 ? "false" : "true");
226 struct fixed_string s;
227 expr_evaluate (expr, c, 0, &s);
230 fwrite (s.string, s.length, 1, stderr);
231 fputs ("\"\n", stderr);
240 retval = CMD_SUCCESS;
253 expr_debug_print_postfix (const struct expression *e)
257 for (i = 0; i < e->op_cnt; i++)
259 union operation_data *op = &e->ops[i];
262 switch (e->op_types[i])
265 if (op->operation == OP_return_number)
266 fprintf (stderr, "return_number");
267 else if (op->operation == OP_return_string)
268 fprintf (stderr, "return_string");
269 else if (is_function (op->operation))
270 fprintf (stderr, "%s", operations[op->operation].prototype);
271 else if (is_composite (op->operation))
272 fprintf (stderr, "%s", operations[op->operation].name);
274 fprintf (stderr, "%s:", operations[op->operation].name);
277 if (op->number != SYSMIS)
278 fprintf (stderr, "n<%g>", op->number);
280 fprintf (stderr, "n<SYSMIS>");
283 fprintf (stderr, "s<%.*s>",
284 (int) op->string.length,
285 op->string.string != NULL ? op->string.string : "");
288 fprintf (stderr, "f<%s%d.%d>",
289 formats[op->format->type].name,
290 op->format->w, op->format->d);
293 fprintf (stderr, "v<%s>", op->variable->name);
296 fprintf (stderr, "vec<%s>", op->vector->name);
299 fprintf (stderr, "i<%d>", op->integer);
305 fprintf (stderr, "\n");