Bdb packages | Design docs | Source docs | Guidelines | Recent releases
	Search | Site Map .

                 

---

/BdbEventStore/BdbCollectionTInspector.cc

Go to the documentation of this file.

//------------------------------------------------------------------------------
// File and Version Information:
//      $Id: BdbCollectionTInspector.cc,v 1.4 2002/06/14 01:29:50 becla Exp $
//
// Description:
//      Class BdbCollectionTInspector interface (.cc) file.
//          This class returns the events store collection one by one.
//          It is based on BdbInspector (from David R. Quarrie)
//
// Environment:
//      Software developed for the BaBar Detector at the SLAC B-Factory
//
// Author List:
//      Jean-Noel Albert            Original Author (source in BdbCollectionInspector)
//      Jacek Becla             Modified to break dependency between Event Store
//                              and BdbEvent
//
// Copyright Information:
//      Copyright (C) 2002      Stanford Linear Accelerator Center
//
//------------------------------------------------------------------------------

//------------------
// Class's Header --
//------------------
#include "BdbEventStore/BdbCollectionTInspector.hh"

//-----------------------
// BaBar class headers --
//-----------------------
#include "BdbEventStore/BdbEventStore.hh"
#include "BdbEventStore/BdbCollectionP.hh"
#include "BdbEventStore/BdbEventStoreIterator.hh"
#include "BdbTrees/BdbTreeNodeP.hh"
#include "BdbTrees/BdbTreeNodeSimpleIterator.hh"

extern "C" {
#include <strings.h>
}

;

///////////////////////////////////////////////////////////////////////////////

// Constructor
BdbCollectionTInspector::BdbCollectionTInspector (d_Boolean autoCommit)
{
    _colls.resize(64);
    _nbcolls = 0;
    _nxtcoll = 0;
    _autoCommit = autoCommit;
}

// Destructor
BdbCollectionTInspector::~BdbCollectionTInspector()
{}

// Internal routine - iterate over the tree of tree nodes
BdbStatus BdbCollectionTInspector::scan(BdbTreeNode& node)
{
    BdbHandleAny itemP;
    BdbTreeNodeSimpleIterator nditr(node);

    while (BdbcSuccess == nditr.next(itemP)) {
        if (BdbcSuccess == BdbEventStore::instance()->readAttempt(itemP)) {
            ooTypeNumber collPType = ooTypeN(BdbCollectionP);
            if (itemP->ooIsKindOf(collPType)) {
                if (_nbcolls >= _colls.size()) {
                    _colls.resize(_nbcolls + 64);
                    // Commit and restart a transaction...
                    if (_autoCommit) {
                        BdbEventStore::instance()->commit();
                        BdbEventStore::instance()->startRead();
                    }
                }
                BdbHandle(BdbCollectionP) collP = 
                                (BdbHandle(BdbCollectionP)&) itemP;
        _colls[_nbcolls++] = BdbEventStore::getCollection(collP);
            }

            if (BdbTreeNodeP::isTreeNode(itemP)) {
                BdbTreeNode child;
                child.setPersistent((BdbHandle(BdbTreeNodeP)&) itemP);
                scan(child);
            }
        }
    }
    return BdbcSuccess;
}

// Scan the tree of tree nodes and convert it to a list
BdbStatus BdbCollectionTInspector::scan ()
{
    d_Boolean localTransaction;
    BdbTreeNode node;
    BdbEventStoreIterator evsitr;

    if ( BdbcNoOpen != BdbEventStore::instance()->mode() ) {
        if (!_autoCommit)
            return BdbcError;
        localTransaction = d_False;
    }
    else {
        localTransaction = d_True;
        BdbEventStore::instance()->startRead();
    }

    while (BdbcSuccess == evsitr.next(node))
        scan(node);     // Bypass the errors...

    if (localTransaction)
        BdbEventStore::instance()->commit();
    return BdbcSuccess;
}

BdbStatus BdbCollectionTInspector::scan (BdbDomain::AuthLevels level, const char* name)
{
    d_Boolean localTransaction;
    BdbTreeNode node;

    if ( BdbcNoOpen != BdbEventStore::instance()->mode() ) {
        if (!_autoCommit)
            return BdbcError;
        localTransaction = d_False;
    }
    else {
        localTransaction = d_True;
        BdbEventStore::instance()->startRead();
    }

    if (BdbcSuccess != BdbEventStore::instance()->treeNode(node, level, name))
        return BdbcError;

    BdbStatus status =  scan(node);

    if (localTransaction)
        BdbEventStore::instance()->commit();
    return status;
}

BdbStatus BdbCollectionTInspector::scan (const char* treepath)
{
    d_Boolean localTransaction;
    BdbTreeNode node;

    if ( BdbcNoOpen != BdbEventStore::instance()->mode() ) {
        if (!_autoCommit)
            return BdbcError;
        localTransaction = d_False;
    }
    else {
        localTransaction = d_True;
        BdbEventStore::instance()->startRead();
    }

    if (BdbcSuccess != node.moveTo(treepath))
        return BdbcError;

    BdbStatus status =  scan(node);

    if (localTransaction)
        BdbEventStore::instance()->commit();
    return status;
}


BdbStatus BdbCollectionTInspector::scan (BdbHandle(BdbDBObj)& db)
{
    BdbItr(BdbCollectionP) tcollPitr;

    if (BdbcSuccess != tcollPitr.scan(db))
        return BdbcError;

    while (tcollPitr.next()) {
        if (_nbcolls >= _colls.size()) {
            _colls.resize(_nbcolls + 64);
            // Commit and restart a transaction...
            if (_autoCommit) {
                BdbEventStore::instance()->commit();
                BdbEventStore::instance()->startRead();
            }
        }
        if (0 != tcollPitr->name())
            _colls[_nbcolls++] = BdbEventStore::getCollection(tcollPitr);
    }
/***
printf("collPitr isDelete: %d\n", collPitr->isDeleted());
printf("collPitr name: %s\n", (collPitr->name() == 0) ? "<no name>" : collPitr->name());
printf("collPitr pathname: %s\n", (collPitr->name() == 0) ? "<no path>" : collPitr->pathName());
***/
    return BdbcSuccess;
}

BdbStatus BdbCollectionTInspector::scanDatabase (const char* dbname)
{
    BdbHandle(BdbDBObj)db;
    if (BdbcSuccess != db.exist(BdbEventStore::instance()->fd(), dbname, BdbcRead))
        return BdbcError;
    return scan (db);
}

d_Boolean BdbCollectionTInspector::exist (const char* treepath)
{
    BdbTreeNode node;

    return (BdbcSuccess == node.moveTo(treepath));
}

// Accessor

BdbAbsCollectionT<BdbEventT>* BdbCollectionTInspector::next()
{
    if (_nxtcoll < _nbcolls)
        return _colls[_nxtcoll++];
    return 0;
}

// Reset the iterator at the beginning of the list
void BdbCollectionTInspector::reset ()
{
    _nxtcoll = 0;
}

// Clear the iterator
void BdbCollectionTInspector::clear ()
{
    _colls.resize(64);
    _nbcolls = 0;
    _nxtcoll = 0;
}

 

---

BaBar Public Site | SLAC | News | Links | Who's Who | Contact Us

Page Owner: Jacek Becla
Last Update: October 04, 2002