2012-10-02 09:12:39 +02:00
|
|
|
/****************************************************************************
|
2009-09-17 12:29:06 +02:00
|
|
|
**
|
2014-01-07 13:27:11 +01:00
|
|
|
** Copyright (C) 2014 Digia Plc and/or its subsidiary(-ies).
|
2012-10-02 09:12:39 +02:00
|
|
|
** Contact: http://www.qt-project.org/legal
|
2009-09-17 12:29:06 +02:00
|
|
|
**
|
2012-10-02 09:12:39 +02:00
|
|
|
** This file is part of Qt Creator.
|
2009-09-17 12:29:06 +02:00
|
|
|
**
|
2012-10-02 09:12:39 +02:00
|
|
|
** 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
|
2014-10-01 13:21:18 +02:00
|
|
|
** conditions see http://www.qt.io/licensing. For further information
|
|
|
|
|
** use the contact form at http://www.qt.io/contact-us.
|
2009-09-17 12:29:06 +02:00
|
|
|
**
|
|
|
|
|
** GNU Lesser General Public License Usage
|
2012-10-02 09:12:39 +02:00
|
|
|
** Alternatively, this file may be used under the terms of the GNU Lesser
|
2014-10-01 13:21:18 +02:00
|
|
|
** General Public License version 2.1 or version 3 as published by the Free
|
|
|
|
|
** Software Foundation and appearing in the file LICENSE.LGPLv21 and
|
|
|
|
|
** LICENSE.LGPLv3 included in the packaging of this file. Please review the
|
|
|
|
|
** following information to ensure the GNU Lesser General Public License
|
|
|
|
|
** requirements will be met: https://www.gnu.org/licenses/lgpl.html and
|
|
|
|
|
** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
|
2012-10-02 09:12:39 +02:00
|
|
|
**
|
|
|
|
|
** In addition, as a special exception, Digia gives you certain additional
|
|
|
|
|
** rights. These rights are described in the Digia Qt LGPL Exception
|
2010-12-17 16:01:08 +01:00
|
|
|
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
|
|
|
|
|
**
|
2012-10-02 09:12:39 +02:00
|
|
|
****************************************************************************/
|
2013-03-27 18:54:03 +01:00
|
|
|
|
2009-09-17 12:29:06 +02:00
|
|
|
#include "BackwardsScanner.h"
|
2013-03-27 18:54:03 +01:00
|
|
|
|
|
|
|
|
#include <cplusplus/Token.h>
|
|
|
|
|
|
2012-02-15 10:42:41 +01:00
|
|
|
#include <QTextCursor>
|
2010-06-07 13:06:21 +02:00
|
|
|
#include <QTextDocument>
|
2009-09-17 12:29:06 +02:00
|
|
|
|
|
|
|
|
using namespace CPlusPlus;
|
|
|
|
|
|
2010-09-09 13:34:20 +02:00
|
|
|
BackwardsScanner::BackwardsScanner(const QTextCursor &cursor,
|
|
|
|
|
int maxBlockCount,
|
|
|
|
|
const QString &suffix,
|
|
|
|
|
bool skipComments)
|
2010-06-29 17:47:59 +02:00
|
|
|
: _offset(0)
|
2009-09-17 12:29:06 +02:00
|
|
|
, _blocksTokenized(0)
|
|
|
|
|
, _block(cursor.block())
|
|
|
|
|
, _maxBlockCount(maxBlockCount)
|
|
|
|
|
{
|
2013-10-06 02:41:22 +02:00
|
|
|
// FIXME: Why these defaults?
|
|
|
|
|
LanguageFeatures features;
|
|
|
|
|
features.qtMocRunEnabled = true;
|
|
|
|
|
features.qtEnabled = true;
|
|
|
|
|
features.qtKeywordsEnabled = true;
|
|
|
|
|
features.objCEnabled = true;
|
|
|
|
|
_tokenize.setLanguageFeatures(features);
|
2010-09-09 13:34:20 +02:00
|
|
|
_tokenize.setSkipComments(skipComments);
|
2010-06-29 17:47:59 +02:00
|
|
|
_text = _block.text().left(cursor.position() - cursor.block().position());
|
2009-09-17 17:57:17 +02:00
|
|
|
|
2010-06-29 17:47:59 +02:00
|
|
|
if (! suffix.isEmpty())
|
|
|
|
|
_text += suffix;
|
2009-09-17 17:57:17 +02:00
|
|
|
|
2014-11-06 09:35:29 +01:00
|
|
|
_tokens += _tokenize(_text, previousBlockState(_block));
|
2009-09-18 11:14:54 +02:00
|
|
|
|
|
|
|
|
_startToken = _tokens.size();
|
2009-09-17 12:29:06 +02:00
|
|
|
}
|
|
|
|
|
|
2010-06-29 17:57:15 +02:00
|
|
|
Token BackwardsScanner::LA(int index) const
|
2009-09-18 11:14:54 +02:00
|
|
|
{ return const_cast<BackwardsScanner *>(this)->fetchToken(_startToken - index); }
|
|
|
|
|
|
2010-06-29 17:57:15 +02:00
|
|
|
Token BackwardsScanner::operator[](int index) const
|
2009-09-18 11:14:54 +02:00
|
|
|
{ return const_cast<BackwardsScanner *>(this)->fetchToken(index); }
|
2009-09-17 15:44:54 +02:00
|
|
|
|
2010-06-29 17:57:15 +02:00
|
|
|
const Token &BackwardsScanner::fetchToken(int tokenIndex)
|
2009-09-17 12:29:06 +02:00
|
|
|
{
|
2010-06-04 09:59:38 +02:00
|
|
|
while (_offset + tokenIndex < 0) {
|
2009-09-17 12:29:06 +02:00
|
|
|
_block = _block.previous();
|
|
|
|
|
if (_blocksTokenized == _maxBlockCount || !_block.isValid()) {
|
|
|
|
|
++_offset;
|
2010-06-29 17:57:15 +02:00
|
|
|
_tokens.prepend(Token()); // sentinel
|
2009-09-17 12:29:06 +02:00
|
|
|
break;
|
|
|
|
|
} else {
|
|
|
|
|
++_blocksTokenized;
|
|
|
|
|
|
2009-12-07 18:26:47 +01:00
|
|
|
QString blockText = _block.text();
|
|
|
|
|
_text.prepend(QLatin1Char('\n'));
|
2009-09-17 12:29:06 +02:00
|
|
|
_text.prepend(blockText);
|
2009-09-21 15:11:18 +02:00
|
|
|
|
2014-11-06 09:35:29 +01:00
|
|
|
Tokens adaptedTokens;
|
2009-09-17 12:29:06 +02:00
|
|
|
for (int i = 0; i < _tokens.size(); ++i) {
|
2010-06-29 17:57:15 +02:00
|
|
|
Token t = _tokens.at(i);
|
2013-12-12 21:37:46 +01:00
|
|
|
t.utf16charOffset += blockText.length() + 1;
|
2009-09-21 15:11:18 +02:00
|
|
|
adaptedTokens.append(t);
|
2009-09-17 12:29:06 +02:00
|
|
|
}
|
|
|
|
|
|
2010-06-29 17:47:59 +02:00
|
|
|
_tokens = _tokenize(blockText, previousBlockState(_block));
|
|
|
|
|
_offset += _tokens.size();
|
2009-09-17 12:29:06 +02:00
|
|
|
_tokens += adaptedTokens;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2010-06-04 09:59:38 +02:00
|
|
|
return _tokens.at(_offset + tokenIndex);
|
2009-09-17 12:29:06 +02:00
|
|
|
}
|
|
|
|
|
|
2009-09-17 15:44:54 +02:00
|
|
|
int BackwardsScanner::startToken() const
|
2009-09-18 11:14:54 +02:00
|
|
|
{ return _startToken; }
|
2009-09-17 15:44:54 +02:00
|
|
|
|
2009-09-17 12:29:06 +02:00
|
|
|
int BackwardsScanner::startPosition() const
|
|
|
|
|
{ return _block.position(); }
|
|
|
|
|
|
2009-09-17 15:44:54 +02:00
|
|
|
QString BackwardsScanner::text() const
|
2009-09-17 12:29:06 +02:00
|
|
|
{ return _text; }
|
|
|
|
|
|
2009-09-21 17:38:25 +02:00
|
|
|
QString BackwardsScanner::mid(int index) const
|
|
|
|
|
{
|
2010-06-29 17:57:15 +02:00
|
|
|
const Token &firstToken = _tokens.at(index + _offset);
|
2013-12-12 21:37:46 +01:00
|
|
|
return _text.mid(firstToken.utf16charsBegin());
|
2009-09-21 17:38:25 +02:00
|
|
|
}
|
|
|
|
|
|
2009-09-21 16:09:01 +02:00
|
|
|
QString BackwardsScanner::text(int index) const
|
2009-09-17 12:29:06 +02:00
|
|
|
{
|
2010-06-29 17:57:15 +02:00
|
|
|
const Token &firstToken = _tokens.at(index + _offset);
|
2013-12-12 21:37:46 +01:00
|
|
|
return _text.mid(firstToken.utf16charsBegin(), firstToken.utf16chars());
|
2009-09-17 12:29:06 +02:00
|
|
|
}
|
|
|
|
|
|
2009-09-21 16:09:01 +02:00
|
|
|
QStringRef BackwardsScanner::textRef(int index) const
|
2009-09-17 15:44:54 +02:00
|
|
|
{
|
2010-06-29 17:57:15 +02:00
|
|
|
const Token &firstToken = _tokens.at(index + _offset);
|
2013-12-12 21:37:46 +01:00
|
|
|
return _text.midRef(firstToken.utf16charsBegin(), firstToken.utf16chars());
|
2009-09-17 15:44:54 +02:00
|
|
|
}
|
|
|
|
|
|
2009-11-02 19:14:40 +01:00
|
|
|
int BackwardsScanner::size() const
|
|
|
|
|
{
|
|
|
|
|
return _tokens.size();
|
|
|
|
|
}
|
|
|
|
|
|
2009-09-17 15:44:54 +02:00
|
|
|
int BackwardsScanner::startOfMatchingBrace(int index) const
|
|
|
|
|
{
|
|
|
|
|
const BackwardsScanner &tk = *this;
|
|
|
|
|
|
|
|
|
|
if (tk[index - 1].is(T_RPAREN)) {
|
|
|
|
|
int i = index - 1;
|
|
|
|
|
int count = 0;
|
|
|
|
|
do {
|
|
|
|
|
if (tk[i].is(T_LPAREN)) {
|
|
|
|
|
if (! ++count)
|
|
|
|
|
return i;
|
|
|
|
|
} else if (tk[i].is(T_RPAREN))
|
|
|
|
|
--count;
|
|
|
|
|
--i;
|
|
|
|
|
} while (count != 0 && tk[i].isNot(T_EOF_SYMBOL));
|
|
|
|
|
} else if (tk[index - 1].is(T_RBRACKET)) {
|
|
|
|
|
int i = index - 1;
|
|
|
|
|
int count = 0;
|
|
|
|
|
do {
|
|
|
|
|
if (tk[i].is(T_LBRACKET)) {
|
|
|
|
|
if (! ++count)
|
|
|
|
|
return i;
|
|
|
|
|
} else if (tk[i].is(T_RBRACKET))
|
|
|
|
|
--count;
|
|
|
|
|
--i;
|
|
|
|
|
} while (count != 0 && tk[i].isNot(T_EOF_SYMBOL));
|
2009-09-21 15:11:18 +02:00
|
|
|
} else if (tk[index - 1].is(T_RBRACE)) {
|
|
|
|
|
int i = index - 1;
|
|
|
|
|
int count = 0;
|
|
|
|
|
do {
|
|
|
|
|
if (tk[i].is(T_LBRACE)) {
|
|
|
|
|
if (! ++count)
|
|
|
|
|
return i;
|
|
|
|
|
} else if (tk[i].is(T_RBRACE))
|
|
|
|
|
--count;
|
|
|
|
|
--i;
|
|
|
|
|
} while (count != 0 && tk[i].isNot(T_EOF_SYMBOL));
|
2009-09-17 15:44:54 +02:00
|
|
|
} else if (tk[index - 1].is(T_GREATER)) {
|
|
|
|
|
int i = index - 1;
|
|
|
|
|
int count = 0;
|
|
|
|
|
do {
|
|
|
|
|
if (tk[i].is(T_LESS)) {
|
|
|
|
|
if (! ++count)
|
|
|
|
|
return i;
|
|
|
|
|
} else if (tk[i].is(T_GREATER))
|
|
|
|
|
--count;
|
|
|
|
|
--i;
|
|
|
|
|
} while (count != 0 && tk[i].isNot(T_EOF_SYMBOL));
|
2009-09-21 15:11:18 +02:00
|
|
|
} else {
|
|
|
|
|
Q_ASSERT(0);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return index;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
int BackwardsScanner::startOfLine(int index) const
|
|
|
|
|
{
|
|
|
|
|
const BackwardsScanner tk(*this);
|
|
|
|
|
|
|
|
|
|
forever {
|
2010-06-29 17:57:15 +02:00
|
|
|
const Token &tok = tk[index - 1];
|
2009-09-21 15:11:18 +02:00
|
|
|
|
|
|
|
|
if (tok.is(T_EOF_SYMBOL))
|
|
|
|
|
break;
|
2010-06-29 17:57:15 +02:00
|
|
|
else if (tok.newline())
|
2009-09-21 15:11:18 +02:00
|
|
|
return index - 1;
|
|
|
|
|
|
|
|
|
|
--index;
|
2009-09-17 15:44:54 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return index;
|
|
|
|
|
}
|
2009-09-21 15:11:18 +02:00
|
|
|
|
|
|
|
|
int BackwardsScanner::startOfBlock(int index) const
|
|
|
|
|
{
|
|
|
|
|
const BackwardsScanner tk(*this);
|
|
|
|
|
|
|
|
|
|
const int start = index;
|
|
|
|
|
|
|
|
|
|
forever {
|
2010-06-29 17:57:15 +02:00
|
|
|
Token token = tk[index - 1];
|
2009-09-21 15:11:18 +02:00
|
|
|
|
|
|
|
|
if (token.is(T_EOF_SYMBOL)) {
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
} else if (token.is(T_GREATER)) {
|
|
|
|
|
const int matchingBrace = startOfMatchingBrace(index);
|
|
|
|
|
|
|
|
|
|
if (matchingBrace != index && tk[matchingBrace - 1].is(T_TEMPLATE))
|
|
|
|
|
index = matchingBrace;
|
|
|
|
|
|
|
|
|
|
} else if (token.is(T_RPAREN) || token.is(T_RBRACKET) || token.is(T_RBRACE)) {
|
|
|
|
|
const int matchingBrace = startOfMatchingBrace(index);
|
|
|
|
|
|
|
|
|
|
if (matchingBrace != index)
|
|
|
|
|
index = matchingBrace;
|
|
|
|
|
|
|
|
|
|
} else if (token.is(T_LPAREN) || token.is(T_LBRACKET)) {
|
|
|
|
|
break; // unmatched brace
|
|
|
|
|
|
|
|
|
|
} else if (token.is(T_LBRACE)) {
|
|
|
|
|
return index - 1;
|
|
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
--index;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return start;
|
|
|
|
|
}
|
|
|
|
|
|
2009-12-07 18:26:47 +01:00
|
|
|
QString BackwardsScanner::indentationString(int index) const
|
2009-09-21 15:11:18 +02:00
|
|
|
{
|
2010-06-29 17:57:15 +02:00
|
|
|
const Token tokenAfterNewline = operator[](startOfLine(index + 1));
|
|
|
|
|
const int newlinePos = qMax(0, _text.lastIndexOf(QLatin1Char('\n'),
|
2013-12-12 21:37:46 +01:00
|
|
|
tokenAfterNewline.utf16charsBegin()));
|
|
|
|
|
return _text.mid(newlinePos, tokenAfterNewline.utf16charsBegin() - newlinePos);
|
2009-09-21 15:11:18 +02:00
|
|
|
}
|
2010-06-29 17:47:59 +02:00
|
|
|
|
|
|
|
|
|
|
|
|
|
int BackwardsScanner::previousBlockState(const QTextBlock &block)
|
|
|
|
|
{
|
|
|
|
|
const QTextBlock prevBlock = block.previous();
|
|
|
|
|
|
|
|
|
|
if (prevBlock.isValid()) {
|
|
|
|
|
int state = prevBlock.userState();
|
|
|
|
|
|
|
|
|
|
if (state != -1)
|
|
|
|
|
return state;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
}
|