/drivers/gpu/drm/vmwgfx/ |
H A D | vmwgfx_cmdbuf_res.c | 42 * @hash: Hash entry for the manager hash table. 50 struct drm_hash_item hash; member in struct:vmw_cmdbuf_res 89 struct drm_hash_item *hash; local 93 ret = drm_ht_find_item(&man->resources, key, &hash); 98 (drm_hash_entry(hash, struct vmw_cmdbuf_res, hash)->res); 114 WARN_ON(drm_ht_remove_item(&man->resources, &entry->hash)); 175 &entry->hash); 197 * resource to the hash tabl 246 struct drm_hash_item *hash; local [all...] |
/drivers/gpu/drm/nouveau/core/core/ |
H A D | ramht.c | 31 u32 hash = 0; local 34 hash ^= (handle & ((1 << ramht->bits) - 1)); 38 hash ^= chid << (ramht->bits - 4); 39 hash = hash << 3; 40 return hash;
|
/drivers/net/wireless/brcm80211/brcmfmac/ |
H A D | flowring.c | 72 struct brcmf_flowring_hash *hash; local 94 hash = flow->hash; 96 if ((sta || (memcmp(hash[hash_idx].mac, mac, ETH_ALEN) == 0)) && 97 (hash[hash_idx].fifo == fifo) && 98 (hash[hash_idx].ifidx == ifidx)) { 105 return hash[hash_idx].flowid; 115 struct brcmf_flowring_hash *hash; local 137 hash = flow->hash; 430 struct brcmf_flowring_hash *hash; local [all...] |
/drivers/staging/lustre/lustre/include/ |
H A D | lustre_lite.h | 123 * Chain of hash overflow pages. 137 static inline unsigned long hash_x_index(__u64 hash, int hash64) argument 140 hash >>= 32; 141 /* save hash 0 as index 0 because otherwise we'll save it at 145 return ~0UL - (hash + !hash);
|
/drivers/gpu/drm/ |
H A D | drm_auth.c | 51 * Searches in drm_device::magiclist within all files with the same hash key 59 struct drm_hash_item *hash; local 63 if (!drm_ht_find_item(&master->magiclist, (unsigned long)magic, &hash)) { 64 pt = drm_hash_entry(hash, struct drm_magic_entry, hash_item); 79 * associated the magic number hash key in drm_device::magiclist, while holding 109 * number hash key, while holding the drm_device::struct_mutex lock. 114 struct drm_hash_item *hash; local 120 if (drm_ht_find_item(&master->magiclist, (unsigned long)magic, &hash)) { 124 pt = drm_hash_entry(hash, struct drm_magic_entry, hash_item); 125 drm_ht_remove_item(&master->magiclist, hash); [all...] |
/drivers/staging/lustre/lustre/llite/ |
H A D | remote_perm.c | 82 struct hlist_head *hash; local 85 OBD_SLAB_ALLOC_GFP(hash, ll_rmtperm_hash_cachep, 86 REMOTE_PERM_HASHSIZE * sizeof(*hash), 88 if (!hash) 92 INIT_HLIST_HEAD(hash + i); 94 return hash; 97 void free_rmtperm_hash(struct hlist_head *hash) argument 103 if (!hash) 107 hlist_for_each_entry_safe(lrp, next, hash + i, 110 OBD_SLAB_FREE(hash, ll_rmtperm_hash_cache [all...] |
/drivers/gpu/drm/ttm/ |
H A D | ttm_object.c | 50 * ref_hash hash tables. 80 * @object_lock: lock that protects the object_hash hash table. 82 * @object_hash: hash table for fast lookup of object global names. 102 * @hash: Hash entry for the per-file object reference hash. 112 * This is similar to an idr object, but it also has a hash table entry 122 struct drm_hash_item hash; member in struct:ttm_ref_object 176 &base->hash, 191 (void)drm_ht_remove_item_rcu(&tdev->object_hash, &base->hash); 205 (void)drm_ht_remove_item_rcu(&tdev->object_hash, &base->hash); 233 struct drm_hash_item *hash; local 255 struct drm_hash_item *hash; local 287 struct drm_hash_item *hash; local 325 struct drm_hash_item *hash; local 415 struct drm_hash_item *hash; local [all...] |
/drivers/staging/lustre/lnet/lnet/ |
H A D | peer.c | 47 struct list_head *hash; local 61 LIBCFS_CPT_ALLOC(hash, lnet_cpt_table(), i, 62 LNET_PEER_HASH_SIZE * sizeof(*hash)); 63 if (hash == NULL) { 64 CERROR("Failed to create peer hash table\n"); 70 INIT_LIST_HEAD(&hash[j]); 71 ptable->pt_hash = hash; /* sign of initialization */ 81 struct list_head *hash; local 89 hash = ptable->pt_hash; 90 if (hash [all...] |
/drivers/staging/lustre/lustre/fld/ |
H A D | lproc_fld.c | 94 struct lu_fld_hash *hash = NULL; local 105 hash = &fld_hash[i]; 110 if (hash != NULL) { 112 fld->lcf_hash = hash; 115 CDEBUG(D_INFO, "%s: Changed hash to \"%s\"\n", 116 fld->lcf_name, hash->fh_name); 161 { "hash", &fld_proc_hash_fops },
|
H A D | fld_request.c | 122 int hash; local 126 * hash again, and also if other MDTs is not being connected, 130 hash = fld_rrb_hash(fld, seq); 132 hash = 0; 135 if (target->ft_idx == hash) 139 CERROR("%s: Can't find target by hash %d (seq %#llx). Targets (%d):\n", 140 fld->lcf_name, hash, seq, fld->lcf_count); 326 static inline int hash_is_sane(int hash) argument 328 return (hash >= 0 && hash < ARRAY_SIZ 331 fld_client_init(struct lu_client_fld *fld, const char *prefix, int hash) argument [all...] |
/drivers/md/ |
H A D | dm-cache-policy-cleaner.c | 12 #include <linux/hash.h> 32 struct hash { struct 53 struct hash chash; 83 static int alloc_hash(struct hash *hash, unsigned elts) argument 85 hash->nr_buckets = next_power(elts >> 4, 16); 86 hash->hash_bits = ffs(hash->nr_buckets) - 1; 87 hash->table = vzalloc(sizeof(*hash 92 free_hash(struct hash *hash) argument 142 struct hash *hash = &p->chash; local [all...] |
/drivers/base/power/ |
H A D | trace.c | 60 * a case where we have a hash collision, and we end up not 130 * This is just the sdbm hash function with a user-supplied 150 * section instead. Generating a hash of the data gives us a 153 * likely not give totally bogus reports - if the hash matches, 180 unsigned int hash = hash_string(lineno, file, FILEHASH); local 181 if (hash != value) 183 pr_info(" hash matches %s:%u\n", file, lineno); 198 unsigned int hash = hash_string(DEVSEED, dev_name(dev), DEVHASH); local 199 if (hash == value) { 200 dev_info(dev, "hash matche 225 unsigned int hash = hash_string(DEVSEED, dev_name(dev), local [all...] |
/drivers/net/team/ |
H A D | team_mode_loadbalance.c | 27 #define LB_TX_HASHTABLE_SIZE 256 /* hash is a char */ 82 #define LB_HTPM_PORT_BY_HASH(lp_priv, hash) \ 83 (lb_priv)->ex->tx_hash_to_port_mapping[hash].port 85 #define LB_HTPM_OPT_INST_INFO_BY_HASH(lp_priv, hash) \ 86 (lb_priv)->ex->tx_hash_to_port_mapping[hash].opt_inst_info 109 /* Basic tx selection based solely by hash */ 113 unsigned char hash) 115 int port_index = team_num_to_port_index(team, hash); 124 unsigned char hash) 126 return rcu_dereference_bh(LB_HTPM_PORT_BY_HASH(lb_priv, hash)); 110 lb_hash_select_tx_port(struct team *team, struct lb_priv *lb_priv, struct sk_buff *skb, unsigned char hash) argument 121 lb_htpm_select_tx_port(struct team *team, struct lb_priv *lb_priv, struct sk_buff *skb, unsigned char hash) argument 189 lb_update_tx_stats(unsigned int tx_bytes, struct lb_priv *lb_priv, struct lb_port_priv *lb_port_priv, unsigned char hash) argument 211 unsigned char hash; local 338 unsigned char hash = info->array_index; local 349 unsigned char hash = ctx->info->array_index; local 361 unsigned char hash = ctx->info->array_index; local 378 unsigned char hash = info->array_index; local 387 unsigned char hash = ctx->info->array_index; local [all...] |
/drivers/staging/lustre/lustre/obdclass/ |
H A D | capa.c | 63 /* lock for capa hash/capa_list/fo_capa_keys */ 87 struct hlist_head *hash; local 90 OBD_ALLOC(hash, PAGE_CACHE_SIZE); 91 if (!hash) 98 INIT_HLIST_HEAD(hash + i); 99 return hash; 118 void cleanup_capa_hash(struct hlist_head *hash) argument 126 hlist_for_each_entry_safe(oc, next, hash + i, 132 OBD_FREE(hash, PAGE_CACHE_SIZE); 193 struct obd_capa *capa_add(struct hlist_head *hash, struc argument 224 capa_lookup(struct hlist_head *hash, struct lustre_capa *capa, int alive) argument [all...] |
/drivers/staging/lustre/lustre/include/linux/ |
H A D | lustre_patchless_compat.h | 44 #include <linux/hash.h>
|
/drivers/staging/lustre/lustre/libcfs/linux/ |
H A D | linux-crypto-adler.c | 34 #include <crypto/internal/hash.h> 54 static int adler32_setkey(struct crypto_shash *hash, const u8 *key, argument 57 u32 *mctx = crypto_shash_ctx(hash); 60 crypto_shash_set_flags(hash, CRYPTO_TFM_RES_BAD_KEY_LEN);
|
H A D | linux-crypto.c | 35 * Array of hash algorithm speed in MByte per second 51 CWARN("Unsupported hash algorithm id = %d, max id is %d\n", 61 CDEBUG(D_INFO, "Failed to alloc crypto hash %s\n", 87 CDEBUG(D_INFO, "Using crypto hash: %s (%s) speed %d MB/s\n", 98 unsigned char *hash, unsigned int *hash_len) 112 if (hash == NULL || *hash_len < type->cht_size) { 120 err = crypto_hash_digest(&hdesc, &sl, sl.length, hash); 176 unsigned char *hash, unsigned int *hash_len) 186 if (hash == NULL || *hash_len < size) { 190 err = crypto_hash_final((struct hash_desc *) hdesc, hash); 95 cfs_crypto_hash_digest(unsigned char alg_id, const void *buf, unsigned int buf_len, unsigned char *key, unsigned int key_len, unsigned char *hash, unsigned int *hash_len) argument 175 cfs_crypto_hash_final(struct cfs_crypto_hash_desc *hdesc, unsigned char *hash, unsigned int *hash_len) argument 209 unsigned char hash[64]; local [all...] |
/drivers/crypto/caam/ |
H A D | compat.h | 14 #include <linux/hash.h> 38 #include <crypto/internal/hash.h>
|
/drivers/staging/lustre/include/linux/libcfs/ |
H A D | libcfs_crypto.h | 32 char *cht_name; /**< hash algorithm name, equal to 36 unsigned int cht_size; /**< hash digest size */ 64 /** Return pointer to type of hash for valid hash algorithm identifier */ 78 /** Return hash name for valid hash algorithm identifier or "unknown" */ 100 /** Return hash identifier for valid hash algorithm name or 0xFF */ 111 /** Calculate hash digest for buffer. 112 * @param alg id of hash algorith [all...] |
/drivers/target/tcm_fc/ |
H A D | tfc_sess.c | 30 #include <linux/hash.h> 83 INIT_HLIST_HEAD(&tport->hash[i]); 166 * Sessions and hash lists are RCU-protected. 180 head = &tport->hash[ft_sess_hash(port_id)]; 181 hlist_for_each_entry_rcu(sess, head, hash) { 196 * Allocate session and enter it in the hash for the local port. 205 head = &tport->hash[ft_sess_hash(port_id)]; 206 hlist_for_each_entry_rcu(sess, head, hash) 225 hlist_add_head_rcu(&sess->hash, head); 243 hlist_del_rcu(&sess->hash); [all...] |
/drivers/misc/ |
H A D | uid_cputime.c | 43 struct hlist_node hash; member in struct:uid_entry 49 hash_for_each_possible(hash_table, uid_entry, hash, uid) { 70 hash_add(hash_table, &uid_entry->hash, uid); 85 hash_for_each(hash_table, bkt, uid_entry, hash) { 115 hash_for_each(hash_table, bkt, uid_entry, hash) { 182 hash, uid_start) { 183 hash_del(&uid_entry->hash);
|
/drivers/infiniband/hw/mthca/ |
H A D | mthca_mcg.c | 54 * If GID is found in MGM or MGM is empty, *index = *hash, *prev = -1 58 * previous entry in hash chain and *mgm holds AMGM entry. 61 * entry in hash chain and *mgm holds end of hash chain. 65 u16 *hash, int *prev, int *index) 79 err = mthca_MGID_HASH(dev, mailbox, hash); 86 mthca_dbg(dev, "Hash for %pI6 is %04x\n", gid, *hash); 88 *index = *hash; 99 if (*index != *hash) { 125 u16 hash; local 63 find_mgm(struct mthca_dev *dev, u8 *gid, struct mthca_mailbox *mgm_mailbox, u16 *hash, int *prev, int *index) argument 219 u16 hash; local [all...] |
/drivers/staging/skein/ |
H A D | skein_api.c | 56 * If size is the same and hash bit length is zero then reuse 221 int skein_final(struct skein_ctx *ctx, u8 *hash) argument 229 ret = skein_256_final(&ctx->m.s256, (u8 *)hash); 232 ret = skein_512_final(&ctx->m.s512, (u8 *)hash); 235 ret = skein_1024_final(&ctx->m.s1024, (u8 *)hash);
|
H A D | skein_api.h | 50 * struct skein_ctx ctx; // a Skein hash or MAC context 55 * // Initialize the context to set the requested hash length in bits 56 * // here request a output hash size of 31 bits (Skein supports variable 64 * // Now get the result of the Skein hash. The output buffer must be 72 * it for creation of another hash with the same Skein state size and output 137 * Number of MAC hash bits to compute 172 * Number of MAC hash bits to compute 195 * Update the hash with a message bit string. 211 * Finalize Skein and return the hash. 218 * @param hash [all...] |
/drivers/net/ethernet/chelsio/cxgb3/ |
H A D | l2t.c | 237 * presently in the hash table. We need to remove it. 240 int hash = arp_hash(e->addr, e->ifindex, d); local 242 for (p = &d->l2tab[hash].first; *p; p = &(*p)->next) 253 * Called when an L2T entry has no more users. The entry is left in the hash 308 int hash; local 330 hash = arp_hash(addr, ifidx, d); 333 for (e = d->l2tab[hash].first; e; e = e->next) 346 e->next = d->l2tab[hash].first; 347 d->l2tab[hash].first = e; 405 int hash local [all...] |