cvs/stack/stack.c

/* printf */
#include <stdio.h>
/* EXIT_SUCCESS */
#include <stdlib.h>
/* NULL */
#include <stddef.h>
/* dlopen, dlsym, dlerror */
#include <dlfcn.h>
/* assert */
#include <assert.h>

#define HASHTBLSIZE 65536

/* First, define some types. */

/* A value of some type */
typedef struct {
  enum {
    integer,
    string,
    ref,                        /* Reference (to an element in the
                                   hash table) */
    func,                       /* Function pointer */
    symb, 
    list
  } type;                       /* Type of stack element */

  union {
    void *ptr;                  /* Pointer to the content */
    int val;                    /* ...or an integer */
  } content;                    /* Stores a pointer or an integer */

  int refcount;                 /* Reference counter */

} value;

/* A symbol with a name and possible value */
/* (These do not need reference counters, they are kept unique by
   hashing.) */
typedef struct symbol_struct {
  char *id;                     /* Symbol name */
  value *val;                   /* The value (if any) bound to it */
  struct symbol_struct *next;   /* In case of hashing conflicts, a */
} symbol;                       /* symbol is a kind of stack item. */

/* A type for a hash table for symbols */
typedef symbol *hashtbl[HASHTBLSIZE]; /* Hash table declaration */

/* An item (value) on a stack */
typedef struct stackitem_struct
{
  value *item;                  /* The value on the stack */
  struct stackitem_struct *next; /* Next item */
} stackitem;

/* An environment; gives access to the stack and a hash table of
   defined symbols */
typedef struct {
  stackitem *head;              /* Head of the stack */
  hashtbl symbols;              /* Hash table of all variable bindings */
} environment;

/* A type for pointers to external functions */
typedef void (*funcp)(environment *); /* funcp is a pointer to a void
                                         function (environment *) */

/* Initialize a newly created environment */
void init_env(environment *env)
{
  long i;

  for(i= 0; i<HASHTBLSIZE; i++)
    env->symbols[i]= NULL;
}

/* Returns a pointer to a pointer to an element in the hash table. */
symbol **hash(hashtbl in_hashtbl, const char *in_string)
{
  long i= 0;
  unsigned long out_hash= 0;
  char key= '\0';
  symbol **position;
  
  while(1){                     /* Hash in_string */
    key= in_string[i++];
    if(key=='\0')
      break;
    out_hash= out_hash*32+key;
  }

  out_hash= out_hash%HASHTBLSIZE;
  position= &(in_hashtbl[out_hash]);

  while(1){
    if(*position==NULL)         /* If empty */
      return position;
    
    if(strcmp(in_string, (*position)->id)==0) /* If match */
      return position;

    position= &((*position)->next); /* Try next */
  }
}

/* Generic push function. */
int push(stackitem** stack_head, stackitem* in_item)
{
  in_item->next= *stack_head;
  *stack_head= in_item;
  return 1;
}

/* Push a value onto the stack */
void push_val(stackitem **stack_head, value *val)
{
  stackitem *new_item= malloc(sizeof(stackitem));
  new_item->item= val;
  val->refcount++;
  push(stack_head, new_item);
}

/* Push an integer onto the stack. */
int push_int(stackitem **stack_head, int in_val) 
{
  value *new_value= malloc(sizeof(value));
  stackitem *new_item= malloc(sizeof(stackitem));
  new_item->item= new_value;
  
  new_value->content.val= in_val;
  new_value->type= integer;
  new_value->refcount=1;

  push(stack_head, new_item);
  return 1;
}

/* Copy a string onto the stack. */
int push_cstring(stackitem **stack_head, const char *in_string)
{
  value *new_value= malloc(sizeof(value));
  stackitem *new_item= malloc(sizeof(stackitem));
  new_item->item=new_value;

  new_value->content.ptr= malloc(strlen(in_string)+1);
  strcpy(new_value->content.ptr, in_string);
  new_value->type= string;
  new_value->refcount=1;

  push(stack_head, new_item);
  return 1;
}

