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
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
|
/*
* Copyright (c) 2003 Rozhuk Ivan <rozhuk.im@gmail.com>
* All rights reserved.
*
* 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.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``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 REGENTS OR CONTRIBUTORS 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.
*
*/
#if !defined(AFX_LIST_MT__H__INCLUDED_)
#define AFX_LIST_MT__H__INCLUDED_
#pragma once
#include "Sdk/InterlockedFunctions.h"
#pragma warning(push)
#pragma warning(disable:4312) // warning C4312: 'type cast' : conversion from 'LONG' to 'PVOID' of greater size
// ñòðóêòóðà äëÿ ðàáîòû ñî ñïèñêîì, ýëåìåíò ñïèñêà
typedef struct _LIST_MT_ITEM
{
#ifdef __cplusplus
_LIST_MT_ITEM *plmtiPrev; // *ïðåäûäóùèé ýëåìåíò â ñïèñêå
_LIST_MT_ITEM *plmtiNext; // *ñëåäóþùèé ýëåìåíò â ñïèñêå
#else
LPVOID *plmtiPrev; // *ïðåäûäóùèé ýëåìåíò â ñïèñêå
LPVOID *plmtiNext; // *ñëåäóþùèé ýëåìåíò â ñïèñêå
#endif
LPVOID lpListMT; // óêàçàòåëü íà çàãîëîâîê ñïèñêà, ñì ñòðóêòóðó íèæå
LPVOID lpData; // óêàçàòåëü íà äàííûå, ñâÿçàííûå ñ ýëåìåíòîì ñïèñêà
}LIST_MT_ITEM, *PLIST_MT_ITEM, *LPLIST_MT_ITEM;
typedef CONST PLIST_MT_ITEM PCLIST_MT_ITEM, LPCLIST_MT_ITEM;
// ñòðóêòóðà äëÿ ðàáîòû ñî ñïèñêîì, çàãîëîâîê ñïèñêà
typedef struct _LIST_MT : public MZeroedObject
{
size_t nCount; // *êîëè÷åñòâî ýëåìåíòîâ â ñïèñêå
PLIST_MT_ITEM plmtiFirst; // *óêàçûâàåò íà ïåðâûé ýëåìåíò â ñïèñêå
PLIST_MT_ITEM plmtiLast; // *óêàçûâàåò íà ïîñëåäíèé ýëåìåíò â ñïèñêå
mir_cs cs; // *section for exclysive access to List
}LIST_MT, *PLIST_MT, *LPLIST_MT;
typedef CONST PLIST_MT PCLIST_MT, LPCLIST_MT;
// ñòðóêòóðà äëÿ ðàáîòû ñ èòåðàòîðîì
typedef struct _LIST_MT_ITERATOR
{
PLIST_MT_ITEM plmtListMTItem;
}LIST_MT_ITERATOR, *PLIST_MT_ITERATOR, *LPLIST_MT_ITERATOR;
//typedef LIST_MT_ITEM LIST_MT_ITERATOR, *PLIST_MT_ITERATOR, *LPLIST_MT_ITERATOR;
typedef CONST PLIST_MT_ITERATOR PCLIST_MT_ITERATOR, LPCLIST_MT_ITERATOR;
__inline size_t ListMTGetCount(PCLIST_MT pclmtListMT)
{
return((size_t)InterlockedCompareExchangePointer((LPVOID*)&pclmtListMT->nCount,NULL,NULL));
}
__inline size_t ListMTItemAdd(PCLIST_MT pclmtListMT,PCLIST_MT_ITEM pclmtListMTItem,LPVOID lpData)
{
size_t dwRet=(size_t)InterlockedIncrementPointer(&pclmtListMT->nCount);//pclmtListMT->nCount++;
pclmtListMTItem->lpData=lpData;
pclmtListMTItem->lpListMT=pclmtListMT;
if (pclmtListMT->plmtiLast)
{// add node to end of list
pclmtListMTItem->plmtiPrev=pclmtListMT->plmtiLast;
pclmtListMTItem->plmtiNext=NULL;
pclmtListMT->plmtiLast->plmtiNext=pclmtListMTItem;
pclmtListMT->plmtiLast=pclmtListMTItem;
}else{// add the first node to the linked list
pclmtListMTItem->plmtiPrev=NULL;
pclmtListMTItem->plmtiNext=NULL;
pclmtListMT->plmtiFirst=pclmtListMTItem;
pclmtListMT->plmtiLast=pclmtListMTItem;
}
return(dwRet);
}
__inline DWORD ListMTItemDelete(PCLIST_MT pclmtListMT,PCLIST_MT_ITEM pclmtListMTItem)
{
DWORD dwRetErrorCode;
if (pclmtListMTItem->lpListMT==pclmtListMT && pclmtListMT)
{// Äàííûé ýëåìåíò ïðèíàäëåæèò ê ýòîìó ñïèñêó, ìîæíî óäàëèòü.
PLIST_MT_ITEM plmtiPrevNode=pclmtListMTItem->plmtiPrev,plmtiNextNode=pclmtListMTItem->plmtiNext;
if (plmtiPrevNode || plmtiNextNode)
{
if (plmtiPrevNode && plmtiNextNode==NULL)
{// This is the start node in the list to delete
// îòêëþ÷èëñÿ ïîñëåäíèé ïîäêëþ÷èâøèéñÿ
plmtiPrevNode->plmtiNext=NULL;
pclmtListMT->plmtiLast=plmtiPrevNode;
}else{
if (plmtiPrevNode==NULL && plmtiNextNode)
{// This is the end node in the list to delete
// îòêëþ÷èëñÿ ïåðâûé ïîäêëþ÷èâøèéñÿ
plmtiNextNode->plmtiPrev=NULL;
pclmtListMT->plmtiFirst=plmtiNextNode;
}else{// îêëþ÷èëñÿ êëèåíò íå ïåðâûé è íå ïîñëåäíèé
//if (plmtiPrev && plmtiNext)
{// Neither start node nor end node in the list
plmtiPrevNode->plmtiNext=plmtiNextNode;
plmtiNextNode->plmtiPrev=plmtiPrevNode;
}
}
}
}else{// This is the only node in the list to delete
pclmtListMT->plmtiFirst=NULL;
pclmtListMT->plmtiLast=NULL;
}
pclmtListMTItem->lpListMT=NULL;
InterlockedDecrementPointer(&pclmtListMT->nCount);// pclmtListMT->nCount--;
dwRetErrorCode=NO_ERROR;
}else{// ïîïûòàëèñü óäàëèòü ýëåìåíò íå îòíîñÿùèéñÿ ê äàííîìó ñïèñêó
dwRetErrorCode=ERROR_INVALID_HANDLE;
}
return(dwRetErrorCode);
}
__inline DWORD ListMTItemGetFirst(PCLIST_MT pclmtListMT,PLIST_MT_ITEM *pplmtListMTItem,LPVOID *plpData)
{// åñëè íóæíî ãàðàíòèðîâàòü ýêñêëþçèâíûé äîñòóï, òî åñòü ListMTLock è ListMTUnLock
DWORD dwRetErrorCode;
if (pclmtListMT->plmtiFirst)
{
if (pplmtListMTItem) (*pplmtListMTItem)=pclmtListMT->plmtiFirst;
if (plpData) (*plpData)=pclmtListMT->plmtiFirst->lpData;
dwRetErrorCode=NO_ERROR;
}else{
dwRetErrorCode=ERROR_NO_MORE_ITEMS;
}
return(dwRetErrorCode);
}
__inline BOOL ListMTIteratorMoveFirst(PCLIST_MT pclmtListMT,PCLIST_MT_ITERATOR pclmtiIterator)
{// åñëè íóæíî ãàðàíòèðîâàòü ýêñêëþçèâíûé äîñòóï, òî åñòü ListMTLock è ListMTUnLock
return((pclmtiIterator->plmtListMTItem=pclmtListMT->plmtiFirst)? TRUE:FALSE);
}
__inline BOOL ListMTIteratorMoveNext(PCLIST_MT_ITERATOR pclmtiIterator)
{// åñëè íóæíî ãàðàíòèðîâàòü ýêñêëþçèâíûé äîñòóï, òî åñòü ListMTLock è ListMTUnLock
BOOL bRet=FALSE;
if (pclmtiIterator->plmtListMTItem)
{
if (pclmtiIterator->plmtListMTItem=pclmtiIterator->plmtListMTItem->plmtiNext) bRet=TRUE;
}
return(bRet);
}
__inline DWORD ListMTIteratorGet(PCLIST_MT_ITERATOR pclmtiIterator,PLIST_MT_ITEM *pplmtListMTItem,LPVOID *plpData)
{// åñëè íóæíî ãàðàíòèðîâàòü ýêñêëþçèâíûé äîñòóï, òî åñòü ListMTLock è ListMTUnLock
DWORD dwRetErrorCode;
if (pclmtiIterator->plmtListMTItem)
{
if (pplmtListMTItem) (*pplmtListMTItem)=pclmtiIterator->plmtListMTItem;
if (plpData) (*plpData)=pclmtiIterator->plmtListMTItem->lpData;
dwRetErrorCode=NO_ERROR;
}else{
dwRetErrorCode=ERROR_NO_MORE_ITEMS;
}
return(dwRetErrorCode);
}
#pragma warning(pop)
#pragma warning(default:4312) // warning C4312: 'type cast' : conversion from 'LONG' to 'PVOID' of greater size
#endif // !defined(AFX_LIST_MT__H__INCLUDED_)
|
