X-Git-Url: https://pintos-os.org/cgi-bin/gitweb.cgi?a=blobdiff_plain;f=src%2Faggregate.c;h=9ffa35f5b53bfee2af7a7aaa0a039890866c3f60;hb=cf89e411db41c05c39753b05cf144c8b26a44d96;hp=4d00a34ad2cbb7404548762a0096f94b22f9e409;hpb=37597beca4a11edba50b847932fdfeca3a648fa2;p=pspp diff --git a/src/aggregate.c b/src/aggregate.c index 4d00a34ad2..9ffa35f5b5 100644 --- a/src/aggregate.c +++ b/src/aggregate.c @@ -18,7 +18,7 @@ 02111-1307, USA. */ #include -#include +#include "error.h" #include #include "alloc.h" #include "command.h" @@ -26,18 +26,16 @@ #include "file-handle.h" #include "lexer.h" #include "misc.h" +#include "moments.h" #include "pool.h" #include "settings.h" #include "sfm.h" #include "sort.h" -#include "stats.h" #include "str.h" #include "var.h" #include "vfm.h" #include "vfmP.h" -#include "debug-print.h" - /* Specifies how to make an aggregate variable. */ struct agr_var { @@ -55,6 +53,7 @@ struct agr_var int int1, int2; char *string; int missing; + struct moments *moments; }; /* Aggregation functions. */ @@ -104,57 +103,48 @@ static const struct agr_func agr_func_tab[] = {"NU", 0, NUMERIC, {FMT_F, 7, 0}}, }; -/* Output file, or NULL for the active file. */ -static struct file_handle *outfile; - /* Missing value types. */ -enum +enum missing_treatment { ITEMWISE, /* Missing values item by item. */ COLUMNWISE /* Missing values column by column. */ }; -/* ITEMWISE or COLUMNWISE. */ -static int missing; - -/* Sort program. */ -static struct sort_cases_pgm *sort; - -/* Aggregate variables. */ -static struct agr_var *agr_first, *agr_next; - -/* Aggregate dictionary. */ -static struct dictionary *agr_dict; - -/* Number of cases passed through aggregation. */ -static int case_count; - -/* Last values of the break variables. */ -static union value *prev_case; - -/* Buffers for use by the 10x transformation. */ -static flt64 *buf64_1xx; -static struct ccase *buf_1xx; +/* An entire AGGREGATE procedure. */ +struct agr_proc + { + /* We have either an output file or a sink. */ + struct file_handle *out_file; /* Output file, or null if none. */ + struct case_sink *sink; /* Sink, or null if none. */ + + enum missing_treatment missing; /* How to treat missing values. */ + struct sort_cases_pgm *sort; /* Sort program. */ + struct agr_var *vars; /* First aggregate variable. */ + struct dictionary *dict; /* Aggregate dictionary. */ + int case_cnt; /* Counts aggregated cases. */ + union value *prev_break; /* Last values of break variables. */ + struct ccase *agr_case; /* Aggregate case for output. */ + flt64 *sfm_agr_case; /* Aggregate case in SFM format. */ + }; -static void initialize_aggregate_info (void); +static void initialize_aggregate_info (struct agr_proc *); /* Prototypes. */ -static int parse_aggregate_functions (void); -static void free_aggregate_functions (void); -static int aggregate_single_case (const struct ccase *input, +static int parse_aggregate_functions (struct agr_proc *); +static void agr_destroy (struct agr_proc *); +static int aggregate_single_case (struct agr_proc *agr, + const struct ccase *input, struct ccase *output); -static int create_sysfile (void); - -static trns_proc_func agr_00x_trns_proc, agr_10x_trns_proc; -static trns_free_func agr_10x_trns_free; -static void agr_00x_end_func (void *aux); -static void agr_10x_end_func (void *); -static read_sort_output_func agr_11x_read; -static void agr_11x_finish (void); - -#if DEBUGGING -static void debug_print (int flags); -#endif +static void dump_aggregate_info (struct agr_proc *agr, struct ccase *output); +static int create_sysfile (struct agr_proc *); + +/* Aggregating to the active file. */ +static int agr_to_active_file (struct ccase *, void *aux); + +/* Aggregating to a system file. */ +static void write_case_to_sfm (struct agr_proc *agr); +static int presorted_agr_to_sysfile (struct ccase *, void *aux); +static int sort_agr_to_sysfile (const struct ccase *, void *aux); /* Parsing. */ @@ -162,48 +152,46 @@ static void debug_print (int flags); int cmd_aggregate (void) { + struct agr_proc agr; + /* Have we seen these subcommands? */ unsigned seen = 0; - outfile = NULL; - missing = ITEMWISE; - sort = NULL; - prev_case = NULL; + agr.out_file = NULL; + agr.sink = NULL; + agr.missing = ITEMWISE; + agr.sort = NULL; + agr.vars = NULL; + agr.dict = NULL; + agr.case_cnt = 0; + agr.prev_break = NULL; - agr_dict = dict_create (); - dict_set_label (agr_dict, dict_get_label (default_dict)); - dict_set_documents (agr_dict, dict_get_documents (default_dict)); + agr.dict = dict_create (); + dict_set_label (agr.dict, dict_get_label (default_dict)); + dict_set_documents (agr.dict, dict_get_documents (default_dict)); - lex_match_id ("AGGREGATE"); - /* Read most of the subcommands. */ for (;;) { - lex_match('/'); + lex_match ('/'); if (lex_match_id ("OUTFILE")) { if (seen & 1) { - destroy_sort_cases_pgm (sort); - dict_destroy (agr_dict); msg (SE, _("%s subcommand given multiple times."),"OUTFILE"); - return CMD_FAILURE; + goto lossage; } seen |= 1; lex_match ('='); if (lex_match ('*')) - outfile = NULL; + agr.out_file = NULL; else { - outfile = fh_parse_file_handle (); - if (outfile == NULL) - { - destroy_sort_cases_pgm (sort); - dict_destroy (agr_dict); - return CMD_FAILURE; - } + agr.out_file = fh_parse_file_handle (); + if (agr.out_file == NULL) + goto lossage; } } else if (lex_match_id ("MISSING")) @@ -211,12 +199,10 @@ cmd_aggregate (void) lex_match ('='); if (!lex_match_id ("COLUMNWISE")) { - destroy_sort_cases_pgm (sort); - dict_destroy (agr_dict); lex_error (_("while expecting COLUMNWISE")); - return CMD_FAILURE; + goto lossage; } - missing = COLUMNWISE; + agr.missing = COLUMNWISE; } else if (lex_match_id ("DOCUMENT")) seen |= 2; @@ -226,29 +212,25 @@ cmd_aggregate (void) { if (seen & 8) { - destroy_sort_cases_pgm (sort); - dict_destroy (agr_dict); msg (SE, _("%s subcommand given multiple times."),"BREAK"); - return CMD_FAILURE; + goto lossage; } seen |= 8; lex_match ('='); - sort = parse_sort (); - if (sort == NULL) - { - dict_destroy (agr_dict); - return CMD_FAILURE; - } + agr.sort = parse_sort (); + if (agr.sort == NULL) + goto lossage; { int i; - for (i = 0; i < sort->var_cnt; i++) + for (i = 0; i < agr.sort->var_cnt; i++) { struct variable *v; - v = dict_clone_var (agr_dict, sort->vars[i], sort->vars[i]->name); + v = dict_clone_var (agr.dict, agr.sort->vars[i], + agr.sort->vars[i]->name); assert (v != NULL); } } @@ -261,178 +243,105 @@ cmd_aggregate (void) msg (SW, _("BREAK subcommand not specified.")); /* Read in the aggregate functions. */ - if (!parse_aggregate_functions ()) - { - free_aggregate_functions (); - destroy_sort_cases_pgm (sort); - return CMD_FAILURE; - } + if (!parse_aggregate_functions (&agr)) + goto lossage; /* Delete documents. */ if (!(seen & 2)) - dict_set_documents (agr_dict, NULL); + dict_set_documents (agr.dict, NULL); /* Cancel SPLIT FILE. */ - dict_set_split_vars (agr_dict, NULL, 0); + dict_set_split_vars (agr.dict, NULL, 0); -#if DEBUGGING - debug_print (seen); -#endif - /* Initialize. */ - case_count = 0; - initialize_aggregate_info (); - - /* How to implement all this... There are three important variables: - whether output is going to the active file (0) or a separate file - (1); whether the input data is presorted (0) or needs sorting - (1); whether there is a temporary transformation (1) or not (0). - The eight cases are as follows: - - 000 (0): Pass it through an aggregate transformation that - modifies the data. - - 001 (1): Cancel the temporary transformation and handle as 000. - - 010 (2): Set up a SORT CASES and aggregate the output, writing - the results to the active file. - - 011 (3): Cancel the temporary transformation and handle as 010. - - 100 (4): Pass it through an aggregate transformation that doesn't - modify the data but merely writes it to the output file. - - 101 (5): Handled as 100. - - 110 (6): Set up a SORT CASES and capture the output, aggregate - it, write it to the output file without modifying the active - file. - - 111 (7): Handled as 110. */ - - { - unsigned type = 0; - - if (outfile != NULL) - type |= 4; - if (sort != NULL && (seen & 4) == 0) - type |= 2; - if (temporary) - type |= 1; - - switch (type) - { - case 3: - cancel_temporary (); - /* fall through */ - case 2: - sort_cases (sort, 0); - goto case0; - - case 1: - cancel_temporary (); - /* fall through */ - case 0: - case0: - { - struct trns_header *t = xmalloc (sizeof *t); - t->proc = agr_00x_trns_proc; - t->free = NULL; - add_transformation (t); - - temporary = 2; - temp_dict = agr_dict; - temp_trns = n_trns; - - agr_dict = NULL; + agr.case_cnt = 0; + agr.agr_case = xmalloc (dict_get_case_size (agr.dict)); + initialize_aggregate_info (&agr); - procedure (NULL, NULL, agr_00x_end_func, NULL); - break; - } - - case 4: - case 5: - { - if (!create_sysfile ()) - goto lossage; - - { - struct trns_header *t = xmalloc (sizeof *t); - t->proc = agr_10x_trns_proc; - t->free = agr_10x_trns_free; - add_transformation (t); - - procedure (NULL, NULL, agr_10x_end_func, NULL); - } - - break; - } - - case 6: - case 7: - sort_cases (sort, 1); - - if (!create_sysfile ()) - goto lossage; - read_sort_output (sort, agr_11x_read, NULL); - agr_11x_finish (); - - break; - - default: - assert (0); - } - } - - free (buf64_1xx); - free (buf_1xx); - - /* Clean up. */ - destroy_sort_cases_pgm (sort); - free_aggregate_functions (); - free (prev_case); + /* Output to active file or external file? */ + if (agr.out_file == NULL) + { + /* The active file will be replaced by the aggregated data, + so TEMPORARY is moot. */ + cancel_temporary (); + + if (agr.sort != NULL && (seen & 4) == 0) + sort_cases (agr.sort, 0); + + agr.sink = create_case_sink (&storage_sink_class, agr.dict, NULL); + if (agr.sink->class->open != NULL) + agr.sink->class->open (agr.sink); + vfm_sink = create_case_sink (&null_sink_class, default_dict, NULL); + procedure (agr_to_active_file, &agr); + if (agr.case_cnt > 0) + { + dump_aggregate_info (&agr, agr.agr_case); + agr.sink->class->write (agr.sink, agr.agr_case); + } + dict_destroy (default_dict); + default_dict = agr.dict; + agr.dict = NULL; + vfm_source = agr.sink->class->make_source (agr.sink); + free_case_sink (agr.sink); + } + else + { + if (!create_sysfile (&agr)) + goto lossage; + + if (agr.sort != NULL && (seen & 4) == 0) + { + /* Sorting is needed. */ + sort_cases (agr.sort, 1); + read_sort_output (agr.sort, sort_agr_to_sysfile, NULL); + } + else + { + /* Active file is already sorted. */ + procedure (presorted_agr_to_sysfile, &agr); + } + + if (agr.case_cnt > 0) + { + dump_aggregate_info (&agr, agr.agr_case); + write_case_to_sfm (&agr); + } + fh_close_handle (agr.out_file); + } + agr_destroy (&agr); return CMD_SUCCESS; lossage: - /* Clean up. */ - destroy_sort_cases_pgm (sort); - free_aggregate_functions (); - free (prev_case); - + agr_destroy (&agr); return CMD_FAILURE; } -/* Create a system file for use in aggregation to an external file, - and allocate temporary buffers for writing out cases. */ +/* Create a system file for use in aggregation to an external + file. */ static int -create_sysfile (void) +create_sysfile (struct agr_proc *agr) { struct sfm_write_info w; - w.h = outfile; - w.dict = agr_dict; - w.compress = set_scompression; + w.h = agr->out_file; + w.dict = agr->dict; + w.compress = get_scompression(); if (!sfm_write_dictionary (&w)) - { - free_aggregate_functions (); - destroy_sort_cases_pgm (sort); - dict_destroy (agr_dict); - return 0; - } - - buf64_1xx = xmalloc (sizeof *buf64_1xx * w.case_size); - buf_1xx = xmalloc (dict_get_case_size (agr_dict)); + return 0; + agr->sfm_agr_case = xmalloc (sizeof *agr->sfm_agr_case * w.case_size); + return 1; } /* Parse all the aggregate functions. */ static int -parse_aggregate_functions (void) +parse_aggregate_functions (struct agr_proc *agr) { - agr_first = agr_next = NULL; + struct agr_var *tail; /* Tail of linked list starting at agr->vars. */ /* Parse everything. */ + tail = NULL; for (;;) { char **dest; @@ -597,41 +506,43 @@ parse_aggregate_functions (void) struct agr_var *v = xmalloc (sizeof *v); /* Add variable to chain. */ - if (agr_first) - agr_next = agr_next->next = v; + if (agr->vars != NULL) + tail->next = v; else - agr_first = agr_next = v; - agr_next->next = NULL; + agr->vars = v; + tail = v; + tail->next = NULL; + v->moments = NULL; /* Create the target variable in the aggregate dictionary. */ { struct variable *destvar; - agr_next->function = func_index; + v->function = func_index; if (src) { int output_width; - agr_next->src = src[i]; + v->src = src[i]; if (src[i]->type == ALPHA) { - agr_next->function |= FSTRING; - agr_next->string = xmalloc (src[i]->width); + v->function |= FSTRING; + v->string = xmalloc (src[i]->width); } - if (agr_next->src->type == NUMERIC || function->alpha_type == NUMERIC) + if (v->src->type == NUMERIC || function->alpha_type == NUMERIC) output_width = 0; else - output_width = agr_next->src->width; + output_width = v->src->width; if (function->alpha_type == ALPHA) - destvar = dict_clone_var (agr_dict, agr_next->src, dest[i]); + destvar = dict_clone_var (agr->dict, v->src, dest[i]); else { - destvar = dict_create_var (agr_dict, dest[i], output_width); + destvar = dict_create_var (agr->dict, dest[i], output_width); if (output_width == 0) destvar->print = destvar->write = function->format; if (output_width == 0 && dict_get_weight (default_dict) != NULL @@ -644,8 +555,8 @@ parse_aggregate_functions (void) } } } else { - agr_next->src = NULL; - destvar = dict_create_var (agr_dict, dest[i], 0); + v->src = NULL; + destvar = dict_create_var (agr->dict, dest[i], 0); } if (!destvar) @@ -669,21 +580,21 @@ parse_aggregate_functions (void) else if (function->alpha_type == ALPHA) destvar->print = destvar->write = function->format; - agr_next->dest = destvar; + v->dest = destvar; } - agr_next->include_missing = include_missing; + v->include_missing = include_missing; - if (agr_next->src != NULL) + if (v->src != NULL) { int j; - if (agr_next->src->type == NUMERIC) + if (v->src->type == NUMERIC) for (j = 0; j < function->n_args; j++) - agr_next->arg[j].f = arg[j].f; + v->arg[j].f = arg[j].f; else for (j = 0; j < function->n_args; j++) - agr_next->arg[j].c = xstrdup (arg[j].c); + v->arg[j].c = xstrdup (arg[j].c); } } @@ -721,7 +632,7 @@ parse_aggregate_functions (void) if (src && n_src && src[0]->type == ALPHA) for (i = 0; i < function->n_args; i++) { - free(arg[i].c); + free (arg[i].c); arg[i].c = NULL; } free (src); @@ -730,15 +641,17 @@ parse_aggregate_functions (void) } } -/* Frees all the state for the AGGREGATE procedure. */ +/* Destroys AGR. */ static void -free_aggregate_functions (void) +agr_destroy (struct agr_proc *agr) { struct agr_var *iter, *next; - if (agr_dict) - dict_destroy (agr_dict); - for (iter = agr_first; iter; iter = next) + if (agr->dict != NULL) + dict_destroy (agr->dict); + if (agr->sort != NULL) + destroy_sort_cases_pgm (agr->sort); + for (iter = agr->vars; iter; iter = next) { next = iter->next; @@ -752,47 +665,50 @@ free_aggregate_functions (void) free (iter->arg[i].c); free (iter->string); } + else if (iter->function == SD) + moments_destroy (iter->moments); free (iter); } + free (agr->prev_break); + free (agr->agr_case); } /* Execution. */ -static void accumulate_aggregate_info (const struct ccase *input); -static void dump_aggregate_info (struct ccase *output); +static void accumulate_aggregate_info (struct agr_proc *, + const struct ccase *); +static void dump_aggregate_info (struct agr_proc *, struct ccase *); /* Processes a single case INPUT for aggregation. If output is - warranted, it is written to case OUTPUT, which may be (but need not - be) an alias to INPUT. Returns -1 when output is performed, -2 - otherwise. */ -/* The code in this function has an eerie similarity to - vfm.c:SPLIT_FILE_procfunc()... */ + warranted, writes it to OUTPUT and returns nonzero. + Otherwise, returns zero and OUTPUT is unmodified. */ static int -aggregate_single_case (const struct ccase *input, struct ccase *output) +aggregate_single_case (struct agr_proc *agr, + const struct ccase *input, struct ccase *output) { /* The first case always begins a new break group. We also need to preserve the values of the case for later comparison. */ - if (case_count++ == 0) + if (agr->case_cnt++ == 0) { int n_elem = 0; { int i; - for (i = 0; i < sort->var_cnt; i++) - n_elem += sort->vars[i]->nv; + for (i = 0; i < agr->sort->var_cnt; i++) + n_elem += agr->sort->vars[i]->nv; } - prev_case = xmalloc (sizeof *prev_case * n_elem); + agr->prev_break = xmalloc (sizeof *agr->prev_break * n_elem); - /* Copy INPUT into prev_case. */ + /* Copy INPUT into prev_break. */ { - union value *iter = prev_case; + union value *iter = agr->prev_break; int i; - for (i = 0; i < sort->var_cnt; i++) + for (i = 0; i < agr->sort->var_cnt; i++) { - struct variable *v = sort->vars[i]; + struct variable *v = agr->sort->vars[i]; if (v->type == NUMERIC) (iter++)->f = input->data[v->fv].f; @@ -804,20 +720,20 @@ aggregate_single_case (const struct ccase *input, struct ccase *output) } } - accumulate_aggregate_info (input); + accumulate_aggregate_info (agr, input); - return -2; + return 0; } /* Compare the value of each break variable to the values on the previous case. */ { - union value *iter = prev_case; + union value *iter = agr->prev_break; int i; - for (i = 0; i < sort->var_cnt; i++) + for (i = 0; i < agr->sort->var_cnt; i++) { - struct variable *v = sort->vars[i]; + struct variable *v = agr->sort->vars[i]; switch (v->type) { @@ -837,26 +753,26 @@ aggregate_single_case (const struct ccase *input, struct ccase *output) } } - accumulate_aggregate_info (input); + accumulate_aggregate_info (agr, input); - return -2; + return 0; not_equal: /* The values of the break variable are different from the values on the previous case. That means that it's time to dump aggregate info. */ - dump_aggregate_info (output); - initialize_aggregate_info (); - accumulate_aggregate_info (input); + dump_aggregate_info (agr, output); + initialize_aggregate_info (agr); + accumulate_aggregate_info (agr, input); - /* Copy INPUT into prev_case. */ + /* Copy INPUT into prev_break. */ { - union value *iter = prev_case; + union value *iter = agr->prev_break; int i; - for (i = 0; i < sort->var_cnt; i++) + for (i = 0; i < agr->sort->var_cnt; i++) { - struct variable *v = sort->vars[i]; + struct variable *v = agr->sort->vars[i]; if (v->type == NUMERIC) (iter++)->f = input->data[v->fv].f; @@ -868,19 +784,21 @@ not_equal: } } - return -1; + return 1; } /* Accumulates aggregation data from the case INPUT. */ static void -accumulate_aggregate_info (const struct ccase *input) +accumulate_aggregate_info (struct agr_proc *agr, + const struct ccase *input) { struct agr_var *iter; double weight; + int bad_warn = 1; - weight = dict_get_case_weight (default_dict, input); + weight = dict_get_case_weight (default_dict, input, &bad_warn); - for (iter = agr_first; iter; iter = iter->next) + for (iter = agr->vars; iter; iter = iter->next) if (iter->src) { const union value *v = &input->data[iter->src->fv]; @@ -912,14 +830,9 @@ accumulate_aggregate_info (const struct ccase *input) iter->dbl[0] += v->f * weight; iter->dbl[1] += weight; break; - case SD: - { - double product = v->f * weight; - iter->dbl[0] += product; - iter->dbl[1] += product * v->f; - iter->dbl[2] += weight; - break; - } + case SD: + moments_pass_two (iter->moments, v->f, weight); + break; case MAX: iter->dbl[0] = max (iter->dbl[0], v->f); iter->int1 = 1; @@ -1038,33 +951,28 @@ accumulate_aggregate_info (const struct ccase *input) more of the break variables. Make an output record from the accumulated statistics in the OUTPUT case. */ static void -dump_aggregate_info (struct ccase *output) +dump_aggregate_info (struct agr_proc *agr, struct ccase *output) { - debug_printf (("(dumping ")); - { int n_elem = 0; { int i; - for (i = 0; i < sort->var_cnt; i++) - n_elem += sort->vars[i]->nv; + for (i = 0; i < agr->sort->var_cnt; i++) + n_elem += agr->sort->vars[i]->nv; } - debug_printf (("n_elem=%d:", n_elem)); - memcpy (output->data, prev_case, sizeof (union value) * n_elem); + memcpy (output->data, agr->prev_break, sizeof (union value) * n_elem); } { struct agr_var *i; - for (i = agr_first; i; i = i->next) + for (i = agr->vars; i; i = i->next) { union value *v = &output->data[i->dest->fv]; - debug_printf ((" %d,%d", i->dest->fv, i->dest->nv)); - - if (missing == COLUMNWISE && i->missing != 0 + if (agr->missing == COLUMNWISE && i->missing != 0 && (i->function & FUNC) != N && (i->function & FUNC) != NU && (i->function & FUNC) != NMISS && (i->function & FUNC) != NUMISS) { @@ -1084,9 +992,17 @@ dump_aggregate_info (struct ccase *output) v->f = i->dbl[1] != 0.0 ? i->dbl[0] / i->dbl[1] : SYSMIS; break; case SD: - v->f = ((i->dbl[2] > 1.0) - ? calc_stddev (calc_variance (i->dbl, i->dbl[2])) - : SYSMIS); + { + double variance; + + /* FIXME: we should use two passes. */ + moments_calculate (i->moments, NULL, NULL, &variance, + NULL, NULL); + if (variance != SYSMIS) + v->f = sqrt (variance); + else + v->f = SYSMIS; + } break; case MAX: case MIN: @@ -1155,16 +1071,15 @@ dump_aggregate_info (struct ccase *output) } } } - debug_printf ((") ")); } /* Resets the state for all the aggregate functions. */ static void -initialize_aggregate_info (void) +initialize_aggregate_info (struct agr_proc *agr) { struct agr_var *iter; - for (iter = agr_first; iter; iter = iter->next) + for (iter = agr->vars; iter; iter = iter->next) { iter->missing = 0; switch (iter->function) @@ -1181,6 +1096,12 @@ initialize_aggregate_info (void) case MAX | FSTRING: memset (iter->string, 0, iter->src->width); break; + case SD: + if (iter->moments == NULL) + iter->moments = moments_create (MOMENT_VARIANCE); + else + moments_clear (iter->moments); + break; default: iter->dbl[0] = iter->dbl[1] = iter->dbl[2] = 0.0; iter->int1 = iter->int2 = 0; @@ -1192,43 +1113,31 @@ initialize_aggregate_info (void) /* Aggregate each case as it comes through. Cases which aren't needed are dropped. */ static int -agr_00x_trns_proc (struct trns_header *h UNUSED, struct ccase *c, - int case_num UNUSED) +agr_to_active_file (struct ccase *c, void *agr_) { - int code = aggregate_single_case (c, compaction_case); - debug_printf (("%d ", code)); - return code; -} + struct agr_proc *agr = agr_; -/* Output the last aggregate case. It's okay to call the vfm_sink's - write() method here because end_func is called so soon after all - the cases have been output; very little has been cleaned up at this - point. */ -static void -agr_00x_end_func (void *aux UNUSED) -{ - /* Ensure that info for the last break group gets written to the - active file. */ - dump_aggregate_info (compaction_case); - vfm_sink->class->write (vfm_sink, compaction_case); + if (aggregate_single_case (agr, c, agr->agr_case)) + agr->sink->class->write (agr->sink, agr->agr_case); + + return 1; } -/* Transform the aggregate case buf_1xx, in internal format, to system - file format, in buf64_1xx, and write the resultant case to the - system file. */ +/* Writes AGR->agr_case to AGR->out_file. */ static void -write_case_to_sfm (void) +write_case_to_sfm (struct agr_proc *agr) { - flt64 *p = buf64_1xx; + flt64 *p; int i; - for (i = 0; i < dict_get_var_cnt (agr_dict); i++) + p = agr->sfm_agr_case; + for (i = 0; i < dict_get_var_cnt (agr->dict); i++) { - struct variable *v = dict_get_var (agr_dict, i); + struct variable *v = dict_get_var (agr->dict, i); if (v->type == NUMERIC) { - double src = buf_1xx->data[v->fv].f; + double src = agr->agr_case->data[v->fv].f; if (src == SYSMIS) *p++ = -FLT64_MAX; else @@ -1236,126 +1145,34 @@ write_case_to_sfm (void) } else { - memcpy (p, buf_1xx->data[v->fv].s, v->width); + memcpy (p, agr->agr_case->data[v->fv].s, v->width); memset (&((char *) p)[v->width], ' ', REM_RND_UP (v->width, sizeof (flt64))); p += DIV_RND_UP (v->width, sizeof (flt64)); } } - sfm_write_case (outfile, buf64_1xx, p - buf64_1xx); + sfm_write_case (agr->out_file, agr->sfm_agr_case, p - agr->sfm_agr_case); } /* Aggregate the current case and output it if we passed a breakpoint. */ static int -agr_10x_trns_proc (struct trns_header *h UNUSED, struct ccase *c, - int case_num UNUSED) -{ - int code = aggregate_single_case (c, buf_1xx); - - assert (code == -2 || code == -1); - if (code == -1) - write_case_to_sfm (); - return -1; -} - -/* Close the system file now that we're done with it. */ -static void -agr_10x_trns_free (struct trns_header *h UNUSED) -{ - fh_close_handle (outfile); -} - -/* Ensure that info for the last break group gets written to the - system file. */ -static void -agr_10x_end_func (void *aux UNUSED) -{ - dump_aggregate_info (buf_1xx); - write_case_to_sfm (); -} - -/* Runs case C through the aggregater and outputs it to the - system file if appropriate. */ -static int -agr_11x_read (const struct ccase *c, void *aux UNUSED) +presorted_agr_to_sysfile (struct ccase *c, void *agr_) { - int code = aggregate_single_case (c, buf_1xx); - - assert (code == -2 || code == -1); - if (code == -1) - write_case_to_sfm (); - + sort_agr_to_sysfile (c, agr_); return 1; } -/* Finishes up writing the last case if necessary. */ -static void -agr_11x_finish (void) -{ - if (case_count) - { - dump_aggregate_info (buf_1xx); - write_case_to_sfm (); - } - fh_close_handle (outfile); -} - -/* Debugging. */ -#if DEBUGGING -/* Print out useful debugging information. */ -static void -debug_print (int flags) +/* Aggregate the current case and output it if we passed a + breakpoint. */ +static int +sort_agr_to_sysfile (const struct ccase *c, void *agr_) { - printf ("AGGREGATE\n /OUTFILE=%s\n", - outfile ? fh_handle_filename (outfile) : "*"); - - if (missing == COLUMNWISE) - puts (" /MISSING=COLUMNWISE"); + struct agr_proc *agr = agr_; - if (flags & 2) - puts (" /DOCUMENT"); - if (flags & 4) - puts (" /PRESORTED"); - - { - int i; + if (aggregate_single_case (agr, c, agr->agr_case)) + write_case_to_sfm (agr); - printf (" /BREAK="); - for (i = 0; i < sort->var_cnt; i++) - printf ("%s(%c) ", sort->vars[i]->name, - sort->vars[i]->p.srt.order == SRT_ASCEND ? 'A' : 'D'); - putc ('\n', stdout); - } - - { - struct agr_var *iter; - - for (iter = agr_first; iter; iter = iter->next) - { - struct agr_func *f = &agr_func_tab[iter->function & FUNC]; - - printf (" /%s", iter->dest->name); - if (iter->dest->label) - printf ("'%s'", iter->dest->label); - printf ("=%s(%s", f->name, iter->src->name); - if (f->n_args) - { - int i; - - for (i = 0; i < f->n_args; i++) - { - putc (',', stdout); - if (iter->src->type == NUMERIC) - printf ("%g", iter->arg[i].f); - else - printf ("%.*s", iter->src->width, iter->arg[i].c); - } - } - printf (")\n"); - } - } + return 1; } - -#endif /* DEBUGGING */