/**************************************************************************** ** ** Copyright (C) 2013 Digia Plc and/or its subsidiary(-ies). ** Contact: http://www.qt-project.org/legal ** ** This file is part of the QtNetwork module of the Qt Toolkit. ** ** $QT_BEGIN_LICENSE:LGPL$ ** Commercial License Usage ** Licensees holding valid commercial Qt licenses may use this file in ** accordance with the commercial license agreement provided with the ** Software or, alternatively, in accordance with the terms contained in ** a written agreement between you and Digia. For licensing terms and ** conditions see http://qt.digia.com/licensing. For further information ** use the contact form at http://qt.digia.com/contact-us. ** ** GNU Lesser General Public License Usage ** Alternatively, this file may be used under the terms of the GNU Lesser ** General Public License version 2.1 as published by the Free Software ** Foundation and appearing in the file LICENSE.LGPL included in the ** packaging of this file. Please review the following information to ** ensure the GNU Lesser General Public License version 2.1 requirements ** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html. ** ** In addition, as a special exception, Digia gives you certain additional ** rights. These rights are described in the Digia Qt LGPL Exception ** version 1.1, included in the file LGPL_EXCEPTION.txt in this package. ** ** GNU General Public License Usage ** Alternatively, this file may be used under the terms of the GNU ** General Public License version 3.0 as published by the Free Software ** Foundation and appearing in the file LICENSE.GPL included in the ** packaging of this file. Please review the following information to ** ensure the GNU General Public License version 3.0 requirements will be ** met: http://www.gnu.org/copyleft/gpl.html. ** ** ** $QT_END_LICENSE$ ** ****************************************************************************/ #include "qbearerengine_p.h" #ifndef QT_NO_BEARERMANAGEMENT QT_BEGIN_NAMESPACE QBearerEngine::QBearerEngine(QObject *parent) : QObject(parent), mutex(QMutex::Recursive) { } QBearerEngine::~QBearerEngine() { QHash::Iterator it; QHash::Iterator end; for (it = snapConfigurations.begin(), end = snapConfigurations.end(); it != end; ++it) { it.value()->isValid = false; it.value()->id.clear(); } snapConfigurations.clear(); for (it = accessPointConfigurations.begin(), end = accessPointConfigurations.end(); it != end; ++it) { it.value()->isValid = false; it.value()->id.clear(); } accessPointConfigurations.clear(); for (it = userChoiceConfigurations.begin(), end = userChoiceConfigurations.end(); it != end; ++it) { it.value()->isValid = false; it.value()->id.clear(); } userChoiceConfigurations.clear(); } bool QBearerEngine::requiresPolling() const { return false; } /* Returns \c true if configurations are in use; otherwise returns \c false. If configurations are in use and requiresPolling() returns \c true, polling will be enabled for this engine. */ bool QBearerEngine::configurationsInUse() const { QHash::ConstIterator it; QHash::ConstIterator end; QMutexLocker locker(&mutex); for (it = accessPointConfigurations.constBegin(), end = accessPointConfigurations.constEnd(); it != end; ++it) { if (it.value()->ref.load() > 1) return true; } for (it = snapConfigurations.constBegin(), end = snapConfigurations.constEnd(); it != end; ++it) { if (it.value()->ref.load() > 1) return true; } for (it = userChoiceConfigurations.constBegin(), end = userChoiceConfigurations.constEnd(); it != end; ++it) { if (it.value()->ref.load() > 1) return true; } return false; } #include "moc_qbearerengine_p.cpp" #endif // QT_NO_BEARERMANAGEMENT QT_END_NAMESPACE