/* Push a symbol onto the stack. */
int push_sym(environment *env, const char *in_string)
{
  stackitem *new_item;          /* The new stack item */
  /* ...which will contain... */
  value *new_value;             /* A new symbol value */
  /* ...which might point to... */
  symbol **new_symbol;          /* (if needed) A new actual symbol */
  /* ...which, if possible, will be bound to... */
  value *new_fvalue;            /* (if needed) A new function value */
  /* ...which will point to... */
  void *funcptr;                /* A function pointer */

  static void *handle= NULL;    /* Dynamic linker handle */

  /* Create a new stack item containing a new value */
  new_item= malloc(sizeof(stackitem));
  new_value= malloc(sizeof(value));
  new_item->item=new_value;

  /* The new value is a symbol */
  new_value->type= symb;
  new_value->refcount= 1;

  /* Look up the symbol name in the hash table */
  new_symbol= hash(env->symbols, in_string);
  new_value->content.ptr= *new_symbol;

  if(new_value->content.ptr==NULL) { /* If symbol was undefined */

    /* Create a new symbol */
    *new_symbol= malloc(sizeof(symbol));
    (*new_symbol)->val= NULL;   /* undefined value */
    (*new_symbol)->next= NULL;
    (*new_symbol)->id= malloc(strlen(in_string)+1);
    strcpy((*new_symbol)->id, in_string);

    /* Intern the new symbol in the hash table */
    new_value->content.ptr= *new_symbol;

    /* Try to load the symbol name as an external function, to see if
       we should bind the symbol to a new function pointer value */
    if(handle==NULL)            /* If no handle */
      handle= dlopen(NULL, RTLD_LAZY);

    funcptr= dlsym(handle, in_string); /* Get function pointer */
    if(dlerror()==NULL) {       /* If a function was found */
      new_fvalue= malloc(sizeof(value)); /* Create a new value */
      new_fvalue->type=func;    /* The new value is a function pointer */
      new_fvalue->content.ptr=funcptr; /* Store function pointer */
      (*new_symbol)->val= new_fvalue; /* Bind the symbol to the new
                                         function value */
      new_fvalue->refcount= 1;
    }
  }
  push(&(env->head), new_item);
  return 1;
}

void printerr(const char* in_string) {
  fprintf(stderr, "Err: %s\n", in_string);
}

/* Throw away a value */
void free_val(value *val){
  stackitem *item, *temp;

  val->refcount--;              /* Decrease the reference count */
  if(val->refcount == 0){
    switch (val->type){         /* and free the contents if necessary */
    case string:
      free(val->content.ptr);
    case list:                  /* lists needs to be freed recursively */
      item=val->content.ptr;
      while(item != NULL) {     /* for all stack items */
        free_val(item->item);   /* free the value */
        temp=item->next;        /* save next ptr */
        free(item);             /* free the stackitem */
        item=temp;              /* go to next stackitem */
      }
      free(val);                /* Free the actual list value */
      break;
    default:
      break;
    }
  }
}

/* Discard the top element of the stack. */
extern void toss(environment *env)
{
  stackitem *temp= env->head;

  if((env->head)==NULL) {
    printerr("Stack empty");
    return;
  }
  
  free_val(env->head->item);    /* Free the value */
  env->head= env->head->next;   /* Remove the top stack item */
  free(temp);                   /* Free the old top stack item */
}

/* Print newline. */
extern void nl()
{
  printf("\n");
}

/* Prints the top element of the stack. */
void print_h(stackitem *stack_head)
{

  if(stack_head==NULL) {
    printerr("Stack empty");
    return;
  }

  switch(stack_head->item->type) {
  case integer:
    printf("%d", stack_head->item->content.val);
    break;
  case string:
    printf("\"%s\"", (char*)stack_head->item->content.ptr);
    break;
  case symb:
    printf("'%s'", ((symbol *)(stack_head->item->content.ptr))->id);
    break;
  default:
    printf("%p", (funcp)(stack_head->item->content.ptr));
    break;
  }
}

extern void print_(environment *env) {
  print_h(env->head);
}

/* Prints the top element of the stack and then discards it. */
extern void print(environment *env)
{
  print_(env);
  toss(env);
}

/* Only to be called by function printstack. */
void print_st(stackitem *stack_head, long counter)
{ 
  if(stack_head->next != NULL)
    print_st(stack_head->next, counter+1);
  printf("%ld: ", counter);
  print_h(stack_head);
  nl();
}


