emul/mini/src/main/resources/org/apidesign/vm4brwsr/emul/lang/java_lang_Number.js
author Martin Soch <Martin.Soch@oracle.com>
Mon, 04 Feb 2013 09:41:33 +0100
brancharithmetic
changeset 657 b42bfe334128
parent 630 04e312a7887e
child 669 3754580b6c67
permissions -rw-r--r--
Support for Long multiplication + tests
Martin@438
     1
// empty line needed here
Martin@445
     2
Number.prototype.add32 = function(x) { return (this + x) | 0; };
Martin@445
     3
Number.prototype.sub32 = function(x) { return (this - x) | 0; };
Martin@445
     4
Number.prototype.mul32 = function(x) { 
Martin@445
     5
    return (((this * (x >> 16)) << 16) + this * (x & 0xFFFF)) | 0;
Martin@438
     6
};
Martin@439
     7
Martin@445
     8
Number.prototype.toInt8 = function()  { return (this << 24) >> 24; };
Martin@582
     9
Number.prototype.toInt16 = function() { return (this << 16) >> 16; };
Martin@582
    10
Martin@615
    11
var __m32 = 0xFFFFFFFF;
Martin@615
    12
Martin@594
    13
Number.prototype.next32 = function(low) {
Martin@594
    14
  if (this === 0) {
Martin@594
    15
    return low;
Martin@594
    16
  }
Martin@594
    17
  var l = new Number(low);
Martin@616
    18
  l.hi = this | 0;
Martin@594
    19
  return l;
Martin@582
    20
};
Martin@582
    21
Martin@594
    22
Number.prototype.high32 = function() { 
Martin@615
    23
    return this.hi ? this.hi : (Math.floor(this / (__m32+1))) | 0;
Martin@594
    24
};
Martin@594
    25
Number.prototype.toInt32 = function() { return this | 0; };
Martin@594
    26
Number.prototype.toFP = function() {
Martin@615
    27
    return this.hi ? this.hi * (__m32+1) + this : this;
Martin@594
    28
};
Martin@594
    29
Number.prototype.toLong = function() {
Martin@615
    30
    var hi = (this > __m32) ? (Math.floor(this / (__m32+1))) | 0 : 0;
Martin@616
    31
    return hi.next32(Math.floor(this % (__m32+1)));
Martin@607
    32
};
Martin@607
    33
Martin@607
    34
Number.prototype.toExactString = function() {
Martin@607
    35
    if (this.hi) {
Martin@607
    36
        var res = 0;
Martin@607
    37
        var a = [ 6,9,2,7,6,9,4,9,2,4 ];
Martin@607
    38
        var s = '';
Martin@607
    39
        var digit;
Martin@607
    40
        var hi = this.hi;
Martin@607
    41
        var low = this;
Martin@607
    42
        for (var i = 0; i < a.length; i++) {
Martin@607
    43
            res += hi * a[i];
Martin@607
    44
            var low_digit = low % 10;
Martin@607
    45
            digit = (res % 10) + low_digit;
Martin@607
    46
Martin@607
    47
            low = Math.floor(low / 10);
Martin@607
    48
            res = Math.floor(res / 10);
Martin@607
    49
Martin@607
    50
            if (digit >= 10) {
Martin@607
    51
                digit -= 10;
Martin@607
    52
                res++;
Martin@607
    53
            }
Martin@607
    54
            s = String(digit).concat(s);
Martin@607
    55
        }
Martin@607
    56
        return String(res).concat(s);
Martin@607
    57
    }
Martin@607
    58
    return String(this);
Martin@607
    59
};
Martin@594
    60
Martin@594
    61
Number.prototype.add64 = function(x) {
Martin@594
    62
    var low = this + x;
Martin@594
    63
    carry = 0;
Martin@615
    64
    if (low > __m32) {
Martin@594
    65
        carry = 1;
Martin@615
    66
        low -= (__m32+1);
Martin@594
    67
    }
Martin@615
    68
    var hi = (this.high32() + x.high32() + carry) | 0;
Martin@594
    69
    return hi.next32(low);
Martin@582
    70
};
Martin@582
    71
Martin@620
    72
Number.prototype.sub64 = function(x) {
Martin@620
    73
    var low = this - x;
Martin@620
    74
    carry = 0;
Martin@620
    75
    if (low < 0) {
Martin@620
    76
        carry = 1;
Martin@620
    77
        low += (__m32+1);
Martin@620
    78
    }
Martin@620
    79
    var hi = (this.high32() - x.high32() - carry) | 0;
Martin@620
    80
    return hi.next32(low);
Martin@620
    81
};
Martin@620
    82
Martin@657
    83
Number.prototype.mul64 = function(x) {
Martin@657
    84
    var low = this.mul32(x);
Martin@657
    85
    low += (low < 0) ? (__m32+1) : 0;
Martin@657
    86
    // first count upper 32 bits of (this.low * x.low)
Martin@657
    87
    var hi_hi = 0;
Martin@657
    88
    var hi_low = 0;
Martin@657
    89
    var m = 1;
Martin@657
    90
    for (var i = 0; i < 32; i++) {
Martin@657
    91
        if (x & m) {
Martin@657
    92
            hi_hi += this >>> 16;
Martin@657
    93
            hi_low += this & 0xFFFF
Martin@657
    94
        }
Martin@657
    95
        hi_low >>= 1;
Martin@657
    96
        hi_low += (hi_hi & 1) ? 0x8000 : 0;
Martin@657
    97
        hi_hi >>= 1;
Martin@657
    98
        m <<= 1;
Martin@657
    99
    }
Martin@657
   100
    var hi = (hi_hi << 16) + hi_low;
Martin@657
   101
    
Martin@657
   102
    var m1 = this.high32().mul32(x);
Martin@657
   103
    var m2 = this.mul32(x.high32());
Martin@657
   104
    hi = hi.add32(m1).add32(m2);
Martin@657
   105
    
Martin@657
   106
    return hi.next32(low);
Martin@657
   107
};
Martin@657
   108
