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 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406
|
/*
SPDX-FileCopyrightText: 2007 David Nolden <david.nolden.kdevelop@art-master.de>
SPDX-License-Identifier: LGPL-2.0-only
*/
#include "projectfilequickopen.h"
#include <QIcon>
#include <QTextBrowser>
#include <KLocalizedString>
#include <interfaces/iprojectcontroller.h>
#include <interfaces/idocumentcontroller.h>
#include <interfaces/iproject.h>
#include <interfaces/icore.h>
#include <language/duchain/topducontext.h>
#include <language/duchain/duchain.h>
#include <language/duchain/duchainlock.h>
#include <serialization/indexedstring.h>
#include <language/duchain/parsingenvironment.h>
#include <util/algorithm.h>
#include <util/texteditorhelpers.h>
#include <project/projectmodel.h>
#include <project/projectutils.h>
#include "../openwith/iopenwith.h"
#include <timsort/timsort.hpp>
#include <algorithm>
#include <iterator>
#include <type_traits>
#include <utility>
#include <vector>
using namespace KDevelop;
namespace {
template<typename IndexedPath = IndexedString>
QSet<IndexedPath> openFiles()
{
QSet<IndexedPath> openFiles;
const QList<IDocument*>& docs = ICore::self()->documentController()->openDocuments();
openFiles.reserve(docs.size());
for (IDocument* doc : docs) {
openFiles << IndexedPath{doc->url()};
}
return openFiles;
}
QString iconNameForPath(IndexedStringView indexedPath)
{
if (indexedPath.isEmpty()) {
return QStringLiteral("tab-duplicate");
}
const auto* const item = ICore::self()->projectController()->projectModel()->itemForPath(indexedPath);
if (item) {
return item->iconName();
}
return QStringLiteral("unknown");
}
}
ProjectFile::ProjectFile(const ProjectFileItem* fileItem)
: path{fileItem->path()}
, projectPath{fileItem->project()->path()}
, indexedPath{fileItem->indexedPathView()}
, outsideOfProject{!projectPath.isParentOf(path)}
{
}
ProjectFileData::ProjectFileData(const ProjectFile& file)
: m_file(file)
{
}
QString ProjectFileData::text() const
{
return m_file.projectPath.relativePath(m_file.path);
}
QString ProjectFileData::htmlDescription() const
{
return
QLatin1String("<small><small>") +
i18nc("%1: project name", "Project %1", project()) +
QLatin1String("</small></small>");
}
bool ProjectFileData::execute(QString& filterText)
{
const QUrl url = m_file.path.toUrl();
IOpenWith::openFiles(QList<QUrl>() << url);
auto cursor = KTextEditorHelpers::extractCursor(filterText);
if (cursor.isValid()) {
IDocument* doc = ICore::self()->documentController()->documentForUrl(url);
if (doc) {
doc->setCursorPosition(cursor);
}
}
return true;
}
bool ProjectFileData::isExpandable() const
{
return true;
}
QList<QVariant> ProjectFileData::highlighting() const
{
QTextCharFormat boldFormat;
boldFormat.setFontWeight(QFont::Bold);
QTextCharFormat normalFormat;
QString txt = text();
int fileNameLength = m_file.path.lastPathSegment().length();
const QList<QVariant> ret{
0,
txt.length() - fileNameLength,
QVariant(normalFormat),
txt.length() - fileNameLength,
fileNameLength,
QVariant(boldFormat),
};
return ret;
}
QWidget* ProjectFileData::expandingWidget() const
{
const QUrl url = m_file.path.toUrl();
DUChainReadLocker lock;
///Find a du-chain for the document
const QList<TopDUContext*> contexts = DUChain::self()->chainsForDocument(url);
///Pick a non-proxy context
TopDUContext* chosen = nullptr;
for (TopDUContext* ctx : contexts) {
if (!(ctx->parsingEnvironmentFile() && ctx->parsingEnvironmentFile()->isProxyContext())) {
chosen = ctx;
}
}
if (chosen) {
// TODO: show project name, by introducing a generic wrapper widget that supports QuickOpenEmbeddedWidgetInterface
return chosen->createNavigationWidget();
} else {
auto* ret = new QTextBrowser();
ret->resize(400, 100);
ret->setText(
QLatin1String("<small><small>")
+ i18nc("%1: project name", "Project %1", project())
+ QLatin1String("<br>") + i18n("Not parsed yet")
+ QLatin1String("</small></small>"));
return ret;
}
return nullptr;
}
QIcon ProjectFileData::icon() const
{
return QIcon::fromTheme(iconNameForPath(m_file.indexedPath));
}
QString ProjectFileData::project() const
{
const IProject* project = ICore::self()->projectController()->findProjectForUrl(m_file.path.toUrl());
if (project) {
return project->name();
} else {
return i18nc("@item no project", "none");
}
}
Path ProjectFileData::projectPath() const
{
return m_file.projectPath;
}
BaseFileDataProvider::BaseFileDataProvider()
{
}
void BaseFileDataProvider::setFilterText(const QString& text)
{
int pathLength;
KTextEditorHelpers::extractCursor(text, &pathLength);
QString path(text.mid(0, pathLength));
if (path.startsWith(QLatin1String("./")) || path.startsWith(QLatin1String("../"))) {
// assume we want to filter relative to active document's url
IDocument* doc = ICore::self()->documentController()->activeDocument();
if (doc) {
path = Path(Path(doc->url()).parent(), path).pathOrUrl();
}
}
setFilter(path.split(QLatin1Char('/'), Qt::SkipEmptyParts));
}
uint BaseFileDataProvider::itemCount() const
{
return filteredItems().count();
}
uint BaseFileDataProvider::unfilteredItemCount() const
{
return items().count();
}
QuickOpenDataPointer BaseFileDataProvider::data(uint row) const
{
return QuickOpenDataPointer(new ProjectFileData(filteredItems().at(row)));
}
ProjectFileDataProvider::ProjectFileDataProvider()
{
auto projectController = ICore::self()->projectController();
connect(projectController, &IProjectController::projectClosing,
this, &ProjectFileDataProvider::projectClosing);
connect(projectController, &IProjectController::projectOpened,
this, &ProjectFileDataProvider::projectOpened);
const auto projects = projectController->projects();
for (auto* project : projects) {
projectOpened(project);
}
}
void ProjectFileDataProvider::projectClosing(IProject* project)
{
// Once we remove all project's files from set, there is no need to listen
// to &IProject::fileRemovedFromSet signal from this project and waste time
// searching in m_projectFiles. No need to listen to &IProject::fileAddedToSet
// signal from this project either - we are not interested in hypothetical
// file additions to the project that is about to be closed and destroyed.
disconnect(project, nullptr, this, nullptr);
if (ICore::self()->projectController()->projectCount() == 0) {
// No open projects left => just remove all files. This is a little faster
// than the algorithm below. Releasing the memory here would slow down the
// next call to projectOpened() => keep the capacity of m_projectFiles.
m_projectFiles.clear();
return;
}
const Path projectPath = project->path();
const auto logicalEnd = std::remove_if(m_projectFiles.begin(), m_projectFiles.end(),
[&projectPath](const ProjectFile& f) {
return f.projectPath == projectPath;
});
m_projectFiles.erase(logicalEnd, m_projectFiles.end());
}
void ProjectFileDataProvider::projectOpened(IProject* project)
{
connect(project, &IProject::fileAddedToSet,
this, &ProjectFileDataProvider::fileAddedToSet);
connect(project, &IProject::fileRemovedFromSet,
this, &ProjectFileDataProvider::fileRemovedFromSet);
// Collect the opened project's files.
const auto oldSize = m_projectFiles.size();
KDevelop::forEachFile(project->projectItem(), [this](ProjectFileItem* fileItem) {
// TODO Qt6: benchmark the following alternatives:
// 1) emplace_back in place of push_back here;
// 2) std::vector instead of QVector m_projectFiles, i.e. revert fdb3126371bb13b778ce48f538d4836b92a384f1.
m_projectFiles.push_back(ProjectFile{fileItem});
});
const auto justAddedBegin = m_projectFiles.begin() + oldSize;
// Sort the opened project's files.
// Sorting stability is not useful here, but timsort vastly outperforms all
// std and boost sorting algorithms (boost::sort::flat_stable_sort is the
// second best) on the files of large real-life projects, because
// KDevelop::forEachFile() collects files in an almost sorted order.
gfx::timsort(justAddedBegin, m_projectFiles.end());
// Merge the sorted ranges of files belonging to previously opened projects
// and to the just opened project.
// Since the file sets from different projects usually don't overlap or overlap
// very little, timmerge is the perfect merge algorithm. Furthermore, the
// comparison of ProjectFile objects is expensive and cache-unfriendly. This
// aspect lets timmerge outperform std::inplace_merge even more here. This same
// aspect also helps timsort outperform other sorting algorithms.
gfx::timmerge(m_projectFiles.begin(), justAddedBegin, m_projectFiles.end());
// Remove duplicates across all open projects. Usually different projects have no
// common files. But since a file can belong to multiple targets within one project,
// a single call to KDevelop::forEachFile() often produces many duplicates.
const auto equalFiles = [](const ProjectFile& a, const ProjectFile& b) {
return a.indexedPath == b.indexedPath;
};
m_projectFiles.erase(std::unique(m_projectFiles.begin(), m_projectFiles.end(), equalFiles),
m_projectFiles.end());
}
void ProjectFileDataProvider::fileAddedToSet(ProjectFileItem* fileItem)
{
ProjectFile f(fileItem);
auto it = std::lower_bound(m_projectFiles.begin(), m_projectFiles.end(), f);
if (it == m_projectFiles.end() || it->indexedPath != f.indexedPath) {
m_projectFiles.insert(it, std::move(f));
}
}
void ProjectFileDataProvider::fileRemovedFromSet(ProjectFileItem* file)
{
ProjectFile item;
item.path = file->path();
item.indexedPath = file->indexedPathView();
// fast-path for non-generated files
// NOTE: figuring out whether something is generated is expensive... and since
// generated files are rare we apply this two-step algorithm here
auto it = std::lower_bound(m_projectFiles.begin(), m_projectFiles.end(), item);
if (it != m_projectFiles.end() && it->indexedPath == item.indexedPath) {
m_projectFiles.erase(it);
return;
}
// last try: maybe it was generated
item.outsideOfProject = true;
it = std::lower_bound(m_projectFiles.begin(), m_projectFiles.end(), item);
if (it != m_projectFiles.end() && it->indexedPath == item.indexedPath) {
m_projectFiles.erase(it);
return;
}
}
void ProjectFileDataProvider::reset()
{
updateItems([this](QVector<ProjectFile>& closedFiles) {
const auto open = openFiles<IndexedStringView>();
// Don't "optimize" by assigning m_projectFiles to closedFiles and
// returning early if there are no open files. Such an optimization may
// speed up this call to reset() sometimes - if the destruction of the
// previous data of closedFiles doesn't take long for some reason. But
// this "optimization" will discard the current elements and capacity of
// closedFiles, eventually will trigger an extra allocation and
// construction of many ProjectFile objects: when a project is opened or
// closed, when a file is added to/removed from a project, or when a
// file is opened and reset() is called again. See also the
// documentation of PathFilter::updateItems().
closedFiles.resize(m_projectFiles.size());
const auto logicalEnd = std::remove_copy_if(
m_projectFiles.cbegin(), m_projectFiles.cend(),
closedFiles.begin(), [&open](const ProjectFile& f) {
return open.contains(f.indexedPath);
});
closedFiles.erase(logicalEnd, closedFiles.end());
});
}
QSet<IndexedString> ProjectFileDataProvider::files() const
{
const auto projects = ICore::self()->projectController()->projects();
if (projects.empty()) {
return {}; // don't call openFiles() needlessly
}
std::vector<QSet<IndexedString>> sets;
sets.reserve(projects.size());
std::transform(projects.cbegin(), projects.cend(), std::back_inserter(sets),
[](const IProject* project) {
return project->fileSet();
});
auto result = Algorithm::unite(std::move(sets));
result.subtract(openFiles());
return result;
}
void OpenFilesDataProvider::reset()
{
updateItems([](QVector<ProjectFile>& currentFiles) {
const auto* const projCtrl = ICore::self()->projectController();
const auto docs = ICore::self()->documentController()->openDocuments();
currentFiles.resize(docs.size());
std::transform(docs.cbegin(), docs.cend(), currentFiles.begin(),
[projCtrl](const IDocument* doc) {
ProjectFile f;
const QUrl docUrl = doc->url();
f.path = Path(docUrl);
if (const IProject* project = projCtrl->findProjectForUrl(docUrl)) {
f.projectPath = project->path();
}
return f;
});
std::sort(currentFiles.begin(), currentFiles.end());
});
}
QSet<IndexedString> OpenFilesDataProvider::files() const
{
return openFiles();
}
#include "moc_projectfilequickopen.cpp"
|