/* PSPP - computes sample statistics.
Copyright (C) 1997-9, 2000 Free Software Foundation, Inc.
- Written by Ben Pfaff <blp@gnu.org>.
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License as
#include <errno.h>
#include <stdlib.h>
#include <libpspp/alloc.h>
+#include <libpspp/assertion.h>
#include <data/calendar.h>
#include <data/data-in.h>
#include <libpspp/message.h>
{
int nonconst_cnt = 0; /* Number of nonconstant children. */
int sysmis_cnt = 0; /* Number of system-missing children. */
- struct operation *op;
+ const struct operation *op;
struct composite_node *c;
int i;
#include "optimize.inc"
default:
- assert (0);
+ NOT_REACHED ();
}
- /* Not reached. */
- assert (0);
- abort ();
+ NOT_REACHED ();
}
static double
}
static void
-emit_variable (struct expression *e, struct variable *v)
+emit_variable (struct expression *e, const struct variable *v)
{
allocate_aux (e, OP_variable)->variable = v;
}
break;
default:
- abort ();
+ NOT_REACHED ();
}
}
static void
flatten_composite (union any_node *n, struct expression *e)
{
- struct operation *op = &operations[n->type];
+ const struct operation *op = &operations[n->type];
size_t i;
for (i = 0; i < n->composite.arg_cnt; i++)
else if (is_composite (n->type))
flatten_composite (n, e);
else
- abort ();
+ NOT_REACHED ();
}
static union operation_data *