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