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
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
|
// ---------------------------------------------------------------------------80
// ICQ plugin for Miranda Instant Messenger
// ________________________________________
//
// Copyright © 2000,2001 Richard Hughes, Roland Rabien, Tristan Van de Vreede
// Copyright © 2001,2002 Jon Keating, Richard Hughes
// Copyright © 2002,2003,2004 Martin Öberg, Sam Kothari, Robert Rainwater
// Copyright © 2004,2005,2006 Joe Kucera
//
// 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.
//
// -----------------------------------------------------------------------------
//
// File name : $Source: /cvsroot/miranda/miranda/protocols/IcqOscarJ/tlv.c,v $
// Revision : $Revision: 2874 $
// Last change on : $Date: 2006-05-16 23:38:00 +0200 (Tue, 16 May 2006) $
// Last change by : $Author: ghazan $
//
// DESCRIPTION:
//
// Helper functions for Oscar TLV chains
//
// -----------------------------------------------------------------------------
#include "icqoscar.h"
/* set maxTlvs<=0 to get all TLVs in length, or a positive integer to get at most the first n */
oscar_tlv_chain* readIntoTLVChain(BYTE **buf, WORD wLen, int maxTlvs)
{
oscar_tlv_chain *now, *last, *chain = NULL;
WORD now_tlv_len;
int len = wLen;
if (!buf || !wLen) return NULL;
while (len > 0) /* don't use unsigned variable for this check */
{
now = (oscar_tlv_chain *)SAFE_MALLOC(sizeof(oscar_tlv_chain));
if (!now)
{
disposeChain(&chain);
return NULL;
}
unpackWord(buf, &(now->tlv.wType));
unpackWord(buf, &now_tlv_len);
now->tlv.wLen = now_tlv_len;
len -= 4;
if (now_tlv_len < 1)
{
now->tlv.pData = NULL;
}
else if (now_tlv_len <= len)
{
now->tlv.pData = (BYTE *)SAFE_MALLOC(now_tlv_len);
if (now->tlv.pData)
memcpy(now->tlv.pData, *buf, now_tlv_len);
}
else
{ // the packet is shorter than it should be
SAFE_FREE(&now);
return chain; // give at least the rest of chain
}
if (chain) // keep the original order
last->next = now;
else
chain = now;
last = now;
len -= now_tlv_len;
*buf += now_tlv_len;
if (--maxTlvs == 0)
break;
}
return chain;
}
// Returns a pointer to the TLV with type wType and number wIndex in the chain
// If wIndex = 1, the first matching TLV will be returned, if wIndex = 2,
// the second matching one will be returned.
// wIndex must be > 0
oscar_tlv* getTLV(oscar_tlv_chain *list, WORD wType, WORD wIndex)
{
int i = 0;
while (list)
{
if (list->tlv.wType == wType)
i++;
if (i >= wIndex)
return &list->tlv;
list = list->next;
}
return NULL;
}
WORD getLenFromChain(oscar_tlv_chain *list, WORD wType, WORD wIndex)
{
oscar_tlv *tlv;
WORD wLen = 0;
tlv = getTLV(list, wType, wIndex);
if (tlv)
{
wLen = tlv->wLen;
}
return wLen;
}
/* !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! */
/* Values are returned in MSB format */
/* !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! */
DWORD getDWordFromChain(oscar_tlv_chain *list, WORD wType, WORD wIndex)
{
oscar_tlv *tlv;
DWORD dw = 0;
tlv = getTLV(list, wType, wIndex);
if (tlv && tlv->wLen >= 4)
{
dw |= (*((tlv->pData)+0) << 24);
dw |= (*((tlv->pData)+1) << 16);
dw |= (*((tlv->pData)+2) << 8);
dw |= (*((tlv->pData)+3));
}
return dw;
}
WORD getWordFromChain(oscar_tlv_chain *list, WORD wType, WORD wIndex)
{
oscar_tlv *tlv;
WORD w = 0;
tlv = getTLV(list, wType, wIndex);
if (tlv && tlv->wLen >= 2)
{
w |= (*((tlv->pData)+0) << 8);
w |= (*((tlv->pData)+1));
}
return w;
}
BYTE getByteFromChain(oscar_tlv_chain *list, WORD wType, WORD wIndex)
{
oscar_tlv *tlv;
BYTE b = 0;
tlv = getTLV(list, wType, wIndex);
if (tlv && tlv->wLen)
{
b = *(tlv->pData);
}
return b;
}
BYTE* getStrFromChain(oscar_tlv_chain *list, WORD wType, WORD wIndex)
{
oscar_tlv *tlv;
BYTE *str = NULL;
tlv = getTLV(list, wType, wIndex);
if (tlv)
{
str = (BYTE*)SAFE_MALLOC(tlv->wLen+1); /* For \0 */
if (!str) return NULL;
memcpy(str, tlv->pData, tlv->wLen);
*(str+tlv->wLen) = '\0';
}
return str;
}
void disposeChain(oscar_tlv_chain **list)
{
oscar_tlv_chain *now;
if (!list || !*list)
return;
now = *list;
while (now)
{
oscar_tlv_chain *temp;
SAFE_FREE(&now->tlv.pData);
temp = now->next;
SAFE_FREE(&now);
now = temp;
}
*list = NULL;
}
|
