visaljs 0.0.1 → 0.0.3

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

@@ -1,184 +0,0 @@
-/*
- * Copyright (c) 2017 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_i15_montymul(uint16_t *d, const uint16_t *x, const uint16_t *y,
-	const uint16_t *m, uint16_t m0i)
-{
-	size_t len, len4, u, v;
-	uint32_t dh;
-
-	len = (m[0] + 15) >> 4;
-	len4 = len & ~(size_t)3;
-	br_i15_zero(d, m[0]);
-	dh = 0;
-	for (u = 0; u < len; u ++) {
-		uint32_t f, xu, r, zh;
-
-		xu = x[u + 1];
-		f = MUL15((d[1] + MUL15(x[u + 1], y[1])) & 0x7FFF, m0i)
-			& 0x7FFF;
-#if BR_ARMEL_CORTEXM_GCC
-		if (len4 != 0) {
-			uint16_t *limit;
-
-			limit = d + len4;
-			asm volatile (
-"\n\
-	@ carry: r=r2                                              \n\
-	@ multipliers: xu=r3 f=r4                                  \n\
-	@ base registers: d+v=r5 y+v=r6 m+v=r7                     \n\
-	@ r8 contains 0x7FFF                                       \n\
-	@ r9 contains d+len4                                       \n\
-	ldr	r0, %[limit]                                       \n\
-	ldr	r3, %[xu]                                          \n\
-	mov	r9, r0                                             \n\
-	ldr	r4, %[f]                                           \n\
-	eor	r2, r2                                             \n\
-	ldr	r5, %[d]                                           \n\
-	sub	r1, r2, #1                                         \n\
-	ldr	r6, %[y]                                           \n\
-	lsr	r1, r1, #17                                        \n\
-	ldr	r7, %[m]                                           \n\
-	mov	r8, r1                                             \n\
-loop%=:                                                            \n\
-	ldrh	r0, [r6, #2]                                       \n\
-	ldrh	r1, [r7, #2]                                       \n\
-	mul	r0, r3                                             \n\
-	mul	r1, r4                                             \n\
-	add	r2, r0, r2                                         \n\
-	ldrh	r0, [r5, #2]                                       \n\
-	add	r2, r1, r2                                         \n\
-	mov	r1, r8                                             \n\
-	add	r2, r0, r2                                         \n\
-	and	r1, r2                                             \n\
-	lsr	r2, r2, #15                                        \n\
-	strh	r1, [r5, #0]                                       \n\
-		                                                   \n\
-	ldrh	r0, [r6, #4]                                       \n\
-	ldrh	r1, [r7, #4]                                       \n\
-	mul	r0, r3                                             \n\
-	mul	r1, r4                                             \n\
-	add	r2, r0, r2                                         \n\
-	ldrh	r0, [r5, #4]                                       \n\
-	add	r2, r1, r2                                         \n\
-	mov	r1, r8                                             \n\
-	add	r2, r0, r2                                         \n\
-	and	r1, r2                                             \n\
-	lsr	r2, r2, #15                                        \n\
-	strh	r1, [r5, #2]                                       \n\
-		                                                   \n\
-	ldrh	r0, [r6, #6]                                       \n\
-	ldrh	r1, [r7, #6]                                       \n\
-	mul	r0, r3                                             \n\
-	mul	r1, r4                                             \n\
-	add	r2, r0, r2                                         \n\
-	ldrh	r0, [r5, #6]                                       \n\
-	add	r2, r1, r2                                         \n\
-	mov	r1, r8                                             \n\
-	add	r2, r0, r2                                         \n\
-	and	r1, r2                                             \n\
-	lsr	r2, r2, #15                                        \n\
-	strh	r1, [r5, #4]                                       \n\
-		                                                   \n\
-	ldrh	r0, [r6, #8]                                       \n\
-	ldrh	r1, [r7, #8]                                       \n\
-	mul	r0, r3                                             \n\
-	mul	r1, r4                                             \n\
-	add	r2, r0, r2                                         \n\
-	ldrh	r0, [r5, #8]                                       \n\
-	add	r2, r1, r2                                         \n\
-	mov	r1, r8                                             \n\
-	add	r2, r0, r2                                         \n\
-	and	r1, r2                                             \n\
-	lsr	r2, r2, #15                                        \n\
-	strh	r1, [r5, #6]                                       \n\
-		                                                   \n\
-	add	r5, r5, #8                                         \n\
-	add	r6, r6, #8                                         \n\
-	add	r7, r7, #8                                         \n\
-	cmp	r5, r9                                             \n\
-	bne	loop%=                                             \n\
-		                                                   \n\
-	str	r2, %[carry]                                       \n\
-"
-: [carry] "=m" (r)
-: [xu] "m" (xu), [f] "m" (f), [d] "m" (d), [y] "m" (y),
-	[m] "m" (m), [limit] "m" (limit)
-: "r0", "r1", "r2", "r3", "r4", "r5", "r6", "r7", "r8", "r9" );
-		} else {
-			r = 0;
-		}
-		v = len4;
-#else
-		r = 0;
-		for (v = 0; v < len4; v += 4) {
-			uint32_t z;
-
-			z = d[v + 1] + MUL15(xu, y[v + 1])
-				+ MUL15(f, m[v + 1]) + r;
-			r = z >> 15;
-			d[v + 0] = z & 0x7FFF;
-			z = d[v + 2] + MUL15(xu, y[v + 2])
-				+ MUL15(f, m[v + 2]) + r;
-			r = z >> 15;
-			d[v + 1] = z & 0x7FFF;
-			z = d[v + 3] + MUL15(xu, y[v + 3])
-				+ MUL15(f, m[v + 3]) + r;
-			r = z >> 15;
-			d[v + 2] = z & 0x7FFF;
-			z = d[v + 4] + MUL15(xu, y[v + 4])
-				+ MUL15(f, m[v + 4]) + r;
-			r = z >> 15;
-			d[v + 3] = z & 0x7FFF;
-		}
-#endif
-		for (; v < len; v ++) {
-			uint32_t z;
-
-			z = d[v + 1] + MUL15(xu, y[v + 1])
-				+ MUL15(f, m[v + 1]) + r;
-			r = z >> 15;
-			d[v + 0] = z & 0x7FFF;
-		}
-
-		zh = dh + r;
-		d[len] = zh & 0x7FFF;
-		dh = zh >> 15;
-	}
-
-	/*
-	 * Restore the bit length (it was overwritten in the loop above).
-	 */
-	d[0] = m[0];
-
-	/*
-	 * d[] may be greater than m[], but it is still lower than twice
-	 * the modulus.
-	 */
-	br_i15_sub(d, m, NEQ(dh, 0) | NOT(br_i15_sub(d, m, 0)));
-}

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

