- ASSERT( censuses[t].void_total < censuses[t].not_used );
- ASSERT( censuses[t].drag_total < censuses[t].used );
- }
-
- for (t = 1; t < era; t++) { // note: start at 1, not 0
- fprintf(hp_file, "MARK %f\n", censuses[t].time);
- fprintf(hp_file, "BEGIN_SAMPLE %f\n", censuses[t].time);
- fprintf(hp_file, "VOID\t%u\n", censuses[t].void_total * sizeof(W_));
- fprintf(hp_file, "LAG\t%u\n",
- (censuses[t].not_used - censuses[t].void_total)
- * sizeof(W_));
- fprintf(hp_file, "USE\t%u\n",
- (censuses[t].used - censuses[t].drag_total) * sizeof(W_));
- fprintf(hp_file, "INHERENT_USE\t%u\n",
- censuses[t].prim * sizeof(W_));
- fprintf(hp_file, "DRAG\t%u\n", censuses[t].drag_total * sizeof(W_));
- fprintf(hp_file, "END_SAMPLE %f\n", censuses[t].time);
+
+ ASSERT( censuses[t].void_total <= censuses[t].not_used );
+ // should be true because: void_total is the count of
+ // live words that are void at this census, which *must*
+ // be less than the number of live words that have not
+ // been used yet.
+
+ ASSERT( censuses[t].drag_total <= censuses[t].used );
+ // similar reasoning as above.