Martin@594
   109
Number.prototype.div64 = function(x) {
Martin@594
   110
    var low = Math.floor(this.toFP() / x.toFP()); // TODO: not exact enough
Martin@615
   111
    if (low > __m32) {
Martin@615
   112
        var hi = Math.floor(low / (__m32+1)) | 0;
Martin@615
   113
        return hi.next32(low % (__m32+1));
Martin@582
   114
    }
Martin@594
   115
    return low;
Martin@582
   116
};
Martin@582
   117
Martin@615
   118
Number.prototype.and64 = function(x) {
Martin@615
   119
    var low = this & x;
Martin@627
   120
    low += (low < 0) ? (__m32+1) : 0;
Martin@615
   121
    if (this.hi && x.hi) {
Martin@615
   122
        var hi = this.hi & x.hi;
Martin@615
   123
        return hi.next32(low);
Martin@615
   124
    };
Martin@615
   125
    return low;
Martin@615
   126
};
Martin@615
   127
Martin@627
   128
Number.prototype.or64 = function(x) {
Martin@627
   129
    var low = this | x;
Martin@627
   130
    low += (low < 0) ? (__m32+1) : 0;
Martin@627
   131
    if (this.hi || x.hi) {
Martin@627
   132
        var hi = this.hi | x.hi;
Martin@627
   133
        return hi.next32(low);
Martin@627
   134
    };
Martin@627
   135
    return low;
Martin@627
   136
};
Martin@627
   137
Martin@628
   138
Number.prototype.xor64 = function(x) {
Martin@628
   139
    var low = this ^ x;
Martin@628
   140
    low += (low < 0) ? (__m32+1) : 0;
Martin@628
   141
    if (this.hi || x.hi) {
Martin@628
   142
        var hi = this.hi ^ x.hi;
Martin@628
   143
        return hi.next32(low);
Martin@628
   144
    };
Martin@628
   145
    return low;
Martin@628
   146
};
Martin@628
   147
Martin@594
   148
Number.prototype.shl64 = function(x) {
Martin@616
   149
    if (x >= 32) {
Martin@629
   150
        var hi = this << (x - 32);
Martin@594
   151
        return hi.next32(0);
Martin@594
   152
    } else {
Martin@629
   153
        var hi = this.high32() << x;
Martin@615
   154
        var low_reminder = this >> (32 - x);
Martin@594
   155
        hi |= low_reminder;
Martin@594
   156
        var low = this << x;
Martin@616
   157
        low += (low < 0) ? (__m32+1) : 0;
Martin@594
   158
        return hi.next32(low);
Martin@594
   159
    }
Martin@582
   160
};
Martin@582
   161
Martin@615
   162
Number.prototype.shr64 = function(x) {
Martin@619
   163
    if (x >= 32) {
Martin@629
   164
        var low = this.high32() >> (x - 32);
Martin@619
   165
        low += (low < 0) ? (__m32+1) : 0;
Martin@615
   166
        return low;
Martin@615
   167
    } else {
Martin@629
   168
        var low = this >> x;
Martin@619
   169
        var hi_reminder = this.high32() << (32 - x);
Martin@615
   170
        low |= hi_reminder;
Martin@619
   171
        low += (low < 0) ? (__m32+1) : 0;
Martin@615
   172
        var hi = this.high32() >> x;
Martin@615
   173
        return hi.next32(low);
Martin@615
   174
    }
Martin@615
   175
};
Martin@615
   176
Martin@629
   177
Number.prototype.ushr64 = function(x) {
Martin@629
   178
    if (x >= 32) {
Martin@629
   179
        var low = this.high32() >>> (x - 32);
Martin@629
   180
        low += (low < 0) ? (__m32+1) : 0;
Martin@629
   181
        return low;
Martin@629
   182
    } else {
Martin@629
   183
        var low = this >>> x;
Martin@629
   184
        var hi_reminder = this.high32() << (32 - x);
Martin@629
   185
        low |= hi_reminder;
Martin@629
   186
        low += (low < 0) ? (__m32+1) : 0;
Martin@629
   187
        var hi = this.high32() >>> x;
Martin@629
   188
        return hi.next32(low);
Martin@629
   189
    }
Martin@629
   190
};
Martin@629
   191
Martin@594
   192
Number.prototype.compare64 = function(x) {
Martin@582
   193
    if (this.hi == x.hi) {
Martin@594
   194
        return (this == x) ? 0 : ((this < x) ? -1 : 1);
Martin@582
   195
    }
Martin@582
   196
    return (this.hi < x.hi) ? -1 : 1;
Martin@582
   197
};
Martin@630
   198
Martin@630
   199
Number.prototype.neg64 = function() {
Martin@630
   200
    var hi = this.high32();
Martin@630
   201
    var low = this;
Martin@630
   202
    if ((hi === 0) && (low < 0)) { return -low; }
Martin@630
   203
    hi = ~hi;
Martin@630
   204
    low = ~low;
Martin@630
   205
    low += (low < 0) ? (__m32+1) : 0;
Martin@630
   206
    return hi.next32(low);
Martin@630
   207
};