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