source: doc/theses/andrew_beach_MMath/code/resume-empty.cfa @ e85a72b8

Last change on this file since e85a72b8 was 18783b4, checked in by Peter A. Buhr <pabuhr@…>, 3 years ago

attempt to remove tail-recursion optimization

  • Property mode set to 100644
File size: 960 bytes
RevLine 
[ea593a3]1// Resume Across Empty Function
[ee23a8d]2#include <clock.hfa>
[ea593a3]3#include <exception.hfa>
[ee23a8d]4#include <fstream.hfa>
[f79ee0d]5#include <stdlib.hfa>                                                                   // strto
[ea593a3]6
[f79ee0d]7exception empty_exception;
8vtable(empty_exception) empty_vt;
[ea593a3]9
[f79ee0d]10void nounwind_empty(unsigned int frames) {
[ea593a3]11        if (frames) {
[f79ee0d]12                nounwind_empty(frames - 1);
[18783b4]13                if ( frames == -1 ) printf( "42" );                             // prevent recursion optimizations
[ea593a3]14        } else {
[d2278e9]15                throwResume (empty_exception){&empty_vt};
[ea593a3]16        }
17}
18
19int main(int argc, char * argv[]) {
20        unsigned int times = 1;
21        unsigned int total_frames = 1;
[ee23a8d]22        if (1 < argc) {
[f79ee0d]23                times = strto(argv[1], 0p, 10);
[ea593a3]24        }
[ee23a8d]25        if (2 < argc) {
[f79ee0d]26                total_frames = strto(argv[2], 0p, 10);
[ea593a3]27        }
28
[ee23a8d]29        Time start_time = timeHiRes();
[f79ee0d]30        for (unsigned int count = 0 ; count < times ; ++count) {
[ea593a3]31                try {
[f79ee0d]32                        nounwind_empty(total_frames);
[d2278e9]33                } catchResume (empty_exception *) {
[54651005]34                        asm volatile ("# fixup block");
[ea593a3]35                }
36        }
[ee23a8d]37        Time end_time = timeHiRes();
[f79ee0d]38        sout | "Run-Time (s): " | wd(0,1, (end_time - start_time)`ns / 1_000_000_000.);
[ea593a3]39}
Note: See TracBrowser for help on using the repository browser.