forked from nodejs/node
/
regexp-macro-assembler-riscv64.cc
1316 lines (1167 loc) · 49.9 KB
/
regexp-macro-assembler-riscv64.cc
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
// Copyright 2021 the V8 project authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#if V8_TARGET_ARCH_RISCV64
#include "src/regexp/riscv64/regexp-macro-assembler-riscv64.h"
#include "src/codegen/assembler-inl.h"
#include "src/codegen/macro-assembler.h"
#include "src/logging/log.h"
#include "src/objects/objects-inl.h"
#include "src/regexp/regexp-macro-assembler.h"
#include "src/regexp/regexp-stack.h"
#include "src/snapshot/embedded/embedded-data.h"
#include "src/strings/unicode.h"
namespace v8 {
namespace internal {
/* clang-format off
*
* This assembler uses the following register assignment convention
* - s3 : kScratchReg. Temporarily stores the index of capture start after a matching pass
* for a global regexp.
* - s4 : Pointer to current Code object including heap object tag.
* - s1 : Current position in input, as negative offset from end of string.
* Please notice that this is the byte offset, not the character offset!
* - s2 : Currently loaded character. Must be loaded using
* LoadCurrentCharacter before using any of the dispatch methods.
* - t0 : Points to tip of backtrack stack
* - t1 : Unused.
* - t2 : End of input (points to byte after last character in input).
* - fp : Frame pointer. Used to access arguments, local variables and
* RegExp registers.
* - sp : Points to tip of C stack.
*
* The remaining registers are free for computations.
* Each call to a public method should retain this convention.
*
* The stack will have the following structure:
*
* kStackFrameHeader
* --- sp when called ---
* - fp[72] ra Return from RegExp code (ra). kReturnAddress
* - fp[64] s9, old-fp Old fp, callee saved(s9).
* - fp[0..63] fp..s7 Callee-saved registers fp..s7.
* --- frame pointer ----
* - fp[-8] Isolate* isolate (address of the current isolate) kIsolate
* - fp[-16] direct_call (1 = direct call from JS, 0 = from runtime) kDirectCall
* - fp[-24] output_size (may fit multiple sets of matches) kNumOutputRegisters
* - fp[-32] int* output (int[num_saved_registers_], for output). kRegisterOutput
* - fp[-40] end of input (address of end of string). kInputEnd
* - fp[-48] start of input (address of first character in string). kInputStart
* - fp[-56] start index (character index of start). kStartIndex
* - fp[-64] void* input_string (location of a handle containing the string). kInputString
* - fp[-72] success counter (only for global regexps to count matches). kSuccessfulCaptures
* - fp[-80] Offset of location before start of input (effectively character kStringStartMinusOne
* position -1). Used to initialize capture registers to a
* non-position.
* --------- The following output registers are 32-bit values. ---------
* - fp[-88] register 0 (Only positions must be stored in the first kRegisterZero
* - register 1 num_saved_registers_ registers)
* - ...
* - register num_registers-1
* --- sp ---
*
* The first num_saved_registers_ registers are initialized to point to
* "character -1" in the string (i.e., char_size() bytes before the first
* character of the string). The remaining registers start out as garbage.
*
* The data up to the return address must be placed there by the calling
* code and the remaining arguments are passed in registers, e.g. by calling the
* code entry as cast to a function with the signature:
* int (*match)(String input_string,
* int start_index,
* Address start,
* Address end,
* int* output,
* int output_size,
* bool direct_call = false,
* Isolate* isolate,
* Address regexp);
* The call is performed by NativeRegExpMacroAssembler::Execute()
* (in regexp-macro-assembler.cc) via the GeneratedCode wrapper.
*
* clang-format on
*/
#define __ ACCESS_MASM(masm_)
const int RegExpMacroAssemblerRISCV::kRegExpCodeSize;
RegExpMacroAssemblerRISCV::RegExpMacroAssemblerRISCV(Isolate* isolate,
Zone* zone, Mode mode,
int registers_to_save)
: NativeRegExpMacroAssembler(isolate, zone),
masm_(std::make_unique<MacroAssembler>(
isolate, CodeObjectRequired::kYes,
NewAssemblerBuffer(kRegExpCodeSize))),
no_root_array_scope_(masm_.get()),
mode_(mode),
num_registers_(registers_to_save),
num_saved_registers_(registers_to_save),
entry_label_(),
start_label_(),
success_label_(),
backtrack_label_(),
exit_label_(),
internal_failure_label_() {
DCHECK_EQ(0, registers_to_save % 2);
__ jmp(&entry_label_); // We'll write the entry code later.
// If the code gets too big or corrupted, an internal exception will be
// raised, and we will exit right away.
__ bind(&internal_failure_label_);
__ li(a0, Operand(FAILURE));
__ Ret();
__ bind(&start_label_); // And then continue from here.
}
RegExpMacroAssemblerRISCV::~RegExpMacroAssemblerRISCV() {
// Unuse labels in case we throw away the assembler without calling GetCode.
entry_label_.Unuse();
start_label_.Unuse();
success_label_.Unuse();
backtrack_label_.Unuse();
exit_label_.Unuse();
check_preempt_label_.Unuse();
stack_overflow_label_.Unuse();
internal_failure_label_.Unuse();
fallback_label_.Unuse();
}
int RegExpMacroAssemblerRISCV::stack_limit_slack() {
return RegExpStack::kStackLimitSlack;
}
void RegExpMacroAssemblerRISCV::AdvanceCurrentPosition(int by) {
if (by != 0) {
__ Add64(current_input_offset(), current_input_offset(),
Operand(by * char_size()));
}
}
void RegExpMacroAssemblerRISCV::AdvanceRegister(int reg, int by) {
DCHECK_LE(0, reg);
DCHECK_GT(num_registers_, reg);
if (by != 0) {
__ Ld(a0, register_location(reg));
__ Add64(a0, a0, Operand(by));
__ Sd(a0, register_location(reg));
}
}
void RegExpMacroAssemblerRISCV::Backtrack() {
CheckPreemption();
if (has_backtrack_limit()) {
Label next;
__ Ld(a0, MemOperand(frame_pointer(), kBacktrackCount));
__ Add64(a0, a0, Operand(1));
__ Sd(a0, MemOperand(frame_pointer(), kBacktrackCount));
__ BranchShort(&next, ne, a0, Operand(backtrack_limit()));
// Backtrack limit exceeded.
if (can_fallback()) {
__ jmp(&fallback_label_);
} else {
// Can't fallback, so we treat it as a failed match.
Fail();
}
__ bind(&next);
}
// Pop Code offset from backtrack stack, add Code and jump to location.
Pop(a0);
__ Add64(a0, a0, code_pointer());
__ Jump(a0);
}
void RegExpMacroAssemblerRISCV::Bind(Label* label) { __ bind(label); }
void RegExpMacroAssemblerRISCV::CheckCharacter(uint32_t c, Label* on_equal) {
BranchOrBacktrack(on_equal, eq, current_character(), Operand(c));
}
void RegExpMacroAssemblerRISCV::CheckCharacterGT(base::uc16 limit,
Label* on_greater) {
BranchOrBacktrack(on_greater, gt, current_character(), Operand(limit));
}
void RegExpMacroAssemblerRISCV::CheckAtStart(int cp_offset,
Label* on_at_start) {
__ Ld(a1, MemOperand(frame_pointer(), kStringStartMinusOne));
__ Add64(a0, current_input_offset(),
Operand(-char_size() + cp_offset * char_size()));
BranchOrBacktrack(on_at_start, eq, a0, Operand(a1));
}
void RegExpMacroAssemblerRISCV::CheckNotAtStart(int cp_offset,
Label* on_not_at_start) {
__ Ld(a1, MemOperand(frame_pointer(), kStringStartMinusOne));
__ Add64(a0, current_input_offset(),
Operand(-char_size() + cp_offset * char_size()));
BranchOrBacktrack(on_not_at_start, ne, a0, Operand(a1));
}
void RegExpMacroAssemblerRISCV::CheckCharacterLT(base::uc16 limit,
Label* on_less) {
BranchOrBacktrack(on_less, lt, current_character(), Operand(limit));
}
void RegExpMacroAssemblerRISCV::CheckGreedyLoop(Label* on_equal) {
Label backtrack_non_equal;
__ Lw(a0, MemOperand(backtrack_stackpointer(), 0));
__ BranchShort(&backtrack_non_equal, ne, current_input_offset(), Operand(a0));
__ Add64(backtrack_stackpointer(), backtrack_stackpointer(),
Operand(kIntSize));
__ bind(&backtrack_non_equal);
BranchOrBacktrack(on_equal, eq, current_input_offset(), Operand(a0));
}
void RegExpMacroAssemblerRISCV::CheckNotBackReferenceIgnoreCase(
int start_reg, bool read_backward, bool unicode, Label* on_no_match) {
Label fallthrough;
__ Ld(a0, register_location(start_reg)); // Index of start of capture.
__ Ld(a1, register_location(start_reg + 1)); // Index of end of capture.
__ Sub64(a1, a1, a0); // Length of capture.
// At this point, the capture registers are either both set or both cleared.
// If the capture length is zero, then the capture is either empty or cleared.
// Fall through in both cases.
__ BranchShort(&fallthrough, eq, a1, Operand(zero_reg));
if (read_backward) {
__ Ld(t1, MemOperand(frame_pointer(), kStringStartMinusOne));
__ Add64(t1, t1, a1);
BranchOrBacktrack(on_no_match, le, current_input_offset(), Operand(t1));
} else {
__ Add64(t1, a1, current_input_offset());
// Check that there are enough characters left in the input.
BranchOrBacktrack(on_no_match, gt, t1, Operand(zero_reg));
}
if (mode_ == LATIN1) {
Label success;
Label fail;
Label loop_check;
// a0 - offset of start of capture.
// a1 - length of capture.
__ Add64(a0, a0, Operand(end_of_input_address()));
__ Add64(a2, end_of_input_address(), Operand(current_input_offset()));
if (read_backward) {
__ Sub64(a2, a2, Operand(a1));
}
__ Add64(a1, a0, Operand(a1));
// a0 - Address of start of capture.
// a1 - Address of end of capture.
// a2 - Address of current input position.
Label loop;
__ bind(&loop);
__ Lbu(a3, MemOperand(a0, 0));
__ addi(a0, a0, char_size());
__ Lbu(a4, MemOperand(a2, 0));
__ addi(a2, a2, char_size());
__ BranchShort(&loop_check, eq, a4, Operand(a3));
// Mismatch, try case-insensitive match (converting letters to lower-case).
__ Or(a3, a3, Operand(0x20)); // Convert capture character to lower-case.
__ Or(a4, a4, Operand(0x20)); // Also convert input character.
__ BranchShort(&fail, ne, a4, Operand(a3));
__ Sub64(a3, a3, Operand('a'));
__ BranchShort(&loop_check, Uless_equal, a3, Operand('z' - 'a'));
// Latin-1: Check for values in range [224,254] but not 247.
__ Sub64(a3, a3, Operand(224 - 'a'));
// Weren't Latin-1 letters.
__ BranchShort(&fail, Ugreater, a3, Operand(254 - 224));
// Check for 247.
__ BranchShort(&fail, eq, a3, Operand(247 - 224));
__ bind(&loop_check);
__ Branch(&loop, lt, a0, Operand(a1));
__ jmp(&success);
__ bind(&fail);
GoTo(on_no_match);
__ bind(&success);
// Compute new value of character position after the matched part.
__ Sub64(current_input_offset(), a2, end_of_input_address());
if (read_backward) {
__ Ld(t1, register_location(start_reg)); // Index of start of capture.
__ Ld(a2, register_location(start_reg + 1)); // Index of end of capture.
__ Add64(current_input_offset(), current_input_offset(), Operand(t1));
__ Sub64(current_input_offset(), current_input_offset(), Operand(a2));
}
} else {
DCHECK(mode_ == UC16);
// Put regexp engine registers on stack.
RegList regexp_registers_to_retain = current_input_offset().bit() |
current_character().bit() |
backtrack_stackpointer().bit();
__ MultiPush(regexp_registers_to_retain);
int argument_count = 4;
__ PrepareCallCFunction(argument_count, a2);
// a0 - offset of start of capture.
// a1 - length of capture.
// Put arguments into arguments registers.
// Parameters are
// a0: Address byte_offset1 - Address captured substring's start.
// a1: Address byte_offset2 - Address of current character position.
// a2: size_t byte_length - length of capture in bytes(!).
// a3: Isolate* isolate.
// Address of start of capture.
__ Add64(a0, a0, Operand(end_of_input_address()));
// Length of capture.
__ mv(a2, a1);
// Save length in callee-save register for use on return.
__ mv(s3, a1);
// Address of current input position.
__ Add64(a1, current_input_offset(), Operand(end_of_input_address()));
if (read_backward) {
__ Sub64(a1, a1, Operand(s3));
}
// Isolate.
__ li(a3, Operand(ExternalReference::isolate_address(masm_->isolate())));
{
AllowExternalCallThatCantCauseGC scope(masm_.get());
ExternalReference function =
unicode ? ExternalReference::re_case_insensitive_compare_unicode(
isolate())
: ExternalReference::re_case_insensitive_compare_non_unicode(
isolate());
__ CallCFunction(function, argument_count);
}
// Restore regexp engine registers.
__ MultiPop(regexp_registers_to_retain);
__ li(code_pointer(), Operand(masm_->CodeObject()), CONSTANT_SIZE);
__ Ld(end_of_input_address(), MemOperand(frame_pointer(), kInputEnd));
// Check if function returned non-zero for success or zero for failure.
BranchOrBacktrack(on_no_match, eq, a0, Operand(zero_reg));
// On success, increment position by length of capture.
if (read_backward) {
__ Sub64(current_input_offset(), current_input_offset(), Operand(s3));
} else {
__ Add64(current_input_offset(), current_input_offset(), Operand(s3));
}
}
__ bind(&fallthrough);
}
void RegExpMacroAssemblerRISCV::CheckNotBackReference(int start_reg,
bool read_backward,
Label* on_no_match) {
Label fallthrough;
// Find length of back-referenced capture.
__ Ld(a0, register_location(start_reg));
__ Ld(a1, register_location(start_reg + 1));
__ Sub64(a1, a1, a0); // Length to check.
// At this point, the capture registers are either both set or both cleared.
// If the capture length is zero, then the capture is either empty or cleared.
// Fall through in both cases.
__ BranchShort(&fallthrough, eq, a1, Operand(zero_reg));
if (read_backward) {
__ Ld(t1, MemOperand(frame_pointer(), kStringStartMinusOne));
__ Add64(t1, t1, a1);
BranchOrBacktrack(on_no_match, le, current_input_offset(), Operand(t1));
} else {
__ Add64(t1, a1, current_input_offset());
// Check that there are enough characters left in the input.
BranchOrBacktrack(on_no_match, gt, t1, Operand(zero_reg));
}
// Compute pointers to match string and capture string.
__ Add64(a0, a0, Operand(end_of_input_address()));
__ Add64(a2, end_of_input_address(), Operand(current_input_offset()));
if (read_backward) {
__ Sub64(a2, a2, Operand(a1));
}
__ Add64(a1, a1, Operand(a0));
Label loop;
__ bind(&loop);
if (mode_ == LATIN1) {
__ Lbu(a3, MemOperand(a0, 0));
__ addi(a0, a0, char_size());
__ Lbu(a4, MemOperand(a2, 0));
__ addi(a2, a2, char_size());
} else {
DCHECK(mode_ == UC16);
__ Lhu(a3, MemOperand(a0, 0));
__ addi(a0, a0, char_size());
__ Lhu(a4, MemOperand(a2, 0));
__ addi(a2, a2, char_size());
}
BranchOrBacktrack(on_no_match, ne, a3, Operand(a4));
__ Branch(&loop, lt, a0, Operand(a1));
// Move current character position to position after match.
__ Sub64(current_input_offset(), a2, end_of_input_address());
if (read_backward) {
__ Ld(t1, register_location(start_reg)); // Index of start of capture.
__ Ld(a2, register_location(start_reg + 1)); // Index of end of capture.
__ Add64(current_input_offset(), current_input_offset(), Operand(t1));
__ Sub64(current_input_offset(), current_input_offset(), Operand(a2));
}
__ bind(&fallthrough);
}
void RegExpMacroAssemblerRISCV::CheckNotCharacter(uint32_t c,
Label* on_not_equal) {
BranchOrBacktrack(on_not_equal, ne, current_character(), Operand(c));
}
void RegExpMacroAssemblerRISCV::CheckCharacterAfterAnd(uint32_t c,
uint32_t mask,
Label* on_equal) {
__ And(a0, current_character(), Operand(mask));
Operand rhs = (c == 0) ? Operand(zero_reg) : Operand(c);
BranchOrBacktrack(on_equal, eq, a0, rhs);
}
void RegExpMacroAssemblerRISCV::CheckNotCharacterAfterAnd(uint32_t c,
uint32_t mask,
Label* on_not_equal) {
__ And(a0, current_character(), Operand(mask));
Operand rhs = (c == 0) ? Operand(zero_reg) : Operand(c);
BranchOrBacktrack(on_not_equal, ne, a0, rhs);
}
void RegExpMacroAssemblerRISCV::CheckNotCharacterAfterMinusAnd(
base::uc16 c, base::uc16 minus, base::uc16 mask, Label* on_not_equal) {
DCHECK_GT(String::kMaxUtf16CodeUnit, minus);
__ Sub64(a0, current_character(), Operand(minus));
__ And(a0, a0, Operand(mask));
BranchOrBacktrack(on_not_equal, ne, a0, Operand(c));
}
void RegExpMacroAssemblerRISCV::CheckCharacterInRange(base::uc16 from,
base::uc16 to,
Label* on_in_range) {
__ Sub64(a0, current_character(), Operand(from));
// Unsigned lower-or-same condition.
BranchOrBacktrack(on_in_range, Uless_equal, a0, Operand(to - from));
}
void RegExpMacroAssemblerRISCV::CheckCharacterNotInRange(
base::uc16 from, base::uc16 to, Label* on_not_in_range) {
__ Sub64(a0, current_character(), Operand(from));
// Unsigned higher condition.
BranchOrBacktrack(on_not_in_range, Ugreater, a0, Operand(to - from));
}
void RegExpMacroAssemblerRISCV::CheckBitInTable(Handle<ByteArray> table,
Label* on_bit_set) {
__ li(a0, Operand(table));
if (mode_ != LATIN1 || kTableMask != String::kMaxOneByteCharCode) {
__ And(a1, current_character(), Operand(kTableSize - 1));
__ Add64(a0, a0, a1);
} else {
__ Add64(a0, a0, current_character());
}
__ Lbu(a0, FieldMemOperand(a0, ByteArray::kHeaderSize));
BranchOrBacktrack(on_bit_set, ne, a0, Operand(zero_reg));
}
bool RegExpMacroAssemblerRISCV::CheckSpecialCharacterClass(base::uc16 type,
Label* on_no_match) {
// Range checks (c in min..max) are generally implemented by an unsigned
// (c - min) <= (max - min) check.
switch (type) {
case 's':
// Match space-characters.
if (mode_ == LATIN1) {
// One byte space characters are '\t'..'\r', ' ' and \u00a0.
Label success;
__ BranchShort(&success, eq, current_character(), Operand(' '));
// Check range 0x09..0x0D.
__ Sub64(a0, current_character(), Operand('\t'));
__ BranchShort(&success, Uless_equal, a0, Operand('\r' - '\t'));
// \u00a0 (NBSP).
BranchOrBacktrack(on_no_match, ne, a0, Operand(0x00A0 - '\t'));
__ bind(&success);
return true;
}
return false;
case 'S':
// The emitted code for generic character classes is good enough.
return false;
case 'd':
// Match Latin1 digits ('0'..'9').
__ Sub64(a0, current_character(), Operand('0'));
BranchOrBacktrack(on_no_match, Ugreater, a0, Operand('9' - '0'));
return true;
case 'D':
// Match non Latin1-digits.
__ Sub64(a0, current_character(), Operand('0'));
BranchOrBacktrack(on_no_match, Uless_equal, a0, Operand('9' - '0'));
return true;
case '.': {
// Match non-newlines (not 0x0A('\n'), 0x0D('\r'), 0x2028 and 0x2029).
__ Xor(a0, current_character(), Operand(0x01));
// See if current character is '\n'^1 or '\r'^1, i.e., 0x0B or 0x0C.
__ Sub64(a0, a0, Operand(0x0B));
BranchOrBacktrack(on_no_match, Uless_equal, a0, Operand(0x0C - 0x0B));
if (mode_ == UC16) {
// Compare original value to 0x2028 and 0x2029, using the already
// computed (current_char ^ 0x01 - 0x0B). I.e., check for
// 0x201D (0x2028 - 0x0B) or 0x201E.
__ Sub64(a0, a0, Operand(0x2028 - 0x0B));
BranchOrBacktrack(on_no_match, Uless_equal, a0, Operand(1));
}
return true;
}
case 'n': {
// Match newlines (0x0A('\n'), 0x0D('\r'), 0x2028 and 0x2029).
__ Xor(a0, current_character(), Operand(0x01));
// See if current character is '\n'^1 or '\r'^1, i.e., 0x0B or 0x0C.
__ Sub64(a0, a0, Operand(0x0B));
if (mode_ == LATIN1) {
BranchOrBacktrack(on_no_match, Ugreater, a0, Operand(0x0C - 0x0B));
} else {
Label done;
BranchOrBacktrack(&done, Uless_equal, a0, Operand(0x0C - 0x0B));
// Compare original value to 0x2028 and 0x2029, using the already
// computed (current_char ^ 0x01 - 0x0B). I.e., check for
// 0x201D (0x2028 - 0x0B) or 0x201E.
__ Sub64(a0, a0, Operand(0x2028 - 0x0B));
BranchOrBacktrack(on_no_match, Ugreater, a0, Operand(1));
__ bind(&done);
}
return true;
}
case 'w': {
if (mode_ != LATIN1) {
// Table is 256 entries, so all Latin1 characters can be tested.
BranchOrBacktrack(on_no_match, Ugreater, current_character(),
Operand('z'));
}
ExternalReference map =
ExternalReference::re_word_character_map(isolate());
__ li(a0, Operand(map));
__ Add64(a0, a0, current_character());
__ Lbu(a0, MemOperand(a0, 0));
BranchOrBacktrack(on_no_match, eq, a0, Operand(zero_reg));
return true;
}
case 'W': {
Label done;
if (mode_ != LATIN1) {
// Table is 256 entries, so all Latin1 characters can be tested.
__ BranchShort(&done, Ugreater, current_character(), Operand('z'));
}
ExternalReference map =
ExternalReference::re_word_character_map(isolate());
__ li(a0, Operand(map));
__ Add64(a0, a0, current_character());
__ Lbu(a0, MemOperand(a0, 0));
BranchOrBacktrack(on_no_match, ne, a0, Operand(zero_reg));
if (mode_ != LATIN1) {
__ bind(&done);
}
return true;
}
case '*':
// Match any character.
return true;
// No custom implementation (yet): s(UC16), S(UC16).
default:
return false;
}
}
void RegExpMacroAssemblerRISCV::Fail() {
__ li(a0, Operand(FAILURE));
__ jmp(&exit_label_);
}
void RegExpMacroAssemblerRISCV::LoadRegExpStackPointerFromMemory(Register dst) {
ExternalReference ref =
ExternalReference::address_of_regexp_stack_stack_pointer(isolate());
__ li(dst, Operand(ref));
__ Ld(dst, MemOperand(dst));
}
void RegExpMacroAssemblerRISCV::StoreRegExpStackPointerToMemory(
Register src, Register scratch) {
ExternalReference ref =
ExternalReference::address_of_regexp_stack_stack_pointer(isolate());
__ li(scratch, Operand(ref));
__ Sd(src, MemOperand(scratch));
}
void RegExpMacroAssemblerRISCV::PushRegExpBasePointer(Register scratch1,
Register scratch2) {
LoadRegExpStackPointerFromMemory(scratch1);
ExternalReference ref =
ExternalReference::address_of_regexp_stack_memory_top_address(isolate());
__ li(scratch2, Operand(ref));
__ Ld(scratch2, MemOperand(scratch2));
__ Sub64(scratch2, scratch1, scratch2);
__ Sd(scratch2, MemOperand(frame_pointer(), kRegExpStackBasePointer));
}
void RegExpMacroAssemblerRISCV::PopRegExpBasePointer(Register scratch1,
Register scratch2) {
ExternalReference ref =
ExternalReference::address_of_regexp_stack_memory_top_address(isolate());
__ Ld(scratch1, MemOperand(frame_pointer(), kRegExpStackBasePointer));
__ li(scratch2, ref);
__ Ld(scratch2, MemOperand(scratch2));
__ Add64(scratch1, scratch1, scratch2);
StoreRegExpStackPointerToMemory(scratch1, scratch2);
}
Handle<HeapObject> RegExpMacroAssemblerRISCV::GetCode(Handle<String> source) {
Label return_a0;
if (masm_->has_exception()) {
// If the code gets corrupted due to long regular expressions and lack of
// space on trampolines, an internal exception flag is set. If this case
// is detected, we will jump into exit sequence right away.
__ bind_to(&entry_label_, internal_failure_label_.pos());
} else {
// Finalize code - write the entry point code now we know how many
// registers we need.
// Entry code:
__ bind(&entry_label_);
// Tell the system that we have a stack frame. Because the type is MANUAL,
// no is generated.
FrameScope scope(masm_.get(), StackFrame::MANUAL);
// Actually emit code to start a new stack frame.
// Push arguments
// Save callee-save registers.
// Start new stack frame.
// Store link register in existing stack-cell.
// Order here should correspond to order of offset constants in header file.
// TODO(plind): we save fp..s11, but ONLY use s3 here - use the regs
// or dont save.
RegList registers_to_retain =
fp.bit() | s1.bit() | s2.bit() | s3.bit() | s4.bit() | s5.bit() |
s6.bit() | s7.bit() | s8.bit() /*| s9.bit() | s10.bit() | s11.bit()*/;
DCHECK(NumRegs(registers_to_retain) == kNumCalleeRegsToRetain);
// The remaining arguments are passed in registers, e.g.by calling the code
// entry as cast to a function with the signature:
//
// *int(*match)(String input_string, // a0
// int start_offset, // a1
// byte* input_start, // a2
// byte* input_end, // a3
// int* output, // a4
// int output_size, // a5
// int call_origin, // a6
// Isolate* isolate, // a7
// Address regexp); // on the stack
RegList argument_registers = a0.bit() | a1.bit() | a2.bit() | a3.bit() |
a4.bit() | a5.bit() | a6.bit() | a7.bit();
// According to MultiPush implementation, registers will be pushed in the
// order of ra, fp, then s8, ..., s1, and finally a7,...a0
__ MultiPush(ra.bit() | registers_to_retain | argument_registers);
// Set frame pointer in space for it if this is not a direct call
// from generated code.
__ Add64(frame_pointer(), sp,
Operand(NumRegs(argument_registers) * kSystemPointerSize));
STATIC_ASSERT(kSuccessfulCaptures == kInputString - kSystemPointerSize);
__ mv(a0, zero_reg);
__ push(a0); // Make room for success counter and initialize it to 0.
STATIC_ASSERT(kStringStartMinusOne ==
kSuccessfulCaptures - kSystemPointerSize);
__ push(a0); // Make room for "string start - 1" constant.
STATIC_ASSERT(kBacktrackCount == kStringStartMinusOne - kSystemPointerSize);
__ push(a0); // The backtrack counter
STATIC_ASSERT(kRegExpStackBasePointer ==
kBacktrackCount - kSystemPointerSize);
__ push(a0); // The regexp stack base ptr.
// Store the regexp base pointer - we'll later restore it / write it to
// memory when returning from this irregexp code object.
PushRegExpBasePointer(a0, a1);
// Check if we have space on the stack for registers.
Label stack_limit_hit;
Label stack_ok;
ExternalReference stack_limit =
ExternalReference::address_of_jslimit(masm_->isolate());
__ li(a0, Operand(stack_limit));
__ Ld(a0, MemOperand(a0));
__ Sub64(a0, sp, a0);
// Handle it if the stack pointer is already below the stack limit.
__ BranchShort(&stack_limit_hit, le, a0, Operand(zero_reg));
// Check if there is room for the variable number of registers above
// the stack limit.
__ BranchShort(&stack_ok, Ugreater_equal, a0,
Operand(num_registers_ * kSystemPointerSize));
// Exit with OutOfMemory exception. There is not enough space on the stack
// for our working registers.
__ li(a0, Operand(EXCEPTION));
__ jmp(&return_a0);
__ bind(&stack_limit_hit);
CallCheckStackGuardState(a0);
// If returned value is non-zero, we exit with the returned value as result.
__ Branch(&return_a0, ne, a0, Operand(zero_reg));
__ bind(&stack_ok);
// Allocate space on stack for registers.
__ Sub64(sp, sp, Operand(num_registers_ * kSystemPointerSize));
// Load string end.
__ Ld(end_of_input_address(), MemOperand(frame_pointer(), kInputEnd));
// Load input start.
__ Ld(a0, MemOperand(frame_pointer(), kInputStart));
// Find negative length (offset of start relative to end).
__ Sub64(current_input_offset(), a0, end_of_input_address());
// Set a0 to address of char before start of the input string
// (effectively string position -1).
__ Ld(a1, MemOperand(frame_pointer(), kStartIndex));
__ Sub64(a0, current_input_offset(), Operand(char_size()));
__ slli(t1, a1, (mode_ == UC16) ? 1 : 0);
__ Sub64(a0, a0, t1);
// Store this value in a local variable, for use when clearing
// position registers.
__ Sd(a0, MemOperand(frame_pointer(), kStringStartMinusOne));
// Initialize code pointer register
__ li(code_pointer(), Operand(masm_->CodeObject()), CONSTANT_SIZE);
Label load_char_start_regexp, start_regexp;
// Load newline if index is at start, previous character otherwise.
__ BranchShort(&load_char_start_regexp, ne, a1, Operand(zero_reg));
__ li(current_character(), Operand('\n'));
__ jmp(&start_regexp);
// Global regexp restarts matching here.
__ bind(&load_char_start_regexp);
// Load previous char as initial value of current character register.
LoadCurrentCharacterUnchecked(-1, 1);
__ bind(&start_regexp);
// Initialize on-stack registers.
if (num_saved_registers_ > 0) { // Always is, if generated from a regexp.
// Fill saved registers with initial value = start offset - 1.
if (num_saved_registers_ > 8) {
// Address of register 0.
__ Add64(a1, frame_pointer(), Operand(kRegisterZero));
__ li(a2, Operand(num_saved_registers_));
Label init_loop;
__ bind(&init_loop);
__ Sd(a0, MemOperand(a1));
__ Add64(a1, a1, Operand(-kSystemPointerSize));
__ Sub64(a2, a2, Operand(1));
__ Branch(&init_loop, ne, a2, Operand(zero_reg));
} else {
for (int i = 0; i < num_saved_registers_; i++) {
__ Sd(a0, register_location(i));
}
}
}
// Initialize backtrack stack pointer.
LoadRegExpStackPointerFromMemory(backtrack_stackpointer());
__ jmp(&start_label_);
// Exit code:
if (success_label_.is_linked()) {
// Save captures when successful.
__ bind(&success_label_);
if (num_saved_registers_ > 0) {
// Copy captures to output.
__ Ld(a1, MemOperand(frame_pointer(), kInputStart));
__ Ld(a0, MemOperand(frame_pointer(), kRegisterOutput));
__ Ld(a2, MemOperand(frame_pointer(), kStartIndex));
__ Sub64(a1, end_of_input_address(), a1);
// a1 is length of input in bytes.
if (mode_ == UC16) {
__ srli(a1, a1, 1);
}
// a1 is length of input in characters.
__ Add64(a1, a1, Operand(a2));
// a1 is length of string in characters.
DCHECK_EQ(0, num_saved_registers_ % 2);
// Always an even number of capture registers. This allows us to
// unroll the loop once to add an operation between a load of a register
// and the following use of that register.
for (int i = 0; i < num_saved_registers_; i += 2) {
__ Ld(a2, register_location(i));
__ Ld(a3, register_location(i + 1));
if (i == 0 && global_with_zero_length_check()) {
// Keep capture start in a4 for the zero-length check later.
__ mv(s3, a2);
}
if (mode_ == UC16) {
__ srai(a2, a2, 1);
__ Add64(a2, a2, a1);
__ srai(a3, a3, 1);
__ Add64(a3, a3, a1);
} else {
__ Add64(a2, a1, Operand(a2));
__ Add64(a3, a1, Operand(a3));
}
// V8 expects the output to be an int32_t array.
__ Sw(a2, MemOperand(a0));
__ Add64(a0, a0, kIntSize);
__ Sw(a3, MemOperand(a0));
__ Add64(a0, a0, kIntSize);
}
}
if (global()) {
// Restart matching if the regular expression is flagged as global.
__ Ld(a0, MemOperand(frame_pointer(), kSuccessfulCaptures));
__ Ld(a1, MemOperand(frame_pointer(), kNumOutputRegisters));
__ Ld(a2, MemOperand(frame_pointer(), kRegisterOutput));
// Increment success counter.
__ Add64(a0, a0, 1);
__ Sd(a0, MemOperand(frame_pointer(), kSuccessfulCaptures));
// Capture results have been stored, so the number of remaining global
// output registers is reduced by the number of stored captures.
__ Sub64(a1, a1, num_saved_registers_);
// Check whether we have enough room for another set of capture results.
__ Branch(&return_a0, lt, a1, Operand(num_saved_registers_));
__ Sd(a1, MemOperand(frame_pointer(), kNumOutputRegisters));
// Advance the location for output.
__ Add64(a2, a2, num_saved_registers_ * kIntSize);
__ Sd(a2, MemOperand(frame_pointer(), kRegisterOutput));
// Prepare a0 to initialize registers with its value in the next run.
__ Ld(a0, MemOperand(frame_pointer(), kStringStartMinusOne));
if (global_with_zero_length_check()) {
// Special case for zero-length matches.
// s3: capture start index
// Not a zero-length match, restart.
__ Branch(&load_char_start_regexp, ne, current_input_offset(),
Operand(s3));
// Offset from the end is zero if we already reached the end.
__ BranchShort(&exit_label_, eq, current_input_offset(),
Operand(zero_reg));
// Advance current position after a zero-length match.
Label advance;
__ bind(&advance);
__ Add64(current_input_offset(), current_input_offset(),
Operand((mode_ == UC16) ? 2 : 1));
if (global_unicode()) CheckNotInSurrogatePair(0, &advance);
}
__ Branch(&load_char_start_regexp);
} else {
__ li(a0, Operand(SUCCESS));
}
}
// Exit and return a0.
__ bind(&exit_label_);
if (global()) {
__ Ld(a0, MemOperand(frame_pointer(), kSuccessfulCaptures));
}
__ bind(&return_a0);
// Restore the original regexp stack pointer value (effectively, pop the
// stored base pointer).
PopRegExpBasePointer(a1, a2);
// Skip sp past regexp registers and local variables..
__ mv(sp, frame_pointer());
// Restore registers fp..s11 and return (restoring ra to pc).
__ MultiPop(registers_to_retain | ra.bit());
__ Ret();
// Backtrack code (branch target for conditional backtracks).
if (backtrack_label_.is_linked()) {
__ bind(&backtrack_label_);
Backtrack();
}
Label exit_with_exception;
// Preempt-code.
if (check_preempt_label_.is_linked()) {
SafeCallTarget(&check_preempt_label_);
StoreRegExpStackPointerToMemory(backtrack_stackpointer(), a1);
// Put regexp engine registers on stack.
RegList regexp_registers_to_retain = current_input_offset().bit() |
current_character().bit() |
backtrack_stackpointer().bit();
__ MultiPush(regexp_registers_to_retain);
CallCheckStackGuardState(a0);
__ MultiPop(regexp_registers_to_retain);
// If returning non-zero, we should end execution with the given
// result as return value.
__ Branch(&return_a0, ne, a0, Operand(zero_reg));
LoadRegExpStackPointerFromMemory(backtrack_stackpointer());
// String might have moved: Reload end of string from frame.
__ Ld(end_of_input_address(), MemOperand(frame_pointer(), kInputEnd));
__ li(code_pointer(), Operand(masm_->CodeObject()), CONSTANT_SIZE);
SafeReturn();
}
// Backtrack stack overflow code.
if (stack_overflow_label_.is_linked()) {
SafeCallTarget(&stack_overflow_label_);
// Call GrowStack(isolate).
StoreRegExpStackPointerToMemory(backtrack_stackpointer(),
a1);
static constexpr int kNumArguments = 1;
__ PrepareCallCFunction(kNumArguments, 0, a0);
__ li(a0, ExternalReference::isolate_address(isolate()));
ExternalReference grow_stack =
ExternalReference::re_grow_stack(isolate());
__ CallCFunction(grow_stack, kNumArguments);
// If nullptr is returned, we have failed to grow the stack, and must exit
// with a stack-overflow exception.
__ BranchShort(&exit_with_exception, eq, a0, Operand(zero_reg));
// Otherwise use return value as new stack pointer.
__ mv(backtrack_stackpointer(), a0);
// Restore saved registers and continue.
__ li(code_pointer(), Operand(masm_->CodeObject()), CONSTANT_SIZE);
__ Ld(end_of_input_address(), MemOperand(frame_pointer(), kInputEnd));
SafeReturn();
}
if (exit_with_exception.is_linked()) {
// If any of the code above needed to exit with an exception.
__ bind(&exit_with_exception);
// Exit with Result EXCEPTION(-1) to signal thrown exception.
__ li(a0, Operand(EXCEPTION));
__ jmp(&return_a0);
}
if (fallback_label_.is_linked()) {
__ bind(&fallback_label_);
__ li(a0, Operand(FALLBACK_TO_EXPERIMENTAL));
__ jmp(&return_a0);
}
}
CodeDesc code_desc;
masm_->GetCode(isolate(), &code_desc);
Handle<Code> code =
Factory::CodeBuilder(isolate(), code_desc, CodeKind::REGEXP)
.set_self_reference(masm_->CodeObject())
.Build();
LOG(masm_->isolate(),
RegExpCodeCreateEvent(Handle<AbstractCode>::cast(code), source));
return Handle<HeapObject>::cast(code);
}
void RegExpMacroAssemblerRISCV::GoTo(Label* to) {
if (to == nullptr) {
Backtrack();
return;
}
__ jmp(to);
return;
}
void RegExpMacroAssemblerRISCV::IfRegisterGE(int reg, int comparand,
Label* if_ge) {
__ Ld(a0, register_location(reg));
BranchOrBacktrack(if_ge, ge, a0, Operand(comparand));
}
void RegExpMacroAssemblerRISCV::IfRegisterLT(int reg, int comparand,
Label* if_lt) {
__ Ld(a0, register_location(reg));
BranchOrBacktrack(if_lt, lt, a0, Operand(comparand));
}
void RegExpMacroAssemblerRISCV::IfRegisterEqPos(int reg, Label* if_eq) {
__ Ld(a0, register_location(reg));
BranchOrBacktrack(if_eq, eq, a0, Operand(current_input_offset()));
}
RegExpMacroAssembler::IrregexpImplementation
RegExpMacroAssemblerRISCV::Implementation() {
return kRISCVImplementation;