forked from jruby/jruby
/
Sprintf.java
1575 lines (1423 loc) · 66.8 KB
/
Sprintf.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
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
/***** BEGIN LICENSE BLOCK *****
* Version: EPL 1.0/GPL 2.0/LGPL 2.1
*
* The contents of this file are subject to the Eclipse 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/epl-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) 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 EPL, 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 EPL, the GPL or the LGPL.
***** END LICENSE BLOCK *****/
package org.jruby.util;
import java.math.BigInteger;
import java.text.DecimalFormatSymbols;
import java.text.NumberFormat;
import java.util.HashMap;
import java.util.Locale;
import java.util.Map;
import org.jcodings.Encoding;
import org.jcodings.specific.UTF8Encoding;
import org.jruby.Ruby;
import org.jruby.RubyArray;
import org.jruby.RubyBignum;
import org.jruby.RubyFixnum;
import org.jruby.RubyFloat;
import org.jruby.RubyHash;
import org.jruby.RubyInteger;
import org.jruby.RubyKernel;
import org.jruby.RubyNumeric;
import org.jruby.RubyString;
import org.jruby.RubySymbol;
import org.jruby.common.IRubyWarnings.ID;
import org.jruby.runtime.Block;
import org.jruby.runtime.ClassIndex;
import org.jruby.runtime.builtin.IRubyObject;
/**
* @author Bill Dortch
*
*/
public class Sprintf {
private static final int FLAG_NONE = 0;
private static final int FLAG_SPACE = 1;
private static final int FLAG_ZERO = 1 << 1;
private static final int FLAG_PLUS = 1 << 2;
private static final int FLAG_MINUS = 1 << 3;
private static final int FLAG_SHARP = 1 << 4;
private static final int FLAG_WIDTH = 1 << 5;
private static final int FLAG_PRECISION = 1 << 6;
private static final byte[] PREFIX_OCTAL = {'0'};
private static final byte[] PREFIX_HEX_LC = {'0','x'};
private static final byte[] PREFIX_HEX_UC = {'0','X'};
private static final byte[] PREFIX_BINARY_LC = {'0','b'};
private static final byte[] PREFIX_BINARY_UC = {'0','B'};
private static final byte[] PREFIX_NEGATIVE = {'.','.'};
private static final byte[] NAN_VALUE = {'N','a','N'};
private static final byte[] INFINITY_VALUE = {'I','n','f'};
private static final BigInteger BIG_32 = BigInteger.valueOf(((long)Integer.MAX_VALUE + 1L) << 1);
private static final BigInteger BIG_64 = BIG_32.shiftLeft(32);
private static final BigInteger BIG_MINUS_32 = BigInteger.valueOf((long)Integer.MIN_VALUE << 1);
private static final BigInteger BIG_MINUS_64 = BIG_MINUS_32.shiftLeft(32);
private static final String ERR_MALFORMED_FORMAT = "malformed format string";
private static final String ERR_MALFORMED_NUM = "malformed format string - %[0-9]";
private static final String ERR_MALFORMED_DOT_NUM = "malformed format string - %.[0-9]";
private static final String ERR_MALFORMED_STAR_NUM = "malformed format string - %*[0-9]";
private static final String ERR_ILLEGAL_FORMAT_CHAR = "illegal format character - %";
private static final String ERR_MALFORMED_NAME = "malformed name - unmatched parenthesis";
private static final ThreadLocal<Map<Locale, NumberFormat>> LOCALE_NUMBER_FORMATS = new ThreadLocal<Map<Locale, NumberFormat>>() {
protected Map<Locale, NumberFormat> initialValue() {
return new HashMap<Locale, NumberFormat>();
}
};
private static final ThreadLocal<Map<Locale, DecimalFormatSymbols>> LOCALE_DECIMAL_FORMATS = new ThreadLocal<Map<Locale, DecimalFormatSymbols>>() {
protected Map<Locale, DecimalFormatSymbols> initialValue() {
return new HashMap<Locale, DecimalFormatSymbols>();
}
};
private static final class Args {
private final Ruby runtime;
private final Locale locale;
private final IRubyObject rubyObject;
private final RubyArray rubyArray;
private final RubyHash rubyHash;
private final int length;
private int unnumbered; // last index (+1) accessed by next()
private int numbered; // last index (+1) accessed by get()
Args(Locale locale, IRubyObject rubyObject) {
if (rubyObject == null) throw new IllegalArgumentException("null IRubyObject passed to sprintf");
this.locale = locale == null ? Locale.getDefault() : locale;
this.rubyObject = rubyObject;
if (rubyObject instanceof RubyArray) {
this.rubyArray = (RubyArray)rubyObject;
this.rubyHash = null;
this.length = rubyArray.size();
} else if (rubyObject instanceof RubyHash && rubyObject.getRuntime().is1_9()) {
// allow a hash for args if in 1.9 mode
this.rubyHash = (RubyHash)rubyObject;
this.rubyArray = null;
this.length = -1;
} else {
this.length = 1;
this.rubyArray = null;
this.rubyHash = null;
}
this.runtime = rubyObject.getRuntime();
}
Args(IRubyObject rubyObject) {
this(Locale.getDefault(),rubyObject);
}
// temporary hack to handle non-Ruby values
// will come up with better solution shortly
Args(Ruby runtime, long value) {
this(RubyFixnum.newFixnum(runtime,value));
}
void raiseArgumentError(String message) {
throw runtime.newArgumentError(message);
}
void raiseKeyError(String message) {
throw runtime.newKeyError(message);
}
void warn(ID id, String message) {
runtime.getWarnings().warn(id, message);
}
void warning(ID id, String message) {
if (runtime.isVerbose()) runtime.getWarnings().warning(id, message);
}
IRubyObject next(ByteList name) {
// for 1.9 hash args
if (runtime.is1_9()) {
if (name != null) {
if (rubyHash == null) raiseArgumentError("positional args mixed with named args");
IRubyObject object = rubyHash.fastARef(runtime.newSymbol(name));
if (object == null) raiseKeyError("key<" + name + "> not found");
return object;
} else if (rubyHash != null) {
raiseArgumentError("positional args mixed with named args");
}
}
// this is the order in which MRI does these two tests
if (numbered > 0) raiseArgumentError("unnumbered" + (unnumbered + 1) + "mixed with numbered");
if (unnumbered >= length) raiseArgumentError("too few arguments");
IRubyObject object = rubyArray == null ? rubyObject : rubyArray.eltInternal(unnumbered);
unnumbered++;
return object;
}
IRubyObject get(int index) {
// for 1.9 hash args
if (rubyHash != null) raiseArgumentError("positional args mixed with named args");
// this is the order in which MRI does these tests
if (unnumbered > 0) raiseArgumentError("numbered("+numbered+") after unnumbered("+unnumbered+")");
if (index < 0) raiseArgumentError("invalid index - " + (index + 1) + '$');
if (index >= length) raiseArgumentError("too few arguments");
numbered = index + 1;
return rubyArray == null ? rubyObject : rubyArray.eltInternal(index);
}
IRubyObject getNth(int formatIndex) {
return get(formatIndex - 1);
}
int nextInt() {
return intValue(next(null));
}
int getNthInt(int formatIndex) {
return intValue(get(formatIndex - 1));
}
int intValue(IRubyObject obj) {
if (obj instanceof RubyNumeric) return (int)((RubyNumeric)obj).getLongValue();
// basically just forcing a TypeError here to match MRI
obj = TypeConverter.convertToType(obj, obj.getRuntime().getFixnum(), "to_int", true);
return (int)((RubyFixnum)obj).getLongValue();
}
byte getDecimalSeparator() {
return (byte)getDecimalFormat(locale).getDecimalSeparator();
}
} // Args
// static methods only
private Sprintf () {}
// Special form of sprintf that returns a RubyString and handles
// tainted strings correctly.
public static boolean sprintf(ByteList to, Locale locale, CharSequence format, IRubyObject args) {
return rubySprintfToBuffer(to, format, new Args(locale, args));
}
// Special form of sprintf that returns a RubyString and handles
// tainted strings correctly. Version for 1.9.
public static boolean sprintf1_9(ByteList to, Locale locale, CharSequence format, IRubyObject args) {
return rubySprintfToBuffer(to, format, new Args(locale, args), false);
}
public static boolean sprintf(ByteList to, CharSequence format, IRubyObject args) {
return rubySprintf(to, format, new Args(args));
}
public static boolean sprintf(Ruby runtime, ByteList to, CharSequence format, int arg) {
return rubySprintf(to, format, new Args(runtime, (long)arg));
}
public static boolean sprintf(ByteList to, RubyString format, IRubyObject args) {
return rubySprintf(to, format.getByteList(), new Args(args));
}
private static boolean rubySprintf(ByteList to, CharSequence charFormat, Args args) {
return rubySprintfToBuffer(to, charFormat, args);
}
private static boolean rubySprintfToBuffer(ByteList buf, CharSequence charFormat, Args args) {
return rubySprintfToBuffer(buf, charFormat, args, true);
}
private static boolean rubySprintfToBuffer(ByteList buf, CharSequence charFormat, Args args, boolean usePrefixForZero) {
Ruby runtime = args.runtime;
boolean tainted = false;
final byte[] format;
int offset;
int length;
int start;
int mark;
ByteList name = null;
Encoding encoding = null;
// used for RubyString functions to manage encoding, etc
RubyString wrapper = RubyString.newString(runtime, buf);
if (charFormat instanceof ByteList) {
ByteList list = (ByteList)charFormat;
format = list.getUnsafeBytes();
int begin = list.begin();
offset = begin;
length = begin + list.length();
start = begin;
mark = begin;
encoding = list.getEncoding();
} else {
format = stringToBytes(charFormat, false);
offset = 0;
length = charFormat.length();
start = 0;
mark = 0;
encoding = UTF8Encoding.INSTANCE;
}
while (offset < length) {
start = offset;
for ( ; offset < length && format[offset] != '%'; offset++) {}
if (offset > start) {
buf.append(format,start,offset-start);
start = offset;
}
if (offset++ >= length) break;
IRubyObject arg = null;
int flags = 0;
int width = 0;
int precision = 0;
int number = 0;
byte fchar = 0;
boolean incomplete = true;
for ( ; incomplete && offset < length ; ) {
switch (fchar = format[offset]) {
default:
if (fchar == '\0' && flags == FLAG_NONE) {
// MRI 1.8.6 behavior: null byte after '%'
// leads to "%" string. Null byte in
// other places, like "%5\0", leads to error.
buf.append('%');
buf.append(fchar);
incomplete = false;
offset++;
break;
} else if (isPrintable(fchar)) {
raiseArgumentError(args,"malformed format string - %" + (char)fchar);
} else {
raiseArgumentError(args,ERR_MALFORMED_FORMAT);
}
break;
case '<': {
// Ruby 1.9 named args
int nameStart = ++offset;
int nameEnd = nameStart;
for ( ; offset < length ; offset++) {
if (format[offset] == '>') {
nameEnd = offset;
offset++;
break;
}
}
if (nameEnd == nameStart) raiseArgumentError(args, ERR_MALFORMED_NAME);
ByteList oldName = name;
name = new ByteList(format, nameStart, nameEnd - nameStart, encoding, false);
if (oldName != null) raiseArgumentError(args, "name<" + name + "> after <" + oldName + ">");
break;
}
case '{': {
// Ruby 1.9 named replacement
int nameStart = ++offset;
int nameEnd = nameStart;
for ( ; offset < length ; offset++) {
if (format[offset] == '}') {
nameEnd = offset;
offset++;
break;
}
}
if (nameEnd == nameStart) raiseArgumentError(args, ERR_MALFORMED_NAME);
ByteList localName = new ByteList(format, nameStart, nameEnd - nameStart, encoding, false);
buf.append(args.next(localName).asString().getByteList());
incomplete = false;
break;
}
case ' ':
flags |= FLAG_SPACE;
offset++;
break;
case '0':
flags |= FLAG_ZERO;
offset++;
break;
case '+':
flags |= FLAG_PLUS;
offset++;
break;
case '-':
flags |= FLAG_MINUS;
offset++;
break;
case '#':
flags |= FLAG_SHARP;
offset++;
break;
case '1':case '2':case '3':case '4':case '5':
case '6':case '7':case '8':case '9':
// MRI doesn't flag it as an error if width is given multiple
// times as a number (but it does for *)
number = 0;
for ( ; offset < length && isDigit(fchar = format[offset]); offset++) {
number = extendWidth(args, number, fchar);
}
checkOffset(args,offset,length,ERR_MALFORMED_NUM);
if (fchar == '$') {
if (arg != null) {
raiseArgumentError(args,"value given twice - " + number + "$");
}
arg = args.getNth(number);
offset++;
} else {
width = number;
flags |= FLAG_WIDTH;
}
break;
case '*':
if ((flags & FLAG_WIDTH) != 0) {
raiseArgumentError(args,"width given twice");
}
flags |= FLAG_WIDTH;
// TODO: factor this chunk as in MRI/YARV GETASTER
checkOffset(args,++offset,length,ERR_MALFORMED_STAR_NUM);
mark = offset;
number = 0;
for ( ; offset < length && isDigit(fchar = format[offset]); offset++) {
number = extendWidth(args,number,fchar);
}
checkOffset(args,offset,length,ERR_MALFORMED_STAR_NUM);
if (fchar == '$') {
width = args.getNthInt(number);
if (width < 0) {
flags |= FLAG_MINUS;
width = -width;
}
offset++;
} else {
width = args.nextInt();
if (width < 0) {
flags |= FLAG_MINUS;
width = -width;
}
// let the width (if any), get processed in the next loop,
// so any leading 0 gets treated correctly
offset = mark;
}
break;
case '.':
if ((flags & FLAG_PRECISION) != 0) {
raiseArgumentError(args,"precision given twice");
}
flags |= FLAG_PRECISION;
checkOffset(args,++offset,length,ERR_MALFORMED_DOT_NUM);
fchar = format[offset];
if (fchar == '*') {
// TODO: factor this chunk as in MRI/YARV GETASTER
checkOffset(args,++offset,length,ERR_MALFORMED_STAR_NUM);
mark = offset;
number = 0;
for ( ; offset < length && isDigit(fchar = format[offset]); offset++) {
number = extendWidth(args,number,fchar);
}
checkOffset(args,offset,length,ERR_MALFORMED_STAR_NUM);
if (fchar == '$') {
precision = args.getNthInt(number);
if (precision < 0) {
flags &= ~FLAG_PRECISION;
}
offset++;
} else {
precision = args.nextInt();
if (precision < 0) {
flags &= ~FLAG_PRECISION;
}
// let the width (if any), get processed in the next loop,
// so any leading 0 gets treated correctly
offset = mark;
}
} else {
number = 0;
for ( ; offset < length && isDigit(fchar = format[offset]); offset++) {
number = extendWidth(args,number,fchar);
}
checkOffset(args,offset,length,ERR_MALFORMED_DOT_NUM);
precision = number;
}
break;
case '\n':
offset--;
case '%':
if (flags != FLAG_NONE) {
raiseArgumentError(args,ERR_ILLEGAL_FORMAT_CHAR);
}
buf.append('%');
offset++;
incomplete = false;
break;
case 'c': {
if (arg == null || name != null) {
arg = args.next(name);
name = null;
}
int c = 0;
// MRI 1.8.5-p12 doesn't support 1-char strings, but
// YARV 0.4.1 does. I don't think it hurts to include
// this; sprintf('%c','a') is nicer than sprintf('%c','a'[0])
if (arg instanceof RubyString) {
ByteList bytes = ((RubyString)arg).getByteList();
if (bytes.length() == 1) {
c = bytes.getUnsafeBytes()[bytes.begin()];
} else {
raiseArgumentError(args,"%c requires a character");
}
} else {
c = args.intValue(arg);
}
if ((flags & FLAG_WIDTH) != 0 && width > 1) {
if ((flags & FLAG_MINUS) != 0) {
buf.append(c);
buf.fill(' ', width-1);
} else {
buf.fill(' ',width-1);
buf.append(c);
}
} else {
buf.append(c);
}
offset++;
incomplete = false;
break;
}
case 'p':
case 's': {
if (arg == null || name != null) {
arg = args.next(name);
name = null;
}
if (fchar == 'p') {
arg = arg.callMethod(arg.getRuntime().getCurrentContext(),"inspect");
}
RubyString strArg = arg.asString();
ByteList bytes = strArg.getByteList();
Encoding enc = wrapper.checkEncoding(strArg);
int len = bytes.length();
int strLen = strArg.strLength();
if (arg.isTaint()) tainted = true;
if ((flags & FLAG_PRECISION) != 0 && precision < len) {
// TODO: precision is not considering actual character length
// See below as well.
len = precision;
strLen = precision;
}
// TODO: adjust length so it won't fall in the middle
// of a multi-byte character. MRI's sprintf.c uses tables
// in a modified version of regex.c, which assume some
// particular encoding for a given installation/application.
// (See regex.c#re_mbcinit in ruby-1.8.5-p12)
//
// This is only an issue if the user specifies a precision
// that causes the string to be truncated. The same issue
// would arise taking a substring of a ByteList-backed RubyString.
if ((flags & FLAG_WIDTH) != 0 && width > strLen) {
width -= strLen;
if ((flags & FLAG_MINUS) != 0) {
buf.append(bytes.getUnsafeBytes(),bytes.begin(),len);
buf.fill(' ',width);
} else {
buf.fill(' ',width);
buf.append(bytes.getUnsafeBytes(),bytes.begin(),len);
}
} else {
buf.append(bytes.getUnsafeBytes(),bytes.begin(),len);
}
offset++;
incomplete = false;
buf.setEncoding(enc);
break;
}
case 'd':
case 'i':
case 'o':
case 'x':
case 'X':
case 'b':
case 'B':
case 'u': {
if (arg == null || name != null) {
arg = args.next(name);
name = null;
}
int type = arg.getMetaClass().index;
if (type != ClassIndex.FIXNUM && type != ClassIndex.BIGNUM) {
switch(type) {
case ClassIndex.FLOAT:
arg = RubyNumeric.dbl2num(arg.getRuntime(),((RubyFloat)arg).getValue());
break;
case ClassIndex.STRING:
arg = ((RubyString)arg).stringToInum(0, true);
break;
default:
if (arg.respondsTo("to_int")) {
arg = TypeConverter.convertToType(arg, arg.getRuntime().getInteger(), "to_int", true);
} else {
arg = TypeConverter.convertToType(arg, arg.getRuntime().getInteger(), "to_i", true);
}
break;
}
type = arg.getMetaClass().index;
}
byte[] bytes = null;
int first = 0;
byte[] prefix = null;
boolean sign;
boolean negative;
byte signChar = 0;
byte leadChar = 0;
int base;
// 'd' and 'i' are the same
if (fchar == 'i') fchar = 'd';
// 'u' with space or plus flags is same as 'd'
if (fchar == 'u' && (flags & (FLAG_SPACE | FLAG_PLUS)) != 0) {
fchar = 'd';
}
sign = (fchar == 'd' || (flags & (FLAG_SPACE | FLAG_PLUS)) != 0);
switch (fchar) {
case 'o':
base = 8; break;
case 'x':
case 'X':
base = 16; break;
case 'b':
case 'B':
base = 2; break;
case 'u':
case 'd':
default:
base = 10; break;
}
// We depart here from strict adherence to MRI code, as MRI
// uses C-sprintf, in part, to format numeric output, while
// we'll use Java's numeric formatting code (and our own).
boolean zero;
if (type == ClassIndex.FIXNUM) {
negative = ((RubyFixnum)arg).getLongValue() < 0;
zero = ((RubyFixnum)arg).getLongValue() == 0;
if (negative && fchar == 'u') {
bytes = getUnsignedNegativeBytes((RubyFixnum)arg);
} else {
bytes = getFixnumBytes((RubyFixnum)arg,base,sign,fchar=='X');
}
} else {
negative = ((RubyBignum)arg).getValue().signum() < 0;
zero = ((RubyBignum)arg).getValue().equals(BigInteger.ZERO);
if (negative && fchar == 'u' && usePrefixForZero) {
bytes = getUnsignedNegativeBytes((RubyBignum)arg);
} else {
bytes = getBignumBytes((RubyBignum)arg,base,sign,fchar=='X');
}
}
if ((flags & FLAG_SHARP) != 0) {
if (!zero || usePrefixForZero) {
switch (fchar) {
case 'o': prefix = PREFIX_OCTAL; break;
case 'x': prefix = PREFIX_HEX_LC; break;
case 'X': prefix = PREFIX_HEX_UC; break;
case 'b': prefix = PREFIX_BINARY_LC; break;
case 'B': prefix = PREFIX_BINARY_UC; break;
}
}
if (prefix != null) width -= prefix.length;
}
int len = 0;
if (sign) {
if (negative) {
signChar = '-';
width--;
first = 1; // skip '-' in bytes, will add where appropriate
} else if ((flags & FLAG_PLUS) != 0) {
signChar = '+';
width--;
} else if ((flags & FLAG_SPACE) != 0) {
signChar = ' ';
width--;
}
} else if (negative) {
if (base == 10) {
warning(ID.NEGATIVE_NUMBER_FOR_U, args, "negative number for %u specifier");
leadChar = '.';
len += 2;
} else {
if ((flags & (FLAG_PRECISION | FLAG_ZERO)) == 0) len += 2; // ..
first = skipSignBits(bytes,base);
switch(fchar) {
case 'b':
case 'B':
leadChar = '1';
break;
case 'o':
leadChar = '7';
break;
case 'x':
leadChar = 'f';
break;
case 'X':
leadChar = 'F';
break;
}
if (leadChar != 0) len++;
}
}
int numlen = bytes.length - first;
len += numlen;
if ((flags & (FLAG_ZERO|FLAG_PRECISION)) == FLAG_ZERO) {
precision = width;
width = 0;
} else {
if (precision < len) precision = len;
width -= precision;
}
if ((flags & FLAG_MINUS) == 0) {
buf.fill(' ',width);
width = 0;
}
if (signChar != 0) buf.append(signChar);
if (prefix != null) buf.append(prefix);
if (len < precision) {
if (leadChar == 0) {
if (fchar != 'd' || usePrefixForZero || !negative ||
(flags & FLAG_PRECISION) != 0 ||
((flags & FLAG_ZERO) != 0 && (flags & FLAG_MINUS) == 0)) {
buf.fill('0', precision - len);
}
} else if (leadChar == '.') {
buf.fill(leadChar,precision-len);
buf.append(PREFIX_NEGATIVE);
} else if (!usePrefixForZero) {
buf.append(PREFIX_NEGATIVE);
buf.fill(leadChar,precision - len - 1);
} else {
buf.fill(leadChar,precision-len+1); // the 1 is for the stripped sign char
}
} else if (leadChar != 0) {
if (((flags & (FLAG_PRECISION | FLAG_ZERO)) == 0 && usePrefixForZero) ||
(!usePrefixForZero && "xXbBo".indexOf(fchar) != -1)) {
buf.append(PREFIX_NEGATIVE);
}
if (leadChar != '.') buf.append(leadChar);
}
buf.append(bytes,first,numlen);
if (width > 0) buf.fill(' ',width);
if (len < precision && fchar == 'd' && negative &&
!usePrefixForZero && (flags & FLAG_MINUS) != 0) {
buf.fill(' ', precision - len);
}
offset++;
incomplete = false;
break;
}
case 'E':
case 'e':
case 'f':
case 'G':
case 'g': {
if (arg == null || name != null) {
arg = args.next(name);
name = null;
}
if (!(arg instanceof RubyFloat)) {
// FIXME: what is correct 'recv' argument?
// (this does produce the desired behavior)
if (usePrefixForZero) {
arg = RubyKernel.new_float(arg,arg);
} else {
arg = RubyKernel.new_float19(arg,arg);
}
}
double dval = ((RubyFloat)arg).getDoubleValue();
boolean nan = dval != dval;
boolean inf = dval == Double.POSITIVE_INFINITY || dval == Double.NEGATIVE_INFINITY;
boolean negative = dval < 0.0d || (dval == 0.0d && (new Float(dval)).equals(new Float(-0.0)));
byte[] digits;
int nDigits = 0;
int exponent = 0;
int len = 0;
byte signChar;
if (nan || inf) {
if (nan) {
digits = NAN_VALUE;
len = NAN_VALUE.length;
} else {
digits = INFINITY_VALUE;
len = INFINITY_VALUE.length;
}
if (negative) {
signChar = '-';
width--;
} else if ((flags & FLAG_PLUS) != 0) {
signChar = '+';
width--;
} else if ((flags & FLAG_SPACE) != 0) {
signChar = ' ';
width--;
} else {
signChar = 0;
}
width -= len;
if (width > 0 && (flags & (FLAG_ZERO|FLAG_MINUS)) == 0) {
buf.fill(' ',width);
width = 0;
}
if (signChar != 0) buf.append(signChar);
if (width > 0 && (flags & FLAG_MINUS) == 0) {
buf.fill('0',width);
width = 0;
}
buf.append(digits);
if (width > 0) buf.fill(' ', width);
offset++;
incomplete = false;
break;
}
NumberFormat nf = getNumberFormat(args.locale);
nf.setMaximumFractionDigits(Integer.MAX_VALUE);
String str = nf.format(dval);
// grrr, arghh, want to subclass sun.misc.FloatingDecimal, but can't,
// so we must do all this (the next 70 lines of code), which has already
// been done by FloatingDecimal.
int strlen = str.length();
digits = new byte[strlen];
int nTrailingZeroes = 0;
int i = negative ? 1 : 0;
int decPos = 0;
byte ival;
int_loop:
for ( ; i < strlen ; ) {
switch(ival = (byte)str.charAt(i++)) {
case '0':
if (nDigits > 0) nTrailingZeroes++;
break; // switch
case '1': case '2': case '3': case '4':
case '5': case '6': case '7': case '8': case '9':
if (nTrailingZeroes > 0) {
for ( ; nTrailingZeroes > 0 ; nTrailingZeroes-- ) {
digits[nDigits++] = '0';
}
}
digits[nDigits++] = ival;
break; // switch
case '.':
break int_loop;
}
}
decPos = nDigits + nTrailingZeroes;
dec_loop:
for ( ; i < strlen ; ) {
switch(ival = (byte)str.charAt(i++)) {
case '0':
if (nDigits > 0) {
nTrailingZeroes++;
} else {
exponent--;
}
break; // switch
case '1': case '2': case '3': case '4':
case '5': case '6': case '7': case '8': case '9':
if (nTrailingZeroes > 0) {
for ( ; nTrailingZeroes > 0 ; nTrailingZeroes-- ) {
digits[nDigits++] = '0';
}
}
digits[nDigits++] = ival;
break; // switch
case 'E':
break dec_loop;
}
}
if (i < strlen) {
int expSign;
int expVal = 0;
if (str.charAt(i) == '-') {
expSign = -1;
i++;
} else {
expSign = 1;
}
for ( ; i < strlen ; ) {
expVal = expVal * 10 + ((int)str.charAt(i++)-(int)'0');
}
exponent += expVal * expSign;
}
exponent += decPos - nDigits;
// gotta have at least a zero...
if (nDigits == 0) {
digits[0] = '0';
nDigits = 1;
exponent = 0;
}
// OK, we now have the significand in digits[0...nDigits]
// and the exponent in exponent. We're ready to format.
int intDigits, intZeroes, intLength;
int decDigits, decZeroes, decLength;
byte expChar;
if (negative) {
signChar = '-';
width--;
} else if ((flags & FLAG_PLUS) != 0) {
signChar = '+';
width--;
} else if ((flags & FLAG_SPACE) != 0) {
signChar = ' ';
width--;
} else {
signChar = 0;
}
if ((flags & FLAG_PRECISION) == 0) {
precision = 6;
}
switch(fchar) {
case 'E':
case 'G':
expChar = 'E';
break;
case 'e':
case 'g':
expChar = 'e';
break;
default:
expChar = 0;
}
switch (fchar) {
case 'g':
case 'G':
// an empirically derived rule: precision applies to
// significand length, irrespective of exponent
// an official rule, clarified: if the exponent
// <clarif>after adjusting for exponent form</clarif>
// is < -4, or the exponent <clarif>after adjusting
// for exponent form</clarif> is greater than the
// precision, use exponent form
boolean expForm = (exponent + nDigits - 1 < -4 ||
exponent + nDigits > (precision == 0 ? 1 : precision));
// it would be nice (and logical!) if exponent form
// behaved like E/e, and decimal form behaved like f,
// but no such luck. hence:
if (expForm) {
// intDigits isn't used here, but if it were, it would be 1
/* intDigits = 1; */
decDigits = nDigits - 1;
// precision for G/g includes integer digits
precision = Math.max(0,precision - 1);
if (precision < decDigits) {
int n = round(digits,nDigits,precision,precision!=0);
if (n > nDigits) nDigits = n;
decDigits = Math.min(nDigits - 1,precision);
}
exponent += nDigits - 1;
boolean isSharp = (flags & FLAG_SHARP) != 0;
// deal with length/width
len++; // first digit is always printed
// MRI behavior: Be default, 2 digits
// in the exponent. Use 3 digits
// only when necessary.
// See comment for writeExp method for more details.
if (exponent > 99) {
len += 5; // 5 -> e+nnn / e-nnn
} else {
len += 4; // 4 -> e+nn / e-nn