Lines Matching refs:w
29591 var j, w;
29596 w = number[i] | number[i - 1] << 8 | number[i - 2] << 16;
29597 this.words[j] |= w << off & 0x3ffffff;
29598 this.words[j + 1] = w >>> 26 - off & 0x3ffffff;
29608 w = number[i] | number[i + 1] << 8 | number[i + 2] << 16;
29609 this.words[j] |= w << off & 0x3ffffff;
29610 this.words[j + 1] = w >>> 26 - off & 0x3ffffff;
29652 var j, w; // Scan 24-bit chunks and add them to the number
29657 w = parseHex(number, i, i + 6);
29658 …this.words[j] |= w << off & 0x3ffffff; // NOTE: `0x3fffff` is intentional here, 26bits max shift +…
29660 this.words[j + 1] |= w >>> 26 - off & 0x3fffff;
29670 w = parseHex(number, start, i + 6);
29671 this.words[j] |= w << off & 0x3ffffff;
29672 this.words[j + 1] |= w >>> 26 - off & 0x3fffff;
29833 var w = this.words[i];
29834 var word = ((w << off | carry) & 0xffffff).toString(16);
29835 carry = w >>> 24 - off & 0xffffff;
29970 BN.prototype._countBits = function _countBits(w) {
29971 return 32 - Math.clz32(w);
29974 BN.prototype._countBits = function _countBits(w) {
29975 var t = w;
30002 BN.prototype._zeroBits = function _zeroBits(w) {
30004 if (w === 0) return 26;
30005 var t = w;
30037 var w = this.words[this.length - 1];
30039 var hi = this._countBits(w);
30045 var w = new Array(num.bitLength());
30047 for (var bit = 0; bit < w.length; bit++) {
30050 w[bit] = (num.words[off] & 1 << wbit) >>> wbit;
30053 return w;
31221 var w = Math.round(ws[2 * i + 1] / N) * 0x2000 + Math.round(ws[2 * i] / N) + carry;
31222 ws[i] = w & 0x3ffffff;
31224 if (w < 0x4000000) {
31227 carry = w / 0x4000000 | 0;
31324 var w = (this.words[i] | 0) * num;
31325 var lo = (w & 0x3ffffff) + (carry & 0x3ffffff);
31327 carry += w / 0x4000000 | 0; // NOTE: lo is 27bit maximum
31357 var w = toBitArray(num);
31358 if (w.length === 0) return new BN(1); // Skip leading zeroes
31362 for (var i = 0; i < w.length; i++, res = res.sqr()) {
31363 if (w[i] !== 0) break;
31366 if (++i < w.length) {
31367 for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) {
31368 if (w[i] === 0) continue;
31515 var w = this.words[s];
31516 return !!(w & q);
31641 var w;
31645 w = (this.words[i + shift] | 0) + carry;
31647 w -= right & 0x3ffffff;
31648 carry = (w >> 26) - (right / 0x4000000 | 0);
31649 this.words[i + shift] = w & 0x3ffffff;
31653 w = (this.words[i + shift] | 0) + carry;
31654 carry = w >> 26;
31655 this.words[i + shift] = w & 0x3ffffff;
31664 w = -(this.words[i] | 0) + carry;
31665 carry = w >> 26;
31666 this.words[i] = w & 0x3ffffff;
31902 var w = (this.words[i] | 0) + carry * 0x4000000;
31903 this.words[i] = w / num | 0;
31904 carry = w % num;
32149 var w = this.words[i] | 0;
32150 w += carry;
32151 carry = w >>> 26;
32152 w &= 0x3ffffff;
32153 this.words[i] = w;
32183 var w = this.words[0] | 0;
32184 res = w === num ? 0 : w < num ? -1 : 1;
32503 var w = num.words[i] | 0;
32504 lo += w * 0x3d1;
32506 lo = w * 0x40 + (lo / 0x4000000 | 0);
33181 var j, w;
33186 w = number[i] | number[i - 1] << 8 | number[i - 2] << 16;
33187 this.words[j] |= w << off & 0x3ffffff;
33188 this.words[j + 1] = w >>> 26 - off & 0x3ffffff;
33198 w = number[i] | number[i + 1] << 8 | number[i + 2] << 16;
33199 this.words[j] |= w << off & 0x3ffffff;
33200 this.words[j + 1] = w >>> 26 - off & 0x3ffffff;
33248 var j, w; // Scan 24-bit chunks and add them to the number
33253 w = parseHex(number, i, i + 6);
33254 …this.words[j] |= w << off & 0x3ffffff; // NOTE: `0x3fffff` is intentional here, 26bits max shift +…
33256 this.words[j + 1] |= w >>> 26 - off & 0x3fffff;
33266 w = parseHex(number, start, i + 6);
33267 this.words[j] |= w << off & 0x3ffffff;
33268 this.words[j + 1] |= w >>> 26 - off & 0x3fffff;
33456 var w = this.words[i];
33457 var word = ((w << off | carry) & 0xffffff).toString(16);
33458 carry = w >>> 24 - off & 0xffffff;
33654 BN.prototype._countBits = function _countBits(w) {
33655 return 32 - Math.clz32(w);
33658 BN.prototype._countBits = function _countBits(w) {
33659 var t = w;
33686 BN.prototype._zeroBits = function _zeroBits(w) {
33688 if (w === 0) return 26;
33689 var t = w;
33721 var w = this.words[this.length - 1];
33723 var hi = this._countBits(w);
33729 var w = new Array(num.bitLength());
33731 for (var bit = 0; bit < w.length; bit++) {
33734 w[bit] = num.words[off] >>> wbit & 0x01;
33737 return w;
34907 var w = Math.round(ws[2 * i + 1] / N) * 0x2000 + Math.round(ws[2 * i] / N) + carry;
34908 ws[i] = w & 0x3ffffff;
34910 if (w < 0x4000000) {
34913 carry = w / 0x4000000 | 0;
35012 var w = (this.words[i] | 0) * num;
35013 var lo = (w & 0x3ffffff) + (carry & 0x3ffffff);
35015 carry += w / 0x4000000 | 0; // NOTE: lo is 27bit maximum
35045 var w = toBitArray(num);
35046 if (w.length === 0) return new BN(1); // Skip leading zeroes
35050 for (var i = 0; i < w.length; i++, res = res.sqr()) {
35051 if (w[i] !== 0) break;
35054 if (++i < w.length) {
35055 for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) {
35056 if (w[i] === 0) continue;
35203 var w = this.words[s];
35204 return !!(w & q);
35329 var w;
35333 w = (this.words[i + shift] | 0) + carry;
35335 w -= right & 0x3ffffff;
35336 carry = (w >> 26) - (right / 0x4000000 | 0);
35337 this.words[i + shift] = w & 0x3ffffff;
35341 w = (this.words[i + shift] | 0) + carry;
35342 carry = w >> 26;
35343 this.words[i + shift] = w & 0x3ffffff;
35352 w = -(this.words[i] | 0) + carry;
35353 carry = w >> 26;
35354 this.words[i] = w & 0x3ffffff;
35600 var w = (this.words[i] | 0) + carry * 0x4000000;
35601 this.words[i] = w / num | 0;
35602 carry = w % num;
35849 var w = this.words[i] | 0;
35850 w += carry;
35851 carry = w >>> 26;
35852 w &= 0x3ffffff;
35853 this.words[i] = w;
35885 var w = this.words[0] | 0;
35886 res = w === num ? 0 : w < num ? -1 : 1;
36205 var w = num.words[i] | 0;
36206 lo += w * 0x3d1;
36208 lo = w * 0x40 + (lo / 0x4000000 | 0);
38639 var w = s.invm(q);
38640 …var v = g.toRed(montp).redPow(new BN(hash).mul(w).mod(q)).fromRed().mul(y.toRed(montp).redPow(r.mu…
44053 w: s,
44096 g.l = D, g.i = m, g.w = function (t, e) {
44155 var n = g.w(h.$u ? Date.UTC(h.$y, e, t) : new Date(h.$y, e, t), h);
44159 …return g.w(h.toDate()[t].apply(h.toDate("s"), (c ? [0, 0, 0, 0] : [23, 59, 59, 999]).slice(e)), h);
44221 return g.w(n.date(n.date() + Math.round(e * t)), h);
44230 return g.w(l, this);
44305 return g.w(this.$d, this);
45727 var w = 4; // Precompute window
45729 var nafPoints = p._getNAFPoints(w);
45731 w = nafPoints.wnd;
45734 var naf = getNAF(k, w, this._bitLength); // Add `this`*(N+1) for every w-NAF index
48369 function getNAF(num, w, bits) {
48372 var ws = 1 << w + 1;
48809 …var w = new Error('Possible EventEmitter memory leak detected. ' + existing.length + ' "' + String…
48810 w.name = 'MaxListenersExceededWarning';
48811 w.emitter = target;
48812 w.type = type;
48813 w.count = existing.length;
48816 console.warn('%s: %s', w.name, w.message);
50178 function htonl(w) {
50179 var res = w >>> 24 | w >>> 8 & 0xff00 | w << 8 & 0xff0000 | (w & 0xff) << 24;
50189 var w = msg[i];
50190 if (endian === 'little') w = htonl(w);
50191 res += zero8(w.toString(16));
50217 var w;
50218 …if (endian === 'big') w = msg[k] << 24 | msg[k + 1] << 16 | msg[k + 2] << 8 | msg[k + 3];else w = …
50219 res[i] = w >>> 0;
50251 function rotr32(w, b) {
50252 return w >>> b | w << 32 - b;
50257 function rotl32(w, b) {
50258 return w << b | w >>> 32 - b;
68573 function put_short(s, w) {
68576 s.pending_buf[s.pending++] = w & 0xff;
68577 s.pending_buf[s.pending++] = w >>> 8 & 0xff;