/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */ /* * This file is part of the LibreOffice project. * * This Source Code Form is subject to the terms of the Mozilla Public * License, v. 2.0. If a copy of the MPL was not distributed with this * file, You can obtain one at http://mozilla.org/MPL/2.0/. */ #include "sal/config.h" #include #include #include "osl/file.h" #include "osl/file.hxx" #include "osl/mutex.hxx" #include "rtl/ref.hxx" #include "rtl/ustring.hxx" #include "unoidl/unoidl.hxx" #include "legacyprovider.hxx" #include "sourcefileprovider.hxx" #include "sourcetreeprovider.hxx" #include "unoidlprovider.hxx" namespace unoidl { namespace { class AggregatingModule: public ModuleEntity { public: AggregatingModule( std::vector< rtl::Reference< Provider > > const & providers, OUString const & name): providers_(providers), name_(name) {} private: virtual ~AggregatingModule() throw () {} virtual std::vector< OUString > getMemberNames() const SAL_OVERRIDE; virtual rtl::Reference< MapCursor > createCursor() const SAL_OVERRIDE; std::vector< rtl::Reference< Provider > > providers_; OUString name_; }; std::vector< OUString > AggregatingModule::getMemberNames() const { std::set< OUString > names; for (std::vector< rtl::Reference< Provider > >::const_iterator i( providers_.begin()); i != providers_.end(); ++i) { rtl::Reference< Entity > ent((*i)->findEntity(name_)); if (ent.is() && ent->getSort() == Entity::SORT_MODULE) { std::vector< OUString > ns( static_cast< ModuleEntity * >(ent.get())->getMemberNames()); names.insert(ns.begin(), ns.end()); } } return std::vector< OUString >(names.begin(), names.end()); } class AggregatingCursor: public MapCursor { public: AggregatingCursor( std::vector< rtl::Reference< Provider > > const & providers, OUString const & name): providers_(providers), name_(name), iterator_(providers_.begin()) { findCursor(); } private: virtual ~AggregatingCursor() throw () {} virtual rtl::Reference< Entity > getNext(OUString * name) SAL_OVERRIDE; void findCursor(); std::vector< rtl::Reference< Provider > > providers_; OUString name_; std::vector< rtl::Reference< Provider > >::iterator iterator_; rtl::Reference< MapCursor > cursor_; std::set< OUString > seen_; }; rtl::Reference< Entity > AggregatingCursor::getNext(OUString * name) { while (cursor_.is()) { OUString n; rtl::Reference< Entity > ent(cursor_->getNext(&n)); if (ent.is()) { if (seen_.insert(n).second) { if (name != 0) { *name = n; } return ent->getSort() == Entity::SORT_MODULE ? new AggregatingModule( providers_, (name_.isEmpty() ? name_ : name_ + ".") + n) : ent; } } else { cursor_.clear(); findCursor(); } } return rtl::Reference< Entity >(); } void AggregatingCursor::findCursor() { for (; !cursor_.is() && iterator_ != providers_.end(); ++iterator_) { if (name_.isEmpty()) { cursor_ = (*iterator_)->createRootCursor(); } else { rtl::Reference< Entity > ent((*iterator_)->findEntity(name_)); if (ent.is() && ent->getSort() == Entity::SORT_MODULE) { cursor_ = static_cast< ModuleEntity * >(ent.get())-> createCursor(); } } } } rtl::Reference< MapCursor > AggregatingModule::createCursor() const { return new AggregatingCursor(providers_, name_); } } NoSuchFileException::~NoSuchFileException() throw () {} FileFormatException::~FileFormatException() throw () {} Entity::~Entity() throw () {} MapCursor::~MapCursor() throw () {} ModuleEntity::~ModuleEntity() throw () {} PublishableEntity::~PublishableEntity() throw () {} EnumTypeEntity::~EnumTypeEntity() throw () {} PlainStructTypeEntity::~PlainStructTypeEntity() throw () {} PolymorphicStructTypeTemplateEntity::~PolymorphicStructTypeTemplateEntity() throw () {} ExceptionTypeEntity::~ExceptionTypeEntity() throw () {} InterfaceTypeEntity::~InterfaceTypeEntity() throw () {} TypedefEntity::~TypedefEntity() throw () {} ConstantGroupEntity::~ConstantGroupEntity() throw () {} SingleInterfaceBasedServiceEntity::~SingleInterfaceBasedServiceEntity() throw () {} AccumulationBasedServiceEntity::~AccumulationBasedServiceEntity() throw () {} InterfaceBasedSingletonEntity::~InterfaceBasedSingletonEntity() throw () {} ServiceBasedSingletonEntity::~ServiceBasedSingletonEntity() throw () {} Provider::~Provider() throw () {} rtl::Reference< Provider > loadProvider( rtl::Reference< Manager > const & manager, OUString const & uri) { osl::DirectoryItem item; if (osl::DirectoryItem::get(uri, item) == osl::FileBase::E_None) { osl::FileStatus status(osl_FileStatus_Mask_Type); if (item.getFileStatus(status) == osl::FileBase::E_None && status.getFileType() == osl::FileStatus::Directory) { return new detail::SourceTreeProvider(manager, uri); } } if (uri.endsWith(".idl")) { return new detail::SourceFileProvider(manager, uri); } try { return new detail::UnoidlProvider(uri); } catch (FileFormatException & e) { SAL_INFO( "unoidl", "FileFormatException \"" << e.getDetail() << "\", retrying <" << uri << "> as legacy format"); return new detail::LegacyProvider(manager, uri); } } void Manager::addProvider(rtl::Reference< Provider > const & provider) { assert(provider.is()); osl::MutexGuard g(mutex_); providers_.push_back(provider); } rtl::Reference< Entity > Manager::findEntity(rtl::OUString const & name) const { //TODO: caching? (here or in cppuhelper::TypeManager?) osl::MutexGuard g(mutex_); for (std::vector< rtl::Reference< Provider > >::const_iterator i( providers_.begin()); i != providers_.end(); ++i) { rtl::Reference< Entity > ent((*i)->findEntity(name)); if (ent.is()) { return ent; } } return rtl::Reference< Entity >(); } rtl::Reference< MapCursor > Manager::createCursor(rtl::OUString const & name) const { return new AggregatingCursor(providers_, name); } Manager::~Manager() throw () {} } /* vim:set shiftwidth=4 softtabstop=4 expandtab: */