source: doc/theses/thierry_delisle_MMath/text/cforall.tex @ 1526e86

Last change on this file since 1526e86 was 67982887, checked in by Peter A. Buhr <pabuhr@…>, 4 years ago

specialize thesis directory-names

  • Property mode set to 100644
File size: 8.9 KB
1% ======================================================================
2% ======================================================================
3\chapter{\CFA Overview}
4% ======================================================================
5% ======================================================================
7The following is a quick introduction to the \CFA language, specifically tailored to the features needed to support concurrency.
9\CFA is an extension of ISO-C and therefore supports all of the same paradigms as C. It is a non-object-oriented system-language, meaning most of the major abstractions have either no runtime overhead or can be opted out easily. Like C, the basics of \CFA revolve around structures and routines, which are thin abstractions over machine code. The vast majority of the code produced by the \CFA translator respects memory layouts and calling conventions laid out by C. Interestingly, while \CFA is not an object-oriented language, lacking the concept of a receiver (e.g., {\tt this}), it does have some notion of objects\footnote{C defines the term objects as : ``region of data storage in the execution environment, the contents of which can represent
10values''~\cite[3.15]{C11}}, most importantly construction and destruction of objects. Most of the following code examples can be found on the \CFA website~\cite{www-cfa}.
12% ======================================================================
15Like \CC, \CFA introduces rebind-able references providing multiple dereferencing as an alternative to pointers. In regards to concurrency, the semantic difference between pointers and references are not particularly relevant, but since this document uses mostly references, here is a quick overview of the semantics:
17int x, *p1 = &x, **p2 = &p1, ***p3 = &p2,
18        &r1 = x,    &&r2 = r1,   &&&r3 = r2;
19***p3 = 3;                                                      //change x
20r3    = 3;                                                      //change x, ***r3
21**p3  = ...;                                            //change p1
22*p3   = ...;                                            //change p2
23int y, z, & ar[3] = {x, y, z};          //initialize array of references
24typeof( ar[1]) p;                                       //is int, referenced object type
25typeof(&ar[1]) q;                                       //is int &, reference type
26sizeof( ar[1]) == sizeof(int);          //is true, referenced object size
27sizeof(&ar[1]) == sizeof(int *);        //is true, reference size
29The important take away from this code example is that a reference offers a handle to an object, much like a pointer, but which is automatically dereferenced for convenience.
31% ======================================================================
34Another important feature of \CFA is function overloading as in Java and \CC, where routines with the same name are selected based on the number and type of the arguments. As well, \CFA uses the return type as part of the selection criteria, as in Ada~\cite{Ada}. For routines with multiple parameters and returns, the selection is complex.
36//selection based on type and number of parameters
37void f(void);                   //(1)
38void f(char);                   //(2)
39void f(int, double);    //(3)
40f();                                    //select (1)
41f('a');                                 //select (2)
42f(3, 5.2);                              //select (3)
44//selection based on  type and number of returns
45char   f(int);                  //(1)
46double f(int);                  //(2)
47char   c = f(3);                //select (1)
48double d = f(4);                //select (2)
50This feature is particularly important for concurrency since the runtime system relies on creating different types to represent concurrency objects. Therefore, overloading is necessary to prevent the need for long prefixes and other naming conventions that prevent name clashes. As seen in chapter \ref{basics}, routine \code{main} is an example that benefits from overloading.
52% ======================================================================
54Overloading also extends to operators. The syntax for denoting operator-overloading is to name a routine with the symbol of the operator and question marks where the arguments of the operation appear, e.g.:
56int ++? (int op);                       //unary prefix increment
57int ?++ (int op);                       //unary postfix increment
58int ?+? (int op1, int op2);             //binary plus
59int ?<=?(int op1, int op2);             //binary less than
60int ?=? (int & op1, int op2);           //binary assignment
61int ?+=?(int & op1, int op2);           //binary plus-assignment
63struct S {int i, j;};
64S ?+?(S op1, S op2) {                           //add two structures
65        return (S){op1.i + op2.i, op1.j + op2.j};
67S s1 = {1, 2}, s2 = {2, 3}, s3;
68s3 = s1 + s2;                                           //compute sum: s3 == {2, 5}
70While concurrency does not use operator overloading directly, this feature is more important as an introduction for the syntax of constructors.
72% ======================================================================
74Object lifetime is often a challenge in concurrency. \CFA uses the approach of giving concurrent meaning to object lifetime as a means of synchronization and/or mutual exclusion. Since \CFA relies heavily on the lifetime of objects, constructors and destructors is a core feature required for concurrency and parallelism. \CFA uses the following syntax for constructors and destructors:
76struct S {
77        size_t size;
78        int * ia;
80void ?{}(S & s, int asize) {    //constructor operator
81        s.size = asize;                         //initialize fields
82        s.ia = calloc(size, sizeof(S));
84void ^?{}(S & s) {                              //destructor operator
85        free(ia);                                       //de-initialization fields
87int main() {
88        S x = {10}, y = {100};          //implicit calls: ?{}(x, 10), ?{}(y, 100)
89        ...                                                     //use x and y
90        ^x{}^y{};                            //explicit calls to de-initialize
91        x{20};  y{200};                         //explicit calls to reinitialize
92        ...                                                     //reuse x and y
93}                                                               //implicit calls: ^?{}(y), ^?{}(x)
95The language guarantees that every object and all their fields are constructed. Like \CC, construction of an object is automatically done on allocation and destruction of the object is done on deallocation. Allocation and deallocation can occur on the stack or on the heap.
98        struct S s = {10};      //allocation, call constructor
99        ...
100}                                               //deallocation, call destructor
101struct S * s = new();   //allocation, call constructor
103delete(s);                              //deallocation, call destructor
105Note that like \CC, \CFA introduces \code{new} and \code{delete}, which behave like \code{malloc} and \code{free} in addition to constructing and destructing objects, after calling \code{malloc} and before calling \code{free}, respectively.
107% ======================================================================
108\section{Parametric Polymorphism}
110Routines in \CFA can also be reused for multiple types. This capability is done using the \code{forall} clauses, which allow separately compiled routines to support generic usage over multiple types. For example, the following sum function works for any type that supports construction from 0 and addition:
112//constraint type, 0 and +
113forall(otype T | { void ?{}(T *, zero_t); T ?+?(T, T); })
114T sum(T a[ ], size_t size) {
115        T total = 0;                            //construct T from 0
116        for(size_t i = 0; i < size; i++)
117                total = total + a[i];   //select appropriate +
118        return total;
121S sa[5];
122int i = sum(sa, 5);                             //use S's 0 construction and +
125Since writing constraints on types can become cumbersome for more constrained functions, \CFA also has the concept of traits. Traits are named collection of constraints that can be used both instead and in addition to regular constraints:
127trait summable( otype T ) {
128        void ?{}(T *, zero_t);          //constructor from 0 literal
129        T ?+?(T, T);                            //assortment of additions
130        T ?+=?(T *, T);
131        T ++?(T *);
132        T ?++(T *);
134forall( otype T | summable(T) ) //use trait
135T sum(T a[], size_t size);
138Note that the type use for assertions can be either an \code{otype} or a \code{dtype}. Types declared as \code{otype} refer to ``complete'' objects, i.e., objects with a size, a default constructor, a copy constructor, a destructor and an assignment operator. Using \code{dtype,} on the other hand, has none of these assumptions but is extremely restrictive, it only guarantees the object is addressable.
140% ======================================================================
141\section{with Clause/Statement}
142Since \CFA lacks the concept of a receiver, certain functions end up needing to repeat variable names often. To remove this inconvenience, \CFA provides the \code{with} statement, which opens an aggregate scope making its fields directly accessible (like Pascal).
144struct S { int i, j; };
145int mem(S & this) with (this)           //with clause
146        i = 1;                                                  //this->i
147        j = 2;                                                  //this->j
149int foo() {
150        struct S1 { ... } s1;
151        struct S2 { ... } s2;
152        with (s1)                                               //with statement
153        {
154                //access fields of s1 without qualification
155                with (s2)                                       //nesting
156                {
157                        //access fields of s1 and s2 without qualification
158                }
159        }
160        with (s1, s2)                                   //scopes open in parallel
161        {
162                //access fields of s1 and s2 without qualification
163        }
167For more information on \CFA see \cite{cforall-ug,rob-thesis,www-cfa}.
Note: See TracBrowser for help on using the repository browser.