Commit | Line | Data |
---|---|---|
1f7d590d MW |
1 | %%% -*-latex-*- |
2 | %%% | |
3 | %%% Conceptual background | |
4 | %%% | |
5 | %%% (c) 2015 Straylight/Edgeware | |
6 | %%% | |
7 | ||
8 | %%%----- Licensing notice --------------------------------------------------- | |
9 | %%% | |
e0808c47 | 10 | %%% This file is part of the Sensible Object Design, an object system for C. |
1f7d590d MW |
11 | %%% |
12 | %%% SOD is free software; you can redistribute it and/or modify | |
13 | %%% it under the terms of the GNU General Public License as published by | |
14 | %%% the Free Software Foundation; either version 2 of the License, or | |
15 | %%% (at your option) any later version. | |
16 | %%% | |
17 | %%% SOD is distributed in the hope that it will be useful, | |
18 | %%% but WITHOUT ANY WARRANTY; without even the implied warranty of | |
19 | %%% MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
20 | %%% GNU General Public License for more details. | |
21 | %%% | |
22 | %%% You should have received a copy of the GNU General Public License | |
23 | %%% along with SOD; if not, write to the Free Software Foundation, | |
24 | %%% Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. | |
25 | ||
3cc520db | 26 | \chapter{Concepts} \label{ch:concepts} |
1f7d590d | 27 | |
3cc520db | 28 | %%%-------------------------------------------------------------------------- |
3cc520db MW |
29 | \section{Modules} \label{sec:concepts.modules} |
30 | ||
31 | A \emph{module} is the top-level syntactic unit of input to the Sod | |
32 | translator. As described above, given an input module, the translator | |
33 | generates C source and header files. | |
34 | ||
35 | A module can \emph{import} other modules. This makes the type names and | |
36 | classes defined in those other modules available to class definitions in the | |
37 | importing module. Sod's module system is intentionally very simple. There | |
38 | are no private declarations or attempts to hide things. | |
39 | ||
40 | As well as importing existing modules, a module can include a number of | |
41 | different kinds of \emph{items}: | |
42 | \begin{itemize} | |
43 | \item \emph{class definitions} describe new classes, possibly in terms of | |
44 | existing classes; | |
45 | \item \emph{type name declarations} introduce new type names to Sod's | |
46 | parser;\footnote{% | |
47 | This is unfortunately necessary because C syntax, upon which Sod's input | |
48 | language is based for obvious reasons, needs to treat type names | |
49 | differently from other kinds of identifiers.} % | |
50 | and | |
51 | \item \emph{code fragments} contain literal C code to be dropped into an | |
52 | appropriate place in an output file. | |
53 | \end{itemize} | |
54 | Each kind of item, and, indeed, a module as a whole, can have a collection of | |
55 | \emph{properties} associated with it. A property has a \emph{name} and a | |
56 | \emph{value}. Properties are an open-ended way of attaching additional | |
57 | information to module items, so extensions can make use of them without | |
58 | having to implement additional syntax. | |
59 | ||
60 | %%%-------------------------------------------------------------------------- | |
61 | \section{Classes, instances, and slots} \label{sec:concepts.classes} | |
62 | ||
63 | For the most part, Sod takes a fairly traditional view of what it means to be | |
64 | an object system. | |
65 | ||
46fe5a33 MW |
66 | An \emph{object} maintains \emph{state} and exhibits \emph{behaviour}. |
67 | (Here, we're using the term `object' in the usual sense of `object-oriented | |
68 | programming', rather than that of the ISO~C standard. Once we have defined | |
69 | an `instance' below, we shall generally prefer that term, so as to prevent | |
70 | further confusion between these two uses of the word.) | |
71 | ||
72 | An object's state is maintained in named \emph{slots}, each of which can | |
73 | store a C value of an appropriate (scalar or aggregate) type. An object's | |
74 | behaviour is stimulated by sending it \emph{messages}. A message has a name, | |
75 | and may carry a number of arguments, which are C values; sending a message | |
76 | may result in the state of receiving object (or other objects) being changed, | |
77 | and a C value being returned to the sender. | |
78 | ||
79 | Every object is a \emph{direct instance} of exactly one \emph{class}. The | |
80 | class determines which slots its instances have, which messages its instances | |
81 | can be sent, and which methods are invoked when those messages are received. | |
82 | The Sod translator's main job is to read class definitions and convert them | |
83 | into appropriate C declarations, tables, and functions. An object cannot | |
3cc520db MW |
84 | (usually) change its direct class, and the direct class of an object is not |
85 | affected by, for example, the static type of a pointer to it. | |
86 | ||
46fe5a33 MW |
87 | If an object~$x$ is a direct instance of some class~$C$, then we say that $C$ |
88 | is \emph{the class of}~$x$. Note that the class of an object is a property | |
89 | of the object's value at runtime, and not of C's compile-time type system. | |
90 | We shall be careful in distinguishing C's compile-time notion of \emph{type} | |
91 | from Sod's run-time notion of \emph{class}. | |
92 | ||
0a2d4b68 | 93 | |
3cc520db MW |
94 | \subsection{Superclasses and inheritance} |
95 | \label{sec:concepts.classes.inherit} | |
96 | ||
97 | \subsubsection{Class relationships} | |
98 | Each class has zero or more \emph{direct superclasses}. | |
99 | ||
100 | A class with no direct superclasses is called a \emph{root class}. The Sod | |
101 | runtime library includes a root class named @|SodObject|; making new root | |
102 | classes is somewhat tricky, and won't be discussed further here. | |
103 | ||
104 | Classes can have more than one direct superclass, i.e., Sod supports | |
105 | \emph{multiple inheritance}. A Sod class definition for a class~$C$ lists | |
106 | the direct superclasses of $C$ in a particular order. This order is called | |
107 | the \emph{local precedence order} of $C$, and the list which consists of $C$ | |
108 | follows by $C$'s direct superclasses in local precedence order is called the | |
109 | $C$'s \emph{local precedence list}. | |
110 | ||
111 | The multiple inheritance in Sod works similarly to multiple inheritance in | |
112 | Lisp-like languages, such as Common Lisp, EuLisp, Dylan, and Python, which is | |
113 | very different from how multiple inheritance works in \Cplusplus.\footnote{% | |
114 | The latter can be summarized as `badly'. By default in \Cplusplus, an | |
115 | instance receives an additional copy of superclass's state for each path | |
116 | through the class graph from the instance's direct class to that | |
117 | superclass, though this behaviour can be overridden by declaring | |
118 | superclasses to be @|virtual|. Also, \Cplusplus\ offers only trivial | |
119 | method combination (\xref{sec:concepts.methods}), leaving programmers to | |
120 | deal with delegation manually and (usually) statically.} % | |
121 | ||
122 | If $C$ is a class, then the \emph{superclasses} of $C$ are | |
123 | \begin{itemize} | |
124 | \item $C$ itself, and | |
125 | \item the superclasses of each of $C$'s direct superclasses. | |
126 | \end{itemize} | |
127 | The \emph{proper superclasses} of a class $C$ are the superclasses of $C$ | |
128 | except for $C$ itself. If a class $B$ is a (direct, proper) superclass of | |
129 | $C$, then $C$ is a \emph{(direct, proper) subclass} of $B$. If $C$ is a root | |
130 | class then the only superclass of $C$ is $C$ itself, and $C$ has no proper | |
131 | superclasses. | |
132 | ||
133 | If an object is a direct instance of class~$C$ then the object is also an | |
46fe5a33 | 134 | (indirect) \emph{instance} of every superclass of $C$. |
3cc520db | 135 | |
054e8f8f | 136 | If $C$ has a proper superclass $B$, then $B$ must not have $C$ as a direct |
e8fd6aea MW |
137 | superclass. In different terms, if we construct a directed graph, whose |
138 | nodes are classes, and draw an arc from each class to each of its direct | |
139 | superclasses, then this graph must be acyclic. In yet other terms, the `is a | |
140 | superclass of' relation is a partial order on classes. | |
3cc520db MW |
141 | |
142 | \subsubsection{The class precedence list} | |
143 | This partial order is not quite sufficient for our purposes. For each class | |
144 | $C$, we shall need to extend it into a total order on $C$'s superclasses. | |
145 | This calculation is called \emph{superclass linearization}, and the result is | |
146 | a \emph{class precedence list}, which lists each of $C$'s superclasses | |
147 | exactly once. If a superclass $B$ precedes (resp.\ follows) some other | |
148 | superclass $A$ in $C$'s class precedence list, then we say that $B$ is a more | |
149 | (resp.\ less) \emph{specific} superclass of $C$ than $A$ is. | |
150 | ||
151 | The superclass linearization algorithm isn't fixed, and extensions to the | |
152 | translator can introduce new linearizations for special effects, but the | |
153 | following properties are expected to hold. | |
154 | \begin{itemize} | |
155 | \item The first class in $C$'s class precedence list is $C$ itself; i.e., | |
156 | $C$ is always its own most specific superclass. | |
157 | \item If $A$ and $B$ are both superclasses of $C$, and $A$ is a proper | |
158 | superclass of $B$ then $A$ appears after $B$ in $C$'s class precedence | |
159 | list, i.e., $B$ is a more specific superclass of $C$ than $A$ is. | |
160 | \end{itemize} | |
161 | The default linearization algorithm used in Sod is the \emph{C3} algorithm, | |
9cd5cf15 | 162 | which has a number of good properties described in~\cite{Barrett:1996:MSL}. |
3cc520db MW |
163 | It works as follows. |
164 | \begin{itemize} | |
165 | \item A \emph{merge} of some number of input lists is a single list | |
166 | containing each item that is in any of the input lists exactly once, and no | |
167 | other items; if an item $x$ appears before an item $y$ in any input list, | |
168 | then $x$ also appears before $y$ in the merge. If a collection of lists | |
169 | have no merge then they are said to be \emph{inconsistent}. | |
170 | \item The class precedence list of a class $C$ is a merge of the local | |
171 | precedence list of $C$ together with the class precedence lists of each of | |
172 | $C$'s direct superclasses. | |
173 | \item If there are no such merges, then the definition of $C$ is invalid. | |
174 | \item Suppose that there are multiple candidate merges. Consider the | |
175 | earliest position in these candidate merges at which they disagree. The | |
176 | \emph{candidate classes} at this position are the classes appearing at this | |
177 | position in the candidate merges. Each candidate class must be a | |
781a8fbd | 178 | superclass of distinct direct superclasses of $C$, since otherwise the |
3cc520db MW |
179 | candidates would be ordered by their common subclass's class precedence |
180 | list. The class precedence list contains, at this position, that candidate | |
181 | class whose subclass appears earliest in $C$'s local precedence order. | |
182 | \end{itemize} | |
183 | ||
4075ab40 MW |
184 | \begin{figure} |
185 | \centering | |
186 | \begin{tikzpicture}[x=7.5mm, y=-14mm, baseline=(current bounding box.east)] | |
187 | \node[lit] at ( 0, 0) (R) {SodObject}; | |
188 | \node[lit] at (-3, +1) (A) {A}; \draw[->] (A) -- (R); | |
189 | \node[lit] at (-1, +1) (B) {B}; \draw[->] (B) -- (R); | |
190 | \node[lit] at (+1, +1) (C) {C}; \draw[->] (C) -- (R); | |
191 | \node[lit] at (+3, +1) (D) {D}; \draw[->] (D) -- (R); | |
192 | \node[lit] at (-2, +2) (E) {E}; \draw[->] (E) -- (A); | |
193 | \draw[->] (E) -- (B); | |
194 | \node[lit] at (+2, +2) (F) {F}; \draw[->] (F) -- (A); | |
195 | \draw[->] (F) -- (D); | |
196 | \node[lit] at (-1, +3) (G) {G}; \draw[->] (G) -- (E); | |
197 | \draw[->] (G) -- (C); | |
198 | \node[lit] at (+1, +3) (H) {H}; \draw[->] (H) -- (F); | |
199 | \node[lit] at ( 0, +4) (I) {I}; \draw[->] (I) -- (G); | |
200 | \draw[->] (I) -- (H); | |
201 | \end{tikzpicture} | |
202 | \quad | |
203 | \vrule | |
204 | \quad | |
205 | \begin{minipage}[c]{0.45\hsize} | |
206 | \begin{nprog} | |
207 | class A: SodObject \{ \}\quad\=@/* @|A|, @|SodObject| */ \\ | |
208 | class B: SodObject \{ \}\>@/* @|B|, @|SodObject| */ \\ | |
209 | class C: SodObject \{ \}\>@/* @|B|, @|SodObject| */ \\ | |
210 | class D: SodObject \{ \}\>@/* @|B|, @|SodObject| */ \\+ | |
211 | class E: A, B \{ \}\quad\=@/* @|E|, @|A|, @|B|, \dots */ \\ | |
212 | class F: A, D \{ \}\>@/* @|F|, @|A|, @|D|, \dots */ \\+ | |
213 | class G: E, C \{ \}\>@/* @|G|, @|E|, @|A|, | |
214 | @|B|, @|C|, \dots */ \\ | |
215 | class H: F \{ \}\>@/* @|H|, @|F|, @|A|, @|D|, \dots */ \\+ | |
216 | class I: G, H \{ \}\>@/* @|I|, @|G|, @|E|, @|H|, @|F|, | |
217 | @|A|, @|B|, @|C|, @|D|, \dots */ | |
218 | \end{nprog} | |
219 | \end{minipage} | |
220 | ||
221 | \caption{An example class graph and class precedence lists} | |
222 | \label{fig:concepts.classes.cpl-example} | |
223 | \end{figure} | |
224 | ||
225 | \begin{example} | |
226 | Consider the class relationships shown in | |
227 | \xref{fig:concepts.classes.cpl-example}. | |
228 | ||
229 | \begin{itemize} | |
230 | ||
231 | \item @|SodObject| has no proper superclasses. Its class precedence list | |
232 | is therefore simply $\langle @|SodObject| \rangle$. | |
233 | ||
234 | \item In general, if $X$ is a direct subclass only of $Y$, and $Y$'s class | |
235 | precedence list is $\langle Y, \ldots \rangle$, then $X$'s class | |
236 | precedence list is $\langle X, Y, \ldots \rangle$. This explains $A$, | |
237 | $B$, $C$, $D$, and $H$. | |
238 | ||
239 | \item $E$'s list is found by merging its local precedence list $\langle E, | |
240 | A, B \rangle$ with the class precedence lists of its direct superclasses, | |
241 | which are $\langle A, @|SodObject| \rangle$ and $\langle B, @|SodObject| | |
242 | \rangle$. Clearly, @|SodObject| must be last, and $E$'s local precedence | |
243 | list orders the rest, giving $\langle E, A, B, @|SodObject|, \rangle$. | |
244 | $F$ is similar. | |
245 | ||
246 | \item We determine $G$'s class precedence list by merging the three lists | |
247 | $\langle G, E, C \rangle$, $\langle E, A, B, @|SodObject| \rangle$, and | |
248 | $\langle C, @|SodObject| \rangle$. The class precedence list begins | |
249 | $\langle G, E, \ldots \rangle$, but the individual lists don't order $A$ | |
250 | and $C$. Comparing these to $G$'s direct superclasses, we see that $A$ | |
54cf3a30 MW |
251 | is a superclass of $E$, while $C$ is a superclass of -- indeed equal to |
252 | -- $C$; so $A$ must precede $C$, as must $B$, and the final list is | |
253 | $\langle G, E, A, B, C, @|SodObject| \rangle$. | |
4075ab40 MW |
254 | |
255 | \item Finally, we determine $I$'s class precedence list by merging $\langle | |
256 | I, G, H \rangle$, $\langle G, E, A, B, C, @|SodObject| \rangle$, and | |
257 | $\langle H, F, A, D, @|SodObject| \rangle$. The list begins $\langle I, | |
258 | G, \ldots \rangle$, and then we must break a tie between $E$ and $H$; but | |
54cf3a30 | 259 | $E$ is a superclass of $G$, so $E$ wins. Next, $H$ and $F$ must precede |
4075ab40 MW |
260 | $A$, since these are ordered by $H$'s class precedence list. Then $B$ |
261 | and $C$ precede $D$, since the former are superclasses of $G$, and the | |
262 | final list is $\langle I, G, E, H, F, A, B, C, D, @|SodObject| \rangle$. | |
263 | ||
264 | \end{itemize} | |
265 | ||
266 | (This example combines elements from \cite{Barrett:1996:MSL} and | |
267 | \cite{Ducournau:1994:PMM}.) | |
268 | \end{example} | |
269 | ||
3cc520db MW |
270 | \subsubsection{Class links and chains} |
271 | The definition for a class $C$ may distinguish one of its proper superclasses | |
272 | as being the \emph{link superclass} for class $C$. Not every class need have | |
273 | a link superclass, and the link superclass of a class $C$, if it exists, need | |
274 | not be a direct superclass of $C$. | |
275 | ||
276 | Superclass links must obey the following rule: if $C$ is a class, then there | |
756e9293 MW |
277 | must be no three distinct superclasses $X$, $Y$ and~$Z$ of $C$ such that $Z$ |
278 | is the link superclass of both $X$ and $Y$. As a consequence of this rule, | |
279 | the superclasses of $C$ can be partitioned into linear \emph{chains}, such | |
280 | that superclasses $A$ and $B$ are in the same chain if and only if one can | |
281 | trace a path from $A$ to $B$ by following superclass links, or \emph{vice | |
282 | versa}. | |
3cc520db MW |
283 | |
284 | Since a class links only to one of its proper superclasses, the classes in a | |
285 | chain are naturally ordered from most- to least-specific. The least specific | |
286 | class in a chain is called the \emph{chain head}; the most specific class is | |
287 | the \emph{chain tail}. Chains are often named after their chain head | |
288 | classes. | |
289 | ||
c6c9615b | 290 | |
3cc520db MW |
291 | \subsection{Names} |
292 | \label{sec:concepts.classes.names} | |
293 | ||
294 | Classes have a number of other attributes: | |
295 | \begin{itemize} | |
296 | \item A \emph{name}, which is a C identifier. Class names must be globally | |
297 | unique. The class name is used in the names of a number of associated | |
298 | definitions, to be described later. | |
299 | \item A \emph{nickname}, which is also a C identifier. Unlike names, | |
300 | nicknames are not required to be globally unique. If $C$ is any class, | |
301 | then all the superclasses of $C$ must have distinct nicknames. | |
302 | \end{itemize} | |
303 | ||
0a2d4b68 | 304 | |
3cc520db MW |
305 | \subsection{Slots} \label{sec:concepts.classes.slots} |
306 | ||
307 | Each class defines a number of \emph{slots}. Much like a structure member, a | |
308 | slot has a \emph{name}, which is a C identifier, and a \emph{type}. Unlike | |
309 | many other object systems, different superclasses of a class $C$ can define | |
310 | slots with the same name without ambiguity, since slot references are always | |
311 | qualified by the defining class's nickname. | |
312 | ||
313 | \subsubsection{Slot initializers} | |
314 | As well as defining slot names and types, a class can also associate an | |
315 | \emph{initial value} with each slot defined by itself or one of its | |
98da9322 | 316 | subclasses. A class $C$ provides an \emph{initialization message} (see |
d24d47f5 | 317 | \xref{sec:concepts.lifecycle.birth}, and \xref{sec:structures.root.sodclass}) |
98da9322 MW |
318 | whose methods set the slots of a \emph{direct} instance of the class to the |
319 | correct initial values. If several of $C$'s superclasses define initializers | |
320 | for the same slot then the initializer from the most specific such class is | |
321 | used. If none of $C$'s superclasses define an initializer for some slot then | |
322 | that slot will be left uninitialized. | |
3cc520db MW |
323 | |
324 | The initializer for a slot with scalar type may be any C expression. The | |
325 | initializer for a slot with aggregate type must contain only constant | |
326 | expressions if the generated code is expected to be processed by a | |
327 | implementation of C89. Initializers will be evaluated once each time an | |
328 | instance is initialized. | |
329 | ||
27ec3825 MW |
330 | Slots are initialized in reverse-precedence order of their defining classes; |
331 | i.e., slots defined by a less specific superclass are initialized earlier | |
332 | than slots defined by a more specific superclass. Slots defined by the same | |
333 | class are initialized in the order in which they appear in the class | |
334 | definition. | |
335 | ||
336 | The initializer for a slot may refer to other slots in the same object, via | |
337 | the @|me| pointer: in an initializer for a slot defined by a class $C$, @|me| | |
338 | has type `pointer to $C$'. (Note that the type of @|me| depends only on the | |
339 | class which defined the slot, not the class which defined the initializer.) | |
340 | ||
997b4d2b MW |
341 | A class can also define \emph{class slot initializers}, which provide values |
342 | for a slot defined by its metaclass; see \xref{sec:concepts.metaclasses} for | |
343 | details. | |
344 | ||
0a2d4b68 | 345 | |
3cc520db MW |
346 | \subsection{C language integration} \label{sec:concepts.classes.c} |
347 | ||
c06ba266 MW |
348 | It is very important to distinguish compile-time C \emph{types} from Sod's |
349 | run-time \emph{classes}: see \xref{sec:concepts.classes}. | |
350 | ||
3cc520db MW |
351 | For each class~$C$, the Sod translator defines a C type, the \emph{class |
352 | type}, with the same name. This is the usual type used when considering an | |
353 | object as an instance of class~$C$. No entire object will normally have a | |
354 | class type,\footnote{% | |
355 | In general, a class type only captures the structure of one of the | |
356 | superclass chains of an instance. A full instance layout contains multiple | |
357 | chains. See \xref{sec:structures.layout} for the full details.} % | |
358 | so access to instances is almost always via pointers. | |
359 | ||
c06ba266 MW |
360 | Usually, a value of type pointer-to-class-type of class~$C$ will point into |
361 | an instance of class $C$. However, clever (or foolish) use of pointer | |
362 | conversions can invalidate this relationship. | |
363 | ||
3cc520db MW |
364 | \subsubsection{Access to slots} |
365 | The class type for a class~$C$ is actually a structure. It contains one | |
366 | member for each class in $C$'s superclass chain, named with that class's | |
367 | nickname. Each of these members is also a structure, containing the | |
368 | corresponding class's slots, one member per slot. There's nothing special | |
369 | about these slot members: C code can access them in the usual way. | |
370 | ||
f2309139 MW |
371 | For example, given the definition |
372 | \begin{prog} | |
373 | [nick = mine] \\ | |
374 | class MyClass: SodObject \{ \\ \ind | |
375 | int x; \-\\ | |
376 | \} | |
377 | \end{prog} | |
378 | the simple function | |
3cc520db | 379 | \begin{prog} |
c18d6aba | 380 | int get_x(MyClass *m) \{ return (m@->mine.x); \} |
3cc520db MW |
381 | \end{prog} |
382 | will extract the value of @|x| from an instance of @|MyClass|. | |
383 | ||
384 | All of this means that there's no such thing as `private' or `protected' | |
385 | slots. If you want to hide implementation details, the best approach is to | |
386 | stash them in a dynamically allocated private structure, and leave a pointer | |
387 | to it in a slot. (This will also help preserve binary compatibility, because | |
388 | the private structure can grow more members as needed. See | |
021d9f84 | 389 | \xref{sec:concepts.compatibility} for more details.) |
3cc520db | 390 | |
4b4aec4e MW |
391 | Slots defined by $C$'s link superclass, or any other superclass in the same |
392 | chain, can be accessed in the same way. Slots defined by other superclasses | |
393 | can't be accessed directly: the instance pointer must be \emph{converted} to | |
394 | point to a different chain. See the subsection `Conversions' below. | |
395 | ||
ff06eeb1 | 396 | |
f4e44f7f MW |
397 | \subsubsection{Sending messages} |
398 | Sod defines a macro for each message. If a class $C$ defines a message $m$, | |
399 | then the macro is called @|$C$_$m$|. The macro takes a pointer to the | |
400 | receiving object as its first argument, followed by the message arguments, if | |
401 | any, and returns the value returned by the object's effective method for the | |
402 | message (if any). If you have a pointer to an instance of any of $C$'s | |
403 | subclasses, then you can send it the message; it doesn't matter whether the | |
404 | subclass is on the same chain. Note that the receiver argument is evaluated | |
405 | twice, so it's not safe to write a receiver expression which has | |
406 | side-effects. | |
407 | ||
408 | For example, suppose we defined | |
409 | \begin{prog} | |
410 | [nick = soupy] \\ | |
411 | class Super: SodObject \{ \\ \ind | |
412 | void msg(const char *m); \-\\ | |
413 | \} \\+ | |
414 | class Sub: Super \{ \\ \ind | |
415 | void soupy.msg(const char *m) | |
416 | \{ printf("sub sent `\%s'@\\n", m); \} \-\\ | |
417 | \} | |
418 | \end{prog} | |
419 | then we can send the message like this: | |
420 | \begin{prog} | |
421 | Sub *sub = /* \dots\ */; \\ | |
422 | Super_msg(sub, "hello"); | |
423 | \end{prog} | |
424 | ||
425 | What happens under the covers is as follows. The structure pointed to by the | |
426 | instance pointer has a member named @|_vt|, which points to a structure | |
427 | called a `virtual table', or \emph{vtable}, which contains various pieces of | |
428 | information about the object's direct class and layout, and holds pointers to | |
429 | method entries for the messages which the object can receive. The | |
430 | message-sending macro in the example above expands to something similar to | |
431 | \begin{prog} | |
432 | sub@->_vt.sub.msg(sub, "Hello"); | |
433 | \end{prog} | |
434 | ||
435 | The vtable contains other useful information, such as a pointer to the | |
436 | instance's direct class's \emph{class object} (described below). The full | |
437 | details of the contents and layout of vtables are given in | |
438 | \xref{sec:structures.layout.vtable}. | |
caa6f4b9 MW |
439 | |
440 | ||
3cc520db MW |
441 | \subsubsection{Class objects} |
442 | In Sod's object system, classes are objects too. Therefore classes are | |
443 | themselves instances; the class of a class is called a \emph{metaclass}. The | |
444 | consequences of this are explored in \xref{sec:concepts.metaclasses}. The | |
445 | \emph{class object} has the same name as the class, suffixed with | |
446 | `@|__class|'\footnote{% | |
447 | This is not quite true. @|$C$__class| is actually a macro. See | |
448 | \xref{sec:structures.layout.additional} for the gory details.} % | |
449 | and its type is usually @|SodClass|; @|SodClass|'s nickname is @|cls|. | |
450 | ||
451 | A class object's slots contain or point to useful information, tables and | |
452 | functions for working with that class's instances. (The @|SodClass| class | |
054e8f8f MW |
453 | doesn't define any messages, so it doesn't have any methods other than for |
454 | the @|SodObject| lifecycle messages @|init| and @|teardown|; see | |
455 | \xref{sec:concepts.lifecycle}. In Sod, a class slot containing a function | |
456 | pointer is not at all the same thing as a method.) | |
3cc520db | 457 | |
3cc520db | 458 | \subsubsection{Conversions} |
e4ea29d8 MW |
459 | Suppose one has a value of type pointer-to-class-type for some class~$C$, and |
460 | wants to convert it to a pointer-to-class-type for some other class~$B$. | |
3cc520db MW |
461 | There are three main cases to distinguish. |
462 | \begin{itemize} | |
463 | \item If $B$ is a superclass of~$C$, in the same chain, then the conversion | |
464 | is an \emph{in-chain upcast}. The conversion can be performed using the | |
465 | appropriate generated upcast macro (see below), or by simply casting the | |
466 | pointer, using C's usual cast operator (or the \Cplusplus\ @|static_cast<>| | |
467 | operator). | |
468 | \item If $B$ is a superclass of~$C$, in a different chain, then the | |
469 | conversion is a \emph{cross-chain upcast}. The conversion is more than a | |
470 | simple type change: the pointer value must be adjusted. If the direct | |
471 | class of the instance in question is not known, the conversion will require | |
472 | a lookup at runtime to find the appropriate offset by which to adjust the | |
473 | pointer. The conversion can be performed using the appropriate generated | |
474 | upcast macro (see below); the general case is handled by the macro | |
58f9b400 | 475 | \descref{SOD_XCHAIN}{mac}. |
e4ea29d8 | 476 | \item If $B$ is a subclass of~$C$ then the conversion is a \emph{downcast}; |
3cc520db MW |
477 | otherwise the conversion is a~\emph{cross-cast}. In either case, the |
478 | conversion can fail: the object in question might not be an instance of~$B$ | |
e4ea29d8 | 479 | after all. The macro \descref{SOD_CONVERT}{mac} and the function |
58f9b400 | 480 | \descref{sod_convert}{fun} perform general conversions. They return a null |
054e8f8f | 481 | pointer if the conversion fails. (These are therefore your analogue to the |
e4ea29d8 | 482 | \Cplusplus\ @|dynamic_cast<>| operator.) |
3cc520db MW |
483 | \end{itemize} |
484 | The Sod translator generates macros for performing both in-chain and | |
485 | cross-chain upcasts. For each class~$C$, and each proper superclass~$B$ | |
486 | of~$C$, a macro is defined: given an argument of type pointer to class type | |
487 | of~$C$, it returns a pointer to the same instance, only with type pointer to | |
488 | class type of~$B$, adjusted as necessary in the case of a cross-chain | |
489 | conversion. The macro is named by concatenating | |
490 | \begin{itemize} | |
491 | \item the name of class~$C$, in upper case, | |
492 | \item the characters `@|__CONV_|', and | |
493 | \item the nickname of class~$B$, in upper case; | |
494 | \end{itemize} | |
495 | e.g., if $C$ is named @|MyClass|, and $B$'s name is @|SuperClass| with | |
496 | nickname @|super|, then the macro @|MYCLASS__CONV_SUPER| converts a | |
497 | @|MyClass~*| to a @|SuperClass~*|. See | |
498 | \xref{sec:structures.layout.additional} for the formal description. | |
499 | ||
500 | %%%-------------------------------------------------------------------------- | |
9e91c8e7 MW |
501 | \section{Keyword arguments} \label{sec:concepts.keywords} |
502 | ||
503 | In standard C, the actual arguments provided to a function are matched up | |
504 | with the formal arguments given in the function definition according to their | |
505 | ordering in a list. Unless the (rather cumbersome) machinery for dealing | |
506 | with variable-length argument tails (@|<stdarg.h>|) is used, exactly the | |
507 | correct number of arguments must be supplied, and in the correct order. | |
508 | ||
509 | A \emph{keyword argument} is matched by its distinctive \emph{name}, rather | |
510 | than by its position in a list. Keyword arguments may be \emph{omitted}, | |
511 | causing some default behaviour by the function. A function can detect | |
512 | whether a particular keyword argument was supplied: so the default behaviour | |
513 | need not be the same as that caused by any specific value of the argument. | |
514 | ||
515 | Keyword arguments can be provided in three ways. | |
516 | \begin{enumerate} | |
517 | \item Directly, as a variable-length argument tail, consisting (for the most | |
518 | part) of alternating keyword names, as pointers to null-terminated strings, | |
519 | and argument values, and terminated by a null pointer. This is somewhat | |
520 | error-prone, and the support library defines some macros which help ensure | |
521 | that keyword argument lists are well formed. | |
522 | \item Indirectly, through a @|va_list| object capturing a variable-length | |
523 | argument tail passed to some other function. Such indirect argument tails | |
524 | have the same structure as the direct argument tails described above. | |
525 | Because @|va_list| objects are hard to copy, the keyword-argument support | |
526 | library consistently passes @|va_list| objects \emph{by reference} | |
527 | throughout its programming interface. | |
528 | \item Indirectly, through a vector of @|struct kwval| objects, each of which | |
529 | contains a keyword name, as a pointer to a null-terminated string, and the | |
530 | \emph{address} of a corresponding argument value. (This indirection is | |
531 | necessary so that the items in the vector can be of uniform size.) | |
532 | Argument vectors are rather inconvenient to use, but are the only practical | |
533 | way in which a caller can decide at runtime which arguments to include in a | |
534 | call, which is useful when writing wrapper functions. | |
535 | \end{enumerate} | |
536 | ||
4f634d20 MW |
537 | Perhaps surprisingly, keyword arguments have a relatively small performance |
538 | impact. On the author's aging laptop, a call to a simple function, passing | |
539 | two out of three keyword arguments, takes about 30 cycles longer than calling | |
540 | a standard function which just takes integer arguments. On the other hand, | |
541 | quite a lot of code is involved in decoding keyword arguments, so code size | |
542 | will naturally suffer. | |
543 | ||
9e91c8e7 | 544 | Keyword arguments are provided as a general feature for C functions. |
43073476 | 545 | However, Sod has special support for messages which accept keyword arguments |
8ec911fa | 546 | (\xref{sec:concepts.methods.keywords}); and they play an essential rôle in |
a142609c | 547 | the instance construction protocol (\xref{sec:concepts.lifecycle.birth}). |
9e91c8e7 MW |
548 | |
549 | %%%-------------------------------------------------------------------------- | |
3cc520db MW |
550 | \section{Messages and methods} \label{sec:concepts.methods} |
551 | ||
552 | Objects can be sent \emph{messages}. A message has a \emph{name}, and | |
553 | carries a number of \emph{arguments}. When an object is sent a message, a | |
554 | function, determined by the receiving object's class, is invoked, passing it | |
555 | the receiver and the message arguments. This function is called the | |
556 | class's \emph{effective method} for the message. The effective method can do | |
557 | anything a C function can do, including reading or updating program state or | |
558 | object slots, sending more messages, calling other functions, issuing system | |
559 | calls, or performing I/O; if it finishes, it may return a value, which is | |
560 | returned in turn to the message sender. | |
561 | ||
562 | The set of messages an object can receive, characterized by their names, | |
563 | argument types, and return type, is determined by the object's class. Each | |
564 | class can define new messages, which can be received by any instance of that | |
565 | class. The messages defined by a single class must have distinct names: | |
566 | there is no `function overloading'. As with slots | |
567 | (\xref{sec:concepts.classes.slots}), messages defined by distinct classes are | |
568 | always distinct, even if they have the same names: references to messages are | |
569 | always qualified by the defining class's name or nickname. | |
570 | ||
571 | Messages may take any number of arguments, of any non-array value type. | |
572 | Since message sends are effectively function calls, arguments of array type | |
573 | are implicitly converted to values of the corresponding pointer type. While | |
574 | message definitions may ascribe an array type to an argument, the formal | |
575 | argument will have pointer type, as is usual for C functions. A message may | |
576 | accept a variable-length argument suffix, denoted @|\dots|. | |
577 | ||
578 | A class definition may include \emph{direct methods} for messages defined by | |
579 | it or any of its superclasses. | |
580 | ||
581 | Like messages, direct methods define argument lists and return types, but | |
8ec911fa | 582 | they may also have a \emph{body}, and a \emph{rôle}. |
3cc520db MW |
583 | |
584 | A direct method need not have the same argument list or return type as its | |
585 | message. The acceptable argument lists and return types for a method depend | |
586 | on the message, in particular its method combination | |
8ec911fa | 587 | (\xref{sec:concepts.methods.combination}), and the method's rôle. |
3cc520db MW |
588 | |
589 | A direct method body is a block of C code, and the Sod translator usually | |
590 | defines, for each direct method, a function with external linkage, whose body | |
591 | contains a copy of the direct method body. Within the body of a direct | |
592 | method defined for a class $C$, the variable @|me|, of type pointer to class | |
593 | type of $C$, refers to the receiving object. | |
594 | ||
0a2d4b68 | 595 | |
3cc520db MW |
596 | \subsection{Effective methods and method combinations} |
597 | \label{sec:concepts.methods.combination} | |
598 | ||
599 | For each message a direct instance of a class might receive, there is a set | |
600 | of \emph{applicable methods}, which are exactly the direct methods defined on | |
601 | the object's class and its superclasses. These direct methods are combined | |
602 | together to form the \emph{effective method} for that particular class and | |
603 | message. Direct methods can be combined into an effective method in | |
604 | different ways, according to the \emph{method combination} specified by the | |
8ec911fa MW |
605 | message. The method combination determines which direct method rôles are |
606 | acceptable, and, for each rôle, the appropriate argument lists and return | |
3cc520db MW |
607 | types. |
608 | ||
609 | One direct method, $M$, is said to be more (resp.\ less) \emph{specific} than | |
610 | another, $N$, with respect to a receiving class~$C$, if the class defining | |
611 | $M$ is a more (resp.\ less) specific superclass of~$C$ than the class | |
612 | defining $N$. | |
613 | ||
43073476 | 614 | \subsubsection{The standard method combination} |
3cc520db MW |
615 | The default method combination is called the \emph{standard method |
616 | combination}; other method combinations are useful occasionally for special | |
8ec911fa | 617 | effects. The standard method combination accepts four direct method rôles, |
9761db0d | 618 | called `primary' (the default), @|before|, @|after|, and @|around|. |
3cc520db MW |
619 | |
620 | All direct methods subject to the standard method combination must have | |
621 | argument lists which \emph{match} the message's argument list: | |
622 | \begin{itemize} | |
623 | \item the method's arguments must have the same types as the message, though | |
624 | the arguments may have different names; and | |
625 | \item if the message accepts a variable-length argument suffix then the | |
626 | direct method must instead have a final argument of type @|va_list|. | |
627 | \end{itemize} | |
b1254eb6 MW |
628 | Primary and @|around| methods must have the same return type as the message; |
629 | @|before| and @|after| methods must return @|void| regardless of the | |
630 | message's return type. | |
3cc520db MW |
631 | |
632 | If there are no applicable primary methods then no effective method is | |
633 | constructed: the vtables contain null pointers in place of pointers to method | |
634 | entry functions. | |
635 | ||
f1aa19a8 | 636 | \begin{figure} |
d82d5db5 | 637 | \hbox to\hsize{\hss\hbox{\begin{tikzpicture} |
a4094071 | 638 | [order/.append style={color=green!70!black}, |
f1aa19a8 MW |
639 | code/.append style={font=\sffamily}, |
640 | action/.append style={font=\itshape}, | |
641 | method/.append style={rectangle, draw=black, thin, fill=blue!30, | |
642 | text height=\ht\strutbox, text depth=\dp\strutbox, | |
643 | minimum width=40mm}] | |
644 | ||
645 | \def\delgstack#1#2#3{ | |
646 | \node (#10) [method, #2] {#3}; | |
647 | \node (#11) [method, above=6mm of #10] {#3}; | |
648 | \draw [->] ($(#10.north)!.5!(#10.north west) + (0mm, 1mm)$) -- | |
649 | ++(0mm, 4mm) | |
650 | node [code, left=4pt, midway] {next_method}; | |
651 | \draw [<-] ($(#10.north)!.5!(#10.north east) + (0mm, 1mm)$) -- | |
652 | ++(0mm, 4mm) | |
653 | node [action, right=4pt, midway] {return}; | |
654 | \draw [->] ($(#11.north)!.5!(#11.north west) + (0mm, 1mm)$) -- | |
655 | ++(0mm, 4mm) | |
656 | node [code, left=4pt, midway] {next_method} | |
657 | node (ld) [above] {$\smash\vdots\mathstrut$}; | |
658 | \draw [<-] ($(#11.north)!.5!(#11.north east) + (0mm, 1mm)$) -- | |
659 | ++(0mm, 4mm) | |
660 | node [action, right=4pt, midway] {return} | |
661 | node (rd) [above] {$\smash\vdots\mathstrut$}; | |
662 | \draw [->] ($(ld.north) + (0mm, 1mm)$) -- ++(0mm, 4mm) | |
663 | node [code, left=4pt, midway] {next_method}; | |
664 | \draw [<-] ($(rd.north) + (0mm, 1mm)$) -- ++(0mm, 4mm) | |
665 | node [action, right=4pt, midway] {return}; | |
666 | \node (p) at ($(ld.north)!.5!(rd.north)$) {}; | |
667 | \node (#1n) [method, above=5mm of p] {#3}; | |
668 | \draw [->, order] ($(#10.south east) + (4mm, 1mm)$) -- | |
669 | ($(#1n.north east) + (4mm, -1mm)$) | |
670 | node [midway, right, align=left] | |
671 | {Most to \\ least \\ specific};} | |
672 | ||
dc20d91f | 673 | \delgstack{a}{}{@|around| method} |
f1aa19a8 MW |
674 | \draw [<-] ($(a0.south)!.5!(a0.south west) - (0mm, 1mm)$) -- |
675 | ++(0mm, -4mm); | |
676 | \draw [->] ($(a0.south)!.5!(a0.south east) - (0mm, 1mm)$) -- | |
677 | ++(0mm, -4mm) | |
678 | node [action, right=4pt, midway] {return}; | |
679 | ||
680 | \draw [->] ($(an.north)!.6!(an.north west) + (0mm, 1mm)$) -- | |
681 | ++(-8mm, 8mm) | |
682 | node [code, midway, left=3mm] {next_method} | |
683 | node (b0) [method, above left = 1mm + 4mm and -6mm - 4mm] {}; | |
684 | \node (b1) [method] at ($(b0) - (2mm, 2mm)$) {}; | |
dc20d91f | 685 | \node (bn) [method] at ($(b1) - (2mm, 2mm)$) {@|before| method}; |
f1aa19a8 MW |
686 | \draw [->, order] ($(bn.west) - (6mm, 0mm)$) -- ++(12mm, 12mm) |
687 | node [midway, above left, align=center] {Most to \\ least \\ specific}; | |
688 | \draw [->] ($(b0.north east) + (-10mm, 1mm)$) -- ++(8mm, 8mm) | |
689 | node (p) {}; | |
690 | ||
691 | \delgstack{m}{above right=1mm and 0mm of an.west |- p}{Primary method} | |
692 | \draw [->] ($(mn.north)!.5!(mn.north west) + (0mm, 1mm)$) -- ++(0mm, 4mm) | |
693 | node [code, left=4pt, midway] {next_method} | |
694 | node [above right = 0mm and -8mm] | |
695 | {$\vcenter{\hbox{\Huge\textcolor{red}{!}}} | |
696 | \vcenter{\hbox{\begin{tabular}[c]{l} | |
697 | \textsf{next_method} \\ | |
698 | pointer is null | |
699 | \end{tabular}}}$}; | |
700 | ||
701 | \draw [->, color=blue, dotted] | |
702 | ($(m0.south)!.2!(m0.south east) - (0mm, 1mm)$) -- | |
703 | ($(an.north)!.2!(an.north east) + (0mm, 1mm)$) | |
704 | node [midway, sloped, below] {Return value}; | |
705 | ||
706 | \draw [<-] ($(an.north)!.6!(an.north east) + (0mm, 1mm)$) -- | |
707 | ++(8mm, 8mm) | |
708 | node [action, midway, right=3mm] {return} | |
709 | node (f0) [method, above right = 1mm and -6mm] {}; | |
710 | \node (f1) [method] at ($(f0) + (-2mm, 2mm)$) {}; | |
dc20d91f | 711 | \node (fn) [method] at ($(f1) + (-2mm, 2mm)$) {@|after| method}; |
f1aa19a8 MW |
712 | \draw [<-, order] ($(f0.east) + (6mm, 0mm)$) -- ++(-12mm, 12mm) |
713 | node [midway, above right, align=center] | |
714 | {Least to \\ most \\ specific}; | |
715 | \draw [<-] ($(fn.north west) + (6mm, 1mm)$) -- ++(-8mm, 8mm); | |
716 | ||
d82d5db5 | 717 | \end{tikzpicture}}\hss} |
f1aa19a8 MW |
718 | |
719 | \caption{The standard method combination} | |
720 | \label{fig:concepts.methods.stdmeth} | |
721 | \end{figure} | |
722 | ||
3cc520db | 723 | The effective method for a message with standard method combination works as |
f1aa19a8 | 724 | follows (see also~\xref{fig:concepts.methods.stdmeth}). |
3cc520db MW |
725 | \begin{enumerate} |
726 | ||
8ec911fa | 727 | \item If any applicable methods have the @|around| rôle, then the most |
3cc520db MW |
728 | specific such method, with respect to the class of the receiving object, is |
729 | invoked. | |
730 | ||
b1254eb6 | 731 | Within the body of an @|around| method, the variable @|next_method| is |
3cc520db MW |
732 | defined, having pointer-to-function type. The method may call this |
733 | function, as described below, any number of times. | |
734 | ||
b1254eb6 MW |
735 | If there any remaining @|around| methods, then @|next_method| invokes the |
736 | next most specific such method, returning whichever value that method | |
dc20d91f MW |
737 | returns; otherwise the behaviour of @|next_method| is to invoke the |
738 | @|before| methods (if any), followed by the most specific primary method, | |
b0563651 | 739 | followed by the @|after| methods (if any), and to return whichever value |
dc20d91f MW |
740 | was returned by the most specific primary method, as described in the |
741 | following items. That is, the behaviour of the least specific @|around| | |
742 | method's @|next_method| function is exactly the behaviour that the | |
743 | effective method would have if there were no @|around| methods. Note that | |
744 | if the least-specific @|around| method calls its @|next_method| more than | |
745 | once then the whole sequence of @|before|, primary, and @|after| methods | |
746 | occurs multiple times. | |
3cc520db | 747 | |
b1254eb6 MW |
748 | The value returned by the most specific @|around| method is the value |
749 | returned by the effective method. | |
3cc520db | 750 | |
8ec911fa | 751 | \item If any applicable methods have the @|before| rôle, then they are all |
3cc520db MW |
752 | invoked, starting with the most specific. |
753 | ||
754 | \item The most specific applicable primary method is invoked. | |
755 | ||
756 | Within the body of a primary method, the variable @|next_method| is | |
757 | defined, having pointer-to-function type. If there are no remaining less | |
758 | specific primary methods, then @|next_method| is a null pointer. | |
759 | Otherwise, the method may call the @|next_method| function any number of | |
760 | times. | |
761 | ||
762 | The behaviour of the @|next_method| function, if it is not null, is to | |
763 | invoke the next most specific applicable primary method, and to return | |
764 | whichever value that method returns. | |
765 | ||
b1254eb6 MW |
766 | If there are no applicable @|around| methods, then the value returned by |
767 | the most specific primary method is the value returned by the effective | |
768 | method; otherwise the value returned by the most specific primary method is | |
769 | returned to the least specific @|around| method, which called it via its | |
770 | own @|next_method| function. | |
3cc520db | 771 | |
8ec911fa | 772 | \item If any applicable methods have the @|after| rôle, then they are all |
3cc520db | 773 | invoked, starting with the \emph{least} specific. (Hence, the most |
b1254eb6 | 774 | specific @|after| method is invoked with the most `afterness'.) |
3cc520db MW |
775 | |
776 | \end{enumerate} | |
777 | ||
b1254eb6 MW |
778 | A typical use for @|around| methods is to allow a base class to set up the |
779 | dynamic environment appropriately for the primary methods of its subclasses, | |
756e9293 | 780 | e.g., by claiming a lock, and releasing it afterwards. |
3cc520db | 781 | |
9761db0d | 782 | The @|next_method| function provided to methods with the primary and |
8ec911fa | 783 | @|around| rôles accepts the same arguments, and returns the same type, as the |
3cc520db MW |
784 | message, except that one or two additional arguments are inserted at the |
785 | front of the argument list. The first additional argument is always the | |
786 | receiving object, @|me|. If the message accepts a variable argument suffix, | |
787 | then the second addition argument is a @|va_list|; otherwise there is no | |
788 | second additional argument; otherwise, In the former case, a variable | |
789 | @|sod__master_ap| of type @|va_list| is defined, containing a separate copy | |
790 | of the argument pointer (so the method body can process the variable argument | |
791 | suffix itself, and still pass a fresh copy on to the next method). | |
792 | ||
8ec911fa | 793 | A method with the primary or @|around| rôle may use the convenience macro |
3cc520db MW |
794 | @|CALL_NEXT_METHOD|, which takes no arguments itself, and simply calls |
795 | @|next_method| with appropriate arguments: the receiver @|me| pointer, the | |
796 | argument pointer @|sod__master_ap| (if applicable), and the method's | |
797 | arguments. If the method body has overwritten its formal arguments, then | |
798 | @|CALL_NEXT_METHOD| will pass along the updated values, rather than the | |
799 | original ones. | |
800 | ||
781a8fbd MW |
801 | A primary or @|around| method which invokes its @|next_method| function is |
802 | said to \emph{extend} the message behaviour; a method which does not invoke | |
803 | its @|next_method| is said to \emph{override} the behaviour. Note that a | |
804 | method may make a decision to override or extend at runtime. | |
805 | ||
43073476 | 806 | \subsubsection{Aggregating method combinations} |
3cc520db MW |
807 | A number of other method combinations are provided. They are called |
808 | `aggregating' method combinations because, instead of invoking just the most | |
809 | specific primary method, as the standard method combination does, they invoke | |
810 | the applicable primary methods in turn and aggregate the return values from | |
811 | each. | |
812 | ||
8ec911fa | 813 | The aggregating method combinations accept the same four rôles as the |
b1254eb6 MW |
814 | standard method combination, and @|around|, @|before|, and @|after| methods |
815 | work in the same way. | |
3cc520db MW |
816 | |
817 | The aggregating method combinations provided are as follows. | |
818 | \begin{description} \let\makelabel\code | |
819 | \item[progn] The message must return @|void|. The applicable primary methods | |
820 | are simply invoked in turn, most specific first. | |
821 | \item[sum] The message must return a numeric type.\footnote{% | |
822 | The Sod translator does not check this, since it doesn't have enough | |
823 | insight into @|typedef| names.} % | |
824 | The applicable primary methods are invoked in turn, and their return values | |
825 | added up. The final result is the sum of the individual values. | |
826 | \item[product] The message must return a numeric type. The applicable | |
827 | primary methods are invoked in turn, and their return values multiplied | |
828 | together. The final result is the product of the individual values. | |
829 | \item[min] The message must return a scalar type. The applicable primary | |
830 | methods are invoked in turn. The final result is the smallest of the | |
831 | individual values. | |
832 | \item[max] The message must return a scalar type. The applicable primary | |
833 | methods are invoked in turn. The final result is the largest of the | |
834 | individual values. | |
665a0455 MW |
835 | \item[and] The message must return a scalar type. The applicable primary |
836 | methods are invoked in turn. If any method returns zero then the final | |
837 | result is zero and no further methods are invoked. If all of the | |
838 | applicable primary methods return nonzero, then the final result is the | |
839 | result of the last primary method. | |
840 | \item[or] The message must return a scalar type. The applicable primary | |
841 | methods are invoked in turn. If any method returns nonzero then the final | |
842 | result is that nonzero value and no further methods are invoked. If all of | |
843 | the applicable primary methods return zero, then the final result is zero. | |
3cc520db MW |
844 | \end{description} |
845 | ||
846 | There is also a @|custom| aggregating method combination, which is described | |
847 | in \xref{sec:fixme.custom-aggregating-method-combination}. | |
848 | ||
43073476 | 849 | |
f4e44f7f | 850 | \subsection{Method entries} \label{sec:concepts.methods.entry} |
caa6f4b9 | 851 | |
caa6f4b9 MW |
852 | The effective methods for each class are determined at translation time, by |
853 | the Sod translator. For each effective method, one or more \emph{method | |
854 | entry functions} are constructed. A method entry function has three | |
855 | responsibilities. | |
856 | \begin{itemize} | |
857 | \item It converts the receiver pointer to the correct type. Method entry | |
858 | functions can perform these conversions extremely efficiently: there are | |
859 | separate method entries for each chain of each class which can receive a | |
860 | message, so method entry functions are in the privileged situation of | |
861 | knowing the \emph{exact} class of the receiving object. | |
862 | \item If the message accepts a variable-length argument tail, then two method | |
863 | entry functions are created for each chain of each class: one receives a | |
864 | variable-length argument tail, as intended, and captures it in a @|va_list| | |
865 | object; the other accepts an argument of type @|va_list| in place of the | |
866 | variable-length tail and arranges for it to be passed along to the direct | |
867 | methods. | |
868 | \item It invokes the effective method with the appropriate arguments. There | |
869 | might or might not be an actual function corresponding to the effective | |
870 | method itself: the translator may instead open-code the effective method's | |
871 | behaviour into each method entry function; and the machinery for handling | |
872 | `delegation chains', such as is used for @|around| methods and primary | |
873 | methods in the standard method combination, is necessarily scattered among | |
874 | a number of small functions. | |
875 | \end{itemize} | |
876 | ||
877 | ||
43073476 MW |
878 | \subsection{Messages with keyword arguments} |
879 | \label{sec:concepts.methods.keywords} | |
880 | ||
881 | A message or a direct method may declare that it accepts keyword arguments. | |
882 | A message which accepts keyword arguments is called a \emph{keyword message}; | |
883 | a direct method which accepts keyword arguments is called a \emph{keyword | |
884 | method}. | |
885 | ||
886 | While method combinations may set their own rules, usually keyword methods | |
887 | can only be defined on keyword messages, and all methods defined on a keyword | |
888 | message must be keyword methods. The direct methods defined on a keyword | |
889 | message may differ in the keywords they accept, both from each other, and | |
bf2e7452 MW |
890 | from the message. If two applicable methods on the same message both accept |
891 | a keyword argument with the same name, then these two keyword arguments must | |
892 | also have the same type. Different applicable methods may declare keyword | |
893 | arguments with the same name but different defaults; see below. | |
43073476 MW |
894 | |
895 | The keyword arguments acceptable in a message sent to an object are the | |
896 | keywords listed in the message definition, together with all of the keywords | |
897 | accepted by any applicable method. There is no easy way to determine at | |
898 | runtime whether a particular keyword is acceptable in a message to a given | |
899 | instance. | |
900 | ||
901 | At runtime, a direct method which accepts one or more keyword arguments | |
902 | receives an additional argument named @|suppliedp|. This argument is a small | |
903 | structure. For each keyword argument named $k$ accepted by the direct | |
904 | method, @|suppliedp| contains a one-bit-wide bitfield member of type | |
905 | @|unsigned|, also named $k$. If a keyword argument named $k$ was passed in | |
906 | the message, then @|suppliedp.$k$| is one, and $k$ contains the argument | |
907 | value; otherwise @|suppliedp.$k$| is zero, and $k$ contains the default value | |
908 | from the direct method definition if there was one, or an unspecified value | |
909 | otherwise. | |
910 | ||
3cc520db | 911 | %%%-------------------------------------------------------------------------- |
d24d47f5 MW |
912 | \section{The object lifecycle} \label{sec:concepts.lifecycle} |
913 | ||
914 | \subsection{Creation} \label{sec:concepts.lifecycle.birth} | |
915 | ||
916 | Construction of a new instance of a class involves three steps. | |
917 | \begin{enumerate} | |
918 | \item \emph{Allocation} arranges for there to be storage space for the | |
919 | instance's slots and associated metadata. | |
920 | \item \emph{Imprinting} fills in the instance's metadata, associating the | |
921 | instance with its class. | |
922 | \item \emph{Initialization} stores appropriate initial values in the | |
923 | instance's slots, and maybe links it into any external data structures as | |
924 | necessary. | |
925 | \end{enumerate} | |
926 | The \descref{SOD_DECL}[macro]{mac} handles constructing instances with | |
a42893dd MW |
927 | automatic storage duration (`on the stack'). Similarly, the |
928 | \descref{SOD_MAKE}[macro]{mac} and the \descref{sod_make}{fun} and | |
929 | \descref{sod_makev}{fun} functions construct instances allocated from the | |
930 | standard @|malloc| heap. Programmers can add support for other allocation | |
931 | strategies by using the \descref{SOD_INIT}[macro]{mac} and the | |
932 | \descref{sod_init}{fun} and \descref{sod_initv}{fun} functions, which package | |
933 | up imprinting and initialization. | |
d24d47f5 MW |
934 | |
935 | \subsubsection{Allocation} | |
936 | Instances of most classes (specifically including those classes defined by | |
937 | Sod itself) can be held in any storage of sufficient size. The in-memory | |
938 | layout of an instance of some class~$C$ is described by the type @|struct | |
939 | $C$__ilayout|, and if the relevant class is known at compile time then the | |
940 | best way to discover the layout size is with the @|sizeof| operator. Failing | |
941 | that, the size required to hold an instance of $C$ is available in a slot in | |
942 | $C$'s class object, as @|$C$__class@->cls.initsz|. | |
943 | ||
944 | It is not in general sufficient to declare, or otherwise allocate, an object | |
945 | of the class type $C$. The class type only describes a single chain of the | |
946 | object's layout. It is nearly always an error to use the class type as if it | |
947 | is a \emph{complete type}, e.g., to declare objects or arrays of the class | |
948 | type, or to enquire about its size or alignment requirements. | |
949 | ||
950 | Instance layouts may be declared as objects with automatic storage duration | |
951 | (colloquially, `allocated on the stack') or allocated dynamically, e.g., | |
952 | using @|malloc|. They may be included as members of structures or unions, or | |
953 | elements of arrays. Sod's runtime system doesn't retain addresses of | |
954 | instances, so, for example, Sod doesn't make using fancy allocators which | |
955 | sometimes move objects around in memory any more difficult than it needs to | |
956 | be. | |
957 | ||
958 | There isn't any way to discover the alignment required for a particular | |
959 | class's instances at runtime; it's best to be conservative and assume that | |
960 | the platform's strictest alignment requirement applies. | |
961 | ||
962 | The following simple function correctly allocates and returns space for an | |
963 | instance of a class given a pointer to its class object @<cls>. | |
964 | \begin{prog} | |
020b9e2b | 965 | void *allocate_instance(const SodClass *cls) \\ \ind |
d24d47f5 MW |
966 | \{ return malloc(cls@->cls.initsz); \} |
967 | \end{prog} | |
968 | ||
969 | \subsubsection{Imprinting} | |
970 | Once storage has been allocated, it must be \emph{imprinted} before it can be | |
971 | used as an instance of a class, e.g., before any messages can be sent to it. | |
972 | ||
973 | Imprinting an instance stores some metadata about its direct class in the | |
974 | instance structure, so that the rest of the program (and Sod's runtime | |
975 | library) can tell what sort of object it is, and how to use it.\footnote{% | |
976 | Specifically, imprinting an instance's storage involves storing the | |
977 | appropriate vtable pointers in the right places in it.} % | |
978 | A class object's @|imprint| slot points to a function which will correctly | |
979 | imprint storage for one of that class's instances. | |
980 | ||
981 | Once an instance's storage has been imprinted, it is technically possible to | |
982 | send messages to the instance; however the instance's slots are still | |
756e9293 MW |
983 | uninitialized at this point, so the applicable methods are unlikely to do |
984 | much of any use unless they've been written specifically for the purpose. | |
d24d47f5 MW |
985 | |
986 | The following simple function imprints storage at address @<p> as an instance | |
987 | of a class, given a pointer to its class object @<cls>. | |
988 | \begin{prog} | |
020b9e2b | 989 | void imprint_instance(const SodClass *cls, void *p) \\ \ind |
d24d47f5 MW |
990 | \{ cls@->cls.imprint(p); \} |
991 | \end{prog} | |
992 | ||
993 | \subsubsection{Initialization} | |
994 | The final step for constructing a new instance is to \emph{initialize} it, to | |
995 | establish the necessary invariants for the instance itself and the | |
996 | environment in which it operates. | |
997 | ||
998 | Details of initialization are necessarily class-specific, but typically it | |
999 | involves setting the instance's slots to appropriate values, and possibly | |
d1b394fa MW |
1000 | linking it into some larger data structure to keep track of it. It is |
1001 | possible for initialization methods to attempt to allocate resources, but | |
1002 | this must be done carefully: there is currently no way to report an error | |
1003 | from object initialization, so the object must be marked as incompletely | |
1004 | initialized, and left in a state where it will be safe to tear down later. | |
d24d47f5 | 1005 | |
a142609c MW |
1006 | Initialization is performed by sending the imprinted instance an @|init| |
1007 | message, defined by the @|SodObject| class. This message uses a nonstandard | |
1008 | method combination which works like the standard combination, except that the | |
1009 | \emph{default behaviour}, if there is no overriding method, is to initialize | |
b2983f35 MW |
1010 | the instance's slots, as described below, and to invoke each superclass's |
1011 | initialization fragments. This default behaviour may be invoked multiple | |
1012 | times if some method calls on its @|next_method| more than once, unless some | |
1013 | other method takes steps to prevent this. | |
a142609c | 1014 | |
27ec3825 MW |
1015 | Slots are initialized in a well-defined order. |
1016 | \begin{itemize} | |
054e8f8f MW |
1017 | \item Slots defined by a more specific superclass are initialized after slots |
1018 | defined by a less specific superclass. | |
27ec3825 MW |
1019 | \item Slots defined by the same class are initialized in the order in which |
1020 | their definitions appear. | |
1021 | \end{itemize} | |
1022 | ||
a42893dd MW |
1023 | A class can define \emph{initialization fragments}: pieces of literal code to |
1024 | be executed to set up a new instance. Each superclass's initialization | |
1025 | fragments are executed with @|me| bound to an instance pointer of the | |
1026 | appropriate superclass type, immediately after that superclass's slots (if | |
1027 | any) have been initialized; therefore, fragments defined by a more specific | |
13cb243a | 1028 | superclass are executed after fragments defined by a less specific |
a42893dd MW |
1029 | superclass. A class may define more than one initialization fragment: the |
1030 | fragments are executed in the order in which they appear in the class | |
1031 | definition. It is possible for an initialization fragment to use @|return| | |
1032 | or @|goto| for special control-flow effects, but this is not likely to be a | |
1033 | good idea. | |
1034 | ||
b2983f35 MW |
1035 | The @|init| message accepts keyword arguments |
1036 | (\xref{sec:concepts.methods.keywords}). The set of acceptable keywords is | |
1037 | determined by the applicable methods as usual, but also by the | |
1038 | \emph{initargs} defined by the receiving instance's class and its | |
1039 | superclasses, which are made available to slot initializers and | |
1040 | initialization fragments. | |
1041 | ||
1042 | There are two kinds of initarg definitions. \emph{User initargs} are defined | |
1043 | by an explicit @|initarg| item appearing in a class definition: the item | |
1044 | defines a name, type, and (optionally) a default value for the initarg. | |
1045 | \emph{Slot initargs} are defined by attaching an @|initarg| property to a | |
756e9293 MW |
1046 | slot or slot initializer item: the property's value determines the initarg's |
1047 | name, while the type is taken from the underlying slot type; slot initargs do | |
1048 | not have default values. Both kinds define a \emph{direct initarg} for the | |
b2983f35 MW |
1049 | containing class. |
1050 | ||
1051 | Initargs are inherited. The \emph{applicable} direct initargs for an @|init| | |
1052 | effective method are those defined by the receiving object's class, and all | |
1053 | of its superclasses. Applicable direct initargs with the same name are | |
1054 | merged to form \emph{effective initargs}. An error is reported if two | |
1055 | applicable direct initargs have the same name but different types. The | |
1056 | default value of an effective initarg is taken from the most specific | |
1057 | applicable direct initarg which specifies a defalt value; if no applicable | |
1058 | direct initarg specifies a default value then the effective initarg has no | |
1059 | default. | |
1060 | ||
1061 | All initarg values are made available at runtime to user code -- | |
1062 | initialization fragments and slot initializer expressions -- through local | |
1063 | variables and a @|suppliedp| structure, as in a direct method | |
1064 | (\xref{sec:concepts.methods.keywords}). Furthermore, slot initarg | |
1065 | definitions influence the initialization of slots. | |
1066 | ||
1067 | The process for deciding how to initialize a particular slot works as | |
1068 | follows. | |
1069 | \begin{enumerate} | |
1070 | \item If there are any slot initargs defined on the slot, or any of its slot | |
1071 | initializers, \emph{and} the sender supplied a value for one or more of the | |
1072 | corresponding effective initargs, then the value of the most specific slot | |
1073 | initarg is stored in the slot. | |
1074 | \item Otherwise, if there are any slot initializers defined which include an | |
1075 | initializer expression, then the initializer expression from the most | |
1076 | specific such slot initializer is evaluated and its value stored in the | |
1077 | slot. | |
1078 | \item Otherwise, the slot is left uninitialized. | |
1079 | \end{enumerate} | |
1080 | Note that the default values (if any) of effective initargs do \emph{not} | |
1081 | affect this procedure. | |
d24d47f5 | 1082 | |
d24d47f5 MW |
1083 | |
1084 | \subsection{Destruction} | |
1085 | \label{sec:concepts.lifecycle.death} | |
1086 | ||
1087 | Destruction of an instance, when it is no longer required, consists of two | |
1088 | steps. | |
1089 | \begin{enumerate} | |
1090 | \item \emph{Teardown} releases any resources held by the instance and | |
1091 | disentangles it from any external data structures. | |
1092 | \item \emph{Deallocation} releases the memory used to store the instance so | |
1093 | that it can be reused. | |
1094 | \end{enumerate} | |
a42893dd MW |
1095 | Teardown alone, for objects which require special deallocation, or for which |
1096 | deallocation occurs automatically (e.g., instances with automatic storage | |
1097 | duration, or instances whose storage will be garbage-collected), is performed | |
1098 | using the \descref{sod_teardown}[function]{fun}. Destruction of instances | |
1099 | allocated from the standard @|malloc| heap is done using the | |
1100 | \descref{sod_destroy}[function]{fun}. | |
d24d47f5 MW |
1101 | |
1102 | \subsubsection{Teardown} | |
7646dc4c MW |
1103 | Details of teardown are necessarily class-specific, but typically it |
1104 | involves releasing resources held by the instance, and disentangling it from | |
1105 | any data structures it might be linked into. | |
a42893dd MW |
1106 | |
1107 | Teardown is performed by sending the instance the @|teardown| message, | |
1108 | defined by the @|SodObject| class. The message returns an integer, used as a | |
1109 | boolean flag. If the message returns zero, then the instance's storage | |
1110 | should be deallocated. If the message returns nonzero, then it is safe for | |
1111 | the caller to forget about instance, but should not deallocate its storage. | |
1112 | This is \emph{not} an error return: if some teardown method fails then the | |
1113 | program may be in an inconsistent state and should not continue. | |
d24d47f5 | 1114 | |
a42893dd MW |
1115 | This simple protocol can be used, for example, to implement a reference |
1116 | counting system, as follows. | |
d24d47f5 | 1117 | \begin{prog} |
020b9e2b | 1118 | [nick = ref] \\ |
d7451ac3 | 1119 | class ReferenceCountedObject: SodObject \{ \\ \ind |
020b9e2b MW |
1120 | unsigned nref = 1; \\- |
1121 | void inc() \{ me@->ref.nref++; \} \\- | |
1122 | [role = around] \\ | |
1123 | int obj.teardown() \\ | |
1124 | \{ \\ \ind | |
1125 | if (--\,--me@->ref.nref) return (1); \\ | |
1126 | else return (CALL_NEXT_METHOD); \-\\ | |
1127 | \} \-\\ | |
d24d47f5 MW |
1128 | \} |
1129 | \end{prog} | |
1130 | ||
fa7e2d72 MW |
1131 | The @|teardown| message uses a nonstandard method combination which works |
1132 | like the standard combination, except that the \emph{default behaviour}, if | |
1133 | there is no overriding method, is to execute the superclass's teardown | |
1134 | fragments, and to return zero. This default behaviour may be invoked | |
1135 | multiple times if some method calls on its @|next_method| more than once, | |
1136 | unless some other method takes steps to prevent this. | |
a42893dd MW |
1137 | |
1138 | A class can define \emph{teardown fragments}: pieces of literal code to be | |
1139 | executed to shut down an instance. Each superclass's teardown fragments are | |
1140 | executed with @|me| bound to an instance pointer of the appropriate | |
1141 | superclass type; fragments defined by a more specific superclass are executed | |
13cb243a | 1142 | before fragments defined by a less specific superclass. A class may define |
a42893dd MW |
1143 | more than one teardown fragment: the fragments are executed in the order in |
1144 | which they appear in the class definition. It is possible for an | |
1145 | initialization fragment to use @|return| or @|goto| for special control-flow | |
1146 | effects, but this is not likely to be a good idea. Similarly, it's probably | |
1147 | a better idea to use an @|around| method to influence the return value than | |
1148 | to write an explicit @|return| statement in a teardown fragment. | |
1149 | ||
d24d47f5 MW |
1150 | \subsubsection{Deallocation} |
1151 | The details of instance deallocation are obviously specific to the allocation | |
1152 | strategy used by the instance, and this is often orthogonal from the object's | |
1153 | class. | |
1154 | ||
1155 | The code which makes the decision to destroy an object may often not be aware | |
1156 | of the object's direct class. Low-level details of deallocation often | |
1157 | require the proper base address of the instance's storage, which can be | |
1158 | determined using the \descref{SOD_INSTBASE}[macro]{mac}. | |
1159 | ||
d24d47f5 | 1160 | %%%-------------------------------------------------------------------------- |
3cc520db | 1161 | \section{Metaclasses} \label{sec:concepts.metaclasses} |
1f7d590d | 1162 | |
71efc524 MW |
1163 | In Sod, every object is an instance of some class, and -- unlike, say, |
1164 | \Cplusplus\ -- classes are proper objects. It follows that, in Sod, every | |
1165 | class~$C$ is itself an instance of some class~$M$, which is called $C$'s | |
1166 | \emph{metaclass}. Metaclass instances are usually constructed statically, at | |
1167 | compile time, and marked read-only. | |
1168 | ||
1169 | As an added complication, Sod classes, and other metaobjects such as | |
1170 | messages, methods, slots and so on, also have classes \emph{at translation | |
1171 | time}. These translation-time metaclasses are not Sod classes; they are CLOS | |
1172 | classes, implemented in Common Lisp. | |
1173 | ||
1174 | ||
1175 | \subsection{Runtime metaclasses} | |
1176 | \label{sec:concepts.metaclasses.runtime} | |
1177 | ||
1178 | Like other classes, metaclasses can declare messages, and define slots and | |
1179 | methods. Slots defined by the metaclass are called \emph{class slots}, as | |
1180 | opposed to \emph{instance slots}. Similarly, messages and methods defined by | |
1181 | the metaclass are termed \emph{class messages} and \emph{class methods} | |
1182 | respectively, though these are used much less frequently. | |
1183 | ||
1184 | \subsubsection{The braid} | |
1185 | Every object is an instance of some class. There are only finitely many | |
1186 | classes. | |
1187 | ||
1188 | \begin{figure} | |
1189 | \centering | |
1190 | \begin{tikzpicture} | |
1191 | \node[lit] (obj) {SodObject}; | |
1192 | \node[lit] (cls) [right=10mm of obj] {SodClass}; | |
1193 | \draw [->, dashed] (obj) to[bend right] (cls); | |
1194 | \draw [->] (cls) to[bend right] (obj); | |
1195 | \draw [->, dashed] (cls) to[loop right] (cls); | |
1196 | \end{tikzpicture} | |
1197 | \qquad | |
1198 | \fbox{\ \begin{tikzpicture} | |
1199 | \node (subclass) {subclass of}; | |
1200 | \node (instance) [below=\jot of subclass] {instance of}; | |
1201 | \draw [->] ($(subclass.west) - (10mm, 0)$) -- ++(8mm, 0); | |
1202 | \draw [->, dashed] ($(instance.west) - (10mm, 0)$) -- ++(8mm, 0); | |
1203 | \end{tikzpicture}} | |
1204 | \caption{The Sod braid} \label{fig:concepts.metaclasses.braid} | |
1205 | \end{figure} | |
1206 | ||
1207 | Consider the directed graph whose nodes are classes, and where there is an | |
1208 | arc from $C$ to $D$ if and only if $C$ is an instance of $D$. There are only | |
1209 | finitely many nodes. Every node has an arc leaving it, because every object | |
1210 | -- and hence every class -- is an instance of some class. Therefore this | |
1211 | graph must contain at least one cycle. | |
1212 | ||
1213 | In Sod, this situation is resolved in the simplest manner possible: | |
1214 | @|SodClass| is the only predefined metaclass, and it is an instance of | |
1215 | itself. The only other predefined class is @|SodObject|, which is also an | |
1216 | instance of @|SodClass|. There is exactly one root class, namely | |
1217 | @|SodObject|; consequently, @|SodClass| is a direct subclass of @|SodObject|. | |
1218 | ||
1219 | \Xref{fig:concepts.metaclasses.braid} shows a diagram of this situation. | |
1220 | ||
1221 | \subsubsection{Class slots and initializers} | |
1222 | Instance initializers were described in \xref{sec:concepts.classes.slots}. A | |
1223 | class can also define \emph{class initializers}, which provide values for | |
1224 | slots defined by its metaclass. The initial value for a class slot is | |
1225 | determined as follows. | |
1226 | \begin{itemize} | |
1227 | \item Nonstandard slot classes may be initialized by custom Lisp code. For | |
1228 | example, all of the slots defined by @|SodClass| are of this kind. User | |
1229 | initializers are not permitted for such slots. | |
1230 | \item If the class or any of its superclasses defines a class initializer for | |
1231 | the slot, then the class initializer defined by the most specific such | |
1232 | superclass is used. | |
1233 | \item Otherwise, if the metaclass or one of its superclasses defines an | |
1234 | instance initializer, then the instance initializer defined by he most | |
1235 | specific such class is used. | |
1236 | \item Otherwise there is no initializer, and an error will be reported. | |
1237 | \end{itemize} | |
1238 | Initializers for class slots must be constant expressions (for scalar slots) | |
1239 | or aggregate initializers containing constant expressions. | |
1240 | ||
1241 | \subsubsection{Metaclass selection and consistency} | |
1242 | Sod enforces a \emph{metaclass consistency rule}: if $C$ has metaclass $M$, | |
1243 | then any subclass $C$ must have a metaclass which is a subclass of $M$. | |
1244 | ||
1245 | The definition of a new class can name the new class's metaclass explicitly, | |
1246 | by defining a @|metaclass| property; the Sod translator will verify that the | |
1247 | choice of metaclass is acceptable. | |
1248 | ||
1249 | If no @|metaclass| property is given, then the translator will select a | |
1250 | default metaclass as follows. Let $C_1$, $C_2$, \dots, $C_n$ be the direct | |
1251 | superclasses of the new class, and let $M_1$, $M_2$, \dots, $M_n$ be their | |
1252 | respective metaclasses (not necessarily distinct). If there exists exactly | |
1253 | one minimal metaclass $M_i$, i.e., there exists an $i$, with $1 \le i \le n$, | |
1254 | such that $M_i$ is a subclass of every $M_j$, for $1 \le j \le n$, then $M_i$ | |
1255 | is selected as the new class's metaclass. Otherwise the situation is | |
1256 | ambiguous and an error will be reported. Usually, the ambiguity can be | |
1257 | resolved satisfactorily by defining a new class $M^*$ as a direct subclass of | |
1258 | the minimal $M_j$. | |
1259 | ||
1260 | ||
1261 | \subsection{Translation-time metaobjects} | |
1262 | \label{sec:concepts.metaclasses.compile-time} | |
1263 | ||
1264 | ||
1265 | ||
1266 | \fixme{unwritten} | |
1267 | ||
caa6f4b9 MW |
1268 | %%%-------------------------------------------------------------------------- |
1269 | \section{Compatibility considerations} \label{sec:concepts.compatibility} | |
1270 | ||
1271 | Sod doesn't make source-level compatibility especially difficult. As long as | |
1272 | classes, slots, and messages don't change names or dissappear, and slots and | |
1273 | messages retain their approximate types, everything will be fine. | |
1274 | ||
1275 | Binary compatibility is much more difficult. Unfortunately, Sod classes have | |
1276 | rather fragile binary interfaces.\footnote{% | |
1277 | Research suggestion: investigate alternative instance and vtable layouts | |
1278 | which improve binary compatibility, probably at the expense of instance | |
1279 | compactness, and efficiency of slot access and message sending. There may | |
1280 | be interesting trade-offs to be made.} % | |
1281 | ||
6390b845 | 1282 | If instances are allocated \fixme{incomplete} |
caa6f4b9 | 1283 | |
1f7d590d MW |
1284 | %%%----- That's all, folks -------------------------------------------------- |
1285 | ||
1286 | %%% Local variables: | |
1287 | %%% mode: LaTeX | |
1288 | %%% TeX-master: "sod.tex" | |
1289 | %%% TeX-PDF-mode: t | |
1290 | %%% End: |