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
|
// Copyright 2016 Yahoo Inc. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
// Copyright (C) 1998-2003 Fast Search & Transfer ASA
// Copyright (C) 2003 Overture Services Norway AS
#include <vespa/fastos/fastos.h>
#include "allocatedbitvector.h"
namespace search {
using vespalib::nbostream;
using vespalib::GenerationHeldBase;
using vespalib::GenerationHeldAlloc;
using vespalib::GenerationHolder;
using vespalib::DefaultAlloc;
void AllocatedBitVector::alloc()
{
uint32_t words = capacityWords();
words += (-words & 15); // Pad to 64 byte alignment
const size_t sz(words * sizeof(Word));
DefaultAlloc::create(sz).swap(_alloc);
assert(_alloc.size()/sizeof(Word) >= words);
// Clear padding
memset(static_cast<char *>(_alloc.get()) + sizeBytes(), 0, sz - sizeBytes());
}
//////////////////////////////////////////////////////////////////////
// Parameterized Constructor
//////////////////////////////////////////////////////////////////////
AllocatedBitVector::AllocatedBitVector(Index numberOfElements) :
BitVector(),
_capacityBits(numberOfElements),
_alloc()
{
alloc();
init(_alloc.get(), 0, numberOfElements);
clear();
}
AllocatedBitVector::AllocatedBitVector(Index numberOfElements, Alloc buffer, size_t offset) :
BitVector(static_cast<char *>(buffer.get()) + offset, numberOfElements),
_capacityBits(numberOfElements),
_alloc(std::move(buffer))
{
}
AllocatedBitVector::AllocatedBitVector(Index numberOfElements, Index capacityBits, const void * rhsBuf, size_t rhsSize) :
BitVector(),
_capacityBits(capacityBits),
_alloc()
{
alloc();
init(_alloc.get(), 0, numberOfElements);
clear();
if (rhsSize > 0) {
size_t minCount = std::min(static_cast<size_t>(numberOfElements), rhsSize);
memcpy(getStart(), rhsBuf, numBytes(minCount));
if (minCount/8 == numberOfElements/8) {
static_cast<Word *>(getStart())[numWords()-1] &= ~endBits(minCount);
}
setBit(size()); // Guard bit
}
}
AllocatedBitVector::AllocatedBitVector(const AllocatedBitVector & rhs) :
AllocatedBitVector(rhs, rhs.capacity())
{
}
AllocatedBitVector::AllocatedBitVector(const BitVector & rhs) :
AllocatedBitVector(rhs, rhs.size())
{
}
AllocatedBitVector::AllocatedBitVector(const BitVector & rhs, Index capacity_) :
BitVector(),
_capacityBits(capacity_),
_alloc()
{
alloc();
memcpy(_alloc.get(), rhs.getStart(), rhs.sizeBytes());
init(_alloc.get(), 0, rhs.size());
}
//////////////////////////////////////////////////////////////////////
// Destructor
//////////////////////////////////////////////////////////////////////
AllocatedBitVector::~AllocatedBitVector(void)
{
}
void
AllocatedBitVector::cleanup(void)
{
init(nullptr, 0, 0);
Alloc().swap(_alloc);
_capacityBits = 0;
}
void
AllocatedBitVector::resize(Index newLength)
{
_capacityBits = newLength;
alloc();
init(_alloc.get(), 0, newLength);
clear();
}
AllocatedBitVector &
AllocatedBitVector::operator=(const AllocatedBitVector & rhs)
{
AllocatedBitVector tmp(rhs);
swap(tmp);
assert(testBit(size()));
return *this;
}
AllocatedBitVector &
AllocatedBitVector::operator=(const BitVector & rhs)
{
AllocatedBitVector tmp(rhs);
swap(tmp);
assert(testBit(size()));
return *this;
}
GenerationHeldBase::UP
AllocatedBitVector::grow(Index newSize, Index newCapacity)
{
assert(newCapacity >= newSize);
GenerationHeldBase::UP ret;
if (newCapacity != capacity()) {
AllocatedBitVector tbv(newSize, newCapacity, _alloc.get(), size());
if (newSize > size()) {
tbv.clearBit(size()); // Clear old guard bit.
}
ret.reset(new GenerationHeldAlloc<Alloc>(_alloc));
if (( newSize >= size()) && isValidCount()) {
tbv.setTrueBits(countTrueBits());
}
swap(tbv);
} else {
if (newSize > size()) {
Index oldSz(size());
setSize(newSize);
clearIntervalNoInvalidation(oldSz, newSize);
} else {
clearInterval(newSize, size());
setSize(newSize);
}
}
return ret;
}
} // namespace search
|
