#include <stdlib.h>
#include "alloc.h"
#include "command.h"
+#include "data-list.h"
#include "dfm.h"
#include "error.h"
#include "expr.h"
#include "file-handle.h"
-#include "inpt-pgm.h"
#include "lexer.h"
#include "misc.h"
#include "str.h"
#include "debug-print.h"
-/* A bit-vector of two-bit entries. The array tells INPUT PROGRAM how
- to initialize each `value'. Modified by envector(), devector(),
- which are called by create_variable(), also by LEAVE, COMPUTE(!). */
-unsigned char *inp_init;
-
-/* Number of bytes allocated for inp_init. */
-size_t inp_init_size;
+/* Indicates how a `union value' should be initialized. */
+enum value_init_type
+ {
+ INP_NUMERIC = 01, /* Numeric. */
+ INP_STRING = 0, /* String. */
+
+ INP_INIT_ONCE = 02, /* Initialize only once. */
+ INP_REINIT = 0, /* Reinitialize for each iteration. */
+ };
-/* Number of `values' created inside INPUT PROGRAM. */
-static int inp_nval;
+struct input_program_pgm
+ {
+ enum value_init_type *init; /* How to initialize each `union value'. */
+ size_t init_cnt; /* Number of elements in inp_init. */
+ };
static int end_case_trns_proc (struct trns_header *, struct ccase *);
static int end_file_trns_proc (struct trns_header * t, struct ccase * c);
lex_match_id ("PROGRAM");
discard_variables ();
- vfm_source = &input_program_source;
-
- inp_init = NULL;
- inp_init_size = 0;
+ vfm_source = create_case_source (&input_program_source_class, NULL);
return lex_end_of_command ();
}
int
cmd_end_input_program (void)
{
+ struct input_program_pgm *inp;
+ size_t i;
+
lex_match_id ("END");
lex_match_id ("INPUT");
lex_match_id ("PROGRAM");
- if (vfm_source != &input_program_source)
+ if (!case_source_is_class (vfm_source, &input_program_source_class))
{
msg (SE, _("No matching INPUT PROGRAM command."));
return CMD_FAILURE;
}
- if (default_dict.nval == 0)
+ if (dict_get_next_value_idx (default_dict) == 0)
msg (SW, _("No data-input or transformation commands specified "
"between INPUT PROGRAM and END INPUT PROGRAM."));
- /* Mark the boundary between INPUT PROGRAM and more-mundane
- transformations. */
+ /* Mark the boundary between INPUT PROGRAM transformations and
+ ordinary transformations. */
f_trns = n_trns;
- /* Mark the boundary between input program `values' and
- later-created `values'. */
- inp_nval = default_dict.nval;
+ /* Figure out how to initialize temp_case. */
+ inp = xmalloc (sizeof *inp);
+ inp->init_cnt = dict_get_next_value_idx (default_dict);
+ inp->init = xmalloc (inp->init_cnt * sizeof *inp->init);
+ for (i = 0; i < inp->init_cnt; i++)
+ inp->init[i] = -1;
+ for (i = 0; i < dict_get_var_cnt (default_dict); i++)
+ {
+ struct variable *var = dict_get_var (default_dict, i);
+ enum value_init_type value_init;
+ size_t j;
+
+ value_init = var->type == NUMERIC ? INP_NUMERIC : INP_STRING;
+ value_init |= var->reinit ? INP_REINIT : INP_INIT_ONCE;
+
+ for (j = 0; j < var->nv; j++)
+ inp->init[j + var->fv] = value_init;
+ }
+ for (i = 0; i < inp->init_cnt; i++)
+ assert (inp->init[i] != -1);
+
+ /* Put inp into vfm_source for later use. */
+ vfm_source->aux = inp;
return lex_end_of_command ();
}
/* Initializes temp_case. Called before the first case is read. */
static void
-init_case (void)
+init_case (struct input_program_pgm *inp)
{
- union value *val = temp_case->data;
- unsigned char *cp = inp_init;
- unsigned char c;
- int i, j;
-
- /* This code is 2-3X the complexity it might be, but I felt like
- it. It initializes temp_case union values to 0, or SYSMIS, or
- blanks, as appropriate. */
- for (i = 0; i < inp_nval / 4; i++)
- {
- c = *cp++;
- for (j = 0; j < 4; j++)
- {
- switch (c & INP_MASK)
- {
- case INP_NUMERIC | INP_RIGHT:
- val++->f = SYSMIS;
- break;
- case INP_NUMERIC | INP_LEFT:
- val++->f = 0.0;
- break;
- case INP_STRING | INP_RIGHT:
- case INP_STRING | INP_LEFT:
- memset (val++->s, ' ', MAX_SHORT_STRING);
- break;
- }
- c >>= 2;
- }
- }
- if (inp_nval % 4)
- {
- c = *cp;
- for (j = 0; j < inp_nval % 4; j++)
- {
- switch (c & INP_MASK)
- {
- case INP_NUMERIC | INP_RIGHT:
- val++->f = SYSMIS;
- break;
- case INP_NUMERIC | INP_LEFT:
- val++->f = 0.0;
- break;
- case INP_STRING | INP_RIGHT:
- case INP_STRING | INP_LEFT:
- memset (val++->s, ' ', MAX_SHORT_STRING);
- break;
- }
- c >>= 2;
- }
- }
+ size_t i;
+
+ for (i = 0; i < inp->init_cnt; i++)
+ switch (inp->init[i])
+ {
+ case INP_NUMERIC | INP_INIT_ONCE:
+ temp_case->data[i].f = 0.0;
+ break;
+ case INP_NUMERIC | INP_REINIT:
+ temp_case->data[i].f = SYSMIS;
+ break;
+ case INP_STRING | INP_INIT_ONCE:
+ case INP_STRING | INP_REINIT:
+ memset (temp_case->data[i].s, ' ', sizeof temp_case->data[i].s);
+ break;
+ default:
+ assert (0);
+ }
}
/* Clears temp_case. Called between reading successive records. */
static void
-clear_case (void)
+clear_case (struct input_program_pgm *inp)
{
- union value *val = temp_case->data;
- unsigned char *cp = inp_init;
- unsigned char c;
- int i, j;
-
- /* This code is 2-3X the complexity it might be, but I felt like
- it. It initializes temp_case values to SYSMIS, or
- blanks, or does nothing, as appropriate. */
- for (i = 0; i < inp_nval / 4; i++)
- {
- c = *cp++;
- for (j = 0; j < 4; j++)
- {
- if (!(c & INP_LEFT))
- {
- if (c & INP_STRING)
- memset (val->s, ' ', MAX_SHORT_STRING);
- else
- val->f = SYSMIS;
- }
- val++;
- c >>= 2;
- }
- }
-
- if (inp_nval % 4)
- {
- c = *cp;
- for (j = 0; j < inp_nval % 4; j++)
- {
- if (!(c & INP_LEFT))
- {
- if (c & INP_STRING)
- memset (val->s, ' ', MAX_SHORT_STRING);
- else
- val->f = SYSMIS;
- }
- val++;
- c >>= 2;
- }
- }
+ size_t i;
+
+ for (i = 0; i < inp->init_cnt; i++)
+ switch (inp->init[i])
+ {
+ case INP_NUMERIC | INP_INIT_ONCE:
+ break;
+ case INP_NUMERIC | INP_REINIT:
+ temp_case->data[i].f = SYSMIS;
+ break;
+ case INP_STRING | INP_INIT_ONCE:
+ break;
+ case INP_STRING | INP_REINIT:
+ memset (temp_case->data[i].s, ' ', sizeof temp_case->data[i].s);
+ break;
+ default:
+ assert (0);
+ }
}
/* Executes each transformation in turn on a `blank' case. When a
transformation fails, returning -2, then that's the end of the
file. -1 means go on to the next transformation. Otherwise the
return value is the index of the transformation to go to next. */
-void
-input_program_source_read (void)
+static void
+input_program_source_read (struct case_source *source,
+ write_case_func *write_case,
+ write_case_data wc_data)
{
+ struct input_program_pgm *inp = source->aux;
int i;
/* Nonzero if there were any END CASE commands in the set of
- transformations. */
+ transformations. If so, we don't automatically write out
+ cases. */
int end_case = 0;
- /* We don't automatically write out cases if the user took over
- that prerogative. */
+ assert (inp != NULL);
+
+ /* Figure end_case. */
for (i = 0; i < f_trns; i++)
if (t_trns[i]->proc == end_case_trns_proc)
end_case = 1;
- init_case ();
+ /* FIXME: This code should not be necessary. It is an ugly
+ kluge. */
+ for (i = 0; i < f_trns; i++)
+ if (t_trns[i]->proc == repeating_data_trns_proc)
+ repeating_data_set_write_case (t_trns[i], write_case, wc_data);
+
+ init_case (inp);
for (;;)
{
/* Index of current transformation. */
if (t_trns[i]->proc == end_case_trns_proc)
printf ("\n");
#endif
+
+ if (t_trns[i]->proc == end_case_trns_proc)
+ {
+ if (!write_case (wc_data))
+ return;
+ clear_case (inp);
+ i++;
+ continue;
+ }
+
code = t_trns[i]->proc (t_trns[i], temp_case);
switch (code)
{
/* Write the case if appropriate. */
if (!end_case)
- if (!write_case ())
+ if (!write_case (wc_data))
return;
/* Blank out the case for the next iteration. */
next_case:
- clear_case ();
+ clear_case (inp);
}
}
static void
-input_program_source_destroy_source (void)
+input_program_source_destroy (struct case_source *source)
{
+ struct input_program_pgm *inp = source->aux;
+
cancel_transformations ();
- free (inp_init);
- inp_init = NULL;
+
+ if (inp != NULL)
+ {
+ free (inp->init);
+ free (inp);
+ }
}
-struct case_stream input_program_source =
+const struct case_source_class input_program_source_class =
{
- NULL,
- input_program_source_read,
- NULL,
- NULL,
- input_program_source_destroy_source,
- NULL,
"INPUT PROGRAM",
+ input_program_source_read,
+ input_program_source_destroy,
};
\f
int
lex_match_id ("END");
lex_match_id ("CASE");
- if (vfm_source != &input_program_source)
+ if (!case_source_is_class (vfm_source, &input_program_source_class))
{
msg (SE, _("This command may only be executed between INPUT PROGRAM "
"and END INPUT PROGRAM."));
}
int
-end_case_trns_proc (struct trns_header *t unused, struct ccase * c unused)
+end_case_trns_proc (struct trns_header *t UNUSED, struct ccase * c UNUSED)
{
-#if DEBUGGING
- printf ("END CASE\n");
-#endif
- if (!write_case ())
- return -2;
- clear_case ();
- return -1;
+ assert (0);
}
/* REREAD transformation. */
lex_match_id ("END");
lex_match_id ("FILE");
- if (vfm_source != &input_program_source)
+ if (!case_source_is_class (vfm_source, &input_program_source_class))
{
msg (SE, _("This command may only be executed between INPUT PROGRAM "
"and END INPUT PROGRAM."));
}
static int
-end_file_trns_proc (struct trns_header * t unused, struct ccase * c unused)
+end_file_trns_proc (struct trns_header * t UNUSED, struct ccase * c UNUSED)
{
#if DEBUGGING
printf ("END FILE\n");
projects / pspp-builds.git / blobdiff