1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/os/persistentdata/persistentstorage/dbms/utable/UT_SCHMA.CPP Fri Jun 15 03:10:57 2012 +0200
1.3 @@ -0,0 +1,318 @@
1.4 +// Copyright (c) 1998-2009 Nokia Corporation and/or its subsidiary(-ies).
1.5 +// All rights reserved.
1.6 +// This component and the accompanying materials are made available
1.7 +// under the terms of "Eclipse Public License v1.0"
1.8 +// which accompanies this distribution, and is available
1.9 +// at the URL "http://www.eclipse.org/legal/epl-v10.html".
1.10 +//
1.11 +// Initial Contributors:
1.12 +// Nokia Corporation - initial contribution.
1.13 +//
1.14 +// Contributors:
1.15 +//
1.16 +// Description:
1.17 +//
1.18 +
1.19 +#include "UT_STD.H"
1.20 +
1.21 +// Class CDbTableIndexDef
1.22 +
1.23 +EXPORT_C CDbTableIndexDef::CDbTableIndexDef()
1.24 + {}
1.25 +
1.26 +EXPORT_C CDbTableIndexDef::~CDbTableIndexDef()
1.27 + {
1.28 + delete iName;
1.29 + }
1.30 +
1.31 +EXPORT_C void CDbTableIndexDef::ConstructL(const TDesC& aName)
1.32 +//
1.33 +// Construct with an empty key
1.34 +//
1.35 + {
1.36 + iName=aName.AllocL();
1.37 + }
1.38 +
1.39 +// Class RDbIndexes
1.40 +
1.41 +void RDbIndexes::Close()
1.42 + {
1.43 + TSglQueIter<CDbTableIndexDef> iter(iRep);
1.44 + for (CDbTableIndexDef* def;(def=iter++)!=0;)
1.45 + delete def;
1.46 + }
1.47 +
1.48 +CDbTableIndexDef* RDbIndexes::Find(const TDesC& aName) const
1.49 +//
1.50 +// Locate and index on the table by name
1.51 +//
1.52 + {
1.53 + TSglQueIter<CDbTableIndexDef> iter(CONST_CAST(TSglQue<CDbTableIndexDef>&,iRep));
1.54 + for (CDbTableIndexDef* def;(def=iter++)!=0;)
1.55 + if (aName.CompareF(def->Name())==0)
1.56 + return def;
1.57 + return 0;
1.58 + }
1.59 +
1.60 +CDbTableIndexDef& RDbIndexes::FindL(const TDesC& aName) const
1.61 +//
1.62 +// Leave if not found
1.63 +//
1.64 + {
1.65 + CDbTableIndexDef* def=Find(aName);
1.66 + if (def==NULL)
1.67 + __LEAVE(KErrNotFound);
1.68 + return *def;
1.69 + }
1.70 +
1.71 +EXPORT_C TInt RDbIndexes::Count() const
1.72 + {
1.73 + TInt count = 0;
1.74 + TSglQueIterC<CDbTableIndexDef> iter( iRep );
1.75 + for ( ; iter++ != 0; )
1.76 + ++count;
1.77 + return count;
1.78 + }
1.79 +
1.80 +// Class TDbColumnDef
1.81 +
1.82 +EXPORT_C void TDbColumnDef::SetL(const TDbColumnDef& aCol)
1.83 +//
1.84 +// Replace assignment as this can leave
1.85 +//
1.86 + {
1.87 + iMaxLength=aCol.iMaxLength;
1.88 + iType=aCol.iType;
1.89 + iAttributes=aCol.iAttributes;
1.90 + iFlags=aCol.iFlags;
1.91 + iName=aCol.iName->AllocL();
1.92 + }
1.93 +
1.94 +EXPORT_C void TDbColumnDef::SetL(const TDbCol& aCol)
1.95 + {
1.96 + iMaxLength=aCol.iMaxLength;
1.97 + iType=TUint8(aCol.iType);
1.98 + iAttributes=TUint8(aCol.iAttributes);
1.99 + iName=aCol.iName.AllocL();
1.100 + }
1.101 +
1.102 +void TDbColumnDef::AsTDbCol(TDbCol& aColumn) const
1.103 + {
1.104 + aColumn.iType=Type();
1.105 + aColumn.iMaxLength=iMaxLength;
1.106 + aColumn.iAttributes=iAttributes;
1.107 + aColumn.iName=*iName;
1.108 + }
1.109 +
1.110 +// Class HDbColumnSet
1.111 +
1.112 +HDbColumnSet* HDbColumnSet::NewL(TInt aCount)
1.113 + {
1.114 + return new(User::AllocL(_FOFF(HDbColumnSet,iColumns[aCount]))) HDbColumnSet(aCount);
1.115 + }
1.116 +
1.117 +HDbColumnSet::HDbColumnSet(TInt aCount)
1.118 + : iAttributes(0), iIndex(NULL), iEnd(&iColumns[aCount])
1.119 + {
1.120 + Mem::FillZ(&iColumns[0],aCount*sizeof(iColumns[0]));
1.121 + }
1.122 +
1.123 +HDbColumnSet::~HDbColumnSet()
1.124 + {
1.125 + User::Free(iIndex);
1.126 + const TIteratorC end=End();
1.127 + for (TIteratorC iter=Begin();iter<end;++iter)
1.128 + delete iter->iName;
1.129 + }
1.130 +
1.131 +EXPORT_C TInt HDbColumnSet::Count() const
1.132 + {
1.133 + return End()-Begin();
1.134 + }
1.135 +
1.136 +void HDbColumnSet::Complete()
1.137 +//
1.138 +// Called on completion of the column set
1.139 +//
1.140 + {
1.141 + TUint attrib=0;
1.142 + const TIteratorC end=End();
1.143 + for (TIteratorC iter=Begin();iter<end;++iter)
1.144 + {
1.145 + if (TDbCol::IsLong(iter->Type()))
1.146 + attrib|=ELongColumns;
1.147 + if (iter->iAttributes&TDbCol::EAutoIncrement)
1.148 + attrib|=EAutoIncrement;
1.149 + }
1.150 + iAttributes=attrib;
1.151 + }
1.152 +
1.153 +EXPORT_C HDbColumnSet::TIteratorC HDbColumnSet::ColumnL(const TDesC& aColumn) const
1.154 +//
1.155 +// Lookup name in the name index (binary search)
1.156 +//
1.157 + {
1.158 + const TIteratorC* index=IndexL();
1.159 + TInt left=0;
1.160 + TInt right=Count();
1.161 + while (left<right)
1.162 + {
1.163 + TInt mid=(left+right)>>1;
1.164 + TInt c=index[mid]->iName->CompareF(aColumn);
1.165 + if (c<0)
1.166 + left=mid+1;
1.167 + else if (c>0)
1.168 + right=mid;
1.169 + else
1.170 + return index[mid]; // matched entry
1.171 + }
1.172 + return 0; // no match
1.173 + }
1.174 +
1.175 +EXPORT_C TDbColNo HDbColumnSet::ColNoL(const TDesC& aColumn) const
1.176 +//
1.177 +// Return ordinal for given column name
1.178 +//
1.179 + {
1.180 + TIteratorC col=ColumnL(aColumn);
1.181 + return col ? 1+(col-Begin()) : KDbNullColNo;
1.182 + }
1.183 +
1.184 +const HDbColumnSet::TIteratorC* HDbColumnSet::IndexL() const
1.185 +//
1.186 +// Return the by-name lookup index, building it if required
1.187 +//
1.188 + {
1.189 + TIteratorC* index=iIndex;
1.190 + if (!index)
1.191 + {
1.192 + CONST_CAST(TIteratorC*&,iIndex)=index=(TIteratorC*)User::AllocL(Count()*sizeof(TIteratorC));
1.193 + TInt ii=0;
1.194 + TIteratorC col=Begin();
1.195 + TIteratorC end=End();
1.196 + do
1.197 + {
1.198 + // binary search for insertion point
1.199 + TInt left=0;
1.200 + TInt right=ii;
1.201 + while (left<right)
1.202 + {
1.203 + TInt mid=(left+right)>>1;
1.204 + TInt c=index[mid]->iName->CompareF(*col->iName);
1.205 + __ASSERT(c!=0); // names are unique
1.206 + if (c<0)
1.207 + left=mid+1;
1.208 + else
1.209 + right=mid;
1.210 + }
1.211 + // insert the entry
1.212 + Mem::Move(index+left+1,index+left,(ii-left)*sizeof(TIteratorC));
1.213 + index[left]=col;
1.214 + } while (++ii,++col<end);
1.215 + }
1.216 + return index;
1.217 + }
1.218 +
1.219 +// Class CDbTableDef
1.220 +
1.221 +EXPORT_C CDbTableDef::CDbTableDef()
1.222 + {}
1.223 +
1.224 +EXPORT_C CDbTableDef::~CDbTableDef()
1.225 + {
1.226 + delete iColumns;
1.227 + delete iName;
1.228 + iIndexes.Close();
1.229 + }
1.230 +
1.231 +EXPORT_C void CDbTableDef::ConstructL(const TDesC& aName,TInt aColumnCount)
1.232 + {
1.233 + iName=aName.AllocL();
1.234 + iColumns=HDbColumnSet::NewL(aColumnCount);
1.235 + }
1.236 +
1.237 +void CDbTableDef::ExchangeColumnSet(HDbColumnSet* aSet)
1.238 + {
1.239 + delete iColumns;
1.240 + iColumns=aSet;
1.241 + Changed();
1.242 + }
1.243 +
1.244 +EXPORT_C void CDbTableDef::Changed()
1.245 +//
1.246 +// evaluate cached info about the set
1.247 +//
1.248 + {
1.249 + iColumns->Complete();
1.250 + }
1.251 +
1.252 +const CDbTableIndexDef* CDbTableDef::FindKey(const TDesC& aColumn,TBool aFirstColumn) const
1.253 +//
1.254 +// Find an index which keys on the given column
1.255 +//
1.256 + {
1.257 + TSglQueIterC<CDbTableIndexDef> indexes(Indexes().AsQue());
1.258 + for (const CDbTableIndexDef* def;(def=indexes++)!=0;)
1.259 + {
1.260 + const CDbKey& key=def->Key();
1.261 + TInt ii=0;
1.262 + do
1.263 + {
1.264 + if (aColumn.CompareF(key[ii].iName)==0)
1.265 + return def;
1.266 + if (aFirstColumn)
1.267 + break;
1.268 + } while (++ii<key.Count());
1.269 + }
1.270 + return 0;
1.271 + }
1.272 +
1.273 +// Class RDbTableSchema
1.274 +
1.275 +void RDbTableSchema::Discard()
1.276 + {
1.277 + TSglQueIter<CDbTableDef> iter(iRep);
1.278 + for (CDbTableDef* def;(def=iter++)!=0;)
1.279 + delete def;
1.280 + iRep.Reset();
1.281 + iLoaded=EFalse;
1.282 + }
1.283 +
1.284 +CDbTableDef* RDbTableSchema::Find(const TDesC& aTable)
1.285 + {
1.286 + __ASSERT(IsLoaded());
1.287 + TSglQueIter<CDbTableDef> iter(iRep);
1.288 + for (CDbTableDef* def;(def=iter++)!=0;)
1.289 + if (aTable.CompareF(def->Name())==0)
1.290 + return def;
1.291 + return 0;
1.292 + }
1.293 +
1.294 +CDbTableDef& RDbTableSchema::FindL(const TDesC& aTable)
1.295 +//
1.296 +// Leave if not found
1.297 +//
1.298 + {
1.299 + CDbTableDef* def=Find(aTable);
1.300 + if (def==NULL)
1.301 + __LEAVE(KErrNotFound);
1.302 + return *def;
1.303 + }
1.304 +
1.305 +// Class RDbTables
1.306 +
1.307 +void RDbTables::Close()
1.308 + {
1.309 + TSglQueIter<CDbTable> iter(iRep);
1.310 + for (CDbTable* table;(table=iter++)!=0;)
1.311 + table->Discard();
1.312 + }
1.313 +
1.314 +CDbTable* RDbTables::Find(const TDesC& aTable)
1.315 + {
1.316 + TSglQueIter<CDbTable> iter(iRep);
1.317 + for (CDbTable* table;(table=iter++)!=0;)
1.318 + if (aTable.CompareF(table->Def().Name())==0)
1.319 + return table;
1.320 + return 0;
1.321 + }