1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
|
/* ====================================================================
* The Apache Software License, Version 1.1
*
* Copyright (c) 2000 The Apache Software Foundation. All rights
* reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
*
* 3. The end-user documentation included with the redistribution,
* if any, must include the following acknowledgment:
* "This product includes software developed by the
* Apache Software Foundation (http://www.apache.org/)."
* Alternately, this acknowledgment may appear in the software itself,
* if and wherever such third-party acknowledgments normally appear.
*
* 4. The names "Apache" and "Apache Software Foundation" must
* not be used to endorse or promote products derived from this
* software without prior written permission. For written
* permission, please contact apache@apache.org.
*
* 5. Products derived from this software may not be called "Apache",
* nor may "Apache" appear in their name, without prior written
* permission of the Apache Software Foundation.
*
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR
* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
* USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
* ====================================================================
*
* This software consists of voluntary contributions made by many
* individuals on behalf of the Apache Software Foundation. For more
* information on the Apache Software Foundation, please see
* <http://www.apache.org/>.
*
* Portions of this software are based upon public domain software
* originally written at the National Center for Supercomputing Applications,
* University of Illinois, Urbana-Champaign.
*
* Portions of this software are based upon public domain software
* originally written at the National Center for Supercomputing Applications,
* University of Illinois, Urbana-Champaign.
*/
package org.apache.poi.hpsf;
import java.util.*;
import org.apache.poi.hpsf.littleendian.*;
/**
* <p>A property in a {@link Section} of a {@link PropertySet}.</p>
*
* <p>The property's <strong>ID</strong> gives the property a meaning
* in the context of its {@link Section}. Each {@link Section} spans
* its own name space of property IDs.</p>
*
* <p>The property's <strong>type</strong> determines how its
* <strong>value</strong> is interpreted. For example, if the type is
* {@link Variant#VT_LPSTR} (byte string), the value consists of a
* {@link DWord} telling how many bytes the string contains. The bytes
* follow immediately, including any null bytes that terminate the
* string. The type {@link Variant#VT_I4} denotes a four-byte integer
* value, {@link Variant#VT_FILETIME} some date and time (of a
* file).</p>
*
* <p><strong>FIXME:</strong> Reading of other types than those
* mentioned above and the dictionary property is not yet
* implemented.</p>
*
* @see Section
* @see Variant
*
* @author Rainer Klute (klute@rainer-klute.de)
* @author Drew Varner (Drew.Varner InAndAround sc.edu)
* @version $Id$
* @since 2002-02-09
*/
public class Property
{
private int id;
/**
* <p>Returns the property's ID.</p>
*/
public int getID()
{
return id;
}
private int type;
/**
* <p>Returns the property's type.</p>
*/
public int getType()
{
return type;
}
private Object value;
/**
* <p>Returns the property value's.</p>
*/
public Object getValue()
{
return value;
}
/**
* <p>Creates a {@link Property} instance by reading its bytes
* from the property set stream.</p>
*
* @param id The property's ID.
*
* @param src The bytes the property set stream consists of.
*
* @param offset The property's type/value pair's offset in the
* section.
*
* @param length The property's type/value pair's length in bytes.
* list.
*/
public Property(final int id, final byte[] src, final int offset,
final int length)
{
this.id = id;
/* ID 0 is a special case since it specifies a dictionary of
* property IDs and property names. */
if (id == 0)
{
value = readDictionary(src, offset, length);
return;
}
/* FIXME: Support this! */
// /* ID 1 is another special case: It denotes the code page of
// * byte strings in this section. */
// if (id == 1)
// {
// value = readCodepage(src, offset);
// return;
// }
int o = offset;
type = new DWord(src, o).intValue();
o += DWord.LENGTH;
/* FIXME: Support reading more types! */
switch (type)
{
case Variant.VT_I4:
{
/* Read a word. In Java it is represented as an
Integer object. */
value = new Integer(new DWord(src, o).intValue());
break;
}
case Variant.VT_FILETIME:
{
/* Read a FILETIME object. In Java it is represented
as a Date. */
final int low = new DWord(src, o).intValue();
o += DWord.LENGTH;
final int high = new DWord(src, o).intValue();
value = Util.filetimeToDate(high, low);
break;
}
case Variant.VT_LPSTR:
{
/* Read a byte string. In Java it is represented as a
String. The null bytes at the end of the byte
strings must be stripped. */
final int first = o + DWord.LENGTH;
int last = first + new DWord(src, o).intValue() - 1;
o += DWord.LENGTH;
while (src[last] == 0 && first <= last)
last--;
value = new String(src, first, last - first + 1);
break;
}
case Variant.VT_CF:
{
// the first four bytes in src, from
// src[offset] to src[offset + 3] contain
// the DWord for VT_CF, so skip it, we don't
// need it
// truncate the length of the return array by
// a DWord length (4 bytes)
length = length - DWord.LENGTH;
final byte[] v = new byte[length];
for (int i = 0; i < length; i++)
v[i] = src[offset + i + DWord.LENGTH];
value = v;
break;
}
default:
{
final byte[] v = new byte[length];
for (int i = 0; i < length; i++)
v[i] = src[offset + i];
value = v;
break;
}
}
}
/**
* <p>Reads a dictionary.</p>
*
* @param src The byte array containing the bytes making out the
* dictionary.
*
* @param offset At this offset within <var>src</var> the
* dictionary starts.
*
* @param length The dictionary contains at most this many bytes.
*/
protected Map readDictionary(final byte[] src, final int offset,
final int length)
{
/* FIXME: Check the length! */
int o = offset;
/* Read the number of dictionary entries. */
final int nrEntries = new DWord(src, o).intValue();
o += DWord.LENGTH;
final Map m = new HashMap(nrEntries, (float) 1.0);
for (int i = 0; i < nrEntries; i++)
{
/* The key */
final Integer id = new Integer(new DWord(src, o).intValue());
o += DWord.LENGTH;
/* The value (a string) */
final int sLength = new DWord(src, o).intValue();
o += DWord.LENGTH;
/* Strip trailing 0x00 bytes. */
int l = sLength;
while (src[o + l - 1] == 0x00)
l--;
final String s = new String(src, o, l);
o += sLength;
m.put(id, s);
}
return m;
}
/**
* <p>Reads a code page.</p>
*
* @param src The byte array containing the bytes making out the
* code page.
*
* @param offset At this offset within <var>src</var> the code
* page starts.
*/
protected int readCodePage(final byte[] src, final int offset)
{
throw new UnsupportedOperationException("FIXME");
}
}
|