/linux-master/drivers/net/thunderbolt/ |
H A D | main.c | 1274 u32 hash; local 1280 hash = jhash2((u32 *)xd->local_uuid, 4, 0); 1281 memcpy(addr + 1, &hash, sizeof(hash)); 1282 hash = jhash2((u32 *)xd->local_uuid, 4, hash); 1283 addr[5] = hash & 0xff;
|
/linux-master/crypto/ |
H A D | gcm.c | 11 #include <crypto/internal/hash.h> 15 #include <crypto/hash.h> 99 be128 hash; member in struct:__anon132 122 sg_init_one(data->sg, &data->hash, sizeof(data->hash)); 129 sizeof(data->hash), data->iv); 140 err = crypto_ahash_setkey(ghash, (u8 *)&data->hash, sizeof(be128));
|
/linux-master/arch/powerpc/kvm/ |
H A D | book3s_hv_rm_mmu.c | 19 #include <asm/book3s/64/mmu-hash.h> 427 /* Radix flush for a hash guest */ 1103 unsigned long vsid, hash; local 1109 /* Get page shift, work out hash and AVPN etc. */ 1126 hash = (vsid ^ ((eaddr & somask) >> pshift)) & kvmppc_hpt_mask(&kvm->arch.hpt); 1137 hpte = (__be64 *)(kvm->arch.hpt.virt + (hash << 7)); 1145 /* Check valid/absent, hash, segment size and AVPN */ 1165 return (hash << 3) + (i >> 1); 1173 hash = hash [all...] |
/linux-master/security/apparmor/ |
H A D | policy_unpack.c | 106 if (aa_g_hash_policy && memcmp(l->hash, r->hash, aa_hash_size()) != 0) 127 kfree_sensitive(d->hash); 1050 info = "failed to init key, value hash table"; 1451 udata->hash = aa_calc_hash(udata->data, udata->size); 1452 if (IS_ERR(udata->hash)) { 1453 error = PTR_ERR(udata->hash); 1454 udata->hash = NULL;
|
/linux-master/net/rds/ |
H A D | send.c | 1047 int hash; local 1050 hash = RDS_MPATH_HASH(rs, RDS_MPATH_WORKERS); 1052 hash = RDS_MPATH_HASH(rs, conn->c_npaths); 1053 if (conn->c_npaths == 0 && hash != 0) { 1069 hash = 0; 1072 hash = 0; 1074 return hash;
|
/linux-master/net/ipv6/ |
H A D | raw.c | 149 __u8 hash; local 154 hash = raw_hashfunc(net, nexthdr); 155 hlist = &raw_v6_hashinfo.ht[hash]; 202 /* Not releasing hash table! */ 341 int hash; local 343 hash = raw_hashfunc(net, nexthdr); 344 hlist = &raw_v6_hashinfo.ht[hash]; 1216 .hash = raw_hash_sk,
|
/linux-master/fs/isofs/ |
H A D | inode.c | 172 * Compute the hash for the isofs name corresponding to the dentry. 180 unsigned long hash; local 189 hash = init_name_hash(dentry); 192 hash = partial_name_hash(c, hash); 194 qstr->hash = end_name_hash(hash); 244 * Compute the hash for the isofs name corresponding to the dentry. 259 qstr->hash = full_name_hash(dentry, name, len);
|
/linux-master/fs/xfs/libxfs/ |
H A D | xfs_dir2_block.c | 370 xfs_dahash_t hash; /* hash value of found entry */ local 457 * Find the slot that's first lower than our hash value, -1 if none. 461 if ((hash = be32_to_cpu(blp[mid].hashval)) == args->hashval) 463 if (hash < args->hashval) 695 xfs_dahash_t hash; /* found hash value */ local 714 * Loop doing a binary search for our hash value. 720 if ((hash = be32_to_cpu(blp[mid].hashval)) == args->hashval) 722 if (hash < arg [all...] |
/linux-master/tools/perf/ |
H A D | builtin-inject.c | 41 #include <linux/hash.h> 882 int hash; local 889 hash = hash_32(guest_tid->tid, PERF_EVLIST__HLIST_BITS); 890 hlist_add_head(&guest_tid->node, &gs->tids[hash]); 958 int hash; local 966 hash = hash_64(guest_id->id, PERF_EVLIST__HLIST_BITS); 967 hlist_add_head(&guest_id->node, &gs->heads[hash]); 1023 int hash; local 1025 hash = hash_64(id, PERF_EVLIST__HLIST_BITS); 1026 head = &gs->heads[hash]; 1130 int hash; local [all...] |
/linux-master/net/ipv4/ |
H A D | devinet.c | 50 #include <linux/hash.h> 133 u32 hash = inet_addr_hash(net, ifa->ifa_local); local 136 hlist_add_head_rcu(&ifa->hash, &inet_addr_lst[hash]); 142 hlist_del_init_rcu(&ifa->hash); 186 u32 hash = inet_addr_hash(net, addr); local 189 hlist_for_each_entry_rcu(ifa, &inet_addr_lst[hash], hash) 720 hlist_for_each_entry_rcu(ifa, &inet_addr_lst[i], hash) { 758 hlist_for_each_entry_safe(ifa, n, &inet_addr_lst[i], hash) { [all...] |
/linux-master/drivers/net/ethernet/marvell/ |
H A D | skge.h | 2536 const u8 *hash) 2538 xm_write16(hw, port, reg, (u16)hash[0] | ((u16)hash[1] << 8)); 2539 xm_write16(hw, port, reg+2, (u16)hash[2] | ((u16)hash[3] << 8)); 2540 xm_write16(hw, port, reg+4, (u16)hash[4] | ((u16)hash[5] << 8)); 2541 xm_write16(hw, port, reg+6, (u16)hash[6] | ((u16)hash[7] << 8)); 2535 xm_outhash(const struct skge_hw *hw, int port, int reg, const u8 *hash) argument
|
/linux-master/drivers/net/ethernet/toshiba/ |
H A D | spider_net.c | 551 * spider_net_get_multicast_hash - generates hash for multicast filter table 555 * returns the hash value. 557 * spider_net_get_multicast_hash calculates a hash value for a given multicast 564 u8 hash; local 575 hash = (crc >> 27); 576 hash <<= 3; 577 hash |= crc & 7; 578 hash &= 0xff; 580 return hash; 595 u8 hash; local [all...] |
/linux-master/drivers/crypto/intel/ixp4xx/ |
H A D | ixp4xx_crypto.c | 39 /* hash: cfgword + 2 * digestlen; crypt: keylen + cfgword */ 195 const struct ix_hash_algo *hash; member in struct:ixp_alg 204 const struct ix_hash_algo *hash; member in struct:ixp_aead_alg 259 return container_of(tfm->__crt_alg, struct ixp_alg, crypto.base)->hash; 1415 .hash = &hash_alg_md5, 1428 .hash = &hash_alg_md5, 1440 .hash = &hash_alg_sha1, 1453 .hash = &hash_alg_sha1, 1465 .hash = &hash_alg_md5, 1477 .hash [all...] |
/linux-master/drivers/md/dm-vdo/ |
H A D | dedupe.c | 17 * Hash_locks are assigned to hash_zones by computing a modulus on the hash itself. Each hash_zone 49 * lock, releasing the hash_lock itself back to the hash zone (BYPASSING). 74 * on the hash zone thread. finish_locking() is called by (or continued via callback from) the 97 * to DEDUPE_CONTEXT_COMPLETE, and the associated data_vio will be enqueued to run back in the hash 224 /* The block hash covered by this lock */ 225 struct uds_record_name hash; member in struct:hash_lock 303 /* The hash zones themselves */ 329 "%s called on hash zone thread", name); 343 * return_hash_lock_to_pool() - (Re)initialize a hash lock and return it to its pool. 372 * hash_lock_key() - Return hash_lock's record name as a hash cod 867 acquire_lock(struct hash_zone *zone, const struct uds_record_name *hash, struct hash_lock *replace_lock, struct hash_lock **lock_ptr) argument 2722 u32 hash = name->name[0]; local [all...] |
/linux-master/net/core/ |
H A D | flow_dissector.c | 494 key->hash = skb_get_hash_raw(skb); 1739 * to have consistent hash within the two directions 1776 u32 hash; local 1780 hash = siphash(flow_keys_hash_start(keys), 1782 if (!hash) 1783 hash = 1; 1785 return hash; 1849 * __skb_get_hash: calculate a flow hash 1850 * @skb: sk_buff to calculate flow hash from 1852 * This function calculates a flow hash base 1860 u32 hash; local [all...] |
/linux-master/fs/ubifs/ |
H A D | sb.c | 91 u8 hash[UBIFS_HASH_ARR_SZ]; local 332 ubifs_node_calc_hash(c, ino, hash); 333 ubifs_copy_hash(c, hash, ubifs_branch_hash(c, br)); 339 ubifs_node_calc_hash(c, idx, hash); 340 ubifs_copy_hash(c, hash, mst->hash_root_idx); 570 ubifs_err(c, "superblock uses unknown hash algo %d",
|
/linux-master/net/tipc/ |
H A D | monitor.c | 67 * @hash: position in hashed lookup list 78 struct hlist_node hash; member in struct:tipc_peer 188 hlist_for_each_entry(peer, &mon->peers[thash], hash) { 368 hlist_del(&peer->hash); 404 hlist_add_head(&p->hash, &mon->peers[tipc_hashfn(addr)]); 697 hlist_del(&peer->hash);
|
/linux-master/drivers/net/hyperv/ |
H A D | hyperv_net.h | 89 /* This describes the hash function and type being enabled */ 100 /* The size of the hash secret key */ 1008 /* L4 hash bits for different protocols */ 1046 u32 l4_hash; /* L4 hash settings */ 1068 * packets. We can use ethtool to change UDP hash level when necessary. 1074 u32 hash, pkt_proto = 0; local 1104 hash = jhash2((u32 *)&flow.addrs.v4addrs, 2, hashrnd); 1106 hash = jhash2((u32 *)&flow.addrs.v6addrs, 8, hashrnd); 1110 __skb_set_sw_hash(skb, hash, false); 1113 return hash; [all...] |
/linux-master/drivers/vhost/ |
H A D | vsock.c | 51 struct hlist_node hash; member in struct:vhost_vsock 74 hash_for_each_possible_rcu(vhost_vsock_hash, vsock, hash, guest_cid) { 729 hash_del_rcu(&vsock->hash); 785 hash_del_rcu(&vsock->hash); 788 hash_add_rcu(vhost_vsock_hash, &vsock->hash, vsock->guest_cid);
|
/linux-master/drivers/net/xen-netback/ |
H A D | interface.c | 182 unsigned int size = vif->hash.size; 191 if (vif->hash.alg == XEN_NETIF_CTRL_HASH_ALGORITHM_NONE) 200 return vif->hash.mapping[vif->hash.mapping_sel] 248 /* If there is no hash algorithm configured then make sure there 249 * is no hash information in the socket buffer otherwise it 252 if (vif->hash.alg == XEN_NETIF_CTRL_HASH_ALGORITHM_NONE)
|
/linux-master/tools/testing/selftests/bpf/progs/ |
H A D | test_xdp_noinline.c | 528 __u32 *real_pos, hash, key; local 537 hash = get_packet_hash(pckt, hash_16bytes); 538 if (hash != 0x358459b7 /* jhash of ipv4 packet */ && 539 hash != 0x2f4bc6bb /* jhash of ipv6 packet */) 541 key = 2 * vip_info->vip_num + hash % 2;
|
/linux-master/drivers/crypto/marvell/cesa/ |
H A D | cesa.h | 5 #include <crypto/internal/hash.h> 214 * @mac_src_p: input pointer and total hash length 215 * @mac_digest: digest pointer and hash operation length 245 * struct mv_cesa_hash_op_ctx - hash or hmac operation context 249 * Context associated to an hash or hmac operation. 253 __le32 hash[8]; member in struct:mv_cesa_hash_op_ctx 267 struct mv_cesa_hash_op_ctx hash; member in union:mv_cesa_op_ctx::__anon217 373 * @ahash_algs: supported hash algorithms 374 * @nahash_algs: number of supported hash algorithms 391 * @cache_pool: data cache pool (used by hash implementatio [all...] |
/linux-master/arch/x86/crypto/ |
H A D | sha1_ssse3_asm.S | 17 * http://software.intel.com/en-us/articles/improving-the-performance-of-the-secure-hash-algorithm-1/ 244 .macro UPDATE_HASH hash, val 245 add \hash, \val 246 mov \val, \hash
|
H A D | sha1_avx2_x86_64_asm.S | 63 *and refer to improving-the-performance-of-the-secure-hash-algorithm-1/ 154 .macro UPDATE_HASH hash, val 155 add \hash, \val 156 mov \val, \hash
|
/linux-master/lib/zstd/compress/ |
H A D | zstd_lazy.c | 429 /* fill conventional hash table and conventional chain table */ 447 * in the hash cache bucket */ 487 /* move chain pointers into the last entry of each hash bucket */ 498 /* fill the buckets of the hash table */ 503 /* Shift hash cache down 1. */ 758 /* Constants for row-based hash */ 847 /* Note: prefetching more of the hash table does not appear to be beneficial for 128-entry rows */ 854 assert(ZSTD_isAligned(hashTable + relRow, 64)); /* prefetched hash row always 64-byte aligned */ 859 * Fill up the hash cache starting at idx, prefetching up to ZSTD_ROW_HASH_CACHE_SIZE entries, 873 U32 const hash local 896 { U32 const hash = cache[idx & ZSTD_ROW_HASH_CACHE_MASK]; local 917 U32 const hash = useCache ? ZSTD_row_nextCachedHash(ms->hashCache, hashTable, tagTable, base, updateStartIdx, hashLog, rowLog, mls) local 1183 U32 const hash = ZSTD_row_nextCachedHash(hashCache, hashTable, tagTable, base, curr, hashLog, rowLog, mls); local [all...] |