OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:m_numSubpatterns
(Results
1 - 9
of
9
) sorted by null
/external/webkit/JavaScriptCore/wrec/
WRECParser.h
65
void recordSubpattern() { ++
m_numSubpatterns
; }
66
unsigned numSubpatterns() const { return
m_numSubpatterns
; }
112
m_numSubpatterns
= 0;
206
unsigned
m_numSubpatterns
;
WRECParser.cpp
418
if (peekDigit() >
m_numSubpatterns
|| inCharacterClass) {
427
if (newValue >
m_numSubpatterns
)
/external/webkit/JavaScriptCore/runtime/
RegExp.cpp
61
,
m_numSubpatterns
(0)
70
,
m_numSubpatterns
(0)
106
Yarr::jitCompileRegex(globalData, m_regExpJITCode, m_pattern,
m_numSubpatterns
, m_constructionError, ignoreCase(), multiline());
109
m_regExpBytecode.set(Yarr::byteCompileRegex(m_pattern,
m_numSubpatterns
, m_constructionError, ignoreCase(), multiline()));
128
int offsetVectorSize = (
m_numSubpatterns
+ 1) * 3; // FIXME: should be 2 - but adding temporary fallback to pcre.
171
m_wrecFunction = Generator::compileRegExp(globalData, m_pattern, &
m_numSubpatterns
, &m_constructionError, m_executablePool, ignoreCase(), multiline());
181
m_regExp = jsRegExpCompile(reinterpret_cast<const UChar*>(m_pattern.data()), m_pattern.size(), ignoreCaseOption, multilineOption, &
m_numSubpatterns
, &m_constructionError);
196
int offsetVectorSize = (
m_numSubpatterns
+ 1) * 2;
234
offsetVectorSize = (
m_numSubpatterns
+ 1) * 3;
RegExp.h
57
unsigned numSubpatterns() const { return
m_numSubpatterns
; }
70
unsigned
m_numSubpatterns
;
/external/webkit/JavaScriptCore/yarr/
RegexPattern.h
249
,
m_numSubpatterns
(0)
269
m_numSubpatterns
= 0;
288
return m_maxBackReference >
m_numSubpatterns
;
336
unsigned
m_numSubpatterns
;
RegexInterpreter.h
286
:
m_numSubpatterns
(numSubpatterns)
292
unsigned
m_numSubpatterns
;
RegexCompiler.cpp
442
unsigned subpatternId = m_pattern.
m_numSubpatterns
+ 1;
444
m_pattern.
m_numSubpatterns
++;
456
m_alternative->m_terms.append(PatternTerm(PatternTerm::TypeParentheticalAssertion, m_pattern.
m_numSubpatterns
+ 1, parenthesesDisjunction, invert));
466
m_alternative->lastTerm().parentheses.lastSubpatternId = m_pattern.
m_numSubpatterns
;
474
if (subpatternId > m_pattern.
m_numSubpatterns
) {
708
unsigned numSubpatterns = pattern.
m_numSubpatterns
;
717
ASSERT(numSubpatterns == pattern.
m_numSubpatterns
);
RegexInterpreter.cpp
121
unsigned numNestedSubpatterns = term.atom.parenthesesDisjunction->
m_numSubpatterns
;
144
return reinterpret_cast<DisjunctionContext*>(&(subpatternBackup[term.atom.parenthesesDisjunction->
m_numSubpatterns
<< 1]));
153
return new(malloc(sizeof(ParenthesesDisjunctionContext) + (((term.atom.parenthesesDisjunction->
m_numSubpatterns
<< 1) - 1) * sizeof(int)) + sizeof(DisjunctionContext) + (disjunction->m_frameSize - 1) * sizeof(uintptr_t))) ParenthesesDisjunctionContext(output, term);
592
unsigned count = term.atom.parenthesesDisjunction->
m_numSubpatterns
;
598
unsigned count = term.atom.parenthesesDisjunction->
m_numSubpatterns
;
[
all
...]
RegexJIT.cpp
[
all
...]
Completed in 124 milliseconds