forked from qt-creator/qt-creator
163 lines
4.8 KiB
C++
163 lines
4.8 KiB
C++
/**************************************************************************
|
|
**
|
|
** This file is part of Qt Creator Analyzer Tools
|
|
**
|
|
** Copyright (c) 2010 Nokia Corporation and/or its subsidiary(-ies).
|
|
**
|
|
** Contact: Nokia Corporation (qt-info@nokia.com)
|
|
**
|
|
** Commercial Usage
|
|
**
|
|
** Licensees holding valid Qt Commercial licenses may use this file in
|
|
** accordance with the Qt Commercial License Agreement provided with the
|
|
** Software or, alternatively, in accordance with the terms contained in
|
|
** a written agreement between you and Nokia.
|
|
**
|
|
** 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.
|
|
**
|
|
** If you are unsure which license is appropriate for your use, please
|
|
** contact the sales department at http://qt.nokia.com/contact.
|
|
**
|
|
**************************************************************************/
|
|
|
|
#include "callgrindproxymodel.h"
|
|
|
|
#include "callgrinddatamodel.h"
|
|
#include "callgrindfunction.h"
|
|
#include "callgrindfunctioncall.h"
|
|
#include "callgrindparsedata.h"
|
|
|
|
#include <utils/qtcassert.h>
|
|
|
|
#include <QDebug>
|
|
|
|
using namespace Valgrind::Callgrind;
|
|
|
|
DataProxyModel::DataProxyModel(QObject *parent)
|
|
: QSortFilterProxyModel(parent)
|
|
, m_function(0)
|
|
, m_maxRows(0)
|
|
, m_minimumInclusiveCostRatio(0.0)
|
|
{
|
|
setDynamicSortFilter(true);
|
|
}
|
|
|
|
const Function *DataProxyModel::filterFunction() const
|
|
{
|
|
return m_function;
|
|
}
|
|
|
|
void DataProxyModel::setFilterBaseDir ( const QString &baseDir )
|
|
{
|
|
if (m_baseDir == baseDir)
|
|
return;
|
|
|
|
m_baseDir = baseDir;
|
|
invalidateFilter();
|
|
}
|
|
|
|
void DataProxyModel::setFilterFunction(const Function *function)
|
|
{
|
|
if (m_function == function)
|
|
return;
|
|
|
|
const Function *previousFunction = m_function;
|
|
m_function = function;
|
|
invalidateFilter();
|
|
emit filterFunctionChanged(previousFunction, function);
|
|
}
|
|
|
|
void DataProxyModel::setFilterMaximumRows(int rows)
|
|
{
|
|
if (m_maxRows == rows)
|
|
return;
|
|
|
|
m_maxRows = rows;
|
|
invalidateFilter();
|
|
emit filterMaximumRowsChanged(rows);
|
|
}
|
|
|
|
void DataProxyModel::setMinimumInclusiveCostRatio(double minimumInclusiveCost)
|
|
{
|
|
if (m_minimumInclusiveCostRatio == minimumInclusiveCost)
|
|
return;
|
|
|
|
m_minimumInclusiveCostRatio = minimumInclusiveCost;
|
|
invalidateFilter();
|
|
}
|
|
|
|
void DataProxyModel::setSourceModel(QAbstractItemModel *sourceModel)
|
|
{
|
|
if (!qobject_cast<DataModel *>(sourceModel)) {
|
|
qWarning() << Q_FUNC_INFO << "accepts DataModel instances only";
|
|
return;
|
|
}
|
|
|
|
QSortFilterProxyModel::setSourceModel(sourceModel);
|
|
}
|
|
|
|
DataModel *DataProxyModel::dataModel() const
|
|
{
|
|
return qobject_cast<DataModel *>(sourceModel());
|
|
}
|
|
|
|
bool DataProxyModel::filterAcceptsRow(int source_row, const QModelIndex &source_parent) const
|
|
{
|
|
const QModelIndex source_index = sourceModel()->index( source_row, 0, source_parent );
|
|
if (!source_index.isValid())
|
|
return false;
|
|
|
|
// if the filter regexp is a non-empty string, ignore our filters
|
|
if (!filterRegExp().isEmpty()) {
|
|
return QSortFilterProxyModel::filterAcceptsRow(source_row, source_parent);
|
|
}
|
|
|
|
// check max rows
|
|
if (m_maxRows > 0 && source_row > m_maxRows)
|
|
return false;
|
|
|
|
const Function *func = source_index.data(DataModel::FunctionRole).value<const Function *>();
|
|
|
|
// check if func is located in the specific base directory, if any
|
|
if (func && !m_baseDir.isEmpty()) {
|
|
if (!func->location().startsWith(m_baseDir))
|
|
return false;
|
|
}
|
|
|
|
// check if the function from this index is a child of (called by) the filter function
|
|
if (func && m_function) {
|
|
bool isValid = false;
|
|
foreach(const FunctionCall *call, func->incomingCalls()) {
|
|
if (call->caller() == m_function) {
|
|
isValid = true;
|
|
break;
|
|
}
|
|
}
|
|
if (!isValid) {
|
|
return false;
|
|
}
|
|
}
|
|
|
|
// check minimum inclusive costs
|
|
DataModel *model = dataModel();
|
|
QTC_ASSERT(model, return false) // as always: this should never happen
|
|
const ParseData *data = model->parseData();
|
|
QTC_ASSERT(data, return false)
|
|
if (m_minimumInclusiveCostRatio != 0.0) {
|
|
const quint64 totalCost = data->totalCost(0);
|
|
const quint64 inclusiveCost = func->inclusiveCost(0);
|
|
const float inclusiveCostRatio = (float)inclusiveCost / totalCost;
|
|
if (inclusiveCostRatio < m_minimumInclusiveCostRatio)
|
|
return false;
|
|
}
|
|
|
|
return QSortFilterProxyModel::filterAcceptsRow(source_row, source_parent);
|
|
}
|