Mercurial > libpst
annotate libpst.c @ 10:a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
author | carl |
---|---|
date | Fri, 17 Feb 2006 15:48:38 -0800 |
parents | 2b58cf15aaf7 |
children | bf12a9d4524c |
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 | |
189 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
|
190 DEBUG_ENT("pst_close"); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
191 if (pf->fp == NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
192 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
|
193 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
194 return -1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
195 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
196 if (fclose(pf->fp)) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
197 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
|
198 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
199 return -1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
200 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
201 // 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
|
202 _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
|
203 _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
|
204 _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
|
205 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
206 return 0; |
0 | 207 } |
208 | |
209 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
|
210 pst_desc_ll *ret; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
211 // pst_item *i; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
212 // char *a, *b; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
213 // int x,z; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
214 DEBUG_ENT("pst_getTopOfFolders"); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
215 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
|
216 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
|
217 ret = NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
218 } 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
|
219 // this is the OST way |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
220 // 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
|
221 ret = _pst_getDptr(pf, 0x2142); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
222 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
223 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
|
224 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
225 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
226 return ret; |
0 | 227 } |
228 | |
229 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
|
230 int32_t size=0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
231 pst_index_ll *ptr; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
232 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
|
233 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
|
234 if (attach->id_val != -1) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
235 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
|
236 if (ptr != NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
237 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
|
238 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
239 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
|
240 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
241 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
|
242 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
243 size = attach->size; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
244 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
245 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
246 return size; |
0 | 247 } |
248 | |
249 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
|
250 pst_index_ll *ptr; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
251 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
|
252 int32_t size; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
253 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
|
254 if (attach->id_val != -1) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
255 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
|
256 if (ptr != NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
257 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
|
258 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
259 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
|
260 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
261 attach->size = size; |
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 // save the attachment to file |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
264 size = attach->size; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
265 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
|
266 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
267 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
268 return 1; |
0 | 269 } |
270 | |
271 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
|
272 pst_index_ll *ptr; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
273 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
|
274 int32_t size; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
275 char *c; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
276 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
|
277 if (attach->id_val != -1) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
278 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
|
279 if (ptr != NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
280 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
|
281 // 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
|
282 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
|
283 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
|
284 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
285 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
|
286 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
287 attach->size = size; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
288 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
289 // 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
|
290 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
|
291 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
|
292 size = attach->size; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
293 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
294 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
295 return 1; |
0 | 296 } |
297 | |
298 int32_t pst_load_index (pst_file *pf) { | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
299 int32_t x,y; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
300 DEBUG_ENT("pst_load_index"); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
301 if (pf == NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
302 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
|
303 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
304 return -1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
305 } |
0 | 306 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
307 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
|
308 DEBUG_INDEX(("build id ptr returns %i\n", x)); |
0 | 309 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
310 y = -1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
311 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
|
312 DEBUG_INDEX(("build desc ptr returns %i\n", x)); |
0 | 313 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
314 DEBUG_CODE(_pst_printDptr(pf);); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
315 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
316 return 0; |
0 | 317 } |
318 | |
319 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
|
320 pst_desc_ll* r = NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
321 DEBUG_ENT("pst_getNextDptr"); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
322 if (d != NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
323 if ((r = d->child) == NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
324 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
|
325 r = d->next; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
326 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
327 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
328 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
329 return r; |
0 | 330 } |
331 | |
332 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
|
333 u_int16_t extended; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
334 u_int16_t zero; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
335 u_int16_t type; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
336 u_int16_t map; |
0 | 337 } pst_x_attrib; |
338 | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
339 |
0 | 340 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
|
341 // 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
|
342 pst_desc_ll *p; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
343 pst_num_array *na; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
344 // pst_index_ll *list; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
345 pst_index2_ll *list2;//, *t; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
346 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
|
347 pst_x_attrib xattrib; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
348 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
|
349 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
|
350 char *wt; |
0 | 351 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
352 DEBUG_ENT("pst_loadExtendedAttributes"); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
353 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
|
354 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
|
355 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
356 return 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
357 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
358 if (p->list_index != NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
359 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
|
360 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
361 if (p->desc == NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
362 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
|
363 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
364 return 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
365 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
366 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
|
367 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
|
368 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
369 return 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
370 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
371 x = 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
372 while (x < na->count_item) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
373 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
|
374 buffer = na->items[x]->data; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
375 bsize = na->items[x]->size; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
376 } 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
|
377 headerbuffer = na->items[x]->data; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
378 hsize = na->items[x]->size; |
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++; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
381 } |
0 | 382 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
383 if (buffer == NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
384 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
|
385 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
386 return 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
387 } |
0 | 388 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
389 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
|
390 LE16_CPU(xattrib.extended); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
391 LE16_CPU(xattrib.zero); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
392 LE16_CPU(xattrib.type); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
393 LE16_CPU(xattrib.map); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
394 bptr += sizeof(xattrib); |
8 | 395 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
396 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
|
397 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
|
398 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
|
399 ptr->type = xattrib.type; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
400 ptr->map = xattrib.map+0x8000; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
401 ptr->next = NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
402 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
|
403 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
|
404 err=0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
405 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
|
406 // 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
|
407 if (xattrib.extended < hsize) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
408 // 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
|
409 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
|
410 LE32_CPU(tint); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
411 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
|
412 memset(wt, 0, tint+2); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
413 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
|
414 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
|
415 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
|
416 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
417 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
|
418 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
419 ptr->mytype = PST_MAP_HEADER; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
420 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
421 // 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
|
422 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
|
423 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
|
424 *((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
|
425 ptr->mytype = PST_MAP_ATTRIB; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
426 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
|
427 } |
0 | 428 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
429 if (err==0) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
430 // add it to the list |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
431 p_sh = p_head; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
432 p_sh2 = NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
433 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
|
434 p_sh2 = p_sh; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
435 p_sh = p_sh->next; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
436 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
437 if (p_sh2 == NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
438 // 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
|
439 ptr->next = p_head; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
440 p_head = ptr; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
441 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
442 // 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
|
443 ptr->next = p_sh2->next; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
444 p_sh2->next = ptr; |
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 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
447 free(ptr); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
448 ptr = NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
449 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
450 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
|
451 LE16_CPU(xattrib.extended); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
452 LE16_CPU(xattrib.zero); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
453 LE16_CPU(xattrib.type); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
454 LE16_CPU(xattrib.map); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
455 bptr += sizeof(xattrib); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
456 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
457 if (buffer) free(buffer); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
458 if (headerbuffer) free(headerbuffer); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
459 pf->x_head = p_head; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
460 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
461 return 1; |
0 | 462 } |
463 | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
464 #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
|
465 #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
|
466 #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
|
467 #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
|
468 #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
|
469 #define ITEM_SIZE 12 |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
470 #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
|
471 #define DESC_COUNT_MAX 31 // max active items |
0 | 472 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
473 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
|
474 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
|
475 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
|
476 pst_index index; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
477 int32_t x, item_count; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
478 int32_t old = start_val; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
479 char *buf = NULL, *bptr; |
0 | 480 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
481 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
|
482 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
|
483 if (end_val <= start_val) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
484 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
|
485 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
486 return -1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
487 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
488 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
|
489 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
|
490 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
|
491 if (buf) free(buf); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
492 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
493 return -1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
494 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
495 bptr = buf; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
496 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
|
497 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
|
498 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
|
499 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
|
500 if (buf) free(buf); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
501 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
502 return -1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
503 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
504 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
|
505 LE32_CPU(index.id); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
506 if (index.id != linku1) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
507 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
|
508 if (buf) free(buf); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
509 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
510 return -1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
511 } |
0 | 512 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
513 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
|
514 // this node contains leaf pointers |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
515 x = 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
516 while (x < item_count) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
517 memcpy(&index, bptr, sizeof(index)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
518 LE32_CPU(index.id); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
519 LE32_CPU(index.offset); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
520 LE16_CPU(index.size); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
521 LE16_CPU(index.u1); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
522 bptr += sizeof(index); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
523 x++; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
524 if (index.id == 0) break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
525 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
|
526 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
|
527 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
|
528 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
|
529 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
|
530 if (buf) free(buf); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
531 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
532 return -1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
533 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
534 old = index.id; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
535 if (x == 1) { // first entry |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
536 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
|
537 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
|
538 if (buf) free(buf); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
539 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
540 return -1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
541 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
542 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
543 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
|
544 i_ptr->id = index.id; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
545 i_ptr->offset = index.offset; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
546 i_ptr->u1 = index.u1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
547 i_ptr->size = index.size; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
548 i_ptr->next = NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
549 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
|
550 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
|
551 pf->i_tail = i_ptr; |
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 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
554 // this node contains node pointers |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
555 x = 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
556 while (x < item_count) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
557 memcpy(&table, bptr, sizeof(table)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
558 LE32_CPU(table.start); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
559 LE32_CPU(table.u1); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
560 LE32_CPU(table.offset); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
561 bptr += sizeof(table); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
562 x++; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
563 if (table.start == 0) break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
564 if (x < item_count) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
565 memcpy(&table2, bptr, sizeof(table)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
566 LE32_CPU(table2.start); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
567 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
568 else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
569 table2.start = end_val; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
570 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
571 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
|
572 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
|
573 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
|
574 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
|
575 if (buf) free(buf); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
576 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
577 return -1; |
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 old = table.start; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
580 if (x == 1) { // first entry |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
581 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
|
582 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
|
583 if (buf) free(buf); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
584 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
585 return -1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
586 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
587 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
588 _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
|
589 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
590 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
591 if (buf) free (buf); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
592 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
593 return 0; |
0 | 594 } |
595 | |
8 | 596 |
0 | 597 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
598 int32_t _pst_build_desc_ptr (pst_file *pf, int32_t offset, int32_t depth, int32_t linku1, int32_t *high_id, 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
|
599 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
|
600 pst_desc desc_rec; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
601 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
|
602 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
|
603 int32_t x, item_count; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
604 int32_t old = start_val; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
605 char *buf = NULL, *bptr; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
606 |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
607 struct _pst_d_ptr_ll { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
608 pst_desc_ll * ptr; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
609 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
|
610 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
|
611 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
|
612 } *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
|
613 // 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
|
614 // list and check it each time you read a new item |
0 | 615 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
616 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
|
617 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
|
618 if (end_val <= start_val) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
619 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
|
620 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
621 return -1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
622 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
623 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
|
624 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
|
625 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
|
626 if (buf) free(buf); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
627 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
628 return -1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
629 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
630 bptr = buf; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
631 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
|
632 if (item_count > DESC_COUNT_MAX) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
633 DEBUG_WARN(("Item count %i too large, max is %i\n", item_count, DESC_COUNT_MAX)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
634 if (buf) free(buf); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
635 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
636 return -1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
637 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
638 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
|
639 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
|
640 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
|
641 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
|
642 if (buf) free(buf); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
643 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
644 return -1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
645 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
646 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
|
647 // this node contains leaf pointers |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
648 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
|
649 x = 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
650 while (x < item_count) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
651 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
|
652 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
|
653 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
|
654 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
|
655 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
|
656 bptr+= sizeof(desc_rec); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
657 x++; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
658 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
|
659 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
|
660 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
|
661 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
|
662 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
|
663 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
|
664 if (buf) free(buf); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
665 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
666 return -1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
667 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
668 old = desc_rec.d_id; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
669 if (x == 1) { // first entry |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
670 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
|
671 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
|
672 if (buf) free(buf); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
673 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
674 return -1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
675 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
676 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
677 // 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
|
678 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
|
679 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
|
680 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
|
681 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
|
682 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
|
683 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
|
684 (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
|
685 (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
|
686 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
|
687 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
|
688 //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
|
689 // 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
|
690 // 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
|
691 // 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
|
692 // 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
|
693 // 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
|
694 // 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
|
695 // 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
|
696 if (d_ptr->prev != NULL) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
697 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
|
698 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
|
699 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
|
700 else |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
701 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
|
702 |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
703 if (d_ptr->next != NULL) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
704 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
|
705 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
|
706 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
|
707 else |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
708 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
|
709 |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
710 d_ptr->prev = NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
711 d_ptr->next = NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
712 d_ptr->parent = NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
713 |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
714 // 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
|
715 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
|
716 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
|
717 DEBUG_INDEX(("No Parent\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
718 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
|
719 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
|
720 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
|
721 pf->d_tail = d_ptr; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
722 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
723 // check in the quick list |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
724 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
|
725 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
|
726 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
|
727 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
728 |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
729 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
|
730 // 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
|
731 lf_ptr = lf_head; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
732 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
|
733 lf_ptr = lf_ptr->next; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
734 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
735 if (lf_ptr == NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
736 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
|
737 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
|
738 lf_ptr->prev = NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
739 lf_ptr->next = lf_head; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
740 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
|
741 lf_ptr->ptr = d_ptr; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
742 lf_head = lf_ptr; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
743 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
744 d_par = lf_ptr->ptr; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
745 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
|
746 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
747 } |
0 | 748 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
749 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
|
750 if (d_ptr_ptr != NULL) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
751 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
|
752 else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
753 //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
|
754 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
|
755 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
|
756 d_ptr_ptr->prev = NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
757 d_ptr_ptr->next = d_ptr_head; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
758 d_ptr_ptr->ptr = d_par; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
759 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
|
760 if (d_ptr_tail == NULL) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
761 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
|
762 d_ptr_count++; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
763 if (d_ptr_count > 100) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
764 //remove on from the end |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
765 d_ptr_ptr = d_ptr_tail; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
766 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
|
767 free (d_ptr_ptr); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
768 d_ptr_count--; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
769 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
770 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
771 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
|
772 d_par->no_child++; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
773 d_ptr->parent = d_par; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
774 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
|
775 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
|
776 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
|
777 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
|
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 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
781 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
782 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
|
783 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
|
784 *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
|
785 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
786 DEBUG_INDEX(("New Record\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
787 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
|
788 // DEBUG_INDEX(("Item pointer is %p\n", d_ptr)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
789 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
|
790 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
|
791 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
|
792 d_ptr->prev = NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
793 d_ptr->next = NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
794 d_ptr->parent = NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
795 d_ptr->child = NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
796 d_ptr->child_tail = NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
797 d_ptr->no_child = 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
798 |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
799 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
|
800 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
|
801 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
|
802 DEBUG_INDEX(("No Parent\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
803 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
804 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
|
805 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
806 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
|
807 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
|
808 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
|
809 pf->d_tail = d_ptr; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
810 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
811 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
|
812 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
|
813 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
|
814 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
815 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
|
816 // 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
|
817 lf_ptr = lf_head; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
818 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
|
819 lf_ptr = lf_ptr->next; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
820 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
821 if (lf_ptr == NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
822 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
|
823 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
|
824 lf_ptr->prev = NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
825 lf_ptr->next = lf_head; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
826 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
|
827 lf_ptr->ptr = d_ptr; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
828 lf_head = lf_ptr; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
829 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
830 d_par = lf_ptr->ptr; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
831 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
|
832 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
833 } |
0 | 834 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
835 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
|
836 if (d_ptr_ptr != NULL) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
837 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
|
838 else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
839 //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
|
840 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
|
841 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
|
842 d_ptr_ptr->prev = NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
843 d_ptr_ptr->next = d_ptr_head; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
844 d_ptr_ptr->ptr = d_par; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
845 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
|
846 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
|
847 d_ptr_count++; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
848 if (d_ptr_count > 100) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
849 //remove one from the end |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
850 d_ptr_ptr = d_ptr_tail; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
851 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
|
852 free (d_ptr_ptr); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
853 d_ptr_count--; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
854 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
855 } |
0 | 856 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
857 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
|
858 d_par->no_child++; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
859 d_ptr->parent = d_par; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
860 if (d_par->child_tail != NULL) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
861 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
|
862 if (d_par->child == NULL) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
863 d_par->child = d_ptr; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
864 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
|
865 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
|
866 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
867 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
868 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
869 // 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
|
870 lf_ptr = lf_head; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
871 lf_shd = NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
872 while (lf_ptr != NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
873 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
|
874 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
|
875 d_par = d_ptr; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
876 d_ptr = lf_ptr->ptr; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
877 d_par->no_child++; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
878 d_ptr->parent = d_par; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
879 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
|
880 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
|
881 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
|
882 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
|
883 if (lf_shd == NULL) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
884 lf_head = lf_ptr->next; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
885 else |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
886 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
|
887 lf_tmp = lf_ptr->next; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
888 free(lf_ptr); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
889 lf_ptr = lf_tmp; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
890 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
891 lf_shd = lf_ptr; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
892 lf_ptr = lf_ptr->next; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
893 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
894 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
895 } |
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 // this node contains node pointers |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
898 DEBUG_HEXDUMPC(buf, DESC_BLOCK_SIZE, 12); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
899 x = 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
900 while (x < item_count) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
901 memcpy(&table, bptr, sizeof(table)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
902 LE32_CPU(table.start); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
903 LE32_CPU(table.u1); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
904 LE32_CPU(table.offset); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
905 bptr += sizeof(table); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
906 x++; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
907 if (table.start == 0) break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
908 if (x < item_count) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
909 memcpy(&table2, bptr, sizeof(table)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
910 LE32_CPU(table2.start); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
911 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
912 else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
913 table2.start = end_val; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
914 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
915 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
|
916 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
|
917 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
|
918 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
|
919 if (buf) free(buf); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
920 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
921 return -1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
922 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
923 old = table.start; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
924 if (x == 1) { // first entry |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
925 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
|
926 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
|
927 if (buf) free(buf); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
928 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
929 return -1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
930 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
931 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
932 _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
|
933 } |
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 // 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
|
936 while (d_ptr_head != NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
937 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
|
938 free(d_ptr_head); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
939 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
|
940 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
941 if (buf) free(buf); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
942 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
943 return 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
944 } |
0 | 945 |
946 | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
947 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
|
948 pst_num_array * list; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
949 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
|
950 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
|
951 pst_item *item = NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
952 pst_item_attach *attach = NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
953 int x; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
954 DEBUG_ENT("_pst_parse_item"); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
955 if (d_ptr == NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
956 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
|
957 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
958 return NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
959 } |
0 | 960 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
961 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
|
962 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
|
963 _pst_printID2ptr(id2_head); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
964 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
965 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
|
966 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
967 |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
968 if (d_ptr->desc == NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
969 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
|
970 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
971 return NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
972 } |
0 | 973 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
974 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
|
975 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
|
976 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
977 return NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
978 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
979 |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
980 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
|
981 memset(item, 0, sizeof(pst_item)); |
0 | 982 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
983 if (_pst_process(list, item)) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
984 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
|
985 _pst_free_list(list); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
986 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
987 return NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
988 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
989 _pst_free_list(list); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
990 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
|
991 } |
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 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
|
994 // 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
|
995 while (item->attach != NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
996 attach = item->attach->next; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
997 free(item->attach); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
998 item->attach = attach; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
999 } |
0 | 1000 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1001 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
|
1002 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
|
1003 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
|
1004 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1005 return NULL; |
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 x = 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1008 while (x < list->count_array) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1009 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
|
1010 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
|
1011 attach->next = 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 x++; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1014 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1015 item->current_attach = item->attach; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1016 |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1017 if (_pst_process(list, item)) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1018 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
|
1019 _pst_free_list(list); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1020 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1021 return NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1022 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1023 _pst_free_list(list); |
0 | 1024 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1025 // 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
|
1026 // 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
|
1027 // each attachment |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1028 attach = item->attach; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1029 while (attach != NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1030 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
|
1031 // 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
|
1032 // 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
|
1033 // 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
|
1034 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
|
1035 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
|
1036 attach = attach->next; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1037 continue; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1038 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1039 item->current_attach = attach; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1040 if (_pst_process(list, item)) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1041 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
|
1042 _pst_free_list(list); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1043 attach = attach->next; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1044 continue; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1045 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1046 _pst_free_list(list); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1047 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
|
1048 // 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
|
1049 // attachment data |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1050 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
|
1051 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1052 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
|
1053 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1054 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1055 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
|
1056 } |
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 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1059 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
|
1060 } |
0 | 1061 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1062 _pst_free_id2(id2_head); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1063 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1064 return item; |
0 | 1065 } |
1066 | |
1067 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
|
1068 unsigned char *buf = NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1069 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
|
1070 pst_block_offset block_offset; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1071 // pst_index_ll *rec = NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1072 u_int32_t size = 0, t_ptr = 0, fr_ptr = 0, to_ptr = 0, ind_ptr = 0, x = 0, stop = 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1073 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
|
1074 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
|
1075 size_t read_size=0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1076 pst_x_attrib_ll *mapptr; |
0 | 1077 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1078 struct { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1079 u_int16_t type; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1080 u_int16_t ref_type; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1081 u_int32_t value; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1082 } 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
|
1083 struct { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1084 u_int16_t ref_type; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1085 u_int16_t type; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1086 u_int16_t ind2_off; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1087 u_int16_t u1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1088 } 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
|
1089 struct { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1090 u_int16_t index_offset; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1091 u_int16_t type; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1092 u_int16_t offset; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1093 } block_hdr; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1094 struct { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1095 unsigned char seven_c; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1096 unsigned char item_count; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1097 u_int16_t u1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1098 u_int16_t u2; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1099 u_int16_t u3; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1100 u_int16_t rec_size; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1101 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
|
1102 u_int16_t u5; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1103 u_int16_t ind2_offset; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1104 u_int16_t u6; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1105 u_int16_t u7; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1106 u_int16_t u8; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1107 } seven_c_blk; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1108 struct _type_d_rec { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1109 u_int32_t id; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1110 u_int32_t u1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1111 } * type_d_rec; |
0 | 1112 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1113 DEBUG_ENT("_pst_parse_block"); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1114 /* if (block == NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1115 DEBUG_EMAIL(("block == NULL. Cannot continue with this block\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1116 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1117 return NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1118 }*/ |
0 | 1119 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1120 // DEBUG_EMAIL(("About to read %i bytes from offset %#x\n", block->size, block->offset)); |
0 | 1121 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1122 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
|
1123 // if (_pst_read_block_size(pf, block->offset, block->size, &buf, PST_ENC, 0) < block->size) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1124 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
|
1125 if (buf) free (buf); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1126 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1127 return NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1128 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1129 DEBUG_EMAIL(("pointer to buf is %p\n", buf)); |
0 | 1130 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1131 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
|
1132 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
|
1133 LE16_CPU(block_hdr.type); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1134 LE16_CPU(block_hdr.offset); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1135 DEBUG_EMAIL(("block header (index_offset=%#hx, type=%#hx, offset=%#hx\n", block_hdr.index_offset, block_hdr.type, block_hdr.offset)); |
0 | 1136 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1137 ind_ptr = block_hdr.index_offset; |
8 | 1138 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1139 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
|
1140 block_type = 1; |
8 | 1141 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1142 _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
|
1143 fr_ptr = block_offset.from; |
8 | 1144 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1145 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
|
1146 LE16_CPU(table_rec.type); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1147 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
|
1148 LE32_CPU(table_rec.value); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1149 DEBUG_EMAIL(("table_rec (type=%#hx, ref_type=%#hx, value=%#x\n", table_rec.type, table_rec.ref_type, table_rec.value)); |
0 | 1150 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1151 if (table_rec.type != 0x02B5) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1152 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
|
1153 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
|
1154 if (buf) free (buf); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1155 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1156 return NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1157 } |
0 | 1158 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1159 _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
|
1160 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
|
1161 to_ptr = block_offset.to; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1162 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
|
1163 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
|
1164 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
|
1165 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1166 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
|
1167 block_type = 2; |
8 | 1168 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1169 _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
|
1170 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
|
1171 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
|
1172 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
|
1173 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
|
1174 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
|
1175 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
|
1176 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
|
1177 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
|
1178 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
|
1179 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
|
1180 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
|
1181 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
|
1182 LE16_CPU(seven_c_blk.u8); |
0 | 1183 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1184 list_start = fr_ptr + sizeof(seven_c_blk); // the list of item numbers start after this record |
0 | 1185 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1186 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
|
1187 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
|
1188 if (buf) free(buf); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1189 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1190 return NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1191 } |
0 | 1192 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1193 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
|
1194 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
|
1195 DEBUG_EMAIL(("b5 offset = %#x\n", seven_c_blk.b_five_offset)); |
0 | 1196 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1197 _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
|
1198 fr_ptr = block_offset.from; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1199 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
|
1200 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
|
1201 LE16_CPU(table_rec.type); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1202 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
|
1203 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
|
1204 LE32_CPU(table_rec.value); |
0 | 1205 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1206 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
|
1207 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
|
1208 if (buf) free(buf); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1209 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1210 return NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1211 } |
0 | 1212 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1213 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
|
1214 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
|
1215 if (buf) free(buf); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1216 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1217 return NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1218 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1219 |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1220 _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
|
1221 num_recs = (block_offset.to - block_offset.from) / 6; // this will give the number of records in this block |
8 | 1222 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1223 _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
|
1224 ind2_ptr = block_offset.from; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1225 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1226 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
|
1227 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
|
1228 if (buf) free(buf); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1229 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1230 return NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1231 } |
0 | 1232 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1233 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
|
1234 while (count_rec < num_recs) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1235 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
|
1236 memset(na_ptr, 0, sizeof(pst_num_array)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1237 if (na_head == NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1238 na_head = na_ptr; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1239 na_ptr->next = NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1240 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1241 else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1242 na_ptr->next = na_head; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1243 na_head = na_ptr; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1244 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1245 // allocate an array of count num_recs to contain sizeof(struct_pst_num_item) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1246 na_ptr->items = (struct _pst_num_item**) xmalloc(sizeof(struct _pst_num_item)*num_list); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1247 na_ptr->count_item = num_list; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1248 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
|
1249 x = 0; |
0 | 1250 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1251 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
|
1252 |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1253 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
|
1254 cur_list = 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1255 stop = 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1256 while (!stop && cur_list < num_list) { //we will increase fr_ptr as we progress through index |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1257 if (block_type == 1) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1258 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
|
1259 LE16_CPU(table_rec.type); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1260 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
|
1261 fr_ptr += sizeof(table_rec); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1262 } else if (block_type == 2) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1263 // 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
|
1264 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
|
1265 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
|
1266 LE16_CPU(table2_rec.type); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1267 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
|
1268 LE16_CPU(table2_rec.u1); |
0 | 1269 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1270 // table_rec and table2_rec are arranged differently, so assign the values across |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1271 table_rec.type = table2_rec.type; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1272 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
|
1273 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
|
1274 (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
|
1275 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
|
1276 else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1277 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
|
1278 " 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
|
1279 sizeof(table_rec.value))); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1280 } |
0 | 1281 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1282 fr_ptr += sizeof(table2_rec); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1283 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1284 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
|
1285 if (buf) free(buf); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1286 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1287 return NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1288 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1289 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
|
1290 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
|
1291 x, table_rec.type, table_rec.ref_type, table_rec.value)); |
8 | 1292 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1293 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
|
1294 // DEBUG_EMAIL(("_pst_parse_block: record address = %p\n", na_ptr->items[x])); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1295 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
|
1296 |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1297 // 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
|
1298 mapptr = pf->x_head; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1299 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
|
1300 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
|
1301 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
|
1302 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
|
1303 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
|
1304 } 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
|
1305 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
|
1306 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
|
1307 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
|
1308 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1309 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1310 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
|
1311 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1312 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
|
1313 /* Reference Types |
0 | 1314 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1315 2 - 0x0002 - Signed 16bit value |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1316 3 - 0x0003 - Signed 32bit value |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1317 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
|
1318 5 - 0x0005 - Floating point double |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1319 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
|
1320 7 - 0x0007 - Application Time |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1321 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
|
1322 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
|
1323 13 - 0x000D - Embedded Object |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1324 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
|
1325 30 - 0x001E - Null terminated String |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1326 31 - 0x001F - Unicode string |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1327 64 - 0x0040 - Systime - Filetime structure |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1328 72 - 0x0048 - OLE Guid |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1329 258 - 0x0102 - Binary data |
0 | 1330 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1331 - 0x1003 - Array of 32bit values |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1332 - 0x1014 - Array of 64bit values |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1333 - 0x101E - Array of Strings |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1334 - 0x1102 - Array of Binary data |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1335 */ |
0 | 1336 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1337 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
|
1338 || 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
|
1339 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
|
1340 memcpy(na_ptr->items[x]->data, &(table_rec.value), sizeof(int32_t)); |
0 | 1341 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1342 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
|
1343 na_ptr->items[x]->type = table_rec.ref_type; |
8 | 1344 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1345 } 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
|
1346 || 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
|
1347 || 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
|
1348 || 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
|
1349 || 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
|
1350 || table_rec.ref_type == 0x1014) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1351 //contains index_ref to data |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1352 LE32_CPU(table_rec.value); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1353 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
|
1354 // 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
|
1355 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
|
1356 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
|
1357 &(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
|
1358 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
|
1359 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
|
1360 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
|
1361 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
|
1362 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1363 DEBUG_EMAIL(("Read %i bytes to a buffer at %p\n", na_ptr->items[x]->size, na_ptr->items[x]->data)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1364 } 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
|
1365 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
|
1366 // 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
|
1367 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
|
1368 na_ptr->count_item --; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1369 continue; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1370 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1371 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
|
1372 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
|
1373 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
|
1374 continue; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1375 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1376 t_ptr = block_offset.from; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1377 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
|
1378 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
|
1379 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1380 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
|
1381 "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
|
1382 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
|
1383 } |
8 | 1384 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1385 // 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
|
1386 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
|
1387 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
|
1388 na_ptr->items[x]->data[size] = '\0'; // null terminate buffer |
8 | 1389 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1390 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
|
1391 // 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
|
1392 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
|
1393 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
|
1394 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
|
1395 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
|
1396 type_d_rec->id)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1397 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
|
1398 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
|
1399 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
|
1400 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1401 DEBUG_EMAIL(("Read %i bytes into a buffer at %p\n", na_ptr->items[x]->size, 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 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1403 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1404 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
|
1405 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
|
1406 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
|
1407 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
|
1408 |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1409 free(na_ptr->items[x]); |
8 | 1410 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1411 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
|
1412 continue; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1413 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1414 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
|
1415 //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
|
1416 // to later functions |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1417 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
|
1418 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1419 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
|
1420 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1421 return NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1422 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1423 x++; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1424 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1425 DEBUG_EMAIL(("increasing ind2_ptr by %i [%#x] bytes. Was %#x, Now %#x\n", |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1426 rec_size, rec_size, ind2_ptr, |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1427 ind2_ptr+rec_size)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1428 ind2_ptr += rec_size; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1429 count_rec++; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1430 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1431 if (buf != NULL) free(buf); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1432 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1433 return na_head; |
0 | 1434 } |
1435 | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1436 |
0 | 1437 // check if item->email is NULL, and init if so |
1438 #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));} } | |
1439 #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));} } | |
1440 #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));} } | |
1441 #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)); } } | |
1442 #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));} } | |
1443 #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)); } } | |
1444 // malloc space and copy the current item's data -- plus one on the size for good luck (and string termination) | |
1445 #define LIST_COPY(targ, type) { \ | |
1446 targ = type realloc(targ, list->items[x]->size+1); \ | |
1447 memset(targ, 0, list->items[x]->size+1); \ | |
1448 memcpy(targ, list->items[x]->data, list->items[x]->size); \ | |
1449 } | |
1450 | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1451 /* free(list->items[x]->data); \ |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1452 list->items[x]->data=NULL; \*/ |
0 | 1453 |
1454 //#define INC_CHECK_X() { if (++x >= list->count_item) break; } | |
1455 #define NULL_CHECK(x) { if (x == NULL) { DEBUG_EMAIL(("NULL_CHECK: Null Found\n")); break;} } | |
1456 | |
1457 #define MOVE_NEXT(targ) { \ | |
1458 if (next){\ | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1459 if ((char*)targ == NULL) {\ |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1460 DEBUG_EMAIL(("MOVE_NEXT: Target is NULL. Will stop processing this option\n"));\ |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1461 break;\ |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1462 }\ |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1463 targ = targ->next;\ |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1464 if ((char*)targ == NULL) {\ |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1465 DEBUG_EMAIL(("MOVE_NEXT: Target is NULL after next. Will stop processing this option\n"));\ |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1466 break;\ |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1467 }\ |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1468 next=0;\ |
0 | 1469 }\ |
1470 } | |
8 | 1471 |
0 | 1472 int32_t _pst_process(pst_num_array *list , pst_item *item) { |
1473 int32_t x, t; | |
1474 int32_t next = 0; | |
1475 pst_item_attach *attach; | |
1476 pst_item_extra_field *ef; | |
1477 | |
1478 DEBUG_ENT("_pst_process"); | |
1479 if (item == NULL) { | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1480 DEBUG_EMAIL(("item cannot be NULL.\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1481 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1482 return -1; |
0 | 1483 } |
1484 | |
1485 attach = item->current_attach; // a working variable | |
1486 | |
1487 while (list != NULL) { | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1488 x = 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1489 while (x < list->count_item) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1490 // check here to see if the id is one that is mapped. |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1491 DEBUG_EMAIL(("#%d - id: %#x type: %#x length: %#x\n", x, list->items[x]->id, list->items[x]->type, |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1492 list->items[x]->size)); |
0 | 1493 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1494 switch (list->items[x]->id) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1495 case PST_ATTRIB_HEADER: // CUSTOM attribute for saying the Extra Headers |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1496 DEBUG_EMAIL(("Extra Field - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1497 ef = (pst_item_extra_field*) xmalloc(sizeof(pst_item_extra_field)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1498 memset(ef, 0, sizeof(pst_item_extra_field)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1499 ef->field_name = (char*) xmalloc(strlen(list->items[x]->extra)+1); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1500 strcpy(ef->field_name, list->items[x]->extra); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1501 LIST_COPY(ef->value, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1502 ef->next = item->extra_fields; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1503 item->extra_fields = ef; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1504 DEBUG_EMAIL(("\"%s\" = \"%s\"\n", ef->field_name, ef->value)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1505 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1506 case 0x0002: // PR_ALTERNATE_RECIPIENT_ALLOWED |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1507 // If set to true, the sender allows this email to be autoforwarded |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1508 DEBUG_EMAIL(("AutoForward allowed - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1509 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1510 if (*((short int*)list->items[x]->data) != 0) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1511 DEBUG_EMAIL(("True\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1512 item->email->autoforward = 1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1513 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1514 DEBUG_EMAIL(("False\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1515 item->email->autoforward = -1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1516 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1517 // INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1518 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1519 case 0x0003: // Extended Attributes table |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1520 DEBUG_EMAIL(("Extended Attributes Table - NOT PROCESSED\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1521 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1522 case 0x0017: // PR_IMPORTANCE |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1523 // How important the sender deems it to be |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1524 // 0 - Low |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1525 // 1 - Normal |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1526 // 2 - High |
0 | 1527 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1528 DEBUG_EMAIL(("Importance Level - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1529 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1530 memcpy(&(item->email->importance), list->items[x]->data, sizeof(item->email->importance)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1531 LE32_CPU(item->email->importance); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1532 t = item->email->importance; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1533 DEBUG_EMAIL(("%s [%i]\n", (t==0?"Low":(t==1?"Normal":"High")), t)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1534 // INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1535 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1536 case 0x001A: // PR_MESSAGE_CLASS Ascii type of messages - NOT FOLDERS |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1537 // must be case insensitive |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1538 DEBUG_EMAIL(("IPM.x - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1539 LIST_COPY(item->ascii_type, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1540 if (pst_strincmp("IPM.Note", item->ascii_type, 8) == 0) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1541 // the string begins with IPM.Note... |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1542 item->type = PST_TYPE_NOTE; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1543 else if (pst_stricmp("IPM", item->ascii_type) == 0) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1544 // the whole string is just IPM |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1545 item->type = PST_TYPE_NOTE; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1546 else if (pst_strincmp("IPM.Contact", item->ascii_type, 11) == 0) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1547 // the string begins with IPM.Contact... |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1548 item->type = PST_TYPE_CONTACT; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1549 else if (pst_strincmp("REPORT.IPM.Note", item->ascii_type, 15) == 0) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1550 // the string begins with the above |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1551 item->type = PST_TYPE_REPORT; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1552 else if (pst_strincmp("IPM.Activity", item->ascii_type, 12) == 0) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1553 item->type = PST_TYPE_JOURNAL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1554 else if (pst_strincmp("IPM.Appointment", item->ascii_type, 15) == 0) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1555 item->type = PST_TYPE_APPOINTMENT; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1556 else |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1557 item->type = PST_TYPE_OTHER; |
0 | 1558 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1559 DEBUG_EMAIL(("%s\n", item->ascii_type)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1560 // INC_CHECK_X(); //increment x here so that the next if statement has a chance of matching the next item |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1561 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1562 case 0x0023: // PR_ORIGINATOR_DELIVERY_REPORT_REQUESTED |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1563 // set if the sender wants a delivery report from all recipients |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1564 DEBUG_EMAIL(("Global Delivery Report - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1565 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1566 if (*(int16_t*)list->items[x]->data != 0) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1567 DEBUG_EMAIL(("True\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1568 item->email->delivery_report = 1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1569 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1570 DEBUG_EMAIL(("False\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1571 item->email->delivery_report = 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1572 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1573 // INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1574 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1575 case 0x0026: // PR_PRIORITY |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1576 // Priority of a message |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1577 // -1 NonUrgent |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1578 // 0 Normal |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1579 // 1 Urgent |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1580 DEBUG_EMAIL(("Priority - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1581 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1582 memcpy(&(item->email->priority), list->items[x]->data, sizeof(item->email->priority)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1583 LE32_CPU(item->email->priority); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1584 t = item->email->priority; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1585 DEBUG_EMAIL(("%s [%i]\n", (t<0?"NonUrgent":(t==0?"Normal":"Urgent")), t)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1586 // INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1587 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1588 case 0x0029:// PR_READ_RECEIPT_REQUESTED |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1589 DEBUG_EMAIL(("Read Receipt - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1590 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1591 if (*(short int*)list->items[x]->data != 0) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1592 DEBUG_EMAIL(("True\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1593 item->email->read_receipt = 1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1594 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1595 DEBUG_EMAIL(("False\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1596 item->email->read_receipt = 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1597 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1598 // INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1599 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1600 case 0x002B: // PR_RECIPIENT_REASSIGNMENT_PROHIBITED |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1601 DEBUG_EMAIL(("Reassignment Prohibited (Private) - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1602 if (*(short int*)list->items[x]->data != 0) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1603 DEBUG_EMAIL(("True\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1604 item->private_member = 1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1605 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1606 DEBUG_EMAIL(("False\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1607 item->private_member = 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1608 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1609 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1610 case 0x002E: // PR_ORIGINAL_SENSITIVITY |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1611 // the sensitivity of the message before being replied to or forwarded |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1612 // 0 - None |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1613 // 1 - Personal |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1614 // 2 - Private |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1615 // 3 - Company Confidential |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1616 DEBUG_EMAIL(("Original Sensitivity - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1617 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1618 memcpy(&(item->email->orig_sensitivity), list->items[x]->data, sizeof(item->email->orig_sensitivity)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1619 LE32_CPU(item->email->orig_sensitivity); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1620 t = item->email->orig_sensitivity; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1621 DEBUG_EMAIL(("%s [%i]\n", (t==0?"None":(t==1?"Personal": |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1622 (t==2?"Private":"Company Confidential"))), t)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1623 // INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1624 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1625 case 0x0036: // PR_SENSITIVITY |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1626 // sender's opinion of the sensitivity of an email |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1627 // 0 - None |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1628 // 1 - Personal |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1629 // 2 - Private |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1630 // 3 - Company Confidiential |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1631 DEBUG_EMAIL(("Sensitivity - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1632 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1633 memcpy(&(item->email->sensitivity), list->items[x]->data, sizeof(item->email->sensitivity)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1634 LE32_CPU(item->email->sensitivity); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1635 t = item->email->sensitivity; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1636 DEBUG_EMAIL(("%s [%i]\n", (t==0?"None":(t==1?"Personal": |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1637 (t==2?"Private":"Company Confidential"))), t)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1638 // INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1639 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1640 case 0x0037: // PR_SUBJECT raw subject |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1641 // if (list->items[x]->id == 0x0037) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1642 DEBUG_EMAIL(("Raw Subject - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1643 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1644 item->email->subject = (pst_item_email_subject*) realloc(item->email->subject, sizeof(pst_item_email_subject)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1645 memset(item->email->subject, 0, sizeof(pst_item_email_subject)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1646 DEBUG_EMAIL((" [size = %i] ", list->items[x]->size)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1647 if (list->items[x]->size > 0) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1648 if (isprint(list->items[x]->data[0])) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1649 // then there are no control bytes at the front |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1650 item->email->subject->off1 = 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1651 item->email->subject->off2 = 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1652 item->email->subject->subj = realloc(item->email->subject->subj, list->items[x]->size+1); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1653 memset(item->email->subject->subj, 0, list->items[x]->size+1); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1654 memcpy(item->email->subject->subj, list->items[x]->data, list->items[x]->size); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1655 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1656 DEBUG_EMAIL(("Raw Subject has control codes\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1657 // there might be some control bytes in the first and second bytes |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1658 item->email->subject->off1 = list->items[x]->data[0]; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1659 item->email->subject->off2 = list->items[x]->data[1]; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1660 item->email->subject->subj = realloc(item->email->subject->subj, (list->items[x]->size-2)+1); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1661 memset(item->email->subject->subj, 0, list->items[x]->size-1); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1662 memcpy(item->email->subject->subj, &(list->items[x]->data[2]), list->items[x]->size-2); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1663 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1664 DEBUG_EMAIL(("%s\n", item->email->subject->subj)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1665 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1666 // obviously outlook has decided not to be straight with this one. |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1667 item->email->subject->off1 = 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1668 item->email->subject->off2 = 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1669 item->email->subject = NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1670 DEBUG_EMAIL(("NULL subject detected\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1671 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1672 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1673 // INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1674 case 0x0039: // PR_CLIENT_SUBMIT_TIME Date Email Sent/Created |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1675 DEBUG_EMAIL(("Date sent - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1676 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1677 LIST_COPY(item->email->sent_date, (FILETIME*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1678 LE32_CPU(item->email->sent_date->dwLowDateTime); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1679 LE32_CPU(item->email->sent_date->dwHighDateTime); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1680 DEBUG_EMAIL(("%s", fileTimeToAscii(item->email->sent_date))); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1681 // INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1682 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1683 case 0x003B: // PR_SENT_REPRESENTING_SEARCH_KEY Sender address 1 |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1684 DEBUG_EMAIL(("Sent on behalf of address 1 - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1685 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1686 LIST_COPY(item->email->outlook_sender, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1687 DEBUG_EMAIL(("%s\n", item->email->outlook_sender)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1688 // INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1689 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1690 case 0x003F: // PR_RECEIVED_BY_ENTRYID Structure containing Recipient |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1691 DEBUG_EMAIL(("Recipient Structure 1 -- NOT HANDLED\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1692 // INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1693 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1694 case 0x0040: // PR_RECEIVED_BY_NAME Name of Recipient Structure |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1695 DEBUG_EMAIL(("Received By Name 1 -- NOT HANDLED\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1696 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1697 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1698 case 0x0041: // PR_SENT_REPRESENTING_ENTRYID Structure containing Sender |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1699 DEBUG_EMAIL(("Sent on behalf of Structure 1 -- NOT HANDLED\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1700 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1701 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1702 case 0x0042: // PR_SENT_REPRESENTING_NAME Name of Sender Structure |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1703 DEBUG_EMAIL(("Sent on behalf of Structure Name - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1704 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1705 LIST_COPY(item->email->outlook_sender_name, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1706 DEBUG_EMAIL(("%s\n", item->email->outlook_sender_name)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1707 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1708 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1709 case 0x0043: // PR_RCVD_REPRESENTING_ENTRYID Recipient Structure 2 |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1710 DEBUG_EMAIL(("Received on behalf of Structure -- NOT HANDLED\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1711 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1712 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1713 case 0x0044: // PR_RCVD_REPRESENTING_NAME Name of Recipient Structure 2 |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1714 DEBUG_EMAIL(("Received on behalf of Structure Name -- NOT HANDLED\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1715 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1716 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1717 case 0x004F: // PR_REPLY_RECIPIENT_ENTRIES Reply-To Structure |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1718 DEBUG_EMAIL(("Reply-To Structure -- NOT HANDLED\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1719 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1720 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1721 case 0x0050: // PR_REPLY_RECIPIENT_NAMES Name of Reply-To Structure |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1722 DEBUG_EMAIL(("Name of Reply-To Structure -")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1723 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1724 LIST_COPY(item->email->reply_to, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1725 DEBUG_EMAIL(("%s\n", item->email->reply_to)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1726 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1727 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1728 case 0x0051: // PR_RECEIVED_BY_SEARCH_KEY Recipient Address 1 |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1729 DEBUG_EMAIL(("Recipient's Address 1 (Search Key) - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1730 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1731 LIST_COPY (item->email->outlook_recipient, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1732 DEBUG_EMAIL(("%s\n", item->email->outlook_recipient)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1733 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1734 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1735 case 0x0052: // PR_RCVD_REPRESENTING_SEARCH_KEY Recipient Address 2 |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1736 DEBUG_EMAIL(("Received on behalf of Address (Search Key) - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1737 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1738 LIST_COPY(item->email->outlook_recipient2, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1739 DEBUG_EMAIL(("%s\n", item->email->outlook_recipient2)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1740 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1741 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1742 case 0x0057: // PR_MESSAGE_TO_ME |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1743 // this user is listed explicitly in the TO address |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1744 DEBUG_EMAIL(("My address in TO field - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1745 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1746 if (*(int16_t*)list->items[x]->data != 0) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1747 DEBUG_EMAIL(("True\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1748 item->email->message_to_me = 1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1749 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1750 DEBUG_EMAIL(("False\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1751 item->email->message_to_me = 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1752 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1753 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1754 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1755 case 0x0058: // PR_MESSAGE_CC_ME |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1756 // this user is listed explicitly in the CC address |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1757 DEBUG_EMAIL(("My address in CC field - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1758 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1759 if (*(int16_t*)list->items[x]->data != 0) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1760 DEBUG_EMAIL(("True\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1761 item->email->message_cc_me = 1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1762 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1763 DEBUG_EMAIL(("False\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1764 item->email->message_cc_me = 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1765 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1766 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1767 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1768 case 0x0059: //PR_MESSAGE_RECIP_ME |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1769 // this user appears in TO, CC or BCC address list |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1770 DEBUG_EMAIL(("Message addressed to me - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1771 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1772 if (*(int16_t*)list->items[x]->data != 0) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1773 DEBUG_EMAIL(("True\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1774 item->email->message_recip_me = 1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1775 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1776 DEBUG_EMAIL(("False\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1777 item->email->message_recip_me = 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1778 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1779 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1780 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1781 case 0x0063: // PR_RESPONSE_REQUESTED |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1782 DEBUG_EMAIL(("Response requested - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1783 if (*(int16_t*)list->items[x]->data != 0) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1784 DEBUG_EMAIL(("True\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1785 item->response_requested = 1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1786 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1787 DEBUG_EMAIL(("False\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1788 item->response_requested = 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1789 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1790 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1791 case 0x0064: // PR_SENT_REPRESENTING_ADDRTYPE Access method for Sender Address |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1792 DEBUG_EMAIL(("Sent on behalf of address type - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1793 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1794 LIST_COPY(item->email->sender_access, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1795 DEBUG_EMAIL(("%s\n", item->email->sender_access)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1796 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1797 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1798 case 0x0065: // PR_SENT_REPRESENTING_EMAIL_ADDRESS Sender Address |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1799 DEBUG_EMAIL(("Sent on behalf of Address - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1800 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1801 LIST_COPY(item->email->sender_address, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1802 DEBUG_EMAIL(("%s\n", item->email->sender_address)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1803 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1804 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1805 case 0x0070: // PR_CONVERSATION_TOPIC Processed Subject |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1806 DEBUG_EMAIL(("Processed Subject (Conversation Topic) - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1807 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1808 LIST_COPY(item->email->proc_subject, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1809 DEBUG_EMAIL(("%s\n", item->email->proc_subject)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1810 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1811 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1812 case 0x0071: // PR_CONVERSATION_INDEX Date 2 |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1813 DEBUG_EMAIL(("Conversation Index - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1814 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1815 memcpy(&(item->email->conv_index), list->items[x]->data, sizeof(item->email->conv_index)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1816 DEBUG_EMAIL(("%i\n", item->email->conv_index)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1817 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1818 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1819 case 0x0075: // PR_RECEIVED_BY_ADDRTYPE Recipient Access Method |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1820 DEBUG_EMAIL(("Received by Address type - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1821 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1822 LIST_COPY(item->email->recip_access, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1823 DEBUG_EMAIL(("%s\n", item->email->recip_access)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1824 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1825 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1826 case 0x0076: // PR_RECEIVED_BY_EMAIL_ADDRESS Recipient Address |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1827 DEBUG_EMAIL(("Received by Address - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1828 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1829 LIST_COPY(item->email->recip_address, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1830 DEBUG_EMAIL(("%s\n", item->email->recip_address)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1831 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1832 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1833 case 0x0077: // PR_RCVD_REPRESENTING_ADDRTYPE Recipient Access Method 2 |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1834 DEBUG_EMAIL(("Received on behalf of Address type - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1835 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1836 LIST_COPY(item->email->recip2_access, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1837 DEBUG_EMAIL(("%s\n", item->email->recip2_access)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1838 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1839 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1840 case 0x0078: // PR_RCVD_REPRESENTING_EMAIL_ADDRESS Recipient Address 2 |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1841 DEBUG_EMAIL(("Received on behalf of Address -")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1842 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1843 LIST_COPY(item->email->recip2_address, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1844 DEBUG_EMAIL(("%s\n", item->email->recip2_address)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1845 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1846 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1847 case 0x007D: // PR_TRANSPORT_MESSAGE_HEADERS Internet Header |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1848 DEBUG_EMAIL(("Internet Header - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1849 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1850 LIST_COPY(item->email->header, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1851 //DEBUG_EMAIL(("%s\n", item->email->header)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1852 DEBUG_EMAIL(("NOT PRINTED\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1853 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1854 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1855 case 0x0C17: // PR_REPLY_REQUESTED |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1856 DEBUG_EMAIL(("Reply Requested - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1857 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1858 if (*(int16_t*)list->items[x]->data != 0) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1859 DEBUG_EMAIL(("True\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1860 item->email->reply_requested = 1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1861 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1862 DEBUG_EMAIL(("False\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1863 item->email->reply_requested = 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1864 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1865 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1866 case 0x0C19: // PR_SENDER_ENTRYID Sender Structure 2 |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1867 DEBUG_EMAIL(("Sender Structure 2 -- NOT HANDLED\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1868 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1869 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1870 case 0x0C1A: // PR_SENDER_NAME Name of Sender Structure 2 |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1871 DEBUG_EMAIL(("Name of Sender Structure 2 -- NOT HANDLED\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1872 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1873 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1874 case 0x0C1D: // PR_SENDER_SEARCH_KEY Name of Sender Address 2 |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1875 DEBUG_EMAIL(("Name of Sender Address 2 (Sender search key) - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1876 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1877 LIST_COPY(item->email->outlook_sender2, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1878 DEBUG_EMAIL(("%s\n", item->email->outlook_sender2)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1879 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1880 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1881 case 0x0C1E: // PR_SENDER_ADDRTYPE Sender Address 2 access method |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1882 DEBUG_EMAIL(("Sender Address type - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1883 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1884 LIST_COPY(item->email->sender2_access, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1885 DEBUG_EMAIL(("%s\n", item->email->sender2_access)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1886 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1887 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1888 case 0x0C1F: // PR_SENDER_EMAIL_ADDRESS Sender Address 2 |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1889 DEBUG_EMAIL(("Sender Address - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1890 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1891 LIST_COPY(item->email->sender2_address, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1892 DEBUG_EMAIL(("%s\n", item->email->sender2_address)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1893 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1894 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1895 case 0x0E01: // PR_DELETE_AFTER_SUBMIT |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1896 // I am not too sure how this works |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1897 DEBUG_EMAIL(("Delete after submit - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1898 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1899 if (*(int16_t*) list->items[x]->data != 0) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1900 DEBUG_EMAIL(("True\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1901 item->email->delete_after_submit = 1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1902 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1903 DEBUG_EMAIL(("False\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1904 item->email->delete_after_submit = 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1905 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1906 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1907 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1908 case 0x0E03: // PR_DISPLAY_CC CC Addresses |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1909 DEBUG_EMAIL(("Display CC Addresses - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1910 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1911 LIST_COPY(item->email->cc_address, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1912 DEBUG_EMAIL(("%s\n", item->email->cc_address)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1913 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1914 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1915 case 0x0E04: // PR_DISPLAY_TO Address Sent-To |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1916 DEBUG_EMAIL(("Display Sent-To Address - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1917 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1918 LIST_COPY(item->email->sentto_address, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1919 DEBUG_EMAIL(("%s\n", item->email->sentto_address)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1920 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1921 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1922 case 0x0E06: // PR_MESSAGE_DELIVERY_TIME Date 3 - Email Arrival Date |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1923 DEBUG_EMAIL(("Date 3 (Delivery Time) - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1924 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1925 LIST_COPY(item->email->arrival_date, (FILETIME*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1926 DEBUG_EMAIL(("%s", fileTimeToAscii(item->email->arrival_date))); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1927 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1928 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1929 case 0x0E07: // PR_MESSAGE_FLAGS Email Flag |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1930 // 0x01 - Read |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1931 // 0x02 - Unmodified |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1932 // 0x04 - Submit |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1933 // 0x08 - Unsent |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1934 // 0x10 - Has Attachments |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1935 // 0x20 - From Me |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1936 // 0x40 - Associated |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1937 // 0x80 - Resend |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1938 // 0x100 - RN Pending |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1939 // 0x200 - NRN Pending |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1940 DEBUG_EMAIL(("Message Flags - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1941 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1942 memcpy(&(item->email->flag), list->items[x]->data, sizeof(item->email->flag)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1943 LE32_CPU(item->email->flag); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1944 DEBUG_EMAIL(("%i\n", item->email->flag)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1945 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1946 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1947 case 0x0E08: // PR_MESSAGE_SIZE Total size of a message object |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1948 DEBUG_EMAIL(("Message Size - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1949 memcpy(&(item->message_size), list->items[x]->data, sizeof(item->message_size)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1950 LE32_CPU(item->message_size); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1951 DEBUG_EMAIL(("%i [%#x]\n", item->message_size, item->message_size)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1952 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1953 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1954 case 0x0E0A: // PR_SENTMAIL_ENTRYID |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1955 // folder that this message is sent to after submission |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1956 DEBUG_EMAIL(("Sentmail EntryID - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1957 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1958 LIST_COPY(item->email->sentmail_folder, (pst_entryid*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1959 LE32_CPU(item->email->sentmail_folder->id); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1960 DEBUG_EMAIL(("[id = %#x]\n", item->email->sentmail_folder->id)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1961 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1962 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1963 case 0x0E1F: // PR_RTF_IN_SYNC |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1964 // True means that the rtf version is same as text body |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1965 // False means rtf version is more up-to-date than text body |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1966 // if this value doesn't exist, text body is more up-to-date than rtf and |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1967 // cannot update to the rtf |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1968 DEBUG_EMAIL(("Compressed RTF in Sync - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1969 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1970 if (*(int16_t*)list->items[x]->data != 0) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1971 DEBUG_EMAIL(("True\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1972 item->email->rtf_in_sync = 1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1973 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1974 DEBUG_EMAIL(("False\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1975 item->email->rtf_in_sync = 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1976 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1977 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1978 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1979 case 0x0E20: // PR_ATTACH_SIZE binary Attachment data in record |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1980 DEBUG_EMAIL(("Attachment Size - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1981 NULL_CHECK(attach); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1982 MOVE_NEXT(attach); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1983 memcpy(&(attach->size), list->items[x]->data, |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1984 sizeof(attach->size)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1985 DEBUG_EMAIL(("%i\n", attach->size)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1986 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1987 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1988 case 0x0FF9: // PR_RECORD_KEY Record Header 1 |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1989 DEBUG_EMAIL(("Record Key 1 - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1990 LIST_COPY(item->record_key, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1991 item->record_key_size = list->items[x]->size; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1992 DEBUG_EMAIL_HEXPRINT(item->record_key, item->record_key_size); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1993 DEBUG_EMAIL(("\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1994 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1995 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1996 case 0x1000: // PR_BODY Plain Text body |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1997 DEBUG_EMAIL(("Plain Text body - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1998 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
1999 LIST_COPY(item->email->body, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2000 //DEBUG_EMAIL("%s\n", item->email->body); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2001 DEBUG_EMAIL(("NOT PRINTED\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2002 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2003 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2004 case 0x1006: // PR_RTF_SYNC_BODY_CRC |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2005 DEBUG_EMAIL(("RTF Sync Body CRC - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2006 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2007 memcpy(&(item->email->rtf_body_crc), list->items[x]->data, |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2008 sizeof(item->email->rtf_body_crc)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2009 LE32_CPU(item->email->rtf_body_crc); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2010 DEBUG_EMAIL(("%#x\n", item->email->rtf_body_crc)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2011 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2012 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2013 case 0x1007: // PR_RTF_SYNC_BODY_COUNT |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2014 // a count of the *significant* charcters in the rtf body. Doesn't count |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2015 // whitespace and other ignorable characters |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2016 DEBUG_EMAIL(("RTF Sync Body character count - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2017 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2018 memcpy(&(item->email->rtf_body_char_count), list->items[x]->data, |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2019 sizeof(item->email->rtf_body_char_count)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2020 LE32_CPU(item->email->rtf_body_char_count); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2021 DEBUG_EMAIL(("%i [%#x]\n", item->email->rtf_body_char_count, |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2022 item->email->rtf_body_char_count)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2023 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2024 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2025 case 0x1008: // PR_RTF_SYNC_BODY_TAG |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2026 // the first couple of lines of RTF body so that after modification, then beginning can |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2027 // once again be found |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2028 DEBUG_EMAIL(("RTF Sync body tag - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2029 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2030 LIST_COPY(item->email->rtf_body_tag, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2031 DEBUG_EMAIL(("%s\n", item->email->rtf_body_tag)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2032 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2033 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2034 case 0x1009: // PR_RTF_COMPRESSED |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2035 // some compression algorithm has been applied to this. At present |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2036 // it is unknown |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2037 DEBUG_EMAIL(("RTF Compressed body - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2038 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2039 LIST_COPY(item->email->rtf_compressed, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2040 // DEBUG_EMAIL(("Pointer: %p\n", item->email->rtf_compressed)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2041 DEBUG_EMAIL(("NOT PRINTED\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2042 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2043 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2044 case 0x1010: // PR_RTF_SYNC_PREFIX_COUNT |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2045 // a count of the ignored characters before the first significant character |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2046 DEBUG_EMAIL(("RTF whitespace prefix count - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2047 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2048 memcpy(&(item->email->rtf_ws_prefix_count), list->items[x]->data, |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2049 sizeof(item->email->rtf_ws_prefix_count)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2050 DEBUG_EMAIL(("%i\n", item->email->rtf_ws_prefix_count)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2051 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2052 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2053 case 0x1011: // PR_RTF_SYNC_TRAILING_COUNT |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2054 // a count of the ignored characters after the last significant character |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2055 DEBUG_EMAIL(("RTF whitespace tailing count - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2056 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2057 memcpy(&(item->email->rtf_ws_trailing_count), list->items[x]->data, |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2058 sizeof(item->email->rtf_ws_trailing_count)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2059 DEBUG_EMAIL(("%i\n", item->email->rtf_ws_trailing_count)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2060 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2061 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2062 case 0x1013: // HTML body |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2063 DEBUG_EMAIL(("HTML body - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2064 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2065 LIST_COPY(item->email->htmlbody, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2066 // DEBUG_EMAIL(("%s\n", item->email->htmlbody)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2067 DEBUG_EMAIL(("NOT PRINTED\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2068 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2069 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2070 case 0x1035: // Message ID |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2071 DEBUG_EMAIL(("Message ID - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2072 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2073 LIST_COPY(item->email->messageid, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2074 DEBUG_EMAIL(("%s\n", item->email->messageid)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2075 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2076 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2077 case 0x1042: // in-reply-to |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2078 DEBUG_EMAIL(("In-Reply-To - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2079 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2080 LIST_COPY(item->email->in_reply_to, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2081 DEBUG_EMAIL(("%s\n", item->email->in_reply_to)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2082 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2083 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2084 case 0x1046: // Return Path |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2085 DEBUG_EMAIL(("Return Path - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2086 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2087 LIST_COPY(item->email->return_path_address, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2088 DEBUG_EMAIL(("%s\n", item->email->return_path_address)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2089 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2090 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2091 case 0x3001: // PR_DISPLAY_NAME File As |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2092 DEBUG_EMAIL(("Display Name - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2093 LIST_COPY(item->file_as, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2094 DEBUG_EMAIL(("%s\n", item->file_as)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2095 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2096 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2097 case 0x3002: // PR_ADDRTYPE |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2098 DEBUG_EMAIL(("Address Type - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2099 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2100 LIST_COPY(item->contact->address1_transport, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2101 DEBUG_EMAIL(("%s\n", item->contact->address1_transport)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2102 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2103 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2104 case 0x3003: // PR_EMAIL_ADDRESS |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2105 // Contact's email address |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2106 DEBUG_EMAIL(("Contact Address - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2107 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2108 LIST_COPY(item->contact->address1, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2109 DEBUG_EMAIL(("%s\n", item->contact->address1)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2110 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2111 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2112 case 0x3004: // PR_COMMENT Comment for item - usually folders |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2113 DEBUG_EMAIL(("Comment - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2114 LIST_COPY(item->comment, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2115 DEBUG_EMAIL(("%s\n", item->comment)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2116 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2117 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2118 case 0x3007: // PR_CREATION_TIME Date 4 - Creation Date? |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2119 DEBUG_EMAIL(("Date 4 (Item Creation Date) - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2120 LIST_COPY(item->create_date, (FILETIME*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2121 DEBUG_EMAIL(("%s", fileTimeToAscii(item->create_date))); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2122 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2123 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2124 case 0x3008: // PR_LAST_MODIFICATION_TIME Date 5 - Modify Date |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2125 DEBUG_EMAIL(("Date 5 (Modify Date) - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2126 LIST_COPY(item->modify_date, (FILETIME*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2127 DEBUG_EMAIL(("%s", fileTimeToAscii(item->modify_date))); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2128 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2129 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2130 case 0x300B: // PR_SEARCH_KEY Record Header 2 |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2131 DEBUG_EMAIL(("Record Search 2 -- NOT HANDLED\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2132 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2133 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2134 case 0x35DF: // PR_VALID_FOLDER_MASK |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2135 // States which folders are valid for this message store |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2136 // FOLDER_IPM_SUBTREE_VALID 0x1 |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2137 // FOLDER_IPM_INBOX_VALID 0x2 |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2138 // FOLDER_IPM_OUTBOX_VALID 0x4 |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2139 // FOLDER_IPM_WASTEBOX_VALID 0x8 |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2140 // FOLDER_IPM_SENTMAIL_VALID 0x10 |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2141 // FOLDER_VIEWS_VALID 0x20 |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2142 // FOLDER_COMMON_VIEWS_VALID 0x40 |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2143 // FOLDER_FINDER_VALID 0x80 |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2144 DEBUG_EMAIL(("Valid Folder Mask - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2145 MALLOC_MESSAGESTORE(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2146 memcpy(&(item->message_store->valid_mask), list->items[x]->data, sizeof(int)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2147 LE32_CPU(item->message_store->valid_mask); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2148 DEBUG_EMAIL(("%i\n", item->message_store->valid_mask)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2149 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2150 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2151 case 0x35E0: // PR_IPM_SUBTREE_ENTRYID Top of Personal Folder Record |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2152 DEBUG_EMAIL(("Top of Personal Folder Record - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2153 MALLOC_MESSAGESTORE(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2154 LIST_COPY(item->message_store->top_of_personal_folder, (pst_entryid*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2155 LE32_CPU(item->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
|
2156 DEBUG_EMAIL(("[id = %#x]\n", item->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
|
2157 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2158 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2159 case 0x35E3: // PR_IPM_WASTEBASKET_ENTRYID Deleted Items Folder Record |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2160 DEBUG_EMAIL(("Deleted Items Folder record - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2161 MALLOC_MESSAGESTORE(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2162 LIST_COPY(item->message_store->deleted_items_folder, (pst_entryid*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2163 LE32_CPU(item->message_store->deleted_items_folder->id); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2164 DEBUG_EMAIL(("[id = %#x]\n", item->message_store->deleted_items_folder->id)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2165 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2166 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2167 case 0x35E7: // PR_FINDER_ENTRYID Search Root Record |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2168 DEBUG_EMAIL(("Search Root record - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2169 MALLOC_MESSAGESTORE(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2170 LIST_COPY(item->message_store->search_root_folder, (pst_entryid*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2171 LE32_CPU(item->message_store->search_root_folder->id); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2172 DEBUG_EMAIL(("[id = %#x]\n", item->message_store->search_root_folder->id)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2173 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2174 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2175 case 0x3602: // PR_CONTENT_COUNT Number of emails stored in a folder |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2176 DEBUG_EMAIL(("Folder Email Count - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2177 MALLOC_FOLDER(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2178 memcpy(&(item->folder->email_count), list->items[x]->data, sizeof(item->folder->email_count)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2179 LE32_CPU(item->folder->email_count); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2180 DEBUG_EMAIL(("%i\n", item->folder->email_count)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2181 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2182 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2183 case 0x3603: // PR_CONTENT_UNREAD Number of unread emails |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2184 DEBUG_EMAIL(("Unread Email Count - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2185 MALLOC_FOLDER(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2186 memcpy(&(item->folder->unseen_email_count), list->items[x]->data, sizeof(item->folder->unseen_email_count)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2187 LE32_CPU(item->folder->unseen_email_count); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2188 DEBUG_EMAIL(("%i\n", item->folder->unseen_email_count)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2189 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2190 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2191 case 0x360A: // PR_SUBFOLDERS Has children |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2192 DEBUG_EMAIL(("Has Subfolders - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2193 MALLOC_FOLDER(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2194 if (*((int32_t*)list->items[x]->data) != 0) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2195 DEBUG_EMAIL(("True\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2196 item->folder->subfolder = 1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2197 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2198 DEBUG_EMAIL(("False\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2199 item->folder->subfolder = 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2200 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2201 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2202 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2203 case 0x3613: // PR_CONTAINER_CLASS IPF.x |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2204 DEBUG_EMAIL(("IPF.x - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2205 LIST_COPY(item->ascii_type, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2206 if (strncmp("IPF.Note", item->ascii_type, 8) == 0) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2207 item->type = PST_TYPE_NOTE; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2208 else if (strncmp("IPF.Contact", item->ascii_type, 11) == 0) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2209 item->type = PST_TYPE_CONTACT; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2210 else if (strncmp("IPF.Journal", item->ascii_type, 11) == 0) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2211 item->type = PST_TYPE_JOURNAL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2212 else if (strncmp("IPF.Appointment", item->ascii_type, 15) == 0) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2213 item->type = PST_TYPE_APPOINTMENT; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2214 else if (strncmp("IPF.StickyNote", item->ascii_type, 14) == 0) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2215 item->type = PST_TYPE_STICKYNOTE; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2216 else if (strncmp("IPF.Task", item->ascii_type, 8) == 0) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2217 item->type = PST_TYPE_TASK; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2218 else |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2219 item->type = PST_TYPE_OTHER; |
0 | 2220 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2221 DEBUG_EMAIL(("%s [%i]\n", item->ascii_type, item->type)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2222 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2223 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2224 case 0x3617: // PR_ASSOC_CONTENT_COUNT |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2225 // associated content are items that are attached to this folder |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2226 // but are hidden from users |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2227 DEBUG_EMAIL(("Associate Content count - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2228 MALLOC_FOLDER(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2229 memcpy(&(item->folder->assoc_count), list->items[x]->data, sizeof(item->folder->assoc_count)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2230 LE32_CPU(item->folder->assoc_count); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2231 DEBUG_EMAIL(("%i [%#x]\n", item->folder->assoc_count, item->folder->assoc_count)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2232 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2233 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2234 case 0x3701: // PR_ATTACH_DATA_OBJ binary data of attachment |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2235 DEBUG_EMAIL(("Binary Data [Size %i] - ", |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2236 list->items[x]->size)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2237 NULL_CHECK(attach); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2238 MOVE_NEXT(attach); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2239 if (list->items[x]->data == NULL) { //special case |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2240 attach->id2_val = list->items[x]->type; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2241 DEBUG_EMAIL(("Seen a Reference. The data hasn't been loaded yet. [%#x][%#x]\n", |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2242 attach->id2_val, list->items[x]->type)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2243 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2244 LIST_COPY(attach->data, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2245 attach->size = list->items[x]->size; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2246 DEBUG_EMAIL(("NOT PRINTED\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2247 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2248 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2249 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2250 case 0x3704: // PR_ATTACH_FILENAME Attachment filename (8.3) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2251 DEBUG_EMAIL(("Attachment Filename - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2252 NULL_CHECK(attach); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2253 MOVE_NEXT(attach); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2254 LIST_COPY(attach->filename1, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2255 DEBUG_EMAIL(("%s\n", attach->filename1)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2256 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2257 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2258 case 0x3705: // PR_ATTACH_METHOD |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2259 // 0 - No Attachment |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2260 // 1 - Attach by Value |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2261 // 2 - Attach by reference |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2262 // 3 - Attach by ref resolve |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2263 // 4 - Attach by ref only |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2264 // 5 - Embedded Message |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2265 // 6 - OLE |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2266 DEBUG_EMAIL(("Attachement method - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2267 NULL_CHECK(attach); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2268 MOVE_NEXT(attach); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2269 memcpy(&(attach->method), list->items[x]->data, sizeof(attach->method)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2270 LE32_CPU(attach->method); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2271 t = attach->method; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2272 DEBUG_EMAIL(("%s [%i]\n", (t==0?"No Attachment": |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2273 (t==1?"Attach By Value": |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2274 (t==2?"Attach By Reference": |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2275 (t==3?"Attach by Ref. Resolve": |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2276 (t==4?"Attach by Ref. Only": |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2277 (t==5?"Embedded Message":"OLE")))))),t)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2278 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2279 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2280 case 0x370B: // PR_RENDERING_POSITION |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2281 // position in characters that the attachment appears in the plain text body |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2282 DEBUG_EMAIL(("Attachment Position - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2283 NULL_CHECK(attach); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2284 MOVE_NEXT(attach); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2285 memcpy(&(attach->position), list->items[x]->data, sizeof(attach->position)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2286 LE32_CPU(attach->position); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2287 DEBUG_EMAIL(("%i [%#x]\n", attach->position)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2288 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2289 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2290 case 0x3707: // PR_ATTACH_LONG_FILENAME Attachment filename (long?) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2291 DEBUG_EMAIL(("Attachment Filename long - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2292 NULL_CHECK(attach); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2293 MOVE_NEXT(attach); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2294 LIST_COPY(attach->filename2, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2295 DEBUG_EMAIL(("%s\n", attach->filename2)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2296 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2297 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2298 case 0x370E: // PR_ATTACH_MIME_TAG Mime type of encoding |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2299 DEBUG_EMAIL(("Attachment mime encoding - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2300 NULL_CHECK(attach); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2301 MOVE_NEXT(attach); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2302 LIST_COPY(attach->mimetype, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2303 DEBUG_EMAIL(("%s\n", attach->mimetype)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2304 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2305 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2306 case 0x3710: // PR_ATTACH_MIME_SEQUENCE |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2307 // sequence number for mime parts. Includes body |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2308 DEBUG_EMAIL(("Attachment Mime Sequence - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2309 NULL_CHECK(attach); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2310 MOVE_NEXT(attach); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2311 memcpy(&(attach->sequence), list->items[x]->data, sizeof(attach->sequence)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2312 LE32_CPU(attach->sequence); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2313 DEBUG_EMAIL(("%i\n", attach->sequence)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2314 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2315 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2316 case 0x3A00: // PR_ACCOUNT |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2317 DEBUG_EMAIL(("Contact's Account name - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2318 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2319 LIST_COPY(item->contact->account_name, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2320 DEBUG_EMAIL(("%s\n", item->contact->account_name)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2321 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2322 case 0x3A01: // PR_ALTERNATE_RECIPIENT |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2323 DEBUG_EMAIL(("Contact Alternate Recipient - NOT PROCESSED\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2324 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2325 case 0x3A02: // PR_CALLBACK_TELEPHONE_NUMBER |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2326 DEBUG_EMAIL(("Callback telephone number - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2327 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2328 LIST_COPY(item->contact->callback_phone, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2329 DEBUG_EMAIL(("%s\n", item->contact->callback_phone)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2330 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2331 case 0x3A03: // PR_CONVERSION_PROHIBITED |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2332 DEBUG_EMAIL(("Message Conversion Prohibited - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2333 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2334 if (*(int16_t*)list->items[x]->data != 0) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2335 DEBUG_EMAIL(("True\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2336 item->email->conversion_prohib = 1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2337 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2338 DEBUG_EMAIL(("False\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2339 item->email->conversion_prohib = 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2340 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2341 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2342 case 0x3A05: // PR_GENERATION suffix |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2343 DEBUG_EMAIL(("Contacts Suffix - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2344 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2345 LIST_COPY(item->contact->suffix, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2346 DEBUG_EMAIL(("%s\n", item->contact->suffix)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2347 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2348 case 0x3A06: // PR_GIVEN_NAME Contact's first name |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2349 DEBUG_EMAIL(("Contacts First Name - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2350 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2351 LIST_COPY(item->contact->first_name, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2352 DEBUG_EMAIL(("%s\n", item->contact->first_name)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2353 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2354 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2355 case 0x3A07: // PR_GOVERNMENT_ID_NUMBER |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2356 DEBUG_EMAIL(("Contacts Government ID Number - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2357 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2358 LIST_COPY(item->contact->gov_id, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2359 DEBUG_EMAIL(("%s\n", item->contact->gov_id)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2360 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2361 case 0x3A08: // PR_BUSINESS_TELEPHONE_NUMBER |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2362 DEBUG_EMAIL(("Business Telephone Number - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2363 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2364 LIST_COPY(item->contact->business_phone, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2365 DEBUG_EMAIL(("%s\n", item->contact->business_phone)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2366 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2367 case 0x3A09: // PR_HOME_TELEPHONE_NUMBER |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2368 DEBUG_EMAIL(("Home Telephone Number - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2369 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2370 LIST_COPY(item->contact->home_phone, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2371 DEBUG_EMAIL(("%s\n", item->contact->home_phone)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2372 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2373 case 0x3A0A: // PR_INITIALS Contact's Initials |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2374 DEBUG_EMAIL(("Contacts Initials - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2375 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2376 LIST_COPY(item->contact->initials, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2377 DEBUG_EMAIL(("%s\n", item->contact->initials)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2378 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2379 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2380 case 0x3A0B: // PR_KEYWORD |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2381 DEBUG_EMAIL(("Keyword - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2382 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2383 LIST_COPY(item->contact->keyword, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2384 DEBUG_EMAIL(("%s\n", item->contact->keyword)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2385 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2386 case 0x3A0C: // PR_LANGUAGE |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2387 DEBUG_EMAIL(("Contact's Language - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2388 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2389 LIST_COPY(item->contact->language, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2390 DEBUG_EMAIL(("%s\n", item->contact->language)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2391 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2392 case 0x3A0D: // PR_LOCATION |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2393 DEBUG_EMAIL(("Contact's Location - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2394 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2395 LIST_COPY(item->contact->location, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2396 DEBUG_EMAIL(("%s\n", item->contact->location)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2397 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2398 case 0x3A0E: // PR_MAIL_PERMISSION - Can the recipient receive and send email |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2399 DEBUG_EMAIL(("Mail Permission - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2400 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2401 if (*(int16_t*)list->items[x]->data != 0) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2402 DEBUG_EMAIL(("True\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2403 item->contact->mail_permission = 1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2404 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2405 DEBUG_EMAIL(("False\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2406 item->contact->mail_permission = 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2407 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2408 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2409 case 0x3A0F: // PR_MHS_COMMON_NAME |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2410 DEBUG_EMAIL(("MHS Common Name - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2411 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2412 LIST_COPY(item->email->common_name, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2413 DEBUG_EMAIL(("%s\n", item->email->common_name)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2414 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2415 case 0x3A10: // PR_ORGANIZATIONAL_ID_NUMBER |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2416 DEBUG_EMAIL(("Organizational ID # - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2417 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2418 LIST_COPY(item->contact->org_id, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2419 DEBUG_EMAIL(("%s\n", item->contact->org_id)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2420 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2421 case 0x3A11: // PR_SURNAME Contact's Surname |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2422 DEBUG_EMAIL(("Contacts Surname - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2423 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2424 LIST_COPY(item->contact->surname, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2425 DEBUG_EMAIL(("%s\n", item->contact->surname)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2426 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2427 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2428 case 0x3A12: // PR_ORIGINAL_ENTRY_ID |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2429 DEBUG_EMAIL(("Original Entry ID - NOT PROCESSED\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2430 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2431 case 0x3A13: // PR_ORIGINAL_DISPLAY_NAME |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2432 DEBUG_EMAIL(("Original Display Name - NOT PROCESSED\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2433 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2434 case 0x3A14: // PR_ORIGINAL_SEARCH_KEY |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2435 DEBUG_EMAIL(("Original Search Key - NOT PROCESSED\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2436 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2437 case 0x3A15: // PR_POSTAL_ADDRESS |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2438 DEBUG_EMAIL(("Default Postal Address - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2439 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2440 LIST_COPY(item->contact->def_postal_address, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2441 DEBUG_EMAIL(("%s\n", item->contact->def_postal_address)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2442 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2443 case 0x3A16: // PR_COMPANY_NAME |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2444 DEBUG_EMAIL(("Company Name - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2445 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2446 LIST_COPY(item->contact->company_name, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2447 DEBUG_EMAIL(("%s\n", item->contact->company_name)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2448 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2449 case 0x3A17: // PR_TITLE - Job Title |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2450 DEBUG_EMAIL(("Job Title - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2451 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2452 LIST_COPY(item->contact->job_title, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2453 DEBUG_EMAIL(("%s\n", item->contact->job_title)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2454 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2455 case 0x3A18: // PR_DEPARTMENT_NAME |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2456 DEBUG_EMAIL(("Department Name - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2457 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2458 LIST_COPY(item->contact->department, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2459 DEBUG_EMAIL(("%s\n", item->contact->department)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2460 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2461 case 0x3A19: // PR_OFFICE_LOCATION |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2462 DEBUG_EMAIL(("Office Location - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2463 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2464 LIST_COPY(item->contact->office_loc, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2465 DEBUG_EMAIL(("%s\n", item->contact->office_loc)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2466 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2467 case 0x3A1A: // PR_PRIMARY_TELEPHONE_NUMBER |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2468 DEBUG_EMAIL(("Primary Telephone - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2469 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2470 LIST_COPY(item->contact->primary_phone, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2471 DEBUG_EMAIL(("%s\n", item->contact->primary_phone)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2472 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2473 case 0x3A1B: // PR_BUSINESS2_TELEPHONE_NUMBER |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2474 DEBUG_EMAIL(("Business Phone Number 2 - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2475 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2476 LIST_COPY(item->contact->business_phone2, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2477 DEBUG_EMAIL(("%s\n", item->contact->business_phone2)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2478 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2479 case 0x3A1C: // PR_MOBILE_TELEPHONE_NUMBER |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2480 DEBUG_EMAIL(("Mobile Phone Number - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2481 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2482 LIST_COPY(item->contact->mobile_phone, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2483 DEBUG_EMAIL(("%s\n", item->contact->mobile_phone)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2484 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2485 case 0x3A1D: // PR_RADIO_TELEPHONE_NUMBER |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2486 DEBUG_EMAIL(("Radio Phone Number - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2487 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2488 LIST_COPY(item->contact->radio_phone, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2489 DEBUG_EMAIL(("%s\n", item->contact->radio_phone)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2490 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2491 case 0x3A1E: // PR_CAR_TELEPHONE_NUMBER |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2492 DEBUG_EMAIL(("Car Phone Number - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2493 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2494 LIST_COPY(item->contact->car_phone, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2495 DEBUG_EMAIL(("%s\n", item->contact->car_phone)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2496 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2497 case 0x3A1F: // PR_OTHER_TELEPHONE_NUMBER |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2498 DEBUG_EMAIL(("Other Phone Number - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2499 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2500 LIST_COPY(item->contact->other_phone, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2501 DEBUG_EMAIL(("%s\n", item->contact->other_phone)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2502 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2503 case 0x3A20: // PR_TRANSMITTABLE_DISPLAY_NAME |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2504 DEBUG_EMAIL(("Transmittable Display Name - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2505 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2506 LIST_COPY(item->contact->transmittable_display_name, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2507 DEBUG_EMAIL(("%s\n", item->contact->transmittable_display_name)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2508 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2509 case 0x3A21: // PR_PAGER_TELEPHONE_NUMBER |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2510 DEBUG_EMAIL(("Pager Phone Number - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2511 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2512 LIST_COPY(item->contact->pager_phone, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2513 DEBUG_EMAIL(("%s\n", item->contact->pager_phone)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2514 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2515 case 0x3A22: // PR_USER_CERTIFICATE |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2516 DEBUG_EMAIL(("User Certificate - NOT PROCESSED")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2517 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2518 case 0x3A23: // PR_PRIMARY_FAX_NUMBER |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2519 DEBUG_EMAIL(("Primary Fax Number - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2520 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2521 LIST_COPY(item->contact->primary_fax, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2522 DEBUG_EMAIL(("%s\n", item->contact->primary_fax)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2523 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2524 case 0x3A24: // PR_BUSINESS_FAX_NUMBER |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2525 DEBUG_EMAIL(("Business Fax Number - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2526 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2527 LIST_COPY(item->contact->business_fax, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2528 DEBUG_EMAIL(("%s\n", item->contact->business_fax)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2529 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2530 case 0x3A25: // PR_HOME_FAX_NUMBER |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2531 DEBUG_EMAIL(("Home Fax Number - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2532 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2533 LIST_COPY(item->contact->home_fax, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2534 DEBUG_EMAIL(("%s\n", item->contact->home_fax)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2535 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2536 case 0x3A26: // PR_BUSINESS_ADDRESS_COUNTRY |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2537 DEBUG_EMAIL(("Business Address Country - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2538 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2539 LIST_COPY(item->contact->business_country, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2540 DEBUG_EMAIL(("%s\n", item->contact->business_country)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2541 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2542 case 0x3A27: // PR_BUSINESS_ADDRESS_CITY |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2543 DEBUG_EMAIL(("Business Address City - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2544 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2545 LIST_COPY(item->contact->business_city, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2546 DEBUG_EMAIL(("%s\n", item->contact->business_city)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2547 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2548 case 0x3A28: // PR_BUSINESS_ADDRESS_STATE_OR_PROVINCE |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2549 DEBUG_EMAIL(("Business Address State - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2550 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2551 LIST_COPY(item->contact->business_state, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2552 DEBUG_EMAIL(("%s\n", item->contact->business_state)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2553 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2554 case 0x3A29: // PR_BUSINESS_ADDRESS_STREET |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2555 DEBUG_EMAIL(("Business Address Street - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2556 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2557 LIST_COPY(item->contact->business_street, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2558 DEBUG_EMAIL(("%s\n", item->contact->business_street)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2559 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2560 case 0x3A2A: // PR_BUSINESS_POSTAL_CODE |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2561 DEBUG_EMAIL(("Business Postal Code - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2562 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2563 LIST_COPY(item->contact->business_postal_code, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2564 DEBUG_EMAIL(("%s\n", item->contact->business_postal_code)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2565 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2566 case 0x3A2B: // PR_BUSINESS_PO_BOX |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2567 DEBUG_EMAIL(("Business PO Box - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2568 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2569 LIST_COPY(item->contact->business_po_box, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2570 DEBUG_EMAIL(("%s\n", item->contact->business_po_box)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2571 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2572 case 0x3A2C: // PR_TELEX_NUMBER |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2573 DEBUG_EMAIL(("Telex Number - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2574 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2575 LIST_COPY(item->contact->telex, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2576 DEBUG_EMAIL(("%s\n", item->contact->telex)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2577 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2578 case 0x3A2D: // PR_ISDN_NUMBER |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2579 DEBUG_EMAIL(("ISDN Number - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2580 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2581 LIST_COPY(item->contact->isdn_phone, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2582 DEBUG_EMAIL(("%s\n", item->contact->isdn_phone)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2583 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2584 case 0x3A2E: // PR_ASSISTANT_TELEPHONE_NUMBER |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2585 DEBUG_EMAIL(("Assistant Phone Number - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2586 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2587 LIST_COPY(item->contact->assistant_phone, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2588 DEBUG_EMAIL(("%s\n", item->contact->assistant_phone)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2589 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2590 case 0x3A2F: // PR_HOME2_TELEPHONE_NUMBER |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2591 DEBUG_EMAIL(("Home Phone 2 - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2592 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2593 LIST_COPY(item->contact->home_phone2, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2594 DEBUG_EMAIL(("%s\n", item->contact->home_phone2)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2595 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2596 case 0x3A30: // PR_ASSISTANT |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2597 DEBUG_EMAIL(("Assistant's Name - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2598 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2599 LIST_COPY(item->contact->assistant_name, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2600 DEBUG_EMAIL(("%s\n", item->contact->assistant_name)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2601 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2602 case 0x3A40: // PR_SEND_RICH_INFO |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2603 DEBUG_EMAIL(("Can receive Rich Text - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2604 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2605 if(*(int16_t*)list->items[x]->data != 0) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2606 DEBUG_EMAIL(("True\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2607 item->contact->rich_text = 1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2608 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2609 DEBUG_EMAIL(("False\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2610 item->contact->rich_text = 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2611 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2612 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2613 case 0x3A41: // PR_WEDDING_ANNIVERSARY |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2614 DEBUG_EMAIL(("Wedding Anniversary - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2615 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2616 LIST_COPY(item->contact->wedding_anniversary, (FILETIME*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2617 DEBUG_EMAIL(("%s\n", fileTimeToAscii(item->contact->wedding_anniversary))); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2618 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2619 case 0x3A42: // PR_BIRTHDAY |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2620 DEBUG_EMAIL(("Birthday - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2621 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2622 LIST_COPY(item->contact->birthday, (FILETIME*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2623 DEBUG_EMAIL(("%s\n", fileTimeToAscii(item->contact->birthday))); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2624 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2625 case 0x3A43: // PR_HOBBIES |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2626 DEBUG_EMAIL(("Hobbies - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2627 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2628 LIST_COPY(item->contact->hobbies, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2629 DEBUG_EMAIL(("%s\n", item->contact->hobbies)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2630 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2631 case 0x3A44: // PR_MIDDLE_NAME |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2632 DEBUG_EMAIL(("Middle Name - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2633 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2634 LIST_COPY(item->contact->middle_name, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2635 DEBUG_EMAIL(("%s\n", item->contact->middle_name)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2636 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2637 case 0x3A45: // PR_DISPLAY_NAME_PREFIX |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2638 DEBUG_EMAIL(("Display Name Prefix (Title) - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2639 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2640 LIST_COPY(item->contact->display_name_prefix, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2641 DEBUG_EMAIL(("%s\n", item->contact->display_name_prefix)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2642 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2643 case 0x3A46: // PR_PROFESSION |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2644 DEBUG_EMAIL(("Profession - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2645 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2646 LIST_COPY(item->contact->profession, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2647 DEBUG_EMAIL(("%s\n", item->contact->profession)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2648 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2649 case 0x3A47: // PR_PREFERRED_BY_NAME |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2650 DEBUG_EMAIL(("Preferred By Name - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2651 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2652 LIST_COPY(item->contact->pref_name, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2653 DEBUG_EMAIL(("%s\n", item->contact->pref_name)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2654 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2655 case 0x3A48: // PR_SPOUSE_NAME |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2656 DEBUG_EMAIL(("Spouse's Name - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2657 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2658 LIST_COPY(item->contact->spouse_name, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2659 DEBUG_EMAIL(("%s\n", item->contact->spouse_name)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2660 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2661 case 0x3A49: // PR_COMPUTER_NETWORK_NAME |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2662 DEBUG_EMAIL(("Computer Network Name - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2663 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2664 LIST_COPY(item->contact->computer_name, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2665 DEBUG_EMAIL(("%s\n", item->contact->computer_name)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2666 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2667 case 0x3A4A: // PR_CUSTOMER_ID |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2668 DEBUG_EMAIL(("Customer ID - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2669 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2670 LIST_COPY(item->contact->customer_id, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2671 DEBUG_EMAIL(("%s\n", item->contact->customer_id)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2672 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2673 case 0x3A4B: // PR_TTYTDD_PHONE_NUMBER |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2674 DEBUG_EMAIL(("TTY/TDD Phone - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2675 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2676 LIST_COPY(item->contact->ttytdd_phone, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2677 DEBUG_EMAIL(("%s\n", item->contact->ttytdd_phone)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2678 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2679 case 0x3A4C: // PR_FTP_SITE |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2680 DEBUG_EMAIL(("Ftp Site - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2681 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2682 LIST_COPY(item->contact->ftp_site, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2683 DEBUG_EMAIL(("%s\n", item->contact->ftp_site)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2684 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2685 case 0x3A4D: // PR_GENDER |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2686 DEBUG_EMAIL(("Gender - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2687 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2688 memcpy(&item->contact->gender, list->items[x]->data, sizeof(int16_t)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2689 LE16_CPU(item->contact->gender); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2690 switch(item->contact->gender) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2691 case 0: |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2692 DEBUG_EMAIL(("Unspecified\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2693 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2694 case 1: |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2695 DEBUG_EMAIL(("Female\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2696 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2697 case 2: |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2698 DEBUG_EMAIL(("Male\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2699 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2700 default: |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2701 DEBUG_EMAIL(("Error processing\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2702 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2703 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2704 case 0x3A4E: // PR_MANAGER_NAME |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2705 DEBUG_EMAIL(("Manager's Name - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2706 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2707 LIST_COPY(item->contact->manager_name, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2708 DEBUG_EMAIL(("%s\n", item->contact->manager_name)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2709 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2710 case 0x3A4F: // PR_NICKNAME |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2711 DEBUG_EMAIL(("Nickname - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2712 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2713 LIST_COPY(item->contact->nickname, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2714 DEBUG_EMAIL(("%s\n", item->contact->nickname)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2715 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2716 case 0x3A50: // PR_PERSONAL_HOME_PAGE |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2717 DEBUG_EMAIL(("Personal Home Page - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2718 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2719 LIST_COPY(item->contact->personal_homepage, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2720 DEBUG_EMAIL(("%s\n", item->contact->personal_homepage)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2721 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2722 case 0x3A51: // PR_BUSINESS_HOME_PAGE |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2723 DEBUG_EMAIL(("Business Home Page - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2724 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2725 LIST_COPY(item->contact->business_homepage, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2726 DEBUG_EMAIL(("%s\n", item->contact->business_homepage)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2727 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2728 case 0x3A57: // PR_COMPANY_MAIN_PHONE_NUMBER |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2729 DEBUG_EMAIL(("Company Main Phone - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2730 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2731 LIST_COPY(item->contact->company_main_phone, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2732 DEBUG_EMAIL(("%s\n", item->contact->company_main_phone)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2733 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2734 case 0x3A58: // PR_CHILDRENS_NAMES |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2735 DEBUG_EMAIL(("Children's Names - NOT PROCESSED\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2736 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2737 case 0x3A59: // PR_HOME_ADDRESS_CITY |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2738 DEBUG_EMAIL(("Home Address City - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2739 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2740 LIST_COPY(item->contact->home_city, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2741 DEBUG_EMAIL(("%s\n", item->contact->home_city)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2742 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2743 case 0x3A5A: // PR_HOME_ADDRESS_COUNTRY |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2744 DEBUG_EMAIL(("Home Address Country - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2745 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2746 LIST_COPY(item->contact->home_country, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2747 DEBUG_EMAIL(("%s\n", item->contact->home_country)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2748 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2749 case 0x3A5B: // PR_HOME_ADDRESS_POSTAL_CODE |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2750 DEBUG_EMAIL(("Home Address Postal Code - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2751 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2752 LIST_COPY(item->contact->home_postal_code, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2753 DEBUG_EMAIL(("%s\n", item->contact->home_postal_code)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2754 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2755 case 0x3A5C: // PR_HOME_ADDRESS_STATE_OR_PROVINCE |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2756 DEBUG_EMAIL(("Home Address State or Province - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2757 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2758 LIST_COPY(item->contact->home_state, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2759 DEBUG_EMAIL(("%s\n", item->contact->home_state)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2760 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2761 case 0x3A5D: // PR_HOME_ADDRESS_STREET |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2762 DEBUG_EMAIL(("Home Address Street - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2763 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2764 LIST_COPY(item->contact->home_street, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2765 DEBUG_EMAIL(("%s\n", item->contact->home_street)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2766 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2767 case 0x3A5E: // PR_HOME_ADDRESS_POST_OFFICE_BOX |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2768 DEBUG_EMAIL(("Home Address Post Office Box - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2769 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2770 LIST_COPY(item->contact->home_po_box, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2771 DEBUG_EMAIL(("%s\n", item->contact->home_po_box)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2772 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2773 case 0x3A5F: // PR_OTHER_ADDRESS_CITY |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2774 DEBUG_EMAIL(("Other Address City - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2775 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2776 LIST_COPY(item->contact->other_city, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2777 DEBUG_EMAIL(("%s\n", item->contact->other_city)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2778 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2779 case 0x3A60: // PR_OTHER_ADDRESS_COUNTRY |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2780 DEBUG_EMAIL(("Other Address Country - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2781 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2782 LIST_COPY(item->contact->other_country, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2783 DEBUG_EMAIL(("%s\n", item->contact->other_country)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2784 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2785 case 0x3A61: // PR_OTHER_ADDRESS_POSTAL_CODE |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2786 DEBUG_EMAIL(("Other Address Postal Code - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2787 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2788 LIST_COPY(item->contact->other_postal_code, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2789 DEBUG_EMAIL(("%s\n", item->contact->other_postal_code)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2790 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2791 case 0x3A62: // PR_OTHER_ADDRESS_STATE_OR_PROVINCE |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2792 DEBUG_EMAIL(("Other Address State - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2793 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2794 LIST_COPY(item->contact->other_state, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2795 DEBUG_EMAIL(("%s\n", item->contact->other_state)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2796 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2797 case 0x3A63: // PR_OTHER_ADDRESS_STREET |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2798 DEBUG_EMAIL(("Other Address Street - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2799 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2800 LIST_COPY(item->contact->other_street, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2801 DEBUG_EMAIL(("%s\n", item->contact->other_street)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2802 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2803 case 0x3A64: // PR_OTHER_ADDRESS_POST_OFFICE_BOX |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2804 DEBUG_EMAIL(("Other Address Post Office box - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2805 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2806 LIST_COPY(item->contact->other_po_box, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2807 DEBUG_EMAIL(("%s\n", item->contact->other_po_box)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2808 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2809 case 0x65E3: // Entry ID? |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2810 DEBUG_EMAIL(("Entry ID - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2811 item->record_key = (char*) xmalloc(16+1); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2812 memcpy(item->record_key, &(list->items[x]->data[1]), 16); //skip first byte |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2813 item->record_key[16]='\0'; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2814 item->record_key_size=16; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2815 DEBUG_EMAIL_HEXPRINT((char*)item->record_key, 16); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2816 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2817 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2818 case 0x67F2: // ID2 value of the attachments proper record |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2819 DEBUG_EMAIL(("Attachment ID2 value - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2820 if (attach != NULL){ |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2821 MOVE_NEXT(attach); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2822 memcpy(&(attach->id2_val), list->items[x]->data, sizeof(attach->id2_val)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2823 LE32_CPU(attach->id2_val); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2824 DEBUG_EMAIL(("%#x\n", attach->id2_val)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2825 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2826 DEBUG_EMAIL(("NOT AN ATTACHMENT: %#x\n", list->items[x]->id)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2827 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2828 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2829 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2830 case 0x67FF: // Extra Property Identifier (Password CheckSum) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2831 DEBUG_EMAIL(("Password checksum [0x67FF] - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2832 MALLOC_MESSAGESTORE(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2833 memcpy(&(item->message_store->pwd_chksum), list->items[x]->data, |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2834 sizeof(item->message_store->pwd_chksum)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2835 DEBUG_EMAIL(("%#x\n", item->message_store->pwd_chksum)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2836 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2837 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2838 case 0x6F02: // Secure HTML Body |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2839 DEBUG_EMAIL(("Secure HTML Body - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2840 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2841 LIST_COPY(item->email->encrypted_htmlbody, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2842 item->email->encrypted_htmlbody_size = list->items[x]->size; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2843 DEBUG_EMAIL(("Not Printed\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2844 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2845 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2846 case 0x6F04: // Secure Text Body |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2847 DEBUG_EMAIL(("Secure Text Body - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2848 MALLOC_EMAIL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2849 LIST_COPY(item->email->encrypted_body, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2850 item->email->encrypted_body_size = list->items[x]->size; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2851 DEBUG_EMAIL(("Not Printed\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2852 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2853 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2854 case 0x7C07: // top of folders ENTRYID |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2855 DEBUG_EMAIL(("Top of folders RecID [0x7c07] - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2856 MALLOC_MESSAGESTORE(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2857 item->message_store->top_of_folder = (pst_entryid*) xmalloc(sizeof(pst_entryid)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2858 memcpy(item->message_store->top_of_folder, list->items[x]->data, sizeof(pst_entryid)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2859 LE32_CPU(item->message_store->top_of_folder->u1); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2860 LE32_CPU(item->message_store->top_of_folder->id); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2861 DEBUG_EMAIL_HEXPRINT((char*)item->message_store->top_of_folder->entryid, 16); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2862 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2863 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2864 case 0x8005: // Contact's Fullname |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2865 DEBUG_EMAIL(("Contact Fullname - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2866 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2867 LIST_COPY(item->contact->fullname, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2868 DEBUG_EMAIL(("%s\n", item->contact->fullname)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2869 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2870 case 0x801A: // Full Home Address |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2871 DEBUG_EMAIL(("Home Address - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2872 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2873 LIST_COPY(item->contact->home_address, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2874 DEBUG_EMAIL(("%s\n", item->contact->home_address)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2875 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2876 case 0x801B: // Full Business Address |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2877 DEBUG_EMAIL(("Business Address - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2878 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2879 LIST_COPY(item->contact->business_address, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2880 DEBUG_EMAIL(("%s\n", item->contact->business_address)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2881 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2882 case 0x801C: // Full Other Address |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2883 DEBUG_EMAIL(("Other Address - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2884 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2885 LIST_COPY(item->contact->other_address, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2886 DEBUG_EMAIL(("%s\n", item->contact->other_address)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2887 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2888 case 0x8082: // Email Address 1 Transport |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2889 DEBUG_EMAIL(("Email Address 1 Transport - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2890 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2891 LIST_COPY(item->contact->address1_transport, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2892 DEBUG_EMAIL(("%s\n", item->contact->address1_transport)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2893 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2894 case 0x8083: // Email Address 1 Address |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2895 DEBUG_EMAIL(("Email Address 1 Address - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2896 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2897 LIST_COPY(item->contact->address1, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2898 DEBUG_EMAIL(("%s\n", item->contact->address1)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2899 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2900 case 0x8084: // Email Address 1 Description |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2901 DEBUG_EMAIL(("Email Address 1 Description - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2902 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2903 LIST_COPY(item->contact->address1_desc, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2904 DEBUG_EMAIL(("%s\n", item->contact->address1_desc)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2905 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2906 case 0x8085: // Email Address 1 Record |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2907 DEBUG_EMAIL(("Email Address 1 Record - NOT PROCESSED\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2908 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2909 case 0x8092: // Email Address 2 Transport |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2910 DEBUG_EMAIL(("Email Address 2 Transport - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2911 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2912 LIST_COPY(item->contact->address2_transport, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2913 DEBUG_EMAIL(("%s\n", item->contact->address2_transport)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2914 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2915 case 0x8093: // Email Address 2 Address |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2916 DEBUG_EMAIL(("Email Address 2 Address - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2917 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2918 LIST_COPY(item->contact->address2, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2919 DEBUG_EMAIL(("%s\n", item->contact->address2)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2920 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2921 case 0x8094: // Email Address 2 Description |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2922 DEBUG_EMAIL (("Email Address 2 Description - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2923 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2924 LIST_COPY(item->contact->address2_desc, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2925 DEBUG_EMAIL(("%s\n", item->contact->address2_desc)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2926 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2927 case 0x8095: // Email Address 2 Record |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2928 DEBUG_EMAIL(("Email Address 2 Record - NOT PROCESSED\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2929 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2930 case 0x80A2: // Email Address 3 Transport |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2931 DEBUG_EMAIL (("Email Address 3 Transport - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2932 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2933 LIST_COPY(item->contact->address3_transport, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2934 DEBUG_EMAIL(("%s\n", item->contact->address3_transport)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2935 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2936 case 0x80A3: // Email Address 3 Address |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2937 DEBUG_EMAIL(("Email Address 3 Address - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2938 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2939 LIST_COPY(item->contact->address3, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2940 DEBUG_EMAIL(("%s\n", item->contact->address3)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2941 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2942 case 0x80A4: // Email Address 3 Description |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2943 DEBUG_EMAIL(("Email Address 3 Description - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2944 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2945 LIST_COPY(item->contact->address3_desc, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2946 DEBUG_EMAIL(("%s\n", item->contact->address3_desc)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2947 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2948 case 0x80A5: // Email Address 3 Record |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2949 DEBUG_EMAIL(("Email Address 3 Record - NOT PROCESSED\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2950 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2951 case 0x80D8: // Internet Free/Busy |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2952 DEBUG_EMAIL(("Internet Free/Busy - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2953 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2954 LIST_COPY(item->contact->free_busy_address, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2955 DEBUG_EMAIL(("%s\n", item->contact->free_busy_address)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2956 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2957 case 0x8205: // Show on Free/Busy as |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2958 // 0: Free |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2959 // 1: Tentative |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2960 // 2: Busy |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2961 // 3: Out Of Office |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2962 DEBUG_EMAIL(("Appointment shows as - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2963 MALLOC_APPOINTMENT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2964 memcpy(&(item->appointment->showas), list->items[x]->data, sizeof(item->appointment->showas)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2965 LE32_CPU(item->appointment->showas); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2966 switch (item->appointment->showas) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2967 case PST_FREEBUSY_FREE: |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2968 DEBUG_EMAIL(("Free\n")); break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2969 case PST_FREEBUSY_TENTATIVE: |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2970 DEBUG_EMAIL(("Tentative\n")); break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2971 case PST_FREEBUSY_BUSY: |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2972 DEBUG_EMAIL(("Busy\n")); break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2973 case PST_FREEBUSY_OUT_OF_OFFICE: |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2974 DEBUG_EMAIL(("Out Of Office\n")); break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2975 default: |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2976 DEBUG_EMAIL(("Unknown Value: %d\n", item->appointment->showas)); break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2977 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2978 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2979 case 0x8208: // Location of an appointment |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2980 DEBUG_EMAIL(("Appointment Location - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2981 MALLOC_APPOINTMENT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2982 LIST_COPY(item->appointment->location, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2983 DEBUG_EMAIL(("%s\n", item->appointment->location)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2984 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2985 case 0x8214: // Label for an appointment |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2986 DEBUG_EMAIL(("Label for appointment - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2987 MALLOC_APPOINTMENT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2988 memcpy(&(item->appointment->label), list->items[x]->data, sizeof(item->appointment->label)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2989 LE32_CPU(item->appointment->label); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2990 switch (item->appointment->label) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2991 case PST_APP_LABEL_NONE: |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2992 DEBUG_EMAIL(("None\n")); break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2993 case PST_APP_LABEL_IMPORTANT: |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2994 DEBUG_EMAIL(("Important\n")); break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2995 case PST_APP_LABEL_BUSINESS: |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2996 DEBUG_EMAIL(("Business\n")); break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2997 case PST_APP_LABEL_PERSONAL: |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2998 DEBUG_EMAIL(("Personal\n")); break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
2999 case PST_APP_LABEL_VACATION: |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3000 DEBUG_EMAIL(("Vacation\n")); break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3001 case PST_APP_LABEL_MUST_ATTEND: |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3002 DEBUG_EMAIL(("Must Attend\n")); break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3003 case PST_APP_LABEL_TRAVEL_REQ: |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3004 DEBUG_EMAIL(("Travel Required\n")); break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3005 case PST_APP_LABEL_NEEDS_PREP: |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3006 DEBUG_EMAIL(("Needs Preparation\n")); break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3007 case PST_APP_LABEL_BIRTHDAY: |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3008 DEBUG_EMAIL(("Birthday\n")); break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3009 case PST_APP_LABEL_ANNIVERSARY: |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3010 DEBUG_EMAIL(("Anniversary\n")); break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3011 case PST_APP_LABEL_PHONE_CALL: |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3012 DEBUG_EMAIL(("Phone Call\n")); break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3013 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3014 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3015 case 0x8234: // TimeZone as String |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3016 DEBUG_EMAIL(("TimeZone of times - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3017 MALLOC_APPOINTMENT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3018 LIST_COPY(item->appointment->timezonestring, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3019 DEBUG_EMAIL(("%s\n", item->appointment->timezonestring)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3020 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3021 case 0x8235: // Appointment start time |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3022 DEBUG_EMAIL(("Appointment Start Time - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3023 MALLOC_APPOINTMENT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3024 LIST_COPY(item->appointment->start, (FILETIME*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3025 DEBUG_EMAIL(("%s\n", fileTimeToAscii((FILETIME*)item->appointment->start))); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3026 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3027 case 0x8236: // Appointment end time |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3028 DEBUG_EMAIL(("Appointment End Time - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3029 MALLOC_APPOINTMENT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3030 LIST_COPY(item->appointment->end, (FILETIME*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3031 DEBUG_EMAIL(("%s\n", fileTimeToAscii((FILETIME*)item->appointment->start))); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3032 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3033 case 0x8516: // Journal time start |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3034 DEBUG_EMAIL(("Duplicate Time Start - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3035 DEBUG_EMAIL(("%s\n", fileTimeToAscii((FILETIME*)list->items[x]->data))); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3036 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3037 case 0x8517: // Journal time end |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3038 DEBUG_EMAIL(("Duplicate Time End - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3039 DEBUG_EMAIL(("%s\n", fileTimeToAscii((FILETIME*)list->items[x]->data))); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3040 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3041 case 0x8530: // Followup |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3042 DEBUG_EMAIL(("Followup String - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3043 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3044 LIST_COPY(item->contact->followup, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3045 DEBUG_EMAIL(("%s\n", item->contact->followup)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3046 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3047 case 0x8534: // Mileage |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3048 DEBUG_EMAIL(("Mileage - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3049 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3050 LIST_COPY(item->contact->mileage, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3051 DEBUG_EMAIL(("%s\n", item->contact->mileage)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3052 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3053 case 0x8535: // Billing Information |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3054 DEBUG_EMAIL(("Billing Information - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3055 MALLOC_CONTACT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3056 LIST_COPY(item->contact->billing_information, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3057 DEBUG_EMAIL(("%s\n", item->contact->billing_information)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3058 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3059 case 0x8554: // Outlook Version |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3060 DEBUG_EMAIL(("Outlook Version - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3061 LIST_COPY(item->outlook_version, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3062 DEBUG_EMAIL(("%s\n", item->outlook_version)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3063 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3064 case 0x8560: // Appointment Reminder Time |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3065 DEBUG_EMAIL(("Appointment Reminder Time - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3066 MALLOC_APPOINTMENT(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3067 LIST_COPY(item->appointment->reminder, (FILETIME*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3068 DEBUG_EMAIL(("%s\n", fileTimeToAscii(item->appointment->reminder))); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3069 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3070 case 0x8700: // Journal Type |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3071 DEBUG_EMAIL(("Journal Entry Type - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3072 MALLOC_JOURNAL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3073 LIST_COPY(item->journal->type, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3074 DEBUG_EMAIL(("%s\n", item->journal->type)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3075 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3076 case 0x8706: // Journal Start date/time |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3077 DEBUG_EMAIL(("Start Timestamp - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3078 MALLOC_JOURNAL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3079 LIST_COPY(item->journal->start, (FILETIME*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3080 DEBUG_EMAIL(("%s\n", fileTimeToAscii(item->journal->start))); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3081 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3082 case 0x8708: // Journal End date/time |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3083 DEBUG_EMAIL(("End Timestamp - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3084 MALLOC_JOURNAL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3085 LIST_COPY(item->journal->end, (FILETIME*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3086 DEBUG_EMAIL(("%s\n", fileTimeToAscii(item->journal->end))); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3087 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3088 case 0x8712: // Title? |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3089 DEBUG_EMAIL(("Journal Entry Type - ")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3090 MALLOC_JOURNAL(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3091 LIST_COPY(item->journal->type, (char*)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3092 DEBUG_EMAIL(("%s\n", item->journal->type)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3093 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3094 default: |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3095 /* Reference Types |
0 | 3096 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3097 2 - 0x0002 - Signed 16bit value |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3098 3 - 0x0003 - Signed 32bit value |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3099 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
|
3100 13 - 0x000D - Embedded Object |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3101 30 - 0x001E - Null terminated String |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3102 31 - 0x001F - Unicode string |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3103 64 - 0x0040 - Systime - Filetime structure |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3104 72 - 0x0048 - OLE Guid |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3105 258 - 0x0102 - Binary data |
0 | 3106 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3107 - 0x1003 - Array of 32bit values |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3108 - 0x101E - Array of Strings |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3109 - 0x1102 - Array of Binary data |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3110 */ |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3111 // DEBUG_EMAIL(("Unknown id [%#x, size=%#x]\n", list->items[x]->id, list->items[x]->size)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3112 if (list->items[x]->type == 0x02) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3113 DEBUG_EMAIL(("Unknown 16bit int = %hi\n", *(int16_t*)list->items[x]->data)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3114 } else if (list->items[x]->type == 0x03) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3115 DEBUG_EMAIL(("Unknown 32bit int = %i\n", *(int32_t*)list->items[x]->data)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3116 } else if (list->items[x]->type == 0x0b) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3117 DEBUG_EMAIL(("Unknown 16bit boolean = %s [%hi]\n", |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3118 (*((int16_t*)list->items[x]->data)!=0?"True":"False"), |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3119 *((int16_t*)list->items[x]->data))); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3120 } else if (list->items[x]->type == 0x1e) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3121 DEBUG_EMAIL(("Unknown String Data = \"%s\" [%#x]\n", |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3122 list->items[x]->data, list->items[x]->type)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3123 } else if (list->items[x]->type == 0x40) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3124 DEBUG_EMAIL(("Unknown Date = \"%s\" [%#x]\n", |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3125 fileTimeToAscii((FILETIME*)list->items[x]->data), |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3126 list->items[x]->type)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3127 } else if (list->items[x]->type == 0x102) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3128 DEBUG_EMAIL(("Unknown Binary Data [size = %#x]\n", |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3129 list->items[x]->size)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3130 DEBUG_HEXDUMP(list->items[x]->data, list->items[x]->size); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3131 } else if (list->items[x]->type == 0x101E) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3132 DEBUG_EMAIL(("Unknown Array of Strings [%#x]\n", |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3133 list->items[x]->type)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3134 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3135 DEBUG_EMAIL(("Unknown Not Printable [%#x]\n", |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3136 list->items[x]->type)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3137 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3138 if (list->items[x]->data != NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3139 free(list->items[x]->data); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3140 list->items[x]->data = NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3141 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3142 //INC_CHECK_X(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3143 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3144 x++; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3145 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3146 x = 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3147 list = list->next; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3148 next = 1; |
0 | 3149 } |
3150 DEBUG_RET(); | |
3151 return 0; | |
3152 } | |
3153 | |
3154 int32_t _pst_free_list(pst_num_array *list) { | |
3155 int32_t x = 0; | |
3156 pst_num_array *l; | |
3157 DEBUG_ENT("_pst_free_list"); | |
3158 while (list != NULL) { | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3159 while (x < list->count_item) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3160 if (list->items[x]->data != NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3161 free (list->items[x]->data); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3162 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3163 if (list->items[x] != NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3164 free (list->items[x]); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3165 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3166 x++; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3167 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3168 if (list->items != NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3169 free(list->items); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3170 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3171 l = list; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3172 list = list->next; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3173 free (l); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3174 x = 0; |
0 | 3175 } |
3176 DEBUG_RET(); | |
3177 return 1; | |
3178 } | |
3179 | |
3180 int32_t _pst_free_id2(pst_index2_ll * head) { | |
3181 pst_index2_ll *t; | |
3182 DEBUG_ENT("_pst_free_id2"); | |
3183 while (head != NULL) { | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3184 t = head->next; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3185 free (head); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3186 head = t; |
0 | 3187 } |
3188 DEBUG_RET(); | |
3189 return 1; | |
3190 } | |
3191 | |
3192 int32_t _pst_free_id (pst_index_ll *head) { | |
3193 pst_index_ll *t; | |
3194 DEBUG_ENT("_pst_free_id"); | |
3195 while (head != NULL) { | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3196 t = head->next; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3197 free(head); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3198 head = t; |
0 | 3199 } |
3200 DEBUG_RET(); | |
3201 return 1; | |
3202 } | |
3203 | |
3204 int32_t _pst_free_desc (pst_desc_ll *head) { | |
3205 pst_desc_ll *t; | |
3206 DEBUG_ENT("_pst_free_desc"); | |
3207 while (head != NULL) { | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3208 while (head->child != NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3209 head = head->child; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3210 } |
8 | 3211 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3212 // point t to the next item |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3213 t = head->next; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3214 if (t == NULL && head->parent != NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3215 t = head->parent; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3216 t->child = NULL; // set the child to NULL so we don't come back here again! |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3217 } |
0 | 3218 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3219 if (head != NULL) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3220 free(head); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3221 else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3222 DIE(("head is NULL")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3223 } |
0 | 3224 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3225 head = t; |
0 | 3226 } |
3227 DEBUG_RET(); | |
3228 return 1; | |
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) { |
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 != NULL) { | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3255 head = head_ptr; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3256 while (head_ptr != NULL) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3257 head_ptr = (tail = head_ptr)->next; |
0 | 3258 } |
3259 if (_pst_read_block_size(pf, list->offset, list->size, &buf, PST_NO_ENC,0) < list->size) { | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3260 //an error occured in block read |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3261 WARN(("block read error occured. offset = %#x, size = %#x\n", list->offset, list->size)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3262 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3263 return NULL; |
0 | 3264 } |
3265 | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3266 memcpy(&block_head, buf, sizeof(block_head)); |
0 | 3267 LE16_CPU(block_head.type); |
3268 LE16_CPU(block_head.count); | |
3269 | |
3270 if (block_head.type != 0x0002) { // some sort of constant? | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3271 WARN(("Unknown constant [%#x] at start of id2 values [offset %#x].\n", block_head.type, list->offset)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3272 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3273 return NULL; |
0 | 3274 } |
3275 | |
3276 DEBUG_INDEX(("ID %#x is likely to be a description record. Count is %i (offset %#x)\n", | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3277 list->id, block_head.count, list->offset)); |
0 | 3278 x = 0; |
3279 b_ptr = 0x04; | |
3280 while (x < block_head.count) { | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3281 memcpy(&id2_rec, &(buf[b_ptr]), sizeof(id2_rec)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3282 LE32_CPU(id2_rec.id2); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3283 LE32_CPU(id2_rec.id); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3284 LE32_CPU(id2_rec.table2); |
0 | 3285 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3286 b_ptr += sizeof(id2_rec); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3287 DEBUG_INDEX(("\tid2 = %#x, id = %#x, table2 = %#x\n", id2_rec.id2, id2_rec.id, id2_rec.table2)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3288 if ((i_ptr = _pst_getID(pf, id2_rec.id)) == NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3289 DEBUG_WARN(("\t\t%#x - Not Found\n", id2_rec.id)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3290 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
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)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3292 // add it to the linked list |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3293 //check it doesn't exist already first |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3294 /* i2_ptr = head; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3295 while(i2_ptr != NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3296 if (i2_ptr->id2 == id2_rec.id2) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3297 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3298 i2_ptr = i2_ptr->next; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3299 }*/ |
0 | 3300 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3301 // if (i2_ptr == NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3302 i2_ptr = (pst_index2_ll*) xmalloc(sizeof(pst_index2_ll)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3303 i2_ptr->id2 = id2_rec.id2; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3304 i2_ptr->id = i_ptr; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3305 i2_ptr->next = NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3306 if (head == NULL) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3307 head = i2_ptr; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3308 if (tail != NULL) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3309 tail->next = i2_ptr; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3310 tail = i2_ptr; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3311 /* } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3312 // if it does already exist |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3313 DEBUG_INDEX(("_pst_build_id2(): \t\t%#x already exists. Updating ID to %#x\n", |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3314 id2_rec.id2, i_ptr->id)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3315 i2_ptr->id = i_ptr; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3316 }*/ |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3317 if (id2_rec.table2 != 0) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3318 if ((i_ptr = _pst_getID(pf, id2_rec.table2)) == NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3319 DEBUG_WARN(("\tTable2 [%#x] not found\n", id2_rec.table2)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3320 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3321 DEBUG_INDEX(("\tGoing deeper for table2 [%#x]\n", id2_rec.table2)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3322 if ((i2_ptr = _pst_build_id2(pf, i_ptr, head)) != NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3323 /*DEBUG_INDEX(("_pst_build_id2(): \t\tAdding new list onto end of current\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3324 if (head == NULL) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3325 head = i2_ptr; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3326 if (tail != NULL) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3327 tail->next = i2_ptr; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3328 while (i2_ptr->next != NULL) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3329 i2_ptr = i2_ptr->next; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3330 tail = i2_ptr;*/ |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3331 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3332 // need to re-establish tail |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3333 DEBUG_INDEX(("Returned from depth\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3334 if (tail != NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3335 while (tail->next != NULL) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3336 tail = tail->next; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3337 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3338 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3339 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3340 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3341 x++; |
0 | 3342 } |
3343 if (buf != NULL) { | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3344 free (buf); |
0 | 3345 } |
3346 DEBUG_RET(); | |
3347 return head; | |
3348 } | |
3349 | |
3350 // This version of free does NULL check first | |
3351 #define SAFE_FREE(x) {if (x != NULL) free(x);} | |
3352 | |
3353 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
|
3354 pst_item_attach *t; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3355 pst_item_extra_field *et; |
0 | 3356 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3357 DEBUG_ENT("_pst_freeItem"); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3358 if (item != NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3359 if (item->email) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3360 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
|
3361 SAFE_FREE(item->email->body); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3362 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
|
3363 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
|
3364 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
|
3365 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
|
3366 SAFE_FREE(item->email->header); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3367 SAFE_FREE(item->email->htmlbody); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3368 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
|
3369 SAFE_FREE(item->email->messageid); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3370 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
|
3371 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
|
3372 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
|
3373 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
|
3374 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
|
3375 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
|
3376 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
|
3377 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
|
3378 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
|
3379 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
|
3380 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
|
3381 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
|
3382 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
|
3383 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
|
3384 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
|
3385 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
|
3386 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
|
3387 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
|
3388 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
|
3389 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
|
3390 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
|
3391 if (item->email->subject != NULL) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3392 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
|
3393 SAFE_FREE(item->email->subject); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3394 free(item->email); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3395 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3396 if (item->folder) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3397 free(item->folder); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3398 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3399 if (item->message_store) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3400 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
|
3401 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
|
3402 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
|
3403 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
|
3404 free(item->message_store); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3405 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3406 if (item->contact) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3407 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
|
3408 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
|
3409 SAFE_FREE(item->contact->address1); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3410 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
|
3411 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
|
3412 SAFE_FREE(item->contact->address2); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3413 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
|
3414 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
|
3415 SAFE_FREE(item->contact->address3); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3416 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
|
3417 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
|
3418 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
|
3419 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
|
3420 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
|
3421 SAFE_FREE(item->contact->birthday); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3422 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
|
3423 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
|
3424 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
|
3425 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
|
3426 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
|
3427 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
|
3428 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
|
3429 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
|
3430 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
|
3431 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
|
3432 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
|
3433 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
|
3434 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
|
3435 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
|
3436 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
|
3437 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
|
3438 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
|
3439 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
|
3440 SAFE_FREE(item->contact->department); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3441 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
|
3442 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
|
3443 SAFE_FREE(item->contact->followup); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3444 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
|
3445 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
|
3446 SAFE_FREE(item->contact->fullname); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3447 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
|
3448 SAFE_FREE(item->contact->hobbies); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3449 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
|
3450 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
|
3451 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
|
3452 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
|
3453 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
|
3454 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
|
3455 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
|
3456 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
|
3457 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
|
3458 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
|
3459 SAFE_FREE(item->contact->initials); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3460 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
|
3461 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
|
3462 SAFE_FREE(item->contact->keyword); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3463 SAFE_FREE(item->contact->language); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3464 SAFE_FREE(item->contact->location); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3465 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
|
3466 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
|
3467 SAFE_FREE(item->contact->mileage); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3468 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
|
3469 SAFE_FREE(item->contact->nickname); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3470 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
|
3471 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
|
3472 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
|
3473 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
|
3474 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
|
3475 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
|
3476 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
|
3477 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
|
3478 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
|
3479 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
|
3480 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
|
3481 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
|
3482 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
|
3483 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
|
3484 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
|
3485 SAFE_FREE(item->contact->profession); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3486 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
|
3487 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
|
3488 SAFE_FREE(item->contact->suffix); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3489 SAFE_FREE(item->contact->surname); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3490 SAFE_FREE(item->contact->telex); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3491 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
|
3492 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
|
3493 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
|
3494 free(item->contact); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3495 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3496 while (item->attach != NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3497 SAFE_FREE(item->attach->filename1); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3498 SAFE_FREE(item->attach->filename2); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3499 SAFE_FREE(item->attach->mimetype); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3500 SAFE_FREE(item->attach->data); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3501 t = item->attach->next; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3502 free(item->attach); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3503 item->attach = t; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3504 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3505 while (item->extra_fields != NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3506 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
|
3507 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
|
3508 et = item->extra_fields->next; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3509 free(item->extra_fields); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3510 item->extra_fields = et; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3511 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3512 if (item->journal) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3513 SAFE_FREE(item->journal->end); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3514 SAFE_FREE(item->journal->start); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3515 SAFE_FREE(item->journal->type); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3516 free(item->journal); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3517 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3518 if (item->appointment) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3519 SAFE_FREE(item->appointment->location); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3520 SAFE_FREE(item->appointment->reminder); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3521 SAFE_FREE(item->appointment->start); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3522 SAFE_FREE(item->appointment->end); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3523 SAFE_FREE(item->appointment->timezonestring); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3524 free(item->appointment); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3525 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3526 SAFE_FREE(item->ascii_type); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3527 SAFE_FREE(item->comment); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3528 SAFE_FREE(item->create_date); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3529 SAFE_FREE(item->file_as); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3530 SAFE_FREE(item->modify_date); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3531 SAFE_FREE(item->outlook_version); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3532 SAFE_FREE(item->record_key); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3533 free(item); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3534 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3535 DEBUG_RET(); |
8 | 3536 } |
0 | 3537 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3538 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
|
3539 int32_t of1 = offset>>4; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3540 DEBUG_ENT("_pst_getBlockOffset"); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3541 if ((p == NULL) || (buf == NULL) || (offset == 0) || (i_offset+2+of1+sizeof(*p) > read_size)) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3542 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
|
3543 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3544 return -1; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3545 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3546 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
|
3547 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
|
3548 LE16_CPU(p->from); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3549 LE16_CPU(p->to); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3550 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3551 return 0; |
0 | 3552 } |
3553 | |
3554 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
|
3555 // static pst_index_ll *old_val = NULL; //this should make it quicker |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3556 pst_index_ll *ptr = NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3557 DEBUG_ENT("_pst_getID"); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3558 if (id == 0) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3559 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3560 return NULL; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3561 } |
0 | 3562 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3563 /* 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
|
3564 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
|
3565 }*/ |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3566 // 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
|
3567 // 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
|
3568 // 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
|
3569 id &= 0xFFFFFFFE; // remove least sig. bit. seems that it might work if I do this |
0 | 3570 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3571 DEBUG_INDEX(("Trying to find %#x\n", id)); |
8 | 3572 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3573 if (ptr == NULL) ptr = pf->i_head; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3574 while (ptr->id != id) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3575 ptr = ptr->next; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3576 if (ptr == NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3577 break; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3578 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3579 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3580 if (ptr == NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3581 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
|
3582 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3583 DEBUG_INDEX(("Found Value %#x\n", ptr->id)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3584 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3585 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3586 return ptr; |
0 | 3587 } |
3588 | |
3589 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
|
3590 DEBUG_ENT("_pst_getID2"); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3591 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
|
3592 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
|
3593 while (ptr != NULL && ptr->id2 != id) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3594 ptr = ptr->next; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3595 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3596 if (ptr != NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3597 if (ptr->id != NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3598 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
|
3599 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3600 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
|
3601 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3602 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3603 return ptr->id; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3604 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3605 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
|
3606 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3607 return NULL; |
0 | 3608 } |
3609 | |
3610 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
|
3611 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
|
3612 DEBUG_ENT("_pst_getDptr"); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3613 while(ptr != NULL && ptr->id != id) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3614 if (ptr->child != NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3615 ptr = ptr->child; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3616 continue; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3617 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3618 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
|
3619 ptr = ptr->parent; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3620 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3621 ptr = ptr->next; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3622 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3623 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3624 return ptr; // will be NULL or record we are looking for |
0 | 3625 } |
3626 | |
3627 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
|
3628 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
|
3629 int32_t depth = 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3630 char spaces[100]; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3631 DEBUG_ENT("_pst_printDptr"); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3632 memset(spaces, ' ', 99); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3633 spaces[99] = '\0'; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3634 while (ptr != NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3635 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
|
3636 (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
|
3637 (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
|
3638 if (ptr->child != NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3639 depth++; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3640 ptr = ptr->child; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3641 continue; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3642 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3643 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
|
3644 depth--; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3645 ptr = ptr->parent; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3646 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3647 ptr = ptr->next; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3648 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3649 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3650 return 0; |
0 | 3651 } |
3652 | |
3653 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
|
3654 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
|
3655 DEBUG_ENT("_pst_printIDptr"); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3656 while (ptr != NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3657 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
|
3658 ptr = ptr->next; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3659 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3660 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3661 return 0; |
0 | 3662 } |
3663 | |
3664 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
|
3665 DEBUG_ENT("_pst_printID2ptr"); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3666 while (ptr != NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3667 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
|
3668 ptr = ptr->next; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3669 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3670 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3671 return 0; |
0 | 3672 } |
3673 | |
3674 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
|
3675 size_t size; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3676 int32_t fpos; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3677 DEBUG_ENT("_pst_read_block"); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3678 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
|
3679 fpos = ftell(fp); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3680 fseek(fp, offset, SEEK_SET); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3681 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
|
3682 fseek(fp, offset, SEEK_SET); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3683 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
|
3684 if (*buf != NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3685 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
|
3686 free(*buf); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3687 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3688 *buf = (void*)xmalloc(size); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3689 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
|
3690 fseek(fp, fpos, SEEK_SET); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3691 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3692 return size; |
0 | 3693 } |
3694 | |
8 | 3695 // when the first byte of the block being read is 01, then we can assume |
0 | 3696 // that it is a list of further ids to read and we will follow those ids |
3697 // recursively calling this function until we have all the data | |
3698 // we could do decryption of the encrypted PST files here | |
8 | 3699 size_t _pst_read_block_size(pst_file *pf, int32_t offset, size_t size, char ** buf, int32_t do_enc, |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3700 unsigned char is_index) { |
0 | 3701 u_int32_t fpos, x; |
3702 int16_t count, y; | |
3703 char *buf2 = NULL, *buf3 = NULL; | |
3704 unsigned char fdepth; | |
3705 pst_index_ll *ptr = NULL; | |
3706 size_t rsize, z; | |
3707 DEBUG_ENT("_pst_read_block_size"); | |
3708 DEBUG_READ(("Reading block from %#x, %i bytes\n", offset, size)); | |
3709 fpos = ftell(pf->fp); | |
3710 fseek(pf->fp, offset, SEEK_SET); | |
3711 if (*buf != NULL) { | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3712 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
|
3713 free(*buf); |
0 | 3714 } |
3715 | |
3716 *buf = (void*) xmalloc(size+1); //plus one so that we can NULL terminate it later | |
3717 rsize = fread(*buf, 1, size, pf->fp); | |
3718 if (rsize != size) { | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3719 DEBUG_WARN(("Didn't read all that I could. fread returned less [%i instead of %i]\n", rsize, size)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3720 if (feof(pf->fp)) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3721 DEBUG_WARN(("We tried to read past the end of the file at [offset %#x, size %#x]\n", offset, size)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3722 } else if (ferror(pf->fp)) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3723 DEBUG_WARN(("Error is set on file stream.\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3724 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3725 DEBUG_WARN(("I can't tell why it failed\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3726 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3727 size = rsize; |
0 | 3728 } |
3729 | |
3730 // DEBUG_HEXDUMP(*buf, size); | |
3731 | |
3732 /* if (is_index) { | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3733 DEBUG_READ(("_pst_read_block_size: ODD_BLOCK should be here\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3734 DEBUG_READ(("\t: byte 0-1: %#x %#x\n", (*buf)[0], (*buf)[1])); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3735 }*/ |
0 | 3736 |
8 | 3737 if ((*buf)[0] == 0x01 && (*buf)[1] != 0x00 && is_index) { |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3738 //don't do this recursion if we should be at a leaf node |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3739 memcpy(&count, &((*buf)[2]), sizeof(int16_t)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3740 LE16_CPU(count); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3741 memcpy(&fdepth, &((*buf)[1]), sizeof(fdepth)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3742 DEBUG_READ(("Seen indexes to blocks. Depth is %i\n", fdepth)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3743 // do fancy stuff! :) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3744 DEBUG_READ(("There are %i ids\n", count)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3745 // if first 2 blocks are 01 01 then index to blocks |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3746 size = 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3747 y = 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3748 while (y < count) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3749 memcpy(&x, &(*buf)[0x08+(y*4)], sizeof(int32_t)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3750 LE32_CPU(x); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3751 if ((ptr = _pst_getID(pf, x)) == NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3752 WARN(("Error. Cannot find ID [%#x] during multi-block read\n", x)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3753 buf3 = (char*) realloc(buf3, size+1); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3754 buf3[size] = '\0'; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3755 *buf = buf3; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3756 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
|
3757 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3758 return size; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3759 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3760 if ((z = _pst_read_block_size(pf, ptr->offset, ptr->size, &buf2, do_enc, fdepth-1)) < ptr->size) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3761 buf3 = (char*) realloc(buf3, size+1); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3762 buf3[size] = '\0'; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3763 *buf = buf3; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3764 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
|
3765 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3766 return size; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3767 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3768 DEBUG_READ(("Melding newley retrieved block with bigger one. New size is %i\n", size+z)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3769 buf3 = (char*) realloc(buf3, size+z+1); //plus one so that we can null terminate it later |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3770 DEBUG_READ(("Doing copy. Start pos is %i, length is %i\n", size, z)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3771 memcpy(&(buf3[size]), buf2, z); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3772 size += z; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3773 y++; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3774 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3775 free(*buf); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3776 if (buf2 != NULL) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3777 free(buf2); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3778 if (buf3 == NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3779 // this can happen if count == 0. We should create an empty buffer so we don't |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3780 // confuse any clients |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3781 buf3 = (char*) xmalloc(1); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3782 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3783 *buf = buf3; |
0 | 3784 } else if (do_enc && pf->encryption) |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3785 _pst_decrypt(*buf, size, pf->encryption); |
0 | 3786 |
3787 (*buf)[size] = '\0'; //should be byte after last one read | |
3788 fseek(pf->fp, fpos, SEEK_SET); | |
3789 DEBUG_RET(); | |
3790 return size; | |
3791 } | |
3792 | |
3793 int32_t _pst_decrypt(unsigned char *buf, size_t size, int32_t type) { | |
3794 size_t x = 0; | |
3795 unsigned char y; | |
3796 DEBUG_ENT("_pst_decrypt"); | |
3797 if (buf == NULL) { | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3798 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3799 return -1; |
0 | 3800 } |
3801 | |
3802 if (type == PST_COMP_ENCRYPT) { | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3803 x = 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3804 while (x < size) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3805 y = buf[x]; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3806 DEBUG_DECRYPT(("Transposing %#hhx to %#hhx [%#x]\n", buf[x], comp_enc[y], y)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3807 buf[x] = comp_enc[y]; // transpose from encrypt array |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3808 x++; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3809 } |
0 | 3810 } else { |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3811 WARN(("Unknown encryption: %i. Cannot decrypt\n", type)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3812 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3813 return -1; |
0 | 3814 } |
3815 DEBUG_RET(); | |
3816 return 0; | |
3817 } | |
3818 | |
3819 int32_t _pst_getAtPos(FILE *fp, int32_t pos, void* buf, u_int32_t size) { | |
3820 DEBUG_ENT("_pst_getAtPos"); | |
3821 if (fseek(fp, pos, SEEK_SET) == -1) { | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3822 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3823 return 1; |
0 | 3824 } |
8 | 3825 |
0 | 3826 if (fread(buf, 1, size, fp) < size) { |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3827 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3828 return 2; |
0 | 3829 } |
3830 DEBUG_RET(); | |
3831 return 0; | |
3832 } | |
3833 | |
3834 int32_t _pst_get (FILE *fp, void *buf, u_int32_t size) { | |
3835 DEBUG_ENT("_pst_get"); | |
3836 if (fread(buf, 1, size, fp) < size) { | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3837 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3838 return 1; |
0 | 3839 } |
3840 DEBUG_RET(); | |
3841 return 0; | |
3842 } | |
3843 | |
3844 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
|
3845 size_t r; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3846 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
|
3847 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
|
3848 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
|
3849 DEBUG_HEXDUMPC(*b, r, 16); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3850 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3851 return r; |
0 | 3852 } |
3853 | |
3854 /** 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
|
3855 ie the one in the PST files */ |
0 | 3856 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
|
3857 pst_index_ll *rec; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3858 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
|
3859 DEBUG_ENT("_pst_ff_getIDblock"); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3860 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
|
3861 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
|
3862 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3863 return 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3864 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3865 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
|
3866 if (*b != NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3867 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
|
3868 free(*b); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3869 } |
0 | 3870 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3871 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
|
3872 *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
|
3873 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
|
3874 if (rsize != rec->size) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3875 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
|
3876 if (feof(pf->fp)) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3877 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
|
3878 } else if (ferror(pf->fp)) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3879 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
|
3880 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3881 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
|
3882 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3883 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3884 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3885 return rsize; |
0 | 3886 } |
3887 | |
3888 #define PST_PTR_BLOCK_SIZE 0x120 | |
3889 size_t _pst_ff_getID2block(pst_file *pf, u_int32_t id2, pst_index2_ll *id2_head, unsigned char** buf) { | |
3890 pst_index_ll* ptr; | |
3891 // size_t ret; | |
3892 struct holder h = {buf, NULL, 0}; | |
3893 DEBUG_ENT("_pst_ff_getID2block"); | |
3894 ptr = _pst_getID2(id2_head, id2); | |
3895 | |
3896 if (ptr == NULL) { | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3897 DEBUG_INDEX(("Cannot find id2 value %#x\n", id2)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3898 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3899 return 0; |
0 | 3900 } |
3901 DEBUG_RET(); | |
3902 return _pst_ff_getID2data(pf, ptr, &h); | |
3903 } | |
3904 | |
3905 size_t _pst_ff_getID2data(pst_file *pf, pst_index_ll *ptr, struct holder *h) { | |
3906 // if the attachment begins with 01 01, <= 256 bytes, it is stored in the record | |
3907 int32_t ret; | |
3908 unsigned char *b = NULL, *t; | |
3909 DEBUG_ENT("_pst_ff_getID2data"); | |
3910 if (!(ptr->id & 0x02)) { | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3911 ret = _pst_ff_getIDblock_dec(pf, ptr->id, &b); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3912 if (h->buf != NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3913 *(h->buf) = b; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3914 } else if (h->base64 == 1 && h->fp != NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3915 t = base64_encode(b, ret); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3916 pst_fwrite(t, 1, strlen(t), h->fp); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3917 free(b); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3918 } else if (h->fp != NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3919 pst_fwrite(b, 1, ret, h->fp); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3920 free(b); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3921 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3922 // if ((*buf)[0] == 0x1) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3923 // DEBUG_WARN(("WARNING: buffer starts with 0x1, but I didn't expect it to!\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3924 // } |
0 | 3925 } else { |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3926 // here we will assume it is a block that points to others |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3927 DEBUG_READ(("Assuming it is a multi-block record because of it's id\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3928 ret = _pst_ff_compile_ID(pf, ptr->id, h, 0); |
0 | 3929 } |
3930 if (h->buf != NULL && *h->buf != NULL) | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3931 (*(h->buf))[ret]='\0'; |
0 | 3932 DEBUG_RET(); |
3933 return ret; | |
3934 } | |
3935 | |
3936 size_t _pst_ff_compile_ID(pst_file *pf, u_int32_t id, struct holder *h, int32_t size) { | |
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) | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3945 return 0; |
0 | 3946 if ((buf3[0] != 0x1)) { // if bit 8 is set) { |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3947 // if ((buf3)[0] != 0x1 && (buf3)[1] > 4) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
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")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3949 DEBUG_WARN(("Treating as normal buffer\n")); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3950 if (pf->encryption) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3951 _pst_decrypt(buf3, a, pf->encryption); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3952 if (h->buf != NULL) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3953 *(h->buf) = buf3; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3954 else if (h->base64 == 1 && h->fp != NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3955 t = base64_encode(buf3, a); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3956 pst_fwrite(t, 1, strlen(t), h->fp); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3957 free(buf3); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3958 } else if (h->fp != NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3959 pst_fwrite(buf3, 1, a, h->fp); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3960 free(buf3); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3961 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3962 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3963 return a; |
0 | 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)); | |
3970 | |
3971 y = 0; | |
3972 while (y < count) { | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3973 memcpy(&x, &buf3[0x08+(y*4)], sizeof(int32_t)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3974 LE32_CPU(x); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3975 if (fdepth == 0x1) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3976 if ((z = _pst_ff_getIDblock(pf, x, &buf2)) == 0) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3977 DEBUG_WARN(("call to getIDblock returned zero %i\n", z)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3978 if (buf2 != NULL) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3979 free(buf2); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3980 free(buf3); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3981 return z; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3982 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3983 if (pf->encryption) |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3984 _pst_decrypt(buf2, z, pf->encryption); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3985 if (h->buf != NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3986 *(h->buf) = realloc(*(h->buf), size+z+1); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3987 DEBUG_READ(("appending read data of size %i onto main buffer from pos %i\n", z, size)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3988 memcpy(&((*(h->buf))[size]), buf2, z); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3989 } else if (h->base64 == 1 && h->fp != NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3990 // include any byte left over from the last one encoding |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3991 buf2 = (char*)realloc(buf2, z+h->base64_extra); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3992 memmove(buf2+h->base64_extra, buf2, z); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3993 memcpy(buf2, 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
|
3994 z+= h->base64_extra; |
0 | 3995 |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3996 b = z % 3; // find out how many bytes will be left over after the encoding. |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3997 // and save them |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3998 memcpy(h->base64_extra_chars, &(buf2[z-b]), b); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
3999 h->base64_extra = b; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
4000 t = base64_encode(buf2, z-b); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
4001 pst_fwrite(t, 1, strlen(t), h->fp); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
4002 DEBUG_READ(("writing %i bytes to file as base64 [%i]. Currently %i\n", |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
4003 z, strlen(t), size)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
4004 } else if (h->fp != NULL) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
4005 DEBUG_READ(("writing %i bytes to file. Currently %i\n", z, size)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
4006 pst_fwrite(buf2, 1, z, h->fp); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
4007 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
4008 size += z; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
4009 y++; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
4010 } else { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
4011 if ((z = _pst_ff_compile_ID(pf, x, h, size)) == 0) { |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
4012 DEBUG_WARN(("recursive called returned zero %i\n", z)); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
4013 free(buf3); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
4014 DEBUG_RET(); |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
4015 return z; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
4016 } |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
4017 size = z; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
4018 y++; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
4019 } |
0 | 4020 } |
4021 free(buf3); | |
4022 if (buf2 != NULL) | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
4023 free(buf2); |
8 | 4024 DEBUG_RET(); |
0 | 4025 return size; |
4026 } | |
4027 | |
4028 #ifdef _MSC_VER | |
4029 char * fileTimeToAscii(const FILETIME* filetime) { | |
4030 time_t t; | |
4031 DEBUG_ENT("fileTimeToAscii"); | |
4032 t = fileTimeToUnixTime(filetime, 0); | |
4033 if (t == -1) | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
4034 DEBUG_WARN(("ERROR time_t varible that was produced, is -1\n")); |
0 | 4035 DEBUG_RET(); |
4036 return ctime(&t); | |
4037 } | |
4038 | |
4039 time_t fileTimeToUnixTime(const FILETIME* filetime, DWORD *x) { | |
4040 SYSTEMTIME s; | |
4041 struct tm t; | |
4042 DEBUG_ENT("fileTimeToUnixTime"); | |
4043 memset (&t, 0, sizeof(struct tm)); | |
4044 FileTimeToSystemTime(filetime, &s); | |
4045 t.tm_year = s.wYear-1900; // this is what is required | |
4046 t.tm_mon = s.wMonth-1; // also required! It made me a bit confused | |
4047 t.tm_mday = s.wDay; | |
4048 t.tm_hour = s.wHour; | |
4049 t.tm_min = s.wMinute; | |
4050 t.tm_sec = s.wSecond; | |
4051 DEBUG_RET(); | |
4052 return mktime(&t); | |
4053 } | |
4054 | |
4055 struct tm * fileTimeToStructTM (const FILETIME *filetime) { | |
4056 time_t t1; | |
4057 t1 = fileTimeToUnixTime(filetime, 0); | |
4058 return gmtime(&t1); | |
4059 } | |
4060 | |
4061 #endif //_MSC_VER | |
4062 | |
4063 int32_t pst_stricmp(char *a, char *b) { | |
4064 // compare strings case-insensitive. | |
4065 // returns -1 if a < b, 0 if a==b, 1 if a > b | |
4066 while(*a != '\0' && *b != '\0' && toupper(*a)==toupper(*b)) { | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
4067 a++; b++; |
0 | 4068 } |
4069 if (toupper(*a) == toupper(*b)) | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
4070 return 0; |
0 | 4071 else if (toupper(*a) < toupper(*b)) |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
4072 return -1; |
0 | 4073 else |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
4074 return 1; |
0 | 4075 } |
4076 | |
4077 int32_t pst_strincmp(char *a, char *b, int32_t x) { | |
4078 // compare upto x chars in string a and b case-insensitively | |
8 | 4079 // returns -1 if a < b, 0 if a==b, 1 if a > b |
0 | 4080 int32_t y = 0; |
4081 while (*a != '\0' && *b != '\0' && y < x && toupper(*a)==toupper(*b)) { | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
4082 a++; b++; y++; |
0 | 4083 } |
4084 // if we have reached the end of either string, or a and b still match | |
4085 if (*a == '\0' || *b == '\0' || toupper(*a)==toupper(*b)) | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
4086 return 0; |
8 | 4087 else if (toupper(*a) < toupper(*b)) |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
4088 return -1; |
8 | 4089 else |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
4090 return 1; |
0 | 4091 } |
4092 | |
4093 size_t pst_fwrite(const void*ptr, size_t size, size_t nmemb, FILE*stream) { | |
4094 size_t r; | |
4095 DEBUG_ENT("pst_fwrite"); | |
4096 if (ptr != NULL) | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
4097 r = fwrite(ptr, size, nmemb, stream); |
0 | 4098 else { |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
4099 r = 0; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
4100 DEBUG_WARN(("An attempt to write a NULL Pointer was made\n")); |
0 | 4101 } |
4102 DEBUG_RET(); | |
4103 return r; | |
4104 } | |
8 | 4105 |
0 | 4106 char * _pst_wide_to_single(char *wt, int32_t size) { |
4107 // returns the first byte of each wide char. the size is the number of bytes in source | |
4108 char *x, *y; | |
4109 DEBUG_ENT("_pst_wide_to_single"); | |
4110 x = xmalloc((size/2)+1); | |
4111 y = x; | |
4112 while (size != 0 && *wt != '\0') { | |
10
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
4113 *y = *wt; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
4114 wt+=2; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
4115 size -= 2; |
a818f3c2e589
fix tree walk, we now use the item counts in the node blocks
carl
parents:
8
diff
changeset
|
4116 y++; |
0 | 4117 } |
4118 *y = '\0'; | |
4119 DEBUG_RET(); | |
4120 return x; | |
4121 } | |
4122 |