source: tests/concurrency/actors/pingpong.cfa@ b28ce93

#include <fstream.hfa>
#include <stdlib.hfa>
#include <string.h>
#include <stdio.h>
#include <mutex_stmt.hfa>
#include <actor.hfa>

struct ping { inline actor; };
struct pong { inline actor; };

struct p_msg {
        inline message;
        size_t count;
};
//static inline void ?{}( p_msg & this ) { ((message &)this){}; this.count = 0; }
static inline void ?{}( p_msg & this ) { this.count = 0; }

ping * pi;
pong * po;
size_t times = 100000;

allocation receive( ping &, p_msg & msg ) {
        msg.count++;
        if ( msg.count > times ) return Finished;

        allocation retval = Nodelete;
        if ( msg.count == times ) retval = Finished;
        *po | msg;
        return retval;
}

allocation receive( pong &, p_msg & msg ) {
        msg.count++;
        if ( msg.count > times ) return Finished;
        
        allocation retval = Nodelete;
        if ( msg.count == times ) retval = Finished;
        *pi | msg;
        return retval;
}

size_t Processors = 2;

int main() {
        sout | "start";

        processor p[Processors - 1];

        actor_start( Processors ); // test passing number of processors
        ping pi_actor;
        pong po_actor;
        po = &po_actor;
        pi = &pi_actor;
        p_msg m;
        pi_actor | m;
        actor_stop();

        sout | "end";
}