summaryrefslogtreecommitdiff
path: root/util/concurrency/task.h
blob: d7b45eeef247900568d255b49667e34eaa6ea1bc (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
// @file task.h

/**
*    Copyright (C) 2008 10gen Inc.
*
*    This program is free software: you can redistribute it and/or  modify
*    it under the terms of the GNU Affero General Public License, version 3,
*    as published by the Free Software Foundation.
*
*    This program is distributed in the hope that it will be useful,b
*    but WITHOUT ANY WARRANTY; without even the implied warranty of
*    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
*    GNU Affero General Public License for more details.
*
*    You should have received a copy of the GNU Affero General Public License
*    along with this program.  If not, see <http://www.gnu.org/licenses/>.
*/

#pragma once

#include "../background.h"

namespace mongo {

    namespace task {

        /** abstraction around threads.  simpler than BackgroundJob which is used behind the scenes.
            allocate the Task dynamically.  when the thread terminates, the Task object will delete itself.
        */
        class Task : private BackgroundJob {
        protected:
            virtual void doWork() = 0;                  // implement the task here.
            virtual string name() const = 0;            // name the threada
        public:
            Task();

            /** for a repeating task, stop after current invocation ends. can be called by other threads
                as long as the Task is still in scope.
                */
            void halt();
        private:
            unsigned n, repeat;
            friend void fork(Task* t);
            friend void repeat(Task* t, unsigned millis);
            virtual void run();
            //virtual void ending() { }
            void begin();
        };

        /** run once */
        void fork(Task *t);

        /** run doWork() over and over, with a pause between runs of millis */
        void repeat(Task *t, unsigned millis);

        /*** Example ***
        inline void sample() {
            class Sample : public Task {
            public:
                int result;
                virtual void doWork() { result = 1234; }
                Sample() : result(0) { }
            };
            shared_ptr<Sample> q( new Sample() );
            fork(q);
            cout << q->result << endl; // could print 1234 or 0.
        }
        */

    }

}