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 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429
|
/*
* This file is part of KDevelop
*
* Copyright 2006 Adam Treat <treat@kde.org>
* Copyright 2006-2008 Hamish Rodda <rodda@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 General Public License for more details.
*
* You should have received a copy of the GNU General Public
* License along with this program; if not, write to the
* Free Software Foundation, Inc.,
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#include "parsejob.h"
#include <cassert>
#include <fcntl.h>
#include <sys/stat.h>
#include <sys/mman.h>
#include <QFile>
#include <QByteArray>
#include <QMutex>
#include <QMutexLocker>
#include <QApplication>
#include <kdebug.h>
#include <klocale.h>
#include <ktexteditor/movinginterface.h>
#include "backgroundparser.h"
#include "parserdependencypolicy.h"
#include "duchain/topducontext.h"
#include "duchain/duchainlock.h"
#include "duchain/duchain.h"
#include "duchain/parsingenvironment.h"
#include <interfaces/foregroundlock.h>
#include <interfaces/icore.h>
#include <interfaces/ilanguagecontroller.h>
#include <codegen/coderepresentation.h>
#include <duchain/declaration.h>
#include <duchain/use.h>
using namespace KTextEditor;
static QMutex minimumFeaturesMutex;
static QHash<KDevelop::IndexedString, QList<KDevelop::TopDUContext::Features> > staticMinimumFeatures;
namespace KDevelop
{
class ParseJobPrivate
{
public:
ParseJobPrivate(const KUrl& url) :
document( IndexedString(url.pathOrUrl()) )
, backgroundParser( 0 )
, abortMutex(new QMutex)
, hasReadContents( false )
, abortRequested( false )
, aborted( false )
, features( TopDUContext::VisibleDeclarationsAndContexts )
{
}
~ParseJobPrivate()
{
delete abortMutex;
}
ReferencedTopDUContext duContext;
KDevelop::IndexedString document;
QString errorMessage;
BackgroundParser* backgroundParser;
QMutex* abortMutex;
ParseJob::Contents contents;
bool hasReadContents : 1;
volatile bool abortRequested : 1;
bool aborted : 1;
TopDUContext::Features features;
QList<QWeakPointer<QObject> > notify;
QWeakPointer<DocumentChangeTracker> tracker;
RevisionReference revision;
RevisionReference previousRevision;
};
ParseJob::ParseJob( const KUrl &url )
: ThreadWeaver::JobSequence(),
d(new ParseJobPrivate(url))
{}
ParseJob::~ParseJob()
{
typedef QWeakPointer<QObject> QObjectPointer;
foreach(const QObjectPointer &p, d->notify)
if(p)
QMetaObject::invokeMethod(p.data(), "updateReady", Qt::QueuedConnection, Q_ARG(KDevelop::IndexedString, d->document), Q_ARG(KDevelop::ReferencedTopDUContext, d->duContext));
delete d;
}
IndexedString ParseJob::document() const
{
return d->document;
}
bool ParseJob::success() const
{
return !d->aborted;
}
void ParseJob::setMinimumFeatures(TopDUContext::Features features)
{
d->features = features;
}
bool ParseJob::hasStaticMinimumFeatures()
{
QMutexLocker lock(&minimumFeaturesMutex);
return ::staticMinimumFeatures.size();
}
TopDUContext::Features ParseJob::staticMinimumFeatures(IndexedString url)
{
QMutexLocker lock(&minimumFeaturesMutex);
TopDUContext::Features features = (TopDUContext::Features)0;
if(::staticMinimumFeatures.contains(url))
foreach(const TopDUContext::Features &f, ::staticMinimumFeatures[url])
features = (TopDUContext::Features)(features | f);
return features;
}
TopDUContext::Features ParseJob::minimumFeatures() const
{
return (TopDUContext::Features)(d->features | staticMinimumFeatures(d->document));
}
void ParseJob::setDuChain(ReferencedTopDUContext duChain)
{
d->duContext = duChain;
}
ReferencedTopDUContext ParseJob::duChain() const
{
return d->duContext;
}
bool ParseJob::abortRequested() const
{
QMutexLocker lock(d->abortMutex);
return d->abortRequested;
}
void ParseJob::requestAbort()
{
QMutexLocker lock(d->abortMutex);
d->abortRequested = true;
}
void ParseJob::abortJob()
{
d->aborted = true;
setFinished(true);
}
void ParseJob::setNotifyWhenReady(QList< QWeakPointer< QObject > > notify
) {
d->notify = notify;
}
void ParseJob::setStaticMinimumFeatures(IndexedString url, TopDUContext::Features features) {
QMutexLocker lock(&minimumFeaturesMutex);
::staticMinimumFeatures[url].append(features);
}
void ParseJob::unsetStaticMinimumFeatures(IndexedString url, TopDUContext::Features features) {
QMutexLocker lock(&minimumFeaturesMutex);
::staticMinimumFeatures[url].removeOne(features);
if(::staticMinimumFeatures[url].isEmpty())
::staticMinimumFeatures.remove(url);
}
KDevelop::ProblemPointer ParseJob::readContents()
{
Q_ASSERT(!d->hasReadContents);
d->hasReadContents = true;
QString localFile(document().toUrl().toLocalFile());
QFileInfo fileInfo( localFile );
QDateTime lastModified = fileInfo.lastModified();
d->tracker = ICore::self()->languageController()->backgroundParser()->trackerForUrl(document());
//Try using an artificial code-representation, which overrides everything else
if(artificialCodeRepresentationExists(document())) {
CodeRepresentation::Ptr repr = createCodeRepresentation(document());
d->contents.contents = repr->text().toUtf8();
kDebug() << "took contents for " << document().str() << " from artificial code-representation";
return KDevelop::ProblemPointer();
}
bool hadTracker = false;
if(d->tracker)
{
ForegroundLock lock;
if(DocumentChangeTracker* t = d->tracker.data())
{
// The file is open in an editor
d->previousRevision = t->revisionAtLastReset();
t->reset(); // Reset the tracker to the current revision
Q_ASSERT(t->revisionAtLastReset());
d->contents.contents = t->textAtLastReset().toUtf8();
d->contents.modification = KDevelop::ModificationRevision( lastModified, t->revisionAtLastReset()->revision() );
d->revision = t->acquireRevision(d->contents.modification.revision);
hadTracker = true;
}
}
if (!hadTracker) {
// We have to load the file from disk
static const int maximumFileSize = 5 * 1024 * 1024; // 5 MB
if (fileInfo.size() > maximumFileSize) {
KDevelop::ProblemPointer p(new Problem());
p->setSource(KDevelop::ProblemData::Disk);
///NOTE: no i18n to get it in for 4.3, will be fixed in 4.4
p->setDescription(QString("Skipped file that is too large: '%1'").arg(localFile));
p->setExplanation(QString("The file is %1 and exceeds the limit of %2.")
.arg(KGlobal::locale()->formatByteSize(fileInfo.size()))
.arg(KGlobal::locale()->formatByteSize(maximumFileSize)));
p->setFinalLocation(DocumentRange(document(), SimpleRange::invalid()));
kWarning( 9007 ) << p->description() << p->explanation();
return p;
}
QFile file( localFile );
if ( !file.open( QIODevice::ReadOnly ) )
{
KDevelop::ProblemPointer p(new Problem());
p->setSource(KDevelop::ProblemData::Disk);
p->setDescription(i18n( "Could not open file '%1'", localFile ));
switch (file.error()) {
case QFile::ReadError:
p->setExplanation(i18n("File could not be read from disk."));
break;
case QFile::OpenError:
p->setExplanation(i18n("File could not be opened."));
break;
case QFile::PermissionsError:
p->setExplanation(i18n("File could not be read from disk due to permissions."));
break;
default:
break;
}
p->setFinalLocation(DocumentRange(document(), SimpleRange::invalid()));
kWarning( 9007 ) << "Could not open file" << document().str() << "(path" << localFile << ")" ;
return p;
}
d->contents.contents = file.readAll(); ///@todo Convert from local encoding to utf-8 if they don't match
d->contents.modification = KDevelop::ModificationRevision(lastModified);
file.close();
}
// To make the parsing more robust, we add some zeroes to the end of the buffer.
d->contents.contents.push_back((char)0);
d->contents.contents.push_back((char)0);
d->contents.contents.push_back((char)0);
d->contents.contents.push_back((char)0);
return KDevelop::ProblemPointer();
}
const KDevelop::ParseJob::Contents& ParseJob::contents() const
{
Q_ASSERT(d->hasReadContents);
return d->contents;
}
struct MovingRangeTranslator : public DUChainVisitor
{
MovingRangeTranslator(qint64 _source, qint64 _target, MovingInterface* _moving) : source(_source), target(_target), moving(_moving) {
}
virtual void visit(DUContext* context) {
translateRange(context);
///@todo Also map import-positions
// Translate uses
uint usesCount = context->usesCount();
for(uint u = 0; u < usesCount; ++u)
{
RangeInRevision r = context->uses()[u].m_range;
translateRange(r);
context->changeUseRange(u, r);
}
}
virtual void visit(Declaration* declaration) {
translateRange(declaration);
}
void translateRange(DUChainBase* object)
{
RangeInRevision r = object->range();
translateRange(r);
object->setRange(r);
}
void translateRange(RangeInRevision& r)
{
moving->transformCursor(r.start.line, r.start.column, MovingCursor::MoveOnInsert, source, target);
moving->transformCursor(r.end.line, r.end.column, MovingCursor::StayOnInsert, source, target);
}
KTextEditor::Range range;
qint64 source;
qint64 target;
MovingInterface* moving;
};
void ParseJob::translateDUChainToRevision(TopDUContext* context)
{
qint64 targetRevision = d->contents.modification.revision;
if(targetRevision == -1)
{
kDebug() << "invalid target revision" << targetRevision;
return;
}
qint64 sourceRevision;
{
DUChainReadLocker duChainLock;
Q_ASSERT(context->parsingEnvironmentFile());
// Cannot map if there is no source revision
sourceRevision = context->parsingEnvironmentFile()->modificationRevision().revision;
if(sourceRevision == -1)
{
kDebug() << "invalid source revision" << sourceRevision;
return;
}
}
if(sourceRevision > targetRevision)
{
kDebug() << "for document" << document().str() << ": source revision is higher than target revision:" << sourceRevision << " > " << targetRevision;
return;
}
ForegroundLock lock;
if(DocumentChangeTracker* t = d->tracker.data())
{
if(!d->previousRevision)
{
kDebug() << "not translating because there is no valid predecessor-revision";
return;
}
if(sourceRevision != d->previousRevision->revision() || !d->previousRevision->valid())
{
kDebug() << "not translating because the document revision does not match the tracker start revision (maybe the document was cleared)";
return;
}
if(!t->holdingRevision(sourceRevision) || !t->holdingRevision(targetRevision))
{
kDebug() << "lost one of the translation revisions, not doing the map";
return;
}
// Perform translation
MovingInterface* moving = t->documentMovingInterface();
DUChainWriteLocker wLock;
MovingRangeTranslator translator(sourceRevision, targetRevision, moving);
context->visit(translator);
QList< ProblemPointer > problems = context->problems();
for(QList< ProblemPointer >::iterator problem = problems.begin(); problem != problems.end(); ++problem)
{
RangeInRevision r = (*problem)->range();
translator.translateRange(r);
(*problem)->setRange(r);
}
// Update the modification revision in the meta-data
ModificationRevision modRev = context->parsingEnvironmentFile()->modificationRevision();
modRev.revision = targetRevision;
context->parsingEnvironmentFile()->setModificationRevision(modRev);
}
}
}
#include "parsejob.moc"
|