/
re.c
1098 lines (942 loc) · 22.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
/************************************************
re.c -
$Author$
$Date$
created at: Mon Aug 9 18:24:49 JST 1993
Copyright (C) 1993-1998 Yukihiro Matsumoto
************************************************/
#include "ruby.h"
#include "re.h"
static VALUE eRegxpError;
#define BEG(no) regs->beg[no]
#define END(no) regs->end[no]
#if 'a' == 97 /* it's ascii */
static char casetable[] = {
'\000', '\001', '\002', '\003', '\004', '\005', '\006', '\007',
'\010', '\011', '\012', '\013', '\014', '\015', '\016', '\017',
'\020', '\021', '\022', '\023', '\024', '\025', '\026', '\027',
'\030', '\031', '\032', '\033', '\034', '\035', '\036', '\037',
/* ' ' '!' '"' '#' '$' '%' '&' ''' */
'\040', '\041', '\042', '\043', '\044', '\045', '\046', '\047',
/* '(' ')' '*' '+' ',' '-' '.' '/' */
'\050', '\051', '\052', '\053', '\054', '\055', '\056', '\057',
/* '0' '1' '2' '3' '4' '5' '6' '7' */
'\060', '\061', '\062', '\063', '\064', '\065', '\066', '\067',
/* '8' '9' ':' ';' '<' '=' '>' '?' */
'\070', '\071', '\072', '\073', '\074', '\075', '\076', '\077',
/* '@' 'A' 'B' 'C' 'D' 'E' 'F' 'G' */
'\100', '\141', '\142', '\143', '\144', '\145', '\146', '\147',
/* 'H' 'I' 'J' 'K' 'L' 'M' 'N' 'O' */
'\150', '\151', '\152', '\153', '\154', '\155', '\156', '\157',
/* 'P' 'Q' 'R' 'S' 'T' 'U' 'V' 'W' */
'\160', '\161', '\162', '\163', '\164', '\165', '\166', '\167',
/* 'X' 'Y' 'Z' '[' '\' ']' '^' '_' */
'\170', '\171', '\172', '\133', '\134', '\135', '\136', '\137',
/* '`' 'a' 'b' 'c' 'd' 'e' 'f' 'g' */
'\140', '\141', '\142', '\143', '\144', '\145', '\146', '\147',
/* 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' */
'\150', '\151', '\152', '\153', '\154', '\155', '\156', '\157',
/* 'p' 'q' 'r' 's' 't' 'u' 'v' 'w' */
'\160', '\161', '\162', '\163', '\164', '\165', '\166', '\167',
/* 'x' 'y' 'z' '{' '|' '}' '~' */
'\170', '\171', '\172', '\173', '\174', '\175', '\176', '\177',
'\200', '\201', '\202', '\203', '\204', '\205', '\206', '\207',
'\210', '\211', '\212', '\213', '\214', '\215', '\216', '\217',
'\220', '\221', '\222', '\223', '\224', '\225', '\226', '\227',
'\230', '\231', '\232', '\233', '\234', '\235', '\236', '\237',
'\240', '\241', '\242', '\243', '\244', '\245', '\246', '\247',
'\250', '\251', '\252', '\253', '\254', '\255', '\256', '\257',
'\260', '\261', '\262', '\263', '\264', '\265', '\266', '\267',
'\270', '\271', '\272', '\273', '\274', '\275', '\276', '\277',
'\300', '\301', '\302', '\303', '\304', '\305', '\306', '\307',
'\310', '\311', '\312', '\313', '\314', '\315', '\316', '\317',
'\320', '\321', '\322', '\323', '\324', '\325', '\326', '\327',
'\330', '\331', '\332', '\333', '\334', '\335', '\336', '\337',
'\340', '\341', '\342', '\343', '\344', '\345', '\346', '\347',
'\350', '\351', '\352', '\353', '\354', '\355', '\356', '\357',
'\360', '\361', '\362', '\363', '\364', '\365', '\366', '\367',
'\370', '\371', '\372', '\373', '\374', '\375', '\376', '\377',
};
#else
>>> "You lose. You will need a translation table for your character set." <<<
#endif
#define MIN(a,b) (((a)>(b))?(b):(a))
int
str_cicmp(str1, str2)
VALUE str1, str2;
{
int len, i;
char *p1, *p2;
len = MIN(RSTRING(str1)->len, RSTRING(str2)->len);
p1 = RSTRING(str1)->ptr; p2 = RSTRING(str2)->ptr;
for (i = 0; i < len; i++, p1++, p2++) {
if (casetable[(unsigned)*p1] != casetable[(unsigned)*p2])
return casetable[(unsigned)*p1] - casetable[(unsigned)*p2];
}
return RSTRING(str1)->len - RSTRING(str2)->len;
}
#define REG_IGNORECASE FL_USER0
#define KCODE_NONE 0
#define KCODE_EUC FL_USER2
#define KCODE_SJIS FL_USER3
#define KCODE_FIXED FL_USER4
#define KCODE_MASK (KCODE_EUC|KCODE_SJIS)
static int reg_kcode =
#ifdef EUC
KCODE_EUC;
#else
# ifdef SJIS
KCODE_SJIS;
# else
KCODE_NONE;
# endif
#endif
static void
kcode_euc(reg)
VALUE reg;
{
FL_UNSET(reg, KCODE_MASK);
FL_SET(reg, KCODE_EUC);
FL_SET(reg, KCODE_FIXED);
}
static void
kcode_sjis(reg)
VALUE reg;
{
FL_UNSET(reg, KCODE_MASK);
FL_SET(reg, KCODE_SJIS);
FL_SET(reg, KCODE_FIXED);
}
static void
kcode_none(reg)
VALUE reg;
{
FL_UNSET(reg, KCODE_MASK);
FL_SET(reg, KCODE_FIXED);
}
static void
kcode_set_option(reg)
VALUE reg;
{
if (!FL_TEST(reg, KCODE_FIXED)) return;
switch ((RBASIC(reg)->flags & KCODE_MASK)) {
case KCODE_NONE:
mbcinit(MBCTYPE_ASCII);
break;
case KCODE_EUC:
mbcinit(MBCTYPE_EUC);
break;
case KCODE_SJIS:
mbcinit(MBCTYPE_SJIS);
break;
}
}
void
kcode_reset_option()
{
switch (reg_kcode) {
case KCODE_NONE:
mbcinit(MBCTYPE_ASCII);
break;
case KCODE_EUC:
mbcinit(MBCTYPE_EUC);
break;
case KCODE_SJIS:
mbcinit(MBCTYPE_SJIS);
break;
}
}
extern int rb_in_eval;
static void
reg_expr_str(str, s, len)
VALUE str;
char *s;
int len;
{
char *p, *pend;
int slash = 0;
p = s; pend = p + len;
while (p<pend) {
if (*p == '/') {
slash = 1;
break;
}
p++;
}
if (!slash) {
str_cat(str, s, len);
}
else {
p = s;
while (p<pend) {
if (*p == '/') {
char c = '\\';
str_cat(str, &c, 1);
str_cat(str, p, 1);
}
else {
str_cat(str, p, 1);
}
p++;
}
}
}
static VALUE
reg_desc(s, len, re)
char *s;
int len;
VALUE re;
{
VALUE str = str_new2("/");
reg_expr_str(str, s, len);
str_cat(str, "/", 1);
if (re) {
if (FL_TEST(re,REG_IGNORECASE))
str_cat(str, "i", 1);
if (FL_TEST(re,KCODE_FIXED)) {
switch ((RBASIC(re)->flags & KCODE_MASK)) {
case KCODE_NONE:
str_cat(str, "n", 1);
break;
case KCODE_EUC:
str_cat(str, "e", 1);
break;
case KCODE_SJIS:
str_cat(str, "s", 1);
break;
}
}
}
return str;
}
static VALUE
reg_source(re)
VALUE re;
{
VALUE str = str_new(0,0);
reg_expr_str(str, RREGEXP(re)->str,RREGEXP(re)->len,re);
return str;
}
static VALUE
reg_inspect(re)
VALUE re;
{
return reg_desc(RREGEXP(re)->str, RREGEXP(re)->len, re);
}
static void
reg_raise(s, len, err, re)
char *s;
int len;
char *err;
VALUE re;
{
VALUE desc = reg_desc(s, len, re);
if (rb_in_eval)
Raise(eRegxpError, "%s: %s", err, RSTRING(desc)->ptr);
else
Error("%s: %s", err, RSTRING(desc)->ptr);
}
static VALUE
reg_casefold_p(re)
VALUE re;
{
if (FL_TEST(re, REG_IGNORECASE)) return TRUE;
return FALSE;
}
static VALUE
reg_kcode_method(re)
VALUE re;
{
char *kcode = "$KCODE";
if (FL_TEST(re, KCODE_FIXED)) {
switch (RBASIC(re)->flags & KCODE_MASK) {
case KCODE_NONE:
kcode = "none"; break;
case KCODE_EUC:
kcode = "euc"; break;
case KCODE_SJIS:
kcode = "sjis"; break;
default:
break;
}
}
return str_new2(kcode);
}
static Regexp*
make_regexp(s, len, flag)
char *s;
int len, flag;
{
Regexp *rp;
char *err;
/* Handle escaped characters first. */
/* Build a copy of the string (in dest) with the
escaped characters translated, and generate the regex
from that.
*/
rp = ALLOC(Regexp);
MEMZERO((char *)rp, Regexp, 1);
rp->buffer = ALLOC_N(char, 16);
rp->allocated = 16;
rp->fastmap = ALLOC_N(char, 256);
if (flag) {
rp->translate = casetable;
}
err = re_compile_pattern(s, (size_t)len, rp);
kcode_reset_option();
if (err != NULL) {
reg_raise(s, len, err, 0);
}
return rp;
}
static VALUE cMatch;
static VALUE
match_alloc()
{
NEWOBJ(match, struct RMatch);
OBJSETUP(match, cMatch, T_MATCH);
match->str = 0;
match->regs = ALLOC(struct re_registers);
MEMZERO(match->regs, struct re_registers, 1);
return (VALUE)match;
}
static VALUE
match_clone(orig)
VALUE orig;
{
struct re_registers *rr;
NEWOBJ(match, struct RMatch);
OBJSETUP(match, cMatch, T_MATCH);
match->str = RMATCH(orig)->str;
match->regs = ALLOC(struct re_registers);
match->regs->allocated = 0;
re_copy_registers(match->regs, RMATCH(orig)->regs);
return (VALUE)match;
}
VALUE ignorecase;
static VALUE matchcache;
void
reg_prepare_re(reg)
VALUE reg;
{
int result;
int casefold = RTEST(ignorecase);
int need_recompile = 0;
/* case-flag set for the object */
if (FL_TEST(reg, REG_IGNORECASE)) {
casefold = TRUE;
}
if (casefold) {
if (RREGEXP(reg)->ptr->translate != casetable) {
RREGEXP(reg)->ptr->translate = casetable;
RREGEXP(reg)->ptr->fastmap_accurate = 0;
need_recompile = 1;
}
}
else if (RREGEXP(reg)->ptr->translate) {
RREGEXP(reg)->ptr->translate = NULL;
RREGEXP(reg)->ptr->fastmap_accurate = 0;
need_recompile = 1;
}
if (FL_TEST(reg, KCODE_FIXED)) {
kcode_set_option(reg);
}
else if ((RBASIC(reg)->flags & KCODE_MASK) != reg_kcode) {
need_recompile = 1;
RBASIC(reg)->flags = RBASIC(reg)->flags & ~KCODE_MASK;
RBASIC(reg)->flags |= reg_kcode;
}
if (need_recompile) {
char *err;
err = re_compile_pattern(RREGEXP(reg)->str, RREGEXP(reg)->len, RREGEXP(reg)->ptr);
if (err != NULL) {
kcode_reset_option();
reg_raise(RREGEXP(reg)->str, RREGEXP(reg)->len, err, reg);
}
}
}
int
reg_search(reg, str, start, regs)
VALUE reg, str;
int start;
struct re_registers *regs;
{
int result;
int casefold = RTEST(ignorecase);
VALUE match = 0;
struct re_registers *regs0 = 0;
int need_recompile = 0;
if (start > RSTRING(str)->len) return -1;
reg_prepare_re(reg);
if (regs == (struct re_registers*)-1) {
regs = 0;
}
else {
if (matchcache) {
match = matchcache;
matchcache = 0;
}
else {
match = match_alloc();
}
regs0 = RMATCH(match)->regs;
}
result = re_search(RREGEXP(reg)->ptr,RSTRING(str)->ptr,RSTRING(str)->len,
start,RSTRING(str)->len-start,regs0);
kcode_reset_option();
if (start == -2) {
reg_raise(RREGEXP(reg)->str, RREGEXP(reg)->len,
"Stack overfow in regexp matcher", reg);
}
if (result < 0) {
matchcache = match;
backref_set(Qnil);
}
else if (match) {
RMATCH(match)->str = str_new4(str);
backref_set(match);
}
if (regs && regs0) re_copy_registers(regs, regs0);
return result;
}
VALUE
reg_nth_defined(nth, match)
int nth;
VALUE match;
{
if (NIL_P(match)) return Qnil;
if (nth >= RMATCH(match)->regs->num_regs) {
return FALSE;
}
if (RMATCH(match)->BEG(nth) == -1) return FALSE;
return TRUE;
}
VALUE
reg_nth_match(nth, match)
int nth;
VALUE match;
{
int start, end, len;
if (NIL_P(match)) return Qnil;
if (nth >= RMATCH(match)->regs->num_regs) {
return Qnil;
}
start = RMATCH(match)->BEG(nth);
if (start == -1) return Qnil;
end = RMATCH(match)->END(nth);
len = end - start;
return str_new(RSTRING(RMATCH(match)->str)->ptr + start, len);
}
VALUE
reg_last_match(match)
VALUE match;
{
return reg_nth_match(0, match);
}
VALUE
reg_match_pre(match)
VALUE match;
{
if (NIL_P(match)) return Qnil;
if (RMATCH(match)->BEG(0) == -1) return Qnil;
return str_new(RSTRING(RMATCH(match)->str)->ptr, RMATCH(match)->BEG(0));
}
VALUE
reg_match_post(match)
VALUE match;
{
if (NIL_P(match)) return Qnil;
if (RMATCH(match)->BEG(0) == -1) return Qnil;
return str_new(RSTRING(RMATCH(match)->str)->ptr+RMATCH(match)->END(0),
RSTRING(RMATCH(match)->str)->len-RMATCH(match)->END(0));
}
VALUE
reg_match_last(match)
VALUE match;
{
int i;
if (NIL_P(match)) return Qnil;
if (RMATCH(match)->BEG(0) == -1) return Qnil;
for (i=RMATCH(match)->regs->num_regs-1; RMATCH(match)->BEG(i) == -1 && i > 0; i--)
;
if (i == 0) return Qnil;
return reg_nth_match(i, match);
}
static VALUE
last_match_getter()
{
return reg_last_match(backref_get());
}
static VALUE
prematch_getter()
{
return reg_match_pre(backref_get());
}
static VALUE
postmatch_getter()
{
return reg_match_post(backref_get());
}
static VALUE
last_paren_match_getter()
{
return reg_match_last(backref_get());
}
static VALUE
match_to_a(match)
VALUE match;
{
struct re_registers *regs = RMATCH(match)->regs;
VALUE ary = ary_new2(regs->num_regs);
char *ptr = RSTRING(RMATCH(match)->str)->ptr;
int i;
for (i=0; i<regs->num_regs; i++) {
if (regs->beg[i] == -1) ary_push(ary, Qnil);
else ary_push(ary, str_new(ptr+regs->beg[i],
regs->end[i]-regs->beg[i]));
}
return ary;
}
static VALUE
match_aref(argc, argv, match)
int argc;
VALUE *argv;
VALUE match;
{
VALUE idx, rest;
struct re_registers *regs;
char *ptr;
int i;
rb_scan_args(argc, argv, "11", &idx, &rest);
if (!NIL_P(rest) || !FIXNUM_P(idx) || FIX2INT(idx) < 0) {
return ary_aref(argc, argv, match_to_a(match));
}
regs = RMATCH(match)->regs;
i = FIX2INT(idx);
if (i>=regs->num_regs) return Qnil;
ptr = RSTRING(RMATCH(match)->str)->ptr;
return str_new(ptr+regs->beg[i], regs->end[i]-regs->beg[i]);
}
static VALUE
match_to_s(match)
VALUE match;
{
VALUE str = reg_last_match(match);
if (NIL_P(str)) return str_new(0,0);
return str;
}
void
reg_free(rp)
Regexp *rp;
{
free(rp->buffer);
free(rp->fastmap);
free(rp);
}
VALUE cRegexp;
static VALUE
reg_new_1(klass, s, len, flag)
VALUE klass;
char *s;
int len;
int flag; /* CASEFOLD = 0x1 */
/* CODE_NONE = 0x2 */
/* CODE_EUC = 0x4 */
/* CODE_SJIS = 0x6 */
{
NEWOBJ(re, struct RRegexp);
OBJSETUP(re, klass, T_REGEXP);
if (flag & 0x1) {
FL_SET(re, REG_IGNORECASE);
}
switch (flag & ~0x1) {
case 0:
default:
FL_SET(re, reg_kcode);
break;
case 2:
kcode_none(re);
break;
case 4:
kcode_euc(re);
break;
case 6:
kcode_sjis(re);
break;
}
kcode_set_option(re);
re->ptr = make_regexp(s, len, flag & 0x1);
re->str = ALLOC_N(char, len+1);
memcpy(re->str, s, len);
re->str[len] = '\0';
re->len = len;
obj_call_init((VALUE)re);
return (VALUE)re;
}
VALUE
reg_new(s, len, flag)
char *s;
int len, flag;
{
return reg_new_1(cRegexp, s, len, flag);
}
static int ign_cache;
static VALUE reg_cache;
VALUE
reg_regcomp(str)
VALUE str;
{
int ignc = RTEST(ignorecase);
if (reg_cache && RREGEXP(reg_cache)->len == RSTRING(str)->len
&& ign_cache == ignc
&& memcmp(RREGEXP(reg_cache)->str, RSTRING(str)->ptr, RSTRING(str)->len) == 0)
return reg_cache;
ign_cache = ignc;
return reg_cache = reg_new(RSTRING(str)->ptr, RSTRING(str)->len, ignc);
}
static int
reg_cur_kcode(re)
VALUE re;
{
if (FL_TEST(re, KCODE_FIXED)) {
return RBASIC(re)->flags & KCODE_MASK;
}
return 0;
}
static VALUE
reg_equal(re1, re2)
VALUE re1, re2;
{
int min;
if (re1 == re2) return TRUE;
if (TYPE(re2) != T_REGEXP) return FALSE;
if (RREGEXP(re1)->len != RREGEXP(re2)->len) return FALSE;
min = RREGEXP(re1)->len;
if (min > RREGEXP(re2)->len) min = RREGEXP(re2)->len;
if (memcmp(RREGEXP(re1)->str, RREGEXP(re2)->str, min) == 0 &&
reg_cur_kcode(re1) == reg_cur_kcode(re2) &&
!(FL_TEST(re1,REG_IGNORECASE) ^ FL_TEST(re2,REG_IGNORECASE))) {
return TRUE;
}
return FALSE;
}
VALUE
reg_match(re, str)
VALUE re, str;
{
int start;
if (TYPE(str) != T_STRING) return FALSE;
start = reg_search(re, str, 0, 0);
if (start < 0) {
return FALSE;
}
return INT2FIX(start);
}
VALUE
reg_match2(re)
VALUE re;
{
int start;
VALUE line = lastline_get();
if (TYPE(line) != T_STRING)
return FALSE;
start = reg_search(re, line, 0, 0);
if (start < 0) {
return FALSE;
}
return INT2FIX(start);
}
static VALUE
reg_s_new(argc, argv, self)
int argc;
VALUE *argv;
VALUE self;
{
VALUE src;
int flag = 0;
if (argc == 0 || argc > 3) {
ArgError("wrong # of argument");
}
if (argc >= 2 && RTEST(argv[1])) {
flag = 1;
}
if (argc == 3) {
Check_Type(argv[2], T_STRING);
switch (RSTRING(argv[2])->ptr[0]) {
case 'n': case 'N':
flag |= 2;
break;
case 'e': case 'E':
flag |= 4;
break;
case 's': case 'S':
flag |= 6;
break;
default:
break;
}
}
src = argv[0];
switch (TYPE(src)) {
case T_STRING:
return reg_new_1(self, RSTRING(src)->ptr, RSTRING(src)->len, flag);
break;
case T_REGEXP:
return reg_new_1(self, RREGEXP(src)->str, RREGEXP(src)->len, flag);
break;
default:
Check_Type(src, T_STRING);
}
return Qnil; /* not reached */
}
static VALUE
reg_s_quote(re, str)
VALUE re, str;
{
char *s, *send, *t;
char *tmp;
Check_Type(str, T_STRING);
tmp = ALLOCA_N(char, RSTRING(str)->len*2);
s = RSTRING(str)->ptr; send = s + RSTRING(str)->len;
t = tmp;
for (; s != send; s++) {
if (ismbchar(*s)) {
*t++ = *s++;
*t++ = *s;
continue;
}
if (*s == '[' || *s == ']'
|| *s == '{' || *s == '}'
|| *s == '(' || *s == ')'
|| *s == '|'
|| *s == '*' || *s == '.' || *s == '\\'
|| *s == '?' || *s == '+'
|| *s == '^' || *s == '$') {
*t++ = '\\';
}
*t++ = *s;
}
return str_new(tmp, t - tmp);
}
static int
reg_get_kcode(re)
VALUE re;
{
int kcode = 0;
switch (RBASIC(re)->flags & KCODE_MASK) {
case KCODE_NONE:
kcode |= 2; break;
case KCODE_EUC:
kcode |= 4; break;
case KCODE_SJIS:
kcode |= 6; break;
default:
break;
}
return kcode;
}
static VALUE
reg_clone(re)
VALUE re;
{
int flag = FL_TEST(re, REG_IGNORECASE)?1:0;
if (FL_TEST(re, KCODE_FIXED)) {
flag |= reg_get_kcode(re);
}
return reg_new_1(CLASS_OF(re), RREGEXP(re)->str, RREGEXP(re)->len, flag);
}
VALUE
reg_regsub(str, src, regs)
VALUE str, src;
struct re_registers *regs;
{
VALUE val = 0;
VALUE tmp;
char *p, *s, *e, c;
int no;
p = s = RSTRING(str)->ptr;
e = s + RSTRING(str)->len;
while (s < e) {
char *ss = s;
c = *s++;
if (ismbchar(c)) {
s++;
continue;
}
if (c != '\\' || s == e) continue;
if (!val) val = str_new(p, ss-p);
else str_cat(val, p, ss-p);
c = *s++;
p = s;
switch (c) {
case '0': case '1': case '2': case '3': case '4':
case '5': case '6': case '7': case '8': case '9':
no = c - '0';
break;
case '&':
no = 0;
break;
case '`':
str_cat(val, RSTRING(src)->ptr, BEG(0));
continue;
case '\'':
str_cat(val, RSTRING(src)->ptr+END(0), RSTRING(src)->len-END(0));
continue;
case '+':
no = regs->num_regs-1;
while (BEG(no) == -1 && no > 0) no--;
if (no == 0) continue;
break;
case '\\':
str_cat(val, s-1, 1);
continue;
default:
str_cat(val, s-2, 2);
continue;
}
if (no >= 0) {
if (BEG(no) == -1) continue;
str_cat(val, RSTRING(src)->ptr+BEG(no), END(no)-BEG(no));
}
}
if (p < e) {
if (!val) val = str_new(p, e-p);
else str_cat(val, p, e-p);
}
if (!val) return str;
return val;
}
#define IS_KCODE_FIXED(re) (FL_TEST((re), KCODE_FIXED)?1:0)
static int
reg_prepare_operation(re1, re2)
VALUE re1, re2;
{
int flag = 0;
Check_Type(re2, T_REGEXP);
flag = IS_KCODE_FIXED(re1)+IS_KCODE_FIXED(re2)*2;
switch (IS_KCODE_FIXED(re1)+IS_KCODE_FIXED(re2)*2) {
case 3: /* both have fixed kcode (must match) */
if (((RBASIC(re1)->flags^RBASIC(re2)->flags)&KCODE_MASK) != 0) {
Raise(eRegxpError, "kanji code mismatch");
}
/* fall through */
case 2: /* re2 has fixed kcode */
flag = reg_get_kcode(re2);
break;
case 1: /* re1 has fixed kcode */
flag = reg_get_kcode(re1);
break;
case 0: /* neither has fixed kcode */
flag = 0;
break;
}
if (FL_TEST(re1, REG_IGNORECASE) ^ FL_TEST(re2, REG_IGNORECASE)) {
Raise(eRegxpError, "casefold mismatch");
}
if (FL_TEST(re1, REG_IGNORECASE)) flag |= 0x1;
return flag;
}
char*
rb_get_kcode()
{
switch (reg_kcode) {
case KCODE_SJIS:
return "SJIS";
case KCODE_EUC:
return "EUC";
default:
return "NONE";
}
}
static VALUE
kcode_getter()
{
return str_new2(rb_get_kcode());
}
void
rb_set_kcode(code)
char *code;