cpplocatordata.cpp 5.36 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162
/****************************************************************************
**
** Copyright (C) 2013 Digia Plc and/or its subsidiary(-ies).
** Contact: http://www.qt-project.org/legal
**
** This file is part of Qt Creator.
**
** 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.
**
****************************************************************************/


#include "cpplocatordata.h"

using namespace CppTools;
using namespace CppTools::Internal;

static const int MaxPendingDocuments = 10;

CppLocatorData::CppLocatorData(CppModelManager *modelManager)
    : m_modelManager(modelManager)
    , m_pendingDocumentsMutex(QMutex::Recursive)
{
    m_search.setSymbolsToSearchFor(SymbolSearcher::Enums
                                 | SymbolSearcher::Classes
                                 | SymbolSearcher::Functions);
    m_pendingDocuments.reserve(MaxPendingDocuments);

    connect(m_modelManager, SIGNAL(documentUpdated(CPlusPlus::Document::Ptr)),
            this, SLOT(onDocumentUpdated(CPlusPlus::Document::Ptr)));

    connect(m_modelManager, SIGNAL(aboutToRemoveFiles(QStringList)),
            this, SLOT(onAboutToRemoveFiles(QStringList)));
}

QList<ModelItemInfo> CppLocatorData::enums()
{
    flushPendingDocument(true);
    return allModelItemInfos(m_allEnums);
}

QList<ModelItemInfo> CppLocatorData::classes()
{
    flushPendingDocument(true);
    return allModelItemInfos(m_allClasses);
}

QList<ModelItemInfo> CppLocatorData::functions()
{
    flushPendingDocument(true);
    return allModelItemInfos(m_allFunctions);
}

void CppLocatorData::onDocumentUpdated(const CPlusPlus::Document::Ptr &document)
{
    QMutexLocker locker(&m_pendingDocumentsMutex);

    int i = 0, ei = m_pendingDocuments.size();
    for (; i < ei; ++i) {
        const CPlusPlus::Document::Ptr &doc = m_pendingDocuments.at(i);
        if (doc->fileName() == document->fileName()
                && doc->revision() < document->revision()) {
            m_pendingDocuments[i] = document;
            break;
        }
    }

    if (i == ei)
        m_pendingDocuments.append(document);

    flushPendingDocument(false);
}

void CppLocatorData::onAboutToRemoveFiles(const QStringList &files)
{
    QMutexLocker locker(&m_pendingDocumentsMutex);

    for (int i = 0; i < m_pendingDocuments.size(); ) {
        if (files.contains(m_pendingDocuments.at(i)->fileName()))
            m_pendingDocuments.remove(i);
        else
            ++i;
    }

    foreach (const QString &file, files) {
        m_allEnums.remove(file);
        m_allClasses.remove(file);
        m_allFunctions.remove(file);
        removeFilePath(file);
    }
}

void CppLocatorData::flushPendingDocument(bool force)
{
    QMutexLocker locker(&m_pendingDocumentsMutex);
    if (!force && m_pendingDocuments.size() < MaxPendingDocuments)
        return;

    foreach (CPlusPlus::Document::Ptr doc, m_pendingDocuments) {
        const QString fileName = findOrInsertFilePath(doc->fileName());

        QList<ModelItemInfo> resultsEnums;
        QList<ModelItemInfo> resultsClasses;
        QList<ModelItemInfo> resultsFunctions;

        const int sizeHint = m_allEnums[fileName].size() + m_allClasses[fileName].size()
                + m_allFunctions[fileName].size() + 10;
        const QList<ModelItemInfo> results = m_search(doc, sizeHint);
        foreach (const ModelItemInfo &info, results) {
            switch (info.type) {
            case ModelItemInfo::Enum:
                resultsEnums.append(info);
                break;
            case ModelItemInfo::Class:
                resultsClasses.append(info);
                break;
            case ModelItemInfo::Method:
                resultsFunctions.append(info);
                break;
            default:
                break;
            }
        }

        m_allEnums[fileName] = resultsEnums;
        m_allClasses[fileName] = resultsClasses;
        m_allFunctions[fileName] = resultsFunctions;
    }

    m_pendingDocuments.clear();
    m_pendingDocuments.reserve(MaxPendingDocuments);
}

QList<ModelItemInfo> CppLocatorData::allModelItemInfos(const QHash<QString,
                                                       QList<ModelItemInfo> > &items) const
{
    QList<ModelItemInfo> result;
    QHashIterator<QString, QList<ModelItemInfo> > it(items);
    while (it.hasNext()) {
        it.next();
        result.append(it.value());
    }
    return result;
}