Lines Matching defs:string

18 #include "src/objects/js-regexp-string-iterator.h"
223 TNode<RegExpMatchInfo> match_info, TNode<String> string,
239 CAST(CallBuiltin(Builtin::kSubString, context, string, start, end));
247 AllocateRegExpResult(context, num_results, start, string, regexp,
282 string, start_cursor, end_cursor));
434 TNode<Context> context, TNode<JSRegExp> regexp, TNode<String> string,
437 ToDirectStringAssembler to_direct(state(), string);
451 // the maximal string length. If lastIndex > string.length then the matcher
460 TNode<IntPtrT> int_string_length = LoadStringLengthAsWord(string);
501 // Unpack the string if possible.
506 // string. Both depend on whether the string is one- or two-byte.
547 // Check that the irregexp code has been generated for the actual string
577 // Argument 0: Original subject string.
579 TNode<String> arg0 = string;
585 // Argument 2: Start of string data. This argument is ignored in the
590 // Argument 3: End of string data. This argument is ignored in the
690 string);
692 string);
747 var_result = CAST(CallRuntime(target_fn, context, regexp, string,
758 var_result = CAST(CallRuntime(target_fn, context, regexp, string,
768 string, last_index, match_info));
955 // ATOM patterns are guaranteed to not be the empty string (these are
959 // non-empty and thus guaranteed not to match at the end of the string.
1003 auto string = Parameter<String>(Descriptor::kString);
1011 Return(RegExpExecInternal(context, regexp, string, last_index, match_info));
1105 // Allocate a string of the required length and fill it with the
1109 const TNode<String> string = AllocateSeqOneByteString(var_length.value());
1119 StoreNoWriteBarrier(MachineRepresentation::kWord8, string, \
1131 result = string;
1144 return string;
1147 return string;
1407 TNode<String> string, TNode<Number> index, TNode<BoolT> is_unicode,
1426 // {index_plus_one} > {string}.length.
1432 // on all call-sites and can never exceed the length of the string.
1445 TNode<UintPtrT> string_length = Unsigned(LoadStringLengthAsWord(string));
1451 StringCharCodeAt(string, Unsigned(SmiUntag(CAST(index))));
1456 TNode<Int32T> trail = StringCharCodeAt(string, untagged_plus_one);
1476 TNode<String> string, TNode<BoolT> global, TNode<BoolT> full_unicode) {
1498 iterator, JSRegExpStringIterator::kIteratedStringOffset, string);
1517 // JSRegExp, {string} is a String, and {limit} is a Smi.
1519 TNode<Context> context, TNode<JSRegExp> regexp, TNode<String> string,
1542 const TNode<Smi> string_length = LoadStringLengthAsSmi(string);
1544 // If passed the empty {string}, return either an empty array or a singleton
1556 CallBuiltin(Builtin::kRegExpExecInternal, context, regexp, string,
1572 UnsafeStoreFixedArrayElement(fixed_array, 0, string);
1598 // We're done if we've reached the end of the string.
1612 context, regexp, string, next_search_from, CAST(last_match_info),
1639 AdvanceStringIndex(string, next_search_from, is_unicode, true);
1650 array.Push(CallBuiltin(Builtin::kSubString, context, string, from, to));
1686 CallBuiltin(Builtin::kSubString, context, string, from, to);
1721 array.Push(CallBuiltin(Builtin::kSubString, context, string, from, to));