DidaWiki

/* -*- Mode: C++; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- */
/* ***************************************************************************
 *  This program is free software; you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License version 2 as 
 *  published by the Free Software Foundation.
 *
 *  This program is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public License
 *  along with this program; if not, write to the Free Software
 *  Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
 *
 *  As a special exception, you may use this file as part of a free software
 *  library without restriction.  Specifically, if other files instantiate
 *  templates or use macros or inline functions from this file, or you compile
 *  this file and link it with other files to produce an executable, this
 *  file does not by itself cause the resulting executable to be covered by
 *  the GNU General Public License.  This exception does not however
 *  invalidate any other reasons why the executable file might be covered by
 *  the GNU General Public License.
 *
 ****************************************************************************
 */
 
#include <cstdlib>
#include <cstdio>
#include <ff/pipeline.hpp>
 
using namespace ff;
 
 
 
int main(int argc, char * argv[]) {
    if (argc!=2) {
        std::cerr << "use: "  << argv[0] << " streamlen\n";
        return -1;
    }
 
    long streamlen = atol(argv[1]);
 
    srandom(111);
    auto f = [streamlen](long*, ff_node*const stage) -> long* {
        for(size_t i=0;i<streamlen;++i)
            stage->ff_send_out(new long(random() % 1000000));
        return NULL;
    };
 
    auto g = [](long *t, ff_node*const=0) -> long* {
        usleep(*t);
        return t;
    };
 
    auto h = [](long *t, ff_node*const=0) -> long* {
        printf("received %ld\n", *t);
        delete t;        
        return t;
    };
 
    // bild a 2-stage pipeline
    ff_pipe<long> pipe(f,g,h);
    if (pipe.run_and_wait_end()<0) {
        error("running pipeline\n");
        return -1;
    }
    std::cerr << "DONE, pipe  time= " << pipe.ffTime() << " (ms)\n";
    //pipe.ffStats(std::cerr);
    return 0;
}