/*

* All rights reserved.

* This component and the accompanying materials are made available

* under the terms of "Eclipse Public License v1.0"

* which accompanies this distribution, and is available

* at the URL "http://www.eclipse.org/legal/epl-v10.html".

*

* Initial Contributors:

* Nokia Corporation - initial contribution.

*

* Contributors:

*

* Description:

*

*/

/**

 @file

 @internalComponent

*/

#include "msmmnodebase.h"

#include <usb/usblogger.h>

TMsmmNodeBase::TMsmmNodeBase(TInt aIdentifier):

iIdentifier(aIdentifier),

iNextPeer(NULL),

iFirstChild(NULL),

iLastChild(NULL),

iParent(NULL)

    {

    }

TMsmmNodeBase::~TMsmmNodeBase()

    {

    // Remove current node from the parent node and destroy it.

    DestroyNode(); 

    }

void TMsmmNodeBase::DestroyNode()

    {

    TMsmmNodeBase* parentNode = iParent; 

    TMsmmNodeBase* iterator(this);

    TMsmmNodeBase* iteratorPrev(NULL);

    TMsmmNodeBase* iteratorNext(NULL);

    if (parentNode)

        {

        // A parent node exists

        iterator = parentNode->iFirstChild;

        if (iterator)

            {

            // iteratorPrev equal NULL at beginning;

            iteratorNext= iterator->iNextPeer;

            }

        // Go through each child node to find the node to be destroyed

        while (iterator && (iterator != this))

            {

            iteratorPrev = iterator;

            iterator = iteratorNext;

            if(iteratorNext)

                {

                iteratorNext = iteratorNext->iNextPeer;

                }

            }

        if (iterator)

            {

            // Matched node found

            if (parentNode->iLastChild == iterator)

                {

                parentNode->iLastChild = iteratorPrev;

                }

            if (iteratorPrev)

                {

                iteratorPrev->iNextPeer = iteratorNext;

                }

            else

                {

                parentNode->iFirstChild = iteratorNext;

                }

            }

        else

            {

            // No matched node

            return;

            }

        }

    // Remove all children node

    if (iFirstChild)

        {

        // Current node isn't a leaf node

        iterator = iFirstChild;

        iteratorNext= iterator->iNextPeer;

        while (iterator)

            {

            delete iterator;

            iterator = iteratorNext;

            if (iteratorNext)

                {

                iteratorNext = iterator->iNextPeer;

                }

            }

        }

    }

void TMsmmNodeBase::AddChild(TMsmmNodeBase* aChild)

    {

    if (!iFirstChild)

        {

        iFirstChild = aChild;

        }

    else

        {

        iLastChild->iNextPeer = aChild;

        }

    iLastChild = aChild;

    aChild->iParent = this;

    }

TMsmmNodeBase* TMsmmNodeBase::SearchInChildren(TInt aIdentifier)

    {

    TMsmmNodeBase* iterator(iFirstChild);

    while (iterator)

        {

        if (iterator->iIdentifier == aIdentifier)

            {

            break;

            }

        iterator = iterator->iNextPeer;

        }

    return iterator;

    }

// TUsbMsDevice

// Function memeber

TUsbMsDevice::TUsbMsDevice(const TUSBMSDeviceDescription& aDevice):

TMsmmNodeBase(aDevice.iDeviceId),

iDevice(aDevice)

    {

    }

// TUsbMsInterface

// Function memeber

TUsbMsInterface::TUsbMsInterface(TUint8 aInterfaceNumber, 

        TUint32 aInterfaceToken):

TMsmmNodeBase(aInterfaceNumber), 

iInterfaceNumber(aInterfaceNumber),

iInterfaceToken(aInterfaceToken)

    {

    }

TUsbMsInterface::~TUsbMsInterface()

    {

    iUsbMsDevice.Close();

    }

// TUsbMsLogicalUnit

// Function memeber

TUsbMsLogicalUnit::TUsbMsLogicalUnit(TUint8 aLogicalUnitNumber, TText aDrive):

TMsmmNodeBase(aLogicalUnitNumber),

iLogicalUnitNumber(aLogicalUnitNumber),

iDrive(aDrive)

    {

    }

// End of file