/
RubySymbol.java
876 lines (759 loc) · 30.6 KB
/
RubySymbol.java
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
/*
***** BEGIN LICENSE BLOCK *****
* Version: CPL 1.0/GPL 2.0/LGPL 2.1
*
* The contents of this file are subject to the Common Public
* License Version 1.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.eclipse.org/legal/cpl-v10.html
*
* Software distributed under the License is distributed on an "AS
* IS" basis, WITHOUT WARRANTY OF ANY KIND, either express or
* implied. See the License for the specific language governing
* rights and limitations under the License.
*
* Copyright (C) 2001 Alan Moore <alan_moore@gmx.net>
* Copyright (C) 2001-2004 Jan Arne Petersen <jpetersen@uni-bonn.de>
* Copyright (C) 2002-2004 Anders Bengtsson <ndrsbngtssn@yahoo.se>
* Copyright (C) 2004 Thomas E Enebo <enebo@acm.org>
* Copyright (C) 2004 Joey Gibson <joey@joeygibson.com>
* Copyright (C) 2004 Stefan Matthias Aust <sma@3plus4.de>
* Copyright (C) 2006 Derek Berner <derek.berner@state.nm.us>
* Copyright (C) 2006 Miguel Covarrubias <mlcovarrubias@gmail.com>
* Copyright (C) 2007 William N Dortch <bill.dortch@gmail.com>
*
* Alternatively, the contents of this file may be used under the terms of
* either of the GNU General Public License Version 2 or later (the "GPL"),
* or the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
* in which case the provisions of the GPL or the LGPL are applicable instead
* of those above. If you wish to allow use of your version of this file only
* under the terms of either the GPL or the LGPL, and not to allow others to
* use your version of this file under the terms of the CPL, indicate your
* decision by deleting the provisions above and replace them with the notice
* and other provisions required by the GPL or the LGPL. If you do not delete
* the provisions above, a recipient may use your version of this file under
* the terms of any one of the CPL, the GPL or the LGPL.
***** END LICENSE BLOCK *****/
package org.jruby;
import org.jruby.parser.StaticScope;
import org.jruby.runtime.Binding;
import org.jruby.runtime.Block.Type;
import static org.jruby.util.StringSupport.codeLength;
import static org.jruby.util.StringSupport.codePoint;
import java.util.concurrent.locks.ReentrantLock;
import org.jcodings.Encoding;
import org.jruby.anno.JRubyClass;
import org.jruby.anno.JRubyMethod;
import org.jruby.ast.util.ArgsUtil;
import org.jruby.common.IRubyWarnings.ID;
import org.jruby.javasupport.util.RuntimeHelpers;
import org.jruby.parser.LocalStaticScope;
import org.jruby.runtime.Arity;
import org.jruby.runtime.Block;
import org.jruby.runtime.BlockBody;
import org.jruby.runtime.BlockCallback;
import org.jruby.runtime.CallBlock;
import org.jruby.runtime.ClassIndex;
import org.jruby.runtime.ObjectAllocator;
import org.jruby.runtime.ThreadContext;
import org.jruby.runtime.assigner.Assigner;
import org.jruby.runtime.assigner.Pre0Rest1Post0Assigner;
import org.jruby.runtime.builtin.IRubyObject;
import org.jruby.runtime.marshal.UnmarshalStream;
import org.jruby.util.ByteList;
/**
* Represents a Ruby symbol (e.g. :bar)
*/
@JRubyClass(name="Symbol")
public class RubySymbol extends RubyObject {
private final String symbol;
private final int id;
private final ByteList symbolBytes;
/**
*
* @param runtime
* @param internedSymbol the String value of the new Symbol. This <em>must</em>
* have been previously interned
*/
private RubySymbol(Ruby runtime, String internedSymbol, ByteList symbolBytes) {
super(runtime, runtime.getSymbol(), false, false);
// symbol string *must* be interned
// assert internedSymbol == internedSymbol.intern() : internedSymbol + " is not interned";
int length = symbolBytes.getBegin() + symbolBytes.getRealSize();
for (int i = symbolBytes.getBegin(); i < length; i++) {
if (symbolBytes.getUnsafeBytes()[i] == 0) {
throw runtime.newSyntaxError("symbol cannot contain '\\0'");
}
}
this.symbol = internedSymbol;
this.symbolBytes = symbolBytes;
this.id = runtime.allocSymbolId();
}
private RubySymbol(Ruby runtime, String internedSymbol) {
this(runtime, internedSymbol, ByteList.create(internedSymbol));
}
public static RubyClass createSymbolClass(Ruby runtime) {
RubyClass symbolClass = runtime.defineClass("Symbol", runtime.getObject(), ObjectAllocator.NOT_ALLOCATABLE_ALLOCATOR);
runtime.setSymbol(symbolClass);
RubyClass symbolMetaClass = symbolClass.getMetaClass();
symbolClass.index = ClassIndex.SYMBOL;
symbolClass.setReifiedClass(RubySymbol.class);
symbolClass.kindOf = new RubyModule.KindOf() {
public boolean isKindOf(IRubyObject obj, RubyModule type) {
return obj instanceof RubySymbol;
}
};
symbolClass.defineAnnotatedMethods(RubySymbol.class);
symbolMetaClass.undefineMethod("new");
return symbolClass;
}
@Override
public int getNativeTypeIndex() {
return ClassIndex.SYMBOL;
}
/** rb_to_id
*
* @return a String representation of the symbol
*/
@Override
public String asJavaString() {
return symbol;
}
@Override
public RubyString convertToString() {
Ruby runtime = getRuntime();
return runtime.is1_9() ? newShared(runtime) : super.convertToString();
}
@Override
public String toString() {
return symbol;
}
final ByteList getBytes() {
return symbolBytes;
}
/** short circuit for Symbol key comparison
*
*/
@Override
public final boolean eql(IRubyObject other) {
return other == this;
}
@Override
public boolean isImmediate() {
return true;
}
@Override
public RubyClass getSingletonClass() {
throw getRuntime().newTypeError("can't define singleton");
}
public static RubySymbol getSymbolLong(Ruby runtime, long id) {
return runtime.getSymbolTable().lookup(id);
}
/* Symbol class methods.
*
*/
public static RubySymbol newSymbol(Ruby runtime, String name) {
return runtime.getSymbolTable().getSymbol(name);
}
@Deprecated
public RubyFixnum to_i() {
return to_i(getRuntime());
}
@JRubyMethod(name = "to_i", compat = CompatVersion.RUBY1_8)
public RubyFixnum to_i(ThreadContext context) {
return to_i(context.getRuntime());
}
private final RubyFixnum to_i(Ruby runtime) {
return runtime.newFixnum(id);
}
@Deprecated
public RubyFixnum to_int() {
return to_int(getRuntime());
}
@JRubyMethod(name = "to_int", compat = CompatVersion.RUBY1_8)
public RubyFixnum to_int(ThreadContext context) {
return to_int(context.getRuntime());
}
private final RubyFixnum to_int(Ruby runtime) {
if (runtime.isVerbose()) {
runtime.getWarnings().warn(ID.SYMBOL_AS_INTEGER, "treating Symbol as an integer");
}
return to_i(runtime);
}
@Deprecated
@Override
public IRubyObject inspect() {
return inspect(getRuntime());
}
@JRubyMethod(name = "inspect", compat = CompatVersion.RUBY1_8)
public IRubyObject inspect(ThreadContext context) {
return inspect(context.getRuntime());
}
private final IRubyObject inspect(Ruby runtime) {
final ByteList bytes;
if (isSymbolName(symbol)) {
bytes = symbolBytes;
} else {
bytes = ((RubyString)RubyString.newString(runtime, symbolBytes).dump()).getByteList();
}
ByteList result = new ByteList(bytes.getRealSize() + 1);
result.append((byte)':');
result.append(bytes);
return RubyString.newString(runtime, result);
}
@Deprecated
public IRubyObject inspect19() {
return inspect19(getRuntime());
}
@JRubyMethod(name = "inspect", compat = CompatVersion.RUBY1_9)
public IRubyObject inspect19(ThreadContext context) {
return inspect19(context.getRuntime());
}
private final IRubyObject inspect19(Ruby runtime) {
ByteList result = new ByteList(symbolBytes.getRealSize() + 1);
result.setEncoding(symbolBytes.getEncoding());
result.append((byte)':');
result.append(symbolBytes);
RubyString str = RubyString.newString(runtime, result);
if (isPrintable() && isSymbolName(symbol)) { // TODO: 1.9 rb_enc_symname_p
return str;
} else {
str = (RubyString)str.inspect19();
ByteList bytes = str.getByteList();
bytes.set(0, ':');
bytes.set(1, '"');
return str;
}
}
@Override
public IRubyObject to_s() {
return to_s(getRuntime());
}
@JRubyMethod(name = "to_s")
public IRubyObject to_s(ThreadContext context) {
return to_s(context.getRuntime());
}
private final IRubyObject to_s(Ruby runtime) {
return RubyString.newStringShared(runtime, symbolBytes);
}
public IRubyObject id2name() {
return to_s(getRuntime());
}
@JRubyMethod(name = "id2name")
public IRubyObject id2name(ThreadContext context) {
return to_s(context);
}
@JRubyMethod(name = "===", required = 1)
@Override
public IRubyObject op_eqq(ThreadContext context, IRubyObject other) {
return super.op_equal(context, other);
}
@Deprecated
@Override
public RubyFixnum hash() {
return getRuntime().newFixnum(hashCode());
}
@JRubyMethod(name = "hash")
public RubyFixnum hash(ThreadContext context) {
return context.getRuntime().newFixnum(hashCode());
}
@Override
public int hashCode() {
return id;
}
public int getId() {
return id;
}
@Override
public boolean equals(Object other) {
return other == this;
}
@JRubyMethod(name = "to_sym")
public IRubyObject to_sym() {
return this;
}
@JRubyMethod(name = "intern", compat = CompatVersion.RUBY1_9)
public IRubyObject to_sym19() {
return this;
}
@Override
public IRubyObject taint(ThreadContext context) {
return this;
}
private RubyString newShared(Ruby runtime) {
return RubyString.newStringShared(runtime, symbolBytes);
}
@JRubyMethod(name = {"succ", "next"}, compat = CompatVersion.RUBY1_9)
public IRubyObject succ(ThreadContext context) {
Ruby runtime = context.getRuntime();
return newSymbol(runtime, newShared(runtime).succ19(context).toString());
}
@JRubyMethod(name = "<=>", compat = CompatVersion.RUBY1_9)
public IRubyObject op_cmp(ThreadContext context, IRubyObject other) {
Ruby runtime = context.getRuntime();
if (other instanceof RubySymbol) {
return (newShared(runtime).op_cmp19(context, ((RubySymbol)other).newShared(runtime)));
}
return runtime.getNil();
}
@JRubyMethod(name = "casecmp", compat = CompatVersion.RUBY1_9)
public IRubyObject casecmp(ThreadContext context, IRubyObject other) {
Ruby runtime = context.getRuntime();
if (other instanceof RubySymbol) {
return newShared(runtime).casecmp19(context, ((RubySymbol) other).newShared(runtime));
}
return runtime.getNil();
}
@JRubyMethod(name = {"=~", "match"}, compat = CompatVersion.RUBY1_9)
public IRubyObject op_match19(ThreadContext context, IRubyObject other) {
Ruby runtime = context.getRuntime();
return newShared(runtime).op_match19(context, other);
}
@JRubyMethod(name = {"[]", "slice"}, compat = CompatVersion.RUBY1_9)
public IRubyObject op_aref(ThreadContext context, IRubyObject arg) {
Ruby runtime = context.getRuntime();
return newShared(runtime).op_aref19(context, arg);
}
@JRubyMethod(name = {"[]", "slice"}, compat = CompatVersion.RUBY1_9)
public IRubyObject op_aref(ThreadContext context, IRubyObject arg1, IRubyObject arg2) {
Ruby runtime = context.getRuntime();
return newShared(runtime).op_aref19(context, arg1, arg2);
}
@JRubyMethod(name = {"length", "size"}, compat = CompatVersion.RUBY1_9)
public IRubyObject length() {
return newShared(getRuntime()).length19();
}
@JRubyMethod(name = "empty?", compat = CompatVersion.RUBY1_9)
public IRubyObject empty_p(ThreadContext context) {
return newShared(context.getRuntime()).empty_p(context);
}
@JRubyMethod(name = "upcase", compat = CompatVersion.RUBY1_9)
public IRubyObject upcase(ThreadContext context) {
Ruby runtime = context.getRuntime();
return newSymbol(runtime, newShared(runtime).upcase19(context).toString());
}
@JRubyMethod(name = "downcase", compat = CompatVersion.RUBY1_9)
public IRubyObject downcase(ThreadContext context) {
Ruby runtime = context.getRuntime();
return newSymbol(runtime, newShared(runtime).downcase19(context).toString());
}
@JRubyMethod(name = "capitalize", compat = CompatVersion.RUBY1_9)
public IRubyObject capitalize(ThreadContext context) {
Ruby runtime = context.getRuntime();
return newSymbol(runtime, newShared(runtime).capitalize19(context).toString());
}
@JRubyMethod(name = "swapcase", compat = CompatVersion.RUBY1_9)
public IRubyObject swapcase(ThreadContext context) {
Ruby runtime = context.getRuntime();
return newSymbol(runtime, newShared(runtime).swapcase19(context).toString());
}
@JRubyMethod(name = "encoding", compat = CompatVersion.RUBY1_9)
public IRubyObject encoding(ThreadContext context) {
return context.getRuntime().getEncodingService().getEncoding(symbolBytes.getEncoding());
}
private static class ToProcCallback implements BlockCallback {
private RubySymbol symbol;
public ToProcCallback(RubySymbol symbol) {
this.symbol = symbol;
}
public IRubyObject call(ThreadContext ctx, IRubyObject[] args, Block blk) {
if (args.length == 0) {
throw symbol.getRuntime().newArgumentError("no receiver given");
} else {
if (args.length == 1 && args[0] instanceof RubyArray) {
args = ((RubyArray)args[0]).toJavaArrayUnsafe();
}
IRubyObject[] args2 = new IRubyObject[args.length-1];
System.arraycopy(args, 1, args2, 0, args2.length);
return RuntimeHelpers.invoke(ctx, args[0], symbol.symbol, args2);
}
}
}
@JRubyMethod(frame = true)
public IRubyObject to_proc(ThreadContext context) {
BlockBody body = new BlockBody(BlockBody.SINGLE_RESTARG) {
private StaticScope scope = new LocalStaticScope(null);
@Override
public IRubyObject yield(ThreadContext context, IRubyObject value, Binding binding, Type type) {
RubyArray array = ArgsUtil.convertToRubyArray(context.getRuntime(), value, false);
if (array.size() == 0) {
throw context.getRuntime().newArgumentError("no receiver given");
}
IRubyObject receiver = array.shift(context);
return RuntimeHelpers.invoke(context, receiver, symbol, array.toJavaArray());
}
@Override
public IRubyObject yield(ThreadContext context, IRubyObject value, IRubyObject self, RubyModule klass, boolean aValue, Binding binding, Type type) {
RubyArray array = aValue ? (RubyArray)value : ArgsUtil.convertToRubyArray(context.getRuntime(), value, false);
if (array.size() == 0) {
throw context.getRuntime().newArgumentError("no receiver given");
}
IRubyObject receiver = array.shift(context);
return RuntimeHelpers.invoke(context, receiver, symbol, array.toJavaArray());
}
@Override
public StaticScope getStaticScope() {
return scope;
}
@Override
public void setStaticScope(StaticScope newScope) {
}
@Override
public Block cloneBlock(Binding binding) {
return new Block(this, binding);
}
@Override
public Arity arity() {
return Arity.OPTIONAL;
}
};
Block block = new Block(body, context.currentBinding());
return RubyProc.newProc(context.getRuntime(),
block,
Block.Type.PROC);
}
private static boolean isIdentStart(char c) {
return ((c >= 'a' && c <= 'z')|| (c >= 'A' && c <= 'Z')
|| c == '_');
}
private static boolean isIdentChar(char c) {
return ((c >= 'a' && c <= 'z') || (c >= '0' && c <= '9') || (c >= 'A' && c <= 'Z')
|| c == '_');
}
private static boolean isIdentifier(String s) {
if (s == null || s.length() <= 0) {
return false;
}
if (!isIdentStart(s.charAt(0))) {
return false;
}
for (int i = 1; i < s.length(); i++) {
if (!isIdentChar(s.charAt(i))) {
return false;
}
}
return true;
}
/**
* is_special_global_name from parse.c.
* @param s
* @return
*/
private static boolean isSpecialGlobalName(String s) {
if (s == null || s.length() <= 0) {
return false;
}
int length = s.length();
switch (s.charAt(0)) {
case '~': case '*': case '$': case '?': case '!': case '@': case '/': case '\\':
case ';': case ',': case '.': case '=': case ':': case '<': case '>': case '\"':
case '&': case '`': case '\'': case '+': case '0':
return length == 1;
case '-':
return (length == 1 || (length == 2 && isIdentChar(s.charAt(1))));
default:
// we already confirmed above that length > 0
for (int i = 0; i < length; i++) {
if (!Character.isDigit(s.charAt(i))) {
return false;
}
}
}
return true;
}
private boolean isPrintable() {
Ruby runtime = getRuntime();
int p = symbolBytes.getBegin();
int end = p + symbolBytes.getRealSize();
byte[]bytes = symbolBytes.getUnsafeBytes();
Encoding enc = symbolBytes.getEncoding();
while (p < end) {
int c = codePoint(runtime, enc, bytes, p, end);
if (!enc.isPrint(c)) return false;
p += codeLength(runtime, enc, c);
}
return true;
}
private static boolean isSymbolName(String s) {
if (s == null || s.length() < 1) return false;
int length = s.length();
char c = s.charAt(0);
switch (c) {
case '$':
if (length > 1 && isSpecialGlobalName(s.substring(1))) {
return true;
}
return isIdentifier(s.substring(1));
case '@':
int offset = 1;
if (length >= 2 && s.charAt(1) == '@') {
offset++;
}
return isIdentifier(s.substring(offset));
case '<':
return (length == 1 || (length == 2 && (s.equals("<<") || s.equals("<="))) ||
(length == 3 && s.equals("<=>")));
case '>':
return (length == 1) || (length == 2 && (s.equals(">>") || s.equals(">=")));
case '=':
return ((length == 2 && (s.equals("==") || s.equals("=~"))) ||
(length == 3 && s.equals("===")));
case '*':
return (length == 1 || (length == 2 && s.equals("**")));
case '+':
return (length == 1 || (length == 2 && s.equals("+@")));
case '-':
return (length == 1 || (length == 2 && s.equals("-@")));
case '|': case '^': case '&': case '/': case '%': case '~': case '`':
return length == 1;
case '[':
return s.equals("[]") || s.equals("[]=");
}
if (!isIdentStart(c)) return false;
boolean localID = (c >= 'a' && c <= 'z');
int last = 1;
for (; last < length; last++) {
char d = s.charAt(last);
if (!isIdentChar(d)) {
break;
}
}
if (last == length) {
return true;
} else if (localID && last == length - 1) {
char d = s.charAt(last);
return d == '!' || d == '?' || d == '=';
}
return false;
}
@JRubyMethod(name = "all_symbols", meta = true)
public static IRubyObject all_symbols(ThreadContext context, IRubyObject recv) {
return context.getRuntime().getSymbolTable().all_symbols();
}
@Deprecated
public static IRubyObject all_symbols(IRubyObject recv) {
return recv.getRuntime().getSymbolTable().all_symbols();
}
public static RubySymbol unmarshalFrom(UnmarshalStream input) throws java.io.IOException {
RubySymbol result = newSymbol(input.getRuntime(), RubyString.byteListToString(input.unmarshalString()));
input.registerLinkTarget(result);
return result;
}
@Override
public Object toJava(Class target) {
if (target == String.class || target == CharSequence.class) {
return symbol;
}
return super.toJava(target);
}
public static final class SymbolTable {
static final int DEFAULT_INITIAL_CAPACITY = 2048; // *must* be power of 2!
static final int MAXIMUM_CAPACITY = 1 << 30;
static final float DEFAULT_LOAD_FACTOR = 0.75f;
private final ReentrantLock tableLock = new ReentrantLock();
private volatile SymbolEntry[] symbolTable;
private int size;
private int threshold;
private final float loadFactor;
private final Ruby runtime;
public SymbolTable(Ruby runtime) {
this.runtime = runtime;
this.loadFactor = DEFAULT_LOAD_FACTOR;
this.threshold = (int)(DEFAULT_INITIAL_CAPACITY * DEFAULT_LOAD_FACTOR);
this.symbolTable = new SymbolEntry[DEFAULT_INITIAL_CAPACITY];
}
// note all fields are final -- rehash creates new entries when necessary.
// as documented in java.util.concurrent.ConcurrentHashMap.java, that will
// statistically affect only a small percentage (< 20%) of entries for a given rehash.
static class SymbolEntry {
final int hash;
final String name;
final RubySymbol symbol;
final SymbolEntry next;
SymbolEntry(int hash, String name, RubySymbol symbol, SymbolEntry next) {
this.hash = hash;
this.name = name;
this.symbol = symbol;
this.next = next;
}
}
public RubySymbol getSymbol(String name) {
int hash = name.hashCode();
SymbolEntry[] table = symbolTable;
SymbolEntry e = getEntryFromTable(table, hash);
for (; e != null; e = e.next) {
if (isSymbolMatch(name, hash, e)) return e.symbol;
}
return createSymbol(name, ByteList.create(name), hash, table);
}
public RubySymbol getSymbol(ByteList bytes) {
String name = bytes.toString();
int hash = name.hashCode();
SymbolEntry[] table = symbolTable;
SymbolEntry e = getEntryFromTable(table, hash);
for (; e != null; e = e.next) {
if (isSymbolMatch(name, hash, e)) return e.symbol;
}
return createSymbol(name, bytes, hash, table);
}
public RubySymbol fastGetSymbol(String internedName) {
// assert internedName == internedName.intern() : internedName + " is not interned";
SymbolEntry[] table = symbolTable;
SymbolEntry e = getEntryFromTable(symbolTable, internedName.hashCode());
for (; e != null; e = e.next) {
if (isSymbolMatch(internedName, e)) return e.symbol;
}
return fastCreateSymbol(internedName, table);
}
private static SymbolEntry getEntryFromTable(SymbolEntry[] table, int hash) {
return table[hash & (table.length - 1)];
}
private static boolean isSymbolMatch(String name, int hash, SymbolEntry entry) {
return hash == entry.hash && name.equals(entry.name);
}
private static boolean isSymbolMatch(String internedName, SymbolEntry entry) {
return internedName == entry.name;
}
private RubySymbol createSymbol(String name, ByteList value, int hash, SymbolEntry[] table) {
ReentrantLock lock;
(lock = tableLock).lock();
try {
int potentialNewSize;
if ((potentialNewSize = size + 1) > threshold) {
table = rehash();
} else {
table = symbolTable;
}
int index;
// try lookup again under lock
for (SymbolEntry e = table[index = hash & (table.length - 1)]; e != null; e = e.next) {
if (hash == e.hash && name.equals(e.name)) {
return e.symbol;
}
}
String internedName;
RubySymbol symbol = new RubySymbol(runtime, internedName = name.intern(), value);
table[index] = new SymbolEntry(hash, internedName, symbol, table[index]);
size = potentialNewSize;
// write-volatile
symbolTable = table;
return symbol;
} finally {
lock.unlock();
}
}
private RubySymbol fastCreateSymbol(String internedName, SymbolEntry[] table) {
ReentrantLock lock;
(lock = tableLock).lock();
try {
int potentialNewSize;
if ((potentialNewSize = size + 1) > threshold) {
table = rehash();
} else {
table = symbolTable;
}
int index;
int hash;
// try lookup again under lock
for (SymbolEntry e = table[index = (hash = internedName.hashCode()) & (table.length - 1)]; e != null; e = e.next) {
if (internedName == e.name) {
return e.symbol;
}
}
RubySymbol symbol = new RubySymbol(runtime, internedName);
table[index] = new SymbolEntry(hash, internedName, symbol, table[index]);
size = potentialNewSize;
// write-volatile
symbolTable = table;
return symbol;
} finally {
lock.unlock();
}
}
// backwards-compatibility, but threadsafe now
public RubySymbol lookup(String name) {
int hash = name.hashCode();
SymbolEntry[] table;
for (SymbolEntry e = (table = symbolTable)[hash & (table.length - 1)]; e != null; e = e.next) {
if (hash == e.hash && name.equals(e.name)) {
return e.symbol;
}
}
return null;
}
public RubySymbol lookup(long id) {
SymbolEntry[] table = symbolTable;
for (int i = table.length; --i >= 0; ) {
for (SymbolEntry e = table[i]; e != null; e = e.next) {
if (id == e.symbol.id) {
return e.symbol;
}
}
}
return null;
}
public RubyArray all_symbols() {
SymbolEntry[] table = this.symbolTable;
RubyArray array = runtime.newArray(this.size);
for (int i = table.length; --i >= 0; ) {
for (SymbolEntry e = table[i]; e != null; e = e.next) {
array.append(e.symbol);
}
}
return array;
}
// not so backwards-compatible here, but no one should have been
// calling this anyway.
@Deprecated
public void store(RubySymbol symbol) {
throw new UnsupportedOperationException();
}
private SymbolEntry[] rehash() {
SymbolEntry[] oldTable = symbolTable;
int oldCapacity;
if ((oldCapacity = oldTable.length) >= MAXIMUM_CAPACITY) {
return oldTable;
}
int newCapacity = oldCapacity << 1;
SymbolEntry[] newTable = new SymbolEntry[newCapacity];
threshold = (int)(newCapacity * loadFactor);
int sizeMask = newCapacity - 1;
SymbolEntry e;
for (int i = oldCapacity; --i >= 0; ) {
// We need to guarantee that any existing reads of old Map can
// proceed. So we cannot yet null out each bin.
e = oldTable[i];
if (e != null) {
SymbolEntry next = e.next;
int idx = e.hash & sizeMask;
// Single node on list
if (next == null)
newTable[idx] = e;
else {
// Reuse trailing consecutive sequence at same slot
SymbolEntry lastRun = e;
int lastIdx = idx;
for (SymbolEntry last = next;
last != null;
last = last.next) {
int k = last.hash & sizeMask;
if (k != lastIdx) {
lastIdx = k;
lastRun = last;
}
}
newTable[lastIdx] = lastRun;
// Clone all remaining nodes
for (SymbolEntry p = e; p != lastRun; p = p.next) {
int k = p.hash & sizeMask;
SymbolEntry n = newTable[k];
newTable[k] = new SymbolEntry(p.hash, p.name, p.symbol, n);
}
}
}
}
symbolTable = newTable;
return newTable;
}
}
}