visaljs 0.0.2 → 0.0.3

package/runtime/third_party/bearssl/src/int/i31_montmul.c

@@ -1,127 +0,0 @@
-/*
- * Copyright (c) 2016 Thomas Pornin <pornin@bolet.org>
- *
- * Permission is hereby granted, free of charge, to any person obtaining 
- * a copy of this software and associated documentation files (the
- * "Software"), to deal in the Software without restriction, including
- * without limitation the rights to use, copy, modify, merge, publish,
- * distribute, sublicense, and/or sell copies of the Software, and to
- * permit persons to whom the Software is furnished to do so, subject to
- * the following conditions:
- *
- * The above copyright notice and this permission notice shall be 
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- */
-
-#include "inner.h"
-
-/* see inner.h */
-void
-br_i31_montymul(uint32_t *d, const uint32_t *x, const uint32_t *y,
-	const uint32_t *m, uint32_t m0i)
-{
-	/*
-	 * Each outer loop iteration computes:
-	 *   d <- (d + xu*y + f*m) / 2^31
-	 * We have xu <= 2^31-1 and f <= 2^31-1.
-	 * Thus, if d <= 2*m-1 on input, then:
-	 *   2*m-1 + 2*(2^31-1)*m <= (2^32)*m-1
-	 * and the new d value is less than 2*m.
-	 *
-	 * We represent d over 31-bit words, with an extra word 'dh'
-	 * which can thus be only 0 or 1.
-	 */
-	size_t len, len4, u, v;
-	uint32_t dh;
-
-	len = (m[0] + 31) >> 5;
-	len4 = len & ~(size_t)3;
-	br_i31_zero(d, m[0]);
-	dh = 0;
-	for (u = 0; u < len; u ++) {
-		/*
-		 * The carry for each operation fits on 32 bits:
-		 *   d[v+1] <= 2^31-1
-		 *   xu*y[v+1] <= (2^31-1)*(2^31-1)
-		 *   f*m[v+1] <= (2^31-1)*(2^31-1)
-		 *   r <= 2^32-1
-		 *   (2^31-1) + 2*(2^31-1)*(2^31-1) + (2^32-1) = 2^63 - 2^31
-		 * After division by 2^31, the new r is then at most 2^32-1
-		 *
-		 * Using a 32-bit carry has performance benefits on 32-bit
-		 * systems; however, on 64-bit architectures, we prefer to
-		 * keep the carry (r) in a 64-bit register, thus avoiding some
-		 * "clear high bits" operations.
-		 */
-		uint32_t f, xu;
-#if BR_64
-		uint64_t r;
-#else
-		uint32_t r;
-#endif
-
-		xu = x[u + 1];
-		f = MUL31_lo((d[1] + MUL31_lo(x[u + 1], y[1])), m0i);
-
-		r = 0;
-		for (v = 0; v < len4; v += 4) {
-			uint64_t z;
-
-			z = (uint64_t)d[v + 1] + MUL31(xu, y[v + 1])
-				+ MUL31(f, m[v + 1]) + r;
-			r = z >> 31;
-			d[v + 0] = (uint32_t)z & 0x7FFFFFFF;
-			z = (uint64_t)d[v + 2] + MUL31(xu, y[v + 2])
-				+ MUL31(f, m[v + 2]) + r;
-			r = z >> 31;
-			d[v + 1] = (uint32_t)z & 0x7FFFFFFF;
-			z = (uint64_t)d[v + 3] + MUL31(xu, y[v + 3])
-				+ MUL31(f, m[v + 3]) + r;
-			r = z >> 31;
-			d[v + 2] = (uint32_t)z & 0x7FFFFFFF;
-			z = (uint64_t)d[v + 4] + MUL31(xu, y[v + 4])
-				+ MUL31(f, m[v + 4]) + r;
-			r = z >> 31;
-			d[v + 3] = (uint32_t)z & 0x7FFFFFFF;
-		}
-		for (; v < len; v ++) {
-			uint64_t z;
-
-			z = (uint64_t)d[v + 1] + MUL31(xu, y[v + 1])
-				+ MUL31(f, m[v + 1]) + r;
-			r = z >> 31;
-			d[v] = (uint32_t)z & 0x7FFFFFFF;
-		}
-
-		/*
-		 * Since the new dh can only be 0 or 1, the addition of
-		 * the old dh with the carry MUST fit on 32 bits, and
-		 * thus can be done into dh itself.
-		 */
-		dh += r;
-		d[len] = dh & 0x7FFFFFFF;
-		dh >>= 31;
-	}
-
-	/*
-	 * We must write back the bit length because it was overwritten in
-	 * the loop (not overwriting it would require a test in the loop,
-	 * which would yield bigger and slower code).
-	 */
-	d[0] = m[0];
-
-	/*
-	 * d[] may still be greater than m[] at that point; notably, the
-	 * 'dh' word may be non-zero.
-	 */
-	br_i31_sub(d, m, NEQ(dh, 0) | NOT(br_i31_sub(d, m, 0)));
-}

