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
// generated source. do not edit.
#![allow(non_upper_case_globals, unused_macros, unused_imports)]
use crate::low::macros::*;
// Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
// SPDX-License-Identifier: Apache-2.0 OR ISC OR MIT-0
// ----------------------------------------------------------------------------
// Return size of bignum in bits
// Input x[k]; output function return
//
// extern uint64_t bignum_bitsize(uint64_t k, const uint64_t *x);
//
// In the case of a zero bignum as input the result is 0
//
// In principle this has a precondition k < 2^58, but obviously that
// is always true in practice because of address space limitations.
//
// Standard x86-64 ABI: RDI = k, RSI = x, returns RAX
// Microsoft x64 ABI: RCX = k, RDX = x, returns RAX
// ----------------------------------------------------------------------------
macro_rules! k {
() => {
"rdi"
};
}
macro_rules! x {
() => {
"rsi"
};
}
macro_rules! i {
() => {
"rax"
};
}
macro_rules! w {
() => {
"rdx"
};
}
macro_rules! a {
() => {
"rcx"
};
}
macro_rules! j {
() => {
"r8"
};
}
/// Return size of bignum in bits
///
/// Input x[k]; output function return
///
/// In the case of a zero bignum as input the result is 0
///
/// In principle this has a precondition k < 2^58, but obviously that
/// is always true in practice because of address space limitations.
pub(crate) fn bignum_bitsize(x: &[u64]) -> usize {
let ret: u64;
// SAFETY: inline assembly. see [crate::low::inline_assembly_safety] for safety info.
unsafe {
core::arch::asm!(
Q!(" endbr64 " ),
// Initialize the index i and also prepare default return value of 0 (i = rax)
Q!(" xor " i!() ", " i!()),
// If the bignum is zero-length, just return 0
Q!(" test " k!() ", " k!()),
Q!(" jz " Label!("bignum_bitsize_end", 2, After)),
// Use w = a[i-1] to store nonzero words in a bottom-up sweep
// Set the initial default to be as if we had a 11...11 word directly below
Q!(" mov " w!() ", -1"),
Q!(" xor " j!() ", " j!()),
Q!(Label!("bignum_bitsize_loop", 3) ":"),
Q!(" mov " a!() ", [" x!() "+ 8 * " j!() "]"),
Q!(" inc " j!()),
Q!(" test " a!() ", " a!()),
Q!(" cmovnz " i!() ", " j!()),
Q!(" cmovnz " w!() ", " a!()),
Q!(" cmp " j!() ", " k!()),
Q!(" jnz " Label!("bignum_bitsize_loop", 3, Before)),
// Now w = a[i-1] is the highest nonzero word, or in the zero case the
// default of the "extra" 11...11 = a[0-1]. We now want 64* i - clz(w) =
// 64 * i - (63 - bsr(w)) = (64 * i - 63) + bsr(w). Note that this code
// does not rely on the behavior of the bsr instruction for zero inputs,
// which is undefined.
Q!(" shl " i!() ", 6"),
Q!(" sub " i!() ", 63"),
Q!(" bsr " w!() ", " w!()),
Q!(" add " "rax, " w!()),
Q!(Label!("bignum_bitsize_end", 2) ":"),
inout("rdi") x.len() => _,
inout("rsi") x.as_ptr() => _,
out("rax") ret,
// clobbers
out("r8") _,
out("rcx") _,
out("rdx") _,
)
};
ret as usize
}