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
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
|
/*
* libjingle
* Copyright 2004--2006, Google Inc.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* 3. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
* EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
* OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include <algorithm>
#include "talk/base/taskparent.h"
#include "talk/base/task.h"
#include "talk/base/taskrunner.h"
namespace talk_base {
TaskParent::TaskParent(Task* derived_instance, TaskParent *parent)
: parent_(parent) {
ASSERT(derived_instance != NULL);
ASSERT(parent != NULL);
runner_ = parent->GetRunner();
parent_->AddChild(derived_instance);
Initialize();
}
TaskParent::TaskParent(TaskRunner *derived_instance)
: parent_(NULL),
runner_(derived_instance) {
ASSERT(derived_instance != NULL);
Initialize();
}
// Does common initialization of member variables
void TaskParent::Initialize() {
children_.reset(new ChildSet());
child_error_ = false;
}
void TaskParent::AddChild(Task *child) {
children_->insert(child);
}
#ifdef _DEBUG
bool TaskParent::IsChildTask(Task *task) {
ASSERT(task != NULL);
return task->parent_ == this && children_->find(task) != children_->end();
}
#endif
bool TaskParent::AllChildrenDone() {
for (ChildSet::iterator it = children_->begin();
it != children_->end();
++it) {
if (!(*it)->IsDone())
return false;
}
return true;
}
bool TaskParent::AnyChildError() {
return child_error_;
}
void TaskParent::AbortAllChildren() {
if (children_->size() > 0) {
#ifdef _DEBUG
runner_->IncrementAbortCount();
#endif
ChildSet copy = *children_;
for (ChildSet::iterator it = copy.begin(); it != copy.end(); ++it) {
(*it)->Abort(true); // Note we do not wake
}
#ifdef _DEBUG
runner_->DecrementAbortCount();
#endif
}
}
void TaskParent::OnStopped(Task *task) {
AbortAllChildren();
parent_->OnChildStopped(task);
}
void TaskParent::OnChildStopped(Task *child) {
if (child->HasError())
child_error_ = true;
children_->erase(child);
}
} // namespace talk_base
|
