feat(core/rust): BIP-39 wordlist operations in Rust

pull/2314/head
matejcik 2 years ago committed by matejcik
parent 61adb0a62b
commit 6319a5a9d0

@ -1,25 +1,48 @@
use core::cmp::Ordering;
use cstr_core::CStr;
// TODO: expose from trezor-crypto via build.rs
const BIP39_WORDS: usize = 2048;
extern "C" {
// trezor-crypto/bip39.h
fn mnemonic_complete_word(prefix: *const cty::c_char, len: cty::c_int) -> *const cty::c_char;
fn mnemonic_word_completion_mask(prefix: *const cty::c_char, len: cty::c_int) -> u32;
pub static BIP39_WORDLIST_ENGLISH: [*const cty::c_char; BIP39_WORDS];
}
unsafe fn from_utf8_unchecked<'a>(word: *const cty::c_char) -> &'a str {
// SAFETY: caller must pass a valid 0-terminated UTF-8 string.
// This assumption holds for usage on words of the BIP-39 wordlist.
unsafe {
let word = CStr::from_ptr(word);
core::str::from_utf8_unchecked(word.to_bytes())
}
}
/// Compare word from wordlist to a prefix.
///
/// The comparison returns Less if the word comes lexicographically before all
/// possible words starting with `prefix`, and Greater if it comes after.
/// Equal is returned if the word starts with `prefix`.
unsafe fn prefix_cmp(prefix: &str, word: *const cty::c_char) -> Ordering {
// SAFETY: we assume `word` is a pointer to a 0-terminated string.
for (i, prefix_char) in prefix.as_bytes().iter().enumerate() {
let word_char = unsafe { *(word.add(i)) } as u8;
if word_char == 0 {
// Prefix is longer than word.
return Ordering::Less;
} else if *prefix_char != word_char {
return word_char.cmp(prefix_char);
}
}
Ordering::Equal
}
pub fn complete_word(prefix: &str) -> Option<&'static str> {
if prefix.is_empty() {
None
} else {
// SAFETY: `mnemonic_complete_word` shouldn't retain nor modify the passed byte
// string, making the call safe.
let word = unsafe { mnemonic_complete_word(prefix.as_ptr() as _, prefix.len() as _) };
if word.is_null() {
None
} else {
// SAFETY: On success, `mnemonic_complete_word` should return a 0-terminated
// UTF-8 string with static lifetime.
Some(unsafe { CStr::from_ptr(word).to_str().unwrap_unchecked() })
}
Wordlist::all().filter_prefix(prefix).iter().next()
}
}
@ -28,3 +51,142 @@ pub fn word_completion_mask(prefix: &str) -> u32 {
// passed byte string, making the call safe.
unsafe { mnemonic_word_completion_mask(prefix.as_ptr() as _, prefix.len() as _) }
}
pub struct Wordlist(&'static [*const cty::c_char]);
impl Wordlist {
pub fn all() -> Self {
Self(unsafe { &BIP39_WORDLIST_ENGLISH })
}
pub const fn empty() -> Self {
Self(&[])
}
pub fn filter_prefix(&self, prefix: &str) -> Self {
let mut start = 0usize;
let mut end = self.0.len();
for (i, word) in self.0.iter().enumerate() {
// SAFETY: We assume our slice is an array of 0-terminated strings.
match unsafe { prefix_cmp(prefix, *word) } {
Ordering::Less => {
start = i + 1;
}
Ordering::Greater => {
end = i;
break;
}
_ => {}
}
}
Self(&self.0[start..end])
}
pub fn get(&self, index: usize) -> Option<&'static str> {
// SAFETY: we assume every word in the wordlist is a valid 0-terminated UTF-8
// string.
self.0
.get(index)
.map(|word| unsafe { from_utf8_unchecked(*word) })
}
pub const fn len(&self) -> usize {
self.0.len()
}
pub fn iter(&self) -> impl Iterator<Item = &'static str> {
self.0
.iter()
.map(|word| unsafe { from_utf8_unchecked(*word) })
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_prefix_cmp() {
assert_eq!(unsafe { prefix_cmp("", "".as_ptr() as _) }, Ordering::Equal);
assert_eq!(unsafe { prefix_cmp("b", "".as_ptr() as _) }, Ordering::Less);
assert_eq!(
unsafe { prefix_cmp("b", "a".as_ptr() as _) },
Ordering::Less
);
assert_eq!(
unsafe { prefix_cmp("b", "b".as_ptr() as _) },
Ordering::Equal
);
assert_eq!(
unsafe { prefix_cmp("b", "below".as_ptr() as _) },
Ordering::Equal
);
assert_eq!(
unsafe { prefix_cmp("b", "c".as_ptr() as _) },
Ordering::Greater
);
assert_eq!(
unsafe { prefix_cmp("bartender", "bar".as_ptr() as _) },
Ordering::Less
);
}
#[test]
fn test_filter_prefix_empty() {
let words = Wordlist::all().filter_prefix("");
assert_eq!(words.len(), BIP39_WORDS);
let iter = words.iter();
assert_eq!(iter.size_hint(), (BIP39_WORDS, Some(BIP39_WORDS)));
}
#[test]
fn test_filter_prefix() {
let expected_result = vec!["strategy", "street", "strike", "strong", "struggle"];
let result = Wordlist::all()
.filter_prefix("str")
.iter()
.collect::<Vec<_>>();
assert_eq!(result, expected_result);
}
#[test]
fn test_filter_prefix_refine() {
let expected_result = vec!["strategy", "street", "strike", "strong", "struggle"];
let words = Wordlist::all().filter_prefix("st");
let result_a = words.filter_prefix("str").iter().collect::<Vec<_>>();
let result_b = Wordlist::all()
.filter_prefix("str")
.iter()
.collect::<Vec<_>>();
assert_eq!(result_a, expected_result);
assert_eq!(result_b, expected_result);
let empty = words.filter_prefix("c");
assert_eq!(empty.len(), 0);
}
#[test]
fn test_wordlist_get() {
let words = Wordlist::all();
assert_eq!(words.get(0), Some("abandon"));
assert_eq!(words.get(BIP39_WORDS - 1), Some("zoo"));
assert_eq!(words.get(BIP39_WORDS), None);
assert_eq!(words.get(BIP39_WORDS + 1), None);
let filtered = words.filter_prefix("str");
assert_eq!(filtered.get(0), Some("strategy"));
assert_eq!(filtered.get(filtered.len()), None);
}
#[test]
fn test_filter_prefix_just_one() {
let expected_result = vec!["stick"];
let result = Wordlist::all()
.filter_prefix("stick")
.iter()
.collect::<Vec<_>>();
assert_eq!(result, expected_result);
}
}

Loading…
Cancel
Save