sha1-asm-0.4.3/Cargo.toml.orig010064400017500001750000000006701345507751300142550ustar0000000000000000[package] name = "sha1-asm" version = "0.4.3" authors = ["RustCrypto Developers"] license = "MIT" description = "Assembly implementation of SHA-1 compression function" documentation = "https://docs.rs/sha1-asm" repository = "https://github.com/RustCrypto/asm-hashes" keywords = ["crypto", "sha1", "asm"] categories = ["cryptography", "no-std"] [build-dependencies] cc = "1.0" [badges] travis-ci = { repository = "RustCrypto/asm-hashes" } sha1-asm-0.4.3/Cargo.toml0000644000000017050000000000000105120ustar00# THIS FILE IS AUTOMATICALLY GENERATED BY CARGO # # When uploading crates to the registry Cargo will automatically # "normalize" Cargo.toml files for maximal compatibility # with all versions of Cargo and also rewrite `path` dependencies # to registry (e.g., crates.io) dependencies # # If you believe there's an error in this file please file an # issue against the rust-lang/cargo repository. If you're # editing this file be aware that the upstream Cargo.toml # will likely look very different (and much more reasonable) [package] name = "sha1-asm" version = "0.4.3" authors = ["RustCrypto Developers"] description = "Assembly implementation of SHA-1 compression function" documentation = "https://docs.rs/sha1-asm" keywords = ["crypto", "sha1", "asm"] categories = ["cryptography", "no-std"] license = "MIT" repository = "https://github.com/RustCrypto/asm-hashes" [build-dependencies.cc] version = "1.0" [badges.travis-ci] repository = "RustCrypto/asm-hashes" sha1-asm-0.4.3/LICENSE010064400017500001750000000021031311741210400123440ustar0000000000000000Copyright (c) 2015 Project Nayuki Copyright (c) 2017 Artyom Pavlov 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. sha1-asm-0.4.3/benches/lib.rs010064400017500001750000000005011311741210400140620ustar0000000000000000#![no_std] #![feature(test)] extern crate test; extern crate sha1_asm; use test::Bencher; #[bench] fn bench_compress(b: &mut Bencher) { let mut state = Default::default(); let data = Default::default(); b.iter(|| { sha1_asm::compress(&mut state, &data); }); b.bytes = data.len() as u64; } sha1-asm-0.4.3/build.rs010064400017500001750000000005401325373231200130160ustar0000000000000000extern crate cc; fn main() { let asm_path = if cfg!(target_arch = "x86") { "src/x86.S" } else if cfg!(target_arch = "x86_64") { "src/x64.S" } else { panic!("Unsupported target architecture"); }; cc::Build::new() .flag("-c") .file(asm_path) .compile("libsha1.a"); } sha1-asm-0.4.3/src/lib.rs010064400017500001750000000014531345507751300132710ustar0000000000000000//! Assembly implementation of [SHA-1][1] compression function. //! //! For full SHA-1 hash function with this implementation of compression function //! use [sha-1](https://crates.io/crates/sha-1) crate with //! the enabled "asm" feature. //! //! Only x86 and x86-64 architectures are currently supported. //! //! [1]: https://en.wikipedia.org/wiki/SHA-1 #![no_std] #[cfg(not(any(target_arch = "x86_64", target_arch = "x86")))] compile_error!("crate can only be used on x86 and x86-64 architectures"); #[link(name="sha1", kind="static")] extern "C" { fn sha1_compress(state: &mut [u32; 5], block: &[u8; 64]); } /// Safe wrapper around assembly implementation of SHA-1 compression function #[inline] pub fn compress(state: &mut [u32; 5], block: &[u8; 64]) { unsafe { sha1_compress(state, block); } } sha1-asm-0.4.3/src/x64.S010064400017500001750000000176731327661315200127310ustar0000000000000000/* * SHA-1 hash in x86-64 assembly * * Copyright (c) 2015 Project Nayuki. (MIT License) * https://www.nayuki.io/page/fast-sha1-hash-implementation-in-x86-assembly * * 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. */ /* void sha1_compress(uint32_t state[5], const uint8_t block[64]) */ #ifdef __APPLE__ .globl _sha1_compress _sha1_compress: #else .globl sha1_compress sha1_compress: #endif /* * Storage usage: * Bytes Location Description * 4 eax SHA-1 state variable A * 4 ebx SHA-1 state variable B * 4 ecx SHA-1 state variable C * 4 edx SHA-1 state variable D * 4 ebp SHA-1 state variable E * 4 esi Temporary for calculation per round * 4 edi (Last 64 rounds) temporary for calculation per round * 8 rdi (First 16 rounds) base address of block array argument (read-only) * 8 r8 Base address of state array argument (read-only) * 8 rsp x86-64 stack pointer * 64 [rsp+0] Circular buffer of most recent 16 key schedule items, 4 bytes each * 16 xmm0 Caller's value of rbx (only low 64 bits are used) * 16 xmm1 Caller's value of rbp (only low 64 bits are used) */ #define ROUND0a(a, b, c, d, e, i) \ movl (i*4)(%rdi), %esi; \ bswapl %esi; \ movl %esi, (i*4)(%rsp); \ addl %esi, %e; \ movl %c, %esi; \ xorl %d, %esi; \ andl %b, %esi; \ xorl %d, %esi; \ ROUNDTAIL(a, b, e, i, 0x5A827999) #define SCHEDULE(i, e) \ movl (((i- 3)&0xF)*4)(%rsp), %esi; \ xorl (((i- 8)&0xF)*4)(%rsp), %esi; \ xorl (((i-14)&0xF)*4)(%rsp), %esi; \ xorl (((i-16)&0xF)*4)(%rsp), %esi; \ roll $1, %esi; \ addl %esi, %e; \ movl %esi, ((i&0xF)*4)(%rsp); #define ROUND0b(a, b, c, d, e, i) \ SCHEDULE(i, e) \ movl %c, %esi; \ xorl %d, %esi; \ andl %b, %esi; \ xorl %d, %esi; \ ROUNDTAIL(a, b, e, i, 0x5A827999) #define ROUND1(a, b, c, d, e, i) \ SCHEDULE(i, e) \ movl %b, %esi; \ xorl %c, %esi; \ xorl %d, %esi; \ ROUNDTAIL(a, b, e, i, 0x6ED9EBA1) #define ROUND2(a, b, c, d, e, i) \ SCHEDULE(i, e) \ movl %c, %esi; \ movl %c, %edi; \ orl %d, %esi; \ andl %b, %esi; \ andl %d, %edi; \ orl %edi, %esi; \ ROUNDTAIL(a, b, e, i, -0x70E44324) #define ROUND3(a, b, c, d, e, i) \ SCHEDULE(i, e) \ movl %b, %esi; \ xorl %c, %esi; \ xorl %d, %esi; \ ROUNDTAIL(a, b, e, i, -0x359D3E2A) #define ROUNDTAIL(a, b, e, i, k) \ roll $30, %b; \ leal k(%e,%esi), %e; \ movl %a, %esi; \ roll $5, %esi; \ addl %esi, %e; /* Save registers, allocate scratch space */ movq %rbx, %xmm0 movq %rbp, %xmm1 subq $64, %rsp /* Load arguments */ movq %rdi, %r8 movl 0(%rdi), %eax /* a */ movl 4(%rdi), %ebx /* b */ movl 8(%rdi), %ecx /* c */ movl 12(%rdi), %edx /* d */ movl 16(%rdi), %ebp /* e */ movq %rsi, %rdi /* 80 rounds of hashing */ ROUND0a(eax, ebx, ecx, edx, ebp, 0) ROUND0a(ebp, eax, ebx, ecx, edx, 1) ROUND0a(edx, ebp, eax, ebx, ecx, 2) ROUND0a(ecx, edx, ebp, eax, ebx, 3) ROUND0a(ebx, ecx, edx, ebp, eax, 4) ROUND0a(eax, ebx, ecx, edx, ebp, 5) ROUND0a(ebp, eax, ebx, ecx, edx, 6) ROUND0a(edx, ebp, eax, ebx, ecx, 7) ROUND0a(ecx, edx, ebp, eax, ebx, 8) ROUND0a(ebx, ecx, edx, ebp, eax, 9) ROUND0a(eax, ebx, ecx, edx, ebp, 10) ROUND0a(ebp, eax, ebx, ecx, edx, 11) ROUND0a(edx, ebp, eax, ebx, ecx, 12) ROUND0a(ecx, edx, ebp, eax, ebx, 13) ROUND0a(ebx, ecx, edx, ebp, eax, 14) ROUND0a(eax, ebx, ecx, edx, ebp, 15) ROUND0b(ebp, eax, ebx, ecx, edx, 16) ROUND0b(edx, ebp, eax, ebx, ecx, 17) ROUND0b(ecx, edx, ebp, eax, ebx, 18) ROUND0b(ebx, ecx, edx, ebp, eax, 19) ROUND1(eax, ebx, ecx, edx, ebp, 20) ROUND1(ebp, eax, ebx, ecx, edx, 21) ROUND1(edx, ebp, eax, ebx, ecx, 22) ROUND1(ecx, edx, ebp, eax, ebx, 23) ROUND1(ebx, ecx, edx, ebp, eax, 24) ROUND1(eax, ebx, ecx, edx, ebp, 25) ROUND1(ebp, eax, ebx, ecx, edx, 26) ROUND1(edx, ebp, eax, ebx, ecx, 27) ROUND1(ecx, edx, ebp, eax, ebx, 28) ROUND1(ebx, ecx, edx, ebp, eax, 29) ROUND1(eax, ebx, ecx, edx, ebp, 30) ROUND1(ebp, eax, ebx, ecx, edx, 31) ROUND1(edx, ebp, eax, ebx, ecx, 32) ROUND1(ecx, edx, ebp, eax, ebx, 33) ROUND1(ebx, ecx, edx, ebp, eax, 34) ROUND1(eax, ebx, ecx, edx, ebp, 35) ROUND1(ebp, eax, ebx, ecx, edx, 36) ROUND1(edx, ebp, eax, ebx, ecx, 37) ROUND1(ecx, edx, ebp, eax, ebx, 38) ROUND1(ebx, ecx, edx, ebp, eax, 39) ROUND2(eax, ebx, ecx, edx, ebp, 40) ROUND2(ebp, eax, ebx, ecx, edx, 41) ROUND2(edx, ebp, eax, ebx, ecx, 42) ROUND2(ecx, edx, ebp, eax, ebx, 43) ROUND2(ebx, ecx, edx, ebp, eax, 44) ROUND2(eax, ebx, ecx, edx, ebp, 45) ROUND2(ebp, eax, ebx, ecx, edx, 46) ROUND2(edx, ebp, eax, ebx, ecx, 47) ROUND2(ecx, edx, ebp, eax, ebx, 48) ROUND2(ebx, ecx, edx, ebp, eax, 49) ROUND2(eax, ebx, ecx, edx, ebp, 50) ROUND2(ebp, eax, ebx, ecx, edx, 51) ROUND2(edx, ebp, eax, ebx, ecx, 52) ROUND2(ecx, edx, ebp, eax, ebx, 53) ROUND2(ebx, ecx, edx, ebp, eax, 54) ROUND2(eax, ebx, ecx, edx, ebp, 55) ROUND2(ebp, eax, ebx, ecx, edx, 56) ROUND2(edx, ebp, eax, ebx, ecx, 57) ROUND2(ecx, edx, ebp, eax, ebx, 58) ROUND2(ebx, ecx, edx, ebp, eax, 59) ROUND3(eax, ebx, ecx, edx, ebp, 60) ROUND3(ebp, eax, ebx, ecx, edx, 61) ROUND3(edx, ebp, eax, ebx, ecx, 62) ROUND3(ecx, edx, ebp, eax, ebx, 63) ROUND3(ebx, ecx, edx, ebp, eax, 64) ROUND3(eax, ebx, ecx, edx, ebp, 65) ROUND3(ebp, eax, ebx, ecx, edx, 66) ROUND3(edx, ebp, eax, ebx, ecx, 67) ROUND3(ecx, edx, ebp, eax, ebx, 68) ROUND3(ebx, ecx, edx, ebp, eax, 69) ROUND3(eax, ebx, ecx, edx, ebp, 70) ROUND3(ebp, eax, ebx, ecx, edx, 71) ROUND3(edx, ebp, eax, ebx, ecx, 72) ROUND3(ecx, edx, ebp, eax, ebx, 73) ROUND3(ebx, ecx, edx, ebp, eax, 74) ROUND3(eax, ebx, ecx, edx, ebp, 75) ROUND3(ebp, eax, ebx, ecx, edx, 76) ROUND3(edx, ebp, eax, ebx, ecx, 77) ROUND3(ecx, edx, ebp, eax, ebx, 78) ROUND3(ebx, ecx, edx, ebp, eax, 79) /* Save updated state */ addl %eax, 0(%r8) addl %ebx, 4(%r8) addl %ecx, 8(%r8) addl %edx, 12(%r8) addl %ebp, 16(%r8) /* Restore registers */ movq %xmm0, %rbx movq %xmm1, %rbp addq $64, %rsp retq sha1-asm-0.4.3/src/x86.S010064400017500001750000000200321327661315200127140ustar0000000000000000/* * SHA-1 hash in x86 assembly * * Copyright (c) 2014 Project Nayuki. (MIT License) * https://www.nayuki.io/page/fast-sha1-hash-implementation-in-x86-assembly * * 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. */ /* void sha1_compress(uint32_t state[5], const uint8_t block[64]) */ #ifdef __APPLE__ .globl _sha1_compress _sha1_compress: #else .globl sha1_compress sha1_compress: #endif /* * Storage usage: * Bytes Location Description * 4 eax SHA-1 state variable A * 4 ebx SHA-1 state variable B * 4 ecx SHA-1 state variable C * 4 edx SHA-1 state variable D * 4 ebp SHA-1 state variable E * 4 esi Temporary for calculation per round * 4 edi (First 16 rounds) base address of block array argument (read-only); (last 64 rounds) temporary for calculation per round * 4 esp x86 stack pointer * 64 [esp+ 0] Circular buffer of most recent 16 key schedule items, 4 bytes each * 4 [esp+64] Caller's value of ebx * 4 [esp+68] Caller's value of esi * 4 [esp+72] Caller's value of edi * 4 [esp+76] Caller's value of ebp */ #define ROUND0a(a, b, c, d, e, i) \ movl (i*4)(%edi), %esi; \ bswapl %esi; \ movl %esi, (i*4)(%esp); \ addl %esi, %e; \ movl %c, %esi; \ xorl %d, %esi; \ andl %b, %esi; \ xorl %d, %esi; \ ROUNDTAIL(a, b, e, i, 0x5A827999) #define SCHEDULE(i, e) \ movl (((i- 3)&0xF)*4)(%esp), %esi; \ xorl (((i- 8)&0xF)*4)(%esp), %esi; \ xorl (((i-14)&0xF)*4)(%esp), %esi; \ xorl (((i-16)&0xF)*4)(%esp), %esi; \ roll $1, %esi; \ addl %esi, %e; \ movl %esi, ((i&0xF)*4)(%esp); #define ROUND0b(a, b, c, d, e, i) \ SCHEDULE(i, e) \ movl %c, %esi; \ xorl %d, %esi; \ andl %b, %esi; \ xorl %d, %esi; \ ROUNDTAIL(a, b, e, i, 0x5A827999) #define ROUND1(a, b, c, d, e, i) \ SCHEDULE(i, e) \ movl %b, %esi; \ xorl %c, %esi; \ xorl %d, %esi; \ ROUNDTAIL(a, b, e, i, 0x6ED9EBA1) #define ROUND2(a, b, c, d, e, i) \ SCHEDULE(i, e) \ movl %c, %esi; \ movl %c, %edi; \ orl %d, %esi; \ andl %b, %esi; \ andl %d, %edi; \ orl %edi, %esi; \ ROUNDTAIL(a, b, e, i, 0x8F1BBCDC) #define ROUND3(a, b, c, d, e, i) \ SCHEDULE(i, e) \ movl %b, %esi; \ xorl %c, %esi; \ xorl %d, %esi; \ ROUNDTAIL(a, b, e, i, 0xCA62C1D6) #define ROUNDTAIL(a, b, e, i, k) \ roll $30, %b; \ leal k(%e,%esi), %e; \ movl %a, %esi; \ roll $5, %esi; \ addl %esi, %e; /* Save registers */ subl $80, %esp movl %ebx, 64(%esp) movl %esi, 68(%esp) movl %edi, 72(%esp) movl %ebp, 76(%esp) /* Load arguments */ movl 84(%esp), %esi /* state */ movl 88(%esp), %edi /* block */ movl 0(%esi), %eax /* a */ movl 4(%esi), %ebx /* b */ movl 8(%esi), %ecx /* c */ movl 12(%esi), %edx /* d */ movl 16(%esi), %ebp /* e */ /* 80 rounds of hashing */ ROUND0a(eax, ebx, ecx, edx, ebp, 0) ROUND0a(ebp, eax, ebx, ecx, edx, 1) ROUND0a(edx, ebp, eax, ebx, ecx, 2) ROUND0a(ecx, edx, ebp, eax, ebx, 3) ROUND0a(ebx, ecx, edx, ebp, eax, 4) ROUND0a(eax, ebx, ecx, edx, ebp, 5) ROUND0a(ebp, eax, ebx, ecx, edx, 6) ROUND0a(edx, ebp, eax, ebx, ecx, 7) ROUND0a(ecx, edx, ebp, eax, ebx, 8) ROUND0a(ebx, ecx, edx, ebp, eax, 9) ROUND0a(eax, ebx, ecx, edx, ebp, 10) ROUND0a(ebp, eax, ebx, ecx, edx, 11) ROUND0a(edx, ebp, eax, ebx, ecx, 12) ROUND0a(ecx, edx, ebp, eax, ebx, 13) ROUND0a(ebx, ecx, edx, ebp, eax, 14) ROUND0a(eax, ebx, ecx, edx, ebp, 15) ROUND0b(ebp, eax, ebx, ecx, edx, 16) ROUND0b(edx, ebp, eax, ebx, ecx, 17) ROUND0b(ecx, edx, ebp, eax, ebx, 18) ROUND0b(ebx, ecx, edx, ebp, eax, 19) ROUND1(eax, ebx, ecx, edx, ebp, 20) ROUND1(ebp, eax, ebx, ecx, edx, 21) ROUND1(edx, ebp, eax, ebx, ecx, 22) ROUND1(ecx, edx, ebp, eax, ebx, 23) ROUND1(ebx, ecx, edx, ebp, eax, 24) ROUND1(eax, ebx, ecx, edx, ebp, 25) ROUND1(ebp, eax, ebx, ecx, edx, 26) ROUND1(edx, ebp, eax, ebx, ecx, 27) ROUND1(ecx, edx, ebp, eax, ebx, 28) ROUND1(ebx, ecx, edx, ebp, eax, 29) ROUND1(eax, ebx, ecx, edx, ebp, 30) ROUND1(ebp, eax, ebx, ecx, edx, 31) ROUND1(edx, ebp, eax, ebx, ecx, 32) ROUND1(ecx, edx, ebp, eax, ebx, 33) ROUND1(ebx, ecx, edx, ebp, eax, 34) ROUND1(eax, ebx, ecx, edx, ebp, 35) ROUND1(ebp, eax, ebx, ecx, edx, 36) ROUND1(edx, ebp, eax, ebx, ecx, 37) ROUND1(ecx, edx, ebp, eax, ebx, 38) ROUND1(ebx, ecx, edx, ebp, eax, 39) ROUND2(eax, ebx, ecx, edx, ebp, 40) ROUND2(ebp, eax, ebx, ecx, edx, 41) ROUND2(edx, ebp, eax, ebx, ecx, 42) ROUND2(ecx, edx, ebp, eax, ebx, 43) ROUND2(ebx, ecx, edx, ebp, eax, 44) ROUND2(eax, ebx, ecx, edx, ebp, 45) ROUND2(ebp, eax, ebx, ecx, edx, 46) ROUND2(edx, ebp, eax, ebx, ecx, 47) ROUND2(ecx, edx, ebp, eax, ebx, 48) ROUND2(ebx, ecx, edx, ebp, eax, 49) ROUND2(eax, ebx, ecx, edx, ebp, 50) ROUND2(ebp, eax, ebx, ecx, edx, 51) ROUND2(edx, ebp, eax, ebx, ecx, 52) ROUND2(ecx, edx, ebp, eax, ebx, 53) ROUND2(ebx, ecx, edx, ebp, eax, 54) ROUND2(eax, ebx, ecx, edx, ebp, 55) ROUND2(ebp, eax, ebx, ecx, edx, 56) ROUND2(edx, ebp, eax, ebx, ecx, 57) ROUND2(ecx, edx, ebp, eax, ebx, 58) ROUND2(ebx, ecx, edx, ebp, eax, 59) ROUND3(eax, ebx, ecx, edx, ebp, 60) ROUND3(ebp, eax, ebx, ecx, edx, 61) ROUND3(edx, ebp, eax, ebx, ecx, 62) ROUND3(ecx, edx, ebp, eax, ebx, 63) ROUND3(ebx, ecx, edx, ebp, eax, 64) ROUND3(eax, ebx, ecx, edx, ebp, 65) ROUND3(ebp, eax, ebx, ecx, edx, 66) ROUND3(edx, ebp, eax, ebx, ecx, 67) ROUND3(ecx, edx, ebp, eax, ebx, 68) ROUND3(ebx, ecx, edx, ebp, eax, 69) ROUND3(eax, ebx, ecx, edx, ebp, 70) ROUND3(ebp, eax, ebx, ecx, edx, 71) ROUND3(edx, ebp, eax, ebx, ecx, 72) ROUND3(ecx, edx, ebp, eax, ebx, 73) ROUND3(ebx, ecx, edx, ebp, eax, 74) ROUND3(eax, ebx, ecx, edx, ebp, 75) ROUND3(ebp, eax, ebx, ecx, edx, 76) ROUND3(edx, ebp, eax, ebx, ecx, 77) ROUND3(ecx, edx, ebp, eax, ebx, 78) ROUND3(ebx, ecx, edx, ebp, eax, 79) /* Save updated state */ movl 84(%esp), %esi addl %eax, 0(%esi) addl %ebx, 4(%esi) addl %ecx, 8(%esi) addl %edx, 12(%esi) addl %ebp, 16(%esi) /* Restore registers */ movl 64(%esp), %ebx movl 68(%esp), %esi movl 72(%esp), %edi movl 76(%esp), %ebp addl $80, %esp retl sha1-asm-0.4.3/.cargo_vcs_info.json0000644000000001120000000000000125030ustar00{ "git": { "sha1": "8dc350765975cd8285615a59b167a140bd49b4d4" } }