Searched refs:hash (Results 51 - 75 of 175) sorted by relevance

1234567

/drivers/pcmcia/
H A Dds.c50 u32 hash; local
61 hash = crc32(0, did->prod_id[i], strlen(did->prod_id[i]));
62 if (hash == did->prod_id_hash[i])
65 printk(KERN_DEBUG "pcmcia: %s: invalid hash for "
68 did->prod_id_hash[i], hash);
927 u32 hash[4] = { 0, 0, 0, 0}; local
938 hash[i] = crc32(0, p_dev->prod_id[i], strlen(p_dev->prod_id[i]));
954 hash[0],
955 hash[1],
956 hash[
1068 u32 hash[4] = { 0, 0, 0, 0}; local
[all...]
/drivers/staging/lustre/lustre/llite/
H A Dllite_nfs.c92 unsigned long hash = cl_fid_build_ino(fid, local
97 CDEBUG(D_INFO, "searching inode for:(%lu,"DFID")\n", hash, PFID(fid));
99 inode = ilookup5(sb, hash, ll_nfs_test_inode, (void *)fid);
211 loff_t hash, u64 ino, unsigned type)
210 ll_nfs_get_name_filldir(void *cookie, const char *name, int namelen, loff_t hash, u64 ino, unsigned type) argument
H A Dstatahead.c65 /* link into sai hash table locally */
110 * Insert entry to hash SA table.
115 int i = ll_sa_entry_hash(entry->se_qstr.hash);
128 int i = ll_sa_entry_hash(entry->se_qstr.hash);
220 * lockless hash lookup (only the scanner can remove entry from hash
243 entry->se_qstr.hash = full_name_hash(name, len);
262 * Only the caller can remove the entry from hash, so it is unnecessary to hold
263 * hash lock. It is caller's duty to release the init refcount on the entry, so
270 int i = ll_sa_entry_hash(qstr->hash);
1103 __u64 hash; local
1388 __u64 hash; local
[all...]
/drivers/staging/lustre/lnet/lnet/
H A Drouter_proc.c56 * bits for peer hash offset
63 /* bits for hash index + position */
65 /* bits for peer hash table + hash version */
85 #define LNET_PROC_POS_MAKE(cpt, ver, hash, off) \
88 ((((loff_t)(hash)) & LNET_PROC_HASH_MASK) << LNET_PROC_HOFF_BITS) | \
437 int hash = LNET_PROC_HASH_GET(*ppos); local
487 while (hash < LNET_PEER_HASH_SIZE) {
489 p = ptable->pt_hash[hash].next;
491 while (p != &ptable->pt_hash[hash]) {
[all...]
H A Dapi-ni.c61 MODULE_PARM_DESC(rnet_htable_size, "size of remote network hash table");
110 struct list_head *hash; local
114 LIBCFS_ALLOC(hash, LNET_REMOTE_NETS_HASH_SIZE * sizeof(*hash));
115 if (hash == NULL) {
116 CERROR("Failed to create remote nets hash table\n");
121 INIT_LIST_HEAD(&hash[i]);
122 the_lnet.ln_remote_nets_hash = hash;
512 /* Arbitrary choice of hash table size */
576 unsigned int hash; local
597 unsigned int hash; local
[all...]
/drivers/staging/lustre/lustre/include/
H A Dlustre_capa.h77 struct hlist_node c_hash; /* link to capa hash */
183 void cleanup_capa_hash(struct hlist_head *hash);
185 struct obd_capa *capa_add(struct hlist_head *hash,
187 struct obd_capa *capa_lookup(struct hlist_head *hash,
/drivers/md/
H A Draid5.c88 int hash = (sect >> STRIPE_SHIFT) & HASH_MASK; local
89 return &conf->stripe_hashtbl[hash];
97 static inline void lock_device_hash_lock(struct r5conf *conf, int hash) argument
99 spin_lock_irq(conf->hash_locks + hash);
103 static inline void unlock_device_hash_lock(struct r5conf *conf, int hash) argument
106 spin_unlock_irq(conf->hash_locks + hash);
338 * @hash could be NR_STRIPE_HASH_LOCKS, then we have a list of inactive_list
342 * only takes hash lock.
346 int hash)
352 if (hash
344 release_inactive_stripe_list(struct r5conf *conf, struct list_head *temp_inactive_list, int hash) argument
395 int hash; local
420 int hash; local
467 get_free_stripe(struct r5conf *conf, int hash) argument
662 int hash = stripe_hash_locks_hash(sector); local
1708 grow_one_stripe(struct r5conf *conf, int hash) argument
1737 int hash; local
1819 int hash, cnt; local
1943 drop_one_stripe(struct r5conf *conf, int hash) argument
1961 int hash; local
4068 int hash; local
4424 int hash; local
5145 int i, batch_size = 0, hash; local
5303 int hash; local
[all...]
H A Draid5.h90 * stripe is also (potentially) linked to a hash bucket in the hash
95 * The inactive_list, handle_list and hash bucket lists are all protected by the
110 * lockdev check-hash unlink-stripe cnt++ clean-stripe hash-stripe unlockdev
112 * lockdev check-hash if(!cnt++)unlink-stripe unlockdev
198 struct hlist_node hash; member in struct:stripe_head
395 /* only protect corresponding hash list and inactive_list */
/drivers/net/hyperv/
H A Dnetvsc_drv.c161 /* Toeplitz hash function
191 static bool netvsc_set_hash(u32 *hash, struct sk_buff *skb) argument
204 *hash = comp_hash(netvsc_hash_key, HASH_KEYLEN, &flow, data_len);
215 u32 hash; local
221 if (netvsc_set_hash(&hash, skb)) {
222 q_idx = nvsc_dev->send_table[hash % VRSS_SEND_TAB_SIZE] %
224 skb_set_hash(skb, hash, PKT_HASH_TYPE_L3);
383 u32 hash; local
443 hash = skb_get_hash_raw(skb);
444 if (hash !
[all...]
/drivers/net/wireless/zd1211rw/
H A Dzd_chip.h439 /* Group hash table for filtering incoming packets.
441 * The group hash table is 64 bit large and split over two parts. The first
443 * address are used as index. Packets are received if the hash table bit is
954 static inline void zd_mc_clear(struct zd_mc_hash *hash) argument
956 hash->low = 0;
958 * The hash of the broadcast address ff:ff:ff:ff:ff:ff is 63.
960 hash->high = 0x80000000;
963 static inline void zd_mc_add_all(struct zd_mc_hash *hash) argument
965 hash->low = hash
968 zd_mc_add_addr(struct zd_mc_hash *hash, u8 *addr) argument
[all...]
H A Dzd_mac.c277 struct zd_mc_hash hash; local
278 zd_mc_clear(&hash);
279 return zd_chip_set_multicast_hash(&mac->chip, &hash);
309 /* Wait after setting the multicast hash table and powering on
1219 struct zd_mc_hash hash; local
1222 zd_mc_clear(&hash);
1226 zd_mc_add_addr(&hash, ha->addr);
1229 return hash.low | ((u64)hash.high << 32);
1240 struct zd_mc_hash hash local
[all...]
/drivers/staging/lustre/lustre/ptlrpc/
H A Dsec_plain.c202 phdr->ph_bulk_hash_alg = req->rq_flvr.u_bulk.hash.hash_alg;
246 if (phdr->ph_bulk_hash_alg != req->rq_flvr.u_bulk.hash.hash_alg) {
248 req->rq_flvr.u_bulk.hash.hash_alg);
313 rc = plain_generate_bulk_csum(desc, req->rq_flvr.u_bulk.hash.hash_alg,
323 req->rq_flvr.u_bulk.hash.hash_alg != BULK_HASH_ALG_NULL)
362 rc = plain_verify_bulk_csum(desc, req->rq_flvr.u_bulk.hash.hash_alg,
747 CERROR("invalid hash algorithm: %u\n", phdr->ph_bulk_hash_alg);
752 req->rq_flvr.u_bulk.hash.hash_alg = phdr->ph_bulk_hash_alg;
855 phdr->ph_bulk_hash_alg = req->rq_flvr.u_bulk.hash.hash_alg;
904 rc = plain_verify_bulk_csum(desc, req->rq_flvr.u_bulk.hash
[all...]
H A Dsec_config.c122 flvr->u_bulk.hash.hash_alg = BULK_HASH_ALG_ADLER32;
125 * format: plain-hash:<hash_alg>
132 if (strcmp(bulk, "hash"))
135 flvr->u_bulk.hash.hash_alg = sptlrpc_get_hash_alg(alg);
136 if (flvr->u_bulk.hash.hash_alg >= BULK_HASH_ALG_MAX)
140 if (flvr->u_bulk.hash.hash_alg == BULK_HASH_ALG_NULL)
/drivers/gpu/drm/nouveau/core/engine/graph/fuc/
H A Dmacros.fuc194 #define hash #
197 #define call(a) call fn(hash)a
199 #define call(a) lcall fn(hash)a
/drivers/staging/lustre/include/linux/libcfs/
H A Dlibcfs_hash.h66 #include <linux/hash.h>
70 /** record hash depth and output to console when it's too deep,
90 * - array of hash-head starting from hsb_head[0], hash-head can be one of
96 * - some extra bytes (caller can require it while creating hash)
104 long hsb_head[0]; /**< hash-head array */
123 * common hash attributes.
135 /** no bucket lock, use one spinlock to protect the whole hash */
143 /** hash-table doesn't have refcount on item */
151 /** Enable dynamic hash resizin
[all...]
/drivers/staging/lustre/lustre/ldlm/
H A Dldlm_resource.c410 __u32 hash; local
417 hash = fid_flatten32(&fid);
418 hash += (hash >> 4) + (hash << 12); /* mixing oid and seq */
421 hash += (val >> 5) + (val << 11);
425 hash = hash_long(hash, hs->hs_bkt_bits);
427 hash -= hash_long((unsigned long)hs, val % 11 + 3);
429 hash <<
[all...]
/drivers/crypto/qce/
H A Dcommon.h20 #include <crypto/hash.h>
43 /* hash and hmac algorithms */
/drivers/s390/block/
H A Ddasd_devmap.c98 int hash, i; local
100 hash = 0;
102 hash += *bus_id;
103 return hash & 0xff;
411 int hash; local
418 hash = dasd_hash_busid(bus_id);
419 list_for_each_entry(tmp, &dasd_hashlists[hash], list)
430 list_add(&new->list, &dasd_hashlists[hash]);
446 int hash; local
450 hash
[all...]
/drivers/net/ethernet/chelsio/cxgb3/
H A Dxgmac.c286 /* Calculate the RX hash filter index of an Ethernet address */
289 int hash = 0, octet, bit, i = 0, c; local
293 hash ^= (c & 1) << i;
297 return hash;
323 int hash = hash_hw_addr(ha->addr); local
325 if (hash < 32)
326 hash_lo |= (1 << hash);
328 hash_hi |= (1 << (hash - 32));
/drivers/staging/lustre/lustre/obdclass/
H A Ddt_object.c676 /* add hash if the client wants it */
683 __u64 hash; local
685 /* fetch 64-bit hash value */
686 hash = iops->store(env, it);
687 ii->ii_hash_end = hash;
705 /* client wants to the 64-bit hash value associated with
707 memcpy(tmp_entry, &hash, sizeof(hash));
708 tmp_entry += sizeof(hash);
723 /* hash/ke
[all...]
H A Dlu_object.c136 * from hash table and LRU.
138 * This is done with hash table and LRU lists locked. As the only
140 * object is through hash-table lookup (lu_object_find()),
141 * or LRU scanning (lu_site_purge()), that are done under hash-table
149 * Object was already removed from hash and lru above, can
330 * the dispose list, removing them from LRU and hash table.
481 hlist_unhashed(&hdr->loh_hash) ? "" : " hash",
845 * Return desired hash table order.
853 * Calculate hash table size, assuming that we want reasonable
889 __u32 hash; local
[all...]
/drivers/crypto/ux500/hash/
H A Dhash_core.c31 #include <crypto/internal/hash.h>
91 * @device_data: Structure for the hash device.
103 * release_hash_device - Releases a previously allocated hash device.
104 * @device_data: Structure for the hash device.
226 * @device_data: Structure for the hash device.
281 "%s: Continue hash calculation, since hmac key available\n",
292 * @device_data: Structure for the hash device.
329 * @device_data: Structure for the hash device.
372 * hash_get_device_data - Checks for an available hash device and return it.
373 * @hash_ctx: Structure for the hash contex
1492 struct ahash_alg hash; member in struct:hash_algo_template
[all...]
/drivers/crypto/ccp/
H A Dccp-crypto.h25 #include <crypto/hash.h>
/drivers/gpu/drm/
H A Ddrm_hashtab.c29 * Simple open hash tab implementation.
37 #include <linux/hash.h>
52 DRM_ERROR("Out of memory for hash table\n");
/drivers/misc/vmw_vmci/
H A Dvmci_resource.c17 #include <linux/hash.h>
43 * Gets a resource (if one exists) matching given handle from the hash table.
149 /* Remove resource from hash table. */
201 /* Verify the resource has been unlinked from hash table */
211 * can increment the count again (it's gone from the resource hash

Completed in 1612 milliseconds

1234567