2 lily-guile.cc -- implement assorted guile functions
4 source file of the GNU LilyPond music typesetter
6 (c) 1998--2004 Jan Nieuwenhuizen <janneke@gnu.org>
8 Han-Wen Nienhuys <hanwen@cs.uu.nl>
14 #include <math.h> /* isinf */
15 #include <string.h> /* strdup, strchr */
18 #include "lily-proto.hh"
22 source-file.hh includes cmath which undefines isinf and isnan
24 FIXME: #ifdef MACOS_X?
26 inline int my_isinf (Real r) { return isinf (r); }
27 inline int my_isnan (Real r) { return isnan (r); }
30 #include "libc-extension.hh"
31 #include "lily-guile.hh"
33 #include "file-path.hh"
35 #include "direction.hh"
37 #include "interval.hh"
39 #include "dimensions.hh"
40 #include "source-file.hh"
47 return ly_car (scm_last_pair (list));
54 SCM port = scm_mkstrport (SCM_INUM0,
55 scm_make_string (SCM_INUM0, SCM_UNDEFINED),
58 // SCM write = scm_eval_3 (ly_symbol2scm ("write"), s, SCM_EOL);
59 SCM write = scm_primitive_eval (ly_symbol2scm ("write"));
61 // scm_apply (write, port, SCM_EOL);
62 scm_call_2 (write, s, port);
63 return scm_strport_to_string (port);
70 return scm_list_n (ly_symbol2scm ("quote"), s, SCM_UNDEFINED);
74 ly_symbol2string (SCM s)
76 assert (is_symbol (s));
77 return String ((Byte*)SCM_STRING_CHARS (s), (int) SCM_STRING_LENGTH (s));
81 gulp_file_to_string (String fn)
83 String s = global_path.find (fn);
86 String e = _f ("can't find file: `%s'", fn);
88 e += _f ("(load path: `%s')", global_path.to_string ());
91 else if (verbose_global_b)
92 progress_indication ("[" + s);
95 char * str = gulp_file (s, &n);
100 progress_indication ("]");
105 LY_DEFINE (ly_gulp_file, "ly:gulp-file",
107 "Read the file @var{name}, and return its contents in a string. "
108 "The file is looked up using the search path.")
110 SCM_ASSERT_TYPE (is_string (name), name, SCM_ARG1, __FUNCTION__, "string");
111 return scm_makfrom0str (gulp_file_to_string (ly_scm2string (name)).to_str0 ());
116 // maybe gdb 5.0 becomes quicker if it doesn't do fancy C++ typing?
118 ly_display_scm (SCM s)
120 scm_display (s, scm_current_output_port ());
121 scm_newline (scm_current_output_port ());
126 ly_scm2string (SCM s)
128 assert (is_string (s));
130 char *p = SCM_STRING_CHARS (s);
136 ly_scm2newstr (SCM str, size_t *lenp)
141 SCM_ASSERT_TYPE (is_string (str), str, SCM_ARG1, __FUNCTION__, "string");
143 len = SCM_STRING_LENGTH (str);
144 new_str = (char *) malloc ((len + 1) * sizeof (char));
149 memcpy (new_str, SCM_STRING_CHARS (str), len);
159 index_get_cell (SCM s, Direction d)
163 return (d == LEFT) ? ly_car (s) : ly_cdr (s);
167 index_set_cell (SCM s, Direction d, SCM v)
170 scm_set_car_x (s, v);
172 scm_set_cdr_x (s, v);
176 LY_DEFINE (ly_warning,"ly:warn", 1, 0, 0,
177 (SCM str), "Scheme callable function to issue the warning @code{msg}.")
179 SCM_ASSERT_TYPE (is_string (str), str, SCM_ARG1, __FUNCTION__, "string");
180 progress_indication ("\n");
181 warning ("lily-guile: " + ly_scm2string (str));
185 LY_DEFINE (is_dir, "ly:dir?", 1,0, 0, (SCM s),
186 "type predicate. A direction is @code{-1}, @code{0} or "
187 "@code{1}, where @code{-1} represents "
188 "left or down and @code{1} represents right or up.")
192 int i = ly_scm2int (s);
193 return (i>= -1 && i <= 1) ? SCM_BOOL_T : SCM_BOOL_F;
199 is_number_pair (SCM p)
201 return is_pair (p) && is_number (ly_car (p)) && is_number (ly_cdr (p));
204 typedef void (*Void_fptr) ();
205 Array<Void_fptr> *scm_init_funcs_;
207 void add_scm_init_func (void (*f) ())
209 if (!scm_init_funcs_)
210 scm_init_funcs_ = new Array<Void_fptr>;
212 scm_init_funcs_->push (f);
217 ly_init_ly_module (void *)
219 for (int i=scm_init_funcs_->size () ; i--;)
220 (scm_init_funcs_->elem (i)) ();
222 if (verbose_global_b)
223 progress_indication ("\n");
225 scm_primitive_load_path (scm_makfrom0str ("lily.scm"));
229 SCM global_lily_module;
234 global_lily_module = scm_c_define_module ("lily", ly_init_ly_module, 0);
235 scm_c_use_module ("lily");
238 unsigned int ly_scm_hash (SCM s)
240 return scm_ihashv (s, ~1u);
250 int i = ly_scm2int (s);
251 return i>= -1 && i <= 1;
262 int i = ly_scm2int (s);
263 return i== 0 || i == 1;
271 return SCM_INUMP (s) ? (Direction) ly_scm2int (s) : CENTER;
275 ly_scm2interval (SCM p)
277 return Interval (ly_scm2double (ly_car (p)), ly_scm2double (ly_cdr (p)));
281 ly_scm2realdrul (SCM p)
283 return Drul_array<Real> (ly_scm2double (ly_car (p)),
284 ly_scm2double (ly_cdr (p)));
288 ly_interval2scm (Drul_array<Real> i)
290 return scm_cons (scm_make_real (i[LEFT]), scm_make_real (i[RIGHT]));
296 return is_boolean (s) && ly_scm2bool (s);
299 /* Appendable list L: the cdr contains the list, the car the last cons
304 SCM s = scm_cons (SCM_EOL, SCM_EOL);
305 scm_set_car_x (s, s);
311 appendable_list_append (SCM l, SCM elt)
313 SCM newcons = scm_cons (elt, SCM_EOL);
315 scm_set_cdr_x (ly_car (l), newcons);
316 scm_set_car_x (l, newcons);
321 ly_offset2scm (Offset o)
323 return scm_cons (scm_make_real (o[X_AXIS]), scm_make_real (o[Y_AXIS]));
327 ly_scm2offset (SCM s)
329 return Offset (ly_scm2double (ly_car (s)),
330 ly_scm2double (ly_cdr (s)));
334 LY_DEFINE (ly_number2string, "ly:number->string",
336 "Convert @var{num} to a string without generating many decimals.")
338 SCM_ASSERT_TYPE (is_number (s), s, SCM_ARG1, __FUNCTION__, "number");
340 char str[400]; // ugh.
342 if (scm_exact_p (s) == SCM_BOOL_F)
344 Real r (ly_scm2double (s));
346 if (my_isinf (r) || my_isnan (r))
348 programming_error ("Infinity or NaN encountered while converting Real number; setting to zero.");
352 sprintf (str, "%08.4f", r);
355 sprintf (str, "%d", ly_scm2int (s));
357 return scm_makfrom0str (str);
361 Undef this to see if GUILE GC is causing too many swaps.
367 #include <libguile/gc.h>
370 greet_sweep (void *dummy1, void *dummy2, void *dummy3)
372 fprintf (stderr, "entering sweep\n");
376 wave_sweep_goodbye (void *dummy1, void *dummy2, void *dummy3)
378 fprintf (stderr, "leaving sweep\n");
383 LY_DEFINE (ly_version, "ly:version", 0, 0, 0, (),
384 "Return the current lilypond version as a list, e.g. @code{(1 3 127 uu1)}. ")
386 char const* vs = "\'(" MAJOR_VERSION " " MINOR_VERSION " " PATCH_LEVEL " " MY_PATCH_LEVEL ")" ;
388 return scm_c_eval_string ((char*)vs);
391 LY_DEFINE (ly_unit, "ly:unit", 0, 0, 0, (),
392 "Return the unit used for lengths as a string.")
394 return scm_makfrom0str (INTERNAL_UNIT);
399 LY_DEFINE (is_dimension, "ly:dimension?", 1, 0, 0, (SCM d),
400 "Return @var{d} is a number. Used to distinguish length "
401 "variables from normal numbers.")
403 return scm_number_p (d);
410 scm_c_hook_add (&scm_before_mark_c_hook, greet_sweep, 0, 0);
411 scm_c_hook_add (&scm_before_sweep_c_hook, wave_sweep_goodbye, 0, 0);
415 ADD_SCM_INIT_FUNC (funcs, init_functions);
418 ly_deep_copy (SCM src)
421 return scm_cons (ly_deep_copy (ly_car (src)), ly_deep_copy (ly_cdr (src)));
422 else if (is_vector (src))
424 int len = SCM_VECTOR_LENGTH (src);
425 SCM nv = scm_c_make_vector (len, SCM_UNDEFINED);
426 for (int i =0 ; i < len ; i++)
428 SCM si = scm_int2num (i);
429 scm_vector_set_x (nv, si, ly_deep_copy (scm_vector_ref (src, si)));
439 ly_assoc_chain (SCM key, SCM achain)
441 if (is_pair (achain))
443 SCM handle = scm_assoc (key, ly_car (achain));
444 if (is_pair (handle))
447 return ly_assoc_chain (key, ly_cdr (achain));
453 /* looks the key up in the cdrs of the alist-keys
454 - ignoring the car and ignoring non-pair keys.
455 Returns first match found, i.e.
463 I would like (ly_assoc_cdr 1) to return 12 - because it's the first
464 element with the cdr of the key = 1. In other words (alloc_cdr key)
467 (alloc (anything . key))
473 ly_assoc_cdr (SCM key, SCM alist)
477 SCM trykey = ly_caar (alist);
478 if (is_pair (trykey) && to_boolean (scm_equal_p (key, ly_cdr (trykey))))
479 return ly_car (alist);
481 return ly_assoc_cdr (key, ly_cdr (alist));
486 /* LST has the form "sym1 sym2 sym3\nsym4\nsym5"
487 i.e. \n and ' ' can be used interchangeably as separators. */
489 parse_symbol_list (char const *lst)
491 char *s = strdup (lst);
493 SCM create_list = SCM_EOL;
495 char * e = s + strlen (s) - 1;
496 while (e >= s && isspace (*e))
499 for (char * p = s; *p; p++)
508 char *next = strchr (s, ' ');
512 create_list = scm_cons (ly_symbol2scm (s), create_list);
521 ly_truncate_list (int k, SCM lst)
529 for (; is_pair (s) && k--; s = ly_cdr (s))
533 scm_set_cdr_x (s, SCM_EOL);
539 print_scm_val (SCM val)
541 String realval = ly_scm2string (ly_write2scm (val));
542 if (realval.length () > 200)
543 realval = realval.left_string (100)
545 + realval.right_string (100);
550 type_check_assignment (SCM sym, SCM val, SCM type_symbol)
558 TODO: should remove #f from allowed vals?
560 if (val == SCM_EOL || val == SCM_BOOL_F)
563 if (!is_symbol (sym))
568 This is used for autoBeamSettings.
570 TODO: deprecate the use of \override and \revert for
573 or use a symbol autoBeamSettingS?
578 SCM type = scm_object_property (sym, type_symbol);
580 if (type != SCM_EOL && !is_procedure (type))
582 warning (_f ("Can't find property type-check for `%s' (%s).",
583 ly_symbol2string (sym).to_str0 (),
584 ly_symbol2string (type_symbol).to_str0 ())
585 + " " + _ ("Perhaps you made a typing error?"));
587 /* Be strict when being anal :) */
588 if (internal_type_checking_global_b)
591 warning (_ ("Doing assignment anyway."));
596 && is_procedure (type)
597 && scm_call_1 (type, val) == SCM_BOOL_F)
599 SCM errport = scm_current_error_port ();
601 SCM typefunc = ly_scheme_function ("type-name");
602 SCM type_name = scm_call_1 (typefunc, type);
605 scm_puts (_f ("Type check for `%s' failed; value `%s' must be of type `%s'",
606 ly_symbol2string (sym).to_str0 (),
608 ly_scm2string (type_name).to_str0 ()).to_str0 (),
610 scm_puts ("\n", errport);
619 zijn deze nou handig?
620 zijn ze er al in scheme, maar heten ze anders? */
623 /* Remove doubles from (sorted) list */
627 SCM unique = SCM_EOL;
628 for (SCM i = list; is_pair (i); i = ly_cdr (i))
630 if (!is_pair (ly_cdr (i))
631 || !is_equal (ly_car (i), ly_cadr (i)))
632 unique = scm_cons (ly_car (i), unique);
634 return scm_reverse_x (unique, SCM_EOL);
639 scm_default_compare (void const *a, void const *b)
645 return pa < pb ? -1 : 1;
648 /* Modify LST in place: qsort it. */
650 ly_list_qsort_uniq_x (SCM lst)
652 int len = scm_ilength (lst);
653 SCM *arr = new SCM[len];
655 for (SCM s = lst; SCM_NNULLP (s); s = SCM_CDR (s))
656 arr[k++] = SCM_CAR (s);
659 qsort (arr, len, sizeof (SCM), &scm_default_compare);
662 for (int i = 0; i < len; i++)
663 if (!i || arr[i] != arr[i - 1])
665 SCM_SETCAR (*tail, arr[i]);
666 tail = SCM_CDRLOC (*tail);
678 ly_snoc (SCM s, SCM list)
680 return ly_append2 (list, scm_list_n (s, SCM_UNDEFINED));
683 /* Split list at member s, removing s.
684 Return (BEFORE . AFTER) */
686 ly_split_list (SCM s, SCM list)
688 SCM before = SCM_EOL;
690 for (; is_pair (after);)
692 SCM i = ly_car (after);
693 after = ly_cdr (after);
696 before = scm_cons (i, before);
698 return scm_cons ( scm_reverse_x (before, SCM_EOL), after);
712 display stuff without using stack
717 SCM p = scm_current_output_port ();
720 for (; is_pair (s); s =ly_cdr (s))
722 scm_display (ly_car (s), p);
726 return SCM_UNSPECIFIED;
730 int_list_to_slice (SCM l)
734 for (; is_pair (l); l = ly_cdr (l))
735 if (is_number (ly_car (l)))
736 s.add_point (ly_scm2int (ly_car (l)));
740 /* Return I-th element, or last elt L. If I < 0, then we take the first
743 PRE: length (L) > 0 */
745 robust_list_ref (int i, SCM l)
747 while (i-- > 0 && is_pair (ly_cdr (l)))
753 robust_scm2double (SCM k, double x)
756 x = ly_scm2double (k);
761 robust_scm2interval (SCM k, Drul_array<Real> v)
766 if (is_number_pair (k))
767 i = ly_scm2interval (k);
772 robust_scm2drul (SCM k, Drul_array<Real> v)
774 if (is_number_pair (k))
775 v = ly_scm2interval (k);
780 robust_scm2offset (SCM k, Offset o)
782 if (is_number_pair (k))
783 o = ly_scm2offset (k);
788 robust_scm2int (SCM k, int o)
790 if (scm_integer_p (k) == SCM_BOOL_T)
796 alist_to_hashq (SCM alist)
798 int i = scm_ilength (alist);
800 return scm_make_vector (scm_int2num (0), SCM_EOL);
802 SCM tab = scm_make_vector (scm_int2num (i), SCM_EOL);
803 for (SCM s = alist; is_pair (s); s = ly_cdr (s))
805 SCM pt = ly_cdar (s);
806 scm_hashq_set_x (tab, ly_caar (s), pt);
815 LY_DEFINE (ly_protects, "ly:protects", 0, 0, 0, (),
816 "Return hash of protected objects.")