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
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
|
/**
* @file llrun.cpp
* @author Phoenix
* @date 2006-02-16
* @brief Implementation of the LLRunner and related classes
*
* $LicenseInfo:firstyear=2006&license=viewergpl$
*
* Copyright (c) 2006-2009, Linden Research, Inc.
*
* Second Life Viewer Source Code
* The source code in this file ("Source Code") is provided by Linden Lab
* to you under the terms of the GNU General Public License, version 2.0
* ("GPL"), unless you have obtained a separate licensing agreement
* ("Other License"), formally executed by you and Linden Lab. Terms of
* the GPL can be found in doc/GPL-license.txt in this distribution, or
* online at http://secondlifegrid.net/programs/open_source/licensing/gplv2
*
* There are special exceptions to the terms and conditions of the GPL as
* it is applied to this Source Code. View the full text of the exception
* in the file doc/FLOSS-exception.txt in this software distribution, or
* online at
* http://secondlifegrid.net/programs/open_source/licensing/flossexception
*
* By copying, modifying or distributing this software, you acknowledge
* that you have read and understood your obligations described above,
* and agree to abide by those obligations.
*
* ALL LINDEN LAB SOURCE CODE IS PROVIDED "AS IS." LINDEN LAB MAKES NO
* WARRANTIES, EXPRESS, IMPLIED OR OTHERWISE, REGARDING ITS ACCURACY,
* COMPLETENESS OR PERFORMANCE.
* $/LicenseInfo$
*/
#include "linden_common.h"
#include "llrun.h"
#include "llframetimer.h"
static const LLRunner::run_handle_t INVALID_RUN_HANDLE = 0;
/**
* LLRunner
*/
LLRunner::LLRunner() :
mNextHandle(1)
{
}
LLRunner::~LLRunner()
{
mRunOnce.clear();
mRunEvery.clear();
}
S32 LLRunner::run()
{
// We collect all of the runnables which should be run. Since the
// runnables are allowed to adjust the run list, we need to copy
// them into a temporary structure which then iterates over them
// to call out of this method into the runnables.
F64 now = LLFrameTimer::getTotalSeconds();
run_list_t run_now;
// Collect the run once. We erase the matching ones now because
// it's easier. If we find a reason to keep them around for a
// while, we can restructure this method.
LLRunner::run_list_t::iterator iter = mRunOnce.begin();
for( ; iter != mRunOnce.end(); )
{
if(now > (*iter).mNextRunAt)
{
run_now.push_back(*iter);
iter = mRunOnce.erase(iter);
}
else
{
++iter;
}
}
// Collect the ones that repeat.
iter = mRunEvery.begin();
LLRunner::run_list_t::iterator end = mRunEvery.end();
for( ; iter != end; ++iter )
{
if(now > (*iter).mNextRunAt)
{
(*iter).mNextRunAt = now + (*iter).mIncrement;
run_now.push_back(*iter);
}
}
// Now, run them.
iter = run_now.begin();
end = run_now.end();
for( ; iter != end; ++iter )
{
(*iter).mRunnable->run(this, (*iter).mHandle);
}
return run_now.size();
}
LLRunner::run_handle_t LLRunner::addRunnable(
run_ptr_t runnable,
ERunSchedule schedule,
F64 seconds)
{
if(!runnable) return INVALID_RUN_HANDLE;
run_handle_t handle = mNextHandle++;
F64 next_run = LLFrameTimer::getTotalSeconds() + seconds;
LLRunInfo info(handle, runnable, schedule, next_run, seconds);
switch(schedule)
{
case RUN_IN:
// We could optimize this a bit by sorting this on entry.
mRunOnce.push_back(info);
break;
case RUN_EVERY:
mRunEvery.push_back(info);
break;
default:
handle = INVALID_RUN_HANDLE;
break;
}
return handle;
}
LLRunner::run_ptr_t LLRunner::removeRunnable(LLRunner::run_handle_t handle)
{
LLRunner::run_ptr_t rv;
LLRunner::run_list_t::iterator iter = mRunOnce.begin();
LLRunner::run_list_t::iterator end = mRunOnce.end();
for( ; iter != end; ++iter)
{
if((*iter).mHandle == handle)
{
rv = (*iter).mRunnable;
mRunOnce.erase(iter);
return rv;
}
}
iter = mRunEvery.begin();
end = mRunEvery.end();
for( ; iter != end; ++iter)
{
if((*iter).mHandle == handle)
{
rv = (*iter).mRunnable;
mRunEvery.erase(iter);
return rv;
}
}
return rv;
}
/**
* LLRunner::LLRunInfo
*/
LLRunner::LLRunInfo::LLRunInfo(
run_handle_t handle,
run_ptr_t runnable,
ERunSchedule schedule,
F64 next_run_after,
F64 increment) :
mHandle(handle),
mRunnable(runnable),
mSchedule(schedule),
mNextRunAt(next_run_after),
mIncrement(increment)
{
}
LLRunnable::LLRunnable()
{ }
// virtual
LLRunnable::~LLRunnable()
{ }
|
