forked from MacRuby/MacRuby
-
Notifications
You must be signed in to change notification settings - Fork 0
/
re.c
2203 lines (1955 loc) · 52.9 KB
/
re.c
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
/*
* MacRuby Regular Expressions.
*
* This file is covered by the Ruby license. See COPYING for more details.
*
* Copyright (C) 2007-2010, Apple Inc. All rights reserved.
* Copyright (C) 1993-2007 Yukihiro Matsumoto
*/
#include "unicode/uregex.h"
#include "unicode/ustring.h"
#include "ruby/macruby.h"
#include "ruby/encoding.h"
#include "encoding.h"
#include "objc.h"
#include "re.h"
VALUE rb_eRegexpError;
VALUE rb_cRegexp;
VALUE rb_cMatch;
static VALUE rb_cRegexpMatcher;
typedef struct rb_regexp {
struct RBasic basic;
URegularExpression *pattern;
bool fixed_encoding;
} rb_regexp_t;
#define RREGEXP(o) ((rb_regexp_t *)o)
#define REGEXP_OPT_DEFAULT (UREGEX_MULTILINE)
#define REGEXP_OPT_IGNORECASE (UREGEX_CASE_INSENSITIVE)
#define REGEXP_OPT_EXTENDED (UREGEX_COMMENTS)
#define REGEXP_OPT_MULTILINE (UREGEX_DOTALL)
typedef struct rb_match {
struct RBasic basic;
rb_regexp_t *regexp;
VALUE str;
rb_match_result_t *results;
int results_count;
} rb_match_t;
#define RMATCH(o) ((rb_match_t *)o)
#define MATCH_BUSY FL_USER2
static rb_regexp_t *
regexp_alloc(VALUE klass, SEL sel)
{
NEWOBJ(re, struct rb_regexp);
OBJSETUP(re, klass, T_REGEXP);
re->pattern = NULL;
re->fixed_encoding = false;
return re;
}
static rb_match_t *
match_alloc(VALUE klass, SEL sel)
{
NEWOBJ(match, struct rb_match);
OBJSETUP(match, klass, T_MATCH);
match->regexp = NULL;
match->str = 0;
match->results = NULL;
match->results_count = 0;
return match;
}
static void
regexp_finalize(rb_regexp_t *regexp)
{
if (regexp->pattern != NULL) {
uregex_close(regexp->pattern);
regexp->pattern = NULL;
}
}
static IMP regexp_finalize_imp_super = NULL;
static void
regexp_finalize_imp(void *rcv, SEL sel)
{
regexp_finalize(RREGEXP(rcv));
if (regexp_finalize_imp_super != NULL) {
((void(*)(void *, SEL))regexp_finalize_imp_super)(rcv, sel);
}
}
// Work around ICU limitations.
static void
sanitize_regexp_string(UChar **chars_p, long *chars_len_p, bool *need_free_p)
{
UChar *chars = *chars_p;
long chars_len = *chars_len_p;
bool need_free = *need_free_p;
#define copy_if_needed() \
do { \
if (!need_free) { \
UChar *tmp = (UChar *)malloc(sizeof(UChar) * chars_len); \
memcpy(tmp, chars, sizeof(UChar) * chars_len); \
chars = tmp; \
need_free = true; \
} \
} \
while (0)
// Replace all occurences [[:word:]] by \w.
UChar word_chars[10] = {'[', '[', ':', 'w', 'o', 'r', 'd', ':', ']', ']'};
size_t pos = 0;
while (true) {
UChar *p = u_strFindFirst(chars + pos, chars_len - pos, word_chars, 10);
if (p == NULL) {
break;
}
pos = p - chars;
copy_if_needed();
chars[pos] = '\\';
chars[pos + 1] = 'w';
memmove(&chars[pos + 2], &chars[pos + 10],
sizeof(UChar) * (chars_len - (pos + 8)));
chars_len -= 8;
}
// Replace all occurences of \n (where n is a number < 1 or > 9) by the
// number value.
UChar backslash_chars[] = {'\\'};
char buf[11];
pos = 0;
while (true) {
UChar *p = u_strFindFirst(chars + pos, chars_len - pos,
backslash_chars, 1);
if (p == NULL) {
break;
}
pos = p - chars;
copy_if_needed();
int n = 0;
while (true) {
const int i = pos + n + 1;
if (i >= chars_len) {
break;
}
UChar c = chars[i];
if (c >= '0' && c <= '9') {
assert(n < 10);
buf[n++] = (char)c;
}
else {
break;
}
}
if (n > 0) {
buf[n] = '\0';
const int l = atoi(buf);
if (l < 1 || l > 9) {
chars[pos] = (UChar)l;
memmove(&chars[pos + 1], &chars[pos + n + 1],
sizeof(UChar) * (chars_len - (pos + n + 1)));
chars_len -= n;
pos = 0;
continue;
}
// A backreference (\1 .. \9).
}
pos++;
}
#undef copy_if_needed
#if 0
printf("out:\n");
for (int i = 0; i < chars_len; i++) {
printf("%c", chars[i]);
}
printf("\n");
#endif
*chars_p = chars;
*chars_len_p = chars_len;
*need_free_p = need_free;
}
static bool
init_from_string(rb_regexp_t *regexp, VALUE str, int option, VALUE *excp)
{
option |= REGEXP_OPT_DEFAULT;
UChar *chars = NULL;
long chars_len = 0;
bool need_free = false;
rb_str_get_uchars(str, &chars, &chars_len, &need_free);
UChar null_char = '\0';
if (chars_len == 0) {
// uregex_open() will complain if we pass a NULL pattern or a
// pattern length of 0, so we do pass an empty pattern with a length
// of -1 which indicates it's terminated by \0.
chars = &null_char;
chars_len = -1;
}
else {
sanitize_regexp_string(&chars, &chars_len, &need_free);
}
UParseError pe;
UErrorCode status = U_ZERO_ERROR;
URegularExpression *pattern = uregex_open(chars, chars_len, option,
&pe, &status);
if (need_free) {
free(chars);
}
if (pattern == NULL) {
if (excp != NULL) {
char error[1024];
snprintf(error, sizeof error, "regexp `%s' compilation error: %s",
RSTRING_PTR(str),
u_errorName(status));
*excp = rb_exc_new2(rb_eRegexpError, error);
}
return false;
}
bool fixed_encoding = false;
if (IS_RSTR(str) && !str_is_ruby_ascii_only(RSTR(str))) {
fixed_encoding = true;
}
regexp_finalize(regexp);
regexp->pattern = pattern;
regexp->fixed_encoding = fixed_encoding;
return true;
}
static void
init_from_regexp(rb_regexp_t *regexp, rb_regexp_t *from)
{
regexp_finalize(regexp);
UErrorCode status = U_ZERO_ERROR;
regexp->pattern = uregex_clone(from->pattern, &status);
if (regexp->pattern == NULL) {
rb_raise(rb_eRegexpError, "can't clone given regexp: %s",
u_errorName(status));
}
}
static VALUE
rb_str_compile_regexp(VALUE str, int options, VALUE *excp)
{
rb_regexp_t *regexp = regexp_alloc(rb_cRegexp, 0);
if (!init_from_string(regexp, str, options, excp)) {
return Qnil;
}
return (VALUE)regexp;
}
bool
rb_char_to_icu_option(int c, int *option)
{
assert(option != NULL);
switch (c) {
case 'i':
*option = REGEXP_OPT_IGNORECASE;
return true;
case 'x':
*option = REGEXP_OPT_EXTENDED;
return true;
case 'm':
*option = REGEXP_OPT_MULTILINE;
return true;
// Stupid MRI encoding flags, let's ignore them for now.
case 'n':
case 'e':
case 'u':
case 's':
*option = 0;
return true;
}
*option = -1;
return false;
}
static VALUE
reg_operand(VALUE s, bool check)
{
if (SYMBOL_P(s)) {
return rb_sym_to_s(s);
}
else {
VALUE tmp = rb_check_string_type(s);
if (check && NIL_P(tmp)) {
rb_raise(rb_eTypeError, "can't convert %s to String",
rb_obj_classname(s));
}
return tmp;
}
}
static VALUE
rb_check_regexp_type(VALUE re)
{
return rb_check_convert_type(re, T_REGEXP, "Regexp", "to_regexp");
}
/*
* call-seq:
* Regexp.escape(str) => string
* Regexp.quote(str) => string
*
* Escapes any characters that would have special meaning in a regular
* expression. Returns a new escaped string, or self if no characters are
* escaped. For any string,
* <code>Regexp.new(Regexp.escape(<i>str</i>))=~<i>str</i></code> will be true.
*
* Regexp.escape('\*?{}.') #=> \\\*\?\{\}\.
*
*/
static VALUE
regexp_quote(VALUE klass, SEL sel, VALUE pat)
{
return rb_reg_quote(reg_operand(pat, true));
}
/*
* call-seq:
* Regexp.union(pat1, pat2, ...) => new_regexp
* Regexp.union(pats_ary) => new_regexp
*
* Return a <code>Regexp</code> object that is the union of the given
* <em>pattern</em>s, i.e., will match any of its parts. The <em>pattern</em>s
* can be Regexp objects, in which case their options will be preserved, or
* Strings. If no patterns are given, returns <code>/(?!)/</code>.
*
* Regexp.union #=> /(?!)/
* Regexp.union("penzance") #=> /penzance/
* Regexp.union("a+b*c") #=> /a\+b\*c/
* Regexp.union("skiing", "sledding") #=> /skiing|sledding/
* Regexp.union(["skiing", "sledding"]) #=> /skiing|sledding/
* Regexp.union(/dogs/, /cats/i) #=> /(?-mix:dogs)|(?i-mx:cats)/
*/
static VALUE regexp_to_s(VALUE rcv, SEL sel);
static VALUE
regexp_union(VALUE klass, SEL sel, int argc, VALUE *argv)
{
const VALUE *args;
if (argc == 0) {
return rb_reg_new_str(rb_str_new2("(?!)"), 0);
}
else if (argc == 1) {
VALUE v = rb_check_regexp_type(argv[0]);
if (!NIL_P(v)) {
return v;
}
v = rb_check_array_type(argv[0]);
if (!NIL_P(v)) {
argc = RARRAY_LEN(argv[0]);
args = RARRAY_PTR(argv[0]);
}
else {
StringValue(argv[0]);
return rb_reg_new_str(rb_reg_quote(argv[0]), 0);
}
}
else {
args = argv;
}
VALUE source = rb_unicode_str_new(NULL, 0);
for (int i = 0; i < argc; i++) {
VALUE arg = args[i];
if (i > 0) {
rb_str_cat2(source, "|");
}
VALUE substr;
VALUE re = rb_check_regexp_type(arg);
if (!NIL_P(re)) {
substr = regexp_to_s(re, 0);
}
else {
StringValue(arg);
substr = rb_reg_quote(arg);
}
rb_str_append(source, substr);
}
return rb_reg_new_str(source, 0);
}
/*
* call-seq:
* Regexp.last_match => matchdata
* Regexp.last_match(n) => str
*
* The first form returns the <code>MatchData</code> object generated by the
* last successful pattern match. Equivalent to reading the global variable
* <code>$~</code>. The second form returns the <i>n</i>th field in this
* <code>MatchData</code> object.
* <em>n</em> can be a string or symbol to reference a named capture.
*
* /c(.)t/ =~ 'cat' #=> 0
* Regexp.last_match #=> #<MatchData "cat" 1:"a">
* Regexp.last_match(0) #=> "cat"
* Regexp.last_match(1) #=> "a"
* Regexp.last_match(2) #=> nil
*
* /(?<lhs>\w+)\s*=\s*(?<rhs>\w+)/ =~ "var = val"
* Regexp.last_match #=> #<MatchData "var = val" lhs:"var" rhs:"val">
* Regexp.last_match(:lhs) #=> "var"
* Regexp.last_match(:rhs) #=> "val"
*/
static VALUE match_getter(void);
static int match_backref_number(VALUE match, VALUE backref, bool check);
static VALUE
regexp_last_match(VALUE klass, SEL sel, int argc, VALUE *argv)
{
VALUE nth;
if (argc > 0 && rb_scan_args(argc, argv, "01", &nth) == 1) {
VALUE match = rb_backref_get();
if (NIL_P(match)) {
return Qnil;
}
const int n = match_backref_number(match, nth, true);
return rb_reg_nth_match(n, match);
}
return match_getter();
}
/*
* call-seq:
* Regexp.try_convert(obj) -> re or nil
*
* Try to convert <i>obj</i> into a Regexp, using to_regexp method.
* Returns converted regexp or nil if <i>obj</i> cannot be converted
* for any reason.
*
* Regexp.try_convert(/re/) #=> /re/
* Regexp.try_convert("re") #=> nil
*
* o = Object.new
* Regexp.try_convert(o) #=> nil
* def o.to_regexp() /foo/ end
* Regexp.try_convert(o) #=> /foo/
*
*/
static VALUE
regexp_try_convert(VALUE klass, SEL sel, VALUE obj)
{
return rb_check_regexp_type(obj);
}
/*
* call-seq:
* Regexp.new(string [, options]) => regexp
* Regexp.new(regexp) => regexp
* Regexp.compile(string [, options]) => regexp
* Regexp.compile(regexp) => regexp
*
* Constructs a new regular expression from <i>pattern</i>, which can be either
* a <code>String</code> or a <code>Regexp</code> (in which case that regexp's
* options are propagated, and new options may not be specified (a change as of
* Ruby 1.8). If <i>options</i> is a <code>Fixnum</code>, it should be one or
* more of the constants <code>Regexp::EXTENDED</code>,
* <code>Regexp::IGNORECASE</code>, and <code>Regexp::MULTILINE</code>,
* <em>or</em>-ed together. Otherwise, if <i>options</i> is not
* <code>nil</code>, the regexp will be case insensitive.
*
* r1 = Regexp.new('^a-z+:\\s+\w+') #=> /^a-z+:\s+\w+/
* r2 = Regexp.new('cat', true) #=> /cat/i
* r3 = Regexp.new('dog', Regexp::EXTENDED) #=> /dog/x
* r4 = Regexp.new(r2) #=> /cat/i
*/
static VALUE
regexp_initialize(VALUE self, SEL sel, int argc, VALUE *argv)
{
if (argc == 0 || argc > 3) {
rb_raise(rb_eArgError, "wrong number of arguments");
}
if (TYPE(argv[0]) == T_REGEXP) {
VALUE re = argv[0];
if (argc > 1) {
rb_warn("flags ignored");
}
assert(RREGEXP(re)->pattern != NULL);
init_from_regexp(RREGEXP(self), RREGEXP(re));
}
else {
int options = 0;
if (argc >= 2) {
if (FIXNUM_P(argv[1])) {
options = FIX2INT(argv[1]);
}
else if (RTEST(argv[1])) {
options = REGEXP_OPT_IGNORECASE;
}
}
VALUE str = argv[0];
StringValue(str);
VALUE exc = Qnil;
if (!init_from_string(RREGEXP(self), str, options, &exc)) {
rb_exc_raise(exc);
}
}
return self;
}
static VALUE
regexp_initialize_copy(VALUE rcv, SEL sel, VALUE other)
{
if (TYPE(other) != T_REGEXP) {
rb_raise(rb_eTypeError, "wrong argument type");
}
init_from_regexp(RREGEXP(rcv), RREGEXP(other));
return rcv;
}
/*
* call-seq:
* rxp.hash => fixnum
*
* Produce a hash based on the text and options of this regular expression.
*/
static void
regexp_get_pattern(URegularExpression *pat, const UChar **chars,
int32_t *chars_len)
{
assert(pat != NULL);
UErrorCode status = U_ZERO_ERROR;
*chars = uregex_pattern(pat, chars_len, &status);
if (*chars == NULL) {
rb_raise(rb_eRegexpError, "can't retrieve regexp pattern: %s",
u_errorName(status));
}
if (*chars_len < 0) {
*chars_len = 0;
}
}
static VALUE
regexp_hash(VALUE rcv, SEL sel)
{
const UChar *chars = NULL;
int32_t chars_len = 0;
regexp_get_pattern(RREGEXP(rcv)->pattern, &chars, &chars_len);
unsigned long code = rb_str_hash_uchars(chars, chars_len);
code += rb_reg_options(rcv);
return LONG2NUM(code);
}
/*
* call-seq:
* rxp == other_rxp => true or false
* rxp.eql?(other_rxp) => true or false
*
* Equality---Two regexps are equal if their patterns are identical, they have
* the same character set code, and their <code>casefold?</code> values are the
* same.
*
* /abc/ == /abc/x #=> false
* /abc/ == /abc/i #=> false
* /abc/ == /abc/n #=> false
* /abc/u == /abc/n #=> false
*/
static VALUE
regexp_equal(VALUE rcv, SEL sel, VALUE other)
{
if (rcv == other) {
return Qtrue;
}
if (TYPE(other) != T_REGEXP) {
return Qfalse;
}
assert(RREGEXP(rcv)->pattern != NULL);
assert(RREGEXP(other)->pattern != NULL);
UErrorCode status = U_ZERO_ERROR;
if (uregex_flags(RREGEXP(rcv)->pattern, &status)
!= uregex_flags(RREGEXP(other)->pattern, &status)) {
return Qfalse;
}
int32_t rcv_chars_len = 0;
const UChar *rcv_chars = NULL;
regexp_get_pattern(RREGEXP(rcv)->pattern, &rcv_chars, &rcv_chars_len);
int32_t other_chars_len = 0;
const UChar *other_chars = NULL;
regexp_get_pattern(RREGEXP(other)->pattern, &other_chars, &other_chars_len);
if (rcv_chars_len != other_chars_len) {
return Qfalse;
}
if (memcmp(rcv_chars, other_chars, sizeof(UChar) * rcv_chars_len) != 0) {
return Qfalse;
}
return Qtrue;
}
/*
* call-seq:
* rxp =~ str => integer or nil
*
* Match---Matches <i>rxp</i> against <i>str</i>.
*
* /at/ =~ "input data" #=> 7
* /ax/ =~ "input data" #=> nil
*
* If <code>=~</code> is used with a regexp literal with named captures,
* captured strings (or nil) is assigned to local variables named by
* the capture names.
*
* /(?<lhs>\w+)\s*=\s*(?<rhs>\w+)/ =~ " x = y "
* p lhs #=> "x"
* p rhs #=> "y"
*
* If it is not matched, nil is assigned for the variables.
*
* /(?<lhs>\w+)\s*=\s*(?<rhs>\w+)/ =~ " x = "
* p lhs #=> nil
* p rhs #=> nil
*
* This assignment is implemented in the Ruby parser.
* So a regexp literal is required for the assignment.
* The assignment is not occur if the regexp is not a literal.
*
* re = /(?<lhs>\w+)\s*=\s*(?<rhs>\w+)/
* re =~ " x = "
* p lhs # undefined local variable
* p rhs # undefined local variable
*
* A regexp interpolation, <code>#{}</code>, also disables
* the assignment.
*
* rhs_pat = /(?<rhs>\w+)/
* /(?<lhs>\w+)\s*=\s*#{rhs_pat}/ =~ "x = y"
* p lhs # undefined local variable
*/
typedef struct rb_regexp_matcher {
struct RBasic basic;
URegularExpression *pattern;
UChar *text_to_free;
rb_encoding_t *encoding;
} rb_regexp_matcher_t;
static void
reg_matcher_cleanup(rb_regexp_matcher_t *m)
{
if (m->pattern != NULL) {
uregex_close(m->pattern);
m->pattern = NULL;
}
if (m->text_to_free != NULL) {
free(m->text_to_free);
m->text_to_free = NULL;
}
}
static IMP regexp_matcher_finalize_imp_super = NULL;
static void
regexp_matcher_finalize_imp(void *rcv, SEL sel)
{
reg_matcher_cleanup((rb_regexp_matcher_t *)rcv);
if (regexp_matcher_finalize_imp_super != NULL) {
((void(*)(void *, SEL))regexp_matcher_finalize_imp_super)(rcv, sel);
}
}
VALUE
rb_reg_matcher_new(VALUE re, VALUE str)
{
NEWOBJ(matcher, struct rb_regexp_matcher);
OBJSETUP(matcher, rb_cRegexpMatcher, T_OBJECT);
UErrorCode status = U_ZERO_ERROR;
assert(RREGEXP(re)->pattern != NULL);
URegularExpression *match_pattern = uregex_clone(RREGEXP(re)->pattern,
&status);
if (match_pattern == NULL) {
rb_raise(rb_eRegexpError, "can't clone given regexp: %s",
u_errorName(status));
}
UChar *chars = NULL;
long chars_len = 0;
bool need_free = false;
rb_str_get_uchars(str, &chars, &chars_len, &need_free);
UChar null_char = '\0';
if (chars_len == 0) {
// uregex_setText() will complain if we pass a NULL pattern or a
// pattern length of 0, so we do pass an empty pattern with a length
// of -1 which indicates it's terminated by \0.
chars = &null_char;
chars_len = -1;
}
uregex_setText(match_pattern, chars, chars_len, &status);
if (status != U_ZERO_ERROR) {
uregex_close(matcher->pattern);
rb_raise(rb_eRegexpError, "can't set pattern text: %s",
u_errorName(status));
}
matcher->pattern = match_pattern;
matcher->encoding = rb_enc_get(str);
// Apparently uregex_setText doesn't copy the given string, so we need
// to keep it around until we finally destroy the matcher object.
matcher->text_to_free = need_free ? chars : NULL;
return (VALUE)matcher;
}
void
rb_reg_matcher_destroy(VALUE matcher)
{
reg_matcher_cleanup((rb_regexp_matcher_t *)matcher);
xfree((void *)matcher);
}
int
rb_reg_matcher_search(VALUE re, VALUE matcher, int pos, bool reverse)
{
rb_regexp_matcher_t *re_matcher = (rb_regexp_matcher_t *)matcher;
UErrorCode status = U_ZERO_ERROR;
int32_t chars_len = 0;
const UChar *chars = uregex_getText(re_matcher->pattern, &chars_len,
&status);
if (chars == NULL) {
rb_raise(rb_eRegexpError, "can't get text from regexp: %s",
u_errorName(status));
}
if (chars_len < 0) {
chars_len = 0;
}
if (pos > chars_len || pos < 0) {
rb_backref_set(Qnil);
return -1;
}
if (reverse) {
const int orig = pos;
while (pos >= 0) {
if (uregex_find(re_matcher->pattern, pos, &status)) {
if (uregex_start(re_matcher->pattern, 0, &status) <= orig) {
break;
}
}
pos--;
}
if (pos < 0) {
// No match.
rb_backref_set(Qnil);
return -1;
}
}
else if (!uregex_find(re_matcher->pattern, pos, &status)) {
// No match.
rb_backref_set(Qnil);
return -1;
}
// Match found.
const int res_count = 1 + uregex_groupCount(re_matcher->pattern, &status);
rb_match_result_t *res = NULL;
VALUE match = rb_backref_get();
if (NIL_P(match) || FL_TEST(match, MATCH_BUSY)) {
// Creating a new Match object.
match = (VALUE)match_alloc(rb_cMatch, 0);
rb_backref_set(match);
res = (rb_match_result_t *)xmalloc(sizeof(rb_match_result_t)
* res_count);
GC_WB(&RMATCH(match)->results, res);
GC_WB(&RMATCH(match)->str, rb_str_new(NULL, 0));
}
else {
// Reusing the previous Match object.
assert(RMATCH(match)->results != NULL);
if (res_count > RMATCH(match)->results_count) {
res = (rb_match_result_t *)xrealloc(RMATCH(match)->results,
sizeof(rb_match_result_t) * res_count);
if (res != RMATCH(match)->results) {
GC_WB(&RMATCH(match)->results, res);
}
}
else {
res = RMATCH(match)->results;
memset(res, 0, sizeof(rb_match_result_t) * res_count);
}
assert(RMATCH(match)->str != 0);
}
RMATCH(match)->results_count = res_count;
if (RMATCH(match)->regexp != (rb_regexp_t *)re) {
GC_WB(&RMATCH(match)->regexp, re);
}
rb_str_set_len(RMATCH(match)->str, 0);
rb_str_force_encoding(RMATCH(match)->str, re_matcher->encoding);
rb_str_append_uchars(RMATCH(match)->str, chars, chars_len);
for (int i = 0; i < res_count; i++) {
res[i].beg = uregex_start(re_matcher->pattern, i, &status);
res[i].end = uregex_end(re_matcher->pattern, i, &status);
}
return res[0].beg;
}
static long
reg_match_pos(VALUE re, VALUE *strp, long pos)
{
VALUE str = *strp;
if (NIL_P(str)) {
rb_backref_set(Qnil);
return -1;
}
*strp = str = reg_operand(str, true);
if (pos != 0) {
if (pos < 0) {
VALUE l = rb_str_length(str);
pos += NUM2INT(l);
if (pos < 0) {
return pos;
}
}
pos = rb_reg_adjust_startpos(re, str, pos, false);
}
return rb_reg_search(re, str, pos, 0);
}
VALUE
regexp_match(VALUE rcv, SEL sel, VALUE str)
{
const long pos = reg_match_pos(rcv, &str, 0);
if (pos < 0) {
return Qnil;
}
return LONG2FIX(pos);
}
/*
* call-seq:
* rxp.match(str) => matchdata or nil
* rxp.match(str,pos) => matchdata or nil
*
* Returns a <code>MatchData</code> object describing the match, or
* <code>nil</code> if there was no match. This is equivalent to retrieving the
* value of the special variable <code>$~</code> following a normal match.
* If the second parameter is present, it specifies the position in the string
* to begin the search.
*
* /(.)(.)(.)/.match("abc")[2] #=> "b"
* /(.)(.)/.match("abc", 1)[2] #=> "c"
*
* If a block is given, invoke the block with MatchData if match succeed, so
* that you can write
*
* pat.match(str) {|m| ...}
*
* instead of
*
* if m = pat.match(str)
* ...
* end
*
* The return value is a value from block execution in this case.
*/
VALUE
regexp_match2(VALUE rcv, SEL sel, int argc, VALUE *argv)
{
VALUE result, str, initpos;
long pos;
if (rb_scan_args(argc, argv, "11", &str, &initpos) == 2) {
pos = NUM2LONG(initpos);
}
else {
pos = 0;
}
pos = reg_match_pos(rcv, &str, pos);
if (pos < 0) {
rb_backref_set(Qnil);
return Qnil;
}
result = rb_backref_get();
rb_match_busy(result);
if (!NIL_P(result) && rb_block_given_p()) {
return rb_yield(result);
}
return result;
}
/*
* call-seq:
* ~ rxp => integer or nil
*
* Match---Matches <i>rxp</i> against the contents of <code>$_</code>.
* Equivalent to <code><i>rxp</i> =~ $_</code>.
*
* $_ = "input data"
* ~ /at/ #=> 7
*/
static VALUE
regexp_match3(VALUE rcv, SEL sel)
{
VALUE line = rb_lastline_get();
if (TYPE(line) != T_STRING) {
rb_backref_set(Qnil);
return Qnil;
}
const long start = rb_reg_search(rcv, line, 0, 0);
if (start < 0) {
return Qnil;
}
return LONG2FIX(start);
}
/*
* call-seq:
* rxp === str => true or false
*
* Case Equality---Synonym for <code>Regexp#=~</code> used in case statements.
*
* a = "HELLO"
* case a
* when /^[a-z]*$/; print "Lower case\n"
* when /^[A-Z]*$/; print "Upper case\n"
* else; print "Mixed case\n"
* end
*
* <em>produces:</em>
*
* Upper case
*/
VALUE
regexp_eqq(VALUE rcv, SEL sel, VALUE str)
{
str = reg_operand(str, Qfalse);
if (NIL_P(str)) {
rb_backref_set(Qnil);
return Qfalse;
}
const long start = rb_reg_search(rcv, str, 0, false);
if (start < 0) {
return Qfalse;
}
return Qtrue;
}
/*
* call-seq:
* rxp.source => str
*
* Returns the original string of the pattern.
*
* /ab+c/ix.source #=> "ab+c"
*
* Note that escape sequences are retained as is.
*
* /\x20\+/.source #=> "\\x20\\+"
*