File indexing completed on 2024-05-12 05:43:25

 /*
     Copyright (C) 2015 Volker Krause <vkrause@kde.org>
 
     This program is free software; you can redistribute it and/or modify it
     under the terms of the GNU Library General Public License as published by
     the Free Software Foundation; either version 2 of the License, or (at your
     option) any later version.
 
     This program is distributed in the hope that it will be useful, but WITHOUT
     ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
     FITNESS FOR A PARTICULAR PURPOSE.  See the GNU Library General Public
     License for more details.
 
     You should have received a copy of the GNU General Public License
     along with this program.  If not, see <https://www.gnu.org/licenses/>.
 */
 
 #ifndef LDBENCHMARK_H
 #define LDBENCHMARK_H
 
 #include <QByteArray>
 #include <QStringList>
 #include <QVector>
 
 class QProcess;
 
 class ElfFileSet;
 class ElfFile;
 
 /** Load all libraries in dependency order one by one and measure the needed time. */
 class LDBenchmark
 {
 public:
     void measureFileSet(ElfFileSet *fileSet);
 
     void writeCSV(const QString &fileName);
 
     /** Number of files we have results for. */
     int size() const;
 
     enum class LoadMode { None, Now, Lazy };
     double median(LoadMode mode, int index) const;
     double min(LoadMode mode, int index) const;
     ElfFile* file(int index) const;
 
 private:
     void measure(LoadMode mode, int iterations);
     void readResults(QProcess *proc, LoadMode mode);
 
     ElfFileSet *m_fileSet = nullptr;
 
     struct Result {
         QByteArray fileName;
         QVector<double> lazy;
         QVector<double> now;
     };
     QVector<Result> m_results;
     QStringList m_args;
 };
 
 #endif // LDBENCHMARK_H