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
|
/**
* @file llmessagethrottle.cpp
* @brief LLMessageThrottle class used for throttling messages.
*
* Copyright (c) 2004-$CurrentYear$, Linden Research, Inc.
* $License$
*/
#include "llhash.h"
#include "llmessagethrottle.h"
#include "llframetimer.h"
// This is used for the stl search_n function.
bool eq_message_throttle_entry(LLMessageThrottleEntry a, LLMessageThrottleEntry b)
{ return a.getHash() == b.getHash(); }
const U64 SEC_TO_USEC = 1000000;
// How long (in microseconds) each type of message stays in its throttle list.
const U64 MAX_MESSAGE_AGE[MTC_EOF] =
{
10 * SEC_TO_USEC, // MTC_VIEWER_ALERT
10 * SEC_TO_USEC // MTC_AGENT_ALERT
};
LLMessageThrottle::LLMessageThrottle()
{
}
LLMessageThrottle::~LLMessageThrottle()
{
}
void LLMessageThrottle::pruneEntries()
{
// Go through each message category, and prune entries older than max age.
S32 cat;
for (cat = 0; cat < MTC_EOF; cat++)
{
message_list_t* message_list = &(mMessageList[cat]);
// Use a reverse iterator, since entries on the back will be the oldest.
message_list_reverse_iterator_t r_iterator = message_list->rbegin();
message_list_reverse_iterator_t r_last = message_list->rend();
// Look for the first entry younger than the maximum age.
F32 max_age = (F32)MAX_MESSAGE_AGE[cat];
BOOL found = FALSE;
while (r_iterator != r_last && !found)
{
if ( LLFrameTimer::getTotalTime() - (*r_iterator).getEntryTime() < max_age )
{
// We found a young enough entry.
found = TRUE;
// Did we find at least one entry to remove?
if (r_iterator != message_list->rbegin())
{
// Yes, remove it.
message_list->erase(r_iterator.base(), message_list->end());
}
}
else
{
r_iterator++;
}
}
// If we didn't find any entries young enough to keep, remove them all.
if (!found)
{
message_list->clear();
}
}
}
BOOL LLMessageThrottle::addViewerAlert(const LLUUID& to, const char* mesg)
{
message_list_t* message_list = &(mMessageList[MTC_VIEWER_ALERT]);
// Concatenate from,to,mesg into one string.
std::ostringstream full_mesg;
full_mesg << to << mesg;
// Create an entry for this message.
size_t hash = llhash<const char*> (full_mesg.str().c_str());
LLMessageThrottleEntry entry(hash, LLFrameTimer::getTotalTime());
// Check if this message is already in the list.
message_list_iterator_t found = std::search_n(message_list->begin(), message_list->end(),
1, entry, eq_message_throttle_entry);
if (found == message_list->end())
{
// This message was not found. Add it to the list.
message_list->push_front(entry);
return TRUE;
}
else
{
// This message was already in the list.
return FALSE;
}
}
BOOL LLMessageThrottle::addAgentAlert(const LLUUID& agent, const LLUUID& task, const char* mesg)
{
message_list_t* message_list = &(mMessageList[MTC_AGENT_ALERT]);
// Concatenate from,to,mesg into one string.
std::ostringstream full_mesg;
full_mesg << agent << task << mesg;
// Create an entry for this message.
size_t hash = llhash<const char*> (full_mesg.str().c_str());
LLMessageThrottleEntry entry(hash, LLFrameTimer::getTotalTime());
// Check if this message is already in the list.
message_list_iterator_t found = std::search_n(message_list->begin(), message_list->end(),
1, entry, eq_message_throttle_entry);
if (found == message_list->end())
{
// This message was not found. Add it to the list.
message_list->push_front(entry);
return TRUE;
}
else
{
// This message was already in the list.
return FALSE;
}
}
|
