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