/* Prints the stack. */
extern void printstack(environment *env)
{
  if(env->head != NULL) {
    print_st(env->head, 1);
    nl();
  } else {
    printerr("Stack empty");
  }
}

/* Swap the two top elements on the stack. */
extern void swap(environment *env)
{
  stackitem *temp= env->head;
  
  if((env->head)==NULL) {
    printerr("Stack empty");
    return;
  }

  if(env->head->next==NULL) {
    printerr("Not enough arguments");
    return;
  }

  env->head= env->head->next;
  temp->next= env->head->next;
  env->head->next= temp;
} 

stackitem* copy(stackitem* in_item)
{
  stackitem *out_item= malloc(sizeof(stackitem));

  memcpy(out_item, in_item, sizeof(stackitem));
  out_item->next= NULL;

  return out_item;
}


/* If the top element is a symbol, determine if it's bound to a
   function value, and if it is, toss the symbol and execute the
   function. */
extern void eval(environment *env)
{
  funcp in_func;
  value* val;
  if(env->head==NULL) {
    printerr("Stack empty");
    return;
  }

  /* if it's a symbol */
  if(env->head->item->type==symb) {

    /* If it's not bound to anything */
    if (((symbol *)(env->head->item->content.ptr))->val == NULL) {
      printerr("Unbound variable");
      return;
    }
    
    /* If it contains a function */
    if (((symbol *)(env->head->item->content.ptr))->val->type == func) {
      in_func=
        (funcp)(((symbol *)(env->head->item->content.ptr))->val->content.ptr);
      toss(env);
      (*in_func)(env);          /* Run the function */
      return;
    } else {                    /* If it's not a function */
      val=((symbol *)(env->head->item->content.ptr))->val;
      toss(env);                /* toss the symbol */
      push_val(&(env->head), val); /* Return its bound value */
    }
  }

  /* If it's a lone function value, run it */
  if(env->head->item->type==func) {
    in_func= (funcp)(env->head->item->content.ptr);
    toss(env); 
    (*in_func)(env);
    return;
  }

/*    push(&(env->head), copy(env->head)); */
/*    swap(env); */
/*    toss(env); */
}

/* Make a list. */
extern void pack(environment *env)
{
  void* delimiter;
  stackitem *iterator, *temp;
  value *pack;

  delimiter= env->head->item->content.ptr; /* Get delimiter */
  toss(env);

  iterator= env->head;

  if(iterator==NULL || iterator->item->content.ptr==delimiter) {
    temp= NULL;
    toss(env);
  } else {
    /* Search for first delimiter */
    while(iterator->next!=NULL
          && iterator->next->item->content.ptr!=delimiter)
      iterator= iterator->next;
    
    /* Extract list */
    temp= env->head;
    env->head= iterator->next;
    iterator->next= NULL;
    
    if(env->head!=NULL)
      toss(env);
  }

  /* Push list */
  pack= malloc(sizeof(value));
  pack->type= list;
  pack->content.ptr= temp;
  pack->refcount= 1;

  temp= malloc(sizeof(stackitem));
  temp->item= pack;

  push(&(env->head), temp);
}

/* Parse input. */
int stack_read(environment *env, char *in_line) 
{
  char *temp, *rest;
  int itemp;
  size_t inlength= strlen(in_line)+1;
  int convert= 0;
  static int non_eval_flag= 0;

  temp= malloc(inlength);
  rest= malloc(inlength);

  do {
    /* If string */
    if((convert= sscanf(in_line, "\"%[^\"\n\r]\" %[^\n\r]", temp, rest))) {
      push_cstring(&(env->head), temp);
      break;
    }
    /* If integer */
    if((convert= sscanf(in_line, "%d %[^\n\r]", &itemp, rest))) {
      push_int(&(env->head), itemp);
      break;
    }
    /* Escape ';' with '\' */
    if((convert= sscanf(in_line, "\\%c%[^\n\r]", temp, rest))) {
      temp[1]= '\0';
      push_sym(env, temp);
      break;
    } 
    /* If symbol */
    if((convert= sscanf(in_line, "%[^][ ;\n\r_]%[^\n\r]", temp, rest))) {
        push_sym(env, temp);
        break;
    }
    /* If single char */
    if((convert= sscanf(in_line, "%c%[^\n\r]", temp, rest))) {
      if(*temp==';') {
        if(!non_eval_flag) {
          eval(env);            /* Evaluate top element */
          break;
        }
        
        push_sym(env, ";");
        break;
      }

      if(*temp==']') {
        push_sym(env, "[");
        pack(env);
        if(non_eval_flag!=0)
          non_eval_flag--;
        break;
      }

      if(*temp=='[') {
        push_sym(env, "[");
        non_eval_flag++;
        break;
      }
    }
  } while(0);


  free(temp);

  if(convert<2) {
    free(rest);
    return 0;
  }
   
  stack_read(env, rest);
  
  free(rest);
  return 1;
}