@@ -1,61 +0,0 @@
-/*
- * Copyright (c) 2017 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_i15_mulacc(uint16_t *d, const uint16_t *a, const uint16_t *b)
-{
-	size_t alen, blen, u;
-	unsigned dl, dh;
-
-	alen = (a[0] + 15) >> 4;
-	blen = (b[0] + 15) >> 4;
-
-	/*
-	 * Announced bit length of d[] will be the sum of the announced
-	 * bit lengths of a[] and b[]; but the lengths are encoded.
-	 */
-	dl = (a[0] & 15) + (b[0] & 15);
-	dh = (a[0] >> 4) + (b[0] >> 4);
-	d[0] = (dh << 4) + dl + (~(uint32_t)(dl - 15) >> 31);
-
-	for (u = 0; u < blen; u ++) {
-		uint32_t f;
-		size_t v;
-		uint32_t cc;
-
-		f = b[1 + u];
-		cc = 0;
-		for (v = 0; v < alen; v ++) {
-			uint32_t z;
-
-			z = (uint32_t)d[1 + u + v] + MUL15(f, a[1 + v]) + cc;
-			cc = z >> 15;
-			d[1 + u + v] = z & 0x7FFF;
-		}
-		d[1 + u + alen] = cc;
-	}
-}

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

@@ -1,173 +0,0 @@
-/*
- * Copyright (c) 2017 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"
-
-/*
- * Constant-time division. The divisor must not be larger than 16 bits,
- * and the quotient must fit on 17 bits.
- */
-static uint32_t
-divrem16(uint32_t x, uint32_t d, uint32_t *r)
-{
-	int i;
-	uint32_t q;
-
-	q = 0;
-	d <<= 16;
-	for (i = 16; i >= 0; i --) {
-		uint32_t ctl;
-
-		ctl = LE(d, x);
-		q |= ctl << i;
-		x -= (-ctl) & d;
-		d >>= 1;
-	}
-	if (r != NULL) {
-		*r = x;
-	}
-	return q;
-}
-
-/* see inner.h */
-void
-br_i15_muladd_small(uint16_t *x, uint16_t z, const uint16_t *m)
-{
-	/*
-	 * Constant-time: we accept to leak the exact bit length of the
-	 * modulus m.
-	 */
-	unsigned m_bitlen, mblr;
-	size_t u, mlen;
-	uint32_t hi, a0, a, b, q;
-	uint32_t cc, tb, over, under;
-
-	/*
-	 * Simple case: the modulus fits on one word.
-	 */
-	m_bitlen = m[0];
-	if (m_bitlen == 0) {
-		return;
-	}
-	if (m_bitlen <= 15) {
-		uint32_t rem;
-
-		divrem16(((uint32_t)x[1] << 15) | z, m[1], &rem);
-		x[1] = rem;
-		return;
-	}
-	mlen = (m_bitlen + 15) >> 4;
-	mblr = m_bitlen & 15;
-
-	/*
-	 * Principle: we estimate the quotient (x*2^15+z)/m by
-	 * doing a 30/15 division with the high words.
-	 *
-	 * Let:
-	 *   w = 2^15
-	 *   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), then we can estimate q by
-	 * using a 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;
-		a = (a0 << 15) + x[mlen];
-		b = m[mlen];
-	} else {
-		a0 = (x[mlen] << (15 - mblr)) | (x[mlen - 1] >> mblr);
-		memmove(x + 2, x + 1, (mlen - 1) * sizeof *x);
-		x[1] = z;
-		a = (a0 << 15) | (((x[mlen] << (15 - mblr))
-			| (x[mlen - 1] >> mblr)) & 0x7FFF);
-		b = (m[mlen] << (15 - mblr)) | (m[mlen - 1] >> mblr);
-	}
-	q = divrem16(a, b, NULL);
-
-	/*
-	 * We computed an estimate for q, but the real one may be q,
-	 * q-1 or q-2; moreover, the division may have returned a value
-	 * 8000 or even 8001 if the two high words were identical, and
-	 * we want to avoid values beyond 7FFF. We thus adjust q so
-	 * that the "true" multiplier will be q+1, q or q-1, and q is
-	 * in the 0000..7FFF range.
-	 */
-	q = MUX(EQ(b, a0), 0x7FFF, q - 1 + ((q - 1) >> 31));
-
-	/*
-	 * We subtract q*m from x (x has an 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, zl, xw, nxw;
-
-		mw = m[u];
-		zl = MUL15(mw, q) + cc;
-		cc = zl >> 15;
-		zl &= 0x7FFF;
-		xw = x[u];
-		nxw = xw - zl;
-		cc += nxw >> 31;
-		nxw &= 0x7FFF;
-		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).
-	 *
-	 * If we overestimated q, then cc > hi.
-	 */
-	over = GT(cc, hi);
-	under = ~over & (tb | LT(cc, hi));
-	br_i15_add(x, m, over);
-	br_i15_sub(x, m, under);
-}

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

