1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/os/persistentdata/persistentstorage/dbms/usql/UQ_MULTI.CPP Fri Jun 15 03:10:57 2012 +0200
1.3 @@ -0,0 +1,197 @@
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 +// SQL AND and OR node class
1.18 +//
1.19 +//
1.20 +
1.21 +#include "UQ_STD.H"
1.22 +
1.23 +// class CSqlMultiNode
1.24 +
1.25 +inline CSqlMultiNode::CSqlMultiNode( TType aType )
1.26 + : CSqlSearchCondition( aType )
1.27 + { __ASSERT( aType == EOr || aType == EAnd ); }
1.28 +
1.29 +inline TInt CSqlMultiNode::Size() const
1.30 + { return ( const TUint8* )iEnd - ( const TUint8* )this; }
1.31 +
1.32 +inline TBool CSqlMultiNode::IsFull() const
1.33 + { return ( Size() & ( EGranularity - 1 ) ) == 0; }
1.34 +
1.35 +inline TInt CSqlMultiNode::Size( TInt aLeaves )
1.36 + { return _FOFF( CSqlMultiNode, iLeaves[ aLeaves ] ); }
1.37 +
1.38 +CSqlMultiNode::~CSqlMultiNode()
1.39 + {
1.40 + TEntry* p = iLeaves;
1.41 + TEntry* e = iEnd;
1.42 + while ( p < e )
1.43 + delete *p++;
1.44 + }
1.45 +
1.46 +CSqlMultiNode* CSqlMultiNode::New( TType aType, TInt aSize )
1.47 + {
1.48 + aSize = ( aSize + ( EGranularity - 1 ) ) & ~( EGranularity - 1 );
1.49 + __ASSERT( aSize >= static_cast<TInt>( sizeof( CSqlMultiNode ) ) );
1.50 + aSize -= sizeof( CSqlMultiNode );
1.51 + return new( aSize ) CSqlMultiNode( aType ); // get the extra size for the entries
1.52 + }
1.53 +
1.54 +CSqlMultiNode* CSqlMultiNode::Grow( CSqlMultiNode* aNode, TInt aExtraSize )
1.55 + {
1.56 + TInt size = aNode->Size();
1.57 + CSqlMultiNode* self = New( aNode->NodeType(), size + aExtraSize );
1.58 + if ( self )
1.59 + {
1.60 + aNode->iEnd = aNode->iLeaves;
1.61 + self->iEnd = ( TEntry* )Mem::Copy( self->iLeaves, aNode->iLeaves, size - Size( 0 ) );
1.62 + }
1.63 + delete aNode;
1.64 + return self;
1.65 + }
1.66 +
1.67 +CSqlMultiNode* CSqlMultiNode::Concatenate( CSqlMultiNode* aLeft, CSqlMultiNode* aRight )
1.68 + {
1.69 + TInt lsize = aLeft->Size();
1.70 + TInt rsize = aRight->Size();
1.71 + if ( rsize > lsize )
1.72 + return Concatenate( aRight, aLeft ); // right node larger--flip over
1.73 + rsize -= Size( 0 );
1.74 + if ( (aLeft->IsFull()) || // if left node is already full
1.75 + (( lsize & ( EGranularity - 1 ) ) + rsize > EGranularity ) ) // or available space in the left node is not enough for a new data
1.76 + aLeft = Grow( aLeft, rsize ); // then increase left node to accomadate right node
1.77 + if ( aLeft )
1.78 + {
1.79 + aRight->iEnd = aRight->iLeaves;
1.80 + aLeft->iEnd = ( TEntry* )Mem::Copy( aLeft->iEnd, aRight->iLeaves, rsize );
1.81 + }
1.82 + delete aRight;
1.83 + return aLeft;
1.84 + }
1.85 +
1.86 +CSqlSearchCondition* CSqlMultiNode::New( TType aType, CSqlSearchCondition* aLeft, CSqlSearchCondition* aRight )
1.87 +//
1.88 +// Full NULL propagation, cleaning up any of either node on failure
1.89 +//
1.90 + {
1.91 + if ( aLeft && aRight )
1.92 + {
1.93 + if ( aLeft->NodeType() == aType )
1.94 + { // we can merge into aLeft
1.95 + CSqlMultiNode* left = aLeft->MultiNode();
1.96 + if ( aRight->NodeType() == aType )
1.97 + return Concatenate( left, aRight->MultiNode() );
1.98 +
1.99 + // append right subnode onto left
1.100 + if ( left->IsFull() )
1.101 + {
1.102 + left = Grow( left, sizeof( TEntry ) );
1.103 + if ( !left )
1.104 + goto grow_failed;
1.105 + }
1.106 + TEntry* e = left->iEnd;
1.107 + *e++ = aRight;
1.108 + left->iEnd = e;
1.109 + return left;
1.110 + }
1.111 + else if ( aRight->NodeType() == aType )
1.112 + return New( aType, aRight, aLeft ); // swap left and right
1.113 + else
1.114 + { // neither node is not of the required type
1.115 + CSqlMultiNode* self = New( aType, Size( 2 ) );
1.116 + if ( self )
1.117 + {
1.118 + TEntry* e = self->iLeaves;
1.119 + *e++ = aLeft;
1.120 + *e++ = aRight;
1.121 + self->iEnd = e;
1.122 + return self;
1.123 + }
1.124 + }
1.125 + }
1.126 + delete aLeft;
1.127 +grow_failed:
1.128 + delete aRight;
1.129 + return 0;
1.130 + }
1.131 +
1.132 +void CSqlMultiNode::Remove( CSqlSearchCondition* aSubNode )
1.133 +//
1.134 +// Remove the subnode from the leaf-set
1.135 +//
1.136 + {
1.137 + TEntry* p = iLeaves - 1;
1.138 + TEntry* e = --iEnd;
1.139 + do
1.140 + {
1.141 + __ASSERT( p < e );
1.142 + } while ( *++p != aSubNode );
1.143 + while ( p<e )
1.144 + {
1.145 + TEntry e = *++p;
1.146 + p[ -1 ] = e;
1.147 + }
1.148 + delete aSubNode;
1.149 + }
1.150 +
1.151 +CSqlSearchCondition* CSqlMultiNode::Reduce (CSqlMultiNode* aNode )
1.152 +//
1.153 +// If we have less than two leaves, then simplify the expression
1.154 +//
1.155 + {
1.156 + CSqlSearchCondition* node = aNode;
1.157 + if ( aNode->iEnd - aNode->iLeaves <= 1 )
1.158 + {
1.159 + if ( aNode->iEnd - aNode->iLeaves == 1 )
1.160 + {
1.161 + aNode->iEnd = aNode->iLeaves;
1.162 + node = aNode->iLeaves[ 0 ];
1.163 + }
1.164 + else
1.165 + node = 0;
1.166 + delete aNode;
1.167 + }
1.168 + return node;
1.169 + }
1.170 +
1.171 +void CSqlMultiNode::BindL( const RDbTableRow& aSource )
1.172 + {
1.173 + __ASSERT( iEnd - iLeaves > 1 );
1.174 + const TEntry* p = iLeaves;
1.175 + const TEntry* e = iEnd;
1.176 + do ( *p++ )->BindL( aSource );
1.177 + while ( p < e );
1.178 + }
1.179 +
1.180 +TBool CSqlMultiNode::EvaluateL( const TTextOps& aTextOp ) const
1.181 + {
1.182 + __ASSERT( iEnd - iLeaves > 1 );
1.183 + const TEntry* p = iLeaves;
1.184 + const TEntry* e = iEnd - 1; // all except the last sub-node
1.185 + do
1.186 + {
1.187 + TBool b = ( *p++ )->EvaluateL( aTextOp );
1.188 + if ( NodeType() == EOr )
1.189 + {
1.190 + if ( b )
1.191 + return b;
1.192 + }
1.193 + else
1.194 + {
1.195 + if ( !b )
1.196 + return b;
1.197 + }
1.198 + } while ( p < e );
1.199 + return ( *p )->EvaluateL( aTextOp ); // the last subnode
1.200 + }