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