/* Relocate elements of the list on the stack. */
extern void expand(environment *env)
{
  stackitem *temp, *new_head;

  /* Is top element a list? */
  if(env->head==NULL || env->head->item->type!=list) {
    printerr("Stack empty or not a list");
    return;
  }

  /* The first list element is the new stack head */
  new_head= temp= env->head->item->content.ptr;

  env->head->item->refcount++;
  toss(env);

  /* Find the end of the list */
  while(temp->next!=NULL)
    temp= temp->next;

  /* Connect the tail of the list with the old stack head */
  temp->next= env->head;
  env->head= new_head;          /* ...and voila! */

}

/* Compares two elements by reference. */
extern void eq(environment *env)
{
  void *left, *right;
  int result;

  if((env->head)==NULL || env->head->next==NULL) {
    printerr("Not enough elements to compare");
    return;
  }

  left= env->head->item->content.ptr;
  swap(env);
  right= env->head->item->content.ptr;
  result= (left==right);
  
  toss(env); toss(env);
  push_int(&(env->head), result);
}

/* Negates the top element on the stack. */
extern void not(environment *env)
{
  int val;

  if((env->head)==NULL || env->head->item->type!=integer) {
    printerr("Stack empty or element is not a integer");
    return;
  }

  val= env->head->item->content.val;
  toss(env);
  push_int(&(env->head), !val);
}

/* Compares the two top elements on the stack and return 0 if they're the
   same. */
extern void neq(environment *env)
{
  eq(env);
  not(env);
}

/* Give a symbol some content. */
extern void def(environment *env)
{
  symbol *sym;

  /* Needs two values on the stack, the top one must be a symbol */
  if(env->head==NULL || env->head->next==NULL 
     || env->head->item->type!=symb) {
    printerr("Define what?");
    return;
  }

  /* long names are a pain */
  sym=env->head->item->content.ptr;

  /* if the symbol was bound to something else, throw it away */
  if(sym->val != NULL)
    free_val(sym->val);

  /* Bind the symbol to the value */
  sym->val= env->head->next->item;
  sym->val->refcount++;         /* Increase the reference counter */

  toss(env); toss(env);
} 

/* Quit stack. */
extern void quit(environment *env)
{
  exit(EXIT_SUCCESS);
}

/* Clear stack */
extern void clear(environment *env)
{
  while(env->head!=NULL)
    toss(env);
}

