Home
last modified time | relevance | path

Searched full:hashing (Results 1 – 25 of 400) sorted by relevance

12345678910>>...16

/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DStableHashing.h
H A DMachineStableHash.h1 //===------------ MachineStableHash.h - MIR Stable Hashing Utilities ------===//
9 // Stable hashing for MachineInstr and MachineOperand. Useful or getting a
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DHashing.h1 //===-- llvm/ADT/Hashing.h - Utilities for hashing --------------*- C++ -*-===//
9 // This file implements the newly proposed standard C++ interfaces for hashing
17 // data. It is the intended product of hashing, and can be used to implement
24 // construction of hashing datastructures.
27 // user-defined type which wishes to be used within a hashing context. It
36 // Note that 'hash_combine_range' contains very special logic for hashing
65 /// This object represents the result of hashing some entity. It is intended to
66 /// be used to implement hashtables or other hashing-based data structures.
133 namespace hashing {
171 // Murmur-inspired hashing. in hash_16_bytes()
[all …]
/freebsd/share/man/man9/
H A Dhash.943 .Nd general kernel hashing functions
68 a decent hashing algorithm within the kernel.
83 function is used as a general buffer hashing function.
127 terminated hashing.
133 but provides more advanced hashing algorithm with better distribution.
137 uses same hashing algorithm as the
/freebsd/contrib/mandoc/
H A Dcompat_ohash.h21 /* Open hashing support.
22 * Open hashing was chosen because it is much lighter than other hash
47 * logic to the client application. e.g., hashing is left to the client
49 * a hashing table index (opaque) to be used in find/insert/remove.
/freebsd/lib/libopenbsd/
H A Dohash.h23 /* Open hashing support.
24 * Open hashing was chosen because it is much lighter than other hash
49 * logic to the client application. e.g., hashing is left to the client
51 * a hashing table index (opaque) to be used in find/insert/remove.
H A Dohash_interval.324 .Nd helper functions for open hashing
38 These functions are commonly used to simplify open hashing usage, and use
60 is a simple hashing function that yields good results on common data sets.
H A Dohash_init.330 .Nd light-weight open hashing
125 The hashing function result is provided by the user as
241 The open hashing functions are not thread-safe by design.
/freebsd/libexec/flua/libhash/
H A Dhash.3lua16 The built-in cryptographic hashing Lua bindings for the are available via the
19 .Ss Supported Hashing Schemes
20 The following hashing schemes are supported by the hash module.
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DHashBuilder.h1 //===- llvm/Support/HashBuilder.h - Convenient hashing interface-*- C++ -*-===//
19 #include "llvm/ADT/Hashing.h"
103 /// The `add` function implements hashing of various types. in HashBuilderImpl()
105 /// The `addRange` function is designed to aid hashing a range of values.
108 /// The `addRangeElements` function is also designed to aid hashing a range of
146 /// Implement hashing for hashable data types, e.g. integral or enum values.
153 /// Support hashing `ArrayRef`.
183 /// Support hashing `StringRef`.
210 /// Implement hashing for user-defined `struct`s.
212 /// Any user-define `struct` can participate in hashing vi
[all...]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/
H A DDIEHash.h1 //===-- llvm/CodeGen/DIEHash.h - Dwarf Hashing Framework -------*- C++ -*--===//
9 // This file contains support for DWARF4 hashing of DIEs.
24 /// An object containing the capability of hashing and adding hash
27 // Collection of all attributes used in hashing a particular DIE.
/freebsd/contrib/libucl/src/
H A Dmum.h24 /* This file implements MUM (MUltiply and Mix) hashing. We randomize
33 The MUM hashing passes all SMHasher tests. Pseudo Random Number
37 1M bits. MUM hashing is also faster Spooky64 and City64 on small
149 Power7 using an addition improves hashing performance by 10% for in _mum()
198 unroll factor greatly affects the hashing speed. We prefer the
374 /* Start hashing data with SEED. Return the state. */
387 /* Return the result of hashing using the current state H. */
393 /* Fast hashing of KEY with SEED. The hash is always the same for the
/freebsd/sys/contrib/openzfs/include/sys/
H A Dskein.h2 * Interface declarations for Skein hashing.
90 /* Skein APIs for (incremental) "straight hashing" */
107 * Skein APIs for "extended" initialization: MAC keys, tree hashing.
146 * When you initialize a Skein KCF hashing method you can pass this param
/freebsd/usr.bin/top/
H A Dusername.c15 * They use a hashing table scheme to reduce reading overhead.
16 * For the time being, these are very straightforward hashing routines.
48 /* simple minded hashing function */
/freebsd/sys/contrib/device-tree/Bindings/crypto/
H A Dimg-hash.txt3 The hash accelerator provides hardware hashing acceleration for
10 - interrupts : The designated IRQ line for the hashing module.
/freebsd/sys/sys/
H A Dhash.h87 * namei() hashing of path name parts.
106 * as a helper for the namei() hashing of path name parts.
125 * Hashing function from Bob Jenkins. Implementation in libkern/jenkins_hash.c.
/freebsd/sys/dev/qat/qat_api/firmware/include/
H A Dicp_qat_hw.h74 ICP_QAT_HW_AUTH_ALGO_NULL = 0, /*!< Null hashing */
75 ICP_QAT_HW_AUTH_ALGO_SHA1 = 1, /*!< SHA1 hashing */
76 ICP_QAT_HW_AUTH_ALGO_MD5 = 2, /*!< MD5 hashing */
77 ICP_QAT_HW_AUTH_ALGO_SHA224 = 3, /*!< SHA-224 hashing */
78 ICP_QAT_HW_AUTH_ALGO_SHA256 = 4, /*!< SHA-256 hashing */
79 ICP_QAT_HW_AUTH_ALGO_SHA384 = 5, /*!< SHA-384 hashing */
80 ICP_QAT_HW_AUTH_ALGO_SHA512 = 6, /*!< SHA-512 hashing */
81 ICP_QAT_HW_AUTH_ALGO_AES_XCBC_MAC = 7, /*!< AES-XCBC-MAC hashing */
82 ICP_QAT_HW_AUTH_ALGO_AES_CBC_MAC = 8, /*!< AES-CBC-MAC hashing */
83 ICP_QAT_HW_AUTH_ALGO_AES_F9 = 9, /*!< AES F9 hashing */
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/IR/
H A DStructuralHash.h1 //===- llvm/IR/StructuralHash.h - IR Hashing --------------------*- C++ -*-===//
9 // This file provides hashing of the LLVM IR structure to be used to check
33 /// Returns a hash of the module \p M by hashing all functions and global
/freebsd/sys/contrib/libsodium/src/libsodium/crypto_pwhash/argon2/
H A Dargon2-core.h40 /* Pre-hashing digest length and its extension*/
224 * @param blockhash Buffer for pre-hashing digest
235 * @param blockhash Pointer to the pre-hashing digest
258 * XORing the last block of each lane, hashing it, making the tag. Deallocates
/freebsd/sys/crypto/skein/
H A Dskein.h5 ** Interface declarations and internal definitions for Skein hashing.
94 /* Skein APIs for (incremental) "straight hashing" */
108 ** Skein APIs for "extended" initialization: MAC keys, tree hashing.
145 ** -- not needed for sequential hashing API, but will be
173 …ne SKEIN_BLK_TYPE_PK (12) /* public key (for digital signature hashing) */
184 …ne SKEIN_T1_BLK_TYPE_PK SKEIN_T1_BLK_TYPE(PK) /* public key (for digital signature hashing) */
/freebsd/sys/contrib/openzfs/tests/zfs-tests/cmd/checksum/
H A Dblake3_test.c60 * key for the keyed hashing
517 /* default hashing */ in main()
528 /* salted hashing */ in main()
573 printf("Running performance tests (hashing 1024 MiB of data):\n"); in main()
/freebsd/contrib/unbound/util/storage/
H A Dlookup3.h2 * util/storage/lookup3.h - header file for hashing functions.
66 * and before hashing stuff (because it changes subsequent results).
/freebsd/sys/contrib/openzfs/module/icp/algs/skein/
H A Dskein_impl.h2 * Internal definitions for Skein hashing.
34 * -- not needed for sequential hashing API, but will be
68 #define SKEIN_BLK_TYPE_PK (12) /* public key (for signature hashing) */
83 /* public key (for digital signature hashing) */
/freebsd/crypto/openssl/crypto/lhash/
H A Dlhash.c21 * A hashing implementation that appears to be based on the linear hashing
25 * Litwin, Witold (1980), "Linear hashing: A new tool for file and table
29 * From the Wikipedia article "Linear hashing is used in the BDB Berkeley
/freebsd/contrib/jemalloc/src/
H A Dckh.c3 * Implementation of (2^1+,2) cuckoo hashing, where 2^1+ indicates that each
5 * functions are employed. The original cuckoo hashing algorithm was described
8 * Pagh, R., F.F. Rodler (2004) Cuckoo Hashing. Journal of Algorithms
11 * Generalization of cuckoo hashing was discussed in:
33 * line. So, on 32- and 64-bit systems, we use (8,2) and (4,2) cuckoo hashing,
382 * entries. We are using (2+,2) cuckoo hashing, which has an expected in ckh_new()

12345678910>>...16