-/* PSPP - computes sample statistics.
+/* PSPP - a program for statistical analysis.
Copyright (C) 1997-9, 2000 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 <http://www.gnu.org/licenses/>. */
#include <config.h>
#include <language/data-io/inpt-pgm.h>
#include <float.h>
+#include <gsl/gsl_math.h>
#include <stdlib.h>
#include <data/case.h>
#include <language/data-io/file-handle.h>
#include <language/expressions/public.h>
#include <language/lexer/lexer.h>
-#include <libpspp/alloc.h>
#include <libpspp/assertion.h>
#include <libpspp/compiler.h>
#include <libpspp/message.h>
#include <libpspp/misc.h>
#include <libpspp/str.h>
+#include "xalloc.h"
+
#include "gettext.h"
#define _(msgid) gettext (msgid)
/* Private result codes for use within INPUT PROGRAM. */
-enum cmd_result_extensions
+enum cmd_result_extensions
{
CMD_END_INPUT_PROGRAM = CMD_PRIVATE_FIRST,
CMD_END_CASE
{
INP_NUMERIC = 01, /* Numeric. */
INP_STRING = 0, /* String. */
-
+
INP_INIT_ONCE = 02, /* Initialize only once. */
INP_REINIT = 0, /* Reinitialize for each iteration. */
};
-struct input_program_pgm
+struct input_program_pgm
{
struct trns_chain *trns_chain;
enum trns_result restart;
- size_t case_nr; /* Incremented by END CASE transformation. */
+ casenumber case_nr; /* Incremented by END CASE transformation. */
struct caseinit *init;
size_t value_cnt;
/* Returns true if we're parsing the inside of a INPUT
PROGRAM...END INPUT PROGRAM construct, false otherwise. */
bool
-in_input_program (void)
+in_input_program (void)
{
return inside_input_program;
}
/* Emits an END CASE transformation for INP. */
static void
-emit_END_CASE (struct dataset *ds, struct input_program_pgm *inp)
+emit_END_CASE (struct dataset *ds, struct input_program_pgm *inp)
{
add_transformation (ds, end_case_trns_proc, NULL, inp);
}
inp = xmalloc (sizeof *inp);
inp->trns_chain = NULL;
inp->init = NULL;
-
+
inside_input_program = true;
- for (;;)
+ for (;;)
{
enum cmd_result result = cmd_parse_in_state (lexer, ds, CMD_STATE_INPUT_PROGRAM);
if (result == CMD_END_INPUT_PROGRAM)
break;
- else if (result == CMD_END_CASE)
+ else if (result == CMD_END_CASE)
{
emit_END_CASE (ds, inp);
- saw_END_CASE = true;
+ saw_END_CASE = true;
}
else if (cmd_result_is_failure (result) && result != CMD_FAILURE)
{
emit_END_CASE (ds, inp);
inside_input_program = false;
- if (dict_get_next_value_idx (dataset_dict (ds)) == 0)
+ if (dict_get_next_value_idx (dataset_dict (ds)) == 0)
{
msg (SE, _("Input program did not create any variables."));
proc_discard_active_file (ds);
destroy_input_program (inp);
return CMD_FAILURE;
}
-
+
inp->trns_chain = proc_capture_transformations (ds);
trns_chain_finalize (inp->trns_chain);
inp->init = caseinit_create ();
caseinit_mark_for_init (inp->init, dataset_dict (ds));
inp->value_cnt = dict_get_next_value_idx (dataset_dict (ds));
-
+
proc_set_active_file_data (
ds, casereader_create_sequential (NULL, inp->value_cnt, CASENUMBER_MAX,
&input_program_casereader_class, inp));
cmd_end_input_program (struct lexer *lexer UNUSED, struct dataset *ds UNUSED)
{
assert (in_input_program ());
- return CMD_END_INPUT_PROGRAM;
+ return CMD_END_INPUT_PROGRAM;
}
/* Returns true if STATE is valid given the transformations that
are allowed within INPUT PROGRAM. */
static bool
-is_valid_state (enum trns_result state)
+is_valid_state (enum trns_result state)
{
return (state == TRNS_CONTINUE
|| state == TRNS_ERROR
do
{
assert (is_valid_state (inp->restart));
- if (inp->restart == TRNS_ERROR || inp->restart == TRNS_END_FILE)
+ if (inp->restart == TRNS_ERROR || inp->restart == TRNS_END_FILE)
{
case_destroy (c);
- return false;
+ return false;
}
- caseinit_init_reinit_vars (inp->init, c);
- caseinit_init_left_vars (inp->init, c);
+ caseinit_init_vars (inp->init, c);
inp->restart = trns_chain_execute (inp->trns_chain, inp->restart,
- c, &inp->case_nr);
+ c, inp->case_nr);
assert (is_valid_state (inp->restart));
caseinit_update_left_vars (inp->init, c);
}
}
static void
-destroy_input_program (struct input_program_pgm *pgm)
+destroy_input_program (struct input_program_pgm *pgm)
{
- if (pgm != NULL)
+ if (pgm != NULL)
{
trns_chain_destroy (pgm->trns_chain);
caseinit_destroy (pgm->init);
if (lex_match_id (lexer, "COLUMN"))
{
lex_match (lexer, '=');
-
+
if (e)
{
msg (SE, _("COLUMN subcommand multiply specified."));
expr_free (e);
return CMD_CASCADING_FAILURE;
}
-
+
e = expr_parse (lexer, ds, EXPR_NUMBER);
if (!e)
return CMD_CASCADING_FAILURE;
else if (lex_match_id (lexer, "FILE"))
{
lex_match (lexer, '=');
+ fh_unref (fh);
fh = fh_parse (lexer, FH_REF_FILE | FH_REF_INLINE);
if (fh == NULL)
{
t->column = e;
add_transformation (ds, reread_trns_proc, reread_trns_free, t);
+ fh_unref (fh);
return CMD_SUCCESS;
}
else
{
double column = expr_evaluate_num (t->column, c, case_num);
- if (!finite (column) || column < 1)
+ if (!gsl_finite (column) || column < 1)
{
msg (SE, _("REREAD: Column numbers must be positive finite "
"numbers. Column set to 1."));