1 files changed, 135 insertions, 0 deletions
diff --git a/indra/llmessage/llmessagethrottle.cpp b/indra/llmessage/llmessagethrottle.cpp
new file mode 100644
index 0000000000..0cfaac3276
--- /dev/null
+++ b/indra/llmessage/llmessagethrottle.cpp
@@ -0,0 +1,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;
+	}
+}
+