|
1 // Copyright (c) 1996-2009 Nokia Corporation and/or its subsidiary(-ies). |
|
2 // All rights reserved. |
|
3 // This component and the accompanying materials are made available |
|
4 // under the terms of "Eclipse Public License v1.0" |
|
5 // which accompanies this distribution, and is available |
|
6 // at the URL "http://www.eclipse.org/legal/epl-v10.html". |
|
7 // |
|
8 // Initial Contributors: |
|
9 // Nokia Corporation - initial contribution. |
|
10 // |
|
11 // Contributors: |
|
12 // |
|
13 // Description: |
|
14 // |
|
15 |
|
16 typedef unsigned char BYTE; // TUint8 |
|
17 typedef unsigned short WORD; // TUint16 |
|
18 typedef unsigned int UINT; // TUint |
|
19 |
|
20 #include <string.h> |
|
21 #include <e32std.h> |
|
22 #include <e32std_private.h> |
|
23 #include "e32uid.h" |
|
24 |
|
25 const UINT crcTab[256] = |
|
26 { |
|
27 0x0000,0x1021,0x2042,0x3063,0x4084,0x50a5,0x60c6,0x70e7,0x8108,0x9129,0xa14a, |
|
28 0xb16b,0xc18c,0xd1ad,0xe1ce,0xf1ef,0x1231,0x0210,0x3273,0x2252,0x52b5,0x4294, |
|
29 0x72f7,0x62d6,0x9339,0x8318,0xb37b,0xa35a,0xd3bd,0xc39c,0xf3ff,0xe3de,0x2462, |
|
30 0x3443,0x0420,0x1401,0x64e6,0x74c7,0x44a4,0x5485,0xa56a,0xb54b,0x8528,0x9509, |
|
31 0xe5ee,0xf5cf,0xc5ac,0xd58d,0x3653,0x2672,0x1611,0x0630,0x76d7,0x66f6,0x5695, |
|
32 0x46b4,0xb75b,0xa77a,0x9719,0x8738,0xf7df,0xe7fe,0xd79d,0xc7bc,0x48c4,0x58e5, |
|
33 0x6886,0x78a7,0x0840,0x1861,0x2802,0x3823,0xc9cc,0xd9ed,0xe98e,0xf9af,0x8948, |
|
34 0x9969,0xa90a,0xb92b,0x5af5,0x4ad4,0x7ab7,0x6a96,0x1a71,0x0a50,0x3a33,0x2a12, |
|
35 0xdbfd,0xcbdc,0xfbbf,0xeb9e,0x9b79,0x8b58,0xbb3b,0xab1a,0x6ca6,0x7c87,0x4ce4, |
|
36 0x5cc5,0x2c22,0x3c03,0x0c60,0x1c41,0xedae,0xfd8f,0xcdec,0xddcd,0xad2a,0xbd0b, |
|
37 0x8d68,0x9d49,0x7e97,0x6eb6,0x5ed5,0x4ef4,0x3e13,0x2e32,0x1e51,0x0e70,0xff9f, |
|
38 0xefbe,0xdfdd,0xcffc,0xbf1b,0xaf3a,0x9f59,0x8f78,0x9188,0x81a9,0xb1ca,0xa1eb, |
|
39 0xd10c,0xc12d,0xf14e,0xe16f,0x1080,0x00a1,0x30c2,0x20e3,0x5004,0x4025,0x7046, |
|
40 0x6067,0x83b9,0x9398,0xa3fb,0xb3da,0xc33d,0xd31c,0xe37f,0xf35e,0x02b1,0x1290, |
|
41 0x22f3,0x32d2,0x4235,0x5214,0x6277,0x7256,0xb5ea,0xa5cb,0x95a8,0x8589,0xf56e, |
|
42 0xe54f,0xd52c,0xc50d,0x34e2,0x24c3,0x14a0,0x0481,0x7466,0x6447,0x5424,0x4405, |
|
43 0xa7db,0xb7fa,0x8799,0x97b8,0xe75f,0xf77e,0xc71d,0xd73c,0x26d3,0x36f2,0x0691, |
|
44 0x16b0,0x6657,0x7676,0x4615,0x5634,0xd94c,0xc96d,0xf90e,0xe92f,0x99c8,0x89e9, |
|
45 0xb98a,0xa9ab,0x5844,0x4865,0x7806,0x6827,0x18c0,0x08e1,0x3882,0x28a3,0xcb7d, |
|
46 0xdb5c,0xeb3f,0xfb1e,0x8bf9,0x9bd8,0xabbb,0xbb9a,0x4a75,0x5a54,0x6a37,0x7a16, |
|
47 0x0af1,0x1ad0,0x2ab3,0x3a92,0xfd2e,0xed0f,0xdd6c,0xcd4d,0xbdaa,0xad8b,0x9de8, |
|
48 0x8dc9,0x7c26,0x6c07,0x5c64,0x4c45,0x3ca2,0x2c83,0x1ce0,0x0cc1,0xef1f,0xff3e, |
|
49 0xcf5d,0xdf7c,0xaf9b,0xbfba,0x8fd9,0x9ff8,0x6e17,0x7e36,0x4e55,0x5e74,0x2e93, |
|
50 0x3eb2,0x0ed1,0x1ef0 |
|
51 }; |
|
52 |
|
53 void Crc(WORD& aCrc,const void* aPtr,int aLength) |
|
54 // |
|
55 // Perform a CCITT CRC checksum. |
|
56 // |
|
57 { |
|
58 |
|
59 const BYTE* pB=(const BYTE*)aPtr; |
|
60 const BYTE* pE=pB+aLength; |
|
61 UINT crc=aCrc; |
|
62 while (pB<pE) |
|
63 crc=(crc<<8)^crcTab[((crc>>8)^*pB++)&0xff]; |
|
64 aCrc=(WORD)crc; |
|
65 } |
|
66 |
|
67 UINT checkSum(const void* aPtr) |
|
68 // |
|
69 // Checksum every other byte |
|
70 // |
|
71 { |
|
72 |
|
73 const BYTE* pB=(const BYTE*)aPtr; |
|
74 const BYTE* pE=pB+(KMaxCheckedUid*sizeof(TUid)); |
|
75 BYTE buf[(KMaxCheckedUid*sizeof(TUid))>>1]; |
|
76 BYTE* pT=(&buf[0]); |
|
77 while (pB<pE) |
|
78 { |
|
79 *pT++=(*pB); |
|
80 pB+=2; |
|
81 } |
|
82 WORD crc=0; |
|
83 Crc(crc,&buf[0],(KMaxCheckedUid*sizeof(TUid))>>1); |
|
84 return(crc); |
|
85 } |
|
86 |
|
87 int TUid::operator==(const TUid& aUid) const |
|
88 // |
|
89 // Compare UID's for equality |
|
90 // |
|
91 { |
|
92 |
|
93 return(iUid==aUid.iUid); |
|
94 } |
|
95 |
|
96 int TUid::operator!=(const TUid& aUid) const |
|
97 // |
|
98 // Compare UID's for equality |
|
99 // |
|
100 { |
|
101 |
|
102 return(iUid!=aUid.iUid); |
|
103 } |
|
104 |
|
105 TUidType::TUidType() |
|
106 // |
|
107 // Constructor |
|
108 // |
|
109 { |
|
110 |
|
111 memset(this,0,sizeof(TUidType)); |
|
112 } |
|
113 |
|
114 TUidType::TUidType(TUid aUid1) |
|
115 // |
|
116 // Constructor |
|
117 // |
|
118 { |
|
119 |
|
120 |
|
121 memset(this,0,sizeof(TUidType)); |
|
122 iUid[0]=aUid1; |
|
123 } |
|
124 |
|
125 TUidType::TUidType(TUid aUid1,TUid aUid2) |
|
126 // |
|
127 // Constructor |
|
128 // |
|
129 { |
|
130 |
|
131 iUid[0]=aUid1; |
|
132 iUid[1]=aUid2; |
|
133 iUid[2]=KNullUid; |
|
134 } |
|
135 |
|
136 TUidType::TUidType(TUid aUid1,TUid aUid2,TUid aUid3) |
|
137 // |
|
138 // Constructor |
|
139 // |
|
140 { |
|
141 |
|
142 |
|
143 iUid[0]=aUid1; |
|
144 iUid[1]=aUid2; |
|
145 iUid[2]=aUid3; |
|
146 } |
|
147 |
|
148 int TUidType::operator==(const TUidType& aUidType) const |
|
149 // |
|
150 // TRUE if equal. |
|
151 // |
|
152 { |
|
153 |
|
154 return(iUid[0]==aUidType.iUid[0] && |
|
155 iUid[1]==aUidType.iUid[1] && |
|
156 iUid[2]==aUidType.iUid[2]); |
|
157 } |
|
158 |
|
159 int TUidType::operator!=(const TUidType& aUidType) const |
|
160 // |
|
161 // TRUE if not equal. |
|
162 // |
|
163 { |
|
164 |
|
165 |
|
166 return(!(*this==aUidType)); |
|
167 } |
|
168 |
|
169 const TUid& TUidType::operator[](int anIndex) const |
|
170 // |
|
171 // Array operator. |
|
172 // |
|
173 { |
|
174 |
|
175 return(iUid[anIndex]); |
|
176 } |
|
177 |
|
178 TUid TUidType::MostDerived() const |
|
179 // |
|
180 // Return the most derived type |
|
181 // |
|
182 { |
|
183 |
|
184 if (iUid[2]!=KNullUid) |
|
185 return(iUid[2]); |
|
186 if (iUid[1]!=KNullUid) |
|
187 return(iUid[1]); |
|
188 return(iUid[0]); |
|
189 } |
|
190 |
|
191 int TUidType::IsPresent(TUid aUid) const |
|
192 // |
|
193 // TRUE if aUid is present as any type. |
|
194 // |
|
195 { |
|
196 |
|
197 return(iUid[0]==aUid || iUid[1]==aUid || iUid[2]==aUid); |
|
198 } |
|
199 |
|
200 int TUidType::IsValid() const |
|
201 // |
|
202 // TRUE if one of the type is not NULL. |
|
203 // |
|
204 { |
|
205 |
|
206 return(MostDerived()!=KNullUid); |
|
207 } |
|
208 |
|
209 TCheckedUid::TCheckedUid() |
|
210 // |
|
211 // Constructor |
|
212 // |
|
213 { |
|
214 |
|
215 memset(this,0,sizeof(TCheckedUid)); |
|
216 } |
|
217 |
|
218 TCheckedUid::TCheckedUid(const TUidType& aUidType) |
|
219 // |
|
220 // Constructor |
|
221 // |
|
222 { |
|
223 |
|
224 Set(aUidType); |
|
225 } |
|
226 |
|
227 void TCheckedUid::Set(const TUidType& aUidType) |
|
228 // |
|
229 // Set from a aUidType |
|
230 // |
|
231 { |
|
232 |
|
233 iType=aUidType; |
|
234 iCheck=Check(); |
|
235 } |
|
236 |
|
237 UINT TCheckedUid::Check() const |
|
238 // |
|
239 // Return the checksum of the UIDs |
|
240 // |
|
241 { |
|
242 |
|
243 return((checkSum(((BYTE*)this)+1)<<16)|checkSum((BYTE*)this)); |
|
244 } |
|
245 |