X-Git-Url: https://git.donarmstrong.com/?a=blobdiff_plain;f=lily%2Fprob.cc;h=4d11d193f1b99f6068601131e75833276d15e3c6;hb=7c624620feabb74e0619cfc2d26c1d14834ffa73;hp=c3c95bb760b019529cf32def62ebb2fce179352a;hpb=b37e3f652677ae0298423db9fa0e552e5fce0c92;p=lilypond.git

diff --git a/lily/prob.cc b/lily/prob.cc
index c3c95bb760..4d11d193f1 100644
--- a/lily/prob.cc
+++ b/lily/prob.cc
@@ -3,18 +3,70 @@
 
   source file of the GNU LilyPond music typesetter
 
-  (c) 2004--2006 Jan Nieuwenhuizen <janneke@gnu.org>
+  (c) 2004--2009 Jan Nieuwenhuizen <janneke@gnu.org>
 */
 
 #include "prob.hh"
 #include "main.hh"
 #include "item.hh"
+#include "input.hh"
+#include "profile.hh"
 
 #include "ly-smobs.icc"
 
 IMPLEMENT_SMOBS (Prob);
 IMPLEMENT_TYPE_P (Prob, "ly:prob?");
-IMPLEMENT_DEFAULT_EQUAL_P (Prob);
+
+SCM
+Prob::equal_p (SCM sa, SCM sb)
+{
+  /* This comparison function is only designed to make the copy
+     constructor preserve equality.
+
+     Perhaps it would be better to use a more strict definition of
+     equality; e.g., that that two probs are equal iff they can be
+     distinguished by calls to ly:prob-property.
+  */
+  Prob *probs[2] = {unsmob_prob (sa), unsmob_prob (sb)};
+  SCM props[2][2];
+  int i;
+
+  for (i = 0; i < 2; i++)
+    {
+      props[i][0] = probs[i]->immutable_property_alist_;
+      props[i][1] = probs[i]->mutable_property_alist_;
+    }
+
+  if (strcmp (probs[0]->class_name (), probs[1]->class_name ()))
+    return SCM_BOOL_F;
+
+  /* Compare mutable and immutable lists, element by element. */
+  for (i = 0; i < 2; i++)
+    {
+      SCM aprop = props[0][i];
+      SCM bprop = props[1][i];
+
+      for (;
+	   scm_is_pair (aprop) && scm_is_pair (bprop);
+	   aprop = scm_cdr (aprop), bprop = scm_cdr (bprop))
+	{
+	  SCM aval = scm_cdar (aprop);
+	  SCM bval = scm_cdar (bprop);
+	  if (scm_caar (aprop) != scm_caar (bprop) ||
+	      (
+	       !(unsmob_input (aval) && unsmob_input (bval))
+	       &&		 
+	       !to_boolean (scm_equal_p (aval, bval))))
+	    return SCM_BOOL_F;
+	}
+
+      /* is one list shorter? */
+      if (aprop != SCM_EOL || bprop != SCM_EOL)
+	return SCM_BOOL_F;
+    }
+
+  return SCM_BOOL_T;
+}
 
 Prob::Prob (SCM type, SCM immutable_init)
 {
@@ -25,6 +77,7 @@ Prob::Prob (SCM type, SCM immutable_init)
   smobify_self ();
 }
 
+
 Prob::~Prob ()
 {
 }
@@ -34,6 +87,7 @@ Prob::Prob (Prob const &src)
   immutable_property_alist_ = src.immutable_property_alist_;
   mutable_property_alist_ = SCM_EOL;
   self_scm_ = SCM_EOL;
+  type_ = src.type_;
 
   /* First we smobify_self, then we copy over the stuff.  If we don't,
      stack vars that hold the copy might be optimized away, meaning
@@ -57,6 +111,8 @@ Prob::derived_mark () const
 SCM
 Prob::mark_smob (SCM smob)
 {
+  ASSERT_LIVE_IS_ALLOWED ();
+  
   Prob *system = (Prob *) SCM_CELL_WORD_1 (smob);
   scm_gc_mark (system->mutable_property_alist_);
   system->derived_mark ();
@@ -85,6 +141,11 @@ Prob::print_smob (SCM smob, SCM port, scm_print_state*)
 SCM
 Prob::internal_get_property (SCM sym) const
 {
+#ifndef NDEBUG
+  if (profile_property_accesses)
+    note_property_access (&prob_property_lookup_table, sym);
+#endif
+
   /*
     TODO: type checking
    */
@@ -96,6 +157,13 @@ Prob::internal_get_property (SCM sym) const
   return (s == SCM_BOOL_F) ? SCM_EOL : scm_cdr (s);
 }
 
+/* We don't (yet) instrument probs */
+void
+Prob::instrumented_set_property (SCM sym, SCM val, const char*, int, const char*)
+{
+  internal_set_property (sym, val);
+}
+
 void
 Prob::internal_set_property (SCM sym, SCM val) 
 {
@@ -106,10 +174,9 @@ Prob::internal_set_property (SCM sym, SCM val)
 }
 
 void
-Prob::type_check_assignment (SCM sym, SCM val) const
+Prob::type_check_assignment (SCM, SCM) const
 {
-  (void) sym;
-  (void) val;
+  /* empty */
 }
 
 SCM
@@ -118,7 +185,7 @@ Prob::get_property_alist (bool m) const
   return (m) ? mutable_property_alist_ : immutable_property_alist_;
 }
 
-std::string
+string
 Prob::name () const
 {
   SCM nm = get_property ("name");