int main()
{
  environment myenv;
  char in_string[100];

  init_env(&myenv);

  printf("okidok\n ");

  while(fgets(in_string, 100, stdin) != NULL) {
    stack_read(&myenv, in_string);
    printf("okidok\n ");
  }

  exit(EXIT_SUCCESS);
}
1	/* printf */
2	#include <stdio.h>
3	/* EXIT_SUCCESS */
4	#include <stdlib.h>
5	/* NULL */
6	#include <stddef.h>
7	/* dlopen, dlsym, dlerror */
8	#include <dlfcn.h>
9	/* assert */
10	#include <assert.h>
11
12	#define HASHTBLSIZE 65536
13
14	/* First, define some types. */
15
16	/* A value of some type */
17	typedef struct {
18	enum {
19	integer,
20	string,
21	ref, /* Reference (to an element in the
22	hash table) */
23	func, /* Function pointer */
24	symb,
25	list
26	} type; /* Type of stack element */
27
28	union {
29	void ptr; / Pointer to the content */
30	int val; /* ...or an integer */
31	} content; /* Stores a pointer or an integer */
32
33	int refcount; /* Reference counter */
34
35	} value;
36
37	/* A symbol with a name and possible value */
38	/* (These do not need reference counters, they are kept unique by
39	hashing.) */
40	typedef struct symbol_struct {
41	char id; / Symbol name */
42	value val; / The value (if any) bound to it */
43	struct symbol_struct next; / In case of hashing conflicts, a */
44	} symbol; /* symbol is a kind of stack item. */
45
46	/* A type for a hash table for symbols */
47	typedef symbol hashtbl[HASHTBLSIZE]; / Hash table declaration */
48
49	/* An item (value) on a stack */
50	typedef struct stackitem_struct
51	{
52	value item; / The value on the stack */
53	struct stackitem_struct next; / Next item */
54	} stackitem;
55
56	/* An environment; gives access to the stack and a hash table of
57	defined symbols */
58	typedef struct {
59	stackitem head; / Head of the stack */
60	hashtbl symbols; /* Hash table of all variable bindings */
61	} environment;
62
63	/* A type for pointers to external functions */
64	typedef void (funcp)(environment ); /* funcp is a pointer to a void
65	function (environment ) /
66
67	/* Initialize a newly created environment */
68	void init_env(environment *env)
69	{
70	long i;
71
72	for(i= 0; i<HASHTBLSIZE; i++)
73	env->symbols[i]= NULL;
74	}
75
76	/* Returns a pointer to a pointer to an element in the hash table. */
77	symbol *hash(hashtbl in_hashtbl, const char in_string)
78	{
79	long i= 0;
80	unsigned long out_hash= 0;
81	char key= '\0';
82	symbol **position;
83
84	while(1){ /* Hash in_string */
85	key= in_string[i++];
86	if(key=='\0')
87	break;
88	out_hash= out_hash*32+key;
89	}
90
91	out_hash= out_hash%HASHTBLSIZE;
92	position= &(in_hashtbl[out_hash]);
93
94	while(1){
95	if(position==NULL) / If empty */
96	return position;
97
98	if(strcmp(in_string, (position)->id)==0) / If match */
99	return position;
100
101	position= &((position)->next); / Try next */
102	}
103	}
104
105	/* Generic push function. */
106	int push(stackitem** stack_head, stackitem* in_item)
107	{
108	in_item->next= *stack_head;
109	*stack_head= in_item;
110	return 1;
111	}
112
113	/* Push a value onto the stack */
114	void push_val(stackitem *stack_head, value val)
115	{
116	stackitem *new_item= malloc(sizeof(stackitem));
117	new_item->item= val;
118	val->refcount++;
119	push(stack_head, new_item);
120	}
121
122	/* Push an integer onto the stack. */
123	int push_int(stackitem **stack_head, int in_val)
124	{
125	value *new_value= malloc(sizeof(value));
126	stackitem *new_item= malloc(sizeof(stackitem));
127	new_item->item= new_value;
128
129	new_value->content.val= in_val;
130	new_value->type= integer;
131	new_value->refcount=1;
132
133	push(stack_head, new_item);
134	return 1;
135	}
136
137	/* Copy a string onto the stack. */
138	int push_cstring(stackitem *stack_head, const char in_string)
139	{
140	value *new_value= malloc(sizeof(value));
141	stackitem *new_item= malloc(sizeof(stackitem));
142	new_item->item=new_value;
143
144	new_value->content.ptr= malloc(strlen(in_string)+1);
145	strcpy(new_value->content.ptr, in_string);
146	new_value->type= string;
147	new_value->refcount=1;
148
149	push(stack_head, new_item);
150	return 1;
151	}
152
153	/* Push a symbol onto the stack. */
154	int push_sym(environment env, const char in_string)
155	{
156	stackitem new_item; / The new stack item */
157	/* ...which will contain... */
158	value new_value; / A new symbol value */
159	/* ...which might point to... */
160	symbol *new_symbol; / (if needed) A new actual symbol */
161	/* ...which, if possible, will be bound to... */
162	value new_fvalue; / (if needed) A new function value */
163	/* ...which will point to... */
164	void funcptr; / A function pointer */
165
166	static void handle= NULL; / Dynamic linker handle */
167
168	/* Create a new stack item containing a new value */
169	new_item= malloc(sizeof(stackitem));
170	new_value= malloc(sizeof(value));
171	new_item->item=new_value;
172
173	/* The new value is a symbol */
174	new_value->type= symb;
175	new_value->refcount= 1;
176
177	/* Look up the symbol name in the hash table */
178	new_symbol= hash(env->symbols, in_string);
179	new_value->content.ptr= *new_symbol;
180
181	if(new_value->content.ptr==NULL) { /* If symbol was undefined */
182
183	/* Create a new symbol */
184	*new_symbol= malloc(sizeof(symbol));
185	(new_symbol)->val= NULL; / undefined value */
186	(*new_symbol)->next= NULL;
187	(*new_symbol)->id= malloc(strlen(in_string)+1);
188	strcpy((*new_symbol)->id, in_string);
189
190	/* Intern the new symbol in the hash table */
191	new_value->content.ptr= *new_symbol;
192
193	/* Try to load the symbol name as an external function, to see if
194	we should bind the symbol to a new function pointer value */
195	if(handle==NULL) /* If no handle */
196	handle= dlopen(NULL, RTLD_LAZY);
197
198	funcptr= dlsym(handle, in_string); /* Get function pointer */
199	if(dlerror()==NULL) { /* If a function was found */
200	new_fvalue= malloc(sizeof(value)); /* Create a new value */
201	new_fvalue->type=func; /* The new value is a function pointer */
202	new_fvalue->content.ptr=funcptr; /* Store function pointer */
203	(new_symbol)->val= new_fvalue; / Bind the symbol to the new
204	function value */
205	new_fvalue->refcount= 1;
206	}
207	}
208	push(&(env->head), new_item);
209	return 1;
210	}
211
212	void printerr(const char* in_string) {
213	fprintf(stderr, "Err: %s\n", in_string);
214	}
215
216	/* Throw away a value */
217	void free_val(value *val){
218	stackitem item, temp;
219
220	val->refcount--; /* Decrease the reference count */
221	if(val->refcount == 0){
222	switch (val->type){ /* and free the contents if necessary */
223	case string:
224	free(val->content.ptr);
225	case list: /* lists needs to be freed recursively */
226	item=val->content.ptr;
227	while(item != NULL) { /* for all stack items */
228	free_val(item->item); /* free the value */
229	temp=item->next; /* save next ptr */
230	free(item); /* free the stackitem */
231	item=temp; /* go to next stackitem */
232	}
233	free(val); /* Free the actual list value */
234	break;
235	default:
236	break;
237	}
238	}
239	}
240
241	/* Discard the top element of the stack. */
242	extern void toss(environment *env)
243	{
244	stackitem *temp= env->head;
245
246	if((env->head)==NULL) {
247	printerr("Stack empty");
248	return;
249	}
250
251	free_val(env->head->item); /* Free the value */
252	env->head= env->head->next; /* Remove the top stack item */
253	free(temp); /* Free the old top stack item */
254	}
255
256	/* Print newline. */
257	extern void nl()
258	{
259	printf("\n");
260	}
261
262	/* Prints the top element of the stack. */
263	void print_h(stackitem *stack_head)
264	{
265
266	if(stack_head==NULL) {
267	printerr("Stack empty");
268	return;
269	}
270
271	switch(stack_head->item->type) {
272	case integer:
273	printf("%d", stack_head->item->content.val);
274	break;
275	case string:
276	printf("\"%s\"", (char*)stack_head->item->content.ptr);
277	break;
278	case symb:
279	printf("'%s'", ((symbol *)(stack_head->item->content.ptr))->id);
280	break;
281	default:
282	printf("%p", (funcp)(stack_head->item->content.ptr));
283	break;
284	}
285	}
286
287	extern void print_(environment *env) {
288	print_h(env->head);
289	}
290
291	/* Prints the top element of the stack and then discards it. */
292	extern void print(environment *env)
293	{
294	print_(env);
295	toss(env);
296	}
297
298	/* Only to be called by function printstack. */
299	void print_st(stackitem *stack_head, long counter)
300	{
301	if(stack_head->next != NULL)
302	print_st(stack_head->next, counter+1);
303	printf("%ld: ", counter);
304	print_h(stack_head);
305	nl();
306	}
307
308
309
310	/* Prints the stack. */
311	extern void printstack(environment *env)
312	{
313	if(env->head != NULL) {
314	print_st(env->head, 1);
315	nl();
316	} else {
317	printerr("Stack empty");
318	}
319	}
320
321	/* Swap the two top elements on the stack. */
322	extern void swap(environment *env)
323	{
324	stackitem *temp= env->head;
325
326	if((env->head)==NULL) {
327	printerr("Stack empty");
328	return;
329	}
330
331	if(env->head->next==NULL) {
332	printerr("Not enough arguments");
333	return;
334	}
335
336	env->head= env->head->next;
337	temp->next= env->head->next;
338	env->head->next= temp;
339	}
340
341	stackitem* copy(stackitem* in_item)
342	{
343	stackitem *out_item= malloc(sizeof(stackitem));
344
345	memcpy(out_item, in_item, sizeof(stackitem));
346	out_item->next= NULL;
347
348	return out_item;
349	}
350
351
352	/* If the top element is a symbol, determine if it's bound to a
353	function value, and if it is, toss the symbol and execute the
354	function. */
355	extern void eval(environment *env)
356	{
357	funcp in_func;
358	value* val;
359	if(env->head==NULL) {
360	printerr("Stack empty");
361	return;
362	}
363
364	/* if it's a symbol */
365	if(env->head->item->type==symb) {
366
367	/* If it's not bound to anything */
368	if (((symbol *)(env->head->item->content.ptr))->val == NULL) {
369	printerr("Unbound variable");
370	return;
371	}
372
373	/* If it contains a function */
374	if (((symbol *)(env->head->item->content.ptr))->val->type == func) {
375	in_func=
376	(funcp)(((symbol *)(env->head->item->content.ptr))->val->content.ptr);
377	toss(env);
378	(in_func)(env); / Run the function */
379	return;
380	} else { /* If it's not a function */
381	val=((symbol *)(env->head->item->content.ptr))->val;
382	toss(env); /* toss the symbol */
383	push_val(&(env->head), val); /* Return its bound value */
384	}
385	}
386
387	/* If it's a lone function value, run it */
388	if(env->head->item->type==func) {
389	in_func= (funcp)(env->head->item->content.ptr);
390	toss(env);
391	(*in_func)(env);
392	return;
393	}
394
395	/* push(&(env->head), copy(env->head)); */
396	/* swap(env); */
397	/* toss(env); */
398	}
399
400	/* Make a list. */
401	extern void pack(environment *env)
402	{
403	void* delimiter;
404	stackitem iterator, temp;
405	value *pack;
406
407	delimiter= env->head->item->content.ptr; /* Get delimiter */
408	toss(env);
409
410	iterator= env->head;
411
412	if(iterator==NULL \|\| iterator->item->content.ptr==delimiter) {
413	temp= NULL;
414	toss(env);
415	} else {
416	/* Search for first delimiter */
417	while(iterator->next!=NULL
418	&& iterator->next->item->content.ptr!=delimiter)
419	iterator= iterator->next;
420
421	/* Extract list */
422	temp= env->head;
423	env->head= iterator->next;
424	iterator->next= NULL;
425
426	if(env->head!=NULL)
427	toss(env);
428	}
429
430	/* Push list */
431	pack= malloc(sizeof(value));
432	pack->type= list;
433	pack->content.ptr= temp;
434	pack->refcount= 1;
435
436	temp= malloc(sizeof(stackitem));
437	temp->item= pack;
438
439	push(&(env->head), temp);
440	}
441
442	/* Parse input. */
443	int stack_read(environment env, char in_line)
444	{
445	char temp, rest;
446	int itemp;
447	size_t inlength= strlen(in_line)+1;
448	int convert= 0;
449	static int non_eval_flag= 0;
450
451	temp= malloc(inlength);
452	rest= malloc(inlength);
453
454	do {
455	/* If string */
456	if((convert= sscanf(in_line, "\"%[^\"\n\r]\" %[^\n\r]", temp, rest))) {
457	push_cstring(&(env->head), temp);
458	break;
459	}
460	/* If integer */
461	if((convert= sscanf(in_line, "%d %[^\n\r]", &itemp, rest))) {
462	push_int(&(env->head), itemp);
463	break;
464	}
465	/* Escape ';' with '\' */
466	if((convert= sscanf(in_line, "\\%c%[^\n\r]", temp, rest))) {
467	temp[1]= '\0';
468	push_sym(env, temp);
469	break;
470	}
471	/* If symbol */
472	if((convert= sscanf(in_line, "%[^][ ;\n\r_]%[^\n\r]", temp, rest))) {
473	push_sym(env, temp);
474	break;
475	}
476	/* If single char */
477	if((convert= sscanf(in_line, "%c%[^\n\r]", temp, rest))) {
478	if(*temp==';') {
479	if(!non_eval_flag) {
480	eval(env); /* Evaluate top element */
481	break;
482	}
483
484	push_sym(env, ";");
485	break;
486	}
487
488	if(*temp==']') {
489	push_sym(env, "[");
490	pack(env);
491	if(non_eval_flag!=0)
492	non_eval_flag--;
493	break;
494	}
495
496	if(*temp=='[') {
497	push_sym(env, "[");
498	non_eval_flag++;
499	break;
500	}
501	}
502	} while(0);
503
504
505	free(temp);
506
507	if(convert<2) {
508	free(rest);
509	return 0;
510	}
511
512	stack_read(env, rest);
513
514	free(rest);
515	return 1;
516	}
517
518	/* Relocate elements of the list on the stack. */
519	extern void expand(environment *env)
520	{
521	stackitem temp, new_head;
522
523	/* Is top element a list? */
524	if(env->head==NULL \|\| env->head->item->type!=list) {
525	printerr("Stack empty or not a list");
526	return;
527	}
528
529	/* The first list element is the new stack head */
530	new_head= temp= env->head->item->content.ptr;
531
532	env->head->item->refcount++;
533	toss(env);
534
535	/* Find the end of the list */
536	while(temp->next!=NULL)
537	temp= temp->next;
538
539	/* Connect the tail of the list with the old stack head */
540	temp->next= env->head;
541	env->head= new_head; /* ...and voila! */
542
543	}
544
545	/* Compares two elements by reference. */
546	extern void eq(environment *env)
547	{
548	void left, right;
549	int result;
550
551	if((env->head)==NULL \|\| env->head->next==NULL) {
552	printerr("Not enough elements to compare");
553	return;
554	}
555
556	left= env->head->item->content.ptr;
557	swap(env);
558	right= env->head->item->content.ptr;
559	result= (left==right);
560
561	toss(env); toss(env);
562	push_int(&(env->head), result);
563	}
564
565	/* Negates the top element on the stack. */
566	extern void not(environment *env)
567	{
568	int val;
569
570	if((env->head)==NULL \|\| env->head->item->type!=integer) {
571	printerr("Stack empty or element is not a integer");
572	return;
573	}
574
575	val= env->head->item->content.val;
576	toss(env);
577	push_int(&(env->head), !val);
578	}
579
580	/* Compares the two top elements on the stack and return 0 if they're the
581	same. */
582	extern void neq(environment *env)
583	{
584	eq(env);
585	not(env);
586	}
587
588	/* Give a symbol some content. */
589	extern void def(environment *env)
590	{
591	symbol *sym;
592
593	/* Needs two values on the stack, the top one must be a symbol */
594	if(env->head==NULL \|\| env->head->next==NULL
595	\|\| env->head->item->type!=symb) {
596	printerr("Define what?");
597	return;
598	}
599
600	/* long names are a pain */
601	sym=env->head->item->content.ptr;
602
603	/* if the symbol was bound to something else, throw it away */
604	if(sym->val != NULL)
605	free_val(sym->val);
606
607	/* Bind the symbol to the value */
608	sym->val= env->head->next->item;
609	sym->val->refcount++; /* Increase the reference counter */
610
611	toss(env); toss(env);
612	}
613
614	/* Quit stack. */
615	extern void quit(environment *env)
616	{
617	exit(EXIT_SUCCESS);
618	}
619
620	/* Clear stack */
621	extern void clear(environment *env)
622	{
623	while(env->head!=NULL)
624	toss(env);
625	}
626
627	int main()
628	{
629	environment myenv;
630	char in_string[100];
631
632	init_env(&myenv);
633
634	printf("okidok\n ");
635
636	while(fgets(in_string, 100, stdin) != NULL) {
637	stack_read(&myenv, in_string);
638	printf("okidok\n ");
639	}
640
641	exit(EXIT_SUCCESS);
642	}