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
|
//# ISMIndColumn.cc: Column of Incremental storage manager for indirect arrays
//# Copyright (C) 1996,1997,1998,1999,2001,2002
//# Associated Universities, Inc. Washington DC, USA.
//#
//# This library is free software; you can redistribute it and/or modify it
//# under the terms of the GNU Library General Public License as published by
//# the Free Software Foundation; either version 2 of the License, or (at your
//# option) any later version.
//#
//# This library is distributed in the hope that it will be useful, but WITHOUT
//# ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
//# FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public
//# License for more details.
//#
//# You should have received a copy of the GNU Library General Public License
//# along with this library; if not, write to the Free Software Foundation,
//# Inc., 675 Massachusetts Ave, Cambridge, MA 02139, USA.
//#
//# Correspondence concerning AIPS++ should be addressed as follows:
//# Internet email: casa-feedback@nrao.edu.
//# Postal address: AIPS++ Project Office
//# National Radio Astronomy Observatory
//# 520 Edgemont Road
//# Charlottesville, VA 22903-2475 USA
//# Includes
#include <casacore/tables/DataMan/ISMIndColumn.h>
#include <casacore/tables/DataMan/ISMBucket.h>
#include <casacore/casa/Utilities/DataType.h>
#include <casacore/casa/Arrays/Array.h>
#include <casacore/casa/Arrays/Slicer.h>
#include <casacore/casa/BasicSL/Complex.h>
#include <casacore/casa/BasicSL/String.h>
#include <casacore/casa/Utilities/Assert.h>
#include <casacore/casa/OS/CanonicalConversion.h>
#include <casacore/casa/OS/LECanonicalConversion.h>
#include <casacore/tables/DataMan/DataManError.h>
#include <casacore/casa/stdio.h> // for snprintf
namespace casacore { //# NAMESPACE CASACORE - BEGIN
ISMIndColumn::ISMIndColumn (ISMBase* smptr, int dataType, uInt colnr)
: ISMColumn (smptr, dataType, colnr),
seqnr_p (smptr->uniqueNr()),
shapeIsFixed_p(False),
iosfile_p (0),
indArray_p (0)
{}
ISMIndColumn::~ISMIndColumn()
{
clear();
}
void ISMIndColumn::clear()
{
delete (Int64*)lastValue_p;
lastValue_p = 0;
if (stmanPtr_p->version() < 3) {
delete iosfile_p;
}
iosfile_p = 0;
}
//# Create the array file (for a new column).
//# Compose the file name from the mother file name extended with
//# the unique column sequence nr.
void ISMIndColumn::doCreate (ISMBucket* bucket)
{
// Initialize and create new file.
init (ByteIO::New);
// Insert a dummy zero offset as the first value.
lastRowPut_p = 0;
*(Int64*)lastValue_p = 0;
char* buffer = stmanPtr_p->tempBuffer();
uInt leng = writeFunc_p (buffer, lastValue_p, 1);
bucket->addData (colnr_p, 0, 0, buffer, leng);
}
void ISMIndColumn::getFile (rownr_t nrrow)
{
// Initialize and open existing file.
init (stmanPtr_p->fileOption());
lastRowPut_p = nrrow;
}
Bool ISMIndColumn::flush (rownr_t, Bool fsync)
{
return iosfile_p->flush (fsync);
}
void ISMIndColumn::resync (rownr_t nrrow)
{
ISMColumn::resync (nrrow);
if (stmanPtr_p->version() < 3) {
iosfile_p->resync();
}
}
void ISMIndColumn::reopenRW()
{
iosfile_p->reopenRW();
}
void ISMIndColumn::addRow (rownr_t, rownr_t oldNrrow)
{
// If the shape is fixed and if the first row is added, define
// an array to have an array for all rows.
// Later rows get the value of a previous row, so we don't have to
// do anything for them.
if (oldNrrow == 0 && shapeIsFixed_p) {
putShape (0, fixedShape_p);
}
}
void ISMIndColumn::setShapeColumn (const IPosition& shape)
{
fixedShape_p = shape;
shapeIsFixed_p = True;
}
void ISMIndColumn::setShape (rownr_t rownr, const IPosition& shape)
{
StIndArray* ptr = getArrayPtr (rownr);
if (ptr != 0) {
ptr->getShape (*iosfile_p);
}
if (ptr == 0 || !shape.isEqual (ptr->shape())) {
putShape (rownr, shape);
}
}
//# Get the shape for the array (if any) in the given row.
//# Read shape if not read yet.
StIndArray* ISMIndColumn::getArrayPtr (rownr_t rownr)
{
if (isLastValueInvalid (rownr)) {
getValue (rownr, lastValue_p, False);
Int64 offset = *(Int64*)lastValue_p;
if (offset != 0) {
indArray_p = StIndArray (offset);
foundArray_p = True;
}else{
foundArray_p = False;
}
}
if (foundArray_p) {
return &indArray_p;
}
return 0;
}
//# Get the shape for the array (if any) in the given row.
//# Read shape if not read yet.
StIndArray* ISMIndColumn::getShape (rownr_t rownr)
{
StIndArray* ptr = getArrayPtr (rownr);
if (ptr == 0) {
throw DataManInvOper ("ISM: no array in row " +
String::toString(rownr) +
" in column " + columnName() +
" of " + stmanPtr_p->fileName());
}
ptr->getShape (*iosfile_p);
return ptr;
}
//# Set the shape for the array in the given row for a put operation.
StIndArray* ISMIndColumn::putShape (rownr_t rownr, const IPosition& shape)
{
//# Insert an entry for this row and set its shape.
//# Nothing will be done if it is already defined.
return putArrayPtr (rownr, shape, False);
// StIndArray* ptr = putArrayPtr (rownr, shape, False);
// ptr->setShape (*iosfile_p, dataType(), shape);
// return ptr;
}
//# Set the shape for the array (if any) in the given row for a sliced
//# put operation.
StIndArray* ISMIndColumn::putShapeSliced (rownr_t rownr)
{
//# Get the shape of this row and define it again.
//# Defining is necessary, because the shape gotten may be valid for
//# row 10-20, while the put is only for row 15. In that case row 15
//# has to be inserted.
StIndArray* ptr = getShape (rownr);
return putArrayPtr (rownr, ptr->shape(), True);
}
Bool ISMIndColumn::isShapeDefined (rownr_t rownr)
{ return (getArrayPtr(rownr) == 0 ? False : True); }
uInt ISMIndColumn::ndim (rownr_t rownr)
{ return getShape(rownr)->shape().nelements(); }
IPosition ISMIndColumn::shape (rownr_t rownr)
{ return getShape(rownr)->shape(); }
Bool ISMIndColumn::canChangeShape() const
{ return (shapeIsFixed_p ? False : True); }
StIndArray* ISMIndColumn::putArrayPtr (rownr_t rownr, const IPosition& shape,
Bool copyData)
{
// Start with getting the array pointer. This gives the range
// for which this array is valid.
StIndArray* ptr = getArrayPtr (rownr);
// When the shape is put for the last row ever put, don't do it
// when the shape is equal. This is needed to get correct behaviour
// when an array is put. Putting an array calls setShape and then
// putXXXV resulting in two calls to putShape.
if (ptr != 0 && rownr+1 == lastRowPut_p) {
ptr->getShape (*iosfile_p);
if (shape.isEqual (ptr->shape())) {
return ptr;
}
}
// When the interval contains a single row, we can do a simple replace
// if the value is not shared.
if (ptr != 0 && startRow_p == endRow_p) {
if (ptr->refCount (*iosfile_p) <= 1) {
// The value is not shared, so we can replace it.
ptr->setShape (*iosfile_p, dataType(), shape);
Int64 offset = ptr->fileOffset();
putValue (rownr, &offset);
return ptr;
}
}
// Make a new IndArray object.
StIndArray tmp(0);
tmp.setShape (*iosfile_p, dataType(), shape);
if (copyData) {
tmp.copyData (*iosfile_p, dataType(), *ptr);
}
indArray_p = tmp;
Int64 offset = indArray_p.fileOffset();
putValue (rownr, &offset);
return &indArray_p;
}
void ISMIndColumn::getArrayV (rownr_t rownr, ArrayBase& arr)
{ getShape(rownr)->getArrayV (*iosfile_p, arr, dtype()); }
void ISMIndColumn::putArrayV (rownr_t rownr, const ArrayBase& arr)
{ putShape(rownr, arr.shape())->putArrayV (*iosfile_p, arr, dtype()); }
void ISMIndColumn::getSliceV (rownr_t rownr, const Slicer& ns,
ArrayBase& arr)
{ getShape(rownr)->getSliceV (*iosfile_p, ns, arr, dtype()); }
void ISMIndColumn::putSliceV (rownr_t rownr, const Slicer& ns,
const ArrayBase& arr)
{ putShapeSliced(rownr)->putSliceV (*iosfile_p, ns, arr, dtype()); }
Bool ISMIndColumn::compareValue (const void*, const void*) const
{
return False;
}
void ISMIndColumn::init (ByteIO::OpenOption fileOption)
{
clear();
DebugAssert (nrelem_p==1, AipsError);
Bool asBigEndian = stmanPtr_p->asBigEndian();
if (asBigEndian) {
readFunc_p = CanonicalConversion::getToLocal (static_cast<Int64*>(0));
writeFunc_p = CanonicalConversion::getFromLocal (static_cast<Int64*>(0));
fixedLength_p = CanonicalConversion::canonicalSize (static_cast<Int64*>(0));
nrcopy_p = 1;
}else{
readFunc_p = LECanonicalConversion::getToLocal (static_cast<Int64*>(0));
writeFunc_p = LECanonicalConversion::getFromLocal (static_cast<Int64*>(0));
fixedLength_p = LECanonicalConversion::canonicalSize (static_cast<Int64*>(0));
nrcopy_p = 1;
}
lastValue_p = new Int64;
//# Open or create the type 1 file to hold the arrays in the column.
//# For newer versions one file is maintained by the parent
//# for all indirect columns.
if (stmanPtr_p->version() >= 3) {
iosfile_p = stmanPtr_p->openArrayFile (fileOption);
} else {
char strc[8];
snprintf (strc, sizeof(strc), "i%i", seqnr_p);
iosfile_p = new StManArrayFile (stmanPtr_p->fileName() + strc,
fileOption, 1, asBigEndian);
}
}
void ISMIndColumn::handleCopy (rownr_t, const char* value)
{
Int64 offset;
readFunc_p (&offset, value, nrcopy_p);
if (offset != 0) {
StIndArray tmp (offset);
tmp.incrementRefCount (*iosfile_p);
}
}
void ISMIndColumn::handleRemove (rownr_t, const char* value)
{
Int64 offset;
readFunc_p (&offset, value, nrcopy_p);
if (offset != 0) {
StIndArray tmp (offset);
tmp.decrementRefCount (*iosfile_p);
}
}
} //# NAMESPACE CASACORE - END
|