Searched refs:hash (Results 26 - 50 of 175) sorted by relevance

1234567

/drivers/mtd/tests/
H A Dnandbiterrs.c86 static uint8_t hash(unsigned offset) function
175 if (rbuffer[i] != hash(i+seed)) {
177 i, hash(i+seed), rbuffer[i]);
222 wbuffer[i] = hash(i+seed);
285 wbuffer[i] = hash(i+seed);
/drivers/crypto/amcc/
H A Dcrypto4xx_core.h25 #include <crypto/internal/hash.h>
147 struct ahash_alg hash; member in union:crypto4xx_alg_common::__anon490
163 struct crypto4xx_alg, alg.u.hash);
/drivers/firmware/google/
H A Dgsmi.c674 * This hash function was blatantly copied from include/linux/hash.h.
684 u64 hash = val; local
687 u64 n = hash;
689 hash -= n;
691 hash -= n;
693 hash += n;
695 hash -= n;
697 hash += n;
699 hash
725 u32 hash; local
[all...]
/drivers/crypto/qat/qat_common/
H A Dqat_algs.c53 #include <crypto/hash.h>
96 struct icp_qat_hw_auth_algo_blk hash; member in struct:qat_alg_cd::__anon551::qat_enc
99 struct icp_qat_hw_auth_algo_blk hash; member in struct:qat_alg_cd::__anon551::qat_dec
146 static int qat_alg_do_precomputes(struct icp_qat_hw_auth_algo_blk *hash, argument
199 hash_state_out = (__be32 *)hash->sha.state1;
232 hash_state_out = (__be32 *)(hash->sha.state1 + offset);
287 struct icp_qat_hw_auth_algo_blk *hash = local
300 hash->sha.inner_setup.auth_config.config =
303 hash->sha.inner_setup.auth_counter.counter =
306 if (qat_alg_do_precomputes(hash, ct
363 struct icp_qat_hw_auth_algo_blk *hash = &dec_ctx->hash; local
834 qat_alg_init(struct crypto_tfm *tfm, enum icp_qat_hw_auth_algo hash, const char *hash_name) argument
[all...]
/drivers/infiniband/core/
H A Diwpm_util.c58 pr_err("%s Unable to create mapinfo hash table\n", __func__);
84 pr_debug("%s: Mapinfo hash table is destroyed\n", __func__);
177 /* free the hash list */
401 u32 hash = jhash_2words(ipv6_hash, (__force u32) ipv6_sockaddr->sin6_port, 0); local
402 return hash;
408 u32 hash = jhash_2words(ipv4_hash, (__force u32) ipv4_sockaddr->sin_port, 0); local
409 return hash;
417 u32 local_hash, mapped_hash, hash; local
432 hash = local_hash;
434 hash
[all...]
/drivers/net/ethernet/ti/
H A Dtlan.h517 * hash = XOR8(DA(a,0), DA(a, 6), DA(a,12), DA(a,18), DA(a,24),
519 * hash |= XOR8(DA(a,1), DA(a, 7), DA(a,13), DA(a,19), DA(a,25),
521 * hash |= XOR8(DA(a,2), DA(a, 8), DA(a,14), DA(a,20), DA(a,26),
523 * hash |= XOR8(DA(a,3), DA(a, 9), DA(a,15), DA(a,21), DA(a,27),
525 * hash |= XOR8(DA(a,4), DA(a,10), DA(a,16), DA(a,22), DA(a,28),
527 * hash |= XOR8(DA(a,5), DA(a,11), DA(a,17), DA(a,23), DA(a,29),
533 u8 hash; local
535 hash = (a[0]^a[3]); /* & 077 */
536 hash ^= ((a[0]^a[3])>>6); /* & 003 */
537 hash
[all...]
/drivers/net/ppp/
H A Dpppoe.c101 * we could use _single_ hash table for all
102 * nets by injecting net id into the hash but
103 * it would increase hash chains and add
148 unsigned char hash = 0; local
152 hash ^= addr[i];
154 hash ^= (__force __u32)sid >> i;
156 hash ^= hash >> i;
158 return hash & PPPOE_HASH_MASK;
169 int hash local
186 int hash = hash_item(po->pppoe_pa.sid, po->pppoe_pa.remote); local
207 int hash = hash_item(sid, addr); local
1058 int hash = hash_item(po->pppoe_pa.sid, po->pppoe_pa.remote); local
[all...]
/drivers/target/tcm_fc/
H A Dtcm_fc.h38 u32 port_id; /* for hash lookup use only */
44 struct hlist_node hash; /* linkage in ft_sess_hash table */ member in struct:ft_sess
46 struct kref kref; /* ref for hash and outstanding I/Os */
66 u32 sess_count; /* number of sessions in hash */
68 struct hlist_head hash[FT_SESS_HASH_SIZE]; /* list of sessions */ member in struct:ft_tport
/drivers/staging/lustre/lustre/llite/
H A Ddir.c75 * hash, and so readdir should be done in hash order.
77 * New readdir implementation does readdir in hash order, and uses hash of a
80 * . hash is not unique, so it cannot be used to index cached directory
81 * pages on the client (note, that it requires a whole pageful of hash
84 * . hash is not unique, so it cannot, strictly speaking, be used as an
86 * mimics their solution: seekdir(hash) positions directory at the first
87 * entry with the given hash.
93 * Client caches directory pages using hash o
151 __u64 hash = *((__u64 *)_hash); local
264 ll_dir_page_locate(struct inode *dir, __u64 *hash, __u64 *start, __u64 *end) argument
335 ll_get_dir_page(struct inode *dir, __u64 hash, struct ll_dir_chain *chain) argument
503 __u64 hash = MDS_DIR_END_OFF; local
[all...]
/drivers/misc/cxl/
H A Dfault.c40 unsigned int hash; local
43 hash = (slb->esid >> SID_SHIFT_1T) & mask;
45 hash = (slb->esid >> SID_SHIFT) & mask;
47 primary = ctx->sstp + (hash << 3);
144 * update_mmu_cache() will not have loaded the hash since current->trap
/drivers/net/ethernet/sun/
H A Dsunvnet.h41 struct hlist_node hash; member in struct:vnet_port
/drivers/scsi/
H A Dlibiscsi_tcp.c173 segment->hash = NULL;
202 if (segment->hash && copied) {
217 crypto_hash_update(segment->hash, &sg, copied);
262 if (segment->hash) {
263 crypto_hash_final(segment->hash, segment->digest);
284 * If hash digest is enabled, the function will update the
285 * hash while copying.
313 iscsi_tcp_dgst_header(struct hash_desc *hash, const void *hdr, size_t hdrlen, argument
319 crypto_hash_digest(hash, &sg, hdrlen, digest);
344 iscsi_segment_done_fn_t *done, struct hash_desc *hash)
343 __iscsi_segment_init(struct iscsi_segment *segment, size_t size, iscsi_segment_done_fn_t *done, struct hash_desc *hash) argument
357 iscsi_segment_init_linear(struct iscsi_segment *segment, void *data, size_t size, iscsi_segment_done_fn_t *done, struct hash_desc *hash) argument
368 iscsi_segment_seek_sg(struct iscsi_segment *segment, struct scatterlist *sg_list, unsigned int sg_count, unsigned int offset, size_t size, iscsi_segment_done_fn_t *done, struct hash_desc *hash) argument
[all...]
/drivers/staging/lustre/lustre/include/
H A Dlustre_fld.h110 * Current hash to be used to chose an export. */
134 const char *prefix, int hash);
/drivers/net/ethernet/amd/
H A Dam79c961a.c199 static void am79c961_mc_hash(char *addr, u16 *hash) argument
209 hash[idx] |= 1 << bit;
212 static unsigned int am79c961_get_rx_mode(struct net_device *dev, u16 *hash) argument
218 memset(hash, 0xff, 4 * sizeof(*hash));
220 memset(hash, 0xff, 4 * sizeof(*hash));
224 memset(hash, 0, 4 * sizeof(*hash));
227 am79c961_mc_hash(ha->addr, hash);
[all...]
/drivers/char/
H A Drandom.c79 * hash of the contents of the "entropy pool". The SHA hash avoids
335 * The mixing operation is much less sensitive than the output hash,
337 * it be a good non-cryptographic hash; i.e. it not produce collisions
1076 } hash; local
1084 sha_init(hash.w);
1089 hash.l[i] = v;
1092 /* Generate a hash across the pool, 16 words (512 bits) at a time */
1095 sha_transform(hash.w, (__u8 *)(r->pool + i), workspace);
1098 * We mix the hash bac
1726 __u32 *hash; local
[all...]
/drivers/net/ethernet/chelsio/cxgb4/
H A Dl2t.c86 * neighbors to be on the same hash chain. We keep v4 entries in the first
87 * half of available hash buckets and v6 in the second.
116 * family, something made trivial by the separation of IP and IPv6 hash chains
290 * presently in the hash table. We need to remove it.
293 for (p = &d->l2tab[e->hash].first; *p; p = &(*p)->next)
370 int hash = addr_hash(addr, addr_len, ifidx); local
383 for (e = d->l2tab[hash].first; e; e = e->next)
401 e->hash = hash;
407 e->next = d->l2tab[hash]
483 int hash = addr_hash(addr, addr_len, ifidx); local
[all...]
H A Dl2t.h52 * packets awaiting address resolution. Second, it is a node of a hash table
54 * pointer. Finally, each node is a bucket of a hash table, pointing to the
63 struct l2t_entry *first; /* start of hash chain */
69 u16 hash; /* hash bucket the entry is on */ member in struct:l2t_entry
/drivers/crypto/
H A Dtalitos.c52 #include <crypto/hash.h>
53 #include <crypto/internal/hash.h>
1569 /* hash context in */
1621 /* hash/HMAC out -or- hash context out */
1719 /* At least (blocksize + 1) bytes are available to hash */
1767 /* request SEC to INIT hash. */
1836 u8 *hash)
1851 /* Keep tfm keylen == 0 during hash of the long key */
1858 ahash_request_set_crypt(req, sg, hash, keyle
1835 keyhash(struct crypto_ahash *tfm, const u8 *key, unsigned int keylen, u8 *hash) argument
1886 u8 hash[SHA512_DIGEST_SIZE]; local
1914 struct ahash_alg hash; member in union:talitos_alg_template::__anon553
[all...]
/drivers/gpu/drm/
H A Ddrm_vm.c104 struct drm_hash_item *hash; local
115 if (drm_ht_find_item(&dev->map_hash, vma->vm_pgoff, &hash))
118 r_list = drm_hash_entry(hash, struct drm_map_list, hash);
545 struct drm_hash_item *hash; local
565 if (drm_ht_find_item(&dev->map_hash, vma->vm_pgoff, &hash)) {
570 map = drm_hash_entry(hash, struct drm_map_list, hash)->map;
/drivers/md/bcache/
H A Dbtree.h118 struct hlist_node hash; member in struct:btree
204 hlist_for_each_entry_rcu((b), (c)->bucket_hash + iter, hash)
/drivers/media/usb/em28xx/
H A Dem28xx-i2c.c586 * based on linux/sunrpc/svcauth.h and linux/hash.h
587 * The original hash function returns a different value, if arch is x86_64
592 unsigned long hash = 0; local
605 hash = ((hash^l) * 0x9e370001UL);
608 return (hash >> (32 - bits)) & 0xffffffffUL;
657 * FIXME common length/size for bytes to read, to display, hash
707 dev->hash = em28xx_hash_mem(data, len, 32);
710 em28xx_info("EEPROM ID = %02x %02x %02x %02x, EEPROM hash = 0x%08lx\n",
711 data[0], data[1], data[2], data[3], dev->hash);
[all...]
/drivers/staging/lustre/lnet/selftest/
H A Dconsole.h65 struct list_head ndl_hlink; /* chain on hash */
78 struct list_head grp_ndl_hash[0];/* hash table for nodes */
100 struct list_head *bat_cli_hash; /* hash table of client nodes */
102 struct list_head *bat_srv_hash; /* hash table of server nodes */
127 #define LST_GLOBAL_HASHSIZE 503 /* global nodes hash table size */
128 #define LST_NODE_HASHSIZE 239 /* node hash table (for batch or group) */
162 struct list_head *ses_ndl_hash; /* hash table of nodes */
178 lstcon_id2hash (lnet_process_id_t id, struct list_head *hash) argument
182 return &hash[idx];
/drivers/crypto/nx/
H A Dnx_debugfs.c29 #include <crypto/hash.h>
/drivers/media/usb/dvb-usb-v2/
H A Daf9015.h27 #include <linux/hash.h>
/drivers/net/wireless/brcm80211/brcmfmac/
H A Dflowring.h50 struct brcmf_flowring_hash hash[BRCMF_FLOWRING_HASHSIZE]; member in struct:brcmf_flowring

Completed in 3852 milliseconds

1234567