package/runtime/third_party/bearssl/src/int/i31_mulacc.c

@@ -1,74 +0,0 @@
-/*
- * Copyright (c) 2016 Thomas Pornin <pornin@bolet.org>
- *
- * Permission is hereby granted, free of charge, to any person obtaining 
- * a copy of this software and associated documentation files (the
- * "Software"), to deal in the Software without restriction, including
- * without limitation the rights to use, copy, modify, merge, publish,
- * distribute, sublicense, and/or sell copies of the Software, and to
- * permit persons to whom the Software is furnished to do so, subject to
- * the following conditions:
- *
- * The above copyright notice and this permission notice shall be 
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- */
-
-#include "inner.h"
-
-/* see inner.h */
-void
-br_i31_mulacc(uint32_t *d, const uint32_t *a, const uint32_t *b)
-{
-	size_t alen, blen, u;
-	uint32_t dl, dh;
-
-	alen = (a[0] + 31) >> 5;
-	blen = (b[0] + 31) >> 5;
-
-	/*
-	 * We want to add the two bit lengths, but these are encoded,
-	 * which requires some extra care.
-	 */
-	dl = (a[0] & 31) + (b[0] & 31);
-	dh = (a[0] >> 5) + (b[0] >> 5);
-	d[0] = (dh << 5) + dl + (~(uint32_t)(dl - 31) >> 31);
-
-	for (u = 0; u < blen; u ++) {
-		uint32_t f;
-		size_t v;
-
-		/*
-		 * Carry always fits on 31 bits; we want to keep it in a
-		 * 32-bit register on 32-bit architectures (on a 64-bit
-		 * architecture, cast down from 64 to 32 bits means
-		 * clearing the high bits, which is not free; on a 32-bit
-		 * architecture, the same operation really means ignoring
-		 * the top register, which has negative or zero cost).
-		 */
-#if BR_64
-		uint64_t cc;
-#else
-		uint32_t cc;
-#endif
-
-		f = b[1 + u];
-		cc = 0;
-		for (v = 0; v < alen; v ++) {
-			uint64_t z;
-
-			z = (uint64_t)d[1 + u + v] + MUL31(f, a[1 + v]) + cc;
-			cc = z >> 31;
-			d[1 + u + v] = (uint32_t)z & 0x7FFFFFFF;
-		}
-		d[1 + u + alen] = (uint32_t)cc;
-	}
-}

package/runtime/third_party/bearssl/src/int/i31_muladd.c

