summaryrefslogtreecommitdiff
path: root/plugins/SRMM/cmdlist.cpp
blob: 91d082fc74dcad9c2900f2d7305b97cdbd8e9f44 (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
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
/*
Copyright 2000-2010 Miranda IM project, 
all portions of this codebase are copyrighted to the people 
listed in contributors.txt.

This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the Free Software Foundation; either version 2
of the License, or (at your option) any later version.

This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
*/
#include "commonheaders.h"

int tcmdlist_append(SortedList *list, TCHAR *data)
{
	TCmdList *new_list;
	
	if (!data)
		return list->realCount - 1;

	if (list->realCount >= 20)
	{
		TCmdList* n = (TCmdList*)list->items[0];
		mir_free(n->szCmd);
		mir_free(n);
		List_Remove(list, 0);
	}

	new_list = (TCmdList*)mir_alloc(sizeof(TCmdList));
	new_list->szCmd = mir_tstrdup(data);

	List_InsertPtr(list, new_list);

	return list->realCount - 1;
}

void tcmdlist_free(SortedList *list) 
{
	int i;
	TCmdList** n = (TCmdList**)list->items;

	for (i = 0; i < list->realCount; ++i) 
	{
		mir_free(n[i]->szCmd);
		mir_free(n[i]);
	}
	List_Destroy(list);
	mir_free(list);
}

static SortedList msgQueue = { NULL, 0, 0, 5, NULL };
static CRITICAL_SECTION csMsgQueue;
static UINT_PTR timerId;

void MessageFailureProcess(TMsgQueue *item, const char* err);

static VOID CALLBACK MsgTimer(HWND hwnd, UINT uMsg, UINT_PTR idEvent, DWORD dwTime)
{
	int i, ntl = 0;
	TMsgQueue **tmlst = NULL;
	
	EnterCriticalSection(&csMsgQueue);

	for (i = 0; i < msgQueue.realCount; ++i) 
	{
		TMsgQueue *item = (TMsgQueue*)msgQueue.items[i];
		if (dwTime - item->ts > g_dat->msgTimeout)
		{
			if (!ntl)
				tmlst = (TMsgQueue**)alloca((msgQueue.realCount - i) * sizeof(TMsgQueue*));
			tmlst[ntl++] = item;

			List_Remove(&msgQueue, i--);
		}
	}
	LeaveCriticalSection(&csMsgQueue);

	for (i = 0; i < ntl; ++i) 
		MessageFailureProcess(tmlst[i], LPGEN("The message send timed out."));
}

void msgQueue_add(HANDLE hContact, HANDLE id, const TCHAR* szMsg, HANDLE hDbEvent)
{
	TMsgQueue *item = (TMsgQueue*)mir_alloc(sizeof(TMsgQueue));
	item->hContact = hContact;
	item->id = id;
	item->szMsg = mir_tstrdup(szMsg);
	item->hDbEvent = hDbEvent;
	item->ts = GetTickCount();

	EnterCriticalSection(&csMsgQueue);
	if (!msgQueue.realCount && !timerId)
		timerId = SetTimer(NULL, 0, 5000, MsgTimer);
	List_InsertPtr(&msgQueue, item);
	LeaveCriticalSection(&csMsgQueue);

}

void msgQueue_processack(HANDLE hContact, HANDLE id, BOOL success, const char* szErr)
{
	int i;
	TMsgQueue* item = NULL;;
	
	EnterCriticalSection(&csMsgQueue);

	for (i = 0; i < msgQueue.realCount; ++i) 
	{
		item = (TMsgQueue*)msgQueue.items[i];
		if (item->hContact == hContact && item->id == id)
		{
			List_Remove(&msgQueue, i);

			if (!msgQueue.realCount && timerId)
			{
				KillTimer(NULL, timerId);
				timerId = 0;
			}
			break;
		}
		item = NULL;
	}
	LeaveCriticalSection(&csMsgQueue);
	
	if (item)
	{
		if (success)
		{
			mir_free(item->szMsg);
			mir_free(item);
		}
		else
			MessageFailureProcess(item, szErr);
	}
}

void msgQueue_init(void)
{
	InitializeCriticalSection(&csMsgQueue);
}

void msgQueue_destroy(void)
{
	int i;
	
	EnterCriticalSection(&csMsgQueue);

	for (i = 0; i < msgQueue.realCount; ++i) 
	{
		TMsgQueue* item = (TMsgQueue*)msgQueue.items[i];
		mir_free(item->szMsg);
		mir_free(item);
	}
	List_Destroy(&msgQueue);

	LeaveCriticalSection(&csMsgQueue);

	DeleteCriticalSection(&csMsgQueue);
}