1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
|
/*
This file is part of LilyPond, the GNU music typesetter.
Copyright (C) 2004--2015 Jan Nieuwenhuizen <janneke@gnu.org>
LilyPond is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
LilyPond is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with LilyPond. If not, see <http://www.gnu.org/licenses/>.
*/
#include "prob.hh"
#include "main.hh"
#include "item.hh"
#include "input.hh"
#include "profile.hh"
const char * const Prob::type_p_name_ = "ly: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 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_is_eq (scm_caar (aprop), scm_caar (bprop))
|| (!(unsmob<Input> (aval) && unsmob<Input> (bval))
&& !ly_is_equal (aval, bval)))
return SCM_BOOL_F;
}
/* is one list shorter? */
if (!scm_is_null (aprop) || !scm_is_null (bprop))
return SCM_BOOL_F;
}
return SCM_BOOL_T;
}
Prob::Prob (SCM type, SCM immutable_init) : Smob<Prob> ()
{
mutable_property_alist_ = SCM_EOL;
immutable_property_alist_ = immutable_init;
type_ = type;
smobify_self ();
}
Prob::~Prob ()
{
}
Prob::Prob (Prob const &src)
: Smob<Prob> ()
{
immutable_property_alist_ = src.immutable_property_alist_;
mutable_property_alist_ = 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
that they won't be protected from GC. */
smobify_self ();
mutable_property_alist_ = src.copy_mutable_properties ();
}
SCM
Prob::copy_mutable_properties () const
{
return ly_deep_copy (mutable_property_alist_);
}
void
Prob::derived_mark () const
{
}
SCM
Prob::mark_smob () const
{
ASSERT_LIVE_IS_ALLOWED (self_scm ());
scm_gc_mark (mutable_property_alist_);
derived_mark ();
return immutable_property_alist_;
}
int
Prob::print_smob (SCM port, scm_print_state *) const
{
scm_puts ("#<", port);
scm_puts ("Prob: ", port);
scm_display (type_, port);
scm_puts (" C++: ", port);
scm_puts (class_name (), port);
scm_display (mutable_property_alist_, port);
scm_display (immutable_property_alist_, port);
scm_puts (" >\n", port);
return 1;
}
SCM
Prob::internal_get_property (SCM sym) const
{
#ifdef DEBUG
if (profile_property_accesses)
note_property_access (&prob_property_lookup_table, sym);
#endif
/*
TODO: type checking
*/
SCM s = scm_sloppy_assq (sym, mutable_property_alist_);
if (scm_is_true (s))
return scm_cdr (s);
s = scm_sloppy_assq (sym, immutable_property_alist_);
return scm_is_false (s) ? 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)
{
if (do_internal_type_checking_global)
type_check_assignment (sym, val);
mutable_property_alist_ = scm_assq_set_x (mutable_property_alist_, sym, val);
}
void
Prob::type_check_assignment (SCM, SCM) const
{
/* empty */
}
SCM
Prob::get_property_alist (bool m) const
{
return (m) ? mutable_property_alist_ : immutable_property_alist_;
}
string
Prob::name () const
{
SCM nm = get_property ("name");
if (scm_is_symbol (nm))
return ly_symbol2string (nm);
else
return class_name ();
}
|
