You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
494 lines
17 KiB
494 lines
17 KiB
/**
|
|
* Copyright (c) since 2009 Simon Steele - http://untidy.net/
|
|
* Based on the work of Simon Steele for Programmer's Notepad 2 (http://untidy.net)
|
|
* Converted from boost::xpressive to boost::regex and performance improvements
|
|
* (principally caching the compiled regex), and support for UTF8 encoded text
|
|
* (c) 2012 Dave Brotherstone - Changes for boost::regex
|
|
* (c) 2013 Francois-R.Boyer@PolyMtl.ca - Empty match modes and best match backward search
|
|
* (c) 2019 Don Ho - Adapt for upgrading Scitilla (to version 4.1.4) and boost (to version 1.70)
|
|
*
|
|
*/
|
|
|
|
#include <stdlib.h>
|
|
#include <vector>
|
|
#include <memory>
|
|
#include <string_view>
|
|
#include <stdexcept>
|
|
#include "Scintilla.h"
|
|
#include "Platform.h"
|
|
#include "ILoader.h"
|
|
#include "ILexer.h"
|
|
#include "Position.h"
|
|
#include "UniqueString.h"
|
|
#include "SplitVector.h"
|
|
#include "Partitioning.h"
|
|
#include "RunStyles.h"
|
|
#include "ContractionState.h"
|
|
|
|
#include "CellBuffer.h"
|
|
#include "CharClassify.h"
|
|
#include "Decoration.h"
|
|
#include "ILexer.h"
|
|
#include "CaseFolder.h"
|
|
#include "CharacterCategory.h"
|
|
#include "Document.h"
|
|
#include "UniConversion.h"
|
|
#include "UTF8DocumentIterator.h"
|
|
#include "AnsiDocumentIterator.h"
|
|
#include "BoostRegexSearch.h"
|
|
#include <boost/regex.hpp>
|
|
#include <boost/throw_exception.hpp>
|
|
#define CP_UTF8 65001
|
|
#define SC_CP_UTF8 65001
|
|
|
|
using namespace Scintilla;
|
|
using namespace boost;
|
|
|
|
class BoostRegexSearch : public RegexSearchBase
|
|
{
|
|
public:
|
|
BoostRegexSearch() : _substituted(NULL) {}
|
|
|
|
virtual ~BoostRegexSearch()
|
|
{
|
|
delete[] _substituted;
|
|
_substituted = NULL;
|
|
}
|
|
|
|
virtual Sci::Position FindText(Document* doc, Sci::Position minPos, Sci::Position maxPos, const char *regex,
|
|
bool caseSensitive, bool word, bool wordStart, int sciSearchFlags, Sci::Position *lengthRet);
|
|
|
|
virtual const char *SubstituteByPosition(Document* doc, const char *text, Sci::Position *length);
|
|
|
|
private:
|
|
class SearchParameters;
|
|
|
|
class Match : private DocWatcher {
|
|
public:
|
|
Match() : _document(NULL), _documentModified(false), _position(-1), _endPosition(-1), _endPositionForContinuationCheck(-1) {}
|
|
~Match() { setDocument(NULL); }
|
|
Match(Document* document, Sci::Position position = -1, Sci::Position endPosition = -1) : _document(NULL) { set(document, position, endPosition); }
|
|
Match& operator=(Match& m) {
|
|
set(m._document, m.position(), m.endPosition());
|
|
return *this;
|
|
}
|
|
Match& operator=(void* /*nullptr*/) {
|
|
_position = -1;
|
|
return *this;
|
|
}
|
|
|
|
void set(Document* document = NULL, Sci::Position position = -1, Sci::Position endPosition = -1) {
|
|
setDocument(document);
|
|
_position = position;
|
|
_endPositionForContinuationCheck = _endPosition = endPosition;
|
|
_documentModified = false;
|
|
}
|
|
|
|
bool isContinuationSearch(Document* document, Sci::Position startPosition, int direction) {
|
|
if (hasDocumentChanged(document))
|
|
return false;
|
|
if (direction > 0)
|
|
return startPosition == _endPositionForContinuationCheck;
|
|
else
|
|
return startPosition == _position;
|
|
}
|
|
bool isEmpty() {
|
|
return _position == _endPosition;
|
|
}
|
|
Sci::Position position() {
|
|
return _position;
|
|
}
|
|
Sci::Position endPosition() {
|
|
return _endPosition;
|
|
}
|
|
Sci::Position length() {
|
|
return _endPosition - _position;
|
|
}
|
|
int found() {
|
|
return _position >= 0;
|
|
}
|
|
|
|
private:
|
|
bool hasDocumentChanged(Document* currentDocument) {
|
|
return currentDocument != _document || _documentModified;
|
|
}
|
|
void setDocument(Document* newDocument) {
|
|
if (newDocument != _document)
|
|
{
|
|
if (_document != NULL)
|
|
_document->RemoveWatcher(this, NULL);
|
|
_document = newDocument;
|
|
if (_document != NULL)
|
|
_document->AddWatcher(this, NULL);
|
|
}
|
|
}
|
|
|
|
// DocWatcher, so we can track modifications to know if we should consider a search to be a continuation of last search:
|
|
virtual void NotifyModified(Document* modifiedDocument, DocModification mh, void* /*userData*/)
|
|
{
|
|
if (modifiedDocument == _document)
|
|
{
|
|
if (mh.modificationType & (SC_PERFORMED_UNDO | SC_PERFORMED_REDO))
|
|
_documentModified = true;
|
|
// Replacing last found text should not make isContinuationSearch return false.
|
|
else if (mh.modificationType & SC_MOD_DELETETEXT)
|
|
{
|
|
if (mh.position == position() && mh.length == length()) // Deleting what we last found.
|
|
_endPositionForContinuationCheck = _position;
|
|
else _documentModified = true;
|
|
}
|
|
else if (mh.modificationType & SC_MOD_INSERTTEXT)
|
|
{
|
|
if (mh.position == position() && position() == _endPositionForContinuationCheck) // Replace at last found position.
|
|
_endPositionForContinuationCheck += mh.length;
|
|
else _documentModified = true;
|
|
}
|
|
}
|
|
}
|
|
|
|
virtual void NotifyDeleted(Document* deletedDocument, void* /*userData*/) noexcept
|
|
{
|
|
if (deletedDocument == _document)
|
|
{
|
|
// We set the _document here, as we don't want to call the RemoveWatcher on this deleted document.
|
|
// Calling RemoveWatcher inside NotifyDeleted results in a crash, as NotifyDeleted is called whilst
|
|
// iterating on the watchers list (since Scintilla 3.x). Before 3.x, it was just a really bad idea.
|
|
_document = NULL;
|
|
set(NULL);
|
|
}
|
|
}
|
|
virtual void NotifyModifyAttempt(Document* /*document*/, void* /*userData*/) {}
|
|
virtual void NotifySavePoint(Document* /*document*/, void* /*userData*/, bool /*atSavePoint*/) {}
|
|
virtual void NotifyStyleNeeded(Document* /*document*/, void* /*userData*/, Sci::Position /*endPos*/) {}
|
|
virtual void NotifyLexerChanged(Document* /*document*/, void* /*userData*/) {}
|
|
virtual void NotifyErrorOccurred(Document* /*document*/, void* /*userData*/, int /*status*/) {}
|
|
|
|
Document* _document;
|
|
bool _documentModified;
|
|
Sci::Position _position, _endPosition;
|
|
Sci::Position _endPositionForContinuationCheck;
|
|
};
|
|
|
|
class CharTPtr { // Automatically translatable from utf8 to wchar_t*, if required, with allocation and deallocation on destruction; char* is not deallocated.
|
|
public:
|
|
CharTPtr(const char* ptr) : _charPtr(ptr), _wcharPtr(NULL) {}
|
|
~CharTPtr() {
|
|
delete[] _wcharPtr;
|
|
}
|
|
operator const char*() {
|
|
return _charPtr;
|
|
}
|
|
operator const wchar_t*() {
|
|
if (_wcharPtr == NULL)
|
|
_wcharPtr = utf8ToWchar(_charPtr);
|
|
return _wcharPtr;
|
|
}
|
|
private:
|
|
const char* _charPtr;
|
|
wchar_t* _wcharPtr;
|
|
};
|
|
|
|
template <class CharT, class CharacterIterator>
|
|
class EncodingDependent {
|
|
public:
|
|
EncodingDependent() : _lastCompileFlags(-1) {}
|
|
void compileRegex(const char *regex, const int compileFlags);
|
|
Match FindText(SearchParameters& search);
|
|
char *SubstituteByPosition(const char *text, Sci::Position *length);
|
|
private:
|
|
Match FindTextForward(SearchParameters& search);
|
|
Match FindTextBackward(SearchParameters& search);
|
|
|
|
public:
|
|
typedef CharT Char;
|
|
typedef basic_regex<CharT> Regex;
|
|
typedef match_results<CharacterIterator> MatchResults;
|
|
|
|
MatchResults _match;
|
|
private:
|
|
Regex _regex;
|
|
std::string _lastRegexString;
|
|
int _lastCompileFlags;
|
|
};
|
|
|
|
class SearchParameters {
|
|
public:
|
|
Sci::Position nextCharacter(Sci::Position position);
|
|
bool isLineStart(Sci::Position position);
|
|
bool isLineEnd(Sci::Position position);
|
|
|
|
Document* _document;
|
|
const char *_regexString;
|
|
int _compileFlags;
|
|
Sci::Position _startPosition;
|
|
Sci::Position _endPosition;
|
|
regex_constants::match_flag_type _boostRegexFlags;
|
|
int _direction;
|
|
bool _is_allowed_empty;
|
|
bool _is_allowed_empty_at_start_position;
|
|
bool _skip_windows_line_end_as_one_character;
|
|
};
|
|
|
|
static wchar_t *utf8ToWchar(const char *utf8);
|
|
static char *wcharToUtf8(const wchar_t *w);
|
|
static char *stringToCharPtr(const std::string& str);
|
|
static char *stringToCharPtr(const std::wstring& str);
|
|
|
|
EncodingDependent<char, AnsiDocumentIterator> _ansi;
|
|
EncodingDependent<wchar_t, UTF8DocumentIterator> _utf8;
|
|
|
|
char *_substituted;
|
|
|
|
Match _lastMatch;
|
|
int _lastDirection;
|
|
};
|
|
|
|
namespace Scintilla
|
|
{
|
|
#ifdef SCI_OWNREGEX
|
|
RegexSearchBase *CreateRegexSearch(CharClassify* /* charClassTable */)
|
|
{
|
|
return new BoostRegexSearch();
|
|
}
|
|
#endif
|
|
}
|
|
|
|
std::string g_exceptionMessage;
|
|
|
|
/**
|
|
* Find text in document, supporting both forward and backward
|
|
* searches (just pass startPosition > endPosition to do a backward search).
|
|
*/
|
|
|
|
Sci::Position BoostRegexSearch::FindText(Document* doc, Sci::Position startPosition, Sci::Position endPosition, const char *regexString,
|
|
bool caseSensitive, bool /*word*/, bool /*wordStart*/, int sciSearchFlags, Sci::Position *lengthRet)
|
|
{
|
|
g_exceptionMessage.clear();
|
|
try {
|
|
SearchParameters search;
|
|
|
|
search._document = doc;
|
|
|
|
if (startPosition > endPosition
|
|
|| (startPosition == endPosition && _lastDirection < 0)) // If we search in an empty region, suppose the direction is the same as last search (this is only important to verify if there can be an empty match in that empty region).
|
|
{
|
|
search._startPosition = endPosition;
|
|
search._endPosition = startPosition;
|
|
search._direction = -1;
|
|
}
|
|
else
|
|
{
|
|
search._startPosition = startPosition;
|
|
search._endPosition = endPosition;
|
|
search._direction = 1;
|
|
}
|
|
_lastDirection = search._direction;
|
|
|
|
// Range endpoints should not be inside DBCS characters, but just in case, move them.
|
|
search._startPosition = doc->MovePositionOutsideChar(search._startPosition, 1, false);
|
|
search._endPosition = doc->MovePositionOutsideChar(search._endPosition, 1, false);
|
|
|
|
const bool isUtf8 = (doc->CodePage() == SC_CP_UTF8);
|
|
search._compileFlags =
|
|
regex_constants::ECMAScript
|
|
| (caseSensitive ? 0 : regex_constants::icase);
|
|
search._regexString = regexString;
|
|
search._boostRegexFlags =
|
|
((sciSearchFlags & SCFIND_REGEXP_DOTMATCHESNL) ? regex_constants::match_default : regex_constants::match_not_dot_newline);
|
|
|
|
const int empty_match_style = sciSearchFlags & SCFIND_REGEXP_EMPTYMATCH_MASK;
|
|
const int allow_empty_at_start = sciSearchFlags & SCFIND_REGEXP_EMPTYMATCH_ALLOWATSTART;
|
|
|
|
search._is_allowed_empty = empty_match_style != SCFIND_REGEXP_EMPTYMATCH_NONE;
|
|
search._is_allowed_empty_at_start_position = search._is_allowed_empty &&
|
|
(allow_empty_at_start
|
|
|| !_lastMatch.isContinuationSearch(doc, startPosition, search._direction)
|
|
|| (empty_match_style == SCFIND_REGEXP_EMPTYMATCH_ALL && !_lastMatch.isEmpty()) // If last match is empty and this is a continuation, then we would have same empty match at start position, if it was allowed.
|
|
);
|
|
search._skip_windows_line_end_as_one_character = (sciSearchFlags & SCFIND_REGEXP_SKIPCRLFASONE) != 0;
|
|
|
|
Match match =
|
|
isUtf8 ? _utf8.FindText(search)
|
|
: _ansi.FindText(search);
|
|
|
|
if (match.found())
|
|
{
|
|
*lengthRet = match.length();
|
|
_lastMatch = match;
|
|
return match.position();
|
|
}
|
|
else
|
|
{
|
|
_lastMatch = NULL;
|
|
return -1;
|
|
}
|
|
}
|
|
|
|
catch(regex_error& ex)
|
|
{
|
|
// -1 is normally used for not found, -2 is used here for invalid regex
|
|
g_exceptionMessage = ex.what();
|
|
return -2;
|
|
}
|
|
|
|
catch(boost::wrapexcept<std::runtime_error>& ex)
|
|
{
|
|
g_exceptionMessage = ex.what();
|
|
return -3;
|
|
}
|
|
|
|
catch(...)
|
|
{
|
|
g_exceptionMessage = "Unexpected exception while searching";
|
|
return -3;
|
|
}
|
|
}
|
|
|
|
template <class CharT, class CharacterIterator>
|
|
BoostRegexSearch::Match BoostRegexSearch::EncodingDependent<CharT, CharacterIterator>::FindText(SearchParameters& search)
|
|
{
|
|
compileRegex(search._regexString, search._compileFlags);
|
|
return (search._direction > 0)
|
|
? FindTextForward(search)
|
|
: FindTextBackward(search);
|
|
}
|
|
|
|
template <class CharT, class CharacterIterator>
|
|
BoostRegexSearch::Match BoostRegexSearch::EncodingDependent<CharT, CharacterIterator>::FindTextForward(SearchParameters& search)
|
|
{
|
|
CharacterIterator endIterator(search._document, search._endPosition, search._endPosition);
|
|
CharacterIterator baseIterator(search._document, 0, search._endPosition);
|
|
Sci::Position next_search_from_position = search._startPosition;
|
|
bool found = false;
|
|
bool match_is_valid = false;
|
|
do {
|
|
const bool end_reached = next_search_from_position > search._endPosition;
|
|
found = !end_reached && boost::regex_search(CharacterIterator(search._document, next_search_from_position, search._endPosition), endIterator, _match, _regex, search._boostRegexFlags, baseIterator);
|
|
if (found) {
|
|
const Sci::Position position = _match[0].first.pos();
|
|
const Sci::Position length = _match[0].second.pos() - position;
|
|
const bool match_is_non_empty = length != 0;
|
|
const bool is_allowed_empty_here = search._is_allowed_empty && (search._is_allowed_empty_at_start_position || position > search._startPosition);
|
|
match_is_valid = match_is_non_empty || is_allowed_empty_here;
|
|
if (!match_is_valid)
|
|
next_search_from_position = search.nextCharacter(position);
|
|
}
|
|
} while (found && !match_is_valid);
|
|
if (found)
|
|
return Match(search._document, _match[0].first.pos(), _match[0].second.pos());
|
|
else
|
|
return Match();
|
|
}
|
|
|
|
template <class CharT, class CharacterIterator>
|
|
BoostRegexSearch::Match BoostRegexSearch::EncodingDependent<CharT, CharacterIterator>::FindTextBackward(SearchParameters& search)
|
|
{
|
|
// Change backward search into series of forward search. It is slow: search all backward becomes O(n^2) instead of O(n) (if search forward is O(n)).
|
|
//NOTE: Maybe we should cache results. Maybe we could reverse regex to do a real backward search, for simple regex.
|
|
search._direction = 1;
|
|
const bool is_allowed_empty_at_end_position = search._is_allowed_empty_at_start_position;
|
|
search._is_allowed_empty_at_start_position = search._is_allowed_empty;
|
|
|
|
MatchResults bestMatch;
|
|
Sci::Position bestPosition = -1;
|
|
Sci::Position bestEnd = -1;
|
|
for (;;) {
|
|
Match matchRange = FindText(search);
|
|
if (!matchRange.found())
|
|
break;
|
|
Sci::Position position = matchRange.position();
|
|
Sci::Position endPosition = matchRange.endPosition();
|
|
if (endPosition > bestEnd && (endPosition < search._endPosition || position != endPosition || is_allowed_empty_at_end_position)) // We are searching for the longest match which has the fathest end (but may not accept empty match at end position).
|
|
{
|
|
bestMatch = _match;
|
|
bestPosition = position;
|
|
bestEnd = endPosition;
|
|
}
|
|
search._startPosition = search.nextCharacter(position);
|
|
}
|
|
if (bestPosition >= 0)
|
|
return Match(search._document, bestPosition, bestEnd);
|
|
else
|
|
return Match();
|
|
}
|
|
|
|
template <class CharT, class CharacterIterator>
|
|
void BoostRegexSearch::EncodingDependent<CharT, CharacterIterator>::compileRegex(const char *regex, const int compileFlags)
|
|
{
|
|
if (_lastCompileFlags != compileFlags || _lastRegexString != regex)
|
|
{
|
|
_regex = Regex(CharTPtr(regex), static_cast<regex_constants::syntax_option_type>(compileFlags));
|
|
_lastRegexString = regex;
|
|
_lastCompileFlags = compileFlags;
|
|
}
|
|
}
|
|
|
|
Sci::Position BoostRegexSearch::SearchParameters::nextCharacter(Sci::Position position)
|
|
{
|
|
if (_skip_windows_line_end_as_one_character && _document->CharAt(position) == '\r' && _document->CharAt(position+1) == '\n')
|
|
return position + 2;
|
|
else
|
|
return position + 1;
|
|
}
|
|
|
|
bool BoostRegexSearch::SearchParameters::isLineStart(Sci::Position position)
|
|
{
|
|
return (position == 0)
|
|
|| _document->CharAt(position-1) == '\n'
|
|
|| (_document->CharAt(position-1) == '\r' && _document->CharAt(position) != '\n');
|
|
}
|
|
|
|
bool BoostRegexSearch::SearchParameters::isLineEnd(Sci::Position position)
|
|
{
|
|
return (position == _document->Length())
|
|
|| _document->CharAt(position) == '\r'
|
|
|| (_document->CharAt(position) == '\n' && (position == 0 || _document->CharAt(position-1) != '\n'));
|
|
}
|
|
|
|
const char *BoostRegexSearch::SubstituteByPosition(Document* doc, const char *text, Sci::Position *length) {
|
|
delete[] _substituted;
|
|
_substituted = (doc->CodePage() == SC_CP_UTF8)
|
|
? _utf8.SubstituteByPosition(text, length)
|
|
: _ansi.SubstituteByPosition(text, length);
|
|
return _substituted;
|
|
}
|
|
|
|
template <class CharT, class CharacterIterator>
|
|
char *BoostRegexSearch::EncodingDependent<CharT, CharacterIterator>::SubstituteByPosition(const char *text, Sci::Position *length) {
|
|
char *substituted = stringToCharPtr(_match.format((const CharT*)CharTPtr(text), boost::format_all));
|
|
*length = static_cast<int>(strlen(substituted));
|
|
return substituted;
|
|
}
|
|
|
|
wchar_t *BoostRegexSearch::utf8ToWchar(const char *utf8)
|
|
{
|
|
size_t utf8Size = strlen(utf8);
|
|
std::string s(utf8, utf8Size);
|
|
size_t wcharSize = UTF16Length(s);
|
|
wchar_t *w = new wchar_t[wcharSize + 1];
|
|
UTF16FromUTF8(s, w, wcharSize + 1);
|
|
w[wcharSize] = 0;
|
|
return w;
|
|
}
|
|
|
|
char *BoostRegexSearch::wcharToUtf8(const wchar_t *w)
|
|
{
|
|
//int wcharSize = static_cast<int>(wcslen(w));
|
|
std::wstring ws(w);
|
|
size_t charSize = UTF8Length(ws);
|
|
char *c = new char[charSize + 1];
|
|
UTF8FromUTF16(ws, c, charSize);
|
|
c[charSize] = 0;
|
|
return c;
|
|
}
|
|
|
|
char *BoostRegexSearch::stringToCharPtr(const std::string& str)
|
|
{
|
|
char *charPtr = new char[str.length() + 1];
|
|
strcpy(charPtr, str.c_str());
|
|
return charPtr;
|
|
}
|
|
char *BoostRegexSearch::stringToCharPtr(const std::wstring& str)
|
|
{
|
|
return wcharToUtf8(str.c_str());
|
|
} |