* FML interpreter. Europagate, 1995
*
* $Log: fmlmem.c,v $
- * Revision 1.1 1995/02/06 13:48:09 adam
- * Initial revision
+ * Revision 1.8 1995/02/23 08:32:05 adam
+ * Changed header.
+ *
+ * Revision 1.6 1995/02/10 18:15:52 adam
+ * FML function 'strcmp' implemented. This function can be used to
+ * test for existence of MARC fields.
+ *
+ * Revision 1.5 1995/02/09 14:37:18 adam
+ * Removed .depend from cvs. Removed function fml_mk_list.
+ *
+ * Revision 1.4 1995/02/09 14:33:37 adam
+ * Split source fml.c and define relevant build-in functions in separate
+ * files. New operators mult, div, not, llen implemented.
+ *
+ * Revision 1.3 1995/02/09 13:07:15 adam
+ * Nodes are freed now. Many bugs fixed.
+ *
+ * Revision 1.2 1995/02/06 15:23:26 adam
+ * Added some more relational operators (le,ne,ge). Added increment
+ * and decrement operators. Function index changed, so that first
+ * element is 1 - not 0. Function fml_atom_val edited.
+ *
+ * Revision 1.1.1.1 1995/02/06 13:48:10 adam
+ * First version of the FML interpreter. It's slow and memory isn't
+ * freed properly. In particular, the FML nodes aren't released yet.
*
*/
#include <stdio.h>
#define FML_ATOM_CHUNK 1024
#define FML_NODE_CHUNK 1024
+static int no_nodes = 0;
+static int no_atoms = 0;
+
struct fml_node *fml_node_alloc (Fml fml)
{
struct fml_node *n;
fml->node_free_list = n->p[1];
n->p[0] = n->p[1] = NULL;
n->is_atom = 0;
+ no_nodes++;
return n;
}
}
fa = fml->atom_free_list;
fml->atom_free_list = fa->next;
+ no_atoms++;
return fa;
}
{
a->next = fml->atom_free_list;
fml->atom_free_list = a;
+ no_atoms--;
}
static struct fml_atom *atom_copy (Fml fml, struct fml_atom *a)
a0 = a1 = atom_malloc (fml);
while (a)
{
- memcpy (&a1->buf, &a->buf, FML_ATOM_CHUNK);
+ memcpy (&a1->buf, &a->buf, FML_ATOM_BUF);
if (!a->next)
break;
a = a->next;
return a0;
}
-struct fml_node *fml_mk_list (Fml fml, struct fml_node *fn)
+int fml_atom_cmp (Fml fml, struct fml_atom *a1, struct fml_atom *a2)
{
- if (fn->is_atom)
+ while (a1 && a2)
{
- struct fml_node *fn2;
-
- fn2 = fml_node_alloc (fml);
- fn2->is_atom = 1;
- fn2->p[0] = fn->p[0];
- return fn2;
+ int n;
+ n = strncmp (a1->buf, a2->buf, FML_ATOM_BUF);
+ if (n)
+ return n;
+ a1 = a1->next;
+ a2 = a2->next;
}
- else
- return fn->p[0];
+ if (!a1 && !a2)
+ return 0;
+ if (a1)
+ return 1;
+ return -1;
}
int fml_atom_str (struct fml_atom *a, char *str)
int fml_atom_val (struct fml_atom *a)
{
+ static char arg[256];
assert (a);
- return atoi (a->buf);
+ if (!a->next)
+ return atoi (a->buf);
+ fml_atom_strx (a, arg, 200);
+ return atoi (arg);
+}
+
+struct fml_node *fml_mk_node_val (Fml fml, int val)
+{
+ static char arg[64];
+ struct fml_node *fn;
+
+ sprintf (arg, "%d", val);
+ fn = fml_node_alloc (fml);
+ fn->is_atom = 1;
+ fn->p[0] = fml_atom_alloc (fml, arg);
+ return fn;
}
void fml_node_delete (Fml fml, struct fml_node *fn)
fn->p[1] = fml->node_free_list;
fml->node_free_list = fn;
+ no_nodes--;
fn = f1;
}
}
return fn0;
}
+
+void fml_node_stat (Fml fml)
+{
+ if (fml->debug & 2)
+ printf ("<<node=%d, atom=%d>>", no_nodes, no_atoms);
+}