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
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
|
/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
* Copyright by the Board of Trustees of the University of Illinois. *
* All rights reserved. *
* *
* This file is part of HDF5. The full HDF5 copyright notice, including *
* terms governing use, modification, and redistribution, is contained in *
* the files COPYING and Copyright.html. COPYING can be found at the root *
* of the source code distribution tree; Copyright.html can be found at the *
* root level of an installed copy of the electronic HDF5 document set and *
* is linked from the top-level documents page. It can also be found at *
* http://hdf.ncsa.uiuc.edu/HDF5/doc/Copyright.html. If you do not have *
* access to either file, you may request a copy from hdfhelp@ncsa.uiuc.edu. *
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
/*
* Module Info: Operations on bit vectors. A bit vector is an array of bytes
* with the least-significant bits in the first byte. That is,
* the bytes are in little-endian order.
*/
#define H5T_PACKAGE /*suppress error about including H5Tpkg */
/* Pablo information */
/* (Put before include files to avoid problems with inline functions) */
#define PABLO_MASK H5Tbit_mask
#include "H5private.h" /*generic functions */
#include "H5Eprivate.h" /*error handling */
#include "H5Iprivate.h" /*ID functions */
#include "H5Tpkg.h" /*data-type functions */
/* Interface initialization */
static int interface_initialize_g = 0;
#define INTERFACE_INIT NULL
/*-------------------------------------------------------------------------
* Function: H5T_bit_copy
*
* Purpose: Copies bits from one vector to another.
*
* Return: void
*
* Programmer: Robb Matzke
* Wednesday, June 10, 1998
*
* Modifications:
*
*-------------------------------------------------------------------------
*/
void
H5T_bit_copy (uint8_t *dst, size_t dst_offset, const uint8_t *src,
size_t src_offset, size_t size)
{
int shift;
unsigned mask_lo, mask_hi;
int s_idx, d_idx;
/*
* Normalize the offset to be a byte number and a bit offset within that
* byte.
*/
s_idx = (int)src_offset / 8;
d_idx = (int)dst_offset / 8;
src_offset %= 8;
dst_offset %= 8;
/*
* Get things rolling. This means copying bits until we're aligned on a
* source byte. This the following example, five bits are copied to the
* destination.
*
* src[s_idx]
* +---------------+---------------+
* |7 6 5 4 3 2 1 0|7 6 5 4 3 2 1 0|
* +---------------+---------------+
* ... : : : : : | | | | |
* ... v v v v v V V V V V
* ...+---------------+---------------+
* ...|7 6 5 4 3 2 1 0|7 6 5 4 3 2 1 0|
...+---------------+---------------+
* dst[d_idx+1] dst[d_idx]
*/
while (src_offset && size>0) {
unsigned nbits = (unsigned)MIN3 (size, 8-dst_offset, 8-src_offset);
unsigned mask = (1<<nbits) - 1;
dst[d_idx] &= ~(mask<<dst_offset);
dst[d_idx] |= ((src[s_idx]>>src_offset)&mask) << dst_offset;
src_offset += nbits;
if (src_offset>=8) {
s_idx++;
src_offset %= 8;
}
dst_offset += nbits;
if (dst_offset>=8) {
d_idx++;
dst_offset %= 8;
}
size -= nbits;
}
/*
* The middle bits. We are aligned on a source byte which needs to be
* copied to two (or one in the degenerate case) destination bytes.
*
* src[s_idx]
* +---------------+
* |7 6 5 4 3 2 1 0|
* +---------------+
* | | | | | | | |
* V V V V V V V V
* +---------------+---------------+
* |7 6 5 4 3 2 1 0|7 6 5 4 3 2 1 0|
* +---------------+---------------+
* dst[d_idx+1] dst[d_idx]
*
*
* Calculate shifts and masks. See diagrams below. MASK_LO in this
* example is 0x1f (the low five bits) and MASK_HI is 0xe0 (the high three
* bits). SHIFT is three since the source must be shifted right three bits
* to line up with the destination.
*/
shift = (int)dst_offset;
mask_lo = (1<<(8-shift))-1;
mask_hi = (~mask_lo) & 0xff;
for (/*void*/; size>8; size-=8, d_idx++, s_idx++) {
if (shift) {
dst[d_idx+0] &= ~(mask_lo<<shift);
dst[d_idx+0] |= (src[s_idx] & mask_lo) << shift;
dst[d_idx+1] &= ~(mask_hi>>(8-shift));
dst[d_idx+1] |= (src[s_idx] & mask_hi) >> (8-shift);
} else {
dst[d_idx] = src[s_idx];
}
}
/* Finish up */
while (size>0) {
unsigned nbits = (unsigned)MIN3 (size, 8-dst_offset, 8-src_offset);
unsigned mask = (1<<nbits) - 1;
dst[d_idx] &= ~(mask<<dst_offset);
dst[d_idx] |= ((src[s_idx]>>src_offset)&mask) << dst_offset;
src_offset += nbits;
if (src_offset>=8) {
s_idx++;
src_offset %= 8;
}
dst_offset += nbits;
if (dst_offset>=8) {
d_idx++;
dst_offset %= 8;
}
size -= nbits;
}
}
/*-------------------------------------------------------------------------
* Function: H5T_bit_shift
*
* Purpose: Simulation of hardware shifting. Shifts a bit vector
* in a way similar to shifting a variable value, like
* value <<= 3, or value >>= 16.
*
* Return: void
*
* Programmer: Raymond Lu
* Wednesday, Febuary 4, 2004
*
* Modifications:
*
*-------------------------------------------------------------------------
*/
void
H5T_bit_shift (uint8_t *buf, hssize_t shift_dist, size_t buf_size)
{
uint8_t *tmp_buf;
size_t buf_size_bit = 8*buf_size;
size_t i;
FUNC_ENTER_NOAPI_NOINIT(H5T_bit_shift);
if(!shift_dist)
goto done;
if(abs(shift_dist) >= buf_size_bit) {
H5T_bit_set (buf, 0, buf_size_bit, FALSE);
goto done;
}
tmp_buf = (uint8_t*)HDcalloc(buf_size, 1);
/* Shift vector by making copies */
if(shift_dist > 0) /* left shift */
H5T_bit_copy (tmp_buf, shift_dist, buf, 0, buf_size_bit-shift_dist);
else { /* right shift */
shift_dist = -shift_dist;
H5T_bit_copy(tmp_buf, 0, buf, shift_dist, buf_size_bit-shift_dist);
}
/* Copy back the vector */
for(i=0; i<buf_size; i++)
buf[i] = tmp_buf[i];
HDfree(tmp_buf);
done:
FUNC_LEAVE_NOAPI_VOID
}
/*-------------------------------------------------------------------------
* Function: H5T_bit_get_d
*
* Purpose: Return a small bit sequence as a number.
*
* Return: Success: The bit sequence interpretted as an unsigned
* integer.
*
* Failure: 0
*
* Programmer: Robb Matzke
* Tuesday, June 23, 1998
*
* Modifications:
*
*-------------------------------------------------------------------------
*/
hsize_t
H5T_bit_get_d (uint8_t *buf, size_t offset, size_t size)
{
hsize_t val=0;
size_t i, hs;
hsize_t ret_value; /* Return value */
FUNC_ENTER_NOAPI(H5T_bit_get_d, 0);
assert (8*sizeof(val)>=size);
H5T_bit_copy ((uint8_t*)&val, 0, buf, offset, size);
switch (H5T_native_order_g) {
case H5T_ORDER_LE:
break;
case H5T_ORDER_BE:
for (i=0, hs=sizeof(val)/2; i<hs; i++) {
uint8_t tmp = ((uint8_t*)&val)[i];
((uint8_t*)&val)[i] = ((uint8_t*)&val)[sizeof(val)-(i+1)];
((uint8_t*)&val)[sizeof(val)-(i+1)] = tmp;
}
break;
default:
HDabort ();
}
/* Set return value */
ret_value=val;
done:
FUNC_LEAVE_NOAPI(ret_value);
}
/*-------------------------------------------------------------------------
* Function: H5T_bit_set_d
*
* Purpose: Sets part of a bit vector to the specified unsigned value.
*
* Return: void
*
* Programmer: Robb Matzke
* Wednesday, June 24, 1998
*
* Modifications:
*
*-------------------------------------------------------------------------
*/
void
H5T_bit_set_d (uint8_t *buf, size_t offset, size_t size, hsize_t val)
{
size_t i, hs;
assert (8*sizeof(val)>=size);
switch (H5T_native_order_g) {
case H5T_ORDER_LE:
break;
case H5T_ORDER_BE:
for (i=0, hs=sizeof(val)/2; i<hs; i++) {
uint8_t tmp = ((uint8_t*)&val)[i];
((uint8_t*)&val)[i] = ((uint8_t*)&val)[sizeof(val)-(i+1)];
((uint8_t*)&val)[sizeof(val)-(i+1)] = tmp;
}
break;
default:
HDabort ();
}
H5T_bit_copy (buf, offset, (uint8_t*)&val, 0, size);
}
/*-------------------------------------------------------------------------
* Function: H5T_bit_set
*
* Purpose: Sets or clears bits in a contiguous region of a vector
* beginning at bit OFFSET and continuing for SIZE bits.
*
* Return: void
*
* Programmer: Robb Matzke
* Wednesday, June 10, 1998
*
* Modifications:
*
*-------------------------------------------------------------------------
*/
void
H5T_bit_set (uint8_t *buf, size_t offset, size_t size, hbool_t value)
{
int idx;
/* Normalize */
idx = (int)offset / 8;
offset %= 8;
/* The first partial byte */
if (size && offset%8) {
size_t nbits = MIN (size, 8-offset);
unsigned mask = (1<<nbits)-1;
if (value) {
buf[idx++] |= mask << offset;
} else {
buf[idx++] &= ~(mask << offset);
}
size -= nbits;
}
/* The middle bytes */
while (size>=8) {
buf[idx++] = value ? 0xff : 0x00;
size -= 8;
}
/* The last partial byte */
if (size) {
if (value) {
buf[idx] |= (1<<size)-1;
} else {
buf[idx] &= ~((1<<size)-1);
}
}
}
/*-------------------------------------------------------------------------
* Function: H5T_bit_find
*
* Purpose: Finds the first bit with the specified VALUE within a region
* of a bit vector. The region begins at OFFSET and continues
* for SIZE bits, but the region can be searched from the least
* significat end toward the most significant end with
*
* Return: Success: The position of the bit found, relative to
* the offset.
*
* Failure: -1
*
* Programmer: Robb Matzke
* Wednesday, June 10, 1998
*
* Modifications:
*
*-------------------------------------------------------------------------
*/
ssize_t
H5T_bit_find (uint8_t *buf, size_t offset, size_t size, H5T_sdir_t direction,
hbool_t value)
{
ssize_t base=(ssize_t)offset;
ssize_t idx, i;
size_t iu;
ssize_t ret_value=(-1); /* Return value */
/* Use FUNC_ENTER_NOAPI_NOINIT_NOFUNC here to avoid performance issues */
FUNC_ENTER_NOAPI_NOINIT_NOFUNC(H5T_bit_find);
/* Some functions call this with value=TRUE */
assert (TRUE==1);
switch (direction) {
case H5T_BIT_LSB:
/* Calculate index */
idx = (ssize_t)(offset / 8);
offset %= 8;
/* Beginning */
if (offset) {
for (iu=offset; iu<8 && size>0; iu++, size--) {
if (value==(hbool_t)((buf[idx]>>iu) & 0x01))
HGOTO_DONE(8*idx+(ssize_t)iu - base);
}
offset = 0;
idx++;
}
/* Middle */
while (size>=8) {
if ((value?0x00:0xff)!=buf[idx]) {
for (i=0; i<8; i++) {
if (value==(hbool_t)((buf[idx]>>i) & 0x01))
HGOTO_DONE(8*idx+i - base);
}
}
size -= 8;
idx++;
}
/* End */
for (i=0; i<(ssize_t)size; i++) {
if (value==(hbool_t)((buf[idx]>>i) & 0x01))
HGOTO_DONE(8*idx+i - base);
}
break;
case H5T_BIT_MSB:
/* Calculate index */
idx = (ssize_t)((offset+size-1) / 8);
offset %= 8;
/* Beginning */
if (size>8-offset && (offset+size)%8) {
for (iu=(offset+size)%8; iu>0; --iu, --size) {
if (value==(hbool_t)((buf[idx]>>(iu-1)) & 0x01))
HGOTO_DONE(8*idx+(ssize_t)(iu-1) - base);
}
--idx;
}
/* Middle */
while (size>=8) {
if ((value?0x00:0xff)!=buf[idx]) {
for (i=7; i>=0; --i) {
if (value==(hbool_t)((buf[idx]>>i) & 0x01))
HGOTO_DONE(8*idx+i - base);
}
}
size -= 8;
--idx;
}
/* End */
if (size>0) {
for (iu=offset+size; iu>offset; --iu) {
if (value==(hbool_t)((buf[idx]>>(iu-1)) & 0x01))
HGOTO_DONE(8*idx+(ssize_t)(iu-1) - base);
}
}
break;
}
done:
FUNC_LEAVE_NOAPI(ret_value);
}
/*-------------------------------------------------------------------------
* Function: H5T_bit_inc
*
* Purpose: Increment part of a bit field by adding 1.
*
* Return: Success: The carry-out value, one if overflow zero
* otherwise.
*
* Failure: Negative
*
* Programmer: Robb Matzke
* Friday, June 26, 1998
*
* Modifications:
*
*-------------------------------------------------------------------------
*/
htri_t
H5T_bit_inc(uint8_t *buf, size_t start, size_t size)
{
size_t idx = start / 8;
unsigned carry = 1;
unsigned acc, mask;
/* Use FUNC_ENTER_NOAPI_NOINIT_NOFUNC here to avoid performance issues */
FUNC_ENTER_NOAPI_NOINIT_NOFUNC(H5T_bit_inc);
assert(buf);
start %= 8;
/* The first partial byte */
if (start) {
if (size+start<8) mask = (1<<size)-1;
else mask = (1<<(8-start))-1;
acc = (buf[idx]>>start) & mask;
acc += 1;
carry = acc & (1<<MIN(size, 8-start));
buf[idx] &= ~(mask<<start);
buf[idx] |= (acc & mask) << start;
size -= MIN(size, 8-start);
start=0;
idx++;
}
/* The middle */
while (carry && size>=8) {
acc = buf[idx];
acc += 1;
carry = acc & 0x100;
buf[idx] = acc & 0xff;
idx++;
size -= 8;
}
/* The last bits */
if (carry && size>0) {
mask = (1<<size)-1;
acc = buf[idx] & mask;
acc += 1;
carry = acc & (1<<size);
buf[idx] &= ~mask;
buf[idx] |= acc & mask;
}
FUNC_LEAVE_NOAPI(carry ? TRUE : FALSE);
}
/*-------------------------------------------------------------------------
* Function: H5T_bit_dec
*
* Purpose: decrement part of a bit field by 1.
* At this moment, START is always 0 and the algorithm only
* works from the end to the front for the buffer.
*
* Return: void
*
*
* Programmer: Raymond Lu
* Wednesday, Jan 28, 2004
*
* Modifications:
*
*-------------------------------------------------------------------------
*/
void
H5T_bit_dec(uint8_t *buf, size_t start, size_t size)
{
size_t idx;
assert(buf);
for(idx=0; idx < size/8; idx++) {
if(buf[idx] != 0x00) {
buf[idx] -= 1;
break;
} else if(buf[idx]==0x00) {
buf[idx] -= 1;
}
}
}
/*-------------------------------------------------------------------------
* Function: H5T_bit_neg
*
* Purpose: Bit-negate buffer.
* At this moment, START is always 0.
*
* Return: void
*
* Programmer: Raymond Lu
* Wednesday, Jan 28, 2004
*
* Modifications:
*
*-------------------------------------------------------------------------
*/
void
H5T_bit_neg(uint8_t *buf, size_t start, size_t size)
{
size_t i;
assert(buf);
for(i=0; i<size/8; i++)
buf[i] = ~(buf[i]);
}
|