This is eval.c in view mode; [Download] [Up]
#ifndef lint
static char *RCSid = "$Id: eval.c%v 3.38.2.78 1993/02/20 02:59:43 woo Exp woo $";
#endif
/* GNUPLOT - eval.c */
/*
* Copyright (C) 1986 - 1993 Thomas Williams, Colin Kelley
*
* Permission to use, copy, and distribute this software and its
* documentation for any purpose with or without fee is hereby granted,
* provided that the above copyright notice appear in all copies and
* that both that copyright notice and this permission notice appear
* in supporting documentation.
*
* Permission to modify the software is granted, but not the right to
* distribute the modified code. Modifications are to be distributed
* as patches to released version.
*
* This software is provided "as is" without express or implied warranty.
*
*
* AUTHORS
*
* Original Software:
* Thomas Williams, Colin Kelley.
*
* Gnuplot 2.0 additions:
* Russell Lang, Dave Kotz, John Campbell.
*
* Gnuplot 3.0 additions:
* Gershon Elber and many others.
*
* Send your comments or suggestions to
* info-gnuplot@dartmouth.edu.
* This is a mailing list; to join it send a note to
* info-gnuplot-request@dartmouth.edu.
* Send bug reports to
* bug-gnuplot@dartmouth.edu.
*/
#include <stdio.h>
#include "plot.h"
extern int c_token;
extern struct ft_entry ft[];
extern struct udvt_entry *first_udv;
extern struct udft_entry *first_udf;
extern struct at_type at;
extern struct lexical_unit token[];
struct value *Ginteger();
struct udvt_entry *
add_udv(t_num) /* find or add value and return pointer */
int t_num;
{
register struct udvt_entry **udv_ptr = &first_udv;
/* check if it's already in the table... */
while (*udv_ptr) {
if (equals(t_num,(*udv_ptr)->udv_name))
return(*udv_ptr);
udv_ptr = &((*udv_ptr)->next_udv);
}
*udv_ptr = (struct udvt_entry *)
alloc((unsigned long)sizeof(struct udvt_entry), "value");
(*udv_ptr)->next_udv = NULL;
copy_str((*udv_ptr)->udv_name,t_num);
(*udv_ptr)->udv_value.type = INTGR; /* not necessary, but safe! */
(*udv_ptr)->udv_undef = TRUE;
return(*udv_ptr);
}
struct udft_entry *
add_udf(t_num) /* find or add function and return pointer */
int t_num; /* index to token[] */
{
register struct udft_entry **udf_ptr = &first_udf;
int i;
while (*udf_ptr) {
if (equals(t_num,(*udf_ptr)->udf_name))
return(*udf_ptr);
udf_ptr = &((*udf_ptr)->next_udf);
}
*udf_ptr = (struct udft_entry *)
alloc((unsigned long)sizeof(struct udft_entry), "function");
(*udf_ptr)->next_udf = (struct udft_entry *) NULL;
(*udf_ptr)->definition = NULL;
(*udf_ptr)->at = NULL;
copy_str((*udf_ptr)->udf_name,t_num);
for(i=0; i<MAX_NUM_VAR; i++)
(void) Ginteger(&((*udf_ptr)->dummy_values[i]), 0);
return(*udf_ptr);
}
union argument *
add_action(sf_index)
enum operators sf_index; /* index of p-code function */
{
if (at.a_count >= MAX_AT_LEN)
int_error("action table overflow",NO_CARET);
at.actions[at.a_count].index = sf_index;
return(&(at.actions[at.a_count++].arg));
}
int standard(t_num) /* return standard function index or 0 */
{
register int i;
for (i = (int)SF_START; ft[i].f_name != NULL; i++) {
if (equals(t_num,ft[i].f_name))
return(i);
}
return(0);
}
execute_at(at_ptr)
struct at_type *at_ptr;
{
register int i,index,count,offset;
count = at_ptr->a_count;
for (i = 0; i < count;) {
index = (int)at_ptr->actions[i].index;
offset = (*ft[index].func)(&(at_ptr->actions[i].arg));
if (is_jump(index))
i += offset;
else
i++;
}
}
/*
'ft' is a table containing C functions within this program.
An 'action_table' contains pointers to these functions and arguments to be
passed to them.
at_ptr is a pointer to the action table which must be executed (evaluated)
so the iterated line exectues the function indexed by the at_ptr and
passes the address of the argument which is pointed to by the arg_ptr
*/
These are the contents of the former NiCE NeXT User Group NeXTSTEP/OpenStep software archive, currently hosted by Netfuture.ch.