@@ -1,157 +0,0 @@
-/*
- * Copyright (c) 2016 Thomas Pornin <pornin@bolet.org>
- *
- * Permission is hereby granted, free of charge, to any person obtaining 
- * a copy of this software and associated documentation files (the
- * "Software"), to deal in the Software without restriction, including
- * without limitation the rights to use, copy, modify, merge, publish,
- * distribute, sublicense, and/or sell copies of the Software, and to
- * permit persons to whom the Software is furnished to do so, subject to
- * the following conditions:
- *
- * The above copyright notice and this permission notice shall be 
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- */
-
-#include "inner.h"
-
-/* see inner.h */
-void
-br_i31_muladd_small(uint32_t *x, uint32_t z, const uint32_t *m)
-{
-	uint32_t m_bitlen;
-	unsigned mblr;
-	size_t u, mlen;
-	uint32_t a0, a1, b0, hi, g, q, tb;
-	uint32_t under, over;
-	uint32_t cc;
-
-	/*
-	 * We can test on the modulus bit length since we accept to
-	 * leak that length.
-	 */
-	m_bitlen = m[0];
-	if (m_bitlen == 0) {
-		return;
-	}
-	if (m_bitlen <= 31) {
-		uint32_t lo;
-
-		hi = x[1] >> 1;
-		lo = (x[1] << 31) | z;
-		x[1] = br_rem(hi, lo, m[1]);
-		return;
-	}
-	mlen = (m_bitlen + 31) >> 5;
-	mblr = (unsigned)m_bitlen & 31;
-
-	/*
-	 * Principle: we estimate the quotient (x*2^31+z)/m by
-	 * doing a 64/32 division with the high words.
-	 *
-	 * Let:
-	 *   w = 2^31
-	 *   a = (w*a0 + a1) * w^N + a2
-	 *   b = b0 * w^N + b2
-	 * such that:
-	 *   0 <= a0 < w
-	 *   0 <= a1 < w
-	 *   0 <= a2 < w^N
-	 *   w/2 <= b0 < w
-	 *   0 <= b2 < w^N
-	 *   a < w*b
-	 * I.e. the two top words of a are a0:a1, the top word of b is
-	 * b0, we ensured that b0 is "full" (high bit set), and a is
-	 * such that the quotient q = a/b fits on one word (0 <= q < w).
-	 *
-	 * If a = b*q + r (with 0 <= r < q), we can estimate q by
-	 * doing an Euclidean division on the top words:
-	 *   a0*w+a1 = b0*u + v  (with 0 <= v < b0)
-	 * Then the following holds:
-	 *   0 <= u <= w
-	 *   u-2 <= q <= u
-	 */
-	hi = x[mlen];
-	if (mblr == 0) {
-		a0 = x[mlen];
-		memmove(x + 2, x + 1, (mlen - 1) * sizeof *x);
-		x[1] = z;
-		a1 = x[mlen];
-		b0 = m[mlen];
-	} else {
-		a0 = ((x[mlen] << (31 - mblr)) | (x[mlen - 1] >> mblr))
-			& 0x7FFFFFFF;
-		memmove(x + 2, x + 1, (mlen - 1) * sizeof *x);
-		x[1] = z;
-		a1 = ((x[mlen] << (31 - mblr)) | (x[mlen - 1] >> mblr))
-			& 0x7FFFFFFF;
-		b0 = ((m[mlen] << (31 - mblr)) | (m[mlen - 1] >> mblr))
-			& 0x7FFFFFFF;
-	}
-
-	/*
-	 * We estimate a divisor q. If the quotient returned by br_div()
-	 * is g:
-	 * -- If a0 == b0 then g == 0; we want q = 0x7FFFFFFF.
-	 * -- Otherwise:
-	 *    -- if g == 0 then we set q = 0;
-	 *    -- otherwise, we set q = g - 1.
-	 * The properties described above then ensure that the true
-	 * quotient is q-1, q or q+1.
-	 *
-	 * Take care that a0, a1 and b0 are 31-bit words, not 32-bit. We
-	 * must adjust the parameters to br_div() accordingly.
-	 */
-	g = br_div(a0 >> 1, a1 | (a0 << 31), b0);
-	q = MUX(EQ(a0, b0), 0x7FFFFFFF, MUX(EQ(g, 0), 0, g - 1));
-
-	/*
-	 * We subtract q*m from x (with the extra high word of value 'hi').
-	 * Since q may be off by 1 (in either direction), we may have to
-	 * add or subtract m afterwards.
-	 *
-	 * The 'tb' flag will be true (1) at the end of the loop if the
-	 * result is greater than or equal to the modulus (not counting
-	 * 'hi' or the carry).
-	 */
-	cc = 0;
-	tb = 1;
-	for (u = 1; u <= mlen; u ++) {
-		uint32_t mw, zw, xw, nxw;
-		uint64_t zl;
-
-		mw = m[u];
-		zl = MUL31(mw, q) + cc;
-		cc = (uint32_t)(zl >> 31);
-		zw = (uint32_t)zl & (uint32_t)0x7FFFFFFF;
-		xw = x[u];
-		nxw = xw - zw;
-		cc += nxw >> 31;
-		nxw &= 0x7FFFFFFF;
-		x[u] = nxw;
-		tb = MUX(EQ(nxw, mw), tb, GT(nxw, mw));
-	}
-
-	/*
-	 * If we underestimated q, then either cc < hi (one extra bit
-	 * beyond the top array word), or cc == hi and tb is true (no
-	 * extra bit, but the result is not lower than the modulus). In
-	 * these cases we must subtract m once.
-	 *
-	 * Otherwise, we may have overestimated, which will show as
-	 * cc > hi (thus a negative result). Correction is adding m once.
-	 */
-	over = GT(cc, hi);
-	under = ~over & (tb | LT(cc, hi));
-	br_i31_add(x, m, over);
-	br_i31_sub(x, m, under);
-}

package/runtime/third_party/bearssl/src/int/i31_ninv31.c

