1 /* PSPP - a program for statistical analysis.
2 Copyright (C) 2017 Free Software Foundation, Inc.
4 This program is free software: you can redistribute it and/or modify
5 it under the terms of the GNU General Public License as published by
6 the Free Software Foundation, either version 3 of the License, or
7 (at your option) any later version.
9 This program is distributed in the hope that it will be useful,
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 GNU General Public License for more details.
14 You should have received a copy of the GNU General Public License
15 along with this program. If not, see <http://www.gnu.org/licenses/>. */
19 #include "data/case.h"
20 #include "data/casereader.h"
21 #include "data/casewriter.h"
22 #include "data/dataset.h"
23 #include "data/dictionary.h"
24 #include "data/format.h"
25 #include "data/transformations.h"
26 #include "data/variable.h"
27 #include "language/command.h"
28 #include "language/data-io/data-parser.h"
29 #include "language/data-io/data-reader.h"
30 #include "language/data-io/file-handle.h"
31 #include "language/data-io/inpt-pgm.h"
32 #include "language/data-io/placement-parser.h"
33 #include "language/lexer/lexer.h"
34 #include "language/lexer/variable-parser.h"
35 #include "libpspp/i18n.h"
36 #include "libpspp/message.h"
37 #include "libpspp/misc.h"
40 #include "gl/xalloc.h"
43 #define _(msgid) gettext (msgid)
45 /* DATA LIST transformation data. */
48 struct data_parser *parser; /* Parser. */
49 struct dfm_reader *reader; /* Data file reader. */
50 struct variable *end; /* Variable specified on END subcommand. */
53 static trns_free_func data_list_trns_free;
54 static trns_proc_func data_list_trns_proc;
69 static const int ROWTYPE_WIDTH = 8;
73 enum triangle triangle;
74 enum diagonal diagonal;
75 const struct variable *rowtype;
76 const struct variable *varname;
77 int n_continuous_vars;
78 struct variable **split_vars;
84 valid rowtype_ values:
101 /* Sets the value of OUTCASE which corresponds to VNAME
102 to the value STR. VNAME must be of type string.
105 set_varname_column (struct ccase *outcase, const struct variable *vname,
108 int len = var_get_width (vname);
109 uint8_t *s = value_str_rw (case_data_rw (outcase, vname), len);
111 strncpy ((char *) s, str, len);
115 blank_varname_column (struct ccase *outcase, const struct variable *vname)
117 int len = var_get_width (vname);
118 uint8_t *s = value_str_rw (case_data_rw (outcase, vname), len);
120 memset (s, ' ', len);
123 static struct casereader *
124 preprocess (struct casereader *casereader0, const struct dictionary *dict, void *aux)
126 struct matrix_format *mformat = aux;
127 const struct caseproto *proto = casereader_get_proto (casereader0);
128 struct casewriter *writer = autopaging_writer_create (proto);
129 struct ccase *prev_case = NULL;
130 double **matrices = NULL;
133 const size_t sizeof_matrix =
134 sizeof (double) * mformat->n_continuous_vars * mformat->n_continuous_vars;
137 /* Make an initial pass to populate our temporary matrix */
138 struct casereader *pass0 = casereader_clone (casereader0);
140 union value *prev_values = xcalloc (mformat->n_split_vars, sizeof *prev_values);
141 int row = (mformat->triangle == LOWER && mformat->diagonal == NO_DIAGONAL) ? 1 : 0;
142 bool first_case = true;
143 for (; (c = casereader_read (pass0)) != NULL; case_unref (c))
150 for (s = 0; s < mformat->n_split_vars; ++s)
152 const struct variable *svar = mformat->split_vars[s];
153 const union value *sv = case_data (c, svar);
154 if (! value_equal (prev_values + s, sv, var_get_width (svar)))
163 if (matrices == NULL || ! match)
165 row = (mformat->triangle == LOWER && mformat->diagonal == NO_DIAGONAL) ?
169 matrices = xrealloc (matrices, sizeof (double*) * n_splits);
170 matrices[n_splits - 1] = xmalloc (sizeof_matrix);
173 for (s = 0; s < mformat->n_split_vars; ++s)
175 const struct variable *svar = mformat->split_vars[s];
176 const union value *sv = case_data (c, svar);
177 value_clone (prev_values + s, sv, var_get_width (svar));
180 int c_offset = (mformat->triangle == UPPER) ? row : 0;
181 if (mformat->triangle == UPPER && mformat->diagonal == NO_DIAGONAL)
183 const union value *v = case_data (c, mformat->rowtype);
184 const char *val = (const char *) value_str (v, ROWTYPE_WIDTH);
185 if (0 == strncasecmp (val, "corr ", ROWTYPE_WIDTH) ||
186 0 == strncasecmp (val, "cov ", ROWTYPE_WIDTH))
188 if (row >= mformat->n_continuous_vars)
191 _("There are %d variable declared but the data has at least %d matrix rows."),
192 mformat->n_continuous_vars, row + 1);
194 casereader_destroy (pass0);
199 for (col = c_offset; col < mformat->n_continuous_vars; ++col)
201 const struct variable *var =
204 var_get_dict_index (mformat->varname));
206 double e = case_data (c, var)->f;
210 /* Fill in the lower triangle */
211 (matrices[n_splits-1])[col + mformat->n_continuous_vars * row] = e;
213 if (mformat->triangle != FULL)
214 /* Fill in the upper triangle */
215 (matrices[n_splits-1]) [row + mformat->n_continuous_vars * col] = e;
220 casereader_destroy (pass0);
223 /* Now make a second pass to fill in the other triangle from our
225 const int idx = var_get_dict_index (mformat->varname);
231 struct ccase *outcase = case_create (proto);
232 union value *v = case_data_rw (outcase, mformat->rowtype);
233 uint8_t *n = value_str_rw (v, ROWTYPE_WIDTH);
234 memcpy (n, "N ", ROWTYPE_WIDTH);
235 blank_varname_column (outcase, mformat->varname);
236 for (col = 0; col < mformat->n_continuous_vars; ++col)
238 union value *dest_val =
239 case_data_rw_idx (outcase,
240 1 + col + var_get_dict_index (mformat->varname));
241 dest_val->f = mformat->n;
243 casewriter_write (writer, outcase);
247 prev_values = xcalloc (mformat->n_split_vars, sizeof *prev_values);
249 for (; (c = casereader_read (casereader0)) != NULL; prev_case = c)
256 for (s = 0; s < mformat->n_split_vars; ++s)
258 const struct variable *svar = mformat->split_vars[s];
259 const union value *sv = case_data (c, svar);
260 if (! value_equal (prev_values + s, sv, var_get_width (svar)))
274 for (s = 0; s < mformat->n_split_vars; ++s)
276 const struct variable *svar = mformat->split_vars[s];
277 const union value *sv = case_data (c, svar);
278 value_clone (prev_values + s, sv, var_get_width (svar));
281 case_unref (prev_case);
282 const union value *v = case_data (c, mformat->rowtype);
283 const char *val = (const char *) value_str (v, ROWTYPE_WIDTH);
286 if (0 == strncasecmp (val, "n ", ROWTYPE_WIDTH) ||
287 0 == strncasecmp (val, "n_vector", ROWTYPE_WIDTH))
290 _("The N subcommand was specified, but a N record was also found in the data. The N record will be ignored."));
295 struct ccase *outcase = case_create (proto);
296 case_copy (outcase, 0, c, 0, caseproto_get_n_widths (proto));
298 if (0 == strncasecmp (val, "corr ", ROWTYPE_WIDTH) ||
299 0 == strncasecmp (val, "cov ", ROWTYPE_WIDTH))
302 const struct variable *var = dict_get_var (dict, idx + 1 + row);
303 set_varname_column (outcase, mformat->varname, var_get_name (var));
304 value_copy (case_data_rw (outcase, mformat->rowtype), v, ROWTYPE_WIDTH);
306 for (col = 0; col < mformat->n_continuous_vars; ++col)
308 union value *dest_val =
309 case_data_rw_idx (outcase,
310 1 + col + var_get_dict_index (mformat->varname));
311 dest_val->f = (matrices[n_splits - 1])[col + mformat->n_continuous_vars * row];
312 if (col == row && mformat->diagonal == NO_DIAGONAL)
319 blank_varname_column (outcase, mformat->varname);
322 /* Special case for SD and N_VECTOR: Rewrite as STDDEV and N respectively */
323 if (0 == strncasecmp (val, "sd ", ROWTYPE_WIDTH))
325 value_copy_buf_rpad (case_data_rw (outcase, mformat->rowtype), ROWTYPE_WIDTH,
326 (uint8_t *) "STDDEV", 6, ' ');
328 else if (0 == strncasecmp (val, "n_vector", ROWTYPE_WIDTH))
330 value_copy_buf_rpad (case_data_rw (outcase, mformat->rowtype), ROWTYPE_WIDTH,
331 (uint8_t *) "N", 1, ' ');
334 casewriter_write (writer, outcase);
337 /* If NODIAGONAL is specified, then a final case must be written */
338 if (mformat->diagonal == NO_DIAGONAL)
341 struct ccase *outcase = case_create (proto);
344 case_copy (outcase, 0, prev_case, 0, caseproto_get_n_widths (proto));
346 const struct variable *var = dict_get_var (dict, idx + 1 + row);
347 set_varname_column (outcase, mformat->varname, var_get_name (var));
349 for (col = 0; col < mformat->n_continuous_vars; ++col)
351 union value *dest_val =
352 case_data_rw_idx (outcase, 1 + col +
353 var_get_dict_index (mformat->varname));
354 dest_val->f = (matrices[n_splits - 1]) [col + mformat->n_continuous_vars * row];
355 if (col == row && mformat->diagonal == NO_DIAGONAL)
359 casewriter_write (writer, outcase);
364 case_unref (prev_case);
367 for (i = 0 ; i < n_splits; ++i)
370 struct casereader *reader1 = casewriter_make_reader (writer);
371 casereader_destroy (casereader0);
377 case_unref (prev_case);
379 for (i = 0 ; i < n_splits; ++i)
382 casereader_destroy (casereader0);
383 casewriter_destroy (writer);
388 cmd_matrix (struct lexer *lexer, struct dataset *ds)
390 struct dictionary *dict;
391 struct data_parser *parser;
392 struct dfm_reader *reader;
393 struct file_handle *fh = NULL;
394 char *encoding = NULL;
395 struct matrix_format mformat;
400 mformat.triangle = LOWER;
401 mformat.diagonal = DIAGONAL;
402 mformat.n_split_vars = 0;
403 mformat.split_vars = NULL;
406 dict = (in_input_program ()
408 : dict_create (get_default_encoding ()));
409 parser = data_parser_create (dict);
412 data_parser_set_type (parser, DP_DELIMITED);
413 data_parser_set_warn_missing_fields (parser, false);
414 data_parser_set_span (parser, false);
416 mformat.rowtype = dict_create_var (dict, "ROWTYPE_", ROWTYPE_WIDTH);
418 mformat.n_continuous_vars = 0;
419 mformat.n_split_vars = 0;
421 if (! lex_force_match_id (lexer, "VARIABLES"))
424 lex_match (lexer, T_EQUALS);
426 if (! parse_mixed_vars (lexer, dict, &names, &n_names, PV_NO_DUPLICATE))
429 for (i = 0; i < n_names; ++i)
435 int longest_name = 0;
436 for (i = 0; i < n_names; ++i)
438 maximize_int (&longest_name, strlen (names[i]));
441 mformat.varname = dict_create_var (dict, "VARNAME_",
442 8 * DIV_RND_UP (longest_name, 8));
444 for (i = 0; i < n_names; ++i)
446 if (0 == strcasecmp (names[i], "ROWTYPE_"))
448 const struct fmt_spec fmt = fmt_for_input (FMT_A, 8, 0);
449 data_parser_add_delimited_field (parser,
451 var_get_case_index (mformat.rowtype),
456 const struct fmt_spec fmt = fmt_for_input (FMT_F, 10, 4);
457 struct variable *v = dict_create_var (dict, names[i], 0);
458 var_set_both_formats (v, &fmt);
459 data_parser_add_delimited_field (parser,
461 var_get_case_index (mformat.varname) +
462 ++mformat.n_continuous_vars,
466 for (i = 0; i < n_names; ++i)
470 while (lex_token (lexer) != T_ENDCMD)
472 if (! lex_force_match (lexer, T_SLASH))
475 if (lex_match_id (lexer, "N"))
477 lex_match (lexer, T_EQUALS);
479 if (! lex_force_int (lexer))
482 mformat.n = lex_integer (lexer);
485 msg (SE, _("%s must not be negative."), "N");
490 else if (lex_match_id (lexer, "FORMAT"))
492 lex_match (lexer, T_EQUALS);
494 while (lex_token (lexer) != T_SLASH && (lex_token (lexer) != T_ENDCMD))
496 if (lex_match_id (lexer, "LIST"))
498 data_parser_set_span (parser, false);
500 else if (lex_match_id (lexer, "FREE"))
502 data_parser_set_span (parser, true);
504 else if (lex_match_id (lexer, "UPPER"))
506 mformat.triangle = UPPER;
508 else if (lex_match_id (lexer, "LOWER"))
510 mformat.triangle = LOWER;
512 else if (lex_match_id (lexer, "FULL"))
514 mformat.triangle = FULL;
516 else if (lex_match_id (lexer, "DIAGONAL"))
518 mformat.diagonal = DIAGONAL;
520 else if (lex_match_id (lexer, "NODIAGONAL"))
522 mformat.diagonal = NO_DIAGONAL;
526 lex_error (lexer, NULL);
531 else if (lex_match_id (lexer, "FILE"))
533 lex_match (lexer, T_EQUALS);
535 fh = fh_parse (lexer, FH_REF_FILE | FH_REF_INLINE, NULL);
539 else if (lex_match_id (lexer, "SPLIT"))
541 lex_match (lexer, T_EQUALS);
542 if (! parse_variables (lexer, dict, &mformat.split_vars, &mformat.n_split_vars, 0))
544 free (mformat.split_vars);
548 for (i = 0; i < mformat.n_split_vars; ++i)
550 const struct fmt_spec fmt = fmt_for_input (FMT_F, 4, 0);
551 var_set_both_formats (mformat.split_vars[i], &fmt);
553 dict_reorder_vars (dict, mformat.split_vars, mformat.n_split_vars);
554 mformat.n_continuous_vars -= mformat.n_split_vars;
558 lex_error (lexer, NULL);
563 if (mformat.diagonal == NO_DIAGONAL && mformat.triangle == FULL)
565 msg (SE, _("FORMAT = FULL and FORMAT = NODIAGONAL are mutually exclusive."));
570 fh = fh_inline_file ();
571 fh_set_default_handle (fh);
573 if (!data_parser_any_fields (parser))
575 msg (SE, _("At least one variable must be specified."));
579 if (lex_end_of_command (lexer) != CMD_SUCCESS)
582 reader = dfm_open_reader (fh, lexer, encoding);
586 if (in_input_program ())
588 struct data_list_trns *trns = xmalloc (sizeof *trns);
589 trns->parser = parser;
590 trns->reader = reader;
592 add_transformation (ds, data_list_trns_proc, data_list_trns_free, trns);
596 data_parser_make_active_file (parser, ds, reader, dict, preprocess,
602 free (mformat.split_vars);
604 return CMD_DATA_LIST;
607 data_parser_destroy (parser);
608 if (!in_input_program ())
612 free (mformat.split_vars);
613 return CMD_CASCADING_FAILURE;
617 /* Input procedure. */
619 /* Destroys DATA LIST transformation TRNS.
620 Returns true if successful, false if an I/O error occurred. */
622 data_list_trns_free (void *trns_)
624 struct data_list_trns *trns = trns_;
625 data_parser_destroy (trns->parser);
626 dfm_close_reader (trns->reader);
631 /* Handle DATA LIST transformation TRNS, parsing data into *C. */
633 data_list_trns_proc (void *trns_, struct ccase **c, casenumber case_num UNUSED)
635 struct data_list_trns *trns = trns_;
638 *c = case_unshare (*c);
639 if (data_parser_parse (trns->parser, trns->reader, *c))
640 retval = TRNS_CONTINUE;
641 else if (dfm_reader_error (trns->reader) || dfm_eof (trns->reader) > 1)
643 /* An I/O error, or encountering end of file for a second
644 time, should be escalated into a more serious error. */
648 retval = TRNS_END_FILE;
650 /* If there was an END subcommand handle it. */
651 if (trns->end != NULL)
653 double *end = &case_data_rw (*c, trns->end)->f;
654 if (retval == TRNS_END_FILE)
657 retval = TRNS_CONTINUE;