Mercurial > libpst
annotate src/libpst.c @ 36:6fe121a971c9 stable-0-5-7
valgrind fixes
| author | carl |
|---|---|
| date | Thu, 09 Aug 2007 15:46:34 -0700 |
| parents | b2f247463b83 |
| children | 2ad7ef0a3c4f |
| rev | line source |
|---|---|
| 16 | 1 /*** |
| 2 * libpst.c | |
| 3 * Part of the LibPST project | |
| 4 * Written by David Smith | |
| 5 * dave.s@earthcorp.com | |
| 6 */ | |
| 7 #include <stdio.h> | |
| 8 #include <stdlib.h> | |
| 9 #include <time.h> | |
| 10 #include <string.h> | |
| 11 #include <ctype.h> | |
| 12 #include <limits.h> | |
| 13 #include <wchar.h> | |
| 14 | |
| 15 #include <errno.h> | |
|
33
12cac756bc05
enable -d option, but if not specified, don't generate a debug file
carl
parents:
31
diff
changeset
|
16 #include <sys/stat.h> // mkdir |
|
12cac756bc05
enable -d option, but if not specified, don't generate a debug file
carl
parents:
31
diff
changeset
|
17 #include <fcntl.h> // for Win32 definition of _O_BINARY |
| 16 | 18 #include "define.h" |
| 19 #include "libstrfunc.h" | |
| 20 | |
| 21 #ifdef _MSC_VER | |
| 22 # include <windows.h> | |
| 23 #else | |
| 24 # include <unistd.h> | |
| 25 #endif //ifdef _MSC_VER | |
| 26 | |
| 27 #include "libpst.h" | |
| 28 #include "timeconv.h" | |
| 29 | |
| 30 #define FILE_SIZE_POINTER 0xA8 | |
| 31 #define INDEX_POINTER 0xC4 | |
| 32 #define SECOND_POINTER 0xBC | |
| 33 // the encryption setting could be at 0x1CC. Will require field testing | |
| 34 #define ENC_OFFSET 0x1CD | |
| 35 // says the type of index we have | |
| 36 #define INDEX_TYPE_OFFSET 0x0A | |
| 37 | |
| 38 // for the 64bit 2003 outlook PST we need new file offsets | |
| 39 // perhaps someone can figure out the header format for the pst files... | |
| 40 #define FILE_SIZE_POINTER_64 0xB8 | |
| 41 #define INDEX_POINTER_64 0xF0 | |
| 42 #define SECOND_POINTER_64 0xE0 | |
| 43 | |
| 44 #define PST_SIGNATURE 0x4E444221 | |
| 45 | |
| 46 struct _pst_table_ptr_struct{ | |
| 35 | 47 int32_t start; |
| 16 | 48 int32_t u1; |
| 49 int32_t offset; | |
| 50 }; | |
| 51 | |
| 52 typedef struct _pst_block_header { | |
| 53 int16_t type; | |
| 54 int16_t count; | |
| 55 } pst_block_header; | |
| 56 | |
| 57 typedef struct _pst_id2_assoc { | |
| 35 | 58 u_int32_t id2; |
| 59 u_int32_t id; | |
| 16 | 60 int32_t table2; |
| 61 } pst_id2_assoc; | |
| 62 | |
| 35 | 63 // this is an array of the un-encrypted values. the un-encrypted value is in the position |
| 16 | 64 // of the encrypted value. ie the encrypted value 0x13 represents 0x02 |
| 65 // 0 1 2 3 4 5 6 7 | |
| 66 // 8 9 a b c d e f | |
| 67 unsigned char comp_enc [] = | |
| 68 { 0x47, 0xf1, 0xb4, 0xe6, 0x0b, 0x6a, 0x72, 0x48, | |
| 69 0x85, 0x4e, 0x9e, 0xeb, 0xe2, 0xf8, 0x94, 0x53, /*0x0f*/ | |
| 70 0xe0, 0xbb, 0xa0, 0x02, 0xe8, 0x5a, 0x09, 0xab, | |
| 71 0xdb, 0xe3, 0xba, 0xc6, 0x7c, 0xc3, 0x10, 0xdd, /*0x1f*/ | |
| 72 0x39, 0x05, 0x96, 0x30, 0xf5, 0x37, 0x60, 0x82, | |
| 73 0x8c, 0xc9, 0x13, 0x4a, 0x6b, 0x1d, 0xf3, 0xfb, /*0x2f*/ | |
| 74 0x8f, 0x26, 0x97, 0xca, 0x91, 0x17, 0x01, 0xc4, | |
| 75 0x32, 0x2d, 0x6e, 0x31, 0x95, 0xff, 0xd9, 0x23, /*0x3f*/ | |
| 76 0xd1, 0x00, 0x5e, 0x79, 0xdc, 0x44, 0x3b, 0x1a, | |
| 77 0x28, 0xc5, 0x61, 0x57, 0x20, 0x90, 0x3d, 0x83, /*0x4f*/ | |
| 78 0xb9, 0x43, 0xbe, 0x67, 0xd2, 0x46, 0x42, 0x76, | |
| 79 0xc0, 0x6d, 0x5b, 0x7e, 0xb2, 0x0f, 0x16, 0x29, /*0x5f*/ | |
| 80 0x3c, 0xa9, 0x03, 0x54, 0x0d, 0xda, 0x5d, 0xdf, | |
| 81 0xf6, 0xb7, 0xc7, 0x62, 0xcd, 0x8d, 0x06, 0xd3, /*0x6f*/ | |
| 82 0x69, 0x5c, 0x86, 0xd6, 0x14, 0xf7, 0xa5, 0x66, | |
| 83 0x75, 0xac, 0xb1, 0xe9, 0x45, 0x21, 0x70, 0x0c, /*0x7f*/ | |
| 84 0x87, 0x9f, 0x74, 0xa4, 0x22, 0x4c, 0x6f, 0xbf, | |
| 85 0x1f, 0x56, 0xaa, 0x2e, 0xb3, 0x78, 0x33, 0x50, /*0x8f*/ | |
| 86 0xb0, 0xa3, 0x92, 0xbc, 0xcf, 0x19, 0x1c, 0xa7, | |
| 87 0x63, 0xcb, 0x1e, 0x4d, 0x3e, 0x4b, 0x1b, 0x9b, /*0x9f*/ | |
| 88 0x4f, 0xe7, 0xf0, 0xee, 0xad, 0x3a, 0xb5, 0x59, | |
| 89 0x04, 0xea, 0x40, 0x55, 0x25, 0x51, 0xe5, 0x7a, /*0xaf*/ | |
| 90 0x89, 0x38, 0x68, 0x52, 0x7b, 0xfc, 0x27, 0xae, | |
| 91 0xd7, 0xbd, 0xfa, 0x07, 0xf4, 0xcc, 0x8e, 0x5f, /*0xbf*/ | |
| 92 0xef, 0x35, 0x9c, 0x84, 0x2b, 0x15, 0xd5, 0x77, | |
| 93 0x34, 0x49, 0xb6, 0x12, 0x0a, 0x7f, 0x71, 0x88, /*0xcf*/ | |
| 94 0xfd, 0x9d, 0x18, 0x41, 0x7d, 0x93, 0xd8, 0x58, | |
| 95 0x2c, 0xce, 0xfe, 0x24, 0xaf, 0xde, 0xb8, 0x36, /*0xdf*/ | |
| 96 0xc8, 0xa1, 0x80, 0xa6, 0x99, 0x98, 0xa8, 0x2f, | |
| 97 0x0e, 0x81, 0x65, 0x73, 0xe4, 0xc2, 0xa2, 0x8a, /*0xef*/ | |
| 98 0xd4, 0xe1, 0x11, 0xd0, 0x08, 0x8b, 0x2a, 0xf2, | |
| 99 0xed, 0x9a, 0x64, 0x3f, 0xc1, 0x6c, 0xf9, 0xec}; /*0xff*/ | |
| 100 | |
| 101 int32_t pst_open(pst_file *pf, char *name, char *mode) { | |
| 102 u_int32_t sig; | |
| 103 | |
| 104 DEBUG_ENT("pst_open"); | |
| 105 | |
| 106 if (!pf) { | |
| 107 WARN (("cannot be passed a NULL pst_file\n")); | |
| 108 DEBUG_RET(); | |
| 109 return -1; | |
| 110 } | |
| 111 memset(pf, 0, sizeof(pst_file)); | |
| 112 | |
| 31 | 113 #ifdef _MSC_VER |
| 114 // set the default open mode for windows | |
| 115 _fmode = _O_BINARY; | |
| 116 #endif //_MSC_VER | |
| 16 | 117 if ((pf->fp = fopen(name, mode)) == NULL) { |
| 118 WARN(("cannot open PST file. Error\n")); | |
| 119 DEBUG_RET(); | |
| 120 return -1; | |
| 121 } | |
| 31 | 122 |
| 123 // Check pst file magic | |
| 16 | 124 if (fread(&sig, sizeof(sig), 1, pf->fp) == 0) { |
| 125 fclose(pf->fp); | |
| 126 WARN(("cannot read signature from PST file. Closing on error\n")); | |
| 127 DEBUG_RET(); | |
| 128 return -1; | |
| 129 } | |
| 31 | 130 LE32_CPU(sig); // architecture independant byte-swapping (little, big, pdp) |
| 16 | 131 DEBUG_INFO(("sig = %X\n", sig)); |
| 132 if (sig != PST_SIGNATURE) { | |
| 133 fclose(pf->fp); | |
| 134 WARN(("not a PST file that I know. Closing with error\n")); | |
| 135 DEBUG_RET(); | |
| 136 return -1; | |
| 137 } | |
| 31 | 138 |
| 139 // read index type | |
| 16 | 140 _pst_getAtPos(pf->fp, INDEX_TYPE_OFFSET, &(pf->ind_type), sizeof(unsigned char)); |
| 141 DEBUG_INFO(("index_type = %i\n", pf->ind_type)); | |
| 142 if (pf->ind_type != 0x0E) { | |
| 143 WARN(("unknown index structure. Could this be a new Outlook 2003 PST file?\n")); | |
| 144 DEBUG_RET(); | |
| 145 return -1; | |
| 146 } | |
| 147 | |
| 31 | 148 // read encryption setting |
| 16 | 149 _pst_getAtPos(pf->fp, ENC_OFFSET, &(pf->encryption), sizeof(unsigned char)); |
| 150 DEBUG_INFO(("encrypt = %i\n", pf->encryption)); | |
| 151 | |
| 152 _pst_getAtPos(pf->fp, SECOND_POINTER-4, &(pf->index2_count), sizeof(pf->index2_count)); | |
| 153 _pst_getAtPos(pf->fp, SECOND_POINTER, &(pf->index2), sizeof(pf->index2)); | |
| 154 LE32_CPU(pf->index2_count); | |
| 155 LE32_CPU(pf->index2); | |
| 156 DEBUG_INFO(("Pointer2 is %#X, count %i[%#x]\n", pf->index2, pf->index2_count, pf->index2_count)); | |
| 157 | |
| 158 _pst_getAtPos(pf->fp, FILE_SIZE_POINTER, &(pf->size), sizeof(pf->size)); | |
| 159 LE32_CPU(pf->size); | |
| 160 | |
| 161 _pst_getAtPos(pf->fp, INDEX_POINTER-4, &(pf->index1_count), sizeof(pf->index1_count)); | |
| 162 _pst_getAtPos(pf->fp, INDEX_POINTER, &(pf->index1), sizeof(pf->index1)); | |
| 163 LE32_CPU(pf->index1_count); | |
| 164 LE32_CPU(pf->index1); | |
| 165 DEBUG_INFO(("Pointer1 is %#X, count %i[%#x]\n", pf->index1, pf->index1_count, pf->index1_count)); | |
| 166 | |
| 167 DEBUG_RET(); | |
| 168 return 0; | |
| 169 } | |
| 170 | |
| 171 | |
| 172 int32_t pst_close(pst_file *pf) { | |
| 173 DEBUG_ENT("pst_close"); | |
| 174 if (!pf->fp) { | |
| 175 WARN(("cannot close NULL fp\n")); | |
| 176 DEBUG_RET(); | |
| 177 return -1; | |
| 178 } | |
| 179 if (fclose(pf->fp)) { | |
| 180 WARN(("fclose returned non-zero value\n")); | |
| 181 DEBUG_RET(); | |
| 182 return -1; | |
| 183 } | |
| 184 // we must free the id linklist and the desc tree | |
| 185 _pst_free_id (pf->i_head); | |
| 186 _pst_free_desc (pf->d_head); | |
| 187 _pst_free_xattrib (pf->x_head); | |
| 188 DEBUG_RET(); | |
| 189 return 0; | |
| 190 } | |
| 191 | |
| 192 | |
| 193 pst_desc_ll* pst_getTopOfFolders(pst_file *pf, pst_item *root) { | |
| 194 pst_desc_ll *ret; | |
| 195 DEBUG_ENT("pst_getTopOfFolders"); | |
| 196 if (!root || !root->message_store) { | |
| 197 DEBUG_INDEX(("There isn't a top of folder record here.\n")); | |
| 198 ret = NULL; | |
| 199 } else if (!root->message_store->top_of_personal_folder) { | |
| 200 // this is the OST way | |
| 201 // ASSUMPTION: Top Of Folders record in PST files is *always* descid 0x2142 | |
| 202 ret = _pst_getDptr(pf, 0x2142); | |
| 203 } else { | |
| 204 ret = _pst_getDptr(pf, root->message_store->top_of_personal_folder->id); | |
| 205 } | |
| 206 DEBUG_RET(); | |
| 207 return ret; | |
| 208 } | |
| 209 | |
| 210 | |
| 211 int32_t pst_attach_to_mem(pst_file *pf, pst_item_attach *attach, unsigned char **b){ | |
| 212 int32_t size=0; | |
| 213 pst_index_ll *ptr; | |
| 214 struct holder h = {b, NULL, 0, "", 0}; | |
| 215 DEBUG_ENT("pst_attach_to_mem"); | |
| 216 if (attach->id_val != -1) { | |
| 217 ptr = _pst_getID(pf, attach->id_val); | |
| 218 if (ptr) { | |
| 219 size = _pst_ff_getID2data(pf, ptr, &h); | |
| 220 } else { | |
| 221 DEBUG_WARN(("Couldn't find ID pointer. Cannot handle attachment\n")); | |
| 31 | 222 size = 0; |
| 16 | 223 } |
| 31 | 224 attach->size = size; // may as well update it to what is correct for this instance |
| 16 | 225 } else { |
| 226 size = attach->size; | |
| 227 } | |
| 228 DEBUG_RET(); | |
| 229 return size; | |
| 230 } | |
| 231 | |
| 232 | |
| 233 int32_t pst_attach_to_file(pst_file *pf, pst_item_attach *attach, FILE* fp) { | |
| 234 pst_index_ll *ptr; | |
| 235 struct holder h = {NULL, fp, 0, "", 0}; | |
| 236 int32_t size; | |
| 237 DEBUG_ENT("pst_attach_to_file"); | |
| 238 if (attach->id_val != -1) { | |
| 239 ptr = _pst_getID(pf, attach->id_val); | |
| 240 if (ptr) { | |
| 241 size = _pst_ff_getID2data(pf, ptr, &h); | |
| 242 } else { | |
| 243 DEBUG_WARN(("Couldn't find ID pointer. Cannot save attachment to file\n")); | |
| 31 | 244 size = 0; |
| 16 | 245 } |
| 246 attach->size = size; | |
| 247 } else { | |
| 248 // save the attachment to file | |
| 249 size = attach->size; | |
| 250 pst_fwrite(attach->data, 1, size, fp); | |
| 251 } | |
| 252 DEBUG_RET(); | |
| 253 return 1; | |
| 254 } | |
| 255 | |
| 256 | |
| 257 int32_t pst_attach_to_file_base64(pst_file *pf, pst_item_attach *attach, FILE* fp) { | |
| 258 pst_index_ll *ptr; | |
| 259 struct holder h = {NULL, fp, 1, "", 0}; | |
| 260 int32_t size; | |
| 261 char *c; | |
| 262 DEBUG_ENT("pst_attach_to_file_base64"); | |
| 263 if (attach->id_val != -1) { | |
| 264 ptr = _pst_getID(pf, attach->id_val); | |
| 265 if (ptr) { | |
| 266 size = _pst_ff_getID2data(pf, ptr, &h); | |
| 267 // will need to encode any bytes left over | |
| 268 c = base64_encode(h.base64_extra_chars, h.base64_extra); | |
| 31 | 269 if (c) pst_fwrite(c, 1, strlen(c), fp); |
| 16 | 270 } else { |
| 271 DEBUG_WARN (("Couldn't find ID pointer. Cannot save attachement to Base64\n")); | |
| 31 | 272 size = 0; |
| 16 | 273 } |
| 274 attach->size = size; | |
| 275 } else { | |
| 276 // encode the attachment to the file | |
| 277 c = base64_encode(attach->data, attach->size); | |
| 31 | 278 if (c) pst_fwrite(c, 1, strlen(c), fp); |
| 16 | 279 size = attach->size; |
| 280 } | |
| 281 DEBUG_RET(); | |
| 282 return 1; | |
| 283 } | |
| 284 | |
| 285 | |
| 286 int32_t pst_load_index (pst_file *pf) { | |
| 287 int32_t x; | |
| 288 u_int32_t y; | |
| 289 DEBUG_ENT("pst_load_index"); | |
| 290 if (!pf) { | |
| 291 WARN(("Cannot load index for a NULL pst_file\n")); | |
| 292 DEBUG_RET(); | |
| 293 return -1; | |
| 294 } | |
| 295 | |
|
34
07177825c91b
fix signed/unsigned to allow very small pst files with only leaf nodes
carl
parents:
33
diff
changeset
|
296 x = _pst_build_id_ptr(pf, pf->index1, 0, pf->index1_count, 0, INT32_MAX); |
| 16 | 297 DEBUG_INDEX(("build id ptr returns %i\n", x)); |
| 298 | |
| 299 y = 0; | |
| 300 x = _pst_build_desc_ptr(pf, pf->index2, 0, pf->index2_count, &y, 0x21, INT32_MAX); | |
| 301 DEBUG_INDEX(("build desc ptr returns %i\n", x)); | |
| 302 | |
| 303 DEBUG_CODE(_pst_printDptr(pf);); | |
| 304 DEBUG_RET(); | |
| 305 return 0; | |
| 306 } | |
| 307 | |
| 308 | |
| 309 pst_desc_ll* pst_getNextDptr(pst_desc_ll* d) { | |
| 310 pst_desc_ll* r = NULL; | |
| 311 DEBUG_ENT("pst_getNextDptr"); | |
| 312 if (d) { | |
| 313 if ((r = d->child) == NULL) { | |
| 314 while (!d->next && d->parent) d = d->parent; | |
| 315 r = d->next; | |
| 316 } | |
| 317 } | |
| 318 DEBUG_RET(); | |
| 319 return r; | |
| 320 } | |
| 321 | |
| 322 | |
| 323 typedef struct _pst_x_attrib { | |
| 324 u_int16_t extended; | |
| 325 u_int16_t zero; | |
| 326 u_int16_t type; | |
| 327 u_int16_t map; | |
| 328 } pst_x_attrib; | |
| 329 | |
| 330 | |
| 331 int32_t pst_load_extended_attributes(pst_file *pf) { | |
| 332 // for PST files this will load up ID2 0x61 and check it's "list" attribute. | |
| 333 pst_desc_ll *p; | |
| 334 pst_num_array *na; | |
| 31 | 335 pst_index2_ll *list2; |
| 16 | 336 unsigned char * buffer=NULL, *headerbuffer=NULL;//, *tc; |
| 337 pst_x_attrib xattrib; | |
| 338 int32_t bptr = 0, bsize, hsize, tint, err=0, x; | |
| 339 pst_x_attrib_ll *ptr, *p_head=NULL, *p_sh=NULL, *p_sh2=NULL; | |
| 340 | |
| 341 DEBUG_ENT("pst_loadExtendedAttributes"); | |
| 342 if ((p = _pst_getDptr(pf, 0x61)) == NULL) { | |
| 343 DEBUG_WARN(("Cannot find DescID 0x61 for loading the Extended Attributes\n")); | |
| 344 DEBUG_RET(); | |
| 345 return 0; | |
| 346 } | |
| 347 if (p->list_index) { | |
| 348 list2 = _pst_build_id2(pf, p->list_index, NULL); | |
| 349 } | |
| 350 if (!p->desc) { | |
| 351 DEBUG_WARN(("desc is NULL for item 0x61. Cannot load Extended Attributes\n")); | |
| 352 DEBUG_RET(); | |
| 353 return 0; | |
| 354 } | |
| 355 if ((na = _pst_parse_block(pf, p->desc->id, list2)) == NULL) { | |
| 356 DEBUG_WARN(("Cannot process desc block for item 0x61. Not loading extended Attributes\n")); | |
| 357 DEBUG_RET(); | |
| 358 return 0; | |
| 359 } | |
| 360 x = 0; | |
| 361 while (x < na->count_item) { | |
| 362 if (na->items[x]->id == 0x0003) { | |
| 363 buffer = na->items[x]->data; | |
| 364 bsize = na->items[x]->size; | |
| 365 } else if (na->items[x]->id == 0x0004) { | |
| 366 headerbuffer = na->items[x]->data; | |
| 367 hsize = na->items[x]->size; | |
| 368 } | |
| 369 x++; | |
| 370 } | |
| 371 | |
| 372 if (!buffer) { | |
| 31 | 373 if (na) _pst_free_list(na); |
| 16 | 374 DEBUG_WARN(("No extended attributes buffer found. Not processing\n")); |
| 375 DEBUG_RET(); | |
| 376 return 0; | |
| 377 } | |
| 378 | |
| 379 memcpy(&xattrib, &(buffer[bptr]), sizeof(xattrib)); | |
| 380 LE16_CPU(xattrib.extended); | |
| 381 LE16_CPU(xattrib.zero); | |
| 382 LE16_CPU(xattrib.type); | |
| 383 LE16_CPU(xattrib.map); | |
| 384 bptr += sizeof(xattrib); | |
| 385 | |
| 386 while (xattrib.type != 0 && bptr < bsize) { | |
| 387 ptr = (pst_x_attrib_ll*) xmalloc(sizeof(pst_x_attrib_ll)); | |
| 388 memset(ptr, 0, sizeof(pst_x_attrib_ll)); | |
| 389 ptr->type = xattrib.type; | |
| 390 ptr->map = xattrib.map+0x8000; | |
| 391 ptr->next = NULL; | |
| 392 DEBUG_INDEX(("xattrib: ext = %#hx, zero = %#hx, type = %#hx, map = %#hx\n", | |
| 393 xattrib.extended, xattrib.zero, xattrib.type, xattrib.map)); | |
| 394 err=0; | |
| 395 if (xattrib.type & 0x0001) { // if the Bit 1 is set | |
| 396 // pointer to Unicode field in buffer | |
| 397 if (xattrib.extended < hsize) { | |
| 31 | 398 char *wt; |
| 16 | 399 // copy the size of the header. It is 32 bit int |
| 400 memcpy(&tint, &(headerbuffer[xattrib.extended]), sizeof(tint)); | |
| 401 LE32_CPU(tint); | |
| 402 wt = (char*) xmalloc(tint+2); // plus 2 for a uni-code zero | |
| 403 memset(wt, 0, tint+2); | |
| 404 memcpy(wt, &(headerbuffer[xattrib.extended+sizeof(tint)]), tint); | |
| 405 ptr->data = _pst_wide_to_single(wt, tint); | |
| 31 | 406 free(wt); |
| 16 | 407 DEBUG_INDEX(("Read string (converted from UTF-16): %s\n", ptr->data)); |
| 408 } else { | |
| 409 DEBUG_INDEX(("Cannot read outside of buffer [%i !< %i]\n", xattrib.extended, hsize)); | |
| 410 } | |
| 411 ptr->mytype = PST_MAP_HEADER; | |
| 412 } else { | |
| 413 // contains the attribute code to map to. | |
| 414 ptr->data = (int*)xmalloc(sizeof(int32_t)); | |
| 415 memset(ptr->data, 0, sizeof(int32_t)); | |
| 416 *((int32_t*)ptr->data) = xattrib.extended; | |
| 417 ptr->mytype = PST_MAP_ATTRIB; | |
| 418 DEBUG_INDEX(("Mapped attribute %#x to %#x\n", ptr->map, *((int32_t*)ptr->data))); | |
| 419 } | |
| 420 | |
| 421 if (err==0) { | |
| 422 // add it to the list | |
| 423 p_sh = p_head; | |
| 424 p_sh2 = NULL; | |
| 425 while (p_sh && ptr->map > p_sh->map) { | |
| 426 p_sh2 = p_sh; | |
| 427 p_sh = p_sh->next; | |
| 428 } | |
| 429 if (!p_sh2) { | |
| 430 // needs to go before first item | |
| 431 ptr->next = p_head; | |
| 432 p_head = ptr; | |
| 433 } else { | |
| 434 // it will go after p_sh2 | |
| 435 ptr->next = p_sh2->next; | |
| 436 p_sh2->next = ptr; | |
| 437 } | |
| 438 } else { | |
| 439 free(ptr); | |
| 440 ptr = NULL; | |
| 441 } | |
| 442 memcpy(&xattrib, &(buffer[bptr]), sizeof(xattrib)); | |
| 443 LE16_CPU(xattrib.extended); | |
| 444 LE16_CPU(xattrib.zero); | |
| 445 LE16_CPU(xattrib.type); | |
| 446 LE16_CPU(xattrib.map); | |
| 447 bptr += sizeof(xattrib); | |
| 448 } | |
| 31 | 449 if (list2) _pst_free_id2(list2); |
| 450 if (na) _pst_free_list(na); | |
| 16 | 451 pf->x_head = p_head; |
| 452 DEBUG_RET(); | |
| 453 return 1; | |
| 454 } | |
| 455 | |
| 456 | |
| 457 #define BLOCK_SIZE 516 // index blocks | |
| 24 | 458 #define DESC_BLOCK_SIZE 516 // descriptor blocks was 520 but bogus |
| 16 | 459 #define ITEM_COUNT_OFFSET 0x1f0 // count byte |
| 460 #define LEVEL_INDICATOR_OFFSET 0x1f3 // node or leaf | |
| 461 #define BACKLINK_OFFSET 0x1f8 // backlink u1 value | |
| 462 #define ITEM_SIZE 12 | |
| 463 #define DESC_SIZE 16 | |
| 464 #define INDEX_COUNT_MAX 41 // max active items | |
| 465 #define DESC_COUNT_MAX 31 // max active items | |
| 466 | |
|
34
07177825c91b
fix signed/unsigned to allow very small pst files with only leaf nodes
carl
parents:
33
diff
changeset
|
467 int32_t _pst_build_id_ptr(pst_file *pf, int32_t offset, int32_t depth, int32_t linku1, u_int32_t start_val, u_int32_t end_val) { |
| 16 | 468 struct _pst_table_ptr_struct table, table2; |
| 469 pst_index_ll *i_ptr=NULL; | |
| 470 pst_index index; | |
| 471 int32_t x, item_count; | |
|
34
07177825c91b
fix signed/unsigned to allow very small pst files with only leaf nodes
carl
parents:
33
diff
changeset
|
472 u_int32_t old = start_val; |
| 16 | 473 char *buf = NULL, *bptr; |
| 474 | |
| 475 DEBUG_ENT("_pst_build_id_ptr"); | |
| 476 DEBUG_INDEX(("offset %x depth %i linku1 %x start %x end %x\n", offset, depth, linku1, start_val, end_val)); | |
| 477 if (end_val <= start_val) { | |
| 478 DEBUG_WARN(("The end value is BEFORE the start value. This function will quit. Soz. [start:%#x, end:%#x]\n", start_val, end_val)); | |
| 479 DEBUG_RET(); | |
| 480 return -1; | |
| 481 } | |
| 482 DEBUG_INDEX(("Reading index block\n")); | |
| 483 if (_pst_read_block_size(pf, offset, BLOCK_SIZE, &buf, 0, 0) < BLOCK_SIZE) { | |
| 484 DEBUG_WARN(("Failed to read %i bytes\n", BLOCK_SIZE)); | |
| 485 if (buf) free(buf); | |
| 486 DEBUG_RET(); | |
| 487 return -1; | |
| 488 } | |
| 489 bptr = buf; | |
| 490 DEBUG_HEXDUMPC(buf, BLOCK_SIZE, ITEM_SIZE); | |
| 491 item_count = (int)(unsigned)(buf[ITEM_COUNT_OFFSET]); | |
| 492 if (item_count > INDEX_COUNT_MAX) { | |
| 493 DEBUG_WARN(("Item count %i too large, max is %i\n", item_count, INDEX_COUNT_MAX)); | |
| 494 if (buf) free(buf); | |
| 495 DEBUG_RET(); | |
| 496 return -1; | |
| 497 } | |
| 498 memcpy(&index, buf+BACKLINK_OFFSET, sizeof(index)); | |
| 499 LE32_CPU(index.id); | |
| 500 if (index.id != linku1) { | |
| 501 DEBUG_WARN(("Backlink %#x in this node does not match required %#x\n", index.id, linku1)); | |
| 502 if (buf) free(buf); | |
| 503 DEBUG_RET(); | |
| 504 return -1; | |
| 505 } | |
| 506 | |
| 507 if (buf[LEVEL_INDICATOR_OFFSET] == '\0') { | |
| 508 // this node contains leaf pointers | |
| 509 x = 0; | |
| 510 while (x < item_count) { | |
| 511 memcpy(&index, bptr, sizeof(index)); | |
| 512 LE32_CPU(index.id); | |
| 513 LE32_CPU(index.offset); | |
| 514 LE16_CPU(index.size); | |
| 515 LE16_CPU(index.u1); | |
| 516 bptr += sizeof(index); | |
| 517 x++; | |
| 518 if (index.id == 0) break; | |
| 519 DEBUG_INDEX(("[%i]%i Item [id = %#x, offset = %#x, u1 = %#x, size = %i(%#x)]\n", | |
| 520 depth, x, index.id, index.offset, index.u1, index.size, index.size)); | |
| 35 | 521 // if (index.id & 0x02) DEBUG_INDEX(("two-bit set!!\n")); |
| 16 | 522 if ((index.id >= end_val) || (index.id < old)) { |
| 523 DEBUG_WARN(("This item isn't right. Must be corruption, or I got it wrong!\n")); | |
| 524 if (buf) free(buf); | |
| 525 DEBUG_RET(); | |
| 526 return -1; | |
| 527 } | |
| 528 old = index.id; | |
| 529 if (x == 1) { // first entry | |
|
34
07177825c91b
fix signed/unsigned to allow very small pst files with only leaf nodes
carl
parents:
33
diff
changeset
|
530 if ((start_val) && (index.id != start_val)) { |
| 16 | 531 DEBUG_WARN(("This item isn't right. Must be corruption, or I got it wrong!\n")); |
| 532 if (buf) free(buf); | |
| 533 DEBUG_RET(); | |
| 534 return -1; | |
| 535 } | |
| 536 } | |
| 537 i_ptr = (pst_index_ll*) xmalloc(sizeof(pst_index_ll)); | |
| 538 i_ptr->id = index.id; | |
| 539 i_ptr->offset = index.offset; | |
| 540 i_ptr->u1 = index.u1; | |
| 541 i_ptr->size = index.size; | |
| 542 i_ptr->next = NULL; | |
| 543 if (pf->i_tail) pf->i_tail->next = i_ptr; | |
| 544 if (!pf->i_head) pf->i_head = i_ptr; | |
| 545 pf->i_tail = i_ptr; | |
| 546 } | |
| 547 } else { | |
| 548 // this node contains node pointers | |
| 549 x = 0; | |
| 550 while (x < item_count) { | |
| 551 memcpy(&table, bptr, sizeof(table)); | |
| 552 LE32_CPU(table.start); | |
| 553 LE32_CPU(table.u1); | |
| 554 LE32_CPU(table.offset); | |
| 555 bptr += sizeof(table); | |
| 556 x++; | |
| 557 if (table.start == 0) break; | |
| 558 if (x < item_count) { | |
| 559 memcpy(&table2, bptr, sizeof(table)); | |
| 560 LE32_CPU(table2.start); | |
| 561 } | |
| 562 else { | |
| 563 table2.start = end_val; | |
| 564 } | |
| 565 DEBUG_INDEX(("[%i] %i Index Table [start id = %#x, u1 = %#x, offset = %#x, end id = %#x]\n", | |
| 566 depth, x, table.start, table.u1, table.offset, table2.start)); | |
| 567 if ((table.start >= end_val) || (table.start < old)) { | |
| 568 DEBUG_WARN(("This table isn't right. Must be corruption, or I got it wrong!\n")); | |
| 569 if (buf) free(buf); | |
| 570 DEBUG_RET(); | |
| 571 return -1; | |
| 572 } | |
| 573 old = table.start; | |
| 574 if (x == 1) { // first entry | |
|
34
07177825c91b
fix signed/unsigned to allow very small pst files with only leaf nodes
carl
parents:
33
diff
changeset
|
575 if ((start_val) && (table.start != start_val)) { |
| 16 | 576 DEBUG_WARN(("This table isn't right. Must be corruption, or I got it wrong!\n")); |
| 577 if (buf) free(buf); | |
| 578 DEBUG_RET(); | |
| 579 return -1; | |
| 580 } | |
| 581 } | |
| 582 _pst_build_id_ptr(pf, table.offset, depth+1, table.u1, table.start, table2.start); | |
| 583 } | |
| 584 } | |
| 585 if (buf) free (buf); | |
| 586 DEBUG_RET(); | |
| 587 return 0; | |
| 588 } | |
| 589 | |
| 590 | |
| 35 | 591 /** this list node type is used for a quick cache |
| 592 of the descriptor tree nodes (rooted at pf->d_head) | |
| 593 and for a "lost and found" list. | |
| 594 If the parent isn't found yet, put it on the lost and found | |
| 595 list and check it each time you read a new item. | |
| 596 */ | |
| 597 struct cache_list_node { | |
| 598 pst_desc_ll *ptr; | |
| 599 /** only used for lost and found lists */ | |
| 600 u_int32_t parent; | |
| 601 struct cache_list_node *next; | |
| 602 struct cache_list_node *prev; | |
| 603 }; | |
| 604 struct cache_list_node *cache_head; | |
| 605 struct cache_list_node *cache_tail; | |
| 606 struct cache_list_node *lostfound_head; | |
| 607 int32_t cache_count; | |
| 608 | |
| 609 | |
| 610 /** | |
| 611 add the d_ptr descriptor into the global tree | |
| 612 */ | |
| 613 void record_descriptor(pst_file *pf, pst_desc_ll *d_ptr, u_int32_t parent_id) { | |
| 614 struct cache_list_node *lostfound_ptr = NULL; | |
| 615 struct cache_list_node *cache_ptr = NULL; | |
| 616 pst_desc_ll *parent = NULL; | |
| 617 | |
| 618 if (parent_id == 0 || parent_id == d_ptr->id) { | |
| 619 // add top level node to the descriptor tree | |
| 620 if (parent_id == 0) { | |
| 621 DEBUG_INDEX(("No Parent\n")); | |
| 622 } else { | |
| 623 DEBUG_INDEX(("Record is its own parent. What is this world coming to?\n")); | |
| 624 } | |
| 625 if (pf->d_tail) pf->d_tail->next = d_ptr; | |
| 626 if (!pf->d_head) pf->d_head = d_ptr; | |
| 627 d_ptr->prev = pf->d_tail; | |
| 628 pf->d_tail = d_ptr; | |
| 629 } else { | |
| 630 DEBUG_INDEX(("Searching for parent\n")); | |
| 631 // check in the cache for the parent | |
| 632 cache_ptr = cache_head; | |
| 633 while (cache_ptr && (cache_ptr->ptr->id != parent_id)) { | |
| 634 cache_ptr = cache_ptr->next; | |
| 635 } | |
| 636 if (!cache_ptr && (parent = _pst_getDptr(pf, parent_id)) == NULL) { | |
| 637 // check in the lost/found list | |
| 638 lostfound_ptr = lostfound_head; | |
| 639 while (lostfound_ptr && (lostfound_ptr->ptr->id != parent_id)) { | |
| 640 lostfound_ptr = lostfound_ptr->next; | |
| 641 } | |
| 642 if (!lostfound_ptr) { | |
| 643 DEBUG_WARN(("ERROR -- cannot find parent with id %#x. Adding to lost/found\n", parent_id)); | |
| 644 lostfound_ptr = (struct cache_list_node*) xmalloc(sizeof(struct cache_list_node)); | |
| 645 lostfound_ptr->prev = NULL; | |
| 646 lostfound_ptr->next = lostfound_head; | |
| 647 lostfound_ptr->parent = parent_id; | |
| 648 lostfound_ptr->ptr = d_ptr; | |
| 649 lostfound_head = lostfound_ptr; | |
| 650 } else { | |
| 651 parent = lostfound_ptr->ptr; | |
| 652 DEBUG_INDEX(("Found parent (%#x) in Lost and Found\n", parent->id)); | |
| 653 } | |
| 654 } | |
| 655 | |
| 656 if (cache_ptr || parent) { | |
| 657 if (cache_ptr) | |
| 658 // parent is already in the cache | |
| 659 parent = cache_ptr->ptr; | |
| 660 else { | |
| 661 //add the parent to the cache | |
| 662 DEBUG_INDEX(("Cache addition\n")); | |
| 663 cache_ptr = (struct cache_list_node*) xmalloc(sizeof(struct cache_list_node)); | |
| 664 cache_ptr->prev = NULL; | |
| 665 cache_ptr->next = cache_head; | |
| 666 cache_ptr->ptr = parent; | |
| 667 cache_head = cache_ptr; | |
| 668 if (!cache_tail) cache_tail = cache_ptr; | |
| 669 cache_count++; | |
| 670 if (cache_count > 100) { | |
| 671 DEBUG_INDEX(("trimming quick cache\n")); | |
| 672 //remove one from the end | |
| 673 cache_ptr = cache_tail; | |
| 674 cache_tail = cache_ptr->prev; | |
| 675 free (cache_ptr); | |
| 676 cache_count--; | |
| 677 } | |
| 678 } | |
| 679 DEBUG_INDEX(("Found a parent\n")); | |
| 680 parent->no_child++; | |
| 681 d_ptr->parent = parent; | |
| 682 if (parent->child_tail) parent->child_tail->next = d_ptr; | |
| 683 if (!parent->child) parent->child = d_ptr; | |
| 684 d_ptr->prev = parent->child_tail; | |
| 685 parent->child_tail = d_ptr; | |
| 686 } | |
| 687 } | |
| 688 } | |
| 689 | |
| 690 int32_t _pst_build_desc_ptr (pst_file *pf, int32_t offset, int32_t depth, int32_t linku1, u_int32_t *high_id, u_int32_t start_val, u_int32_t end_val) { | |
| 16 | 691 struct _pst_table_ptr_struct table, table2; |
| 692 pst_desc desc_rec; | |
| 35 | 693 pst_desc_ll *d_ptr=NULL, *parent=NULL; |
| 16 | 694 int32_t x, item_count; |
| 35 | 695 u_int32_t old = start_val; |
| 16 | 696 char *buf = NULL, *bptr; |
| 35 | 697 struct cache_list_node *cache_ptr = NULL; |
| 698 struct cache_list_node *lostfound_ptr = NULL; | |
| 699 struct cache_list_node *lostfound_shd = NULL; | |
| 700 struct cache_list_node *lostfound_tmp = NULL; | |
| 16 | 701 |
| 35 | 702 if (depth == 0) { |
| 703 // initialize the linked list and lost/found list. | |
| 704 cache_head = NULL; | |
| 705 cache_tail = NULL; | |
| 706 lostfound_head = NULL; | |
| 707 cache_count = 0; | |
| 708 } | |
| 16 | 709 |
| 710 DEBUG_ENT("_pst_build_desc_ptr"); | |
| 711 DEBUG_INDEX(("offset %x depth %i linku1 %x start %x end %x\n", offset, depth, linku1, start_val, end_val)); | |
| 712 if (end_val <= start_val) { | |
| 713 DEBUG_WARN(("The end value is BEFORE the start value. This function will quit. Soz. [start:%#x, end:%#x]\n", start_val, end_val)); | |
| 714 DEBUG_RET(); | |
| 715 return -1; | |
| 716 } | |
| 717 DEBUG_INDEX(("Reading desc block\n")); | |
| 718 if (_pst_read_block_size(pf, offset, DESC_BLOCK_SIZE, &buf, 0, 0) < DESC_BLOCK_SIZE) { | |
| 719 DEBUG_WARN(("Failed to read %i bytes\n", DESC_BLOCK_SIZE)); | |
| 720 if (buf) free(buf); | |
| 721 DEBUG_RET(); | |
| 722 return -1; | |
| 723 } | |
| 724 bptr = buf; | |
| 725 item_count = (int)(unsigned)(buf[ITEM_COUNT_OFFSET]); | |
| 36 | 726 memcpy(&desc_rec.d_id, buf+BACKLINK_OFFSET, sizeof(u_int32_t)); // for valgrind, only have 3 ints here, not 4 |
| 16 | 727 LE32_CPU(desc_rec.d_id); |
| 728 if (desc_rec.d_id != linku1) { | |
| 729 DEBUG_WARN(("Backlink %#x in this node does not match required %#x\n", desc_rec.d_id, linku1)); | |
| 730 if (buf) free(buf); | |
| 731 DEBUG_RET(); | |
| 732 return -1; | |
| 733 } | |
| 734 if (buf[LEVEL_INDICATOR_OFFSET] == '\0') { | |
| 735 // this node contains leaf pointers | |
| 736 DEBUG_HEXDUMPC(buf, DESC_BLOCK_SIZE, 16); | |
| 737 if (item_count > DESC_COUNT_MAX) { | |
| 738 DEBUG_WARN(("Item count %i too large, max is %i\n", item_count, DESC_COUNT_MAX)); | |
| 739 if (buf) free(buf); | |
| 740 DEBUG_RET(); | |
| 741 return -1; | |
| 742 } | |
| 743 x = 0; | |
| 744 while (x < item_count) { | |
| 745 memcpy(&desc_rec, bptr, sizeof(desc_rec)); | |
| 746 LE32_CPU(desc_rec.d_id); | |
| 747 LE32_CPU(desc_rec.desc_id); | |
| 748 LE32_CPU(desc_rec.list_id); | |
| 749 LE32_CPU(desc_rec.parent_id); | |
| 750 bptr+= sizeof(desc_rec); | |
| 751 x++; | |
| 752 if (desc_rec.d_id == 0) break; | |
| 753 DEBUG_INDEX(("[%i] Item(%#x) = [d_id = %#x, desc_id = %#x, list_id = %#x, parent_id = %#x]\n", | |
| 754 depth, x, desc_rec.d_id, desc_rec.desc_id, desc_rec.list_id, desc_rec.parent_id)); | |
| 755 if ((desc_rec.d_id >= end_val) || (desc_rec.d_id < old)) { | |
| 756 DEBUG_WARN(("This item isn't right. Must be corruption, or I got it wrong!\n")); | |
| 757 DEBUG_HEXDUMPC(buf, DESC_BLOCK_SIZE, 16); | |
| 758 if (buf) free(buf); | |
| 759 DEBUG_RET(); | |
| 760 return -1; | |
| 761 } | |
| 762 old = desc_rec.d_id; | |
| 763 if (x == 1) { // first entry | |
| 35 | 764 if (start_val && (desc_rec.d_id != start_val)) { |
| 16 | 765 DEBUG_WARN(("This item isn't right. Must be corruption, or I got it wrong!\n")); |
| 766 if (buf) free(buf); | |
| 767 DEBUG_RET(); | |
| 768 return -1; | |
| 769 } | |
| 770 } | |
| 771 // When duplicates found, just update the info.... perhaps this is correct functionality | |
| 772 DEBUG_INDEX(("Searching for existing record\n")); | |
| 35 | 773 if (desc_rec.d_id <= *high_id && (d_ptr = _pst_getDptr(pf, desc_rec.d_id))) { |
| 16 | 774 DEBUG_INDEX(("Updating Existing Values\n")); |
| 775 d_ptr->list_index = _pst_getID(pf, desc_rec.list_id); | |
| 776 d_ptr->desc = _pst_getID(pf, desc_rec.desc_id); | |
| 777 DEBUG_INDEX(("\tdesc = %#x\tlist_index=%#x\n", | |
| 778 (d_ptr->desc==NULL?0:d_ptr->desc->id), | |
| 779 (d_ptr->list_index==NULL?0:d_ptr->list_index->id))); | |
| 780 if (d_ptr->parent && desc_rec.parent_id != d_ptr->parent->id) { | |
| 781 DEBUG_INDEX(("WARNING -- Parent of record has changed. Moving it\n")); | |
| 782 //hmmm, we must move the record. | |
| 783 // first we must remove from current location | |
| 784 // change previous record to point next to our next | |
| 785 // if no previous, then use parent's child | |
| 786 // if no parent then change pf->d_head; | |
| 787 // change next's prev to our prev | |
| 788 // if no next then change parent's child_tail | |
| 789 // if no parent then change pf->d_tail | |
| 790 if (d_ptr->prev) | |
| 791 d_ptr->prev->next = d_ptr->next; | |
| 792 else if (d_ptr->parent) | |
| 793 d_ptr->parent->child = d_ptr->next; | |
| 794 else | |
| 795 pf->d_head = d_ptr->next; | |
| 796 | |
| 797 if (d_ptr->next) | |
| 798 d_ptr->next->prev = d_ptr->prev; | |
| 799 else if (d_ptr->parent) | |
| 800 d_ptr->parent->child_tail = d_ptr->prev; | |
| 801 else | |
| 802 pf->d_tail = d_ptr->prev; | |
| 803 | |
| 804 d_ptr->prev = NULL; | |
| 805 d_ptr->next = NULL; | |
| 806 d_ptr->parent = NULL; | |
| 35 | 807 record_descriptor(pf, d_ptr, desc_rec.parent_id); // add to the global tree |
| 16 | 808 } |
| 809 } else { | |
| 810 if (*high_id < desc_rec.d_id) { | |
| 811 DEBUG_INDEX(("Updating New High\n")); | |
| 812 *high_id = desc_rec.d_id; | |
| 813 } | |
| 814 DEBUG_INDEX(("New Record\n")); | |
| 815 d_ptr = (pst_desc_ll*) xmalloc(sizeof(pst_desc_ll)); | |
| 816 d_ptr->id = desc_rec.d_id; | |
| 817 d_ptr->list_index = _pst_getID(pf, desc_rec.list_id); | |
| 818 d_ptr->desc = _pst_getID(pf, desc_rec.desc_id); | |
| 819 d_ptr->prev = NULL; | |
| 820 d_ptr->next = NULL; | |
| 821 d_ptr->parent = NULL; | |
| 822 d_ptr->child = NULL; | |
| 823 d_ptr->child_tail = NULL; | |
| 824 d_ptr->no_child = 0; | |
| 35 | 825 record_descriptor(pf, d_ptr, desc_rec.parent_id); // add to the global tree |
| 16 | 826 |
| 827 } | |
| 828 // check here to see if d_ptr is the parent of any of the items in the lost / found list | |
| 35 | 829 lostfound_ptr = lostfound_head; |
| 830 lostfound_shd = NULL; | |
| 831 while (lostfound_ptr) { | |
| 832 if (lostfound_ptr->parent == d_ptr->id) { | |
| 833 DEBUG_INDEX(("Found a child (%#x) of the current record. Joining to main structure.\n", lostfound_ptr->ptr->id)); | |
| 834 parent = d_ptr; | |
| 835 d_ptr = lostfound_ptr->ptr; | |
| 836 parent->no_child++; | |
| 837 d_ptr->parent = parent; | |
| 838 if (parent->child_tail) parent->child_tail->next = d_ptr; | |
| 839 if (!parent->child) parent->child = d_ptr; | |
| 840 d_ptr->prev = parent->child_tail; | |
| 841 parent->child_tail = d_ptr; | |
| 842 if (!lostfound_shd) lostfound_head = lostfound_ptr->next; | |
| 843 else lostfound_shd->next = lostfound_ptr->next; | |
| 844 lostfound_tmp = lostfound_ptr->next; | |
| 845 free(lostfound_ptr); | |
| 846 lostfound_ptr = lostfound_tmp; | |
| 16 | 847 } else { |
| 35 | 848 lostfound_shd = lostfound_ptr; |
| 849 lostfound_ptr = lostfound_ptr->next; | |
| 16 | 850 } |
| 851 } | |
| 852 } | |
| 853 } else { | |
| 854 // this node contains node pointers | |
| 855 DEBUG_HEXDUMPC(buf, DESC_BLOCK_SIZE, ITEM_SIZE); | |
| 856 if (item_count > INDEX_COUNT_MAX) { | |
| 857 DEBUG_WARN(("Item count %i too large, max is %i\n", item_count, INDEX_COUNT_MAX)); | |
| 858 if (buf) free(buf); | |
| 859 DEBUG_RET(); | |
| 860 return -1; | |
| 861 } | |
| 862 x = 0; | |
| 863 while (x < item_count) { | |
| 864 memcpy(&table, bptr, sizeof(table)); | |
| 865 LE32_CPU(table.start); | |
| 866 LE32_CPU(table.u1); | |
| 867 LE32_CPU(table.offset); | |
| 868 bptr += sizeof(table); | |
| 869 x++; | |
| 870 if (table.start == 0) break; | |
| 871 if (x < item_count) { | |
| 872 memcpy(&table2, bptr, sizeof(table)); | |
| 873 LE32_CPU(table2.start); | |
| 874 } | |
| 875 else { | |
| 876 table2.start = end_val; | |
| 877 } | |
| 878 DEBUG_INDEX(("[%i] %i Descriptor Table [start id = %#x, u1 = %#x, offset = %#x, end id = %#x]\n", | |
| 879 depth, x, table.start, table.u1, table.offset, table2.start)); | |
| 880 if ((table.start >= end_val) || (table.start < old)) { | |
| 881 DEBUG_WARN(("This table isn't right. Must be corruption, or I got it wrong!\n")); | |
| 882 if (buf) free(buf); | |
| 883 DEBUG_RET(); | |
| 884 return -1; | |
| 885 } | |
| 886 old = table.start; | |
| 887 if (x == 1) { // first entry | |
| 888 if (start_val != -1 && table.start != start_val) { | |
| 889 DEBUG_WARN(("This table isn't right. Must be corruption, or I got it wrong!\n")); | |
| 890 if (buf) free(buf); | |
| 891 DEBUG_RET(); | |
| 892 return -1; | |
| 893 } | |
| 894 } | |
| 895 _pst_build_desc_ptr(pf, table.offset, depth+1, table.u1, high_id, table.start, table2.start); | |
| 896 } | |
| 897 } | |
| 35 | 898 if (depth == 0) { |
| 899 // free the quick cache | |
| 900 while (cache_head) { | |
| 901 cache_ptr = cache_head->next; | |
| 902 free(cache_head); | |
| 903 cache_head = cache_ptr; | |
| 904 } | |
| 905 // free the lost and found | |
| 906 while (lostfound_head) { | |
| 907 lostfound_ptr = lostfound_head->next; | |
| 908 WARN(("unused lost/found item with parent %d))", lostfound_head->parent)); | |
| 909 free(lostfound_head); | |
| 910 lostfound_head = lostfound_ptr; | |
| 911 } | |
| 16 | 912 } |
| 913 if (buf) free(buf); | |
| 914 DEBUG_RET(); | |
| 915 return 0; | |
| 916 } | |
| 917 | |
| 918 | |
| 919 void* _pst_parse_item(pst_file *pf, pst_desc_ll *d_ptr) { | |
| 920 pst_num_array * list; | |
| 921 pst_index2_ll *id2_head = NULL; | |
| 922 pst_index_ll *id_ptr = NULL; | |
| 923 pst_item *item = NULL; | |
| 924 pst_item_attach *attach = NULL; | |
| 925 int x; | |
| 926 DEBUG_ENT("_pst_parse_item"); | |
| 927 if (!d_ptr) { | |
| 928 DEBUG_WARN(("you cannot pass me a NULL! I don't want it!\n")); | |
| 929 DEBUG_RET(); | |
| 930 return NULL; | |
| 931 } | |
| 932 | |
| 933 if (d_ptr->list_index) { | |
| 934 id2_head = _pst_build_id2(pf, d_ptr->list_index, NULL); | |
| 935 _pst_printID2ptr(id2_head); | |
| 936 } else { | |
| 937 DEBUG_WARN(("Have not been able to fetch any id2 values for this item. Brace yourself!\n")); | |
| 938 } | |
| 939 | |
| 940 if (!d_ptr->desc) { | |
| 941 DEBUG_WARN(("why is d_ptr->desc == NULL? I don't want to do anything else with this record\n")); | |
| 31 | 942 if (id2_head) _pst_free_id2(id2_head); |
| 16 | 943 DEBUG_RET(); |
| 944 return NULL; | |
| 945 } | |
| 946 | |
| 947 if ((list = _pst_parse_block(pf, d_ptr->desc->id, id2_head)) == NULL) { | |
| 948 DEBUG_WARN(("_pst_parse_block() returned an error for d_ptr->desc->id [%#x]\n", d_ptr->desc->id)); | |
| 31 | 949 if (id2_head) _pst_free_id2(id2_head); |
| 16 | 950 DEBUG_RET(); |
| 951 return NULL; | |
| 952 } | |
| 953 | |
| 954 item = (pst_item*) xmalloc(sizeof(pst_item)); | |
| 955 memset(item, 0, sizeof(pst_item)); | |
| 956 | |
| 957 if (_pst_process(list, item)) { | |
| 958 DEBUG_WARN(("_pst_process() returned non-zero value. That is an error\n")); | |
| 31 | 959 if (item) free(item); |
| 960 if (list) _pst_free_list(list); | |
| 961 if (id2_head) _pst_free_id2(id2_head); | |
| 16 | 962 DEBUG_RET(); |
| 963 return NULL; | |
| 964 } else { | |
| 31 | 965 if (list) _pst_free_list(list); |
| 16 | 966 list = NULL; //_pst_process will free the items in the list |
| 967 } | |
| 968 | |
| 969 if ((id_ptr = _pst_getID2(id2_head, 0x671))) { | |
| 970 // attachements exist - so we will process them | |
| 971 while (item->attach) { | |
| 972 attach = item->attach->next; | |
| 973 free(item->attach); | |
| 974 item->attach = attach; | |
| 975 } | |
| 976 | |
| 977 DEBUG_EMAIL(("ATTACHEMENT processing attachement\n")); | |
| 978 if ((list = _pst_parse_block(pf, id_ptr->id, id2_head)) == NULL) { | |
| 979 DEBUG_WARN(("ERROR error processing main attachment record\n")); | |
| 31 | 980 if (item) free(item); |
| 981 if (id2_head) _pst_free_id2(id2_head); | |
| 982 DEBUG_RET(); | |
| 983 return NULL; | |
| 16 | 984 } |
| 985 else { | |
| 986 x = 0; | |
| 987 while (x < list->count_array) { | |
| 988 attach = (pst_item_attach*) xmalloc (sizeof(pst_item_attach)); | |
| 989 memset (attach, 0, sizeof(pst_item_attach)); | |
| 990 attach->next = item->attach; | |
| 991 item->attach = attach; | |
| 992 x++; | |
| 993 } | |
| 994 | |
| 995 if (_pst_process(list, item)) { | |
| 996 DEBUG_WARN(("ERROR _pst_process() failed with attachments\n")); | |
| 31 | 997 if (item) free(item); |
| 998 if (list) _pst_free_list(list); | |
| 999 if (id2_head) _pst_free_id2(id2_head); | |
| 16 | 1000 DEBUG_RET(); |
| 1001 return NULL; | |
| 1002 } | |
| 31 | 1003 if (list) _pst_free_list(list); |
| 1004 list = NULL; | |
| 16 | 1005 |
| 1006 // now we will have initial information of each attachment stored in item->attach... | |
| 1007 // we must now read the secondary record for each based on the id2 val associated with | |
| 1008 // each attachment | |
| 1009 attach = item->attach; | |
| 1010 while (attach) { | |
| 1011 if ((id_ptr = _pst_getID2(id2_head, attach->id2_val))) { | |
| 1012 // id_ptr is a record describing the attachment | |
| 1013 // we pass NULL instead of id2_head cause we don't want it to | |
| 1014 // load all the extra stuff here. | |
| 1015 if ((list = _pst_parse_block(pf, id_ptr->id, NULL)) == NULL) { | |
| 1016 DEBUG_WARN(("ERROR error processing an attachment record\n")); | |
| 1017 attach = attach->next; | |
| 1018 continue; | |
| 1019 } | |
| 1020 if (_pst_process(list, item)) { | |
| 1021 DEBUG_WARN(("ERROR _pst_process() failed with an attachment\n")); | |
| 31 | 1022 if (list) _pst_free_list(list); |
| 1023 list = NULL; | |
| 16 | 1024 attach = attach->next; |
| 1025 continue; | |
| 1026 } | |
| 31 | 1027 if (list) _pst_free_list(list); |
| 1028 list = NULL; | |
| 16 | 1029 if ((id_ptr = _pst_getID2(id2_head, attach->id2_val))) { |
| 1030 // id2_val has been updated to the ID2 value of the datablock containing the | |
| 1031 // attachment data | |
| 1032 attach->id_val = id_ptr->id; | |
| 1033 } else { | |
| 1034 DEBUG_WARN(("have not located the correct value for the attachment [%#x]\n", attach->id2_val)); | |
| 1035 } | |
| 1036 } else { | |
| 1037 DEBUG_WARN(("ERROR cannot locate id2 value %#x\n", attach->id2_val)); | |
| 1038 } | |
| 1039 attach = attach->next; | |
| 1040 } | |
| 1041 } | |
| 1042 } | |
| 1043 | |
| 1044 _pst_free_id2(id2_head); | |
| 31 | 1045 id2_head = NULL; |
| 16 | 1046 DEBUG_RET(); |
| 1047 return item; | |
| 1048 } | |
| 1049 | |
| 1050 | |
| 35 | 1051 void freeall(unsigned char *buf, pst_block_offset_pointer *p1, |
| 1052 pst_block_offset_pointer *p2, | |
| 1053 pst_block_offset_pointer *p3, | |
| 1054 pst_block_offset_pointer *p4, | |
| 1055 pst_block_offset_pointer *p5, | |
| 1056 pst_block_offset_pointer *p6, | |
| 1057 pst_block_offset_pointer *p7) { | |
| 1058 if (buf) free(buf); | |
| 1059 if (p1->needfree) free(p1->from); | |
| 1060 if (p2->needfree) free(p2->from); | |
| 1061 if (p3->needfree) free(p3->from); | |
| 1062 if (p4->needfree) free(p4->from); | |
| 1063 if (p5->needfree) free(p5->from); | |
| 1064 if (p6->needfree) free(p6->from); | |
| 1065 if (p7->needfree) free(p7->from); | |
| 1066 } | |
| 1067 | |
| 1068 | |
| 16 | 1069 pst_num_array * _pst_parse_block(pst_file *pf, u_int32_t block_id, pst_index2_ll *i2_head) { |
| 1070 unsigned char *buf = NULL; | |
| 1071 pst_num_array *na_ptr = NULL, *na_head = NULL; | |
| 35 | 1072 pst_block_offset_pointer block_offset1; |
| 1073 pst_block_offset_pointer block_offset2; | |
| 1074 pst_block_offset_pointer block_offset3; | |
| 1075 pst_block_offset_pointer block_offset4; | |
| 1076 pst_block_offset_pointer block_offset5; | |
| 1077 pst_block_offset_pointer block_offset6; | |
| 1078 pst_block_offset_pointer block_offset7; | |
| 1079 u_int32_t size; | |
| 1080 u_int32_t x; | |
| 1081 u_int32_t num_recs; | |
| 1082 u_int32_t count_rec; | |
| 1083 u_int32_t num_list; | |
| 1084 u_int32_t cur_list; | |
| 1085 u_int32_t block_type; | |
| 36 | 1086 u_int32_t rec_size = 0; |
| 35 | 1087 u_int32_t ind_ptr; |
| 1088 unsigned char* list_start; | |
| 1089 unsigned char* t_ptr; | |
| 1090 unsigned char* fr_ptr; | |
| 1091 unsigned char* to_ptr; | |
| 1092 unsigned char* ind2_end; | |
| 36 | 1093 unsigned char* ind2_ptr = NULL; |
| 16 | 1094 size_t read_size=0; |
| 1095 pst_x_attrib_ll *mapptr; | |
| 1096 | |
| 1097 struct { | |
| 1098 u_int16_t type; | |
| 1099 u_int16_t ref_type; | |
| 1100 u_int32_t value; | |
| 35 | 1101 } table_rec; //for type 1 (0xBCEC) blocks |
| 16 | 1102 struct { |
| 1103 u_int16_t ref_type; | |
| 1104 u_int16_t type; | |
| 1105 u_int16_t ind2_off; | |
| 35 | 1106 u_int8_t size; |
| 1107 u_int8_t slot; | |
| 1108 } table2_rec; //for type 2 (0x7CEC) blocks | |
| 1109 struct { | |
| 1110 u_int32_t id; | |
| 1111 } table3_rec; //for type 3 (0x0101) blocks | |
| 16 | 1112 struct { |
| 1113 u_int16_t index_offset; | |
| 1114 u_int16_t type; | |
| 35 | 1115 u_int32_t offset; |
| 16 | 1116 } block_hdr; |
| 1117 struct { | |
| 1118 unsigned char seven_c; | |
| 1119 unsigned char item_count; | |
| 1120 u_int16_t u1; | |
| 1121 u_int16_t u2; | |
| 1122 u_int16_t u3; | |
| 1123 u_int16_t rec_size; | |
| 35 | 1124 u_int32_t b_five_offset; |
| 1125 u_int32_t ind2_offset; | |
| 16 | 1126 u_int16_t u7; |
| 1127 u_int16_t u8; | |
| 1128 } seven_c_blk; | |
| 1129 struct _type_d_rec { | |
| 1130 u_int32_t id; | |
| 1131 u_int32_t u1; | |
| 1132 } * type_d_rec; | |
| 1133 | |
| 1134 DEBUG_ENT("_pst_parse_block"); | |
| 1135 if ((read_size = _pst_ff_getIDblock_dec(pf, block_id, &buf)) == 0) { | |
| 1136 WARN(("Error reading block id %#x\n", block_id)); | |
| 1137 if (buf) free (buf); | |
| 1138 DEBUG_RET(); | |
| 1139 return NULL; | |
| 1140 } | |
| 1141 | |
| 35 | 1142 block_offset1.needfree = 0; |
| 1143 block_offset2.needfree = 0; | |
| 1144 block_offset3.needfree = 0; | |
| 1145 block_offset4.needfree = 0; | |
| 1146 block_offset5.needfree = 0; | |
| 1147 block_offset6.needfree = 0; | |
| 1148 block_offset7.needfree = 0; | |
| 1149 | |
| 16 | 1150 memcpy(&block_hdr, buf, sizeof(block_hdr)); |
| 1151 LE16_CPU(block_hdr.index_offset); | |
| 1152 LE16_CPU(block_hdr.type); | |
| 35 | 1153 LE32_CPU(block_hdr.offset); |
| 16 | 1154 DEBUG_EMAIL(("block header (index_offset=%#hx, type=%#hx, offset=%#hx\n", block_hdr.index_offset, block_hdr.type, block_hdr.offset)); |
| 1155 | |
| 1156 ind_ptr = block_hdr.index_offset; | |
| 1157 | |
| 1158 if (block_hdr.type == 0xBCEC) { //type 1 | |
| 1159 block_type = 1; | |
| 1160 | |
| 35 | 1161 if (_pst_getBlockOffsetPointer(pf, i2_head, buf, read_size, ind_ptr, block_hdr.offset, &block_offset1)) { |
| 1162 DEBUG_WARN(("internal error (bc.b5 offset %#x) in reading block id %#x\n", block_hdr.offset, block_id)); | |
| 1163 freeall(buf, &block_offset1, &block_offset2, &block_offset3, &block_offset4, &block_offset5, &block_offset6, &block_offset7); | |
| 1164 DEBUG_RET(); | |
| 1165 return NULL; | |
| 1166 } | |
| 1167 memcpy(&table_rec, block_offset1.from, sizeof(table_rec)); | |
| 16 | 1168 LE16_CPU(table_rec.type); |
| 1169 LE16_CPU(table_rec.ref_type); | |
| 1170 LE32_CPU(table_rec.value); | |
| 35 | 1171 DEBUG_EMAIL(("table_rec (type=%#hx, ref_type=%#hx, value=%#x)\n", table_rec.type, table_rec.ref_type, table_rec.value)); |
| 16 | 1172 |
| 1173 if (table_rec.type != 0x02B5) { | |
| 1174 WARN(("Unknown second block constant - %#X for id %#x\n", table_rec.type, block_id)); | |
| 1175 DEBUG_HEXDUMPC(buf, sizeof(table_rec), 0x10); | |
| 35 | 1176 freeall(buf, &block_offset1, &block_offset2, &block_offset3, &block_offset4, &block_offset5, &block_offset6, &block_offset7); |
| 16 | 1177 DEBUG_RET(); |
| 1178 return NULL; | |
| 1179 } | |
| 1180 | |
| 35 | 1181 if (_pst_getBlockOffsetPointer(pf, i2_head, buf, read_size, ind_ptr, table_rec.value, &block_offset2)) { |
| 1182 DEBUG_WARN(("internal error (bc.b5.desc offset) in reading block id %#x\n", table_rec.value, block_id)); | |
| 1183 freeall(buf, &block_offset1, &block_offset2, &block_offset3, &block_offset4, &block_offset5, &block_offset6, &block_offset7); | |
| 1184 DEBUG_RET(); | |
| 1185 return NULL; | |
| 1186 } | |
| 1187 list_start = block_offset2.from; | |
| 1188 to_ptr = block_offset2.to; | |
| 28 | 1189 num_list = (to_ptr - list_start)/sizeof(table_rec); |
|
34
07177825c91b
fix signed/unsigned to allow very small pst files with only leaf nodes
carl
parents:
33
diff
changeset
|
1190 num_recs = 1; // only going to be one object in these blocks |
| 16 | 1191 } |
| 1192 else if (block_hdr.type == 0x7CEC) { //type 2 | |
| 1193 block_type = 2; | |
| 1194 | |
| 35 | 1195 if (_pst_getBlockOffsetPointer(pf, i2_head, buf, read_size, ind_ptr, block_hdr.offset, &block_offset3)) { |
| 1196 DEBUG_WARN(("internal error (7c.7c offset %#x) in reading block id %#x\n", block_hdr.offset, block_id)); | |
| 1197 freeall(buf, &block_offset1, &block_offset2, &block_offset3, &block_offset4, &block_offset5, &block_offset6, &block_offset7); | |
| 1198 DEBUG_RET(); | |
| 1199 return NULL; | |
| 1200 } | |
| 1201 fr_ptr = block_offset3.from; //now got pointer to "7C block" | |
| 16 | 1202 memset(&seven_c_blk, 0, sizeof(seven_c_blk)); |
| 35 | 1203 memcpy(&seven_c_blk, fr_ptr, sizeof(seven_c_blk)); |
| 16 | 1204 LE16_CPU(seven_c_blk.u1); |
| 1205 LE16_CPU(seven_c_blk.u2); | |
| 1206 LE16_CPU(seven_c_blk.u3); | |
| 1207 LE16_CPU(seven_c_blk.rec_size); | |
| 35 | 1208 LE32_CPU(seven_c_blk.b_five_offset); |
| 1209 LE32_CPU(seven_c_blk.ind2_offset); | |
| 16 | 1210 LE16_CPU(seven_c_blk.u7); |
| 1211 LE16_CPU(seven_c_blk.u8); | |
| 1212 | |
| 1213 list_start = fr_ptr + sizeof(seven_c_blk); // the list of item numbers start after this record | |
| 1214 | |
| 1215 if (seven_c_blk.seven_c != 0x7C) { // this would mean it isn't a 7C block! | |
| 1216 WARN(("Error. There isn't a 7C where I want to see 7C!\n")); | |
| 35 | 1217 freeall(buf, &block_offset1, &block_offset2, &block_offset3, &block_offset4, &block_offset5, &block_offset6, &block_offset7); |
| 16 | 1218 DEBUG_RET(); |
| 1219 return NULL; | |
| 1220 } | |
| 1221 | |
| 1222 rec_size = seven_c_blk.rec_size; | |
| 1223 num_list = seven_c_blk.item_count; | |
| 1224 | |
| 35 | 1225 if (_pst_getBlockOffsetPointer(pf, i2_head, buf, read_size, ind_ptr, seven_c_blk.b_five_offset, &block_offset4)) { |
| 1226 DEBUG_WARN(("internal error (7c.b5 offset %#x) in reading block id %#x\n", seven_c_blk.b_five_offset, block_id)); | |
| 1227 freeall(buf, &block_offset1, &block_offset2, &block_offset3, &block_offset4, &block_offset5, &block_offset6, &block_offset7); | |
| 1228 DEBUG_RET(); | |
| 1229 return NULL; | |
| 1230 } | |
| 1231 memcpy(&table_rec, block_offset4.from, sizeof(table_rec)); | |
| 16 | 1232 LE16_CPU(table_rec.type); |
| 1233 LE16_CPU(table_rec.ref_type); | |
| 1234 LE32_CPU(table_rec.value); | |
| 1235 | |
| 1236 if (table_rec.type != 0x04B5) { // different constant than a type 1 record | |
| 1237 WARN(("Unknown second block constant - %#X for id %#x\n", table_rec.type, block_id)); | |
| 35 | 1238 freeall(buf, &block_offset1, &block_offset2, &block_offset3, &block_offset4, &block_offset5, &block_offset6, &block_offset7); |
| 16 | 1239 DEBUG_RET(); |
| 1240 return NULL; | |
| 1241 } | |
| 1242 | |
| 35 | 1243 if (_pst_getBlockOffsetPointer(pf, i2_head, buf, read_size, ind_ptr, table_rec.value, &block_offset5)) { |
| 1244 DEBUG_WARN(("internal error (7c.5b.desc offset %#x) in reading block id %#x\n", table_rec.value, block_id)); | |
| 1245 freeall(buf, &block_offset1, &block_offset2, &block_offset3, &block_offset4, &block_offset5, &block_offset6, &block_offset7); | |
| 1246 DEBUG_RET(); | |
| 1247 return NULL; | |
| 1248 } | |
| 1249 num_recs = (block_offset5.to - block_offset5.from) / 6; // this will give the number of records in this block | |
| 1250 | |
| 1251 if (_pst_getBlockOffsetPointer(pf, i2_head, buf, read_size, ind_ptr, seven_c_blk.ind2_offset, &block_offset6)) { | |
| 1252 DEBUG_WARN(("internal error (7c.ind2 offset %#x) in reading block id %#x\n", seven_c_blk.ind2_offset, block_id)); | |
| 1253 freeall(buf, &block_offset1, &block_offset2, &block_offset3, &block_offset4, &block_offset5, &block_offset6, &block_offset7); | |
| 16 | 1254 DEBUG_RET(); |
| 1255 return NULL; | |
| 1256 } | |
| 35 | 1257 ind2_ptr = block_offset6.from; |
| 1258 ind2_end = block_offset6.to; | |
| 1259 } | |
| 1260 else if (block_hdr.index_offset == 0x0101) { //type 2 | |
| 1261 unsigned char *buf2 = NULL; | |
| 1262 int n = block_hdr.type; // count | |
| 1263 int m = sizeof(table3_rec); | |
| 1264 int i; | |
| 1265 block_type = 3; | |
| 1266 for (i=0; i<n; i++) { | |
| 1267 memcpy(&table3_rec, buf+8+i*m, m); | |
| 1268 LE32_CPU(table3_rec.id); | |
| 1269 _pst_ff_getIDblock_dec(pf, table3_rec.id, &buf2); | |
| 1270 if (buf2) free(buf2); | |
| 1271 buf2 = NULL; | |
| 1272 } | |
| 1273 freeall(buf, &block_offset1, &block_offset2, &block_offset3, &block_offset4, &block_offset5, &block_offset6, &block_offset7); | |
| 1274 DEBUG_RET(); | |
| 1275 return NULL; | |
| 16 | 1276 } else { |
| 1277 WARN(("ERROR: Unknown block constant - %#X for id %#x\n", block_hdr.type, block_id)); | |
| 1278 DEBUG_HEXDUMPC(buf, read_size,0x10); | |
| 35 | 1279 freeall(buf, &block_offset1, &block_offset2, &block_offset3, &block_offset4, &block_offset5, &block_offset6, &block_offset7); |
| 16 | 1280 DEBUG_RET(); |
| 1281 return NULL; | |
| 1282 } | |
| 1283 | |
| 35 | 1284 DEBUG_EMAIL(("Mallocing number of records %i\n", num_recs)); |
| 1285 for (count_rec=0; count_rec<num_recs; count_rec++) { | |
| 16 | 1286 na_ptr = (pst_num_array*) xmalloc(sizeof(pst_num_array)); |
| 1287 memset(na_ptr, 0, sizeof(pst_num_array)); | |
| 1288 na_ptr->next = na_head; | |
| 1289 na_head = na_ptr; | |
| 1290 // allocate an array of count num_recs to contain sizeof(struct_pst_num_item) | |
| 1291 na_ptr->items = (struct _pst_num_item**) xmalloc(sizeof(struct _pst_num_item)*num_list); | |
| 1292 na_ptr->count_item = num_list; | |
| 1293 na_ptr->count_array = num_recs; // each record will have a record of the total number of records | |
| 36 | 1294 for (x=0; x<num_list; x++) na_ptr->items[x] = NULL; |
| 16 | 1295 x = 0; |
| 1296 | |
| 1297 DEBUG_EMAIL(("going to read %i (%#x) items\n", na_ptr->count_item, na_ptr->count_item)); | |
| 1298 | |
| 35 | 1299 fr_ptr = list_start; // initialize fr_ptr to the start of the list. |
| 1300 for (cur_list=0; cur_list<num_list; cur_list++) { //we will increase fr_ptr as we progress through index | |
| 1301 unsigned char* value_pointer = NULL; // needed for block type 2 with values larger than 4 bytes | |
| 1302 int value_size = 0; | |
| 16 | 1303 if (block_type == 1) { |
| 35 | 1304 memcpy(&table_rec, fr_ptr, sizeof(table_rec)); |
| 16 | 1305 LE16_CPU(table_rec.type); |
| 1306 LE16_CPU(table_rec.ref_type); | |
| 28 | 1307 //LE32_CPU(table_rec.value); // done later, some may be order invariant |
| 16 | 1308 fr_ptr += sizeof(table_rec); |
| 1309 } else if (block_type == 2) { | |
| 1310 // we will copy the table2_rec values into a table_rec record so that we can keep the rest of the code | |
| 35 | 1311 memcpy(&table2_rec, fr_ptr, sizeof(table2_rec)); |
| 16 | 1312 LE16_CPU(table2_rec.ref_type); |
| 1313 LE16_CPU(table2_rec.type); | |
| 1314 LE16_CPU(table2_rec.ind2_off); | |
| 1315 | |
| 1316 // table_rec and table2_rec are arranged differently, so assign the values across | |
| 1317 table_rec.type = table2_rec.type; | |
| 1318 table_rec.ref_type = table2_rec.ref_type; | |
| 35 | 1319 if ((ind2_end - ind2_ptr) <= (table2_rec.ind2_off + table2_rec.size)) { |
| 1320 int n = table2_rec.size; | |
| 1321 int m = sizeof(table_rec.value); | |
| 1322 table_rec.value = 0; | |
| 1323 if (n <= m) { | |
| 1324 memcpy(&table_rec.value, ind2_ptr + table2_rec.ind2_off, n); | |
| 1325 } | |
| 1326 else { | |
| 1327 value_pointer = ind2_ptr + table2_rec.ind2_off; | |
| 1328 value_size = n; | |
| 1329 } | |
| 28 | 1330 //LE32_CPU(table_rec.value); // done later, some may be order invariant |
| 1331 } | |
| 16 | 1332 else { |
| 35 | 1333 DEBUG_WARN (("Trying to read outside buffer, buffer size %#x, offset %#x, data size %#x\n", |
| 1334 read_size, ind2_end-ind2_ptr+table2_rec.ind2_off, table2_rec.size)); | |
| 16 | 1335 } |
| 1336 fr_ptr += sizeof(table2_rec); | |
| 1337 } else { | |
| 1338 WARN(("Missing code for block_type %i\n", block_type)); | |
| 35 | 1339 freeall(buf, &block_offset1, &block_offset2, &block_offset3, &block_offset4, &block_offset5, &block_offset6, &block_offset7); |
| 31 | 1340 if (na_head) _pst_free_list(na_head); |
| 16 | 1341 DEBUG_RET(); |
| 1342 return NULL; | |
| 1343 } | |
| 1344 DEBUG_EMAIL(("reading block %i (type=%#x, ref_type=%#x, value=%#x)\n", | |
| 1345 x, table_rec.type, table_rec.ref_type, table_rec.value)); | |
| 1346 | |
| 1347 na_ptr->items[x] = (struct _pst_num_item*) xmalloc(sizeof(struct _pst_num_item)); | |
| 1348 memset(na_ptr->items[x], 0, sizeof(struct _pst_num_item)); //init it | |
| 1349 | |
| 1350 // check here to see if the id of the attribute is a mapped one | |
| 1351 mapptr = pf->x_head; | |
| 1352 while (mapptr && (mapptr->map < table_rec.type)) mapptr = mapptr->next; | |
| 1353 if (mapptr && (mapptr->map == table_rec.type)) { | |
| 1354 if (mapptr->mytype == PST_MAP_ATTRIB) { | |
| 1355 na_ptr->items[x]->id = *((int*)mapptr->data); | |
| 1356 DEBUG_EMAIL(("Mapped attrib %#x to %#x\n", table_rec.type, na_ptr->items[x]->id)); | |
| 1357 } else if (mapptr->mytype == PST_MAP_HEADER) { | |
| 1358 DEBUG_EMAIL(("Internet Header mapping found %#x\n", table_rec.type)); | |
| 1359 na_ptr->items[x]->id = PST_ATTRIB_HEADER; | |
| 1360 na_ptr->items[x]->extra = mapptr->data; | |
| 1361 } | |
| 1362 } else { | |
| 1363 na_ptr->items[x]->id = table_rec.type; | |
| 1364 } | |
| 1365 na_ptr->items[x]->type = 0; // checked later before it is set | |
| 1366 /* Reference Types | |
| 24 | 1367 0x0002 - Signed 16bit value |
| 1368 0x0003 - Signed 32bit value | |
| 1369 0x0004 - 4-byte floating point | |
| 1370 0x0005 - Floating point double | |
| 1371 0x0006 - Signed 64-bit int | |
| 1372 0x0007 - Application Time | |
| 1373 0x000A - 32-bit error value | |
| 1374 0x000B - Boolean (non-zero = true) | |
| 1375 0x000D - Embedded Object | |
| 1376 0x0014 - 8-byte signed integer (64-bit) | |
| 1377 0x001E - Null terminated String | |
| 1378 0x001F - Unicode string | |
| 1379 0x0040 - Systime - Filetime structure | |
| 1380 0x0048 - OLE Guid | |
| 1381 0x0102 - Binary data | |
| 1382 0x1003 - Array of 32bit values | |
| 1383 0x1014 - Array of 64bit values | |
| 1384 0x101E - Array of Strings | |
| 1385 0x1102 - Array of Binary data | |
| 16 | 1386 */ |
| 1387 | |
| 35 | 1388 if (table_rec.ref_type == 0x0002 || |
| 1389 table_rec.ref_type == 0x0003 || | |
| 1390 table_rec.ref_type == 0x000b) { | |
| 1391 //contains 32 bits of data | |
| 16 | 1392 na_ptr->items[x]->size = sizeof(int32_t); |
| 1393 na_ptr->items[x]->type = table_rec.ref_type; | |
| 35 | 1394 na_ptr->items[x]->data = xmalloc(sizeof(int32_t)); |
| 1395 memcpy(na_ptr->items[x]->data, &(table_rec.value), sizeof(int32_t)); | |
| 16 | 1396 |
| 35 | 1397 } else if (table_rec.ref_type == 0x0005 || |
| 1398 table_rec.ref_type == 0x000d || | |
| 1399 table_rec.ref_type == 0x0014 || | |
| 1400 table_rec.ref_type == 0x001e || | |
| 1401 table_rec.ref_type == 0x0040 || | |
| 1402 table_rec.ref_type == 0x0048 || | |
| 1403 table_rec.ref_type == 0x0102 || | |
| 1404 table_rec.ref_type == 0x1003 || | |
| 1405 table_rec.ref_type == 0x1014 || | |
| 1406 table_rec.ref_type == 0x101e || | |
| 1407 table_rec.ref_type == 0x1102) { | |
| 1408 //contains index reference to data | |
| 16 | 1409 LE32_CPU(table_rec.value); |
| 35 | 1410 if (value_pointer) { |
| 1411 // in a type 2 block, with a value that is more than 4 bytes | |
| 1412 // directly stored in this block. | |
| 1413 na_ptr->items[x]->size = value_size; | |
| 1414 na_ptr->items[x]->type = table_rec.ref_type; | |
| 1415 na_ptr->items[x]->data = xmalloc(value_size); | |
| 1416 memcpy(na_ptr->items[x]->data, value_pointer, value_size); | |
| 1417 } | |
| 1418 else if (_pst_getBlockOffsetPointer(pf, i2_head, buf, read_size, ind_ptr, table_rec.value, &block_offset7)) { | |
| 1419 if (table_rec.value) { | |
| 1420 DEBUG_WARN(("failed to get block offset for table_rec.value of %#x\n", table_rec.value)); | |
| 1421 } | |
| 1422 na_ptr->count_item --; //we will be skipping a row | |
| 1423 continue; | |
| 1424 } | |
| 1425 else { | |
| 1426 value_size = block_offset7.to - block_offset7.from; | |
| 1427 na_ptr->items[x]->size = value_size; | |
| 1428 na_ptr->items[x]->type = table_rec.ref_type; | |
| 1429 na_ptr->items[x]->data = xmalloc(value_size+1); | |
| 1430 memcpy(na_ptr->items[x]->data, block_offset7.from, value_size); | |
| 1431 na_ptr->items[x]->data[value_size] = '\0'; // it might be a string, null terminate it. | |
| 1432 } | |
| 1433 if (table_rec.ref_type == 0xd) { | |
| 1434 // there is still more to do for the type of 0xD | |
| 1435 type_d_rec = (struct _type_d_rec*) na_ptr->items[x]->data; | |
| 1436 LE32_CPU(type_d_rec->id); | |
| 1437 if ((na_ptr->items[x]->size = _pst_ff_getID2block(pf, type_d_rec->id, i2_head, &(na_ptr->items[x]->data)))==0){ | |
| 1438 DEBUG_WARN(("not able to read the ID2 data. Setting to be read later. %#x\n", | |
| 1439 type_d_rec->id)); | |
| 1440 free(na_ptr->items[x]->data); | |
| 16 | 1441 na_ptr->items[x]->size = 0; |
| 1442 na_ptr->items[x]->data = NULL; | |
| 35 | 1443 na_ptr->items[x]->type = type_d_rec->id; |
| 16 | 1444 } |
| 1445 } | |
| 35 | 1446 if (na_ptr->items[x]->type == 0) na_ptr->items[x]->type = table_rec.ref_type; |
| 16 | 1447 } else { |
| 1448 WARN(("ERROR Unknown ref_type %#x\n", table_rec.ref_type)); | |
| 35 | 1449 freeall(buf, &block_offset1, &block_offset2, &block_offset3, &block_offset4, &block_offset5, &block_offset6, &block_offset7); |
| 31 | 1450 if (na_head) _pst_free_list(na_head); |
| 16 | 1451 DEBUG_RET(); |
| 1452 return NULL; | |
| 1453 } | |
| 1454 x++; | |
| 1455 } | |
| 1456 DEBUG_EMAIL(("increasing ind2_ptr by %i [%#x] bytes. Was %#x, Now %#x\n", rec_size, rec_size, ind2_ptr, ind2_ptr+rec_size)); | |
| 1457 ind2_ptr += rec_size; | |
| 1458 } | |
| 35 | 1459 freeall(buf, &block_offset1, &block_offset2, &block_offset3, &block_offset4, &block_offset5, &block_offset6, &block_offset7); |
| 16 | 1460 DEBUG_RET(); |
| 1461 return na_head; | |
| 1462 } | |
| 1463 | |
| 1464 | |
| 1465 // check if item->email is NULL, and init if so | |
| 1466 #define MALLOC_EMAIL(x) { if (!x->email) { x->email = (pst_item_email*) xmalloc(sizeof(pst_item_email)); memset(x->email, 0, sizeof(pst_item_email) );} } | |
| 1467 #define MALLOC_FOLDER(x) { if (!x->folder) { x->folder = (pst_item_folder*) xmalloc(sizeof(pst_item_folder)); memset(x->folder, 0, sizeof(pst_item_folder) );} } | |
| 1468 #define MALLOC_CONTACT(x) { if (!x->contact) { x->contact = (pst_item_contact*) xmalloc(sizeof(pst_item_contact)); memset(x->contact, 0, sizeof(pst_item_contact) );} } | |
| 1469 #define MALLOC_MESSAGESTORE(x) { if (!x->message_store) { x->message_store = (pst_item_message_store*) xmalloc(sizeof(pst_item_message_store)); memset(x->message_store, 0, sizeof(pst_item_message_store));} } | |
| 1470 #define MALLOC_JOURNAL(x) { if (!x->journal) { x->journal = (pst_item_journal*) xmalloc(sizeof(pst_item_journal)); memset(x->journal, 0, sizeof(pst_item_journal) );} } | |
| 1471 #define MALLOC_APPOINTMENT(x) { if (!x->appointment) { x->appointment = (pst_item_appointment*) xmalloc(sizeof(pst_item_appointment)); memset(x->appointment, 0, sizeof(pst_item_appointment) );} } | |
| 1472 // malloc space and copy the current item's data -- plus one on the size for good luck (and string termination) | |
| 1473 #define LIST_COPY(targ, type) { \ | |
| 1474 targ = type realloc(targ, list->items[x]->size+1); \ | |
| 1475 memset(targ, 0, list->items[x]->size+1); \ | |
| 1476 memcpy(targ, list->items[x]->data, list->items[x]->size); \ | |
| 1477 } | |
| 1478 | |
| 1479 #define NULL_CHECK(x) { if (!x) { DEBUG_EMAIL(("NULL_CHECK: Null Found\n")); break;} } | |
| 1480 | |
| 1481 #define MOVE_NEXT(targ) { \ | |
| 1482 if (next){\ | |
| 1483 if (!targ) {\ | |
| 1484 DEBUG_EMAIL(("MOVE_NEXT: Target is NULL. Will stop processing this option\n"));\ | |
| 1485 break;\ | |
| 1486 }\ | |
| 1487 targ = targ->next;\ | |
| 1488 if (!targ) {\ | |
| 1489 DEBUG_EMAIL(("MOVE_NEXT: Target is NULL after next. Will stop processing this option\n"));\ | |
| 1490 break;\ | |
| 1491 }\ | |
| 1492 next=0;\ | |
| 1493 }\ | |
| 1494 } | |
| 1495 | |
| 1496 | |
| 1497 int32_t _pst_process(pst_num_array *list , pst_item *item) { | |
| 1498 int32_t x, t; | |
| 1499 int32_t next = 0; | |
| 1500 pst_item_attach *attach; | |
| 1501 pst_item_extra_field *ef; | |
| 1502 | |
| 1503 DEBUG_ENT("_pst_process"); | |
| 1504 if (!item) { | |
| 1505 DEBUG_EMAIL(("item cannot be NULL.\n")); | |
| 1506 DEBUG_RET(); | |
| 1507 return -1; | |
| 1508 } | |
| 1509 | |
| 28 | 1510 attach = item->attach; // a working variable |
| 16 | 1511 |
| 1512 while (list) { | |
| 1513 x = 0; | |
| 1514 while (x < list->count_item) { | |
| 1515 // check here to see if the id is one that is mapped. | |
| 1516 DEBUG_EMAIL(("#%d - id: %#x type: %#x length: %#x\n", x, list->items[x]->id, list->items[x]->type, list->items[x]->size)); | |
| 1517 | |
| 1518 switch (list->items[x]->id) { | |
| 1519 case PST_ATTRIB_HEADER: // CUSTOM attribute for saying the Extra Headers | |
| 1520 DEBUG_EMAIL(("Extra Field - ")); | |
| 1521 ef = (pst_item_extra_field*) xmalloc(sizeof(pst_item_extra_field)); | |
| 1522 memset(ef, 0, sizeof(pst_item_extra_field)); | |
| 1523 ef->field_name = (char*) xmalloc(strlen(list->items[x]->extra)+1); | |
| 1524 strcpy(ef->field_name, list->items[x]->extra); | |
| 1525 LIST_COPY(ef->value, (char*)); | |
| 1526 ef->next = item->extra_fields; | |
| 1527 item->extra_fields = ef; | |
| 1528 DEBUG_EMAIL(("\"%s\" = \"%s\"\n", ef->field_name, ef->value)); | |
| 1529 break; | |
| 1530 case 0x0002: // PR_ALTERNATE_RECIPIENT_ALLOWED | |
| 1531 // If set to true, the sender allows this email to be autoforwarded | |
| 1532 DEBUG_EMAIL(("AutoForward allowed - ")); | |
| 1533 MALLOC_EMAIL(item); | |
| 1534 if (*((short int*)list->items[x]->data) != 0) { | |
| 1535 DEBUG_EMAIL(("True\n")); | |
| 1536 item->email->autoforward = 1; | |
| 1537 } else { | |
| 1538 DEBUG_EMAIL(("False\n")); | |
| 1539 item->email->autoforward = -1; | |
| 1540 } | |
| 1541 break; | |
| 1542 case 0x0003: // Extended Attributes table | |
| 1543 DEBUG_EMAIL(("Extended Attributes Table - NOT PROCESSED\n")); | |
| 1544 break; | |
| 1545 case 0x0017: // PR_IMPORTANCE | |
| 1546 // How important the sender deems it to be | |
| 1547 // 0 - Low | |
| 1548 // 1 - Normal | |
| 1549 // 2 - High | |
| 1550 | |
| 1551 DEBUG_EMAIL(("Importance Level - ")); | |
| 1552 MALLOC_EMAIL(item); | |
| 1553 memcpy(&(item->email->importance), list->items[x]->data, sizeof(item->email->importance)); | |
| 1554 LE32_CPU(item->email->importance); | |
| 1555 t = item->email->importance; | |
| 1556 DEBUG_EMAIL(("%s [%i]\n", (t==0?"Low":(t==1?"Normal":"High")), t)); | |
| 1557 break; | |
| 1558 case 0x001A: // PR_MESSAGE_CLASS Ascii type of messages - NOT FOLDERS | |
| 1559 // must be case insensitive | |
| 1560 DEBUG_EMAIL(("IPM.x - ")); | |
| 1561 LIST_COPY(item->ascii_type, (char*)); | |
| 1562 if (pst_strincmp("IPM.Note", item->ascii_type, 8) == 0) | |
| 1563 // the string begins with IPM.Note... | |
| 1564 item->type = PST_TYPE_NOTE; | |
| 1565 else if (pst_stricmp("IPM", item->ascii_type) == 0) | |
| 1566 // the whole string is just IPM | |
| 1567 item->type = PST_TYPE_NOTE; | |
| 1568 else if (pst_strincmp("IPM.Contact", item->ascii_type, 11) == 0) | |
| 1569 // the string begins with IPM.Contact... | |
| 1570 item->type = PST_TYPE_CONTACT; | |
| 1571 else if (pst_strincmp("REPORT.IPM.Note", item->ascii_type, 15) == 0) | |
| 1572 // the string begins with the above | |
| 1573 item->type = PST_TYPE_REPORT; | |
| 1574 else if (pst_strincmp("IPM.Activity", item->ascii_type, 12) == 0) | |
| 1575 item->type = PST_TYPE_JOURNAL; | |
| 1576 else if (pst_strincmp("IPM.Appointment", item->ascii_type, 15) == 0) | |
| 1577 item->type = PST_TYPE_APPOINTMENT; | |
| 1578 else | |
| 1579 item->type = PST_TYPE_OTHER; | |
| 1580 | |
| 1581 DEBUG_EMAIL(("%s\n", item->ascii_type)); | |
| 1582 break; | |
| 1583 case 0x0023: // PR_ORIGINATOR_DELIVERY_REPORT_REQUESTED | |
| 1584 // set if the sender wants a delivery report from all recipients | |
| 1585 DEBUG_EMAIL(("Global Delivery Report - ")); | |
| 1586 MALLOC_EMAIL(item); | |
| 1587 if (*(int16_t*)list->items[x]->data != 0) { | |
| 1588 DEBUG_EMAIL(("True\n")); | |
| 1589 item->email->delivery_report = 1; | |
| 1590 } else { | |
| 1591 DEBUG_EMAIL(("False\n")); | |
| 1592 item->email->delivery_report = 0; | |
| 1593 } | |
| 1594 break; | |
| 1595 case 0x0026: // PR_PRIORITY | |
| 1596 // Priority of a message | |
| 1597 // -1 NonUrgent | |
| 1598 // 0 Normal | |
| 1599 // 1 Urgent | |
| 1600 DEBUG_EMAIL(("Priority - ")); | |
| 1601 MALLOC_EMAIL(item); | |
| 1602 memcpy(&(item->email->priority), list->items[x]->data, sizeof(item->email->priority)); | |
| 1603 LE32_CPU(item->email->priority); | |
| 1604 t = item->email->priority; | |
| 1605 DEBUG_EMAIL(("%s [%i]\n", (t<0?"NonUrgent":(t==0?"Normal":"Urgent")), t)); | |
| 1606 break; | |
| 1607 case 0x0029:// PR_READ_RECEIPT_REQUESTED | |
| 1608 DEBUG_EMAIL(("Read Receipt - ")); | |
| 1609 MALLOC_EMAIL(item); | |
| 1610 if (*(short int*)list->items[x]->data != 0) { | |
| 1611 DEBUG_EMAIL(("True\n")); | |
| 1612 item->email->read_receipt = 1; | |
| 1613 } else { | |
| 1614 DEBUG_EMAIL(("False\n")); | |
| 1615 item->email->read_receipt = 0; | |
| 1616 } | |
| 1617 break; | |
| 1618 case 0x002B: // PR_RECIPIENT_REASSIGNMENT_PROHIBITED | |
| 1619 DEBUG_EMAIL(("Reassignment Prohibited (Private) - ")); | |
| 1620 if (*(short int*)list->items[x]->data != 0) { | |
| 1621 DEBUG_EMAIL(("True\n")); | |
| 1622 item->private_member = 1; | |
| 1623 } else { | |
| 1624 DEBUG_EMAIL(("False\n")); | |
| 1625 item->private_member = 0; | |
| 1626 } | |
| 1627 break; | |
| 1628 case 0x002E: // PR_ORIGINAL_SENSITIVITY | |
| 1629 // the sensitivity of the message before being replied to or forwarded | |
| 1630 // 0 - None | |
| 1631 // 1 - Personal | |
| 1632 // 2 - Private | |
| 1633 // 3 - Company Confidential | |
| 1634 DEBUG_EMAIL(("Original Sensitivity - ")); | |
| 1635 MALLOC_EMAIL(item); | |
| 1636 memcpy(&(item->email->orig_sensitivity), list->items[x]->data, sizeof(item->email->orig_sensitivity)); | |
| 1637 LE32_CPU(item->email->orig_sensitivity); | |
| 1638 t = item->email->orig_sensitivity; | |
| 1639 DEBUG_EMAIL(("%s [%i]\n", (t==0?"None":(t==1?"Personal": | |
| 1640 (t==2?"Private":"Company Confidential"))), t)); | |
| 1641 break; | |
| 1642 case 0x0036: // PR_SENSITIVITY | |
| 1643 // sender's opinion of the sensitivity of an email | |
| 1644 // 0 - None | |
| 1645 // 1 - Personal | |
| 1646 // 2 - Private | |
| 1647 // 3 - Company Confidiential | |
| 1648 DEBUG_EMAIL(("Sensitivity - ")); | |
| 1649 MALLOC_EMAIL(item); | |
| 1650 memcpy(&(item->email->sensitivity), list->items[x]->data, sizeof(item->email->sensitivity)); | |
| 1651 LE32_CPU(item->email->sensitivity); | |
| 1652 t = item->email->sensitivity; | |
| 1653 DEBUG_EMAIL(("%s [%i]\n", (t==0?"None":(t==1?"Personal": | |
| 1654 (t==2?"Private":"Company Confidential"))), t)); | |
| 1655 break; | |
| 1656 case 0x0037: // PR_SUBJECT raw subject | |
| 1657 // if (list->items[x]->id == 0x0037) { | |
| 1658 DEBUG_EMAIL(("Raw Subject - ")); | |
| 1659 MALLOC_EMAIL(item); | |
| 1660 item->email->subject = (pst_item_email_subject*) realloc(item->email->subject, sizeof(pst_item_email_subject)); | |
| 1661 memset(item->email->subject, 0, sizeof(pst_item_email_subject)); | |
| 1662 DEBUG_EMAIL((" [size = %i] ", list->items[x]->size)); | |
| 1663 if (list->items[x]->size > 0) { | |
| 1664 if (isprint(list->items[x]->data[0])) { | |
| 1665 // then there are no control bytes at the front | |
| 1666 item->email->subject->off1 = 0; | |
| 1667 item->email->subject->off2 = 0; | |
| 1668 item->email->subject->subj = realloc(item->email->subject->subj, list->items[x]->size+1); | |
| 1669 memset(item->email->subject->subj, 0, list->items[x]->size+1); | |
| 1670 memcpy(item->email->subject->subj, list->items[x]->data, list->items[x]->size); | |
| 1671 } else { | |
| 1672 DEBUG_EMAIL(("Raw Subject has control codes\n")); | |
| 1673 // there might be some control bytes in the first and second bytes | |
| 1674 item->email->subject->off1 = list->items[x]->data[0]; | |
| 1675 item->email->subject->off2 = list->items[x]->data[1]; | |
| 1676 item->email->subject->subj = realloc(item->email->subject->subj, (list->items[x]->size-2)+1); | |
| 1677 memset(item->email->subject->subj, 0, list->items[x]->size-1); | |
| 1678 memcpy(item->email->subject->subj, &(list->items[x]->data[2]), list->items[x]->size-2); | |
| 1679 } | |
| 1680 DEBUG_EMAIL(("%s\n", item->email->subject->subj)); | |
| 1681 } else { | |
| 1682 // obviously outlook has decided not to be straight with this one. | |
| 1683 item->email->subject->off1 = 0; | |
| 1684 item->email->subject->off2 = 0; | |
| 1685 item->email->subject = NULL; | |
| 1686 DEBUG_EMAIL(("NULL subject detected\n")); | |
| 1687 } | |
| 1688 break; | |
| 1689 case 0x0039: // PR_CLIENT_SUBMIT_TIME Date Email Sent/Created | |
| 1690 DEBUG_EMAIL(("Date sent - ")); | |
| 1691 MALLOC_EMAIL(item); | |
| 1692 LIST_COPY(item->email->sent_date, (FILETIME*)); | |
| 1693 LE32_CPU(item->email->sent_date->dwLowDateTime); | |
| 1694 LE32_CPU(item->email->sent_date->dwHighDateTime); | |
| 1695 DEBUG_EMAIL(("%s", fileTimeToAscii(item->email->sent_date))); | |
| 1696 break; | |
| 1697 case 0x003B: // PR_SENT_REPRESENTING_SEARCH_KEY Sender address 1 | |
| 1698 DEBUG_EMAIL(("Sent on behalf of address 1 - ")); | |
| 1699 MALLOC_EMAIL(item); | |
| 1700 LIST_COPY(item->email->outlook_sender, (char*)); | |
| 1701 DEBUG_EMAIL(("%s\n", item->email->outlook_sender)); | |
| 1702 break; | |
| 1703 case 0x003F: // PR_RECEIVED_BY_ENTRYID Structure containing Recipient | |
| 1704 DEBUG_EMAIL(("Recipient Structure 1 -- NOT HANDLED\n")); | |
| 1705 break; | |
| 1706 case 0x0040: // PR_RECEIVED_BY_NAME Name of Recipient Structure | |
| 1707 DEBUG_EMAIL(("Received By Name 1 -- NOT HANDLED\n")); | |
| 1708 break; | |
| 1709 case 0x0041: // PR_SENT_REPRESENTING_ENTRYID Structure containing Sender | |
| 1710 DEBUG_EMAIL(("Sent on behalf of Structure 1 -- NOT HANDLED\n")); | |
| 1711 break; | |
| 1712 case 0x0042: // PR_SENT_REPRESENTING_NAME Name of Sender Structure | |
| 1713 DEBUG_EMAIL(("Sent on behalf of Structure Name - ")); | |
| 1714 MALLOC_EMAIL(item); | |
| 1715 LIST_COPY(item->email->outlook_sender_name, (char*)); | |
| 1716 DEBUG_EMAIL(("%s\n", item->email->outlook_sender_name)); | |
| 1717 break; | |
| 1718 case 0x0043: // PR_RCVD_REPRESENTING_ENTRYID Recipient Structure 2 | |
| 1719 DEBUG_EMAIL(("Received on behalf of Structure -- NOT HANDLED\n")); | |
| 1720 break; | |
| 1721 case 0x0044: // PR_RCVD_REPRESENTING_NAME Name of Recipient Structure 2 | |
| 1722 DEBUG_EMAIL(("Received on behalf of Structure Name -- NOT HANDLED\n")); | |
| 1723 break; | |
| 1724 case 0x004F: // PR_REPLY_RECIPIENT_ENTRIES Reply-To Structure | |
| 1725 DEBUG_EMAIL(("Reply-To Structure -- NOT HANDLED\n")); | |
| 1726 break; | |
| 1727 case 0x0050: // PR_REPLY_RECIPIENT_NAMES Name of Reply-To Structure | |
| 1728 DEBUG_EMAIL(("Name of Reply-To Structure -")); | |
| 1729 MALLOC_EMAIL(item); | |
| 1730 LIST_COPY(item->email->reply_to, (char*)); | |
| 1731 DEBUG_EMAIL(("%s\n", item->email->reply_to)); | |
| 1732 break; | |
| 1733 case 0x0051: // PR_RECEIVED_BY_SEARCH_KEY Recipient Address 1 | |
| 1734 DEBUG_EMAIL(("Recipient's Address 1 (Search Key) - ")); | |
| 1735 MALLOC_EMAIL(item); | |
| 1736 LIST_COPY (item->email->outlook_recipient, (char*)); | |
| 1737 DEBUG_EMAIL(("%s\n", item->email->outlook_recipient)); | |
| 1738 break; | |
| 1739 case 0x0052: // PR_RCVD_REPRESENTING_SEARCH_KEY Recipient Address 2 | |
| 1740 DEBUG_EMAIL(("Received on behalf of Address (Search Key) - ")); | |
| 1741 MALLOC_EMAIL(item); | |
| 1742 LIST_COPY(item->email->outlook_recipient2, (char*)); | |
| 1743 DEBUG_EMAIL(("%s\n", item->email->outlook_recipient2)); | |
| 1744 break; | |
| 1745 case 0x0057: // PR_MESSAGE_TO_ME | |
| 1746 // this user is listed explicitly in the TO address | |
| 1747 DEBUG_EMAIL(("My address in TO field - ")); | |
| 1748 MALLOC_EMAIL(item); | |
| 1749 if (*(int16_t*)list->items[x]->data != 0) { | |
| 1750 DEBUG_EMAIL(("True\n")); | |
| 1751 item->email->message_to_me = 1; | |
| 1752 } else { | |
| 1753 DEBUG_EMAIL(("False\n")); | |
| 1754 item->email->message_to_me = 0; | |
| 1755 } | |
| 1756 break; | |
| 1757 case 0x0058: // PR_MESSAGE_CC_ME | |
| 1758 // this user is listed explicitly in the CC address | |
| 1759 DEBUG_EMAIL(("My address in CC field - ")); | |
| 1760 MALLOC_EMAIL(item); | |
| 1761 if (*(int16_t*)list->items[x]->data != 0) { | |
| 1762 DEBUG_EMAIL(("True\n")); | |
| 1763 item->email->message_cc_me = 1; | |
| 1764 } else { | |
| 1765 DEBUG_EMAIL(("False\n")); | |
| 1766 item->email->message_cc_me = 0; | |
| 1767 } | |
| 1768 break; | |
| 1769 case 0x0059: //PR_MESSAGE_RECIP_ME | |
| 1770 // this user appears in TO, CC or BCC address list | |
| 1771 DEBUG_EMAIL(("Message addressed to me - ")); | |
| 1772 MALLOC_EMAIL(item); | |
| 1773 if (*(int16_t*)list->items[x]->data != 0) { | |
| 1774 DEBUG_EMAIL(("True\n")); | |
| 1775 item->email->message_recip_me = 1; | |
| 1776 } else { | |
| 1777 DEBUG_EMAIL(("False\n")); | |
| 1778 item->email->message_recip_me = 0; | |
| 1779 } | |
| 1780 break; | |
| 1781 case 0x0063: // PR_RESPONSE_REQUESTED | |
| 1782 DEBUG_EMAIL(("Response requested - ")); | |
| 1783 if (*(int16_t*)list->items[x]->data != 0) { | |
| 1784 DEBUG_EMAIL(("True\n")); | |
| 1785 item->response_requested = 1; | |
| 1786 } else { | |
| 1787 DEBUG_EMAIL(("False\n")); | |
| 1788 item->response_requested = 0; | |
| 1789 } | |
| 1790 break; | |
| 1791 case 0x0064: // PR_SENT_REPRESENTING_ADDRTYPE Access method for Sender Address | |
| 1792 DEBUG_EMAIL(("Sent on behalf of address type - ")); | |
| 1793 MALLOC_EMAIL(item); | |
| 1794 LIST_COPY(item->email->sender_access, (char*)); | |
| 1795 DEBUG_EMAIL(("%s\n", item->email->sender_access)); | |
| 1796 break; | |
| 1797 case 0x0065: // PR_SENT_REPRESENTING_EMAIL_ADDRESS Sender Address | |
| 1798 DEBUG_EMAIL(("Sent on behalf of Address - ")); | |
| 1799 MALLOC_EMAIL(item); | |
| 1800 LIST_COPY(item->email->sender_address, (char*)); | |
| 1801 DEBUG_EMAIL(("%s\n", item->email->sender_address)); | |
| 1802 break; | |
| 1803 case 0x0070: // PR_CONVERSATION_TOPIC Processed Subject | |
| 1804 DEBUG_EMAIL(("Processed Subject (Conversation Topic) - ")); | |
| 1805 MALLOC_EMAIL(item); | |
| 1806 LIST_COPY(item->email->proc_subject, (char*)); | |
| 1807 DEBUG_EMAIL(("%s\n", item->email->proc_subject)); | |
| 1808 break; | |
| 1809 case 0x0071: // PR_CONVERSATION_INDEX Date 2 | |
| 1810 DEBUG_EMAIL(("Conversation Index - ")); | |
| 1811 MALLOC_EMAIL(item); | |
| 1812 memcpy(&(item->email->conv_index), list->items[x]->data, sizeof(item->email->conv_index)); | |
| 1813 DEBUG_EMAIL(("%i\n", item->email->conv_index)); | |
| 1814 break; | |
| 1815 case 0x0075: // PR_RECEIVED_BY_ADDRTYPE Recipient Access Method | |
| 1816 DEBUG_EMAIL(("Received by Address type - ")); | |
| 1817 MALLOC_EMAIL(item); | |
| 1818 LIST_COPY(item->email->recip_access, (char*)); | |
| 1819 DEBUG_EMAIL(("%s\n", item->email->recip_access)); | |
| 1820 break; | |
| 1821 case 0x0076: // PR_RECEIVED_BY_EMAIL_ADDRESS Recipient Address | |
| 1822 DEBUG_EMAIL(("Received by Address - ")); | |
| 1823 MALLOC_EMAIL(item); | |
| 1824 LIST_COPY(item->email->recip_address, (char*)); | |
| 1825 DEBUG_EMAIL(("%s\n", item->email->recip_address)); | |
| 1826 break; | |
| 1827 case 0x0077: // PR_RCVD_REPRESENTING_ADDRTYPE Recipient Access Method 2 | |
| 1828 DEBUG_EMAIL(("Received on behalf of Address type - ")); | |
| 1829 MALLOC_EMAIL(item); | |
| 1830 LIST_COPY(item->email->recip2_access, (char*)); | |
| 1831 DEBUG_EMAIL(("%s\n", item->email->recip2_access)); | |
| 1832 break; | |
| 1833 case 0x0078: // PR_RCVD_REPRESENTING_EMAIL_ADDRESS Recipient Address 2 | |
| 1834 DEBUG_EMAIL(("Received on behalf of Address -")); | |
| 1835 MALLOC_EMAIL(item); | |
| 1836 LIST_COPY(item->email->recip2_address, (char*)); | |
| 1837 DEBUG_EMAIL(("%s\n", item->email->recip2_address)); | |
| 1838 break; | |
| 1839 case 0x007D: // PR_TRANSPORT_MESSAGE_HEADERS Internet Header | |
| 1840 DEBUG_EMAIL(("Internet Header - ")); | |
| 1841 MALLOC_EMAIL(item); | |
| 1842 LIST_COPY(item->email->header, (char*)); | |
| 1843 //DEBUG_EMAIL(("%s\n", item->email->header)); | |
| 1844 DEBUG_EMAIL(("NOT PRINTED\n")); | |
| 1845 break; | |
| 1846 case 0x0C17: // PR_REPLY_REQUESTED | |
| 1847 DEBUG_EMAIL(("Reply Requested - ")); | |
| 1848 MALLOC_EMAIL(item); | |
| 1849 if (*(int16_t*)list->items[x]->data != 0) { | |
| 1850 DEBUG_EMAIL(("True\n")); | |
| 1851 item->email->reply_requested = 1; | |
| 1852 } else { | |
| 1853 DEBUG_EMAIL(("False\n")); | |
| 1854 item->email->reply_requested = 0; | |
| 1855 } | |
| 1856 break; | |
| 1857 case 0x0C19: // PR_SENDER_ENTRYID Sender Structure 2 | |
| 1858 DEBUG_EMAIL(("Sender Structure 2 -- NOT HANDLED\n")); | |
| 1859 break; | |
| 1860 case 0x0C1A: // PR_SENDER_NAME Name of Sender Structure 2 | |
| 1861 DEBUG_EMAIL(("Name of Sender Structure 2 -- NOT HANDLED\n")); | |
| 1862 break; | |
| 1863 case 0x0C1D: // PR_SENDER_SEARCH_KEY Name of Sender Address 2 | |
| 1864 DEBUG_EMAIL(("Name of Sender Address 2 (Sender search key) - ")); | |
| 1865 MALLOC_EMAIL(item); | |
| 1866 LIST_COPY(item->email->outlook_sender2, (char*)); | |
| 1867 DEBUG_EMAIL(("%s\n", item->email->outlook_sender2)); | |
| 1868 break; | |
| 1869 case 0x0C1E: // PR_SENDER_ADDRTYPE Sender Address 2 access method | |
| 1870 DEBUG_EMAIL(("Sender Address type - ")); | |
| 1871 MALLOC_EMAIL(item); | |
| 1872 LIST_COPY(item->email->sender2_access, (char*)); | |
| 1873 DEBUG_EMAIL(("%s\n", item->email->sender2_access)); | |
| 1874 break; | |
| 1875 case 0x0C1F: // PR_SENDER_EMAIL_ADDRESS Sender Address 2 | |
| 1876 DEBUG_EMAIL(("Sender Address - ")); | |
| 1877 MALLOC_EMAIL(item); | |
| 1878 LIST_COPY(item->email->sender2_address, (char*)); | |
| 1879 DEBUG_EMAIL(("%s\n", item->email->sender2_address)); | |
| 1880 break; | |
| 1881 case 0x0E01: // PR_DELETE_AFTER_SUBMIT | |
| 1882 // I am not too sure how this works | |
| 1883 DEBUG_EMAIL(("Delete after submit - ")); | |
| 1884 MALLOC_EMAIL(item); | |
| 1885 if (*(int16_t*) list->items[x]->data != 0) { | |
| 1886 DEBUG_EMAIL(("True\n")); | |
| 1887 item->email->delete_after_submit = 1; | |
| 1888 } else { | |
| 1889 DEBUG_EMAIL(("False\n")); | |
| 1890 item->email->delete_after_submit = 0; | |
| 1891 } | |
| 1892 break; | |
| 1893 case 0x0E03: // PR_DISPLAY_CC CC Addresses | |
| 1894 DEBUG_EMAIL(("Display CC Addresses - ")); | |
| 1895 MALLOC_EMAIL(item); | |
| 1896 LIST_COPY(item->email->cc_address, (char*)); | |
| 1897 DEBUG_EMAIL(("%s\n", item->email->cc_address)); | |
| 1898 break; | |
| 1899 case 0x0E04: // PR_DISPLAY_TO Address Sent-To | |
| 1900 DEBUG_EMAIL(("Display Sent-To Address - ")); | |
| 1901 MALLOC_EMAIL(item); | |
| 1902 LIST_COPY(item->email->sentto_address, (char*)); | |
| 1903 DEBUG_EMAIL(("%s\n", item->email->sentto_address)); | |
| 1904 break; | |
| 1905 case 0x0E06: // PR_MESSAGE_DELIVERY_TIME Date 3 - Email Arrival Date | |
| 1906 DEBUG_EMAIL(("Date 3 (Delivery Time) - ")); | |
| 1907 MALLOC_EMAIL(item); | |
| 1908 LIST_COPY(item->email->arrival_date, (FILETIME*)); | |
| 1909 DEBUG_EMAIL(("%s", fileTimeToAscii(item->email->arrival_date))); | |
| 1910 break; | |
| 1911 case 0x0E07: // PR_MESSAGE_FLAGS Email Flag | |
| 1912 // 0x01 - Read | |
| 1913 // 0x02 - Unmodified | |
| 1914 // 0x04 - Submit | |
| 1915 // 0x08 - Unsent | |
| 1916 // 0x10 - Has Attachments | |
| 1917 // 0x20 - From Me | |
| 1918 // 0x40 - Associated | |
| 1919 // 0x80 - Resend | |
| 1920 // 0x100 - RN Pending | |
| 1921 // 0x200 - NRN Pending | |
| 1922 DEBUG_EMAIL(("Message Flags - ")); | |
| 1923 MALLOC_EMAIL(item); | |
| 1924 memcpy(&(item->email->flag), list->items[x]->data, sizeof(item->email->flag)); | |
| 1925 LE32_CPU(item->email->flag); | |
| 1926 DEBUG_EMAIL(("%i\n", item->email->flag)); | |
| 1927 break; | |
| 1928 case 0x0E08: // PR_MESSAGE_SIZE Total size of a message object | |
| 1929 DEBUG_EMAIL(("Message Size - ")); | |
| 1930 memcpy(&(item->message_size), list->items[x]->data, sizeof(item->message_size)); | |
| 1931 LE32_CPU(item->message_size); | |
| 1932 DEBUG_EMAIL(("%i [%#x]\n", item->message_size, item->message_size)); | |
| 1933 break; | |
| 1934 case 0x0E0A: // PR_SENTMAIL_ENTRYID | |
| 1935 // folder that this message is sent to after submission | |
| 1936 DEBUG_EMAIL(("Sentmail EntryID - ")); | |
| 1937 MALLOC_EMAIL(item); | |
| 1938 LIST_COPY(item->email->sentmail_folder, (pst_entryid*)); | |
| 1939 LE32_CPU(item->email->sentmail_folder->id); | |
| 1940 DEBUG_EMAIL(("[id = %#x]\n", item->email->sentmail_folder->id)); | |
| 1941 break; | |
| 1942 case 0x0E1F: // PR_RTF_IN_SYNC | |
| 1943 // True means that the rtf version is same as text body | |
| 1944 // False means rtf version is more up-to-date than text body | |
| 1945 // if this value doesn't exist, text body is more up-to-date than rtf and | |
| 1946 // cannot update to the rtf | |
| 1947 DEBUG_EMAIL(("Compressed RTF in Sync - ")); | |
| 1948 MALLOC_EMAIL(item); | |
| 1949 if (*(int16_t*)list->items[x]->data != 0) { | |
| 1950 DEBUG_EMAIL(("True\n")); | |
| 1951 item->email->rtf_in_sync = 1; | |
| 1952 } else { | |
| 1953 DEBUG_EMAIL(("False\n")); | |
| 1954 item->email->rtf_in_sync = 0; | |
| 1955 } | |
| 1956 break; | |
| 1957 case 0x0E20: // PR_ATTACH_SIZE binary Attachment data in record | |
| 1958 DEBUG_EMAIL(("Attachment Size - ")); | |
| 1959 NULL_CHECK(attach); | |
| 1960 MOVE_NEXT(attach); | |
| 1961 memcpy(&(attach->size), list->items[x]->data, sizeof(attach->size)); | |
| 1962 DEBUG_EMAIL(("%i\n", attach->size)); | |
| 1963 break; | |
| 1964 case 0x0FF9: // PR_RECORD_KEY Record Header 1 | |
| 1965 DEBUG_EMAIL(("Record Key 1 - ")); | |
| 1966 LIST_COPY(item->record_key, (char*)); | |
| 1967 item->record_key_size = list->items[x]->size; | |
| 1968 DEBUG_EMAIL_HEXPRINT(item->record_key, item->record_key_size); | |
| 1969 DEBUG_EMAIL(("\n")); | |
| 1970 break; | |
| 1971 case 0x1000: // PR_BODY Plain Text body | |
| 1972 DEBUG_EMAIL(("Plain Text body - ")); | |
| 1973 MALLOC_EMAIL(item); | |
| 1974 LIST_COPY(item->email->body, (char*)); | |
| 1975 //DEBUG_EMAIL("%s\n", item->email->body); | |
| 1976 DEBUG_EMAIL(("NOT PRINTED\n")); | |
| 1977 break; | |
| 1978 case 0x1006: // PR_RTF_SYNC_BODY_CRC | |
| 1979 DEBUG_EMAIL(("RTF Sync Body CRC - ")); | |
| 1980 MALLOC_EMAIL(item); | |
| 1981 memcpy(&(item->email->rtf_body_crc), list->items[x]->data, sizeof(item->email->rtf_body_crc)); | |
| 1982 LE32_CPU(item->email->rtf_body_crc); | |
| 1983 DEBUG_EMAIL(("%#x\n", item->email->rtf_body_crc)); | |
| 1984 break; | |
| 1985 case 0x1007: // PR_RTF_SYNC_BODY_COUNT | |
| 1986 // a count of the *significant* charcters in the rtf body. Doesn't count | |
| 1987 // whitespace and other ignorable characters | |
| 1988 DEBUG_EMAIL(("RTF Sync Body character count - ")); | |
| 1989 MALLOC_EMAIL(item); | |
| 1990 memcpy(&(item->email->rtf_body_char_count), list->items[x]->data, sizeof(item->email->rtf_body_char_count)); | |
| 1991 LE32_CPU(item->email->rtf_body_char_count); | |
| 1992 DEBUG_EMAIL(("%i [%#x]\n", item->email->rtf_body_char_count, item->email->rtf_body_char_count)); | |
| 1993 break; | |
| 1994 case 0x1008: // PR_RTF_SYNC_BODY_TAG | |
| 1995 // the first couple of lines of RTF body so that after modification, then beginning can | |
| 1996 // once again be found | |
| 1997 DEBUG_EMAIL(("RTF Sync body tag - ")); | |
| 1998 MALLOC_EMAIL(item); | |
| 1999 LIST_COPY(item->email->rtf_body_tag, (char*)); | |
| 2000 DEBUG_EMAIL(("%s\n", item->email->rtf_body_tag)); | |
| 2001 break; | |
| 2002 case 0x1009: // PR_RTF_COMPRESSED | |
| 2003 // some compression algorithm has been applied to this. At present | |
| 2004 // it is unknown | |
| 2005 DEBUG_EMAIL(("RTF Compressed body - ")); | |
| 2006 MALLOC_EMAIL(item); | |
| 2007 LIST_COPY(item->email->rtf_compressed, (char*)); | |
| 2008 DEBUG_EMAIL(("NOT PRINTED\n")); | |
| 2009 break; | |
| 2010 case 0x1010: // PR_RTF_SYNC_PREFIX_COUNT | |
| 2011 // a count of the ignored characters before the first significant character | |
| 2012 DEBUG_EMAIL(("RTF whitespace prefix count - ")); | |
| 2013 MALLOC_EMAIL(item); | |
| 2014 memcpy(&(item->email->rtf_ws_prefix_count), list->items[x]->data, sizeof(item->email->rtf_ws_prefix_count)); | |
| 2015 DEBUG_EMAIL(("%i\n", item->email->rtf_ws_prefix_count)); | |
| 2016 break; | |
| 2017 case 0x1011: // PR_RTF_SYNC_TRAILING_COUNT | |
| 2018 // a count of the ignored characters after the last significant character | |
| 2019 DEBUG_EMAIL(("RTF whitespace tailing count - ")); | |
| 2020 MALLOC_EMAIL(item); | |
| 2021 memcpy(&(item->email->rtf_ws_trailing_count), list->items[x]->data, sizeof(item->email->rtf_ws_trailing_count)); | |
| 2022 DEBUG_EMAIL(("%i\n", item->email->rtf_ws_trailing_count)); | |
| 2023 break; | |
| 2024 case 0x1013: // HTML body | |
| 2025 DEBUG_EMAIL(("HTML body - ")); | |
| 2026 MALLOC_EMAIL(item); | |
| 2027 LIST_COPY(item->email->htmlbody, (char*)); | |
| 2028 // DEBUG_EMAIL(("%s\n", item->email->htmlbody)); | |
| 2029 DEBUG_EMAIL(("NOT PRINTED\n")); | |
| 2030 break; | |
| 2031 case 0x1035: // Message ID | |
| 2032 DEBUG_EMAIL(("Message ID - ")); | |
| 2033 MALLOC_EMAIL(item); | |
| 2034 LIST_COPY(item->email->messageid, (char*)); | |
| 2035 DEBUG_EMAIL(("%s\n", item->email->messageid)); | |
| 2036 break; | |
| 2037 case 0x1042: // in-reply-to | |
| 2038 DEBUG_EMAIL(("In-Reply-To - ")); | |
| 2039 MALLOC_EMAIL(item); | |
| 2040 LIST_COPY(item->email->in_reply_to, (char*)); | |
| 2041 DEBUG_EMAIL(("%s\n", item->email->in_reply_to)); | |
| 2042 break; | |
| 2043 case 0x1046: // Return Path | |
| 2044 DEBUG_EMAIL(("Return Path - ")); | |
| 2045 MALLOC_EMAIL(item); | |
| 2046 LIST_COPY(item->email->return_path_address, (char*)); | |
| 2047 DEBUG_EMAIL(("%s\n", item->email->return_path_address)); | |
| 2048 break; | |
| 2049 case 0x3001: // PR_DISPLAY_NAME File As | |
| 2050 DEBUG_EMAIL(("Display Name - ")); | |
| 2051 LIST_COPY(item->file_as, (char*)); | |
| 2052 DEBUG_EMAIL(("%s\n", item->file_as)); | |
| 2053 break; | |
| 2054 case 0x3002: // PR_ADDRTYPE | |
| 2055 DEBUG_EMAIL(("Address Type - ")); | |
| 2056 MALLOC_CONTACT(item); | |
| 2057 LIST_COPY(item->contact->address1_transport, (char*)); | |
| 2058 DEBUG_EMAIL(("|%s|\n", item->contact->address1_transport)); | |
| 2059 break; | |
| 2060 case 0x3003: // PR_EMAIL_ADDRESS | |
| 2061 // Contact's email address | |
| 2062 DEBUG_EMAIL(("Contact Address - ")); | |
| 2063 MALLOC_CONTACT(item); | |
| 2064 LIST_COPY(item->contact->address1, (char*)); | |
| 2065 DEBUG_EMAIL(("|%s|\n", item->contact->address1)); | |
| 2066 break; | |
| 2067 case 0x3004: // PR_COMMENT Comment for item - usually folders | |
| 2068 DEBUG_EMAIL(("Comment - ")); | |
| 2069 LIST_COPY(item->comment, (char*)); | |
| 2070 DEBUG_EMAIL(("%s\n", item->comment)); | |
| 2071 break; | |
| 2072 case 0x3007: // PR_CREATION_TIME Date 4 - Creation Date? | |
| 2073 DEBUG_EMAIL(("Date 4 (Item Creation Date) - ")); | |
| 2074 LIST_COPY(item->create_date, (FILETIME*)); | |
| 2075 DEBUG_EMAIL(("%s", fileTimeToAscii(item->create_date))); | |
| 2076 break; | |
| 2077 case 0x3008: // PR_LAST_MODIFICATION_TIME Date 5 - Modify Date | |
| 2078 DEBUG_EMAIL(("Date 5 (Modify Date) - ")); | |
| 2079 LIST_COPY(item->modify_date, (FILETIME*)); | |
| 2080 DEBUG_EMAIL(("%s", fileTimeToAscii(item->modify_date))); | |
| 2081 break; | |
| 2082 case 0x300B: // PR_SEARCH_KEY Record Header 2 | |
| 2083 DEBUG_EMAIL(("Record Search 2 -- NOT HANDLED\n")); | |
| 2084 break; | |
| 2085 case 0x35DF: // PR_VALID_FOLDER_MASK | |
| 2086 // States which folders are valid for this message store | |
| 2087 // FOLDER_IPM_SUBTREE_VALID 0x1 | |
| 2088 // FOLDER_IPM_INBOX_VALID 0x2 | |
| 2089 // FOLDER_IPM_OUTBOX_VALID 0x4 | |
| 2090 // FOLDER_IPM_WASTEBOX_VALID 0x8 | |
| 2091 // FOLDER_IPM_SENTMAIL_VALID 0x10 | |
| 2092 // FOLDER_VIEWS_VALID 0x20 | |
| 2093 // FOLDER_COMMON_VIEWS_VALID 0x40 | |
| 2094 // FOLDER_FINDER_VALID 0x80 | |
| 2095 DEBUG_EMAIL(("Valid Folder Mask - ")); | |
| 2096 MALLOC_MESSAGESTORE(item); | |
| 2097 memcpy(&(item->message_store->valid_mask), list->items[x]->data, sizeof(int)); | |
| 2098 LE32_CPU(item->message_store->valid_mask); | |
| 2099 DEBUG_EMAIL(("%i\n", item->message_store->valid_mask)); | |
| 2100 break; | |
| 2101 case 0x35E0: // PR_IPM_SUBTREE_ENTRYID Top of Personal Folder Record | |
| 2102 DEBUG_EMAIL(("Top of Personal Folder Record - ")); | |
| 2103 MALLOC_MESSAGESTORE(item); | |
| 2104 LIST_COPY(item->message_store->top_of_personal_folder, (pst_entryid*)); | |
| 2105 LE32_CPU(item->message_store->top_of_personal_folder->id); | |
| 2106 DEBUG_EMAIL(("[id = %#x]\n", item->message_store->top_of_personal_folder->id)); | |
| 2107 break; | |
| 2108 case 0x35E3: // PR_IPM_WASTEBASKET_ENTRYID Deleted Items Folder Record | |
| 2109 DEBUG_EMAIL(("Deleted Items Folder record - ")); | |
| 2110 MALLOC_MESSAGESTORE(item); | |
| 2111 LIST_COPY(item->message_store->deleted_items_folder, (pst_entryid*)); | |
| 2112 LE32_CPU(item->message_store->deleted_items_folder->id); | |
| 2113 DEBUG_EMAIL(("[id = %#x]\n", item->message_store->deleted_items_folder->id)); | |
| 2114 break; | |
| 2115 case 0x35E7: // PR_FINDER_ENTRYID Search Root Record | |
| 2116 DEBUG_EMAIL(("Search Root record - ")); | |
| 2117 MALLOC_MESSAGESTORE(item); | |
| 2118 LIST_COPY(item->message_store->search_root_folder, (pst_entryid*)); | |
| 2119 LE32_CPU(item->message_store->search_root_folder->id); | |
| 2120 DEBUG_EMAIL(("[id = %#x]\n", item->message_store->search_root_folder->id)); | |
| 2121 break; | |
| 2122 case 0x3602: // PR_CONTENT_COUNT Number of emails stored in a folder | |
| 2123 DEBUG_EMAIL(("Folder Email Count - ")); | |
| 2124 MALLOC_FOLDER(item); | |
| 2125 memcpy(&(item->folder->email_count), list->items[x]->data, sizeof(item->folder->email_count)); | |
| 2126 LE32_CPU(item->folder->email_count); | |
| 2127 DEBUG_EMAIL(("%i\n", item->folder->email_count)); | |
| 2128 break; | |
| 2129 case 0x3603: // PR_CONTENT_UNREAD Number of unread emails | |
| 2130 DEBUG_EMAIL(("Unread Email Count - ")); | |
| 2131 MALLOC_FOLDER(item); | |
| 2132 memcpy(&(item->folder->unseen_email_count), list->items[x]->data, sizeof(item->folder->unseen_email_count)); | |
| 2133 LE32_CPU(item->folder->unseen_email_count); | |
| 2134 DEBUG_EMAIL(("%i\n", item->folder->unseen_email_count)); | |
| 2135 break; | |
| 2136 case 0x360A: // PR_SUBFOLDERS Has children | |
| 2137 DEBUG_EMAIL(("Has Subfolders - ")); | |
| 2138 MALLOC_FOLDER(item); | |
| 2139 if (*((int32_t*)list->items[x]->data) != 0) { | |
| 2140 DEBUG_EMAIL(("True\n")); | |
| 2141 item->folder->subfolder = 1; | |
| 2142 } else { | |
| 2143 DEBUG_EMAIL(("False\n")); | |
| 2144 item->folder->subfolder = 0; | |
| 2145 } | |
| 2146 break; | |
| 2147 case 0x3613: // PR_CONTAINER_CLASS IPF.x | |
| 2148 DEBUG_EMAIL(("IPF.x - ")); | |
| 2149 LIST_COPY(item->ascii_type, (char*)); | |
| 2150 if (strncmp("IPF.Note", item->ascii_type, 8) == 0) | |
| 2151 item->type = PST_TYPE_NOTE; | |
| 2152 else if (strncmp("IPF.Contact", item->ascii_type, 11) == 0) | |
| 2153 item->type = PST_TYPE_CONTACT; | |
| 2154 else if (strncmp("IPF.Journal", item->ascii_type, 11) == 0) | |
| 2155 item->type = PST_TYPE_JOURNAL; | |
| 2156 else if (strncmp("IPF.Appointment", item->ascii_type, 15) == 0) | |
| 2157 item->type = PST_TYPE_APPOINTMENT; | |
| 2158 else if (strncmp("IPF.StickyNote", item->ascii_type, 14) == 0) | |
| 2159 item->type = PST_TYPE_STICKYNOTE; | |
| 2160 else if (strncmp("IPF.Task", item->ascii_type, 8) == 0) | |
| 2161 item->type = PST_TYPE_TASK; | |
| 2162 else | |
| 2163 item->type = PST_TYPE_OTHER; | |
| 2164 | |
| 2165 DEBUG_EMAIL(("%s [%i]\n", item->ascii_type, item->type)); | |
| 2166 break; | |
| 2167 case 0x3617: // PR_ASSOC_CONTENT_COUNT | |
| 2168 // associated content are items that are attached to this folder | |
| 2169 // but are hidden from users | |
| 2170 DEBUG_EMAIL(("Associate Content count - ")); | |
| 2171 MALLOC_FOLDER(item); | |
| 2172 memcpy(&(item->folder->assoc_count), list->items[x]->data, sizeof(item->folder->assoc_count)); | |
| 2173 LE32_CPU(item->folder->assoc_count); | |
| 2174 DEBUG_EMAIL(("%i [%#x]\n", item->folder->assoc_count, item->folder->assoc_count)); | |
| 2175 break; | |
| 2176 case 0x3701: // PR_ATTACH_DATA_OBJ binary data of attachment | |
| 2177 DEBUG_EMAIL(("Binary Data [Size %i] - ", list->items[x]->size)); | |
| 2178 NULL_CHECK(attach); | |
| 2179 MOVE_NEXT(attach); | |
| 2180 if (!list->items[x]->data) { //special case | |
| 2181 attach->id2_val = list->items[x]->type; | |
| 2182 DEBUG_EMAIL(("Seen a Reference. The data hasn't been loaded yet. [%#x][%#x]\n", | |
| 2183 attach->id2_val, list->items[x]->type)); | |
| 2184 } else { | |
| 2185 LIST_COPY(attach->data, (char*)); | |
| 2186 attach->size = list->items[x]->size; | |
| 2187 DEBUG_EMAIL(("NOT PRINTED\n")); | |
| 2188 } | |
| 2189 break; | |
| 2190 case 0x3704: // PR_ATTACH_FILENAME Attachment filename (8.3) | |
| 2191 DEBUG_EMAIL(("Attachment Filename - ")); | |
| 2192 NULL_CHECK(attach); | |
| 2193 MOVE_NEXT(attach); | |
| 2194 LIST_COPY(attach->filename1, (char*)); | |
| 2195 DEBUG_EMAIL(("%s\n", attach->filename1)); | |
| 2196 break; | |
| 2197 case 0x3705: // PR_ATTACH_METHOD | |
| 2198 // 0 - No Attachment | |
| 2199 // 1 - Attach by Value | |
| 2200 // 2 - Attach by reference | |
| 2201 // 3 - Attach by ref resolve | |
| 2202 // 4 - Attach by ref only | |
| 2203 // 5 - Embedded Message | |
| 2204 // 6 - OLE | |
| 2205 DEBUG_EMAIL(("Attachement method - ")); | |
| 2206 NULL_CHECK(attach); | |
| 2207 MOVE_NEXT(attach); | |
| 2208 memcpy(&(attach->method), list->items[x]->data, sizeof(attach->method)); | |
| 2209 LE32_CPU(attach->method); | |
| 2210 t = attach->method; | |
| 2211 DEBUG_EMAIL(("%s [%i]\n", (t==0?"No Attachment": | |
| 2212 (t==1?"Attach By Value": | |
| 2213 (t==2?"Attach By Reference": | |
| 2214 (t==3?"Attach by Ref. Resolve": | |
| 2215 (t==4?"Attach by Ref. Only": | |
| 2216 (t==5?"Embedded Message":"OLE")))))),t)); | |
| 2217 break; | |
| 24 | 2218 case 0x3707: // PR_ATTACH_LONG_FILENAME Attachment filename (long?) |
| 2219 DEBUG_EMAIL(("Attachment Filename long - ")); | |
| 2220 NULL_CHECK(attach); | |
| 2221 MOVE_NEXT(attach); | |
| 2222 LIST_COPY(attach->filename2, (char*)); | |
| 2223 DEBUG_EMAIL(("%s\n", attach->filename2)); | |
| 2224 break; | |
| 16 | 2225 case 0x370B: // PR_RENDERING_POSITION |
| 2226 // position in characters that the attachment appears in the plain text body | |
| 2227 DEBUG_EMAIL(("Attachment Position - ")); | |
| 2228 NULL_CHECK(attach); | |
| 2229 MOVE_NEXT(attach); | |
| 2230 memcpy(&(attach->position), list->items[x]->data, sizeof(attach->position)); | |
| 2231 LE32_CPU(attach->position); | |
| 2232 DEBUG_EMAIL(("%i [%#x]\n", attach->position)); | |
| 2233 break; | |
| 2234 case 0x370E: // PR_ATTACH_MIME_TAG Mime type of encoding | |
| 2235 DEBUG_EMAIL(("Attachment mime encoding - ")); | |
| 2236 NULL_CHECK(attach); | |
| 2237 MOVE_NEXT(attach); | |
| 2238 LIST_COPY(attach->mimetype, (char*)); | |
| 2239 DEBUG_EMAIL(("%s\n", attach->mimetype)); | |
| 2240 break; | |
| 2241 case 0x3710: // PR_ATTACH_MIME_SEQUENCE | |
| 2242 // sequence number for mime parts. Includes body | |
| 2243 DEBUG_EMAIL(("Attachment Mime Sequence - ")); | |
| 2244 NULL_CHECK(attach); | |
| 2245 MOVE_NEXT(attach); | |
| 2246 memcpy(&(attach->sequence), list->items[x]->data, sizeof(attach->sequence)); | |
| 2247 LE32_CPU(attach->sequence); | |
| 2248 DEBUG_EMAIL(("%i\n", attach->sequence)); | |
| 2249 break; | |
| 2250 case 0x3A00: // PR_ACCOUNT | |
| 2251 DEBUG_EMAIL(("Contact's Account name - ")); | |
| 2252 MALLOC_CONTACT(item); | |
| 2253 LIST_COPY(item->contact->account_name, (char*)); | |
| 2254 DEBUG_EMAIL(("%s\n", item->contact->account_name)); | |
| 2255 break; | |
| 2256 case 0x3A01: // PR_ALTERNATE_RECIPIENT | |
| 2257 DEBUG_EMAIL(("Contact Alternate Recipient - NOT PROCESSED\n")); | |
| 2258 break; | |
| 2259 case 0x3A02: // PR_CALLBACK_TELEPHONE_NUMBER | |
| 2260 DEBUG_EMAIL(("Callback telephone number - ")); | |
| 2261 MALLOC_CONTACT(item); | |
| 2262 LIST_COPY(item->contact->callback_phone, (char*)); | |
| 2263 DEBUG_EMAIL(("%s\n", item->contact->callback_phone)); | |
| 2264 break; | |
| 2265 case 0x3A03: // PR_CONVERSION_PROHIBITED | |
| 2266 DEBUG_EMAIL(("Message Conversion Prohibited - ")); | |
| 2267 MALLOC_EMAIL(item); | |
| 2268 if (*(int16_t*)list->items[x]->data != 0) { | |
| 2269 DEBUG_EMAIL(("True\n")); | |
| 2270 item->email->conversion_prohib = 1; | |
| 2271 } else { | |
| 2272 DEBUG_EMAIL(("False\n")); | |
| 2273 item->email->conversion_prohib = 0; | |
| 2274 } | |
| 2275 break; | |
| 2276 case 0x3A05: // PR_GENERATION suffix | |
| 2277 DEBUG_EMAIL(("Contacts Suffix - ")); | |
| 2278 MALLOC_CONTACT(item); | |
| 2279 LIST_COPY(item->contact->suffix, (char*)); | |
| 2280 DEBUG_EMAIL(("%s\n", item->contact->suffix)); | |
| 2281 break; | |
| 2282 case 0x3A06: // PR_GIVEN_NAME Contact's first name | |
| 2283 DEBUG_EMAIL(("Contacts First Name - ")); | |
| 2284 MALLOC_CONTACT(item); | |
| 2285 LIST_COPY(item->contact->first_name, (char*)); | |
| 2286 DEBUG_EMAIL(("%s\n", item->contact->first_name)); | |
| 2287 break; | |
| 2288 case 0x3A07: // PR_GOVERNMENT_ID_NUMBER | |
| 2289 DEBUG_EMAIL(("Contacts Government ID Number - ")); | |
| 2290 MALLOC_CONTACT(item); | |
| 2291 LIST_COPY(item->contact->gov_id, (char*)); | |
| 2292 DEBUG_EMAIL(("%s\n", item->contact->gov_id)); | |
| 2293 break; | |
| 2294 case 0x3A08: // PR_BUSINESS_TELEPHONE_NUMBER | |
| 2295 DEBUG_EMAIL(("Business Telephone Number - ")); | |
| 2296 MALLOC_CONTACT(item); | |
| 2297 LIST_COPY(item->contact->business_phone, (char*)); | |
| 2298 DEBUG_EMAIL(("%s\n", item->contact->business_phone)); | |
| 2299 break; | |
| 2300 case 0x3A09: // PR_HOME_TELEPHONE_NUMBER | |
| 2301 DEBUG_EMAIL(("Home Telephone Number - ")); | |
| 2302 MALLOC_CONTACT(item); | |
| 2303 LIST_COPY(item->contact->home_phone, (char*)); | |
| 2304 DEBUG_EMAIL(("%s\n", item->contact->home_phone)); | |
| 2305 break; | |
| 2306 case 0x3A0A: // PR_INITIALS Contact's Initials | |
| 2307 DEBUG_EMAIL(("Contacts Initials - ")); | |
| 2308 MALLOC_CONTACT(item); | |
| 2309 LIST_COPY(item->contact->initials, (char*)); | |
| 2310 DEBUG_EMAIL(("%s\n", item->contact->initials)); | |
| 2311 break; | |
| 2312 case 0x3A0B: // PR_KEYWORD | |
| 2313 DEBUG_EMAIL(("Keyword - ")); | |
| 2314 MALLOC_CONTACT(item); | |
| 2315 LIST_COPY(item->contact->keyword, (char*)); | |
| 2316 DEBUG_EMAIL(("%s\n", item->contact->keyword)); | |
| 2317 break; | |
| 2318 case 0x3A0C: // PR_LANGUAGE | |
| 2319 DEBUG_EMAIL(("Contact's Language - ")); | |
| 2320 MALLOC_CONTACT(item); | |
| 2321 LIST_COPY(item->contact->language, (char*)); | |
| 2322 DEBUG_EMAIL(("%s\n", item->contact->language)); | |
| 2323 break; | |
| 2324 case 0x3A0D: // PR_LOCATION | |
| 2325 DEBUG_EMAIL(("Contact's Location - ")); | |
| 2326 MALLOC_CONTACT(item); | |
| 2327 LIST_COPY(item->contact->location, (char*)); | |
| 2328 DEBUG_EMAIL(("%s\n", item->contact->location)); | |
| 2329 break; | |
| 2330 case 0x3A0E: // PR_MAIL_PERMISSION - Can the recipient receive and send email | |
| 2331 DEBUG_EMAIL(("Mail Permission - ")); | |
| 2332 MALLOC_CONTACT(item); | |
| 2333 if (*(int16_t*)list->items[x]->data != 0) { | |
| 2334 DEBUG_EMAIL(("True\n")); | |
| 2335 item->contact->mail_permission = 1; | |
| 2336 } else { | |
| 2337 DEBUG_EMAIL(("False\n")); | |
| 2338 item->contact->mail_permission = 0; | |
| 2339 } | |
| 2340 break; | |
| 2341 case 0x3A0F: // PR_MHS_COMMON_NAME | |
| 2342 DEBUG_EMAIL(("MHS Common Name - ")); | |
| 2343 MALLOC_EMAIL(item); | |
| 2344 LIST_COPY(item->email->common_name, (char*)); | |
| 2345 DEBUG_EMAIL(("%s\n", item->email->common_name)); | |
| 2346 break; | |
| 2347 case 0x3A10: // PR_ORGANIZATIONAL_ID_NUMBER | |
| 2348 DEBUG_EMAIL(("Organizational ID # - ")); | |
| 2349 MALLOC_CONTACT(item); | |
| 2350 LIST_COPY(item->contact->org_id, (char*)); | |
| 2351 DEBUG_EMAIL(("%s\n", item->contact->org_id)); | |
| 2352 break; | |
| 2353 case 0x3A11: // PR_SURNAME Contact's Surname | |
| 2354 DEBUG_EMAIL(("Contacts Surname - ")); | |
| 2355 MALLOC_CONTACT(item); | |
| 2356 LIST_COPY(item->contact->surname, (char*)); | |
| 2357 DEBUG_EMAIL(("%s\n", item->contact->surname)); | |
| 2358 break; | |
| 2359 case 0x3A12: // PR_ORIGINAL_ENTRY_ID | |
| 2360 DEBUG_EMAIL(("Original Entry ID - NOT PROCESSED\n")); | |
| 2361 break; | |
| 2362 case 0x3A13: // PR_ORIGINAL_DISPLAY_NAME | |
| 2363 DEBUG_EMAIL(("Original Display Name - NOT PROCESSED\n")); | |
| 2364 break; | |
| 2365 case 0x3A14: // PR_ORIGINAL_SEARCH_KEY | |
| 2366 DEBUG_EMAIL(("Original Search Key - NOT PROCESSED\n")); | |
| 2367 break; | |
| 2368 case 0x3A15: // PR_POSTAL_ADDRESS | |
| 2369 DEBUG_EMAIL(("Default Postal Address - ")); | |
| 2370 MALLOC_CONTACT(item); | |
| 2371 LIST_COPY(item->contact->def_postal_address, (char*)); | |
| 2372 DEBUG_EMAIL(("%s\n", item->contact->def_postal_address)); | |
| 2373 break; | |
| 2374 case 0x3A16: // PR_COMPANY_NAME | |
| 2375 DEBUG_EMAIL(("Company Name - ")); | |
| 2376 MALLOC_CONTACT(item); | |
| 2377 LIST_COPY(item->contact->company_name, (char*)); | |
| 2378 DEBUG_EMAIL(("%s\n", item->contact->company_name)); | |
| 2379 break; | |
| 2380 case 0x3A17: // PR_TITLE - Job Title | |
| 2381 DEBUG_EMAIL(("Job Title - ")); | |
| 2382 MALLOC_CONTACT(item); | |
| 2383 LIST_COPY(item->contact->job_title, (char*)); | |
| 2384 DEBUG_EMAIL(("%s\n", item->contact->job_title)); | |
| 2385 break; | |
| 2386 case 0x3A18: // PR_DEPARTMENT_NAME | |
| 2387 DEBUG_EMAIL(("Department Name - ")); | |
| 2388 MALLOC_CONTACT(item); | |
| 2389 LIST_COPY(item->contact->department, (char*)); | |
| 2390 DEBUG_EMAIL(("%s\n", item->contact->department)); | |
| 2391 break; | |
| 2392 case 0x3A19: // PR_OFFICE_LOCATION | |
| 2393 DEBUG_EMAIL(("Office Location - ")); | |
| 2394 MALLOC_CONTACT(item); | |
| 2395 LIST_COPY(item->contact->office_loc, (char*)); | |
| 2396 DEBUG_EMAIL(("%s\n", item->contact->office_loc)); | |
| 2397 break; | |
| 2398 case 0x3A1A: // PR_PRIMARY_TELEPHONE_NUMBER | |
| 2399 DEBUG_EMAIL(("Primary Telephone - ")); | |
| 2400 MALLOC_CONTACT(item); | |
| 2401 LIST_COPY(item->contact->primary_phone, (char*)); | |
| 2402 DEBUG_EMAIL(("%s\n", item->contact->primary_phone)); | |
| 2403 break; | |
| 2404 case 0x3A1B: // PR_BUSINESS2_TELEPHONE_NUMBER | |
| 2405 DEBUG_EMAIL(("Business Phone Number 2 - ")); | |
| 2406 MALLOC_CONTACT(item); | |
| 2407 LIST_COPY(item->contact->business_phone2, (char*)); | |
| 2408 DEBUG_EMAIL(("%s\n", item->contact->business_phone2)); | |
| 2409 break; | |
| 2410 case 0x3A1C: // PR_MOBILE_TELEPHONE_NUMBER | |
| 2411 DEBUG_EMAIL(("Mobile Phone Number - ")); | |
| 2412 MALLOC_CONTACT(item); | |
| 2413 LIST_COPY(item->contact->mobile_phone, (char*)); | |
| 2414 DEBUG_EMAIL(("%s\n", item->contact->mobile_phone)); | |
| 2415 break; | |
| 2416 case 0x3A1D: // PR_RADIO_TELEPHONE_NUMBER | |
| 2417 DEBUG_EMAIL(("Radio Phone Number - ")); | |
| 2418 MALLOC_CONTACT(item); | |
| 2419 LIST_COPY(item->contact->radio_phone, (char*)); | |
| 2420 DEBUG_EMAIL(("%s\n", item->contact->radio_phone)); | |
| 2421 break; | |
| 2422 case 0x3A1E: // PR_CAR_TELEPHONE_NUMBER | |
| 2423 DEBUG_EMAIL(("Car Phone Number - ")); | |
| 2424 MALLOC_CONTACT(item); | |
| 2425 LIST_COPY(item->contact->car_phone, (char*)); | |
| 2426 DEBUG_EMAIL(("%s\n", item->contact->car_phone)); | |
| 2427 break; | |
| 2428 case 0x3A1F: // PR_OTHER_TELEPHONE_NUMBER | |
| 2429 DEBUG_EMAIL(("Other Phone Number - ")); | |
| 2430 MALLOC_CONTACT(item); | |
| 2431 LIST_COPY(item->contact->other_phone, (char*)); | |
| 2432 DEBUG_EMAIL(("%s\n", item->contact->other_phone)); | |
| 2433 break; | |
| 2434 case 0x3A20: // PR_TRANSMITTABLE_DISPLAY_NAME | |
| 2435 DEBUG_EMAIL(("Transmittable Display Name - ")); | |
| 2436 MALLOC_CONTACT(item); | |
| 2437 LIST_COPY(item->contact->transmittable_display_name, (char*)); | |
| 2438 DEBUG_EMAIL(("%s\n", item->contact->transmittable_display_name)); | |
| 2439 break; | |
| 2440 case 0x3A21: // PR_PAGER_TELEPHONE_NUMBER | |
| 2441 DEBUG_EMAIL(("Pager Phone Number - ")); | |
| 2442 MALLOC_CONTACT(item); | |
| 2443 LIST_COPY(item->contact->pager_phone, (char*)); | |
| 2444 DEBUG_EMAIL(("%s\n", item->contact->pager_phone)); | |
| 2445 break; | |
| 2446 case 0x3A22: // PR_USER_CERTIFICATE | |
| 2447 DEBUG_EMAIL(("User Certificate - NOT PROCESSED")); | |
| 2448 break; | |
| 2449 case 0x3A23: // PR_PRIMARY_FAX_NUMBER | |
| 2450 DEBUG_EMAIL(("Primary Fax Number - ")); | |
| 2451 MALLOC_CONTACT(item); | |
| 2452 LIST_COPY(item->contact->primary_fax, (char*)); | |
| 2453 DEBUG_EMAIL(("%s\n", item->contact->primary_fax)); | |
| 2454 break; | |
| 2455 case 0x3A24: // PR_BUSINESS_FAX_NUMBER | |
| 2456 DEBUG_EMAIL(("Business Fax Number - ")); | |
| 2457 MALLOC_CONTACT(item); | |
| 2458 LIST_COPY(item->contact->business_fax, (char*)); | |
| 2459 DEBUG_EMAIL(("%s\n", item->contact->business_fax)); | |
| 2460 break; | |
| 2461 case 0x3A25: // PR_HOME_FAX_NUMBER | |
| 2462 DEBUG_EMAIL(("Home Fax Number - ")); | |
| 2463 MALLOC_CONTACT(item); | |
| 2464 LIST_COPY(item->contact->home_fax, (char*)); | |
| 2465 DEBUG_EMAIL(("%s\n", item->contact->home_fax)); | |
| 2466 break; | |
| 2467 case 0x3A26: // PR_BUSINESS_ADDRESS_COUNTRY | |
| 2468 DEBUG_EMAIL(("Business Address Country - ")); | |
| 2469 MALLOC_CONTACT(item); | |
| 2470 LIST_COPY(item->contact->business_country, (char*)); | |
| 2471 DEBUG_EMAIL(("%s\n", item->contact->business_country)); | |
| 2472 break; | |
| 2473 case 0x3A27: // PR_BUSINESS_ADDRESS_CITY | |
| 2474 DEBUG_EMAIL(("Business Address City - ")); | |
| 2475 MALLOC_CONTACT(item); | |
| 2476 LIST_COPY(item->contact->business_city, (char*)); | |
| 2477 DEBUG_EMAIL(("%s\n", item->contact->business_city)); | |
| 2478 break; | |
| 2479 case 0x3A28: // PR_BUSINESS_ADDRESS_STATE_OR_PROVINCE | |
| 2480 DEBUG_EMAIL(("Business Address State - ")); | |
| 2481 MALLOC_CONTACT(item); | |
| 2482 LIST_COPY(item->contact->business_state, (char*)); | |
| 2483 DEBUG_EMAIL(("%s\n", item->contact->business_state)); | |
| 2484 break; | |
| 2485 case 0x3A29: // PR_BUSINESS_ADDRESS_STREET | |
| 2486 DEBUG_EMAIL(("Business Address Street - ")); | |
| 2487 MALLOC_CONTACT(item); | |
| 2488 LIST_COPY(item->contact->business_street, (char*)); | |
| 2489 DEBUG_EMAIL(("%s\n", item->contact->business_street)); | |
| 2490 break; | |
| 2491 case 0x3A2A: // PR_BUSINESS_POSTAL_CODE | |
| 2492 DEBUG_EMAIL(("Business Postal Code - ")); | |
| 2493 MALLOC_CONTACT(item); | |
| 2494 LIST_COPY(item->contact->business_postal_code, (char*)); | |
| 2495 DEBUG_EMAIL(("%s\n", item->contact->business_postal_code)); | |
| 2496 break; | |
| 2497 case 0x3A2B: // PR_BUSINESS_PO_BOX | |
| 2498 DEBUG_EMAIL(("Business PO Box - ")); | |
| 2499 MALLOC_CONTACT(item); | |
| 2500 LIST_COPY(item->contact->business_po_box, (char*)); | |
| 2501 DEBUG_EMAIL(("%s\n", item->contact->business_po_box)); | |
| 2502 break; | |
| 2503 case 0x3A2C: // PR_TELEX_NUMBER | |
| 2504 DEBUG_EMAIL(("Telex Number - ")); | |
| 2505 MALLOC_CONTACT(item); | |
| 2506 LIST_COPY(item->contact->telex, (char*)); | |
| 2507 DEBUG_EMAIL(("%s\n", item->contact->telex)); | |
| 2508 break; | |
| 2509 case 0x3A2D: // PR_ISDN_NUMBER | |
| 2510 DEBUG_EMAIL(("ISDN Number - ")); | |
| 2511 MALLOC_CONTACT(item); | |
| 2512 LIST_COPY(item->contact->isdn_phone, (char*)); | |
| 2513 DEBUG_EMAIL(("%s\n", item->contact->isdn_phone)); | |
| 2514 break; | |
| 2515 case 0x3A2E: // PR_ASSISTANT_TELEPHONE_NUMBER | |
| 2516 DEBUG_EMAIL(("Assistant Phone Number - ")); | |
| 2517 MALLOC_CONTACT(item); | |
| 2518 LIST_COPY(item->contact->assistant_phone, (char*)); | |
| 2519 DEBUG_EMAIL(("%s\n", item->contact->assistant_phone)); | |
| 2520 break; | |
| 2521 case 0x3A2F: // PR_HOME2_TELEPHONE_NUMBER | |
| 2522 DEBUG_EMAIL(("Home Phone 2 - ")); | |
| 2523 MALLOC_CONTACT(item); | |
| 2524 LIST_COPY(item->contact->home_phone2, (char*)); | |
| 2525 DEBUG_EMAIL(("%s\n", item->contact->home_phone2)); | |
| 2526 break; | |
| 2527 case 0x3A30: // PR_ASSISTANT | |
| 2528 DEBUG_EMAIL(("Assistant's Name - ")); | |
| 2529 MALLOC_CONTACT(item); | |
| 2530 LIST_COPY(item->contact->assistant_name, (char*)); | |
| 2531 DEBUG_EMAIL(("%s\n", item->contact->assistant_name)); | |
| 2532 break; | |
| 2533 case 0x3A40: // PR_SEND_RICH_INFO | |
| 2534 DEBUG_EMAIL(("Can receive Rich Text - ")); | |
| 2535 MALLOC_CONTACT(item); | |
| 2536 if(*(int16_t*)list->items[x]->data != 0) { | |
| 2537 DEBUG_EMAIL(("True\n")); | |
| 2538 item->contact->rich_text = 1; | |
| 2539 } else { | |
| 2540 DEBUG_EMAIL(("False\n")); | |
| 2541 item->contact->rich_text = 0; | |
| 2542 } | |
| 2543 break; | |
| 2544 case 0x3A41: // PR_WEDDING_ANNIVERSARY | |
| 2545 DEBUG_EMAIL(("Wedding Anniversary - ")); | |
| 2546 MALLOC_CONTACT(item); | |
| 2547 LIST_COPY(item->contact->wedding_anniversary, (FILETIME*)); | |
| 2548 DEBUG_EMAIL(("%s\n", fileTimeToAscii(item->contact->wedding_anniversary))); | |
| 2549 break; | |
| 2550 case 0x3A42: // PR_BIRTHDAY | |
| 2551 DEBUG_EMAIL(("Birthday - ")); | |
| 2552 MALLOC_CONTACT(item); | |
| 2553 LIST_COPY(item->contact->birthday, (FILETIME*)); | |
| 2554 DEBUG_EMAIL(("%s\n", fileTimeToAscii(item->contact->birthday))); | |
| 2555 break; | |
| 2556 case 0x3A43: // PR_HOBBIES | |
| 2557 DEBUG_EMAIL(("Hobbies - ")); | |
| 2558 MALLOC_CONTACT(item); | |
| 2559 LIST_COPY(item->contact->hobbies, (char*)); | |
| 2560 DEBUG_EMAIL(("%s\n", item->contact->hobbies)); | |
| 2561 break; | |
| 2562 case 0x3A44: // PR_MIDDLE_NAME | |
| 2563 DEBUG_EMAIL(("Middle Name - ")); | |
| 2564 MALLOC_CONTACT(item); | |
| 2565 LIST_COPY(item->contact->middle_name, (char*)); | |
| 2566 DEBUG_EMAIL(("%s\n", item->contact->middle_name)); | |
| 2567 break; | |
| 2568 case 0x3A45: // PR_DISPLAY_NAME_PREFIX | |
| 2569 DEBUG_EMAIL(("Display Name Prefix (Title) - ")); | |
| 2570 MALLOC_CONTACT(item); | |
| 2571 LIST_COPY(item->contact->display_name_prefix, (char*)); | |
| 2572 DEBUG_EMAIL(("%s\n", item->contact->display_name_prefix)); | |
| 2573 break; | |
| 2574 case 0x3A46: // PR_PROFESSION | |
| 2575 DEBUG_EMAIL(("Profession - ")); | |
| 2576 MALLOC_CONTACT(item); | |
| 2577 LIST_COPY(item->contact->profession, (char*)); | |
| 2578 DEBUG_EMAIL(("%s\n", item->contact->profession)); | |
| 2579 break; | |
| 2580 case 0x3A47: // PR_PREFERRED_BY_NAME | |
| 2581 DEBUG_EMAIL(("Preferred By Name - ")); | |
| 2582 MALLOC_CONTACT(item); | |
| 2583 LIST_COPY(item->contact->pref_name, (char*)); | |
| 2584 DEBUG_EMAIL(("%s\n", item->contact->pref_name)); | |
| 2585 break; | |
| 2586 case 0x3A48: // PR_SPOUSE_NAME | |
| 2587 DEBUG_EMAIL(("Spouse's Name - ")); | |
| 2588 MALLOC_CONTACT(item); | |
| 2589 LIST_COPY(item->contact->spouse_name, (char*)); | |
| 2590 DEBUG_EMAIL(("%s\n", item->contact->spouse_name)); | |
| 2591 break; | |
| 2592 case 0x3A49: // PR_COMPUTER_NETWORK_NAME | |
| 2593 DEBUG_EMAIL(("Computer Network Name - ")); | |
| 2594 MALLOC_CONTACT(item); | |
| 2595 LIST_COPY(item->contact->computer_name, (char*)); | |
| 2596 DEBUG_EMAIL(("%s\n", item->contact->computer_name)); | |
| 2597 break; | |
| 2598 case 0x3A4A: // PR_CUSTOMER_ID | |
| 2599 DEBUG_EMAIL(("Customer ID - ")); | |
| 2600 MALLOC_CONTACT(item); | |
| 2601 LIST_COPY(item->contact->customer_id, (char*)); | |
| 2602 DEBUG_EMAIL(("%s\n", item->contact->customer_id)); | |
| 2603 break; | |
| 2604 case 0x3A4B: // PR_TTYTDD_PHONE_NUMBER | |
| 2605 DEBUG_EMAIL(("TTY/TDD Phone - ")); | |
| 2606 MALLOC_CONTACT(item); | |
| 2607 LIST_COPY(item->contact->ttytdd_phone, (char*)); | |
| 2608 DEBUG_EMAIL(("%s\n", item->contact->ttytdd_phone)); | |
| 2609 break; | |
| 2610 case 0x3A4C: // PR_FTP_SITE | |
| 2611 DEBUG_EMAIL(("Ftp Site - ")); | |
| 2612 MALLOC_CONTACT(item); | |
| 2613 LIST_COPY(item->contact->ftp_site, (char*)); | |
| 2614 DEBUG_EMAIL(("%s\n", item->contact->ftp_site)); | |
| 2615 break; | |
| 2616 case 0x3A4D: // PR_GENDER | |
| 2617 DEBUG_EMAIL(("Gender - ")); | |
| 2618 MALLOC_CONTACT(item); | |
| 2619 memcpy(&item->contact->gender, list->items[x]->data, sizeof(int16_t)); | |
| 2620 LE16_CPU(item->contact->gender); | |
| 2621 switch(item->contact->gender) { | |
| 2622 case 0: | |
| 2623 DEBUG_EMAIL(("Unspecified\n")); | |
| 2624 break; | |
| 2625 case 1: | |
| 2626 DEBUG_EMAIL(("Female\n")); | |
| 2627 break; | |
| 2628 case 2: | |
| 2629 DEBUG_EMAIL(("Male\n")); | |
| 2630 break; | |
| 2631 default: | |
| 2632 DEBUG_EMAIL(("Error processing\n")); | |
| 2633 } | |
| 2634 break; | |
| 2635 case 0x3A4E: // PR_MANAGER_NAME | |
| 2636 DEBUG_EMAIL(("Manager's Name - ")); | |
| 2637 MALLOC_CONTACT(item); | |
| 2638 LIST_COPY(item->contact->manager_name, (char*)); | |
| 2639 DEBUG_EMAIL(("%s\n", item->contact->manager_name)); | |
| 2640 break; | |
| 2641 case 0x3A4F: // PR_NICKNAME | |
| 2642 DEBUG_EMAIL(("Nickname - ")); | |
| 2643 MALLOC_CONTACT(item); | |
| 2644 LIST_COPY(item->contact->nickname, (char*)); | |
| 2645 DEBUG_EMAIL(("%s\n", item->contact->nickname)); | |
| 2646 break; | |
| 2647 case 0x3A50: // PR_PERSONAL_HOME_PAGE | |
| 2648 DEBUG_EMAIL(("Personal Home Page - ")); | |
| 2649 MALLOC_CONTACT(item); | |
| 2650 LIST_COPY(item->contact->personal_homepage, (char*)); | |
| 2651 DEBUG_EMAIL(("%s\n", item->contact->personal_homepage)); | |
| 2652 break; | |
| 2653 case 0x3A51: // PR_BUSINESS_HOME_PAGE | |
| 2654 DEBUG_EMAIL(("Business Home Page - ")); | |
| 2655 MALLOC_CONTACT(item); | |
| 2656 LIST_COPY(item->contact->business_homepage, (char*)); | |
| 2657 DEBUG_EMAIL(("%s\n", item->contact->business_homepage)); | |
| 2658 break; | |
| 2659 case 0x3A57: // PR_COMPANY_MAIN_PHONE_NUMBER | |
| 2660 DEBUG_EMAIL(("Company Main Phone - ")); | |
| 2661 MALLOC_CONTACT(item); | |
| 2662 LIST_COPY(item->contact->company_main_phone, (char*)); | |
| 2663 DEBUG_EMAIL(("%s\n", item->contact->company_main_phone)); | |
| 2664 break; | |
| 2665 case 0x3A58: // PR_CHILDRENS_NAMES | |
| 2666 DEBUG_EMAIL(("Children's Names - NOT PROCESSED\n")); | |
| 2667 break; | |
| 2668 case 0x3A59: // PR_HOME_ADDRESS_CITY | |
| 2669 DEBUG_EMAIL(("Home Address City - ")); | |
| 2670 MALLOC_CONTACT(item); | |
| 2671 LIST_COPY(item->contact->home_city, (char*)); | |
| 2672 DEBUG_EMAIL(("%s\n", item->contact->home_city)); | |
| 2673 break; | |
| 2674 case 0x3A5A: // PR_HOME_ADDRESS_COUNTRY | |
| 2675 DEBUG_EMAIL(("Home Address Country - ")); | |
| 2676 MALLOC_CONTACT(item); | |
| 2677 LIST_COPY(item->contact->home_country, (char*)); | |
| 2678 DEBUG_EMAIL(("%s\n", item->contact->home_country)); | |
| 2679 break; | |
| 2680 case 0x3A5B: // PR_HOME_ADDRESS_POSTAL_CODE | |
| 2681 DEBUG_EMAIL(("Home Address Postal Code - ")); | |
| 2682 MALLOC_CONTACT(item); | |
| 2683 LIST_COPY(item->contact->home_postal_code, (char*)); | |
| 2684 DEBUG_EMAIL(("%s\n", item->contact->home_postal_code)); | |
| 2685 break; | |
| 2686 case 0x3A5C: // PR_HOME_ADDRESS_STATE_OR_PROVINCE | |
| 2687 DEBUG_EMAIL(("Home Address State or Province - ")); | |
| 2688 MALLOC_CONTACT(item); | |
| 2689 LIST_COPY(item->contact->home_state, (char*)); | |
| 2690 DEBUG_EMAIL(("%s\n", item->contact->home_state)); | |
| 2691 break; | |
| 2692 case 0x3A5D: // PR_HOME_ADDRESS_STREET | |
| 2693 DEBUG_EMAIL(("Home Address Street - ")); | |
| 2694 MALLOC_CONTACT(item); | |
| 2695 LIST_COPY(item->contact->home_street, (char*)); | |
| 2696 DEBUG_EMAIL(("%s\n", item->contact->home_street)); | |
| 2697 break; | |
| 2698 case 0x3A5E: // PR_HOME_ADDRESS_POST_OFFICE_BOX | |
| 2699 DEBUG_EMAIL(("Home Address Post Office Box - ")); | |
| 2700 MALLOC_CONTACT(item); | |
| 2701 LIST_COPY(item->contact->home_po_box, (char*)); | |
| 2702 DEBUG_EMAIL(("%s\n", item->contact->home_po_box)); | |
| 2703 break; | |
| 2704 case 0x3A5F: // PR_OTHER_ADDRESS_CITY | |
| 2705 DEBUG_EMAIL(("Other Address City - ")); | |
| 2706 MALLOC_CONTACT(item); | |
| 2707 LIST_COPY(item->contact->other_city, (char*)); | |
| 2708 DEBUG_EMAIL(("%s\n", item->contact->other_city)); | |
| 2709 break; | |
| 2710 case 0x3A60: // PR_OTHER_ADDRESS_COUNTRY | |
| 2711 DEBUG_EMAIL(("Other Address Country - ")); | |
| 2712 MALLOC_CONTACT(item); | |
| 2713 LIST_COPY(item->contact->other_country, (char*)); | |
| 2714 DEBUG_EMAIL(("%s\n", item->contact->other_country)); | |
| 2715 break; | |
| 2716 case 0x3A61: // PR_OTHER_ADDRESS_POSTAL_CODE | |
| 2717 DEBUG_EMAIL(("Other Address Postal Code - ")); | |
| 2718 MALLOC_CONTACT(item); | |
| 2719 LIST_COPY(item->contact->other_postal_code, (char*)); | |
| 2720 DEBUG_EMAIL(("%s\n", item->contact->other_postal_code)); | |
| 2721 break; | |
| 2722 case 0x3A62: // PR_OTHER_ADDRESS_STATE_OR_PROVINCE | |
| 2723 DEBUG_EMAIL(("Other Address State - ")); | |
| 2724 MALLOC_CONTACT(item); | |
| 2725 LIST_COPY(item->contact->other_state, (char*)); | |
| 2726 DEBUG_EMAIL(("%s\n", item->contact->other_state)); | |
| 2727 break; | |
| 2728 case 0x3A63: // PR_OTHER_ADDRESS_STREET | |
| 2729 DEBUG_EMAIL(("Other Address Street - ")); | |
| 2730 MALLOC_CONTACT(item); | |
| 2731 LIST_COPY(item->contact->other_street, (char*)); | |
| 2732 DEBUG_EMAIL(("%s\n", item->contact->other_street)); | |
| 2733 break; | |
| 2734 case 0x3A64: // PR_OTHER_ADDRESS_POST_OFFICE_BOX | |
| 2735 DEBUG_EMAIL(("Other Address Post Office box - ")); | |
| 2736 MALLOC_CONTACT(item); | |
| 2737 LIST_COPY(item->contact->other_po_box, (char*)); | |
| 2738 DEBUG_EMAIL(("%s\n", item->contact->other_po_box)); | |
| 2739 break; | |
| 2740 case 0x65E3: // Entry ID? | |
| 2741 DEBUG_EMAIL(("Entry ID - ")); | |
| 2742 item->record_key = (char*) xmalloc(16+1); | |
| 2743 memcpy(item->record_key, &(list->items[x]->data[1]), 16); //skip first byte | |
| 2744 item->record_key[16]='\0'; | |
| 2745 item->record_key_size=16; | |
| 2746 DEBUG_EMAIL_HEXPRINT((char*)item->record_key, 16); | |
| 2747 break; | |
| 2748 case 0x67F2: // ID2 value of the attachments proper record | |
| 2749 DEBUG_EMAIL(("Attachment ID2 value - ")); | |
| 2750 if (attach){ | |
| 2751 MOVE_NEXT(attach); | |
| 2752 memcpy(&(attach->id2_val), list->items[x]->data, sizeof(attach->id2_val)); | |
| 2753 LE32_CPU(attach->id2_val); | |
| 2754 DEBUG_EMAIL(("%#x\n", attach->id2_val)); | |
| 2755 } else { | |
| 2756 DEBUG_EMAIL(("NOT AN ATTACHMENT: %#x\n", list->items[x]->id)); | |
| 2757 } | |
| 2758 break; | |
| 2759 case 0x67FF: // Extra Property Identifier (Password CheckSum) | |
| 2760 DEBUG_EMAIL(("Password checksum [0x67FF] - ")); | |
| 2761 MALLOC_MESSAGESTORE(item); | |
| 2762 memcpy(&(item->message_store->pwd_chksum), list->items[x]->data, | |
| 2763 sizeof(item->message_store->pwd_chksum)); | |
| 2764 DEBUG_EMAIL(("%#x\n", item->message_store->pwd_chksum)); | |
| 2765 break; | |
| 2766 case 0x6F02: // Secure HTML Body | |
| 2767 DEBUG_EMAIL(("Secure HTML Body - ")); | |
| 2768 MALLOC_EMAIL(item); | |
| 2769 LIST_COPY(item->email->encrypted_htmlbody, (char*)); | |
| 2770 item->email->encrypted_htmlbody_size = list->items[x]->size; | |
| 2771 DEBUG_EMAIL(("Not Printed\n")); | |
| 2772 break; | |
| 2773 case 0x6F04: // Secure Text Body | |
| 2774 DEBUG_EMAIL(("Secure Text Body - ")); | |
| 2775 MALLOC_EMAIL(item); | |
| 2776 LIST_COPY(item->email->encrypted_body, (char*)); | |
| 2777 item->email->encrypted_body_size = list->items[x]->size; | |
| 2778 DEBUG_EMAIL(("Not Printed\n")); | |
| 2779 break; | |
| 2780 case 0x7C07: // top of folders ENTRYID | |
| 2781 DEBUG_EMAIL(("Top of folders RecID [0x7c07] - ")); | |
| 2782 MALLOC_MESSAGESTORE(item); | |
| 2783 item->message_store->top_of_folder = (pst_entryid*) xmalloc(sizeof(pst_entryid)); | |
| 2784 memcpy(item->message_store->top_of_folder, list->items[x]->data, sizeof(pst_entryid)); | |
| 2785 LE32_CPU(item->message_store->top_of_folder->u1); | |
| 2786 LE32_CPU(item->message_store->top_of_folder->id); | |
| 2787 DEBUG_EMAIL_HEXPRINT((char*)item->message_store->top_of_folder->entryid, 16); | |
| 2788 break; | |
| 2789 case 0x8005: // Contact's Fullname | |
| 2790 DEBUG_EMAIL(("Contact Fullname - ")); | |
| 2791 MALLOC_CONTACT(item); | |
| 2792 LIST_COPY(item->contact->fullname, (char*)); | |
| 2793 DEBUG_EMAIL(("%s\n", item->contact->fullname)); | |
| 2794 break; | |
| 2795 case 0x801A: // Full Home Address | |
| 2796 DEBUG_EMAIL(("Home Address - ")); | |
| 2797 MALLOC_CONTACT(item); | |
| 2798 LIST_COPY(item->contact->home_address, (char*)); | |
| 2799 DEBUG_EMAIL(("%s\n", item->contact->home_address)); | |
| 2800 break; | |
| 2801 case 0x801B: // Full Business Address | |
| 2802 DEBUG_EMAIL(("Business Address - ")); | |
| 2803 MALLOC_CONTACT(item); | |
| 2804 LIST_COPY(item->contact->business_address, (char*)); | |
| 2805 DEBUG_EMAIL(("%s\n", item->contact->business_address)); | |
| 2806 break; | |
| 2807 case 0x801C: // Full Other Address | |
| 2808 DEBUG_EMAIL(("Other Address - ")); | |
| 2809 MALLOC_CONTACT(item); | |
| 2810 LIST_COPY(item->contact->other_address, (char*)); | |
| 2811 DEBUG_EMAIL(("%s\n", item->contact->other_address)); | |
| 2812 break; | |
| 2813 case 0x8082: // Email Address 1 Transport | |
| 2814 DEBUG_EMAIL(("Email Address 1 Transport - ")); | |
| 2815 MALLOC_CONTACT(item); | |
| 2816 LIST_COPY(item->contact->address1_transport, (char*)); | |
| 2817 DEBUG_EMAIL(("|%s|\n", item->contact->address1_transport)); | |
| 2818 break; | |
| 2819 case 0x8083: // Email Address 1 Address | |
| 2820 DEBUG_EMAIL(("Email Address 1 Address - ")); | |
| 2821 MALLOC_CONTACT(item); | |
| 2822 LIST_COPY(item->contact->address1, (char*)); | |
| 2823 DEBUG_EMAIL(("|%s|\n", item->contact->address1)); | |
| 2824 break; | |
| 2825 case 0x8084: // Email Address 1 Description | |
| 2826 DEBUG_EMAIL(("Email Address 1 Description - ")); | |
| 2827 MALLOC_CONTACT(item); | |
| 2828 LIST_COPY(item->contact->address1_desc, (char*)); | |
| 2829 DEBUG_EMAIL(("|%s|\n", item->contact->address1_desc)); | |
| 2830 break; | |
| 2831 case 0x8085: // Email Address 1 Record | |
| 2832 DEBUG_EMAIL(("Email Address 1 Record - ")); | |
| 2833 MALLOC_CONTACT(item); | |
| 2834 LIST_COPY(item->contact->address1a, (char*)); | |
| 2835 DEBUG_EMAIL(("|%s|\n", item->contact->address1a)); | |
| 2836 break; | |
| 2837 case 0x8092: // Email Address 2 Transport | |
| 2838 DEBUG_EMAIL(("Email Address 2 Transport - ")); | |
| 2839 MALLOC_CONTACT(item); | |
| 2840 LIST_COPY(item->contact->address2_transport, (char*)); | |
| 2841 DEBUG_EMAIL(("|%s|\n", item->contact->address2_transport)); | |
| 2842 break; | |
| 2843 case 0x8093: // Email Address 2 Address | |
| 2844 DEBUG_EMAIL(("Email Address 2 Address - ")); | |
| 2845 MALLOC_CONTACT(item); | |
| 2846 LIST_COPY(item->contact->address2, (char*)); | |
| 2847 DEBUG_EMAIL(("|%s|\n", item->contact->address2)); | |
| 2848 break; | |
| 2849 case 0x8094: // Email Address 2 Description | |
| 2850 DEBUG_EMAIL (("Email Address 2 Description - ")); | |
| 2851 MALLOC_CONTACT(item); | |
| 2852 LIST_COPY(item->contact->address2_desc, (char*)); | |
| 2853 DEBUG_EMAIL(("|%s|\n", item->contact->address2_desc)); | |
| 2854 break; | |
| 2855 case 0x8095: // Email Address 2 Record | |
| 2856 DEBUG_EMAIL(("Email Address 2 Record - ")); | |
| 2857 MALLOC_CONTACT(item); | |
| 2858 LIST_COPY(item->contact->address2a, (char*)); | |
| 2859 DEBUG_EMAIL(("|%s|\n", item->contact->address2a)); | |
| 2860 break; | |
| 2861 case 0x80A2: // Email Address 3 Transport | |
| 2862 DEBUG_EMAIL (("Email Address 3 Transport - ")); | |
| 2863 MALLOC_CONTACT(item); | |
| 2864 LIST_COPY(item->contact->address3_transport, (char*)); | |
| 2865 DEBUG_EMAIL(("|%s|\n", item->contact->address3_transport)); | |
| 2866 break; | |
| 2867 case 0x80A3: // Email Address 3 Address | |
| 2868 DEBUG_EMAIL(("Email Address 3 Address - ")); | |
| 2869 MALLOC_CONTACT(item); | |
| 2870 LIST_COPY(item->contact->address3, (char*)); | |
| 2871 DEBUG_EMAIL(("|%s|\n", item->contact->address3)); | |
| 2872 break; | |
| 2873 case 0x80A4: // Email Address 3 Description | |
| 2874 DEBUG_EMAIL(("Email Address 3 Description - ")); | |
| 2875 MALLOC_CONTACT(item); | |
| 2876 LIST_COPY(item->contact->address3_desc, (char*)); | |
| 2877 DEBUG_EMAIL(("|%s|\n", item->contact->address3_desc)); | |
| 2878 break; | |
| 2879 case 0x80A5: // Email Address 3 Record | |
| 2880 DEBUG_EMAIL(("Email Address 3 Record - ")); | |
| 2881 MALLOC_CONTACT(item); | |
| 2882 LIST_COPY(item->contact->address3a, (char*)); | |
| 2883 DEBUG_EMAIL(("|%s|\n", item->contact->address3a)); | |
| 2884 break; | |
| 2885 case 0x80D8: // Internet Free/Busy | |
| 2886 DEBUG_EMAIL(("Internet Free/Busy - ")); | |
| 2887 MALLOC_CONTACT(item); | |
| 2888 LIST_COPY(item->contact->free_busy_address, (char*)); | |
| 2889 DEBUG_EMAIL(("%s\n", item->contact->free_busy_address)); | |
| 2890 break; | |
| 2891 case 0x8205: // Show on Free/Busy as | |
| 2892 // 0: Free | |
| 2893 // 1: Tentative | |
| 2894 // 2: Busy | |
| 2895 // 3: Out Of Office | |
| 2896 DEBUG_EMAIL(("Appointment shows as - ")); | |
| 2897 MALLOC_APPOINTMENT(item); | |
| 2898 memcpy(&(item->appointment->showas), list->items[x]->data, sizeof(item->appointment->showas)); | |
| 2899 LE32_CPU(item->appointment->showas); | |
| 2900 switch (item->appointment->showas) { | |
| 2901 case PST_FREEBUSY_FREE: | |
| 2902 DEBUG_EMAIL(("Free\n")); break; | |
| 2903 case PST_FREEBUSY_TENTATIVE: | |
| 2904 DEBUG_EMAIL(("Tentative\n")); break; | |
| 2905 case PST_FREEBUSY_BUSY: | |
| 2906 DEBUG_EMAIL(("Busy\n")); break; | |
| 2907 case PST_FREEBUSY_OUT_OF_OFFICE: | |
| 2908 DEBUG_EMAIL(("Out Of Office\n")); break; | |
| 2909 default: | |
| 2910 DEBUG_EMAIL(("Unknown Value: %d\n", item->appointment->showas)); break; | |
| 2911 } | |
| 2912 break; | |
| 2913 case 0x8208: // Location of an appointment | |
| 2914 DEBUG_EMAIL(("Appointment Location - ")); | |
| 2915 MALLOC_APPOINTMENT(item); | |
| 2916 LIST_COPY(item->appointment->location, (char*)); | |
| 2917 DEBUG_EMAIL(("%s\n", item->appointment->location)); | |
| 2918 break; | |
| 2919 case 0x8214: // Label for an appointment | |
| 2920 DEBUG_EMAIL(("Label for appointment - ")); | |
| 2921 MALLOC_APPOINTMENT(item); | |
| 2922 memcpy(&(item->appointment->label), list->items[x]->data, sizeof(item->appointment->label)); | |
| 2923 LE32_CPU(item->appointment->label); | |
| 2924 switch (item->appointment->label) { | |
| 2925 case PST_APP_LABEL_NONE: | |
| 2926 DEBUG_EMAIL(("None\n")); break; | |
| 2927 case PST_APP_LABEL_IMPORTANT: | |
| 2928 DEBUG_EMAIL(("Important\n")); break; | |
| 2929 case PST_APP_LABEL_BUSINESS: | |
| 2930 DEBUG_EMAIL(("Business\n")); break; | |
| 2931 case PST_APP_LABEL_PERSONAL: | |
| 2932 DEBUG_EMAIL(("Personal\n")); break; | |
| 2933 case PST_APP_LABEL_VACATION: | |
| 2934 DEBUG_EMAIL(("Vacation\n")); break; | |
| 2935 case PST_APP_LABEL_MUST_ATTEND: | |
| 2936 DEBUG_EMAIL(("Must Attend\n")); break; | |
| 2937 case PST_APP_LABEL_TRAVEL_REQ: | |
| 2938 DEBUG_EMAIL(("Travel Required\n")); break; | |
| 2939 case PST_APP_LABEL_NEEDS_PREP: | |
| 2940 DEBUG_EMAIL(("Needs Preparation\n")); break; | |
| 2941 case PST_APP_LABEL_BIRTHDAY: | |
| 2942 DEBUG_EMAIL(("Birthday\n")); break; | |
| 2943 case PST_APP_LABEL_ANNIVERSARY: | |
| 2944 DEBUG_EMAIL(("Anniversary\n")); break; | |
| 2945 case PST_APP_LABEL_PHONE_CALL: | |
| 2946 DEBUG_EMAIL(("Phone Call\n")); break; | |
| 2947 } | |
| 2948 break; | |
| 31 | 2949 case 0x8215: // All day appointment flag |
| 2950 DEBUG_EMAIL(("All day flag - ")); | |
| 2951 MALLOC_APPOINTMENT(item); | |
| 2952 if (*(int16_t*)list->items[x]->data != 0) { | |
| 2953 DEBUG_EMAIL(("True\n")); | |
| 2954 item->appointment->all_day = 1; | |
| 2955 } else { | |
| 2956 DEBUG_EMAIL(("False\n")); | |
| 2957 item->appointment->all_day = 0; | |
| 2958 } | |
| 2959 break; | |
| 16 | 2960 case 0x8234: // TimeZone as String |
| 2961 DEBUG_EMAIL(("TimeZone of times - ")); | |
| 2962 MALLOC_APPOINTMENT(item); | |
| 2963 LIST_COPY(item->appointment->timezonestring, (char*)); | |
| 2964 DEBUG_EMAIL(("%s\n", item->appointment->timezonestring)); | |
| 2965 break; | |
| 2966 case 0x8235: // Appointment start time | |
| 2967 DEBUG_EMAIL(("Appointment Start Time - ")); | |
| 2968 MALLOC_APPOINTMENT(item); | |
| 2969 LIST_COPY(item->appointment->start, (FILETIME*)); | |
| 2970 DEBUG_EMAIL(("%s\n", fileTimeToAscii((FILETIME*)item->appointment->start))); | |
| 2971 break; | |
| 2972 case 0x8236: // Appointment end time | |
| 2973 DEBUG_EMAIL(("Appointment End Time - ")); | |
| 2974 MALLOC_APPOINTMENT(item); | |
| 2975 LIST_COPY(item->appointment->end, (FILETIME*)); | |
| 2976 DEBUG_EMAIL(("%s\n", fileTimeToAscii((FILETIME*)item->appointment->start))); | |
| 2977 break; | |
| 2978 case 0x8516: // Journal time start | |
| 2979 DEBUG_EMAIL(("Duplicate Time Start - ")); | |
| 2980 DEBUG_EMAIL(("%s\n", fileTimeToAscii((FILETIME*)list->items[x]->data))); | |
| 2981 break; | |
| 2982 case 0x8517: // Journal time end | |
| 2983 DEBUG_EMAIL(("Duplicate Time End - ")); | |
| 2984 DEBUG_EMAIL(("%s\n", fileTimeToAscii((FILETIME*)list->items[x]->data))); | |
| 2985 break; | |
| 2986 case 0x8530: // Followup | |
| 2987 DEBUG_EMAIL(("Followup String - ")); | |
| 2988 MALLOC_CONTACT(item); | |
| 2989 LIST_COPY(item->contact->followup, (char*)); | |
| 2990 DEBUG_EMAIL(("%s\n", item->contact->followup)); | |
| 2991 break; | |
| 2992 case 0x8534: // Mileage | |
| 2993 DEBUG_EMAIL(("Mileage - ")); | |
| 2994 MALLOC_CONTACT(item); | |
| 2995 LIST_COPY(item->contact->mileage, (char*)); | |
| 2996 DEBUG_EMAIL(("%s\n", item->contact->mileage)); | |
| 2997 break; | |
| 2998 case 0x8535: // Billing Information | |
| 2999 DEBUG_EMAIL(("Billing Information - ")); | |
| 3000 MALLOC_CONTACT(item); | |
| 3001 LIST_COPY(item->contact->billing_information, (char*)); | |
| 3002 DEBUG_EMAIL(("%s\n", item->contact->billing_information)); | |
| 3003 break; | |
| 3004 case 0x8554: // Outlook Version | |
| 3005 DEBUG_EMAIL(("Outlook Version - ")); | |
| 3006 LIST_COPY(item->outlook_version, (char*)); | |
| 3007 DEBUG_EMAIL(("%s\n", item->outlook_version)); | |
| 3008 break; | |
| 3009 case 0x8560: // Appointment Reminder Time | |
| 3010 DEBUG_EMAIL(("Appointment Reminder Time - ")); | |
| 3011 MALLOC_APPOINTMENT(item); | |
| 3012 LIST_COPY(item->appointment->reminder, (FILETIME*)); | |
| 3013 DEBUG_EMAIL(("%s\n", fileTimeToAscii(item->appointment->reminder))); | |
| 3014 break; | |
| 3015 case 0x8700: // Journal Type | |
| 3016 DEBUG_EMAIL(("Journal Entry Type - ")); | |
| 3017 MALLOC_JOURNAL(item); | |
| 3018 LIST_COPY(item->journal->type, (char*)); | |
| 3019 DEBUG_EMAIL(("%s\n", item->journal->type)); | |
| 3020 break; | |
| 3021 case 0x8706: // Journal Start date/time | |
| 3022 DEBUG_EMAIL(("Start Timestamp - ")); | |
| 3023 MALLOC_JOURNAL(item); | |
| 3024 LIST_COPY(item->journal->start, (FILETIME*)); | |
| 3025 DEBUG_EMAIL(("%s\n", fileTimeToAscii(item->journal->start))); | |
| 3026 break; | |
| 3027 case 0x8708: // Journal End date/time | |
| 3028 DEBUG_EMAIL(("End Timestamp - ")); | |
| 3029 MALLOC_JOURNAL(item); | |
| 3030 LIST_COPY(item->journal->end, (FILETIME*)); | |
| 3031 DEBUG_EMAIL(("%s\n", fileTimeToAscii(item->journal->end))); | |
| 3032 break; | |
| 3033 case 0x8712: // Title? | |
| 3034 DEBUG_EMAIL(("Journal Entry Type - ")); | |
| 3035 MALLOC_JOURNAL(item); | |
| 3036 LIST_COPY(item->journal->type, (char*)); | |
| 3037 DEBUG_EMAIL(("%s\n", item->journal->type)); | |
| 3038 break; | |
| 3039 default: | |
| 35 | 3040 DEBUG_EMAIL(("unknown type %#x\n", list->items[x]->id)); |
| 16 | 3041 /* Reference Types |
| 3042 | |
| 3043 2 - 0x0002 - Signed 16bit value | |
| 3044 3 - 0x0003 - Signed 32bit value | |
| 3045 11 - 0x000B - Boolean (non-zero = true) | |
| 3046 13 - 0x000D - Embedded Object | |
| 3047 30 - 0x001E - Null terminated String | |
| 3048 31 - 0x001F - Unicode string | |
| 3049 64 - 0x0040 - Systime - Filetime structure | |
| 3050 72 - 0x0048 - OLE Guid | |
| 3051 258 - 0x0102 - Binary data | |
| 3052 | |
| 3053 - 0x1003 - Array of 32bit values | |
| 3054 - 0x101E - Array of Strings | |
| 3055 - 0x1102 - Array of Binary data | |
| 3056 */ | |
| 3057 // DEBUG_EMAIL(("Unknown id [%#x, size=%#x]\n", list->items[x]->id, list->items[x]->size)); | |
| 3058 if (list->items[x]->type == 0x02) { | |
| 3059 DEBUG_EMAIL(("Unknown 16bit int = %hi\n", *(int16_t*)list->items[x]->data)); | |
| 3060 } else if (list->items[x]->type == 0x03) { | |
| 3061 DEBUG_EMAIL(("Unknown 32bit int = %i\n", *(int32_t*)list->items[x]->data)); | |
| 3062 } else if (list->items[x]->type == 0x0b) { | |
| 3063 DEBUG_EMAIL(("Unknown 16bit boolean = %s [%hi]\n", | |
| 3064 (*((int16_t*)list->items[x]->data)!=0?"True":"False"), | |
| 3065 *((int16_t*)list->items[x]->data))); | |
| 3066 } else if (list->items[x]->type == 0x1e) { | |
| 3067 DEBUG_EMAIL(("Unknown String Data = \"%s\" [%#x]\n", | |
| 3068 list->items[x]->data, list->items[x]->type)); | |
| 3069 } else if (list->items[x]->type == 0x40) { | |
| 3070 DEBUG_EMAIL(("Unknown Date = \"%s\" [%#x]\n", | |
| 3071 fileTimeToAscii((FILETIME*)list->items[x]->data), | |
| 3072 list->items[x]->type)); | |
| 3073 } else if (list->items[x]->type == 0x102) { | |
| 3074 DEBUG_EMAIL(("Unknown Binary Data [size = %#x]\n", | |
| 3075 list->items[x]->size)); | |
| 3076 DEBUG_HEXDUMP(list->items[x]->data, list->items[x]->size); | |
| 3077 } else if (list->items[x]->type == 0x101E) { | |
| 3078 DEBUG_EMAIL(("Unknown Array of Strings [%#x]\n", | |
| 3079 list->items[x]->type)); | |
| 3080 } else { | |
| 3081 DEBUG_EMAIL(("Unknown Not Printable [%#x]\n", | |
| 3082 list->items[x]->type)); | |
| 3083 } | |
| 3084 if (list->items[x]->data) { | |
| 3085 free(list->items[x]->data); | |
| 3086 list->items[x]->data = NULL; | |
| 3087 } | |
| 3088 } | |
| 3089 x++; | |
| 3090 } | |
| 3091 x = 0; | |
| 3092 list = list->next; | |
| 3093 next = 1; | |
| 3094 } | |
| 3095 DEBUG_RET(); | |
| 3096 return 0; | |
| 3097 } | |
| 3098 | |
| 3099 | |
| 3100 int32_t _pst_free_list(pst_num_array *list) { | |
| 3101 pst_num_array *l; | |
| 3102 DEBUG_ENT("_pst_free_list"); | |
| 3103 while (list) { | |
| 36 | 3104 int32_t x = 0; |
| 3105 if (list->items) { | |
| 3106 while (x < list->count_item) { | |
| 3107 if (list->items[x]) { | |
| 3108 if (list->items[x]->data) { | |
| 3109 free (list->items[x]->data); | |
| 3110 } | |
| 3111 free (list->items[x]); | |
| 3112 } | |
| 3113 x++; | |
| 16 | 3114 } |
| 3115 free(list->items); | |
| 3116 } | |
| 3117 l = list; | |
| 3118 list = list->next; | |
| 3119 free (l); | |
| 3120 } | |
| 3121 DEBUG_RET(); | |
| 3122 return 1; | |
| 3123 } | |
| 3124 | |
| 3125 | |
| 3126 int32_t _pst_free_id2(pst_index2_ll * head) { | |
| 3127 pst_index2_ll *t; | |
| 3128 DEBUG_ENT("_pst_free_id2"); | |
| 3129 while (head) { | |
| 3130 t = head->next; | |
| 3131 free (head); | |
| 3132 head = t; | |
| 3133 } | |
| 3134 DEBUG_RET(); | |
| 3135 return 1; | |
| 3136 } | |
| 3137 | |
| 3138 | |
| 3139 int32_t _pst_free_id (pst_index_ll *head) { | |
| 3140 pst_index_ll *t; | |
| 3141 DEBUG_ENT("_pst_free_id"); | |
| 3142 while (head) { | |
| 3143 t = head->next; | |
| 3144 free(head); | |
| 3145 head = t; | |
| 3146 } | |
| 3147 DEBUG_RET(); | |
| 3148 return 1; | |
| 3149 } | |
| 3150 | |
| 3151 | |
| 3152 int32_t _pst_free_desc (pst_desc_ll *head) { | |
| 3153 pst_desc_ll *t; | |
| 3154 DEBUG_ENT("_pst_free_desc"); | |
| 3155 while (head) { | |
| 3156 while (head->child) { | |
| 3157 head = head->child; | |
| 3158 } | |
| 3159 | |
| 3160 // point t to the next item | |
| 3161 t = head->next; | |
| 3162 if (!t && head->parent) { | |
| 3163 t = head->parent; | |
| 3164 t->child = NULL; // set the child to NULL so we don't come back here again! | |
| 3165 } | |
| 3166 | |
| 3167 if (head) free(head); | |
| 3168 else DIE(("head is NULL")); | |
| 3169 | |
| 3170 head = t; | |
| 3171 } | |
| 3172 DEBUG_RET(); | |
| 3173 return 1; | |
| 3174 } | |
| 3175 | |
| 3176 | |
| 3177 int32_t _pst_free_xattrib(pst_x_attrib_ll *x) { | |
| 3178 pst_x_attrib_ll *t; | |
| 3179 DEBUG_ENT("_pst_free_xattrib"); | |
| 3180 while (x) { | |
| 3181 if (x->data) free(x->data); | |
| 3182 t = x->next; | |
| 3183 free(x); | |
| 3184 x = t; | |
| 3185 } | |
| 3186 DEBUG_RET(); | |
| 3187 return 1; | |
| 3188 } | |
| 3189 | |
| 3190 | |
| 3191 pst_index2_ll * _pst_build_id2(pst_file *pf, pst_index_ll* list, pst_index2_ll* head_ptr) { | |
| 3192 pst_block_header block_head; | |
| 3193 pst_index2_ll *head = NULL, *tail = NULL; | |
| 3194 int32_t x = 0, b_ptr = 0; | |
| 3195 char *buf = NULL; | |
| 3196 pst_id2_assoc id2_rec; | |
| 3197 pst_index_ll *i_ptr = NULL; | |
| 3198 pst_index2_ll *i2_ptr = NULL; | |
| 3199 DEBUG_ENT("_pst_build_id2"); | |
| 31 | 3200 |
| 16 | 3201 if (head_ptr) { |
| 3202 head = head_ptr; | |
| 3203 while (head_ptr) head_ptr = (tail = head_ptr)->next; | |
| 3204 } | |
| 3205 if (_pst_read_block_size(pf, list->offset, list->size, &buf, PST_NO_ENC, 0) < list->size) { | |
| 3206 //an error occured in block read | |
| 3207 WARN(("block read error occured. offset = %#x, size = %#x\n", list->offset, list->size)); | |
| 31 | 3208 if (buf) free(buf); |
| 16 | 3209 DEBUG_RET(); |
| 3210 return NULL; | |
| 3211 } | |
| 3212 DEBUG_HEXDUMPC(buf, list->size, 16); | |
| 3213 | |
| 3214 memcpy(&block_head, buf, sizeof(block_head)); | |
| 3215 LE16_CPU(block_head.type); | |
| 3216 LE16_CPU(block_head.count); | |
| 3217 | |
| 3218 if (block_head.type != 0x0002) { // some sort of constant? | |
| 3219 WARN(("Unknown constant [%#x] at start of id2 values [offset %#x].\n", block_head.type, list->offset)); | |
| 31 | 3220 if (buf) free(buf); |
| 16 | 3221 DEBUG_RET(); |
| 3222 return NULL; | |
| 3223 } | |
| 3224 | |
| 3225 DEBUG_INDEX(("ID %#x is likely to be a description record. Count is %i (offset %#x)\n", | |
| 3226 list->id, block_head.count, list->offset)); | |
| 3227 x = 0; | |
| 3228 b_ptr = 0x04; | |
| 3229 while (x < block_head.count) { | |
| 3230 memcpy(&id2_rec, &(buf[b_ptr]), sizeof(id2_rec)); | |
| 3231 LE32_CPU(id2_rec.id2); | |
| 3232 LE32_CPU(id2_rec.id); | |
| 3233 LE32_CPU(id2_rec.table2); | |
| 3234 | |
| 3235 b_ptr += sizeof(id2_rec); | |
| 3236 DEBUG_INDEX(("\tid2 = %#x, id = %#x, table2 = %#x\n", id2_rec.id2, id2_rec.id, id2_rec.table2)); | |
| 3237 if ((i_ptr = _pst_getID(pf, id2_rec.id)) == NULL) { | |
| 3238 DEBUG_WARN(("\t\t%#x - Not Found\n", id2_rec.id)); | |
| 3239 } else { | |
| 3240 DEBUG_INDEX(("\t\t%#x - Offset %#x, u1 %#x, Size %i(%#x)\n", i_ptr->id, i_ptr->offset, i_ptr->u1, i_ptr->size, i_ptr->size)); | |
| 3241 // add it to the linked list | |
| 3242 i2_ptr = (pst_index2_ll*) xmalloc(sizeof(pst_index2_ll)); | |
| 3243 i2_ptr->id2 = id2_rec.id2; | |
| 3244 i2_ptr->id = i_ptr; | |
| 3245 i2_ptr->next = NULL; | |
| 3246 if (!head) head = i2_ptr; | |
| 3247 if (tail) tail->next = i2_ptr; | |
| 3248 tail = i2_ptr; | |
| 3249 if (id2_rec.table2 != 0) { | |
| 3250 if ((i_ptr = _pst_getID(pf, id2_rec.table2)) == NULL) { | |
| 3251 DEBUG_WARN(("\tTable2 [%#x] not found\n", id2_rec.table2)); | |
| 3252 } | |
| 3253 else { | |
| 3254 DEBUG_INDEX(("\tGoing deeper for table2 [%#x]\n", id2_rec.table2)); | |
| 3255 if ((i2_ptr = _pst_build_id2(pf, i_ptr, head))) { | |
| 3256 // DEBUG_INDEX(("_pst_build_id2(): \t\tAdding new list onto end of current\n")); | |
| 3257 // if (!head) | |
| 3258 // head = i2_ptr; | |
| 3259 // if (tail) | |
| 3260 // tail->next = i2_ptr; | |
| 3261 // while (i2_ptr->next) | |
| 3262 // i2_ptr = i2_ptr->next; | |
| 3263 // tail = i2_ptr; | |
| 3264 } | |
| 3265 // need to re-establish tail | |
| 3266 DEBUG_INDEX(("Returned from depth\n")); | |
| 3267 if (tail) { | |
| 3268 while (tail->next) tail = tail->next; | |
| 3269 } | |
| 3270 } | |
| 3271 } | |
| 3272 } | |
| 3273 x++; | |
| 3274 } | |
| 3275 if (buf) free (buf); | |
| 3276 DEBUG_RET(); | |
| 3277 return head; | |
| 3278 } | |
| 3279 | |
| 3280 | |
| 3281 // This version of free does NULL check first | |
| 3282 #define SAFE_FREE(x) {if (x) free(x);} | |
| 3283 | |
| 3284 void _pst_freeItem(pst_item *item) { | |
| 3285 pst_item_attach *t; | |
| 3286 pst_item_extra_field *et; | |
| 3287 | |
| 3288 DEBUG_ENT("_pst_freeItem"); | |
| 3289 if (item) { | |
| 3290 if (item->email) { | |
| 3291 SAFE_FREE(item->email->arrival_date); | |
| 3292 SAFE_FREE(item->email->body); | |
| 3293 SAFE_FREE(item->email->cc_address); | |
| 3294 SAFE_FREE(item->email->common_name); | |
| 3295 SAFE_FREE(item->email->encrypted_body); | |
| 3296 SAFE_FREE(item->email->encrypted_htmlbody); | |
| 3297 SAFE_FREE(item->email->header); | |
| 3298 SAFE_FREE(item->email->htmlbody); | |
| 3299 SAFE_FREE(item->email->in_reply_to); | |
| 3300 SAFE_FREE(item->email->messageid); | |
| 3301 SAFE_FREE(item->email->outlook_recipient); | |
| 3302 SAFE_FREE(item->email->outlook_recipient2); | |
| 3303 SAFE_FREE(item->email->outlook_sender); | |
| 3304 SAFE_FREE(item->email->outlook_sender_name); | |
| 3305 SAFE_FREE(item->email->outlook_sender2); | |
| 3306 SAFE_FREE(item->email->proc_subject); | |
| 3307 SAFE_FREE(item->email->recip_access); | |
| 3308 SAFE_FREE(item->email->recip_address); | |
| 3309 SAFE_FREE(item->email->recip2_access); | |
| 3310 SAFE_FREE(item->email->recip2_address); | |
| 3311 SAFE_FREE(item->email->reply_to); | |
| 3312 SAFE_FREE(item->email->rtf_body_tag); | |
| 3313 SAFE_FREE(item->email->rtf_compressed); | |
| 3314 SAFE_FREE(item->email->return_path_address); | |
| 3315 SAFE_FREE(item->email->sender_access); | |
| 3316 SAFE_FREE(item->email->sender_address); | |
| 3317 SAFE_FREE(item->email->sender2_access); | |
| 3318 SAFE_FREE(item->email->sender2_address); | |
| 3319 SAFE_FREE(item->email->sent_date); | |
| 3320 SAFE_FREE(item->email->sentmail_folder); | |
| 3321 SAFE_FREE(item->email->sentto_address); | |
| 3322 if (item->email->subject) | |
| 3323 SAFE_FREE(item->email->subject->subj); | |
| 3324 SAFE_FREE(item->email->subject); | |
| 3325 free(item->email); | |
| 3326 } | |
| 3327 if (item->folder) { | |
| 3328 free(item->folder); | |
| 3329 } | |
| 3330 if (item->message_store) { | |
| 3331 SAFE_FREE(item->message_store->deleted_items_folder); | |
| 3332 SAFE_FREE(item->message_store->search_root_folder); | |
| 3333 SAFE_FREE(item->message_store->top_of_personal_folder); | |
| 3334 SAFE_FREE(item->message_store->top_of_folder); | |
| 3335 free(item->message_store); | |
| 3336 } | |
| 3337 if (item->contact) { | |
| 3338 SAFE_FREE(item->contact->access_method); | |
| 3339 SAFE_FREE(item->contact->account_name); | |
| 3340 SAFE_FREE(item->contact->address1); | |
| 3341 SAFE_FREE(item->contact->address1a); | |
| 3342 SAFE_FREE(item->contact->address1_desc); | |
| 3343 SAFE_FREE(item->contact->address1_transport); | |
| 3344 SAFE_FREE(item->contact->address2); | |
| 3345 SAFE_FREE(item->contact->address2a); | |
| 3346 SAFE_FREE(item->contact->address2_desc); | |
| 3347 SAFE_FREE(item->contact->address2_transport); | |
| 3348 SAFE_FREE(item->contact->address3); | |
| 3349 SAFE_FREE(item->contact->address3a); | |
| 3350 SAFE_FREE(item->contact->address3_desc); | |
| 3351 SAFE_FREE(item->contact->address3_transport); | |
| 3352 SAFE_FREE(item->contact->assistant_name); | |
| 3353 SAFE_FREE(item->contact->assistant_phone); | |
| 3354 SAFE_FREE(item->contact->billing_information); | |
| 3355 SAFE_FREE(item->contact->birthday); | |
| 3356 SAFE_FREE(item->contact->business_address); | |
| 3357 SAFE_FREE(item->contact->business_city); | |
| 3358 SAFE_FREE(item->contact->business_country); | |
| 3359 SAFE_FREE(item->contact->business_fax); | |
| 3360 SAFE_FREE(item->contact->business_homepage); | |
| 3361 SAFE_FREE(item->contact->business_phone); | |
| 3362 SAFE_FREE(item->contact->business_phone2); | |
| 3363 SAFE_FREE(item->contact->business_po_box); | |
| 3364 SAFE_FREE(item->contact->business_postal_code); | |
| 3365 SAFE_FREE(item->contact->business_state); | |
| 3366 SAFE_FREE(item->contact->business_street); | |
| 3367 SAFE_FREE(item->contact->callback_phone); | |
| 3368 SAFE_FREE(item->contact->car_phone); | |
| 3369 SAFE_FREE(item->contact->company_main_phone); | |
| 3370 SAFE_FREE(item->contact->company_name); | |
| 3371 SAFE_FREE(item->contact->computer_name); | |
| 3372 SAFE_FREE(item->contact->customer_id); | |
| 3373 SAFE_FREE(item->contact->def_postal_address); | |
| 3374 SAFE_FREE(item->contact->department); | |
| 3375 SAFE_FREE(item->contact->display_name_prefix); | |
| 3376 SAFE_FREE(item->contact->first_name); | |
| 3377 SAFE_FREE(item->contact->followup); | |
| 3378 SAFE_FREE(item->contact->free_busy_address); | |
| 3379 SAFE_FREE(item->contact->ftp_site); | |
| 3380 SAFE_FREE(item->contact->fullname); | |
| 3381 SAFE_FREE(item->contact->gov_id); | |
| 3382 SAFE_FREE(item->contact->hobbies); | |
| 3383 SAFE_FREE(item->contact->home_address); | |
| 3384 SAFE_FREE(item->contact->home_city); | |
| 3385 SAFE_FREE(item->contact->home_country); | |
| 3386 SAFE_FREE(item->contact->home_fax); | |
| 3387 SAFE_FREE(item->contact->home_po_box); | |
| 3388 SAFE_FREE(item->contact->home_phone); | |
| 3389 SAFE_FREE(item->contact->home_phone2); | |
| 3390 SAFE_FREE(item->contact->home_postal_code); | |
| 3391 SAFE_FREE(item->contact->home_state); | |
| 3392 SAFE_FREE(item->contact->home_street); | |
| 3393 SAFE_FREE(item->contact->initials); | |
| 3394 SAFE_FREE(item->contact->isdn_phone); | |
| 3395 SAFE_FREE(item->contact->job_title); | |
| 3396 SAFE_FREE(item->contact->keyword); | |
| 3397 SAFE_FREE(item->contact->language); | |
| 3398 SAFE_FREE(item->contact->location); | |
| 3399 SAFE_FREE(item->contact->manager_name); | |
| 3400 SAFE_FREE(item->contact->middle_name); | |
| 3401 SAFE_FREE(item->contact->mileage); | |
| 3402 SAFE_FREE(item->contact->mobile_phone); | |
| 3403 SAFE_FREE(item->contact->nickname); | |
| 3404 SAFE_FREE(item->contact->office_loc); | |
| 3405 SAFE_FREE(item->contact->org_id); | |
| 3406 SAFE_FREE(item->contact->other_address); | |
| 3407 SAFE_FREE(item->contact->other_city); | |
| 3408 SAFE_FREE(item->contact->other_country); | |
| 3409 SAFE_FREE(item->contact->other_phone); | |
| 3410 SAFE_FREE(item->contact->other_po_box); | |
| 3411 SAFE_FREE(item->contact->other_postal_code); | |
| 3412 SAFE_FREE(item->contact->other_state); | |
| 3413 SAFE_FREE(item->contact->other_street); | |
| 3414 SAFE_FREE(item->contact->pager_phone); | |
| 3415 SAFE_FREE(item->contact->personal_homepage); | |
| 3416 SAFE_FREE(item->contact->pref_name); | |
| 3417 SAFE_FREE(item->contact->primary_fax); | |
| 3418 SAFE_FREE(item->contact->primary_phone); | |
| 3419 SAFE_FREE(item->contact->profession); | |
| 3420 SAFE_FREE(item->contact->radio_phone); | |
| 3421 SAFE_FREE(item->contact->spouse_name); | |
| 3422 SAFE_FREE(item->contact->suffix); | |
| 3423 SAFE_FREE(item->contact->surname); | |
| 3424 SAFE_FREE(item->contact->telex); | |
| 3425 SAFE_FREE(item->contact->transmittable_display_name); | |
| 3426 SAFE_FREE(item->contact->ttytdd_phone); | |
| 3427 SAFE_FREE(item->contact->wedding_anniversary); | |
| 3428 free(item->contact); | |
| 3429 } | |
| 3430 while (item->attach) { | |
| 3431 SAFE_FREE(item->attach->filename1); | |
| 3432 SAFE_FREE(item->attach->filename2); | |
| 3433 SAFE_FREE(item->attach->mimetype); | |
| 3434 SAFE_FREE(item->attach->data); | |
| 3435 t = item->attach->next; | |
| 3436 free(item->attach); | |
| 3437 item->attach = t; | |
| 3438 } | |
| 3439 while (item->extra_fields) { | |
| 3440 SAFE_FREE(item->extra_fields->field_name); | |
| 3441 SAFE_FREE(item->extra_fields->value); | |
| 3442 et = item->extra_fields->next; | |
| 3443 free(item->extra_fields); | |
| 3444 item->extra_fields = et; | |
| 3445 } | |
| 3446 if (item->journal) { | |
| 3447 SAFE_FREE(item->journal->end); | |
| 3448 SAFE_FREE(item->journal->start); | |
| 3449 SAFE_FREE(item->journal->type); | |
| 3450 free(item->journal); | |
| 3451 } | |
| 3452 if (item->appointment) { | |
| 3453 SAFE_FREE(item->appointment->location); | |
| 3454 SAFE_FREE(item->appointment->reminder); | |
| 3455 SAFE_FREE(item->appointment->start); | |
| 3456 SAFE_FREE(item->appointment->end); | |
| 3457 SAFE_FREE(item->appointment->timezonestring); | |
| 3458 free(item->appointment); | |
| 3459 } | |
| 3460 SAFE_FREE(item->ascii_type); | |
| 3461 SAFE_FREE(item->comment); | |
| 3462 SAFE_FREE(item->create_date); | |
| 3463 SAFE_FREE(item->file_as); | |
| 3464 SAFE_FREE(item->modify_date); | |
| 3465 SAFE_FREE(item->outlook_version); | |
| 3466 SAFE_FREE(item->record_key); | |
| 3467 free(item); | |
| 3468 } | |
| 3469 DEBUG_RET(); | |
| 3470 } | |
| 3471 | |
| 3472 | |
| 35 | 3473 /** |
| 3474 * The offset might be zero, in which case we have no data, so return a pair of null pointers. | |
| 3475 * Or, the offset might end in 0xf, so it is an id2 pointer, in which case we read the id2 block. | |
| 3476 * Otherwise, the offset>>4 is an index into the table of offsets in the buffer. | |
| 3477 */ | |
| 3478 int32_t _pst_getBlockOffsetPointer(pst_file *pf, pst_index2_ll *i2_head, unsigned char *buf, int32_t read_size, int32_t i_offset, int32_t offset, pst_block_offset_pointer *p) { | |
| 3479 int32_t size; | |
| 3480 pst_block_offset block_offset; | |
| 3481 DEBUG_ENT("_pst_getBlockOffsetPointer"); | |
| 3482 if (p->needfree) free(p->from); | |
| 3483 p->from = NULL; | |
| 3484 p->needfree = 0; | |
| 3485 if (!offset) { | |
| 3486 p->from = p->to = NULL; | |
| 3487 } | |
| 3488 else if ((offset & 0xf) == 0xf) { | |
| 3489 DEBUG_WARN(("Found id2 %#x value. Will follow it\n", offset)); | |
| 3490 size = _pst_ff_getID2block(pf, offset, i2_head, &(p->from)); | |
| 3491 if (size) { | |
| 3492 p->to = p->from + size; | |
| 3493 p->needfree = 1; | |
| 3494 } | |
| 3495 else { | |
| 3496 p->from = p->to = NULL; | |
| 3497 } | |
| 3498 } | |
| 3499 else if (_pst_getBlockOffset(buf, read_size, i_offset, offset, &block_offset)) { | |
| 3500 p->from = p->to = NULL; | |
| 3501 } | |
| 3502 else { | |
| 3503 p->from = buf + block_offset.from; | |
| 3504 p->to = buf + block_offset.to; | |
| 3505 } | |
| 3506 DEBUG_RET(); | |
| 3507 return (p->from) ? 0 : 1; | |
| 3508 } | |
| 3509 | |
| 3510 | |
| 31 | 3511 int32_t _pst_getBlockOffset(unsigned char *buf, int32_t read_size, int32_t i_offset, int32_t offset, pst_block_offset *p) { |
| 35 | 3512 int32_t low = offset & 0xf; |
| 3513 int32_t of1 = offset >> 4; | |
| 16 | 3514 DEBUG_ENT("_pst_getBlockOffset"); |
| 35 | 3515 if (!p || !buf || !i_offset || low || (i_offset+2+of1+sizeof(*p) > read_size)) { |
| 3516 DEBUG_WARN(("p is NULL or buf is NULL or offset is 0 or offset has low bits or beyond read size (%p, %p, %#x, %i, %i)\n", p, buf, offset, read_size, i_offset)); | |
| 16 | 3517 DEBUG_RET(); |
| 3518 return -1; | |
| 3519 } | |
| 3520 memcpy(&(p->from), &(buf[(i_offset+2)+of1]), sizeof(p->from)); | |
| 3521 memcpy(&(p->to), &(buf[(i_offset+2)+of1+sizeof(p->from)]), sizeof(p->to)); | |
| 3522 LE16_CPU(p->from); | |
| 3523 LE16_CPU(p->to); | |
| 35 | 3524 DEBUG_WARN(("get block offset finds from=%i(%#x), to=%i(%#x)\n", p->from, p->from, p->to, p->to)); |
| 3525 if (p->from > p->to) { | |
| 3526 DEBUG_WARN(("get block offset from > to")); | |
| 3527 return -1; | |
| 3528 } | |
| 16 | 3529 DEBUG_RET(); |
| 3530 return 0; | |
| 3531 } | |
| 3532 | |
| 3533 | |
| 35 | 3534 pst_index_ll* _pst_getID(pst_file* pf, u_int32_t id) { |
| 16 | 3535 pst_index_ll *ptr = NULL; |
| 3536 DEBUG_ENT("_pst_getID"); | |
| 3537 if (id == 0) { | |
| 3538 DEBUG_RET(); | |
| 3539 return NULL; | |
| 3540 } | |
| 3541 | |
| 35 | 3542 //if (id & 1) DEBUG_INDEX(("have odd id bit %#x\n", id)); |
| 3543 //if (id & 2) DEBUG_INDEX(("have two id bit %#x\n", id)); | |
| 3544 id &= 0xFFFFFFFE; | |
| 16 | 3545 |
| 3546 DEBUG_INDEX(("Trying to find %#x\n", id)); | |
| 3547 if (!ptr) ptr = pf->i_head; | |
| 3548 while (ptr && (ptr->id != id)) { | |
| 3549 ptr = ptr->next; | |
| 3550 } | |
| 35 | 3551 if (ptr) {DEBUG_INDEX(("Found Value %#x\n", id)); } |
| 3552 else {DEBUG_INDEX(("ERROR: Value %#x not found\n", id)); } | |
| 16 | 3553 DEBUG_RET(); |
| 3554 return ptr; | |
| 3555 } | |
| 3556 | |
| 3557 | |
| 3558 pst_index_ll * _pst_getID2(pst_index2_ll *ptr, u_int32_t id) { | |
| 3559 DEBUG_ENT("_pst_getID2"); | |
| 3560 DEBUG_INDEX(("Head = %p\n", ptr)); | |
| 3561 DEBUG_INDEX(("Trying to find %#x\n", id)); | |
| 3562 while (ptr && (ptr->id2 != id)) { | |
| 3563 ptr = ptr->next; | |
| 3564 } | |
| 3565 if (ptr) { | |
| 3566 if (ptr->id) {DEBUG_INDEX(("Found value %#x\n", ptr->id->id)); } | |
| 3567 else {DEBUG_INDEX(("Found value, though it is NULL!\n"));} | |
| 3568 DEBUG_RET(); | |
| 3569 return ptr->id; | |
| 3570 } | |
| 3571 DEBUG_INDEX(("ERROR Not Found\n")); | |
| 3572 DEBUG_RET(); | |
| 3573 return NULL; | |
| 3574 } | |
| 3575 | |
| 3576 | |
| 35 | 3577 /** |
| 3578 * find the id in the descriptor tree rooted at pf->d_head | |
| 3579 * | |
| 3580 * @param pf global pst file pointer | |
| 3581 * @param id the id we are looking for | |
| 3582 * | |
| 3583 * @return pointer to the pst_desc_ll node in the descriptor tree | |
| 3584 */ | |
| 3585 pst_desc_ll* _pst_getDptr(pst_file *pf, u_int32_t id) { | |
| 16 | 3586 pst_desc_ll *ptr = pf->d_head; |
| 3587 DEBUG_ENT("_pst_getDptr"); | |
| 3588 while (ptr && (ptr->id != id)) { | |
| 3589 if (ptr->child) { | |
| 3590 ptr = ptr->child; | |
| 3591 continue; | |
| 3592 } | |
| 3593 while (!ptr->next && ptr->parent) { | |
| 3594 ptr = ptr->parent; | |
| 3595 } | |
| 3596 ptr = ptr->next; | |
| 3597 } | |
| 3598 DEBUG_RET(); | |
| 3599 return ptr; // will be NULL or record we are looking for | |
| 3600 } | |
| 3601 | |
| 3602 | |
| 3603 int32_t _pst_printDptr(pst_file *pf) { | |
| 3604 pst_desc_ll *ptr = pf->d_head; | |
| 3605 int32_t depth = 0; | |
| 3606 char spaces[100]; | |
| 3607 DEBUG_ENT("_pst_printDptr"); | |
| 3608 memset(spaces, ' ', 99); | |
| 3609 spaces[99] = '\0'; | |
| 3610 while (ptr) { | |
| 3611 DEBUG_INDEX(("%s%#x [%i] desc=%#x, list=%#x\n", &(spaces[(99-depth<0?0:99-depth)]), ptr->id, ptr->no_child, | |
| 3612 (ptr->desc==NULL?0:ptr->desc->id), | |
| 3613 (ptr->list_index==NULL?0:ptr->list_index->id))); | |
| 3614 if (ptr->child) { | |
| 3615 depth++; | |
| 3616 ptr = ptr->child; | |
| 3617 continue; | |
| 3618 } | |
| 3619 while (!ptr->next && ptr->parent) { | |
| 3620 depth--; | |
| 3621 ptr = ptr->parent; | |
| 3622 } | |
| 3623 ptr = ptr->next; | |
| 3624 } | |
| 3625 DEBUG_RET(); | |
| 3626 return 0; | |
| 3627 } | |
| 3628 | |
| 3629 | |
| 3630 int32_t _pst_printIDptr(pst_file* pf) { | |
| 3631 pst_index_ll *ptr = pf->i_head; | |
| 3632 DEBUG_ENT("_pst_printIDptr"); | |
| 3633 while (ptr) { | |
| 3634 DEBUG_INDEX(("%#x offset=%#x size=%#x\n", ptr->id, ptr->offset, ptr->size)); | |
| 3635 ptr = ptr->next; | |
| 3636 } | |
| 3637 DEBUG_RET(); | |
| 3638 return 0; | |
| 3639 } | |
| 3640 | |
| 3641 | |
| 3642 int32_t _pst_printID2ptr(pst_index2_ll *ptr) { | |
| 3643 DEBUG_ENT("_pst_printID2ptr"); | |
| 3644 while (ptr) { | |
| 3645 DEBUG_INDEX(("%#x id=%#x\n", ptr->id2, (ptr->id!=NULL?ptr->id->id:0))); | |
| 3646 ptr = ptr->next; | |
| 3647 } | |
| 3648 DEBUG_RET(); | |
| 3649 return 0; | |
| 3650 } | |
| 3651 | |
| 3652 | |
| 3653 size_t _pst_read_block(FILE *fp, int32_t offset, void **buf) { | |
| 3654 size_t size; | |
| 3655 int32_t fpos; | |
| 3656 DEBUG_ENT("_pst_read_block"); | |
| 3657 DEBUG_READ(("Reading block from %#x\n", offset)); | |
| 3658 fpos = ftell(fp); | |
| 3659 fseek(fp, offset, SEEK_SET); | |
| 3660 fread(&size, sizeof(int16_t), 1, fp); | |
| 3661 fseek(fp, offset, SEEK_SET); | |
| 3662 DEBUG_READ(("Allocating %i bytes\n", size)); | |
| 3663 if (*buf) { | |
| 3664 DEBUG_READ(("Freeing old memory\n")); | |
| 3665 free(*buf); | |
| 3666 } | |
| 3667 *buf = (void*)xmalloc(size); | |
| 3668 size = fread(*buf, 1, size, fp); | |
| 3669 fseek(fp, fpos, SEEK_SET); | |
| 3670 DEBUG_RET(); | |
| 3671 return size; | |
| 3672 } | |
| 3673 | |
| 3674 | |
| 3675 // when the first byte of the block being read is 01, then we can assume | |
| 3676 // that it is a list of further ids to read and we will follow those ids | |
| 3677 // recursively calling this function until we have all the data | |
| 3678 // we could do decryption of the encrypted PST files here | |
| 3679 size_t _pst_read_block_size(pst_file *pf, int32_t offset, size_t size, char ** buf, int32_t do_enc, unsigned char is_index) { | |
| 3680 u_int32_t fpos, x; | |
| 3681 int16_t count, y; | |
| 3682 char *buf2 = NULL, *buf3 = NULL; | |
| 3683 unsigned char fdepth; | |
| 3684 pst_index_ll *ptr = NULL; | |
| 3685 size_t rsize, z; | |
| 31 | 3686 |
| 16 | 3687 DEBUG_ENT("_pst_read_block_size"); |
| 3688 DEBUG_READ(("Reading block from %#x, %i bytes\n", offset, size)); | |
| 31 | 3689 |
| 16 | 3690 fpos = ftell(pf->fp); |
| 3691 fseek(pf->fp, offset, SEEK_SET); | |
| 3692 if (*buf) { | |
| 3693 DEBUG_READ(("Freeing old memory\n")); | |
| 3694 free(*buf); | |
| 3695 } | |
| 3696 | |
| 31 | 3697 *buf = (void*) xmalloc(size+1); //plus one so that we can NUL terminate it later |
| 16 | 3698 rsize = fread(*buf, 1, size, pf->fp); |
| 3699 if (rsize != size) { | |
| 3700 DEBUG_WARN(("Didn't read all that I could. fread returned less [%i instead of %i]\n", rsize, size)); | |
| 3701 if (feof(pf->fp)) { | |
| 3702 DEBUG_WARN(("We tried to read past the end of the file at [offset %#x, size %#x]\n", offset, size)); | |
| 3703 } else if (ferror(pf->fp)) { | |
| 3704 DEBUG_WARN(("Error is set on file stream.\n")); | |
| 3705 } else { | |
| 3706 DEBUG_WARN(("I can't tell why it failed\n")); | |
| 3707 } | |
| 3708 size = rsize; | |
| 3709 } | |
| 3710 | |
| 3711 // DEBUG_HEXDUMP(*buf, size); | |
| 3712 | |
| 3713 /* if (is_index) { | |
| 3714 DEBUG_READ(("_pst_read_block_size: ODD_BLOCK should be here\n")); | |
| 3715 DEBUG_READ(("\t: byte 0-1: %#x %#x\n", (*buf)[0], (*buf)[1])); | |
| 3716 }*/ | |
| 3717 | |
| 3718 if ((*buf)[0] == 0x01 && (*buf)[1] != 0x00 && is_index) { | |
| 3719 //don't do this recursion if we should be at a leaf node | |
| 3720 memcpy(&count, &((*buf)[2]), sizeof(int16_t)); | |
| 3721 LE16_CPU(count); | |
| 3722 memcpy(&fdepth, &((*buf)[1]), sizeof(fdepth)); | |
| 3723 DEBUG_READ(("Seen indexes to blocks. Depth is %i\n", fdepth)); | |
| 3724 // do fancy stuff! :) | |
| 3725 DEBUG_READ(("There are %i ids\n", count)); | |
| 3726 // if first 2 blocks are 01 01 then index to blocks | |
| 3727 size = 0; | |
| 3728 y = 0; | |
| 3729 while (y < count) { | |
| 3730 memcpy(&x, &(*buf)[0x08+(y*4)], sizeof(int32_t)); | |
| 3731 LE32_CPU(x); | |
| 3732 if ((ptr = _pst_getID(pf, x)) == NULL) { | |
| 3733 WARN(("Error. Cannot find ID [%#x] during multi-block read\n", x)); | |
| 3734 buf3 = (char*) realloc(buf3, size+1); | |
| 3735 buf3[size] = '\0'; | |
| 3736 *buf = buf3; | |
| 3737 fseek(pf->fp, fpos, SEEK_SET); | |
| 3738 DEBUG_RET(); | |
| 3739 return size; | |
| 3740 } | |
| 3741 if ((z = _pst_read_block_size(pf, ptr->offset, ptr->size, &buf2, do_enc, fdepth-1)) < ptr->size) { | |
| 3742 buf3 = (char*) realloc(buf3, size+1); | |
| 3743 buf3[size] = '\0'; | |
| 3744 *buf = buf3; | |
| 3745 fseek(pf->fp, fpos, SEEK_SET); | |
| 3746 DEBUG_RET(); | |
| 3747 return size; | |
| 3748 } | |
| 3749 DEBUG_READ(("Melding newley retrieved block with bigger one. New size is %i\n", size+z)); | |
| 3750 buf3 = (char*) realloc(buf3, size+z+1); //plus one so that we can null terminate it later | |
| 3751 DEBUG_READ(("Doing copy. Start pos is %i, length is %i\n", size, z)); | |
| 3752 memcpy(&(buf3[size]), buf2, z); | |
| 3753 size += z; | |
| 3754 y++; | |
| 3755 } | |
| 3756 free(*buf); | |
| 3757 if (buf2) free(buf2); | |
| 3758 if (!buf3) { | |
| 3759 // this can happen if count == 0. We should create an empty buffer so we don't | |
| 3760 // confuse any clients | |
| 3761 buf3 = (char*) xmalloc(1); | |
| 3762 } | |
| 3763 *buf = buf3; | |
| 3764 } else if (do_enc && pf->encryption) | |
| 3765 _pst_decrypt(*buf, size, pf->encryption); | |
| 3766 | |
| 3767 (*buf)[size] = '\0'; //should be byte after last one read | |
| 3768 fseek(pf->fp, fpos, SEEK_SET); | |
| 3769 DEBUG_RET(); | |
| 3770 return size; | |
| 3771 } | |
| 3772 | |
| 3773 | |
| 3774 int32_t _pst_decrypt(unsigned char *buf, size_t size, int32_t type) { | |
| 3775 size_t x = 0; | |
| 3776 unsigned char y; | |
| 3777 DEBUG_ENT("_pst_decrypt"); | |
| 3778 if (!buf) { | |
| 3779 DEBUG_RET(); | |
| 3780 return -1; | |
| 3781 } | |
| 3782 | |
| 3783 if (type == PST_COMP_ENCRYPT) { | |
| 3784 x = 0; | |
| 3785 while (x < size) { | |
| 3786 y = buf[x]; | |
| 3787 DEBUG_DECRYPT(("Transposing %#hhx to %#hhx [%#x]\n", buf[x], comp_enc[y], y)); | |
| 3788 buf[x] = comp_enc[y]; // transpose from encrypt array | |
| 3789 x++; | |
| 3790 } | |
| 3791 } else { | |
| 3792 WARN(("Unknown encryption: %i. Cannot decrypt\n", type)); | |
| 3793 DEBUG_RET(); | |
| 3794 return -1; | |
| 3795 } | |
| 3796 DEBUG_RET(); | |
| 3797 return 0; | |
| 3798 } | |
| 3799 | |
| 3800 | |
| 3801 int32_t _pst_getAtPos(FILE *fp, int32_t pos, void* buf, u_int32_t size) { | |
| 3802 DEBUG_ENT("_pst_getAtPos"); | |
| 3803 if (fseek(fp, pos, SEEK_SET) == -1) { | |
| 3804 DEBUG_RET(); | |
| 3805 return 1; | |
| 3806 } | |
| 3807 | |
| 3808 if (fread(buf, 1, size, fp) < size) { | |
| 3809 DEBUG_RET(); | |
| 3810 return 2; | |
| 3811 } | |
| 3812 DEBUG_RET(); | |
| 3813 return 0; | |
| 3814 } | |
| 3815 | |
| 3816 | |
| 3817 int32_t _pst_get (FILE *fp, void *buf, u_int32_t size) { | |
| 3818 DEBUG_ENT("_pst_get"); | |
| 3819 if (fread(buf, 1, size, fp) < size) { | |
| 3820 DEBUG_RET(); | |
| 3821 return 1; | |
| 3822 } | |
| 3823 DEBUG_RET(); | |
| 3824 return 0; | |
| 3825 } | |
| 3826 | |
| 3827 | |
| 3828 size_t _pst_ff_getIDblock_dec(pst_file *pf, u_int32_t id, unsigned char **b) { | |
| 3829 size_t r; | |
| 3830 DEBUG_ENT("_pst_ff_getIDblock_dec"); | |
| 35 | 3831 DEBUG_INDEX(("for id %#x\n", id)); |
| 16 | 3832 r = _pst_ff_getIDblock(pf, id, b); |
| 35 | 3833 int noenc = (id & 2); // disable encryption |
| 3834 if ((pf->encryption) & !(noenc)) { | |
| 3835 _pst_decrypt(*b, r, pf->encryption); | |
| 3836 } | |
| 36 | 3837 DEBUG_HEXDUMPC(*b, r, 16); |
| 16 | 3838 DEBUG_RET(); |
| 3839 return r; | |
| 3840 } | |
| 3841 | |
| 3842 | |
| 3843 size_t _pst_ff_getIDblock(pst_file *pf, u_int32_t id, unsigned char** b) { | |
| 3844 pst_index_ll *rec; | |
| 3845 size_t rsize = 0;//, re_size=0; | |
| 3846 DEBUG_ENT("_pst_ff_getIDblock"); | |
| 3847 if ((rec = _pst_getID(pf, id)) == NULL) { | |
| 3848 DEBUG_INDEX(("Cannot find ID %#x\n", id)); | |
| 3849 DEBUG_RET(); | |
| 3850 return 0; | |
| 3851 } | |
| 3852 fseek(pf->fp, rec->offset, SEEK_SET); | |
| 3853 if (*b) { | |
| 3854 DEBUG_INDEX(("freeing old memory in b\n")); | |
| 3855 free(*b); | |
| 3856 } | |
| 3857 | |
| 3858 DEBUG_INDEX(("id = %#x, record size = %#x, offset = %#x\n", id, rec->size, rec->offset)); | |
| 3859 *b = (char*) xmalloc(rec->size+1); | |
| 3860 rsize = fread(*b, 1, rec->size, pf->fp); | |
| 3861 if (rsize != rec->size) { | |
| 3862 DEBUG_WARN(("Didn't read all the size. fread returned less [%i instead of %i]\n", rsize, rec->size)); | |
| 3863 if (feof(pf->fp)) { | |
| 3864 DEBUG_WARN(("We tried to read past the end of the file [offset %#x, size %#x]\n", rec->offset, rec->size)); | |
| 3865 } else if (ferror(pf->fp)) { | |
| 3866 DEBUG_WARN(("Some error occured on the file stream\n")); | |
| 3867 } else { | |
| 3868 DEBUG_WARN(("No error has been set on the file stream\n")); | |
| 3869 } | |
| 3870 } | |
| 3871 DEBUG_RET(); | |
| 3872 return rsize; | |
| 3873 } | |
| 3874 | |
| 3875 | |
| 3876 #define PST_PTR_BLOCK_SIZE 0x120 | |
| 3877 size_t _pst_ff_getID2block(pst_file *pf, u_int32_t id2, pst_index2_ll *id2_head, unsigned char** buf) { | |
| 3878 pst_index_ll* ptr; | |
| 3879 // size_t ret; | |
| 3880 struct holder h = {buf, NULL, 0}; | |
| 3881 DEBUG_ENT("_pst_ff_getID2block"); | |
| 3882 ptr = _pst_getID2(id2_head, id2); | |
| 3883 | |
| 3884 if (!ptr) { | |
| 3885 DEBUG_INDEX(("Cannot find id2 value %#x\n", id2)); | |
| 3886 DEBUG_RET(); | |
| 3887 return 0; | |
| 3888 } | |
| 3889 DEBUG_RET(); | |
| 3890 return _pst_ff_getID2data(pf, ptr, &h); | |
| 3891 } | |
| 3892 | |
| 3893 | |
| 3894 size_t _pst_ff_getID2data(pst_file *pf, pst_index_ll *ptr, struct holder *h) { | |
| 3895 // if the attachment begins with 01 01, <= 256 bytes, it is stored in the record | |
| 3896 int32_t ret; | |
| 3897 unsigned char *b = NULL, *t; | |
| 3898 DEBUG_ENT("_pst_ff_getID2data"); | |
| 3899 if (!(ptr->id & 0x02)) { | |
| 3900 ret = _pst_ff_getIDblock_dec(pf, ptr->id, &b); | |
| 3901 if (h->buf) { | |
| 3902 *(h->buf) = b; | |
| 3903 } else if ((h->base64 == 1) && h->fp) { | |
| 3904 t = base64_encode(b, ret); | |
| 31 | 3905 if (t) pst_fwrite(t, 1, strlen(t), h->fp); |
| 16 | 3906 free(b); |
| 3907 } else if (h->fp) { | |
| 3908 pst_fwrite(b, 1, ret, h->fp); | |
| 3909 free(b); | |
| 3910 } | |
| 3911 //if ((*buf)[0] == 0x1) { | |
| 3912 // DEBUG_WARN(("WARNING: buffer starts with 0x1, but I didn't expect it to!\n")); | |
| 3913 //} | |
| 3914 } else { | |
| 3915 // here we will assume it is a block that points to others | |
| 3916 DEBUG_READ(("Assuming it is a multi-block record because of it's id\n")); | |
| 3917 ret = _pst_ff_compile_ID(pf, ptr->id, h, 0); | |
| 3918 } | |
| 3919 if (h->buf && *h->buf) | |
| 3920 (*(h->buf))[ret]='\0'; | |
| 3921 DEBUG_RET(); | |
| 3922 return ret; | |
| 3923 } | |
| 3924 | |
| 3925 | |
| 3926 size_t _pst_ff_compile_ID(pst_file *pf, u_int32_t id, struct holder *h, int32_t size) { | |
| 3927 size_t z, a; | |
| 3928 u_int16_t count, y; | |
| 3929 u_int32_t x, b; | |
| 3930 unsigned char * buf3 = NULL, *buf2 = NULL, *t; | |
| 3931 unsigned char fdepth; | |
| 3932 | |
| 3933 DEBUG_ENT("_pst_ff_compile_ID"); | |
| 31 | 3934 if ((a = _pst_ff_getIDblock(pf, id, &buf3))==0) { |
| 3935 if (buf3) free(buf3); | |
| 16 | 3936 return 0; |
| 31 | 3937 } |
| 16 | 3938 if ((buf3[0] != 0x1)) { // if bit 8 is set) { |
| 3939 // if ((buf3)[0] != 0x1 && (buf3)[1] > 4) { | |
| 3940 DEBUG_WARN(("WARNING: buffer doesn't start with 0x1, but I expected it to or doesn't have it's two-bit set!\n")); | |
| 3941 DEBUG_WARN(("Treating as normal buffer\n")); | |
| 3942 if (pf->encryption) _pst_decrypt(buf3, a, pf->encryption); | |
| 3943 if (h->buf) | |
| 3944 *(h->buf) = buf3; | |
| 3945 else if (h->base64 == 1 && h->fp) { | |
| 3946 t = base64_encode(buf3, a); | |
| 31 | 3947 if (t) pst_fwrite(t, 1, strlen(t), h->fp); |
| 16 | 3948 free(buf3); |
| 3949 } else if (h->fp) { | |
| 3950 pst_fwrite(buf3, 1, a, h->fp); | |
| 3951 free(buf3); | |
| 3952 } | |
| 3953 DEBUG_RET(); | |
| 3954 return a; | |
| 3955 } | |
| 3956 memcpy (&count, &(buf3[2]), sizeof(int16_t)); | |
| 3957 LE16_CPU(count); | |
| 3958 memcpy (&fdepth, &(buf3[1]), sizeof(char)); | |
| 3959 DEBUG_READ(("Seen index to blocks. Depth is %i\n", fdepth)); | |
| 3960 DEBUG_READ(("There are %i ids here\n", count)); | |
| 3961 | |
| 3962 y = 0; | |
| 3963 while (y < count) { | |
| 3964 memcpy(&x, &buf3[0x08+(y*4)], sizeof(int32_t)); | |
| 3965 LE32_CPU(x); | |
| 3966 if (fdepth == 0x1) { | |
| 3967 if ((z = _pst_ff_getIDblock(pf, x, &buf2)) == 0) { | |
| 3968 DEBUG_WARN(("call to getIDblock returned zero %i\n", z)); | |
| 3969 if (buf2) free(buf2); | |
| 3970 free(buf3); | |
| 3971 return z; | |
| 3972 } | |
| 3973 if (pf->encryption) _pst_decrypt(buf2, z, pf->encryption); | |
| 3974 if (h->buf) { | |
| 3975 *(h->buf) = realloc(*(h->buf), size+z+1); | |
| 3976 DEBUG_READ(("appending read data of size %i onto main buffer from pos %i\n", z, size)); | |
| 3977 memcpy(&((*(h->buf))[size]), buf2, z); | |
| 3978 } | |
| 3979 else if ((h->base64 == 1) && h->fp) { | |
| 3980 // include any byte left over from the last one encoding | |
| 3981 buf2 = (char*)realloc(buf2, z+h->base64_extra); | |
| 3982 memmove(buf2+h->base64_extra, buf2, z); | |
| 3983 memcpy(buf2, h->base64_extra_chars, h->base64_extra); | |
| 3984 z+= h->base64_extra; | |
| 3985 | |
| 3986 b = z % 3; // find out how many bytes will be left over after the encoding. | |
| 3987 // and save them | |
| 3988 memcpy(h->base64_extra_chars, &(buf2[z-b]), b); | |
| 3989 h->base64_extra = b; | |
| 3990 t = base64_encode(buf2, z-b); | |
| 31 | 3991 if (t) pst_fwrite(t, 1, strlen(t), h->fp); |
| 16 | 3992 DEBUG_READ(("writing %i bytes to file as base64 [%i]. Currently %i\n", |
| 3993 z, strlen(t), size)); | |
| 3994 } | |
| 3995 else if (h->fp) { | |
| 3996 DEBUG_READ(("writing %i bytes to file. Currently %i\n", z, size)); | |
| 3997 pst_fwrite(buf2, 1, z, h->fp); | |
| 3998 } | |
| 3999 size += z; | |
| 4000 y++; | |
| 4001 } | |
| 4002 else { | |
| 4003 if ((z = _pst_ff_compile_ID(pf, x, h, size)) == 0) { | |
| 4004 DEBUG_WARN(("recursive called returned zero %i\n", z)); | |
| 4005 free(buf3); | |
| 4006 DEBUG_RET(); | |
| 4007 return z; | |
| 4008 } | |
| 4009 size = z; | |
| 4010 y++; | |
| 4011 } | |
| 4012 } | |
| 4013 free(buf3); | |
| 4014 if (buf2) free(buf2); | |
| 4015 DEBUG_RET(); | |
| 4016 return size; | |
| 4017 } | |
| 4018 | |
| 4019 | |
| 4020 #ifdef _MSC_VER | |
| 4021 char * fileTimeToAscii(const FILETIME* filetime) { | |
| 4022 time_t t; | |
| 4023 DEBUG_ENT("fileTimeToAscii"); | |
| 4024 t = fileTimeToUnixTime(filetime, 0); | |
| 4025 if (t == -1) | |
| 4026 DEBUG_WARN(("ERROR time_t varible that was produced, is -1\n")); | |
| 4027 DEBUG_RET(); | |
| 4028 return ctime(&t); | |
| 4029 } | |
| 4030 | |
| 4031 | |
| 4032 time_t fileTimeToUnixTime(const FILETIME* filetime, DWORD *x) { | |
| 4033 SYSTEMTIME s; | |
| 4034 struct tm t; | |
| 4035 DEBUG_ENT("fileTimeToUnixTime"); | |
| 4036 memset (&t, 0, sizeof(struct tm)); | |
| 4037 FileTimeToSystemTime(filetime, &s); | |
| 4038 t.tm_year = s.wYear-1900; // this is what is required | |
| 4039 t.tm_mon = s.wMonth-1; // also required! It made me a bit confused | |
| 4040 t.tm_mday = s.wDay; | |
| 4041 t.tm_hour = s.wHour; | |
| 4042 t.tm_min = s.wMinute; | |
| 4043 t.tm_sec = s.wSecond; | |
| 4044 DEBUG_RET(); | |
| 4045 return mktime(&t); | |
| 4046 } | |
| 4047 | |
| 4048 | |
| 4049 struct tm * fileTimeToStructTM (const FILETIME *filetime) { | |
| 4050 time_t t1; | |
| 4051 t1 = fileTimeToUnixTime(filetime, 0); | |
| 4052 return gmtime(&t1); | |
| 4053 } | |
| 4054 | |
| 4055 | |
| 4056 #endif //_MSC_VER | |
| 4057 | |
| 4058 int32_t pst_stricmp(char *a, char *b) { | |
| 4059 // compare strings case-insensitive. | |
| 4060 // returns -1 if a < b, 0 if a==b, 1 if a > b | |
| 4061 while(*a != '\0' && *b != '\0' && toupper(*a)==toupper(*b)) { | |
| 4062 a++; b++; | |
| 4063 } | |
| 4064 if (toupper(*a) == toupper(*b)) | |
| 4065 return 0; | |
| 4066 else if (toupper(*a) < toupper(*b)) | |
| 4067 return -1; | |
| 4068 else | |
| 4069 return 1; | |
| 4070 } | |
| 4071 | |
| 4072 | |
| 4073 int32_t pst_strincmp(char *a, char *b, int32_t x) { | |
| 4074 // compare upto x chars in string a and b case-insensitively | |
| 4075 // returns -1 if a < b, 0 if a==b, 1 if a > b | |
| 4076 int32_t y = 0; | |
| 4077 while (*a != '\0' && *b != '\0' && y < x && toupper(*a)==toupper(*b)) { | |
| 4078 a++; b++; y++; | |
| 4079 } | |
| 4080 // if we have reached the end of either string, or a and b still match | |
| 4081 if (*a == '\0' || *b == '\0' || toupper(*a)==toupper(*b)) | |
| 4082 return 0; | |
| 4083 else if (toupper(*a) < toupper(*b)) | |
| 4084 return -1; | |
| 4085 else | |
| 4086 return 1; | |
| 4087 } | |
| 4088 | |
| 4089 | |
| 4090 size_t pst_fwrite(const void*ptr, size_t size, size_t nmemb, FILE*stream) { | |
| 4091 size_t r; | |
| 4092 DEBUG_ENT("pst_fwrite"); | |
| 4093 if (ptr) | |
| 4094 r = fwrite(ptr, size, nmemb, stream); | |
| 4095 else { | |
| 4096 r = 0; | |
| 4097 DEBUG_WARN(("An attempt to write a NULL Pointer was made\n")); | |
| 4098 } | |
| 4099 DEBUG_RET(); | |
| 4100 return r; | |
| 4101 } | |
| 4102 | |
| 4103 | |
| 4104 char * _pst_wide_to_single(char *wt, int32_t size) { | |
| 4105 // returns the first byte of each wide char. the size is the number of bytes in source | |
| 4106 char *x, *y; | |
| 4107 DEBUG_ENT("_pst_wide_to_single"); | |
| 4108 x = xmalloc((size/2)+1); | |
| 4109 y = x; | |
| 4110 while (size != 0 && *wt != '\0') { | |
| 4111 *y = *wt; | |
| 4112 wt+=2; | |
| 4113 size -= 2; | |
| 4114 y++; | |
| 4115 } | |
| 4116 *y = '\0'; | |
| 4117 DEBUG_RET(); | |
| 4118 return x; | |
| 4119 } | |
| 4120 |