@@ -1,39 +0,0 @@
-/*
- * Copyright (c) 2016 Thomas Pornin <pornin@bolet.org>
- *
- * Permission is hereby granted, free of charge, to any person obtaining 
- * a copy of this software and associated documentation files (the
- * "Software"), to deal in the Software without restriction, including
- * without limitation the rights to use, copy, modify, merge, publish,
- * distribute, sublicense, and/or sell copies of the Software, and to
- * permit persons to whom the Software is furnished to do so, subject to
- * the following conditions:
- *
- * The above copyright notice and this permission notice shall be 
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- */
-
-#include "inner.h"
-
-/* see inner.h */
-uint32_t
-br_i31_ninv31(uint32_t x)
-{
-	uint32_t y;
-
-	y = 2 - x;
-	y *= 2 - y * x;
-	y *= 2 - y * x;
-	y *= 2 - y * x;
-	y *= 2 - y * x;
-	return MUX(x & 1, -y, 0) & 0x7FFFFFFF;
-}

package/runtime/third_party/bearssl/src/int/i31_reduce.c

@@ -1,66 +0,0 @@
-/*
- * Copyright (c) 2016 Thomas Pornin <pornin@bolet.org>
- *
- * Permission is hereby granted, free of charge, to any person obtaining 
- * a copy of this software and associated documentation files (the
- * "Software"), to deal in the Software without restriction, including
- * without limitation the rights to use, copy, modify, merge, publish,
- * distribute, sublicense, and/or sell copies of the Software, and to
- * permit persons to whom the Software is furnished to do so, subject to
- * the following conditions:
- *
- * The above copyright notice and this permission notice shall be 
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- */
-
-#include "inner.h"
-
-/* see inner.h */
-void
-br_i31_reduce(uint32_t *x, const uint32_t *a, const uint32_t *m)
-{
-	uint32_t m_bitlen, a_bitlen;
-	size_t mlen, alen, u;
-
-	m_bitlen = m[0];
-	mlen = (m_bitlen + 31) >> 5;
-
-	x[0] = m_bitlen;
-	if (m_bitlen == 0) {
-		return;
-	}
-
-	/*
-	 * If the source is shorter, then simply copy all words from a[]
-	 * and zero out the upper words.
-	 */
-	a_bitlen = a[0];
-	alen = (a_bitlen + 31) >> 5;
-	if (a_bitlen < m_bitlen) {
-		memcpy(x + 1, a + 1, alen * sizeof *a);
-		for (u = alen; u < mlen; u ++) {
-			x[u + 1] = 0;
-		}
-		return;
-	}
-
-	/*
-	 * The source length is at least equal to that of the modulus.
-	 * We must thus copy N-1 words, and input the remaining words
-	 * one by one.
-	 */
-	memcpy(x + 1, a + 2 + (alen - mlen), (mlen - 1) * sizeof *a);
-	x[mlen] = 0;
-	for (u = 1 + alen - mlen; u > 0; u --) {
-		br_i31_muladd_small(x, a[u], m);
-	}
-}

package/runtime/third_party/bearssl/src/int/i31_rshift.c

@@ -1,47 +0,0 @@
-/*
- * Copyright (c) 2016 Thomas Pornin <pornin@bolet.org>
- *
- * Permission is hereby granted, free of charge, to any person obtaining 
- * a copy of this software and associated documentation files (the
- * "Software"), to deal in the Software without restriction, including
- * without limitation the rights to use, copy, modify, merge, publish,
- * distribute, sublicense, and/or sell copies of the Software, and to
- * permit persons to whom the Software is furnished to do so, subject to
- * the following conditions:
- *
- * The above copyright notice and this permission notice shall be 
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- */
-
-#include "inner.h"
-
-/* see inner.h */
-void
-br_i31_rshift(uint32_t *x, int count)
-{
-	size_t u, len;
-	uint32_t r;
-
-	len = (x[0] + 31) >> 5;
-	if (len == 0) {
-		return;
-	}
-	r = x[1] >> count;
-	for (u = 2; u <= len; u ++) {
-		uint32_t w;
-
-		w = x[u];
-		x[u - 1] = ((w << (31 - count)) | r) & 0x7FFFFFFF;
-		r = w >> count;
-	}
-	x[len] = r;
-}

package/runtime/third_party/bearssl/src/int/i31_sub.c