@@ -1,38 +0,0 @@
-/*
- * Copyright (c) 2017 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 */
-uint16_t
-br_i15_ninv15(uint16_t x)
-{
-	uint32_t y;
-
-	y = 2 - x;
-	y = MUL15(y, 2 - MUL15(x, y));
-	y = MUL15(y, 2 - MUL15(x, y));
-	y = MUL15(y, 2 - MUL15(x, y));
-	return MUX(x & 1, -y, 0) & 0x7FFF;
-}

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

@@ -1,66 +0,0 @@
-/*
- * Copyright (c) 2017 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_i15_reduce(uint16_t *x, const uint16_t *a, const uint16_t *m)
-{
-	uint32_t m_bitlen, a_bitlen;
-	size_t mlen, alen, u;
-
-	m_bitlen = m[0];
-	mlen = (m_bitlen + 15) >> 4;
-
-	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 + 15) >> 4;
-	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_i15_muladd_small(x, a[u], m);
-	}
-}

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

@@ -1,47 +0,0 @@
-/*
- * Copyright (c) 2017 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_i15_rshift(uint16_t *x, int count)
-{
-	size_t u, len;
-	unsigned r;
-
-	len = (x[0] + 15) >> 4;
-	if (len == 0) {
-		return;
-	}
-	r = x[1] >> count;
-	for (u = 2; u <= len; u ++) {
-		unsigned w;
-
-		w = x[u];
-		x[u - 1] = ((w << (15 - count)) | r) & 0x7FFF;
-		r = w >> count;
-	}
-	x[len] = r;
-}

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

@@ -1,46 +0,0 @@
-/*
- * Copyright (c) 2017 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_i15_sub(uint16_t *a, const uint16_t *b, uint32_t ctl)
-{
-	uint32_t cc;
-	size_t u, m;
-
-	cc = 0;
-	m = (a[0] + 31) >> 4;
-	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 & 0x7FFF, aw);
-	}
-	return cc;
-}

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

@@ -1,36 +0,0 @@
-/*
- * Copyright (c) 2017 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_i15_to_monty(uint16_t *x, const uint16_t *m)
-{
-	unsigned k;
-
-	for (k = (m[0] + 15) >> 4; k > 0; k --) {
-		br_i15_muladd_small(x, 0, m);
-	}
-}