/* PURPOSE:
 *    Stack tester.
 *    Push and pop a lot of stack elements.
 * HISTORY:
 *    Ian D. Allen   idallen@freenet.carleton.ca
 */

#include <stdio.h>
#include <stdlib.h>

#include "stack.h"

char *cmdname = "UNKNOWN";	/* for eprintf */

	int
main(void){
	char *lexeme = "This is a fixed lexeme.";
	long int i;

	mem_init();

	/* Push a lot of stack elements.
	 */
#define TESTMAX 2000 /* number of elements to test push */

	for( i=0; i<TESTMAX; i++ ){
		Item item;

		item.type = 12345;
		item.u.uint = i;
		item.lineno = i+1;
		item.lexeme = lexeme;

		fprintf(stderr,"push %ld\n", i);
		push(&item);
	}
	fprintf(stderr,"\n");

	fprintf(stderr,"Now checking the free memory pool...\n");
	mem_check();
	fprintf(stderr,"Done check of free memory pool.\n");

	/* Pop off the elements and make sure they compare.
	 */
	while( ! empty() ){
		Item item;

		i--;

		fprintf(stderr,"pop %ld\n", i);
		item = pop();

		if( item.type != 12345 )
			fprintf(stderr,"Bad TYPE: Memory corruption.\n");
		if( item.lexeme != lexeme )
			fprintf(stderr,"Bad LEXEME: Memory corruption.\n");
		if( item.lineno != i+1 )
			fprintf(stderr,"Bad LINENO: Memory corruption.\n");
		if( item.u.uint != i )
			fprintf(stderr,"Bad UINT: Memory corruption.\n");
	}
	fprintf(stderr,"\n");

        mem_term();	/* check for memory problems before exit */

	return EXIT_SUCCESS;
}