Searched refs:hash (Results 1 – 8 of 8) sorted by relevance
| /coreutils/man/ |
| D | help2man | 168 my $hash;
182 $hash = \%include;
186 if ($1 eq '>') { $hash = \%append; }
187 elsif ($1 eq '=') { $hash = \%replace; }
192 $hash = \%replace;
196 $hash = \%include;
216 $hash = \%append_match;
235 $hash->{$key} .= $_;
245 for my $hash (\(%include, %replace, %append, %append_match))
247 for (keys %$hash) { $hash->{$_} =~ s/\n+$/\n/ }
|
| /coreutils/src/blake2/ |
| D | blake2b-ref.c | 335 uint8_t hash[BLAKE2B_OUTBYTES]; in main() local
336 blake2b( hash, BLAKE2B_OUTBYTES, buf, i, key, BLAKE2B_KEYBYTES ); in main()
338 if( 0 != memcmp( hash, blake2b_keyed_kat[i], BLAKE2B_OUTBYTES ) ) in main()
347 uint8_t hash[BLAKE2B_OUTBYTES]; in main() local
367 if ( (err = blake2b_final(&S, hash, BLAKE2B_OUTBYTES)) < 0) { in main()
371 if (0 != memcmp(hash, blake2b_keyed_kat[i], BLAKE2B_OUTBYTES)) { in main()
|
| D | b2sum.c | 263 unsigned char hash[BLAKE2B_OUTBYTES] = {0};
365 if( blake2_stream( f, hash, outbytes ) < 0 )
381 printf( "%02x", hash[j] );
|
| /coreutils/gl/modules/ |
| D | randperm | 14 hash
|
| /coreutils/ |
| D | cfg.mk | 571 halt="in Perl code, write \$$hash{KEY}, not \$$hash{'K''EY'}" \
|
| D | TODO | 49 in the hash table.
|
| D | NEWS | 1877 md5sum can use libcrypto hash routines where allowed to potentially
|
| /coreutils/doc/ |
| D | coreutils.texi | 1213 -R} must choose a hash function at random, and it needs random data to
4127 @cindex BLAKE2 hash length
4305 @macro weakHash{hash}
4306 Note: The \hash\ digest is more reliable than a simple CRC (provided by
4308 as the chances of accidentally having two files with identical \hash\
4310 against malicious tampering: although finding a file with a given \hash\
4313 appear valid when signed with an \hash\ digest. For more secure hashes,
4725 Sort by hashing the input keys and then sorting the hash values.
4726 Choose the hash function at random, ensuring that it is free of
4727 collisions so that differing keys have differing hash values. This is
[all …]
|