Vec {\n\n assert_eq!(int.sign(), num_bigint::Sign::Plus);\n\n assert_eq!(BigInt::from(515_u16).to_bytes_be().1, vec![2, 3]);\n\n assert_eq!(BigInt::from(14_u16).to_bytes_be().1, vec![14]);\n\n int.to_bytes_be()\n\n .1\n\n .into_iter()\n\n .flat_map(byte_to_bits)\n\n .collect()\n\n}\n\n\n","file_path":"WebAssembly/scale/impl_generator/src/lib.rs","rank":83,"score":156141.936926597},{"content":"#[inline(always)]\n\n#[allow(non_snake_case)]\n\npub fn CarryOutAux(a: &Slice>) -> SecretModp {\n\n let mut k: u64 = a.len();\n\n let mut offset: u64 = 0;\n\n if k == 1 {\n\n return *a.get_unchecked(0).get_unchecked(1);\n\n }\n\n if k % 2 == 1 {\n\n offset = 1;\n\n k += 1;\n\n }\n\n let mut u: Slice> = Slice::uninitialized(k / 2);\n\n for i in offset..k / 2 {\n\n let arr: Array = reg_carry(\n\n a.get_unchecked(2 * i + 1 - offset).clone(),\n\n a.get_unchecked(2 * i - offset).clone(),\n\n i != k / 2 - 1,\n\n );\n\n u.get_mut_unchecked(i).set(0, &*arr.get_unchecked(0));\n\n u.get_mut_unchecked(i).set(1, &*arr.get_unchecked(1));\n\n }\n\n if offset == 1 {\n\n u.get_mut_unchecked(0)\n\n .set(0, &*a.get_unchecked(0).get_unchecked(0));\n\n u.get_mut_unchecked(0)\n\n .set(1, &*a.get_unchecked(0).get_unchecked(1));\n\n }\n\n return CarryOutAux(&u);\n\n}\n\n\n","file_path":"WebAssembly/scale_std/src/bit_protocols.rs","rank":84,"score":156089.28020388837},{"content":"#[inline(always)]\n\n#[allow(non_snake_case)]\n\npub fn BitDecFullBig(a: SecretModp) -> Array {\n\n // Returns secret shared bit decomposition of\n\n let mut abits: Array = Array::uninitialized();\n\n let mut bbits: Array = Array::uninitialized();\n\n let mut pbits: Array = Array::uninitialized();\n\n for i in 0u64..BITLENP {\n\n pbits.set(i, &ClearModp::from(P[(BITLEN - 1 - i) as usize] as i64));\n\n }\n\n // Loop until we get some random integers less than p\n\n let mut cond: i64 = 0;\n\n while cond == 0 {\n\n for i in 0u64..BITLENP {\n\n bbits.set(i, &SecretModp::get_random_bit());\n\n }\n\n // FIXME: make `BitLTFull` accept `Array`s\n\n let v = BitLTFull(&bbits.slice(..), &pbits.slice(..)).reveal();\n\n cond = i64::from(v);\n\n }\n\n // FIXME: make `SumBits` accept `Array`s\n\n let b: SecretModp = SumBits(&bbits.slice(..));\n","file_path":"WebAssembly/scale_std/src/bit_protocols.rs","rank":85,"score":155159.29002201548},{"content":"pub trait Visitor<'a> {\n\n fn cx(&self) -> &'a Compiler;\n\n fn visit_body(&mut self, body: &mut Body<'a>) {\n\n self.walk_body(body)\n\n }\n\n fn walk_body(&mut self, body: &mut Body<'a>) {\n\n let Body { blocks } = body;\n\n for block in blocks {\n\n self.visit_block(block);\n\n }\n\n }\n\n\n\n fn visit_block(&mut self, block: &mut Block<'a>) {\n\n self.walk_block(block)\n\n }\n\n fn walk_block(&mut self, block: &mut Block<'a>) {\n\n let Block { stmts, terminator } = block;\n\n for stmt in stmts {\n\n self.visit_stmt(stmt);\n\n }\n","file_path":"Assembler/src/visitor.rs","rank":86,"score":155080.67190341},{"content":"// Note test_mem is never implemented for secret types\n\n// - This makes things a bit simpler\n\npub trait TestMem {\n\n #[track_caller]\n\n fn test_mem(self, t_location: ConstU32);\n\n}\n\n\n","file_path":"WebAssembly/scale/src/lib.rs","rank":87,"score":153933.1780108889},{"content":"pub trait Floor {\n\n fn floor(self) -> Self;\n\n}\n\n\n","file_path":"WebAssembly/scale_std/src/math.rs","rank":88,"score":153927.7285816637},{"content":"pub trait Sqrt {\n\n fn sqrt(self) -> Self;\n\n}\n\n\n","file_path":"WebAssembly/scale_std/src/math.rs","rank":89,"score":153927.7285816637},{"content":"pub trait Float:\n\n Copy\n\n + From\n\n + From\n\n + Floor\n\n + FAbs\n\n + Sqrt\n\n + Constants\n\n + LoadFromMem\n\n + StoreInMem\n\n + GetAllocator\n\n{\n\n}\n\n\n\nimpl Float for ClearIEEE {}\n\n\n\nimpl Float for SecretIEEE {}\n\n\n\nimpl Float for ClearFixed\n\nwhere\n","file_path":"WebAssembly/scale_std/src/math.rs","rank":90,"score":153927.7285816637},{"content":"pub trait RevealIfSecret {\n\n type Output;\n\n fn reveal_if_secret(&self) -> Self::Output;\n\n}\n\n\n\nmod clear_modp;\n\nmod i64;\n\nmod io;\n\nmod print;\n\nmod secret_bit;\n\nmod secret_i64;\n\nmod secret_modp;\n\nmod system;\n\n\n\npub use io::*;\n\npub use print::*;\n\npub use system::*;\n\n\n\n#[cfg(not(feature = \"emulate\"))]\n\nextern \"Rust\" {\n","file_path":"WebAssembly/scale/src/lib.rs","rank":91,"score":153927.7285816637},{"content":"pub trait InnerModp:\n\n AnyRegister\n\n + From\n\n + Into\n\n + RevealIfSecret\n\n + Mul\n\n + Add\n\n + Sub\n\n + Mul\n\n + Add\n\n + Sub\n\n{\n\n}\n\n\n\nimpl InnerModp for ClearModp {}\n\nimpl InnerModp for SecretModp {}\n\n\n","file_path":"WebAssembly/scale/src/lib.rs","rank":92,"score":153927.7285816637},{"content":"pub trait Constants\n\nwhere\n\n Self: From,\n\n{\n\n #[inline(always)]\n\n fn two_pi() -> Self {\n\n Self::from(6.2831853071795864769252867665590057684)\n\n }\n\n #[inline(always)]\n\n fn pi() -> Self {\n\n Self::from(3.1415926535897932384626433832795028842)\n\n }\n\n #[inline(always)]\n\n fn half_pi() -> Self {\n\n Self::from(1.5707963267948966192313216916397514421)\n\n }\n\n #[inline(always)]\n\n fn ln2() -> Self {\n\n Self::from(0.69314718055994530941723212145817656807)\n\n }\n\n #[inline(always)]\n\n fn e() -> Self {\n\n Self::from(2.7182818284590452353602874713526624978)\n\n }\n\n}\n\n\n\n/* Make some supertraits to help in where clauses */\n\n\n","file_path":"WebAssembly/scale_std/src/math.rs","rank":93,"score":153927.7285816637},{"content":"#[cfg_attr(not(feature = \"emulate\"), no_mangle)]\n\npub fn main() {\n\n let y = black_box(5);\n\n for i in 0..y {\n\n unsafe { __print_reg(__convint(i)) };\n\n }\n\n unsafe { __print_reg(__ldi(42)) };\n\n}\n","file_path":"WebAssembly/scale/examples/control_flow.rs","rank":94,"score":153427.51384276053},{"content":"#[inline(always)]\n\npub fn clear_memory() {\n\n unsafe { __clear_memory() }\n\n}\n\n\n\n// Clear Registers\n","file_path":"WebAssembly/scale/src/system.rs","rank":95,"score":153427.51384276053},{"content":"fn parse_operand(cx: &Compiler, span: Span) -> Spanned {\n\n let span = span.trim(cx);\n\n let s = span.snippet(cx).to_ascii_lowercase();\n\n match &*s {\n\n \"true\" => return span.with(Operand::Value(Const::Bool(true))),\n\n \"false\" => return span.with(Operand::Value(Const::Bool(false))),\n\n _ => {}\n\n }\n\n let mut chars = s.chars();\n\n let mut id_span = span;\n\n let mkfn: fn(u32) -> Register = {\n\n match chars.next() {\n\n None => {\n\n return cx\n\n .report(crate::errors::ExpectedOperand { span })\n\n .with(Operand::Value(Const::Int(i32::min_value())))\n\n }\n\n Some('c') => {\n\n id_span = id_span.eat_one();\n\n |i| Register::Clear(register::Clear(i))\n","file_path":"Assembler/src/lexer/parser.rs","rank":96,"score":153409.13115204964},{"content":"fn catch_or_neg_one(f: impl FnOnce() -> Result<()>) -> c_int {\n\n std::panic::catch_unwind(std::panic::AssertUnwindSafe(f))\n\n .map_err(|_| error!(\"panic caught before going back to C\"))\n\n .and_then(|val| val.map(|_| 0_i32).map_err(|e| error!(\"{}\", e)))\n\n .unwrap_or(-1_i32)\n\n}\n\n\n\n#[no_mangle]\n\n#[must_use]\n\npub extern \"C\" fn scale_io_close(handle: &mut ScaleMambaHandle) -> c_int {\n\n catch_or_neg_one(|| handle.handler.close())\n\n}\n\n\n\n#[no_mangle]\n\n#[must_use]\n\npub extern \"C\" fn scale_io_open_channel(handle: &ScaleMambaHandle, channel: c_uint) -> c_int {\n\n catch_or_neg_one(|| handle.handler.open_channel(channel))\n\n}\n\n\n\n#[no_mangle]\n","file_path":"src/src/scale_mamba_handler.rs","rank":97,"score":153191.31802191603},{"content":"pub fn generate_bytecode<'a>(\n\n cx: &'a Compiler,\n\n asm: &[Lexical<'a>],\n\n mut dest: impl std::io::Write,\n\n) -> std::io::Result<()> {\n\n for lex in asm {\n\n let get_instr = |name: &str, span| match name2instr(name) {\n\n Some(val) => val,\n\n None => {\n\n cx.report(UnimplementedInstruction { span, name });\n\n name2instr(\"crash\").unwrap()\n\n }\n\n };\n\n let (opcode, args) = if lex.instruction.starts_with('v') {\n\n let instr = &get_instr(&lex.instruction[1..], lex.span);\n\n assert!(instr.vectorizable);\n\n let (v, args) = lex.args.split_first().unwrap();\n\n let v: u32 = cx.checked_from(*v).elem;\n\n // magic number 9 taken from SCALE documentation\n\n (instr.opcode | v << 9, args)\n","file_path":"Assembler/src/binary.rs","rank":98,"score":151105.42029521876},{"content":"pub fn run_optimizations<'a>(\n\n cx: &'a Compiler,\n\n body: &mut Body<'a>,\n\n dump: Option,\n\n optimizations: &[String],\n\n) {\n\n let passes: std::collections::HashMap<_, _> = PASSES\n\n .iter()\n\n .map(|p| {\n\n let pass = p();\n\n (pass.name(), p)\n\n })\n\n .collect();\n\n for pass in optimizations {\n\n let mut pass = (passes.get(pass.as_str()).expect(\"unknown pass\"))();\n\n println!(\"run_optimizations: {}\", pass.name());\n\n info!(\"opt pass: {}\", pass.name());\n\n pass.apply(cx, body);\n\n if let Some(dump) = &dump {\n\n dump_pass(cx, body, dump, pass.name());\n\n }\n\n }\n\n}\n\n\n","file_path":"Assembler/src/transforms.rs","rank":99,"score":151105.42029521876}],"string":"[\n {\n \"content\": \"/// Returns `true` if the statement is valid\\n\\npub fn validate(cx: &Compiler, stmt: &Statement<'_>) -> bool {\\n\\n let relexed = stmt.relex(cx);\\n\\n let (instr, args) = match relexed.0.fetch_instr(cx) {\\n\\n Some(i) => i,\\n\\n None => return true,\\n\\n };\\n\\n for (arg_index, (should, &is)) in instr.args.iter().zip(args).enumerate() {\\n\\n match should.ty {\\n\\n ArgTy::Player | ArgTy::Channel | ArgTy::Int { .. } => match is.elem {\\n\\n Operand::Register(_) => {\\n\\n cx.report(ExpectedGot {\\n\\n expected: format!(\\n\\n \\\"constant as argument {} to {}\\\",\\n\\n arg_index,\\n\\n relexed.0.display(cx)\\n\\n ),\\n\\n got: is,\\n\\n });\\n\\n return false;\\n\\n }\\n\",\n \"file_path\": \"Assembler/src/transforms/validate.rs\",\n \"rank\": 0,\n \"score\": 343088.0965155149\n },\n {\n \"content\": \"pub trait CompileTimeLengthIterator {}\\n\\n\\n\\nimpl CompileTimeLengthIterator for Iter {}\\n\\n\\n\\nimpl, const N: u64> CompileTimeLengthIterator\\n\\n for core::iter::Rev\\n\\n{\\n\\n}\\n\\n\\n\\npub struct Iter {\\n\\n iter: I,\\n\\n}\\n\\n\\n\\nimpl Iter {\\n\\n pub unsafe fn new(iter: I) -> Self {\\n\\n Self { iter }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Iterator for Iter {\\n\",\n \"file_path\": \"WebAssembly/scale_std/src/iter.rs\",\n \"rank\": 1,\n \"score\": 304254.818016304\n },\n {\n \"content\": \"fn check_ty_for_impl(ty: &ArgTy) -> bool {\\n\\n match ty {\\n\\n ArgTy::Int { .. }\\n\\n | ArgTy::Player\\n\\n | ArgTy::Channel\\n\\n | ArgTy::Register(RegisterKind::Regint, ..)\\n\\n | ArgTy::Register(RegisterKind::Bit, ..) => false,\\n\\n ArgTy::Register(RegisterKind::Secret, ..)\\n\\n | ArgTy::Register(RegisterKind::SecretBit, ..)\\n\\n | ArgTy::Register(RegisterKind::Clear, ..)\\n\\n | ArgTy::Register(RegisterKind::SecretRegint, ..) => true,\\n\\n ArgTy::List { .. } => unimplemented!(),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"WebAssembly/scale/impl_generator/src/lib.rs\",\n \"rank\": 2,\n \"score\": 298923.26322113693\n },\n {\n \"content\": \"fn byte_to_bits(b: u8) -> impl Iterator- {\\n\\n (0..8).rev().map(move |i| (b >> i) & 1 == 1)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"WebAssembly/scale/impl_generator/src/lib.rs\",\n \"rank\": 4,\n \"score\": 274728.38919365813\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn require_bit_length
(_: ConstU32) {\\n\\n unsafe { __reqbl(BIT_LENGTH) }\\n\\n}\\n\\n\\n\\n// Crash the system\\n\",\n \"file_path\": \"WebAssembly/scale/src/system.rs\",\n \"rank\": 6,\n \"score\": 242912.93551455505\n },\n {\n \"content\": \"// Returns \\n\\n// false: if there is more than one instruction which reads this source register\\n\\n// and more than one instruction which writes this destination register\\n\\n// true: if only one which reads\\n\\nfn is_removable<'a>(cx: &'a Compiler, body: &Body<'a>, source: Register, destination: Register) \\n\\n -> bool\\n\\n{\\n\\n let mut cnts=0;\\n\\n let mut cntd=0;\\n\\n for block in &body.blocks {\\n\\n for stmt in &block.stmts {\\n\\n for x in stmt.read_registers_base(cx) {\\n\\n if x == source {\\n\\n if cnts==0 { cnts=1 }\\n\\n else { return false; }\\n\\n }\\n\\n }\\n\\n for x in stmt.write_registers_base(cx) {\\n\\n if x == destination {\\n\\n if cntd==0 { cntd=1 }\\n\\n else { return false; }\\n\\n }\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"Assembler/src/transforms/destination_propagation.rs\",\n \"rank\": 7,\n \"score\": 241054.84963537945\n },\n {\n \"content\": \"type F = fn() -> !;\\n\",\n \"file_path\": \"WebAssembly/scale/src/lib.rs\",\n \"rank\": 8,\n \"score\": 235057.02404020948\n },\n {\n \"content\": \"pub trait Error: std::fmt::Debug + Sized {\\n\\n fn print(self, cx: &Compiler) -> Snippet<'_>;\\n\\n /// Whether compilation should not succeed\\n\\n fn fatal(&self) -> bool {\\n\\n true\\n\\n }\\n\\n fn spans(&self) -> &[Span];\\n\\n fn slices<'a>(\\n\\n &self,\\n\\n cx: &'a Compiler,\\n\\n label: &'a str,\\n\\n annotation_type: AnnotationType,\\n\\n ) -> Vec> {\\n\\n self.spans()\\n\\n .iter()\\n\\n .filter_map(|&span| cx.get_file(span).map(|(p, f)| (p, f, span)))\\n\\n .map(move |(path, file, span)| {\\n\\n let (line_start, range, source) = crate::errors::line(span.snippet(cx), file);\\n\\n Slice {\\n\\n source: cx.strings.push_get(source),\\n\",\n \"file_path\": \"Assembler/src/compiler.rs\",\n \"rank\": 9,\n \"score\": 231522.4494012343\n },\n {\n \"content\": \"pub fn atan_sfix(\\n\\n x: SecretFixed,\\n\\n) -> SecretFixed\\n\\nwhere\\n\\n ConstU64<{ K - F }>: ,\\n\\n ConstU64<{ 2 * K }>: ,\\n\\n ConstU64<{ 2 * F }>: ,\\n\\n ConstU64<{ 2 * (K - F) }>: ,\\n\\n ConstU64<{ K - 1 }>: ,\\n\\n ConstU64<{ K + 1 }>: ,\\n\\n ConstU64<{ F + 1 }>: ,\\n\\n ConstI32<{ f_as_i32(F) }>: ,\\n\\n ConstI32<{ f_as_i32(K) }>: ,\\n\\n ConstU64<{ ClearFixed::::THETA }>: ,\\n\\n ConstU64<{ SecretFixed::::THETA }>: ,\\n\\n{\\n\\n let ans = kernel_atan::, ClearFixed, SecretModp>(x);\\n\\n ans\\n\\n}\\n\\n\\n\\n/***********************************\\n\\n * Exponenentiation *\\n\\n ***********************************/\\n\\n\\n\",\n \"file_path\": \"WebAssembly/scale_std/src/math_generic.rs\",\n \"rank\": 10,\n \"score\": 224991.66095358273\n },\n {\n \"content\": \"fn pop_ty_fn_name(ty: &ArgTy) -> &'static str {\\n\\n match ty {\\n\\n ArgTy::Int { signed: true, .. } => unimplemented!(),\\n\\n ArgTy::Int { signed: false, .. } => unimplemented!(),\\n\\n ArgTy::Register(RegisterKind::Secret, ..) => \\\"secret_modp\\\",\\n\\n ArgTy::Register(RegisterKind::SecretBit, ..) => \\\"secret_bit\\\",\\n\\n ArgTy::Register(RegisterKind::Clear, ..) => \\\"clear_modp\\\",\\n\\n ArgTy::Register(RegisterKind::Regint, ..) => \\\"i64\\\",\\n\\n ArgTy::Register(RegisterKind::Bit, ..) => \\\"bool\\\",\\n\\n ArgTy::Register(RegisterKind::SecretRegint, ..) => \\\"secret_i64\\\",\\n\\n ArgTy::List { .. } => unimplemented!(),\\n\\n ArgTy::Player => unimplemented!(),\\n\\n ArgTy::Channel => unimplemented!(),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"WebAssembly/scale/impl_generator/src/lib.rs\",\n \"rank\": 12,\n \"score\": 223983.9841103845\n },\n {\n \"content\": \"fn table_start(mut f: F, i: impl std::fmt::Display) -> io::Result<()> {\\n\\n write!(f, \\\"b{} [shape=\\\\\\\"none\\\\\\\" label=<\\\", i)?;\\n\\n write!(f, r#\\\"\\\"#)?;\\n\\n write!(f, r#\\\"
\\\")?;\\n\\n writeln!(f, \\\">];\\\")?;\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"Assembler/src/asm/graphviz.rs\",\n \"rank\": 20,\n \"score\": 201948.39156527742\n },\n {\n \"content\": \"fn read_input(source: PathBuf, f: impl Read, cx: &Compiler, input_format: InputFormat) -> Body<'_> {\\n\\n match input_format {\\n\\n InputFormat::Assembly => cx.parse_asm(source, f),\\n\\n InputFormat::Bytecode => cx.parse_bytecode(source, f),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"Assembler/src/main.rs\",\n \"rank\": 21,\n \"score\": 199820.29101197878\n },\n {\n \"content\": \"pub fn parse<'a>(cx: &'a Compiler, input: &'a [u8]) -> Vec> {\\n\\n let op2instr: HashMap<_, _> = instructions::INSTRUCTIONS\\n\\n .iter()\\n\\n .flat_map(|group| group.instructions)\\n\\n .map(|i| (i.opcode, i))\\n\\n .collect();\\n\\n\\n\\n let mut current = input;\\n\\n let mut lexicals = Vec::new();\\n\\n let mut read = |eof_ok| {\\n\\n if eof_ok && current.is_empty() {\\n\\n return Err(());\\n\\n }\\n\\n let mut bytes = [0; 4];\\n\\n match current.read_exact(&mut bytes) {\\n\\n Ok(()) => Ok(u32::from_be_bytes(bytes)),\\n\\n Err(err) => {\\n\\n cx.report(Io { err });\\n\\n Err(())\\n\\n }\\n\",\n \"file_path\": \"Assembler/src/binary.rs\",\n \"rank\": 22,\n \"score\": 199238.9323512715\n },\n {\n \"content\": \"pub trait TestValue {\\n\\n #[track_caller]\\n\\n fn test_value(self, val: Self);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"WebAssembly/scale/src/lib.rs\",\n \"rank\": 23,\n \"score\": 198931.03069834705\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn clear_registers() {\\n\\n unsafe { __clear_registers() }\\n\\n}\\n\\n\\n\\n// GC call\\n\\n#[inline(always)]\\n\\npub unsafe fn execute_garbled_circuit(_: ConstU32) {\\n\\n __gc(ID)\\n\\n}\\n\\n\\n\\n// LF call\\n\\n#[inline(always)]\\n\\npub unsafe fn execute_local_function(_: ConstU32) {\\n\\n __lf(ID)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"WebAssembly/scale/src/system.rs\",\n \"rank\": 24,\n \"score\": 198411.26285829613\n },\n {\n \"content\": \"pub fn parse<'a>(cx: &'a Compiler, file: u32) -> Vec> {\\n\\n Span::lines(cx, file)\\n\\n .filter_map(|span| Lexical::parse(cx, span))\\n\\n .collect()\\n\\n}\\n\\n\\n\\nimpl<'a> Lexical<'a> {\\n\\n pub fn parse(cx: &'a Compiler, span: Span) -> Option {\\n\\n // remove comments\\n\\n let (start, comment) = span.split_at_first_char('#', cx);\\n\\n let comment = comment.unwrap_or_else(|| span.end()).trim(cx);\\n\\n let line = start.trim(cx);\\n\\n let (instruction, args) = line.split_at_first_char(' ', cx);\\n\\n let args = args\\n\\n .map(|args| {\\n\\n args.split(',', cx)\\n\\n .map(|arg| parse_operand(cx, arg))\\n\\n .collect()\\n\\n })\\n\\n .unwrap_or_default();\\n\",\n \"file_path\": \"Assembler/src/lexer/parser.rs\",\n \"rank\": 25,\n \"score\": 196968.71817081724\n },\n {\n \"content\": \"#[proc_macro]\\n\\npub fn impls(_: TokenStream) -> TokenStream {\\n\\n let groups = documentation::INSTRUCTIONS\\n\\n .iter()\\n\\n .enumerate()\\n\\n .map(|(i, group)| {\\n\\n let instructions = group.instructions.iter().filter_map(|instr| {\\n\\n let (args, ret) = split_args(instr.args)?;\\n\\n let ret_types = ret.iter().map(|r| print_ty(&r.ty));\\n\\n let arg_names: Vec<_> = args\\n\\n .iter()\\n\\n .map(|a| quote::format_ident!(\\\"__{}\\\", a.name))\\n\\n .collect();\\n\\n let arg_types: Vec<_> = args.iter().map(|a| print_ty(&a.ty)).collect();\\n\\n let name = instr.name.to_lowercase();\\n\\n let comments = instr.comment.lines().map(|line| {\\n\\n let line = line.trim();\\n\\n quote!(#[doc = #line])\\n\\n });\\n\\n let name_ident = quote::format_ident!(\\\"__{}\\\", name);\\n\\n\\n\",\n \"file_path\": \"WebAssembly/scale/impl_generator/src/lib.rs\",\n \"rank\": 26,\n \"score\": 195768.69774518214\n },\n {\n \"content\": \"pub trait MapAllValues {\\n\\n fn map_all_values(&mut self, cx: &Compiler, f: impl FnMut(T) -> T);\\n\\n}\\n\\n\\n\\nimpl<\\n\\n T: std::fmt::Display + std::fmt::Debug + Copy,\\n\\n U: Expected + Default + TryFrom + Into + Copy + std::fmt::Display,\\n\\n > MapAllValues for Spanned\\n\\n{\\n\\n fn map_all_values(&mut self, cx: &Compiler, mut f: impl FnMut(T) -> T) {\\n\\n *self = self.map(|this| f(this.into())).require(cx);\\n\\n }\\n\\n}\\n\\n\\n\\nimpl MapAllValues for Spanned {\\n\\n fn map_all_values(&mut self, _cx: &Compiler, mut f: impl FnMut(Register) -> Register) {\\n\\n match self.elem {\\n\\n Operand::Value(_) => {}\\n\\n Operand::Register(reg) => self.elem = Operand::Register(f(reg)),\\n\\n }\\n\",\n \"file_path\": \"Assembler/src/lexer.rs\",\n \"rank\": 27,\n \"score\": 194838.9250675088\n },\n {\n \"content\": \"pub trait FAbs {\\n\\n fn fabs(self) -> Self;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"WebAssembly/scale_std/src/math.rs\",\n \"rank\": 28,\n \"score\": 194649.25399511546\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn stop_clock(_: ConstI32) {\\n\\n unsafe { __stop_clock(ID) }\\n\\n}\\n\\n\\n\\n// Requests a given minimum bit length of the prime\\n\",\n \"file_path\": \"WebAssembly/scale/src/system.rs\",\n \"rank\": 29,\n \"score\": 193475.90017041407\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn start_clock(_: ConstI32) {\\n\\n unsafe { __start_clock(ID) }\\n\\n}\\n\\n\\n\\n// Stops the clock and prints the time\\n\",\n \"file_path\": \"WebAssembly/scale/src/system.rs\",\n \"rank\": 30,\n \"score\": 193475.90017041407\n },\n {\n \"content\": \"#[proc_macro_attribute]\\n\\npub fn main(attrs: TokenStream, item: TokenStream) -> TokenStream {\\n\\n let fn_ = syn::parse_macro_input!(item as syn::ItemFn);\\n\\n\\n\\n let assign_attrs: AssignAttrs = match syn::parse(attrs) {\\n\\n Ok(attrs) => attrs,\\n\\n Err(_) => {\\n\\n return TokenStream::from(\\n\\n Error::new_spanned(fn_, \\\"cannot parse attributes\\\").to_compile_error(),\\n\\n );\\n\\n }\\n\\n };\\n\\n\\n\\n let left = assign_attrs.left;\\n\\n let right = assign_attrs.right;\\n\\n\\n\\n let res = quote! {\\n\\n scale::__main!{\\n\\n #(#left = #right;)*\\n\\n }\\n\\n\\n\\n #fn_\\n\\n };\\n\\n\\n\\n TokenStream::from(res)\\n\\n}\\n\",\n \"file_path\": \"WebAssembly/scale/impl_generator/src/lib.rs\",\n \"rank\": 31,\n \"score\": 192452.0464799485\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn reg_carry(\\n\\n b: Array,\\n\\n a: Array,\\n\\n compute_p: bool,\\n\\n) -> Array {\\n\\n let mut ans: Array = Array::uninitialized();\\n\\n if compute_p {\\n\\n ans.set(0, &(*a.get_unchecked(0) * *b.get_unchecked(0)));\\n\\n }\\n\\n ans.set(\\n\\n 1,\\n\\n &(*a.get_unchecked(1) + *a.get_unchecked(0) * *b.get_unchecked(1)),\\n\\n );\\n\\n ans\\n\\n}\\n\\n\\n\",\n \"file_path\": \"WebAssembly/scale_std/src/bit_protocols.rs\",\n \"rank\": 32,\n \"score\": 190125.5431915715\n },\n {\n \"content\": \"pub fn substr_offset(substr: &str, main_str: &str) -> Option {\\n\\n let sub_ptr = substr.as_bytes().as_ptr() as usize;\\n\\n let main_ptr = main_str.as_bytes().as_ptr() as usize;\\n\\n if main_ptr <= sub_ptr && (sub_ptr + substr.len()) <= (main_ptr + main_str.len()) {\\n\\n Some(sub_ptr - main_ptr)\\n\\n } else {\\n\\n None\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Drop for Compiler {\\n\\n fn drop(&mut self) {\\n\\n if !std::thread::panicking() && self.error_count.get() > 0 {\\n\\n panic!(\\\"do not drop `Compiler` types without checking for errors, use `.check_for_errors()` before doing so\\\");\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\npub struct ErrorReported(());\\n\\n\\n\\nimpl std::fmt::Debug for ErrorReported {\\n\\n fn fmt(&self, fmt: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\\n\\n fmt.write_str(\\\"Error already reported\\\")\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"Assembler/src/compiler.rs\",\n \"rank\": 33,\n \"score\": 185580.15663746803\n },\n {\n \"content\": \"#[allow(non_snake_case)]\\n\\nfn AppRcr(\\n\\n b: SecretModp,\\n\\n _: ConstU64,\\n\\n _: ConstU64,\\n\\n _: ConstU64,\\n\\n) -> SecretModp\\n\\nwhere\\n\\n ConstU64<{ 2 * (K - F) }>: ,\\n\\n ConstU64<{ 2 * K }>: ,\\n\\n ConstU64<{ K + 1 }>: ,\\n\\n ConstU64<{ K - 1 }>: ,\\n\\n{\\n\\n let a: i64 = (2.9142 * ((1_i64 << K) as f64)) as i64;\\n\\n let alpha = ClearModp::from(a);\\n\\n\\n\\n let Nm = Norm(b, ConstU64::, ConstU64::);\\n\\n let c = *Nm.get_unchecked(0);\\n\\n let v = *Nm.get_unchecked(1);\\n\\n let d = alpha - c - c;\\n\\n let w_int: SecretInteger<{ 2 * K }, KAPPA> = SecretInteger::from(d * v);\\n\",\n \"file_path\": \"WebAssembly/scale_std/src/fixed_point.rs\",\n \"rank\": 34,\n \"score\": 184580.66159373283\n },\n {\n \"content\": \"fn approximate_reciprocal(\\n\\n divisor: ClearModp,\\n\\n _: ConstU64,\\n\\n _: ConstU64,\\n\\n _: ConstU64,\\n\\n) -> ClearModp\\n\\nwhere\\n\\n ConstI32<{ f_as_i32(K) }>: ,\\n\\n{\\n\\n let bits: Slice = BitDec_ClearModp(divisor, K);\\n\\n let mut cnt_leading_zeros = ClearModp::from(0);\\n\\n let mut flag: i64 = 0;\\n\\n let mut normalized_divisor = divisor;\\n\\n\\n\\n for i in 0..K {\\n\\n flag = flag | i64::from(*bits.get_unchecked(K - 1 - i));\\n\\n if flag == 0 {\\n\\n cnt_leading_zeros = cnt_leading_zeros + ClearModp::from(1);\\n\\n normalized_divisor = normalized_divisor + normalized_divisor;\\n\\n }\\n\",\n \"file_path\": \"WebAssembly/scale_std/src/fixed_point.rs\",\n \"rank\": 35,\n \"score\": 184580.66159373283\n },\n {\n \"content\": \"class Array(object):\\n\\n \\\"\\\"\\\" Array objects \\\"\\\"\\\"\\n\\n\\n\\n def __init__(self, length, value_type, address=None):\\n\\n if value_type in _types:\\n\\n value_type = _types[value_type]\\n\\n self.address = address\\n\\n self.length = length\\n\\n self.value_type = value_type\\n\\n if address is None:\\n\\n self.address = self._malloc()\\n\\n\\n\\n def _malloc(self):\\n\\n return program.malloc(self.length, self.value_type)\\n\\n\\n\\n def delete(self):\\n\\n if program:\\n\\n program.free(self.address, self.value_type.reg_type)\\n\\n\\n\\n def get_address(self, index):\\n\\n if isinstance(index, int) and self.length is not None:\\n\\n index += self.length * (index < 0)\\n\\n if index >= self.length or index < 0:\\n\\n raise IndexError('index %s, length %s' % \\\\\\n\\n (str(index), str(self.length)))\\n\\n return self.address + index\\n\\n\\n\\n def get_slice(self, index):\\n\\n if index.stop is None and self.length is None:\\n\\n raise CompilerError('Cannot slice array of unknown length')\\n\\n return index.start or 0, index.stop or self.length, index.step or 1\\n\\n\\n\\n def __getitem__(self, index):\\n\\n if isinstance(index, slice):\\n\\n start, stop, step = self.get_slice(index)\\n\\n res_length = (stop - start - 1) / step + 1\\n\\n res = Array(res_length, self.value_type)\\n\\n\\n\\n @library.for_range(res_length)\\n\\n def f(i):\\n\\n res[i] = self[start + i * step]\\n\\n\\n\\n return res\\n\\n return self._load(self.get_address(index))\\n\\n\\n\\n def __setitem__(self, index, value):\\n\\n if isinstance(index, slice):\\n\\n start, stop, step = self.get_slice(index)\\n\\n source_index = MemValue(0)\\n\\n\\n\\n @library.for_range(start, stop, step)\\n\\n def f(i):\\n\\n self[i] = value[source_index]\\n\\n source_index.iadd(1)\\n\\n\\n\\n return\\n\\n self._store(self.value_type.conv(value), self.get_address(index))\\n\\n\\n\\n def _load(self, address):\\n\\n return self.value_type.load_mem(address)\\n\\n\\n\\n def _store(self, value, address):\\n\\n value.store_in_mem(address)\\n\\n\\n\\n def __len__(self):\\n\\n return self.length\\n\\n\\n\\n def __iter__(self):\\n\\n for i in range(self.length):\\n\\n yield self[i]\\n\\n\\n\\n def assign(self, other):\\n\\n if isinstance(other, Array):\\n\\n def loop(i):\\n\\n self[i] = other[i]\\n\\n\\n\\n library.range_loop(loop, len(self))\\n\\n elif isinstance(other, Tape.Register):\\n\\n if len(other) == self.length:\\n\\n self[0] = other\\n\\n else:\\n\\n raise CompilerError('Length mismatch between array and vector')\\n\\n else:\\n\\n for i, j in enumerate(other):\\n\\n self[i] = j\\n\\n return self\\n\\n\\n\\n def assign_all(self, value):\\n\\n mem_value = MemValue(value)\\n\\n n_loops = 8 if len(self) > 2 ** 20 else 1\\n\\n\\n\\n @library.for_range_multithread(n_loops, 1024, len(self))\\n\\n def f(i):\\n\\n self[i] = mem_value\\n\\n\\n\",\n \"file_path\": \"Compiler/types.py\",\n \"rank\": 36,\n \"score\": 184027.33820709487\n },\n {\n \"content\": \"#[instrument(skip(stmts))]\\n\\nfn find_elements(stmts: &[Statement<'_>]) -> Option<(Register, Register, i32)> {\\n\\n let mut iter = stmts.iter().rev();\\n\\n let neg = iter.next()?;\\n\\n let one = iter.next()?;\\n\\n let eq = iter.next()?;\\n\\n let constant = iter.next()?;\\n\\n\\n\\n let (constant, val) = constant.instr.as_assign()?;\\n\\n let eq_val = val.try_as_int().ok()?;\\n\\n\\n\\n let (eq_result, a, b) = eq.instr.as_binop(\\\"eqint\\\")?;\\n\\n let eq_reg = match (a == constant, b == constant) {\\n\\n (true, true) => unreachable!(),\\n\\n (true, false) => b,\\n\\n (false, true) => a,\\n\\n (false, false) => return None,\\n\\n };\\n\\n\\n\\n let (one, val) = one.instr.as_assign()?;\\n\\n if val.try_as_int().ok()? != 1 {\\n\\n return None;\\n\\n }\\n\\n\\n\\n let (dest, a, b) = neg.instr.as_binop(\\\"subint\\\")?;\\n\\n if a != one || b != eq_result {\\n\\n return None;\\n\\n }\\n\\n Some((dest, eq_reg, eq_val))\\n\\n}\\n\",\n \"file_path\": \"Assembler/src/transforms/cmp.rs\",\n \"rank\": 37,\n \"score\": 183604.802650814\n },\n {\n \"content\": \"#[inline(always)]\\n\\n#[allow(non_snake_case)]\\n\\n#[allow(unused_variables)]\\n\\npub fn Gauss_Elim(\\n\\n A: &Matrix,\\n\\n) -> Matrix {\\n\\n let (col, row, B) = unsafe {\\n\\n execute_local_function!(GAUSS_ELIM(\\n\\n N as i64,\\n\\n M as i64,\\n\\n *A\\n\\n ) ->\\n\\n i64,\\n\\n i64,\\n\\n Matrix::\\n\\n )\\n\\n };\\n\\n\\n\\n #[cfg(all(debug_assertions, not(feature = \\\"emulate\\\")))]\\n\\n if row != (N as i64) || col != (M as i64) {\\n\\n crash();\\n\\n }\\n\\n\\n\\n B\\n\\n}\\n\\n\\n\",\n \"file_path\": \"WebAssembly/scale_std/src/local_functions.rs\",\n \"rank\": 38,\n \"score\": 181859.51617456472\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn close_channel(_: Channel) {\\n\\n unsafe {\\n\\n __close_channel(C);\\n\\n }\\n\\n}\\n\\n\\n\\n/*\\n\\n\\n\",\n \"file_path\": \"WebAssembly/scale/src/io.rs\",\n \"rank\": 39,\n \"score\": 181720.17436409445\n },\n {\n \"content\": \"#[inline(always)]\\n\\n#[allow(non_snake_case)]\\n\\npub fn BitLT(\\n\\n a: ClearModp,\\n\\n bb: impl IntoIterator- + CompileTimeLengthIterator
,\\n\\n) -> SecretModp {\\n\\n let mut ab: Array = Array::uninitialized();\\n\\n let mut sb: Array = Array::uninitialized();\\n\\n ab.set(K - 1, &(a % ClearModp::from(ConstI32::<2>)));\\n\\n let mut temp = a;\\n\\n for i in 1..K {\\n\\n temp = (temp - *ab.get_unchecked(K - i)) / ClearModp::from(ConstI32::<2>);\\n\\n ab.set(K - i - 1, &(temp % ClearModp::from(ConstI32::<2>)));\\n\\n }\\n\\n for (i, v) in bb.into_iter().enumerate() {\\n\\n sb.set(K - 1 - i as u64, &(ConstI32::<1> - v));\\n\\n }\\n\\n let c: SecretModp = CarryOut(&ab.slice(..), &sb.slice(..), ClearModp::from(ConstI32::<1>));\\n\\n return ConstI32::<1> - c;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"WebAssembly/scale_std/src/bit_protocols.rs\",\n \"rank\": 40,\n \"score\": 180927.4039098763\n },\n {\n \"content\": \"#[inline(always)]\\n\\n#[allow(non_snake_case)]\\n\\npub fn SHA3(istate: Array) -> Array {\\n\\n let ostate = unsafe { execute_garbled_circuit!(SHA_3(istate) -> Array) };\\n\\n ostate\\n\\n}\\n\\n\\n\",\n \"file_path\": \"WebAssembly/scale_std/src/circuits.rs\",\n \"rank\": 41,\n \"score\": 180537.13138148256\n },\n {\n \"content\": \"pub fn main(args: Args) -> Result<(), Error> {\\n\\n // Load wasm input\\n\\n let buf = if let Some(file) = args.input {\\n\\n std::fs::read(file)?\\n\\n } else {\\n\\n let stdin = std::io::stdin();\\n\\n let mut stdin = stdin.lock();\\n\\n let mut buf = Vec::new();\\n\\n stdin.read_to_end(&mut buf)?;\\n\\n buf\\n\\n };\\n\\n\\n\\n // Parse wasm input\\n\\n let config = walrus::ModuleConfig::new();\\n\\n let module = config.parse(&buf)?;\\n\\n let exports: HashMap = module\\n\\n .exports\\n\\n .iter()\\n\\n .map(|export| (export.name.to_owned(), &export.item))\\n\\n .collect();\\n\",\n \"file_path\": \"WebAssembly/src/lib.rs\",\n \"rank\": 42,\n \"score\": 180226.0142986595\n },\n {\n \"content\": \" /// A helper trait that is implemented for all register types\\n\\n /// and has bounds for all operations implemented by those types.\\n\\n /// This allows one to easily write code that is generic over\\n\\n /// the various register types.\\n\\n pub trait AnyRegister: $($bound+)* Sized {}\\n\\n };\\n\\n}\\n\\n\\n\\nimpl AnyRegister for ClearModp {}\\n\\nimpl AnyRegister for SecretModp {}\\n\\nimpl AnyRegister for i64 {}\\n\\nimpl AnyRegister for SecretI64 {}\\n\\n\\n\\nuse core::ops::*;\\n\\n\\n\\nany_register! {\\n\\n Stack,\\n\\n alloc::GetAllocator,\\n\\n Add
| \\\"#)?;\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"Assembler/src/asm/graphviz.rs\",\n \"rank\": 13,\n \"score\": 219839.51580206506\n },\n {\n \"content\": \"pub trait Expected {\\n\\n const EXPECTED: &'static str;\\n\\n}\\n\",\n \"file_path\": \"Assembler/src/compiler.rs\",\n \"rank\": 14,\n \"score\": 211577.3630627715\n },\n {\n \"content\": \"fn asm_ty(ty: &ArgTy) -> proc_macro2::TokenStream {\\n\\n match ty {\\n\\n ArgTy::Int { signed: true, .. } => quote!(i32),\\n\\n ArgTy::Int { signed: false, .. } => quote!(u32),\\n\\n ArgTy::Register(RegisterKind::Secret, ..) => quote!(crate::SecretModp),\\n\\n ArgTy::Register(RegisterKind::SecretBit, ..) => quote!(crate::RawSecretBit),\\n\\n ArgTy::Register(RegisterKind::Clear, ..) => quote!(crate::ClearModp),\\n\\n ArgTy::Register(RegisterKind::Regint, ..) => quote!(i64),\\n\\n ArgTy::Register(RegisterKind::Bit, ..) => quote!(bool),\\n\\n ArgTy::Register(RegisterKind::SecretRegint, ..) => quote!(crate::SecretI64),\\n\\n ArgTy::List { .. } => unimplemented!(),\\n\\n ArgTy::Player => quote!(u32),\\n\\n ArgTy::Channel => quote!(u32),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"WebAssembly/scale/impl_generator/src/lib.rs\",\n \"rank\": 15,\n \"score\": 209097.28184451364\n },\n {\n \"content\": \"fn print_ty(ty: &ArgTy) -> proc_macro2::TokenStream {\\n\\n match ty {\\n\\n ArgTy::Int { signed: true, .. } => quote!(crate::ConstI32),\\n\\n ArgTy::Int { signed: false, .. } => quote!(crate::ConstU32),\\n\\n ArgTy::Register(RegisterKind::Secret, ..) => quote!(crate::SecretModp),\\n\\n ArgTy::Register(RegisterKind::SecretBit, ..) => quote!(crate::RawSecretBit),\\n\\n ArgTy::Register(RegisterKind::Clear, ..) => quote!(crate::ClearModp),\\n\\n ArgTy::Register(RegisterKind::Regint, ..) => quote!(i64),\\n\\n ArgTy::Register(RegisterKind::Bit, ..) => quote!(bool),\\n\\n ArgTy::Register(RegisterKind::SecretRegint, ..) => quote!(crate::SecretI64),\\n\\n ArgTy::List { .. } => unimplemented!(),\\n\\n ArgTy::Player => quote!(crate::Player),\\n\\n ArgTy::Channel => quote!(crate::Channel),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"WebAssembly/scale/impl_generator/src/lib.rs\",\n \"rank\": 16,\n \"score\": 209097.28184451364\n },\n {\n \"content\": \"pub fn list_optimizations() {\\n\\n for pass in PASSES {\\n\\n println!(\\\"{}\\\", pass().name());\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"Assembler/src/transforms.rs\",\n \"rank\": 17,\n \"score\": 207918.29180367445\n },\n {\n \"content\": \"pub trait AsRegisterKind {\\n\\n fn as_register_kind(&self) -> RegisterKind;\\n\\n}\\n\\n\\n\\nimpl AsRegisterKind for ValType {\\n\\n fn as_register_kind(&self) -> RegisterKind {\\n\\n match self {\\n\\n ValType::I32 | ValType::I64 => RegisterKind::Regint,\\n\\n ValType::F32 => RegisterKind::Secret,\\n\\n ValType::F64 => RegisterKind::SecretRegint,\\n\\n ValType::V128 => RegisterKind::Clear,\\n\\n ValType::Externref => unreachable!(),\\n\\n ValType::Funcref => unreachable!(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Stack {\\n\\n pub fn dump_stack(&self) {\\n\\n trace!(\\\"{:#?}\\\", self.stack);\\n\",\n \"file_path\": \"WebAssembly/src/stack.rs\",\n \"rank\": 18,\n \"score\": 203493.2363170171\n },\n {\n \"content\": \"fn split_args(all: &[Arg]) -> Option<(&[Arg], &[Arg])> {\\n\\n if all.iter().any(|arg| matches!(arg.ty, ArgTy::List { .. })) {\\n\\n return None;\\n\\n }\\n\\n for (i, arg) in all.iter().enumerate() {\\n\\n if let ArgTy::Register(_, RegisterMode::Write) = arg.ty {\\n\\n continue;\\n\\n }\\n\\n let (ret, arg) = all.split_at(i);\\n\\n return Some((arg, ret));\\n\\n }\\n\\n Some((&[], all))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"WebAssembly/scale/impl_generator/src/lib.rs\",\n \"rank\": 19,\n \"score\": 202553.54795834952\n },\n {\n \"content\": \"fn table_end |