+
+/*
+ Free the transformation. Free its linear model if this
+ transformation is the last one.
+ */
+static bool
+regression_trns_free (void *t_)
+{
+ bool result = true;
+ struct reg_trns *t = t_;
+
+ if (t->trns_id == t->n_trns)
+ {
+ result = pspp_linreg_cache_free (t->c);
+ }
+ free (t);
+
+ return result;
+}
+
+/*
+ Gets the predicted values.
+ */
+static int
+regression_trns_pred_proc (void *t_, struct ccase *c,
+ casenumber case_idx UNUSED)
+{
+ size_t i;
+ size_t n_vals;
+ struct reg_trns *trns = t_;
+ pspp_linreg_cache *model;
+ union value *output = NULL;
+ const union value **vals = NULL;
+ const struct variable **vars = NULL;
+
+ assert (trns != NULL);
+ model = trns->c;
+ assert (model != NULL);
+ assert (model->depvar != NULL);
+ assert (model->pred != NULL);
+
+ vars = xnmalloc (model->n_coeffs, sizeof (*vars));
+ n_vals = (*model->get_vars) (model, vars);
+
+ vals = xnmalloc (n_vals, sizeof (*vals));
+ output = case_data_rw (c, model->pred);
+ assert (output != NULL);
+
+ for (i = 0; i < n_vals; i++)
+ {
+ vals[i] = case_data (c, vars[i]);
+ }
+ output->f = (*model->predict) ((const struct variable **) vars,
+ vals, model, n_vals);
+ free (vals);
+ free (vars);
+ return TRNS_CONTINUE;
+}
+
+/*
+ Gets the residuals.
+ */
+static int
+regression_trns_resid_proc (void *t_, struct ccase *c,
+ casenumber case_idx UNUSED)
+{
+ size_t i;
+ size_t n_vals;
+ struct reg_trns *trns = t_;
+ pspp_linreg_cache *model;
+ union value *output = NULL;
+ const union value **vals = NULL;
+ const union value *obs = NULL;
+ const struct variable **vars = NULL;
+
+ assert (trns != NULL);
+ model = trns->c;
+ assert (model != NULL);
+ assert (model->depvar != NULL);
+ assert (model->resid != NULL);
+
+ vars = xnmalloc (model->n_coeffs, sizeof (*vars));
+ n_vals = (*model->get_vars) (model, vars);
+
+ vals = xnmalloc (n_vals, sizeof (*vals));
+ output = case_data_rw (c, model->resid);
+ assert (output != NULL);
+
+ for (i = 0; i < n_vals; i++)
+ {
+ vals[i] = case_data (c, vars[i]);
+ }
+ obs = case_data (c, model->depvar);
+ output->f = (*model->residual) ((const struct variable **) vars,
+ vals, obs, model, n_vals);
+ free (vals);
+ free (vars);
+ return TRNS_CONTINUE;
+}
+
+/*
+ Returns false if NAME is a duplicate of any existing variable name.
+*/
+static bool
+try_name (const struct dictionary *dict, const char *name)
+{
+ if (dict_lookup_var (dict, name) != NULL)
+ return false;
+
+ return true;
+}
+
+static void
+reg_get_name (const struct dictionary *dict, char name[LONG_NAME_LEN],
+ const char prefix[LONG_NAME_LEN])
+{
+ int i = 1;
+
+ snprintf (name, LONG_NAME_LEN, "%s%d", prefix, i);
+ while (!try_name (dict, name))
+ {
+ i++;
+ snprintf (name, LONG_NAME_LEN, "%s%d", prefix, i);
+ }
+}
+
+static void
+reg_save_var (struct dataset *ds, const char *prefix, trns_proc_func * f,
+ pspp_linreg_cache * c, struct variable **v, int n_trns)
+{
+ struct dictionary *dict = dataset_dict (ds);
+ static int trns_index = 1;
+ char name[LONG_NAME_LEN];
+ struct variable *new_var;
+ struct reg_trns *t = NULL;
+
+ t = xmalloc (sizeof (*t));
+ t->trns_id = trns_index;
+ t->n_trns = n_trns;
+ t->c = c;
+ reg_get_name (dict, name, prefix);
+ new_var = dict_create_var (dict, name, 0);
+ assert (new_var != NULL);
+ *v = new_var;
+ add_transformation (ds, f, regression_trns_free, t);
+ trns_index++;
+}
+
+static void
+subcommand_save (struct dataset *ds, int save, pspp_linreg_cache ** models)
+{
+ pspp_linreg_cache **lc;
+ int n_trns = 0;
+ int i;
+
+ assert (models != NULL);
+
+ if (save)
+ {
+ /* Count the number of transformations we will need. */
+ for (i = 0; i < REGRESSION_SV_count; i++)
+ {
+ if (cmd.a_save[i])
+ {
+ n_trns++;
+ }
+ }
+ n_trns *= cmd.n_dependent;
+
+ for (lc = models; lc < models + cmd.n_dependent; lc++)
+ {
+ assert (*lc != NULL);
+ assert ((*lc)->depvar != NULL);
+ if (cmd.a_save[REGRESSION_SV_RESID])
+ {
+ reg_save_var (ds, "RES", regression_trns_resid_proc, *lc,
+ &(*lc)->resid, n_trns);
+ }
+ if (cmd.a_save[REGRESSION_SV_PRED])
+ {
+ reg_save_var (ds, "PRED", regression_trns_pred_proc, *lc,
+ &(*lc)->pred, n_trns);
+ }
+ }
+ }
+ else
+ {
+ for (lc = models; lc < models + cmd.n_dependent; lc++)
+ {
+ if (*lc != NULL)
+ {
+ pspp_linreg_cache_free (*lc);
+ }
+ }
+ }
+}
+