2011-04-04 14:39:27 +02:00
|
|
|
/**************************************************************************
|
|
|
|
|
**
|
2011-05-06 15:05:37 +02:00
|
|
|
** This file is part of Qt Creator
|
2011-04-04 14:39:27 +02:00
|
|
|
**
|
2011-05-06 15:05:37 +02:00
|
|
|
** Copyright (c) 2011 Nokia Corporation and/or its subsidiary(-ies).
|
2011-04-04 14:39:27 +02:00
|
|
|
**
|
2011-05-06 15:05:37 +02:00
|
|
|
** Contact: Nokia Corporation (info@qt.nokia.com)
|
2011-04-04 14:39:27 +02:00
|
|
|
**
|
|
|
|
|
**
|
|
|
|
|
** GNU Lesser General Public License Usage
|
|
|
|
|
**
|
2011-05-06 15:05:37 +02:00
|
|
|
** 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, Nokia gives you certain additional
|
|
|
|
|
** rights. These rights are described in the Nokia Qt LGPL Exception
|
|
|
|
|
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
|
|
|
|
|
**
|
|
|
|
|
** Other Usage
|
|
|
|
|
**
|
|
|
|
|
** Alternatively, this file may be used in accordance with the terms and
|
|
|
|
|
** conditions contained in a signed written agreement between you and Nokia.
|
2011-04-04 14:39:27 +02:00
|
|
|
**
|
2011-05-06 15:05:37 +02:00
|
|
|
** If you have questions regarding the use of this file, please contact
|
|
|
|
|
** Nokia at info@qt.nokia.com.
|
2011-04-04 14:39:27 +02:00
|
|
|
**
|
|
|
|
|
**************************************************************************/
|
|
|
|
|
|
|
|
|
|
#ifndef VALGRIND_CALLGRIND_CALLGRINDPROXYMODEL_H
|
|
|
|
|
#define VALGRIND_CALLGRIND_CALLGRINDPROXYMODEL_H
|
|
|
|
|
|
|
|
|
|
#include <QSortFilterProxyModel>
|
|
|
|
|
|
|
|
|
|
#include "../valgrind_global.h"
|
|
|
|
|
|
|
|
|
|
namespace Valgrind {
|
|
|
|
|
namespace Callgrind {
|
|
|
|
|
|
|
|
|
|
class DataModel;
|
|
|
|
|
class Function;
|
|
|
|
|
|
|
|
|
|
class VALGRINDSHARED_EXPORT DataProxyModel : public QSortFilterProxyModel
|
|
|
|
|
{
|
|
|
|
|
Q_OBJECT
|
|
|
|
|
|
|
|
|
|
public:
|
|
|
|
|
explicit DataProxyModel(QObject *parent = 0);
|
|
|
|
|
|
|
|
|
|
virtual void setSourceModel(QAbstractItemModel *sourceModel);
|
|
|
|
|
|
|
|
|
|
QString filterBaseDir() const { return m_baseDir; }
|
|
|
|
|
const Function *filterFunction() const;
|
|
|
|
|
int filterMaximumRows() const { return m_maxRows; }
|
|
|
|
|
|
|
|
|
|
/// Only functions with an inclusive cost ratio above this minimum will be shown in the model
|
|
|
|
|
double minimumInclusiveCostRatio() const { return m_minimumInclusiveCostRatio; }
|
|
|
|
|
|
|
|
|
|
public Q_SLOTS:
|
|
|
|
|
/// This will filter out all entries that are not located within \param baseDir
|
|
|
|
|
void setFilterBaseDir(const QString& baseDir);
|
|
|
|
|
void setFilterFunction(const Function *call);
|
|
|
|
|
void setFilterMaximumRows(int rows);
|
|
|
|
|
|
|
|
|
|
/// Only rows with a inclusive cost ratio above @p minimumInclusiveCost will be shown
|
|
|
|
|
/// by this model. If @c 0 is passed as argument, all rows will be shown.
|
|
|
|
|
void setMinimumInclusiveCostRatio(double minimumInclusiveCost);
|
|
|
|
|
|
|
|
|
|
Q_SIGNALS:
|
|
|
|
|
void filterFunctionChanged(const Function *previous, const Function *current);
|
|
|
|
|
void filterMaximumRowsChanged(int rows);
|
|
|
|
|
|
|
|
|
|
protected:
|
|
|
|
|
virtual bool filterAcceptsRow(int source_row, const QModelIndex &source_parent) const;
|
|
|
|
|
|
|
|
|
|
private:
|
|
|
|
|
DataModel *dataModel() const;
|
|
|
|
|
|
|
|
|
|
QString m_baseDir;
|
|
|
|
|
const Function *m_function;
|
|
|
|
|
int m_maxRows;
|
|
|
|
|
double m_minimumInclusiveCostRatio;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#endif // VALGRIND_CALLGRIND_CALLGRINDPROXYMODEL_H
|