@@ -1,46 +0,0 @@
-/*
- * Copyright (c) 2016 Thomas Pornin <pornin@bolet.org>
- *
- * Permission is hereby granted, free of charge, to any person obtaining 
- * a copy of this software and associated documentation files (the
- * "Software"), to deal in the Software without restriction, including
- * without limitation the rights to use, copy, modify, merge, publish,
- * distribute, sublicense, and/or sell copies of the Software, and to
- * permit persons to whom the Software is furnished to do so, subject to
- * the following conditions:
- *
- * The above copyright notice and this permission notice shall be 
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- */
-
-#include "inner.h"
-
-/* see inner.h */
-uint32_t
-br_i31_sub(uint32_t *a, const uint32_t *b, uint32_t ctl)
-{
-	uint32_t cc;
-	size_t u, m;
-
-	cc = 0;
-	m = (a[0] + 63) >> 5;
-	for (u = 1; u < m; u ++) {
-		uint32_t aw, bw, naw;
-
-		aw = a[u];
-		bw = b[u];
-		naw = aw - bw - cc;
-		cc = naw >> 31;
-		a[u] = MUX(ctl, naw & 0x7FFFFFFF, aw);
-	}
-	return cc;
-}

package/runtime/third_party/bearssl/src/int/i31_tmont.c

@@ -1,36 +0,0 @@
-/*
- * Copyright (c) 2016 Thomas Pornin <pornin@bolet.org>
- *
- * Permission is hereby granted, free of charge, to any person obtaining 
- * a copy of this software and associated documentation files (the
- * "Software"), to deal in the Software without restriction, including
- * without limitation the rights to use, copy, modify, merge, publish,
- * distribute, sublicense, and/or sell copies of the Software, and to
- * permit persons to whom the Software is furnished to do so, subject to
- * the following conditions:
- *
- * The above copyright notice and this permission notice shall be 
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- */
-
-#include "inner.h"
-
-/* see inner.h */
-void
-br_i31_to_monty(uint32_t *x, const uint32_t *m)
-{
-	uint32_t k;
-
-	for (k = (m[0] + 31) >> 5; k > 0; k --) {
-		br_i31_muladd_small(x, 0, m);
-	}
-}

package/runtime/third_party/bearssl/src/int/i32_add.c

@@ -1,51 +0,0 @@
-/*
- * Copyright (c) 2016 Thomas Pornin <pornin@bolet.org>
- *
- * Permission is hereby granted, free of charge, to any person obtaining 
- * a copy of this software and associated documentation files (the
- * "Software"), to deal in the Software without restriction, including
- * without limitation the rights to use, copy, modify, merge, publish,
- * distribute, sublicense, and/or sell copies of the Software, and to
- * permit persons to whom the Software is furnished to do so, subject to
- * the following conditions:
- *
- * The above copyright notice and this permission notice shall be 
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- */
-
-#include "inner.h"
-
-/* see inner.h */
-uint32_t
-br_i32_add(uint32_t *a, const uint32_t *b, uint32_t ctl)
-{
-	uint32_t cc;
-	size_t u, m;
-
-	cc = 0;
-	m = (a[0] + 63) >> 5;
-	for (u = 1; u < m; u ++) {
-		uint32_t aw, bw, naw;
-
-		aw = a[u];
-		bw = b[u];
-		naw = aw + bw + cc;
-
-		/*
-		 * Carry is 1 if naw < aw. Carry is also 1 if naw == aw
-		 * AND the carry was already 1.
-		 */
-		cc = (cc & EQ(naw, aw)) | LT(naw, aw);
-		a[u] = MUX(ctl, naw, aw);
-	}
-	return cc;
-}

package/runtime/third_party/bearssl/src/int/i32_bitlen.c

@@ -1,44 +0,0 @@
-/*
- * Copyright (c) 2016 Thomas Pornin <pornin@bolet.org>
- *
- * Permission is hereby granted, free of charge, to any person obtaining 
- * a copy of this software and associated documentation files (the
- * "Software"), to deal in the Software without restriction, including
- * without limitation the rights to use, copy, modify, merge, publish,
- * distribute, sublicense, and/or sell copies of the Software, and to
- * permit persons to whom the Software is furnished to do so, subject to
- * the following conditions:
- *
- * The above copyright notice and this permission notice shall be 
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- */
-
-#include "inner.h"
-
-/* see inner.h */
-uint32_t
-br_i32_bit_length(uint32_t *x, size_t xlen)
-{
-	uint32_t tw, twk;
-
-	tw = 0;
-	twk = 0;
-	while (xlen -- > 0) {
-		uint32_t w, c;
-
-		c = EQ(tw, 0);
-		w = x[xlen];
-		tw = MUX(c, w, tw);
-		twk = MUX(c, (uint32_t)xlen, twk);
-	}
-	return (twk << 5) + BIT_LENGTH(tw);
-}