source file of the GNU LilyPond music typesetter
- (c) 1998--1999 Jan Nieuwenhuizen <janneke@gnu.org>
+ (c) 1998--2000 Jan Nieuwenhuizen <janneke@gnu.org>
Han-Wen Nienhuys <hanwen@cs.uu.nl>
*/
+
#include <stdio.h>
+#include <stdlib.h>
+
#include "libc-extension.hh"
#include "lily-guile.hh"
#include "main.hh"
#include "simple-file-storage.hh"
#include "file-path.hh"
#include "debug.hh"
+#include "direction.hh"
+#include "offset.hh"
+
+SCM
+ly_str02scm (char const*c)
+{
+ // this all really sucks, guile should take char const* arguments!
+ return gh_str02scm ((char*)c);
+}
+SCM
+ly_eval_str (String s)
+{
+ // this all really sucks, guile should take char const* arguments!
+ return gh_eval_str ((char*)s.ch_C ());
+}
+
/*
- scm_m_quote doesn't use any env, but needs one for a good signature in GUILE.
+ Pass string to scm parser, evaluate one expression.
+ Return result value and #chars read.
- Why there is no gh_quote () in GUILE beats me.
+ Thanks to Gary Houston <ghouston@freewire.co.uk>
+
+ Need guile-1.3.4 (>1.3 anyway) for ftell on str ports -- jcn
*/
+SCM
+ly_parse_scm (char const* s, int* n)
+{
+ SCM str = gh_str02scm ((char*)s);
+ SCM port = scm_mkstrport (SCM_INUM0, str, SCM_OPN | SCM_RDNG,
+ "scm_eval_0str");
+ SCM from = scm_ftell (port);
+
+ SCM form;
+ SCM answer = SCM_UNSPECIFIED;
+
+ /* Read expression from port */
+ if (!SCM_EOF_OBJECT_P (form = scm_read (port)))
+ answer = scm_eval_x (form);
+
+ /*
+ After parsing
+
+ (begin (foo 1 2))
+
+ all seems fine, but after parsing
+
+ (foo 1 2)
+
+ read_buf has been advanced to read_pos - 1,
+ so that scm_ftell returns 1, instead of #parsed chars
+ */
+
+ /*
+ urg: reset read_buf for scm_ftell
+ shouldn't scm_read () do this for us?
+ */
+ scm_fill_input (port);
+ SCM to = scm_ftell (port);
+ *n = gh_scm2int (to) - gh_scm2int (from);
+
+ /* Don't close the port here; if we re-enter this function via a
+ continuation, then the next time we enter it, we'll get an error.
+ It's a string port anyway, so there's no advantage to closing it
+ early.
+
+ scm_close_port (port);
+ */
+
+ return answer;
+}
SCM
ly_quote_scm (SCM s)
{
- return scm_cons2 (scm_i_quote, s, SCM_EOL);
+ return gh_list (ly_symbol2scm ("quote"), s, SCM_UNDEFINED);
}
-/*
- See: libguile/symbols.c
- SCM
- scm_string_to_symbol(s)
-
-*/
SCM
-ly_symbol (String name)
+ly_symbol2scm(const char *s)
{
- return gh_car (scm_intern (name.ch_C(), name.length_i()));
+ return gh_symbol2scm ((char *)s);
}
String
-symbol_to_string (SCM s)
+ly_symbol2string (SCM s)
{
+ assert (gh_symbol_p (s));
return String((Byte*)SCM_CHARS (s), (int) SCM_LENGTH(s));
}
-SCM
-ly_set_scm (String name, SCM val)
-{
- return scm_sysintern (name.ch_C(), val);
-
-}
-/**
+/**
Read a file, and shove it down GUILE. GUILE also has file read
functions, but you can't fiddle with the path of those.
-
*/
void
read_lily_scm_file (String fn)
String s = global_path.find (fn);
if (s == "")
{
- String e = _f ("Can not find file `%s\'", fn);
+ String e = _f ("Can't find file: `%s'", fn);
e += " ";
- e += _f ("(Load path is `%s\'", global_path.str ());
+ e += _f ("(load path: `%s')", global_path.str ());
error (e);
}
else
- *mlog << '[' << s;
+ progress_indication ("[" + s);
Simple_file_storage f(s);
- gh_eval_str ((char *) f.ch_C());
- *mlog << ']' << flush;
+ ly_eval_str ((char *) f.ch_C());
+ progress_indication ("]");
}
+SCM
+ly_gulp_file (SCM name)
+{
+ String fn (ly_scm2string (name));
+ String s = global_path.find (fn);
+ if (s == "")
+ {
+ String e = _f ("Can't find file: `%s'", fn);
+ e += " ";
+ e += _f ("(load path: `%s')", global_path.str ());
+ error (e);
+ }
+ else
+ progress_indication ("[" + s );
+
+
+ Simple_file_storage f(s);
+ SCM result = ly_str02scm (f.ch_C());
+ progress_indication ("]");
+ return result;
+}
+
void
ly_display_scm (SCM s)
{
String
ly_scm2string (SCM s)
{
+ assert (gh_string_p (s));
int len;
char * p = gh_scm2newstr (s , &len);
String r (p);
- delete p;
+
+ free (p);
return r;
}
-/*
- Layout of nodes:
-
- (key . (left_child . right_child))
-
- SCM_EOL is the nil-pointer (should use SCM_NIMP() ?)
- */
-
-#define left_child(s) SCM_CADR((s))
-#define right_child(s) SCM_CDDR((s))
-#define key(s) SCM_CAR((s))
-
-/*
- Garble pointers, to prevent unbalanced tree due to ordered inserts.
- */
-
-unsigned int
-munge (SCM s)
+SCM
+index_cell (SCM s, Direction d)
{
- const int SHIFT = 18;
- return (unsigned int)(s << (32-SHIFT) | s >> SHIFT );
+ assert (d);
+ return (d == LEFT) ? gh_car (s) : gh_cdr (s);
}
SCM
-ly_new_bintree_node (SCM val)
+index_set_cell (SCM s, Direction d, SCM v)
{
- return gh_cons (val, gh_cons (SCM_EOL, SCM_EOL));
+ if (d == LEFT)
+ gh_set_car_x (s, v);
+ else if (d == RIGHT)
+ gh_set_cdr_x (s, v);
+ return s;
+}
+
+SCM
+ly_warning (SCM str)
+{
+ assert (gh_string_p (str));
+ warning ("lily-guile: " + ly_scm2string (str));
+ return SCM_BOOL_T;
}
-
-/*
- add VAL to TREE. TREE must be non-nil
- */
-void
-ly_addto_bintree (SCM *tree, SCM val)
+SCM
+ly_isdir_p (SCM s)
{
- while(*tree != SCM_EOL)
+ if (gh_number_p (s))
{
- if (munge (val) <= munge (key (*tree)))
- tree = &left_child (*tree);
- else
- tree = &right_child (*tree);
+ int i = gh_scm2int (s);
+ return (i>= -1 && i <= 1) ? SCM_BOOL_T : SCM_BOOL_F;
}
+ return SCM_BOOL_F;
+}
+
- *tree = ly_new_bintree_node (val);
+static void
+init_functions ()
+{
+ scm_make_gsubr ("ly-warn", 1, 0, 0, (SCM(*)(...))ly_warning);
+ scm_make_gsubr ("ly-gulp-file", 1,0, 0, (SCM(*)(...))ly_gulp_file);
+ scm_make_gsubr ("dir?", 1,0, 0, (SCM(*)(...))ly_isdir_p);
}
+ADD_SCM_INIT_FUNC(funcs, init_functions);
-/*
- find the address of a node in the tree represented by *NODE with key VAL
- */
-SCM *
-ly_find_in_bintree (SCM *node, SCM val)
+
+typedef void (*Void_fptr)();
+Array<Void_fptr> *scm_init_funcs_;
+
+void add_scm_init_func (void (*f)())
{
- while (*node != SCM_EOL)
- {
- if (munge (val) < munge (key(*node) ))
- node = &left_child(*node);
- else if (munge (val) > munge (key (*node)))
- node = &right_child (*node);
- else
- return node;
- }
- return node;
+ if (!scm_init_funcs_)
+ scm_init_funcs_ = new Array<Void_fptr>;
+
+ scm_init_funcs_->push (f);
}
void
-ly_remove_from_bintree (SCM *node)
+init_lily_guile ()
{
- SCM r = right_child (*node);
- SCM l = left_child (*node);
-
- if (r == SCM_EOL)
- {
- *node = l;
- }
- else if (l == SCM_EOL)
- {
- *node = r;
- }
- else
+ for (int i=scm_init_funcs_->size() ; i--;)
+ (scm_init_funcs_->elem (i)) ();
+}
+
+unsigned int ly_scm_hash (SCM s)
+{
+ return scm_ihashv (s, ~1u);
+}
+
+
+
+bool
+isdir_b (SCM s)
+{
+ if (gh_number_p (s))
{
- /*deleting from binary trees. See Knuth's TAOCP.
- */
- SCM *t = node;
- SCM *left_t = &left_child (*t);
-
- /*
- INV: LEFT_T is the left child of T
- */
- while (*left_t != SCM_EOL)
- {
- t = left_t;
- left_t = &left_child (*t);
- }
-
- /*
- POST: T is the leftmost right child of NODE which has no left child,
-
- leftchild (LASTT) == T
- */
- key(*node) = key(*t);
- *left_t = right_child (*t);
+ int i = gh_scm2int (s);
+ return i>= -1 && i <= 1;
}
+ return false;
}
+Direction
+to_dir (SCM s)
+{
+ return (Direction) gh_scm2int (s);
+}
-static SCM protect_tree_root;
SCM
-ly_protect_scm (SCM s)
+to_scm (int i)
{
- ly_addto_bintree (&protect_tree_root, s);
- return s;
+ return gh_int2scm (i);
}
-SCM
-ly_unprotect_scm (SCM s)
+/*
+ UGR. junkme.
+ */
+int
+scm_to (SCM s, int* )
{
- SCM *to_remove = ly_find_in_bintree (&protect_tree_root, s);
-
- /*
- this shouldn't happen, according to me. But it does.
- */
- if (*to_remove != SCM_EOL)
- ly_remove_from_bintree (to_remove);
- return s;
+ return gh_number_p (s) ? gh_scm2int (s) : 0;
}
-void
-ly_init_protection ()
+SCM
+to_scm (Real r)
{
- protect_tree_root = scm_protect_object (ly_new_bintree_node(SCM_EOL));
- key (protect_tree_root) = protect_tree_root;
+ return gh_double2scm (r);
}
+Real
+scm_to (SCM s, Real* )
+{
+ return gh_number_p (s) ? gh_scm2double (s) : 0;
+}
-int
-ly_count_elements (SCM tree)
+bool
+to_boolean (SCM s)
{
- if (tree == SCM_EOL)
- return 0;
- else
- return 1 + ly_count_elements (left_child (tree)) + ly_count_elements (right_child( tree));
+ return gh_boolean_p (s) && gh_scm2bool (s);
}
-int
-ly_tree_depth (SCM tree)
+/*
+ Appendable list L: the cdr contains the list, the car the last cons
+ in the list.
+ */
+SCM
+appendable_list ()
{
- if (tree == SCM_EOL)
- return 0;
- else
- return 1 + (ly_tree_depth (left_child (tree)) >? ly_tree_depth (right_child(tree)));
+ SCM s = gh_cons (SCM_EOL, SCM_EOL);
+ gh_set_car_x (s, s);
+
+ return s;
}
void
-ly_print_bintree (SCM node)
+appendable_list_append (SCM l, SCM elt)
{
-#ifndef NPRINT
- if (node == SCM_EOL)
- return;
- DOUT << "{val = " << key(node) << " \nleft = ";
- ly_print_bintree (left_child (node));
- DOUT << "\n right =";
- ly_print_bintree (right_child (node));
- DOUT << "}";
-#endif
+ SCM newcons = gh_cons (elt, SCM_EOL);
+
+ gh_set_cdr_x (gh_car (l), newcons);
+ gh_set_car_x (l, newcons);
}
-struct Imbalance { int imbalance; int total; };
-
-Imbalance
-ly_calc_imbalance (SCM node)
+SCM
+ly_offset2scm (Offset o)
{
- Imbalance t;
- if (node == SCM_EOL)
- {
- t.imbalance = 0;
- t.total = 0;
- return t;
- }
-
- Imbalance l = ly_calc_imbalance (left_child (node));
- Imbalance r = ly_calc_imbalance (right_child (node));
+ return gh_cons (gh_double2scm (o[X_AXIS]), gh_double2scm(o[Y_AXIS]));
+}
- t.total = l.total + r.total + 1;
- int dif = l.total - r.total;
- if (dif < 0)
- dif = -dif;
- t.imbalance = l.imbalance + r.imbalance + dif;
- return t;
+Offset
+ly_scm2offset (SCM s)
+{
+ return Offset (gh_scm2double (gh_car (s)),
+ gh_scm2double (gh_cdr (s)));
}