Mercurial > hg > Papers > 2012 > aplas
annotate paper/rectype.ind @ 23:e9d317e4ea70
modify
| author | Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp> |
|---|---|
| date | Fri, 15 Jun 2012 17:33:28 +0900 |
| parents | f1839aae06dc |
| children | 17ce985c1cb3 |
| rev | line source |
|---|---|
| 11 | 1 -title: Recursive type syntax in Continuation based C |
| 2 | |
| 3 \newcommand{\rectype}{{\tt \_\_rectype}} | |
|
16
b5bef0479ef5
modify how to implement rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
15
diff
changeset
|
4 \newcommand{\code}{{\tt \_\_code}} |
| 11 | 5 |
| 6 --author: Shinji Kono, Nobuyasu Oshiro | |
| 7 | |
| 8 --abstract: | |
| 9 We have implemented Continuation based C (CbC). | |
| 10 CbC is an extension of C, which has parameterized goto statement. | |
| 11 It is useful for finite state automaton or many core tasks. | |
| 12 Goto statement is a way to force tail call elimination. | |
| 13 The destination of goto statement is called Code Segment, which is actually a normal function of C. | |
| 14 To represent recursive function call, the type system of C is not enough, because | |
| 15 it has no recursive types. | |
| 16 We introduce \rectype keyword for recursive type, and it is implemented in GCC-4.6.0. | |
| 17 We will compare the conventional methods, \rectype keyword and a method using C structure. | |
| 18 Also we show usage of CbC and it's benchmark. | |
| 19 | |
| 20 | |
| 21 --Continuation based C | |
| 22 | |
| 23 CbC's basic programming unit is a code segment. It is not a subroutine, but it | |
| 24 looks like a function, because it has input and output. We can use C struct | |
| 25 as input and output interfaces. | |
| 26 | |
| 27 struct interface1 { int i; }; | |
| 28 struct interface2 { int o; }; | |
| 29 | |
| 30 __code f(struct interface1 a) { | |
| 31 struct interface2 b; b.o=a.i; | |
| 32 goto g(b); | |
| 33 } | |
| 34 | |
| 35 In this example, a code segment | |
| 36 \verb+f+ has \verb+input a+ and sends \verb+output b+ to a code segment \verb+g+. | |
| 37 There is no return from code segment \verb+b+, \verb+b+ should call another | |
| 38 continuation using \verb+goto+. Any control structure in C is allowed in CwC | |
| 39 language, but in case of CbC, we restrict ourselves to use \verb+if+ statement | |
| 40 only, because it is sufficient to implement C to CbC translation. In this case, | |
| 41 code segment has one input interface and several output interfaces (fig.\ref{code}). | |
| 42 | |
| 43 \includegraphics[width=6cm]{ | |
| 44 \begin{figure}[htb] | |
| 45 \begin{center} | |
| 46 \includegraphics[width=6cm]{figure/code.pdf} | |
| 47 \caption{code} | |
| 48 \end{center} | |
| 49 \label{code} | |
| 50 \end{figure} | |
| 51 | |
| 52 | |
| 53 | |
| 54 \verb+__code+ and parameterized global goto statement is an extension of | |
| 55 Continuation based C. Unlike \verb+C--+ \cite{cminusminus}'s parameterized goto, | |
| 56 we cannot goto into normal C function. | |
| 57 | |
| 58 --Intermix with C | |
| 59 | |
| 60 In CwC, we can go to a code segment from a C function and we can call C functions | |
| 61 in a code segment. So we don't have to shift completely from C to CbC. The later | |
| 62 one is straight forward, but the former one needs further extensions. | |
| 63 | |
| 64 void *env; | |
| 65 __code (*exit)(int); | |
| 66 | |
| 67 __code h(char *s) { | |
| 68 printf(s); | |
| 69 goto (*exit)(0),env; | |
| 70 } | |
| 71 | |
| 72 int main() { | |
| 73 env = __environment; | |
| 74 exit = __return; | |
| 75 goto h("hello World\n"); | |
| 76 } | |
| 77 | |
| 78 In this hello world example, the environment of \verb+main()+ | |
| 79 and its continuation is kept in global variables. The environment | |
| 80 and the continuation can be get using \verb+__environment+, | |
| 81 and \verb+__return+. Arbitrary mixture of code segments and functions | |
| 82 are allowed (in CwC). The continuation of \verb+goto+ statement | |
| 83 never returns to original function, but it goes to caller of original | |
| 84 function. In this case, it returns result 0 to the operating system. | |
| 85 | |
| 86 | |
| 87 --What's good? | |
| 88 | |
| 89 CbC is a kind of high level assembler language. It can do several | |
| 90 original C language cannot do. For examples, | |
| 91 | |
| 92 {\small | |
| 93 \begin{verbatim} | |
| 94 Thread Scheduler | |
| 95 Context Switch | |
| 96 Synchronization Primitives | |
| 97 I/O wait semantics | |
| 98 | |
| 99 \end{verbatim} | |
| 100 } | |
| 101 | |
| 102 are impossible to write in C. Usually it requires some help of | |
| 103 assembler language such as \verb+__asm+ statement extension which is | |
| 104 of course not portable. | |
| 105 | |
| 106 --Scheduler example | |
| 107 | |
| 108 We can easily write these things in CbC, because | |
| 109 CbC has no hidden information behind the stack frame of C. | |
| 110 A thread simply go to the scheduler, | |
| 111 | |
| 112 goto scheduler(self, task_list); | |
| 113 | |
| 114 | |
| 115 and the scheduler simply pass the control to the next | |
| 116 thread in the task queue. | |
| 117 | |
| 118 code scheduler(Thread self,TaskPtr list) | |
| 119 { | |
| 120 TaskPtr t = list; | |
| 121 TaskPtr e; | |
| 122 list = list->next; | |
| 123 goto list->thread->next(list->thread,list); | |
| 124 } | |
| 125 | |
| 126 Of course it is a simulator, but it is an implementation | |
| 127 also. If we have a CPU resource API, we can write real multi | |
| 128 CPU scheduler in CbC. | |
| 129 | |
| 130 This is impossible in C, because we cannot access the hidden | |
| 131 stack which is necessary to switch in the scheduler. In CbC, | |
| 132 everything is visible, so we can switch threads very easily. | |
| 133 | |
| 134 This means we can use CbC as an executable specification | |
| 135 language of OS API. | |
| 136 | |
| 137 --Self Verification | |
| 138 | |
| 139 Since we can write a scheduler in CbC, we can also enumerate | |
| 140 all possible interleaving of a concurrent program. We have | |
| 141 implement a model checker in CwC. CbC can be a self verifiable | |
| 142 language\cite{kono08a}. | |
| 143 | |
| 144 SPIN\cite{holzmann97model} is a very reliable model checker, but it have to | |
| 145 use special specification language PROMELA. We cannot directly | |
| 146 use PROMELA as an implementation language, and it is slightly | |
| 147 difficult to study its concurrent execution semantics including | |
| 148 communication ports. | |
| 149 | |
| 150 There are another kind of model checker for real programming | |
| 151 language, such as Java PathFinder\cite{havelund98model}. Java PathFinder use | |
| 152 Java Virtual Machine (JVM) for state space enumeration which | |
| 153 is very expensive some time. | |
| 154 | |
| 155 In CbC, state enumerator itself is written in CbC, and its concurrency | |
| 156 semantics is written in CbC itself. Besides it is very close | |
| 157 to the implementation. Actually we can use CbC as an implementation | |
| 158 language. Since enumerator is written in the application itself, we | |
| 159 can perform abstraction or approximation in the application specific | |
| 160 way, which is a little difficult in Java PathFinder. It is possible | |
| 161 to handle JVM API for the purpose, although. | |
| 162 | |
| 163 We can use CPS transformed CbC source code for verification, but | |
| 164 we don't have to transform all of the source code, because CwC | |
| 165 supports all C constructs. (But not in C++... Theoretically it is | |
| 166 possible with using cfront converter, it should be difficult). | |
| 167 | |
| 168 | |
| 169 --As a target language | |
| 170 | |
| 171 Now we have GCC implementation of CbC, it runs very fast. Many | |
| 172 popular languages are implemented on top of C. Some of them | |
| 173 uses very large switch statement for the byte code interpreter. | |
| 174 We don't have to use these hacks, when we use CbC as an implementation | |
| 175 language. | |
| 176 | |
| 177 CbC is naturally similar to the state charts. It means it is very | |
| 178 close to UML diagrams. Although CbC does not have Object Oriented | |
| 179 feature such as message passing nor inheritance, which is not | |
| 180 crucial in UML. | |
| 181 | |
| 182 | |
| 14 | 183 --Recursive type syntax |
| 184 | |
| 185 CbC's program pass next pointer of code segment on argument. | |
| 186 It is passed as follows. | |
| 187 | |
| 188 __code csA( __code (*p)() ) { | |
| 189 goto p(csB); | |
| 190 } | |
| 191 | |
|
15
68d2c32f74cf
modify explanation of rectype syntax
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
14
diff
changeset
|
192 p is next pointer of codesegment. |
| 14 | 193 But, This declarationd is not right. |
| 194 Because p have arguments. | |
|
15
68d2c32f74cf
modify explanation of rectype syntax
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
14
diff
changeset
|
195 We wanted to the same type of p's arguments as type of csA's arguments. |
|
68d2c32f74cf
modify explanation of rectype syntax
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
14
diff
changeset
|
196 Right declaration is as follows. |
| 14 | 197 |
|
15
68d2c32f74cf
modify explanation of rectype syntax
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
14
diff
changeset
|
198 __code csA( __code (*p)( __code (*)( __code (*)( __code *)))) { |
| 14 | 199 goto p(csB); |
| 200 } | |
| 201 | |
|
15
68d2c32f74cf
modify explanation of rectype syntax
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
14
diff
changeset
|
202 The syntax of C Must be declared recursively. |
|
68d2c32f74cf
modify explanation of rectype syntax
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
14
diff
changeset
|
203 The following declaration if it may be that the type checking of p. |
| 11 | 204 |
|
15
68d2c32f74cf
modify explanation of rectype syntax
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
14
diff
changeset
|
205 __code csA( __code (*p)( __code )) { |
|
68d2c32f74cf
modify explanation of rectype syntax
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
14
diff
changeset
|
206 goto p(csB); |
|
68d2c32f74cf
modify explanation of rectype syntax
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
14
diff
changeset
|
207 } |
|
68d2c32f74cf
modify explanation of rectype syntax
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
14
diff
changeset
|
208 |
|
68d2c32f74cf
modify explanation of rectype syntax
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
14
diff
changeset
|
209 However this declaration is long. |
|
68d2c32f74cf
modify explanation of rectype syntax
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
14
diff
changeset
|
210 Therefore we implemented \rectype syntax in CbC on GCC. |
|
68d2c32f74cf
modify explanation of rectype syntax
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
14
diff
changeset
|
211 |
| 11 | 212 \rectype syntax is declare a recursive type. |
|
15
68d2c32f74cf
modify explanation of rectype syntax
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
14
diff
changeset
|
213 This example is using \rectype syntax. |
| 11 | 214 |
| 215 __code csA( __rectype *p) { | |
| 216 goto p(csB); | |
| 217 } | |
| 218 | |
| 219 *p represent pointer of csA at \ref{code:rectype} . | |
| 220 p's argument type is same csA that function pointer. | |
| 221 | |
| 222 | |
| 21 | 223 --Problems with implementation of \rectype. |
| 224 Segmentation fault has occurred in the following program on compile. | |
| 225 | |
| 226 __code csA(__rectype *p) { | |
| 227 goto p(3); | |
| 228 } | |
| 229 | |
| 230 The above code is the wrong argument of p. | |
| 22 | 231 The p's argument is converted by GCC. |
| 232 3 of type int is converted to a pionter type of code segment. | |
| 233 At this time, GCC looks at the type of the argument. | |
| 234 p's argument is pointer of csA. | |
| 235 csA's argument is p. | |
| 236 GCC is also an infinite recursion happens to see the type of tye argument of the argument. | |
| 237 | |
| 23 | 238 We Solve this problem that does not check the arguments if the \rectype flag is true. |
| 239 The following program become part was fixed gcc/c-family/c-pretty-print.c. | |
| 240 | |
| 241 static void | |
| 242 pp_c_abstract_declarator (c_pretty_printer *pp, tree t) | |
| 243 { | |
| 244 if (TREE_CODE (t) == POINTER_TYPE) | |
| 245 { | |
| 246 if (TREE_CODE (TREE_TYPE (t)) == ARRAY_TYPE | |
| 247 || TREE_CODE (TREE_TYPE (t)) == FUNCTION_TYPE) | |
| 248 pp_c_right_paren (pp); | |
| 249 #ifndef noCbC | |
| 250 if (IS_RECTYPE(t)) return; | |
| 251 #endif | |
| 252 t = TREE_TYPE (t); | |
| 253 } | |
| 254 pp_direct_abstract_declarator (pp, t); | |
| 255 } | |
| 256 | |
| 257 | |
| 258 Variable t have information of p's argument. | |
| 259 If t is POINTER_TYPE, t is assigned type of POINTER_TYPE(\verb+t = TREE_TYPE (t);+). | |
| 260 We have added code \verb+if (IS_RECTYPE(t)) return;+ | |
| 261 Thereby we have solved type checking and infinite recursion problem. | |
| 21 | 262 |
| 263 | |
| 264 | |
| 265 | |
|
16
b5bef0479ef5
modify how to implement rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
15
diff
changeset
|
266 --How to implement \rectype |
|
17
02bd9a41010f
modify How to implement rectype syntax
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
16
diff
changeset
|
267 \rectype syntx is implemented overriding AST. |
|
16
b5bef0479ef5
modify how to implement rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
15
diff
changeset
|
268 First, \rectype syntax make Tree same \code(\ref{fig:tree1}). |
|
18
33b7a54edaa9
method other rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
17
diff
changeset
|
269 Second, tree was created to be rectype flag. |
|
33b7a54edaa9
method other rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
17
diff
changeset
|
270 Thrid, to override AST(\ref{fig:tree2}). |
|
16
b5bef0479ef5
modify how to implement rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
15
diff
changeset
|
271 |
|
b5bef0479ef5
modify how to implement rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
15
diff
changeset
|
272 \begin{figure}[htpb] |
|
b5bef0479ef5
modify how to implement rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
15
diff
changeset
|
273 \begin{minipage}{0.5\hsize} |
|
b5bef0479ef5
modify how to implement rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
15
diff
changeset
|
274 \begin{center} |
|
b5bef0479ef5
modify how to implement rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
15
diff
changeset
|
275 \scalebox{0.35}{\includegraphics{figure/tree1.pdf}} |
|
b5bef0479ef5
modify how to implement rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
15
diff
changeset
|
276 \end{center} |
|
b5bef0479ef5
modify how to implement rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
15
diff
changeset
|
277 \caption{AST of function pointer} |
|
b5bef0479ef5
modify how to implement rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
15
diff
changeset
|
278 \label{fig:tree1} |
|
b5bef0479ef5
modify how to implement rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
15
diff
changeset
|
279 \end{minipage} |
|
b5bef0479ef5
modify how to implement rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
15
diff
changeset
|
280 \begin{minipage}{0.2\hsize} |
|
b5bef0479ef5
modify how to implement rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
15
diff
changeset
|
281 \begin{center} |
|
b5bef0479ef5
modify how to implement rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
15
diff
changeset
|
282 \scalebox{0.35}{\includegraphics{figure/tree2.pdf}} |
|
b5bef0479ef5
modify how to implement rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
15
diff
changeset
|
283 \end{center} |
|
b5bef0479ef5
modify how to implement rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
15
diff
changeset
|
284 \caption{AST of \rectype} |
|
b5bef0479ef5
modify how to implement rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
15
diff
changeset
|
285 \label{fig:tree2} |
|
b5bef0479ef5
modify how to implement rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
15
diff
changeset
|
286 \end{minipage} |
|
b5bef0479ef5
modify how to implement rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
15
diff
changeset
|
287 \end{figure} |
|
b5bef0479ef5
modify how to implement rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
15
diff
changeset
|
288 |
|
17
02bd9a41010f
modify How to implement rectype syntax
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
16
diff
changeset
|
289 Above AST(\ref{fig:tree2}) is made by syntax of \verb+__code csA(__rectype *p)+ . |
|
02bd9a41010f
modify How to implement rectype syntax
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
16
diff
changeset
|
290 TREE_LIST have infomation of argument. |
|
02bd9a41010f
modify How to implement rectype syntax
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
16
diff
changeset
|
291 First TREE_LIST represent that argument is function pointer(\verb+__code (*p)()+) . |
|
02bd9a41010f
modify How to implement rectype syntax
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
16
diff
changeset
|
292 Second TREE_LIST represent that csA is Fixed-length argument. |
|
02bd9a41010f
modify How to implement rectype syntax
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
16
diff
changeset
|
293 First TREE_LIST is connected with POINTER_TYPE. |
|
02bd9a41010f
modify How to implement rectype syntax
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
16
diff
changeset
|
294 POINTER_TYPE have pointer of function(FUNCTION_TYPE). |
|
02bd9a41010f
modify How to implement rectype syntax
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
16
diff
changeset
|
295 We have to override it in the pointer of csA. |
| 11 | 296 |
| 297 | |
|
18
33b7a54edaa9
method other rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
17
diff
changeset
|
298 -- |
|
33b7a54edaa9
method other rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
17
diff
changeset
|
299 |
|
33b7a54edaa9
method other rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
17
diff
changeset
|
300 |
|
33b7a54edaa9
method other rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
17
diff
changeset
|
301 |
|
33b7a54edaa9
method other rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
17
diff
changeset
|
302 |
| 11 | 303 --Method other than \rectype |
| 304 | |
|
18
33b7a54edaa9
method other rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
17
diff
changeset
|
305 The recursively program of C's syntax can be solved using struct syntax. |
|
33b7a54edaa9
method other rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
17
diff
changeset
|
306 For example, if we write |
|
33b7a54edaa9
method other rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
17
diff
changeset
|
307 |
| 11 | 308 struct interface { |
| 309 __code (*next)(struct interface); | |
| 310 }; | |
| 311 | |
| 312 __code csA(struct interface p) { | |
|
18
33b7a54edaa9
method other rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
17
diff
changeset
|
313 struct interface ds; |
|
33b7a54edaa9
method other rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
17
diff
changeset
|
314 ds.next = csB; |
| 11 | 315 goto p.next(ds); |
| 316 } | |
| 317 | |
| 318 int main() { | |
|
18
33b7a54edaa9
method other rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
17
diff
changeset
|
319 struct interface ds; |
|
33b7a54edaa9
method other rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
17
diff
changeset
|
320 ds = print; |
| 11 | 321 goto csA(ds); |
| 322 return 0; | |
| 323 } | |
| 324 | |
|
18
33b7a54edaa9
method other rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
17
diff
changeset
|
325 there is no need to write recursively. |
|
33b7a54edaa9
method other rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
17
diff
changeset
|
326 Because the struct syntax wrapped in a function pointer. |
|
33b7a54edaa9
method other rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
17
diff
changeset
|
327 Code segment does not receive function pointer in arguments. |
|
33b7a54edaa9
method other rectype
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
17
diff
changeset
|
328 Recursively program does not occur. |
| 11 | 329 |
| 330 | |
| 331 | |
| 332 \section{Comparision} | |
| 333 | |
|
19
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
334 Here is our bench mark program. |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
335 {\small |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
336 f0(int i) { |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
337 int k,j; |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
338 k = 3+i; |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
339 j = g0(i+3); |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
340 return k+4+j; |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
341 } |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
342 |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
343 g0(int i) { |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
344 return h0(i+4)+i; |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
345 } |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
346 |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
347 h0(int i) { |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
348 return i+4; |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
349 } |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
350 } |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
351 |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
352 It is written in C, we perform CPS transformation in several |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
353 steps by hands. There are several optimization is possible. |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
354 |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
355 {\small |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
356 /* straight conversion case (1) */ |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
357 |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
358 typedef char *stack; |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
359 |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
360 struct cont_interface { |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
361 // General Return Continuation |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
362 __code (*ret)(); |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
363 }; |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
364 |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
365 __code f(int i,stack sp) { |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
366 int k,j; |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
367 k = 3+i; |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
368 goto f_g0(i,k,sp); |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
369 } |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
370 |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
371 struct f_g0_interface { |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
372 // Specialized Return Continuation |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
373 __code (*ret)(); |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
374 int i_,k_,j_; |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
375 }; |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
376 |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
377 __code f_g1(int j,stack sp); |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
378 |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
379 __code f_g0(int i,int k,stack sp) { // Caller |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
380 struct f_g0_interface *c = |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
381 (struct f_g0_interface *)( |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
382 sp -= sizeof(struct f_g0_interface)); |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
383 |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
384 c->ret = f_g1; |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
385 c->k_ = k; |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
386 c->i_ = i; |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
387 |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
388 goto g(i+3,sp); |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
389 } |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
390 |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
391 __code f_g1(int j,stack sp) { // Continuation |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
392 struct f_g0_interface *c = |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
393 (struct f_g0_interface *)sp; |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
394 int k = c->k_; |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
395 sp+=sizeof(struct f_g0_interface); |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
396 c = (struct f_g0_interface *)sp; |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
397 goto (c->ret)(k+4+j,sp); |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
398 } |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
399 |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
400 __code g_h1(int j,stack sp); |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
401 |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
402 __code g(int i,stack sp) { // Caller |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
403 struct f_g0_interface *c = |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
404 (struct f_g0_interface *)( |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
405 sp -= sizeof(struct f_g0_interface)); |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
406 |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
407 c->ret = g_h1; |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
408 c->i_ = i; |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
409 |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
410 goto h(i+3,sp); |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
411 } |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
412 |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
413 __code g_h1(int j,stack sp) { |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
414 // Continuation |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
415 struct f_g0_interface *c = |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
416 (struct f_g0_interface *)sp; |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
417 int i = c->i_; |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
418 sp+=sizeof(struct f_g0_interface); |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
419 c = (struct f_g0_interface *)sp; |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
420 goto (c->ret)(j+i,sp); |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
421 } |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
422 |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
423 __code h(int i,stack sp) { |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
424 struct f_g0_interface *c = |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
425 (struct f_g0_interface *)sp; |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
426 goto (c->ret)(i+4,sp); |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
427 } |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
428 |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
429 struct main_continuation { |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
430 // General Return Continuation |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
431 __code (*ret)(); |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
432 __code (*main_ret)(); |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
433 void *env; |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
434 }; |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
435 |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
436 __code main_return(int i,stack sp) { |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
437 if (loop-->0) |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
438 goto f(233,sp); |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
439 printf("#0103:%d\n",i); |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
440 goto (( (struct main_continuation *)sp)->main_ret)(0), |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
441 ((struct main_continuation *)sp)->env; |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
442 } |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
443 } |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
444 |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
445 This is awfully long, but it is straight forward. Several forward |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
446 prototyping is necessary, and we find strict prototyping is |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
447 painful in CbC, because we have to use many code segments to |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
448 perform simple thing. CbC is not a language for human, but for |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
449 automatic generation, verification or IDE directed programming. |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
450 |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
451 We can shorten the result in this way. |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
452 {\small |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
453 /* little optimized case (3) */ |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
454 |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
455 __code f2_1(int i,char *sp) { |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
456 int k,j; |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
457 k = 3+i; |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
458 goto g2_1(k,i+3,sp); |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
459 } |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
460 |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
461 __code g2_1(int k,int i,char *sp) { |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
462 goto h2_11(k,i+4,sp); |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
463 } |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
464 |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
465 __code f2_0_1(int k,int j,char *sp); |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
466 __code h2_1_1(int i,int k,int j,char *sp) { |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
467 goto f2_0_1(k,i+j,sp); |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
468 } |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
469 |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
470 __code h2_11(int i,int k,char *sp) { |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
471 goto h2_1_1(i,k,i+4,sp); |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
472 } |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
473 |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
474 __code f2_0_1(int k,int j,char *sp) { |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
475 goto (( (struct cont_interface *) |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
476 sp)->ret)(k+4+j,sp); |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
477 } |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
478 |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
479 __code main_return2_1(int i,stack sp) { |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
480 if (loop-->0) |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
481 goto f2_1(233,sp); |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
482 printf("#0165:%d\n",i); |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
483 goto (( (struct main_continuation *)sp)->main_ret)(0), |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
484 ((struct main_continuation *)sp)->env; |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
485 } |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
486 } |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
487 |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
488 In this example, CPS transformed source is faster than |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
489 original function call form. There are not so much area for the |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
490 optimization in function call form, because function call API |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
491 have to be strict. |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
492 CbC does not need standard call API other than interface which |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
493 is simply a struct and there are no need for register save. (This |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
494 bench mark is designed to require the register save). |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
495 |
|
20
203699cf5384
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
496 Here is the result in x86_64 architecture (Table.\ref{tab:gcc,compare}). |
|
19
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
497 is function call. \verb+conv1 2+, \verb+conv1 3+ is optimized CPS transformed |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
498 source. |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
499 |
| 11 | 500 \begin{table}[htpb] |
| 501 \centering | |
| 502 \small | |
| 503 \begin{tabular}{|l|r|r|r|} \hline | |
| 504 (unit: s) & ./conv1 1 & ./conv1 2 & ./conv1 3 \\ \hline | |
| 505 GCC -O3(32bit) & 2.52 & 2.34 & 1.53 \\ \hline | |
| 506 GCC -O3(64bit) & 1.80 & 1.20 & 1.44 \\ \hline | |
| 507 \end{tabular} | |
| 508 \caption{Micro-C, GCC bench mark (in sec)} | |
|
20
203699cf5384
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
509 \label{tab:gcc,compare} |
| 11 | 510 \end{table} |
| 511 | |
| 512 | |
| 513 | |
|
19
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
514 --Conclusion |
|
dc62dc1fe059
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
18
diff
changeset
|
515 |
|
20
203699cf5384
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
516 |
|
203699cf5384
modify compression
Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
517 |
| 21 | 518 |