Lines Matching refs:index

58                          Handle<String> subject, int index, int32_t* output,
62                                  Handle<String> subject, int index,
65   // Execute a regular expression on the subject, starting from index.
72                              Handle<String> subject, int index, int32_t* output,
81       int index, Handle<RegExpMatchInfo> last_match_info,
304     int index, Handle<RegExpMatchInfo> last_match_info,
306   return ExperimentalRegExp::OneshotExec(isolate, regexp, subject, index,
312                                  Handle<String> subject, int index,
319       return RegExpImpl::AtomExec(isolate, regexp, subject, index,
322       return RegExpImpl::IrregexpExec(isolate, regexp, subject, index,
325       return ExperimentalRegExp::Exec(isolate, regexp, subject, index,
355                             Handle<String> subject, int index, int32_t* output,
357   DCHECK_LE(0, index);
358   DCHECK_LE(index, subject->length());
368   if (index + needle_len > subject->length()) {
378     index =
382                                    needle_content.ToOneByteVector(), index)
384                                    needle_content.ToOneByteVector(), index))
387                                    needle_content.ToUC16Vector(), index)
389                                    needle_content.ToUC16Vector(), index)));
390     if (index == -1) {
393       output[i] = index;
394       output[i + 1] = index + needle_len;
395       index += needle_len;
402                                     Handle<String> subject, int index,
409       AtomExecRaw(isolate, re, subject, index, output_registers, kNumRegisters);
491     return lhs->index() < rhs->index();
505   // name uniqueness). But the capture name map must to be sorted by index.
521     array->set(i * 2 + 1, Smi::FromInt(capture->index()));
658                                 Handle<String> subject, int index,
660   DCHECK_LE(0, index);
661   DCHECK_LE(index, subject->length());
676                                                   output_size, index, isolate);
703               isolate, regexp, subject, output, output_size, index);
1202   int index = current_match_index_ * registers_per_match_;
1205     index -= registers_per_match_;
1207   return &register_array_[index];
1227   uint32_t index = ((hash & (kRegExpResultsCacheSize - 1)) &
1229   if (cache.get(index + kStringOffset) != key_string ||
1230       cache.get(index + kPatternOffset) != key_pattern) {
1231     index =
1232         ((index + kArrayEntriesPerCacheEntry) & (kRegExpResultsCacheSize - 1));
1233     if (cache.get(index + kStringOffset) != key_string ||
1234         cache.get(index + kPatternOffset) != key_pattern) {
1239   *last_match_cache = FixedArray::cast(cache.get(index + kLastMatchOffset));
1240   return cache.get(index + kArrayOffset);
1262   uint32_t index = ((hash & (kRegExpResultsCacheSize - 1)) &
1264   if (cache->get(index + kStringOffset) == Smi::zero()) {
1265     cache->set(index + kStringOffset, *key_string);
1266     cache->set(index + kPatternOffset, *key_pattern);
1267     cache->set(index + kArrayOffset, *value_array);
1268     cache->set(index + kLastMatchOffset, *last_match_cache);
1271         ((index + kArrayEntriesPerCacheEntry) & (kRegExpResultsCacheSize - 1));
1282       cache->set(index + kStringOffset, *key_string);
1283       cache->set(index + kPatternOffset, *key_pattern);
1284       cache->set(index + kArrayOffset, *value_array);
1285       cache->set(index + kLastMatchOffset, *last_match_cache);